Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A regular link diagram admits a normalized height realization

Statement

Assume countable choice. Let D be a finite regular oriented diagram of a nonempty labeled smooth link L⊂R3, and assume every component has at least one underpassing point. Then L is ambient isotopic through links with the same projection and crossing data to a smooth height realization L^={(γi(s),η^i(s)):s∈S1, 1≤i≤r}⊂R2×[−1,0] such that η^i(s)=−1 exactly at the underpassing parameters on component i and η^i(s)>−1 at every other parameter.

Facts & Assumptions

Given: Countable choice, a finite regular oriented diagram, its smooth embedded realization, and at least one underpassing parameter on each component.

[A1]

Countable choice, written ACω, is The Axiom of Countable Choice (ACω).

[F1]

A regular oriented diagram has a fixed planar projection which is an immersion with finitely many transverse double points and records which branch is over at each point. Regular oriented link diagrams

[F2]

A smooth isotopy of a compact embedded link in a boundaryless smooth 3-manifold, constant near both ends of the time interval, extends to an ambient isotopy supported in any prescribed open neighborhood of its track under countable choice. A smooth isotopy of a compact manifold extends to an ambient isotopy, The Axiom of Countable Choice (ACω)

Proof

Given: The diagram, its initial height functions, and [A1].

1.1A1F1givenconstructconstruct

Parameterize component i by S1=R/Z, and let Ui={ui,1,…,ui,mi} be its nonempty finite set of underpassing parameters. Define pi(s)=∏a=1mi(1−cos⁡(2π(s−ui,a))). Every factor is smooth and nonnegative, and it vanishes exactly when s=ui,a in S1. Thus pi is smooth, vanishes exactly on Ui, and is positive somewhere because a finite subset does not exhaust S1. Its maximum Pi is positive by compactness. Set η^i(s)=−1+pi(s)/Pi. Then −1≤η^i≤0, equality at −1 holds exactly on Ui, and all other heights are greater than −1.

2.1A1F1givenstep 1.1algebra

At every projected double point, the overpassing parameter is not an underpassing parameter: regularity excludes triple points, so the two source parameters at that double point have distinct over/under roles. Hence the new height difference between the over and under branches is strictly positive. Let ηi be the original height function and choose a smooth φ:[0,1]→[0,1] equal to 0 near 0 and 1 near 1. The family Ft(i,s)=(γi(s),(1−φ(t))ηi(s)+φ(t)η^i(s)) is smooth and stationary near both endpoints. At each crossing its over-minus- under height is a convex combination of two positive numbers, so it remains positive. Since [F1] lists all projected multiple points, each Ft is injective; its projection remains an immersion, so each compact-source map is a smooth embedding.

3.1A1F2step 2.1chooseconstruct∎

The track of the isotopy in step 2.1 is compact, so choose an open ball containing it and apply [F2] with that ball as the support neighborhood. The resulting ambient isotopy of R3 has compact support and therefore extends by the identity at ∞ to an ambient isotopy of S3. It carries the original link to L^ and fixes the planar projection and over/under data throughout, because every slice of F has those same data. This proves the stated normalized realization.

Depends on

Used by

Dependency tree · two levels

18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources