Alphabeta Math
Pipeline-generated
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.

Bridge presentations and unknotting number

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Every smooth knot has a Morse representative for the fixed height

Statement

Identify the oriented standard S3 with the unit sphere in R4 and fix h(x1,x2,x3,x4)=x4. For every smooth oriented knot K⊂S3, there is an orientation-preserving ambient isotopy carrying K to a smooth knot K′ for which h∣K′ has only nondegenerate critical points.

Facts & Assumptions

Given: A smooth oriented knot K⊂S3 and the fixed height h(x)=x4 under the standard identification S3⊂R4.

[F1]

For a compact embedded smooth manifold M⊂RN, a generic direction u∈SN−1 makes x↦u⋅x a Morse function on M. For a compact manifold embedded in Euclidean space, the restricted linear height is Morse for generic directions

Proof

Given: The smooth oriented knot K and the fixed height in the statement.

1.1givenF1choose

Regard K as a compact embedded smooth 1-manifold in S3⊂R4. By [F1], the exceptional set E of non-Morse directions is null in every smooth atlas of S3. It cannot contain all of S3, since a nonempty coordinate ball has positive Euclidean measure; choose u∈S3∖E. Then x↦u⋅x is Morse on K.

2.1givenstep 1.1construct∎

Choose R∈SO(4) with RTe4=u. Such a rotation is obtained in the plane spanned by u and e4; if u=−e4, use a half-turn in a plane containing e4. A rotation path Rt from the identity to R is an ambient isotopy of the oriented sphere. On R(K), the fixed height equals e4⋅Rx=u⋅x, which is Morse by step 1.1. Thus K′=R(K) is the required representative.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

An arc with one height extremum is boundary-parallel

Statement

Assume the Axiom of Countable Choice. On the unit sphere S3⊂R4 with height h(x1,x2,x3,x4)=x4, let c be a regular value and let a be a smooth properly embedded arc in the upper ball B+={x4≥c}, with endpoints on Sc={x4=c}, such that h∣a has exactly one nondegenerate interior maximum and no other critical point. For every simple smooth arc β⊂Sc joining those endpoints, there is an embedded disk in B+ with boundary a∪β. The corresponding statement for one nondegenerate minimum in the lower ball B−={x4≤c} also holds.

Facts & Assumptions

Given: ACω, the standard coordinate height on the unit S3⊂R4, a regular level sphere Sc, the upper ball B+={x4≥c}, a smooth proper arc a⊂B+ with one nondegenerate maximum and endpoints on Sc, and a simple arc β⊂Sc with the same endpoints.

[A1]

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

[F1]

The regular level spheres of h are explicitly identified by Φr:S2→Sr, Φr(v)=(1−r2 v,r) for −1<r<1.

[F2]

Under ACω, a smooth isotopy of embeddings of a compact source into a boundaryless manifold extends to an ambient isotopy. The isotopy extension theorem

Proof

Given: The upper-ball arc and the hypotheses in the statement.

1.1givenF1construct

Let m be the unique maximum. The two components of a∖{m} are strictly monotone in height, so each intermediate regular level meets a in exactly two points. In a Morse chart on a near m, the height is h(m)−t2; a short level arc joining the two nearby points and the subarc through m bound a small embedded cap disk. Under [F1], the two points on all lower regular levels form a smooth path of distinct ordered pairs in S2.

2.1A1F2step 1.1construct

Apply [F2] to the two-point isotopy of step 1.1, starting at the cap level. The extended sphere isotopy transports the short cap arc through simple arcs on the intervening levels. Their union is an embedded strip because distinct levels are disjoint; adjoining the cap disk gives an embedded disk with boundary a∪β0 for a simple arc β0⊂Sc.

3.1A1F2step 1.1step 2.1construct∎

Let γ0 be the initial cap arc on the reference S2, and let fr be the ambient isotopy from [F2] carrying its endpoint pair to the two intersection points on level Sr. The arc fc−1(β) is a simple arc with the same endpoints as γ0. Bigon elimination gives an isotopy gt of S2, fixed at those endpoints, with g1(γ0)=fc−1(β). Precompose the transported cap arc by gλ(r) before applying fr, where λ is zero near the cap level and increases smoothly to 1 at r=c. Every gt fixes the reference endpoints, so the joining arcs still have the required endpoint tracks; at r=c the joining arc is exactly β. The union of this family with the cap disk is therefore an embedded disk bounded by a∪β. Reversing height proves the lower-ball statement.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

A rank-one Hermitian perturbation changes signature by at most two

Statement

Let A and B be Hermitian forms on the same finite-dimensional complex vector space, and suppose that the linear map representing A−B has rank at most one. Then ∣sign⁡(A)−sign⁡(B)∣≤2, where the signature is the number of positive eigenvalues minus the number of negative eigenvalues, with multiplicity and with zero eigenvalues omitted.

Facts & Assumptions

Given: Hermitian forms A and B on the same finite-dimensional complex vector space, with rank⁡(A−B)≤1.

[F1]

For a Hermitian form Q, its positive index n+(Q) is the largest dimension of a subspace on which Q(v,v)>0 for every nonzero v; its negative index n−(Q) is defined using Q(v,v)<0. Its signature is n+(Q)−n−(Q).

Proof

1.1givenF1algebra

Let W=ker⁡(A−B). Rank-nullity and the rank hypothesis give codim⁡W≤1. If P is a positive subspace for A of dimension n+(A), then dim⁡(P∩W)≥n+(A)−1. On P∩W the forms agree, so this intersection is positive for B. Thus n+(B)≥n+(A)−1. Interchanging A and B proves ∣n+(A)−n+(B)∣≤1.

2.1F1step 1.1algebra∎

Apply the same argument to −A and −B to obtain ∣n−(A)−n−(B)∣≤1. Therefore ∣sign⁡(A)−sign⁡(B)∣≤∣n+(A)−n+(B)∣+∣n−(A)−n−(B)∣≤2.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Descending-diagram crossing-change sequence

Definition

Input a valid finite planar code for one regular oriented knot diagram and a basepoint in the interior of an edge, away from every crossing and bend. Traverse the oriented code once starting at the basepoint. At each crossing, consider the first branch reached by this traversal. If that branch is under, record the crossing and exchange its over/under label; otherwise leave the crossing unchanged. Return the finite list of recorded crossing changes and the updated planar code. For a code with no crossings, return the empty list and the unchanged code. The input is the valid finite code defined for an oriented knot diagram; this procedure has no invalid-input branch.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Every regular knot projection admits a finite rational planar code

Statement

Assume the Axiom of Countable Choice. Every smooth oriented knot in S3 has an admissible finite planar code whose rational polygonal drawing certificate represents a regular oriented diagram of that knot.

Facts & Assumptions

Given: The Axiom of Countable Choice and a smooth oriented knot K⊂S3.

[A1]

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

[F1]

Under ACω, a smooth oriented link contained in R3 admits a regular orthogonal projection; the projection has finitely many transverse double points and no triple points. Existence of regular projections

[F2]

A finite planar code records a rational polygonal path for every edge, exact incidence and over/under data, transverse crossing vertices, and one oriented component. Finite planar codes for oriented knot diagrams

[F3]

Regularity is the condition that the projected knot is an immersion with only finitely many transverse double points and no higher multiple points. Regular oriented link diagrams

[F4]

An isotopy of embeddings of a compact circle extends to an ambient isotopy under ACω. Oriented links in the three-sphere and ambient isotopy, The isotopy extension theorem

Proof

Given: ACω and a smooth oriented knot K⊂S3.

1.1A1F1F3givenconstruct

A smooth embedded circle has empty interior in S3: in every submanifold chart it is a coordinate line, which contains no open three-dimensional ball. Choose p∈S3∖K. Choose an orientation-preserving rotation R∈SO(4) carrying p to the fixed point at infinity; a rotation path from the identity to R restricts to an ambient isotopy of S3. Thus R(K) misses infinity, and stereographic coordinates regard it as a compact smooth oriented knot in R3. Apply [F1] to this representative and list the finitely many crossings of the resulting projection. Around each crossing choose a closed disk meeting the image in exactly two transverse arcs, with all such disks pairwise disjoint. Subdivide the remaining compact arcs into finitely many subarcs contained in planar coordinate disks where each arc is a graph over a line interval and where nonincident pieces are separated. Compactness and finiteness give a positive minimum for the separations between the disjoint pieces.

2.1F2step 1.1construct

In each crossing disk, choose a nearby rational point q and move the crossing there by a small planar isotopy supported in that disk. Choose two linearly independent rational direction vectors close to the two tangent directions there. Small rational multiples in both signs give four rational endpoints about q, in the same cyclic order as the branch germs. Replace the branches near q by the two straight diameters through these endpoints, joining back inside the corresponding four disjoint sectors; this is a small isotopy of the crossing. Outside these disks, approximate each graph arc from step 1.1 by a sufficiently fine polygonal graph and perturb its finitely many vertices to rational coordinates. Choose all perturbations smaller than one third of the positive separation bound, so distinct nonincident pieces remain disjoint and every adjacent segment stays in its graph chart.

3.1A1F2F3F4step 1.1step 2.1construct∎

Orient the polygonal edges by the original circle parameter, pair the four crossing half-edges as on the original branches, and retain each crossing's over/under label. In each graph chart interpolate linearly between the original graph and the rational polygonal graph; the graphs remain embedded, their boundary endpoints agree, and their disjoint neighborhoods prevent new intersections. In each crossing disk the two interpolated branches keep the same four sectors and nonzero crossing determinant at the fixed rational point. Smooth each bend inside a smaller disk disjoint from all crossings. This gives an isotopy through diagrams with exactly the original crossing data. Lift the over/under heights continuously; strict height inequalities at each crossing persist, so this is an isotopy of embedded circles, which extends to an ambient isotopy by [F4]. The resulting rational polygonal data satisfy all clauses of [F2].

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

The descending-diagram procedure terminates on admissible finite codes

Statement

For every admissible finite planar code of a regular oriented knot diagram and every basepoint in the interior of an edge, move the basepoint slightly forward along that same edge to a point away from bends if necessary, and then call the descending-diagram procedure. It terminates, visits each crossing record once, and returns a finite updated code and a crossing-change list with at most one entry per crossing. The updated code is admissible and its first-encounter branch at each crossing is the overpassing branch. The output code and crossing-change list are independent of this basepoint adjustment within the edge. No claim about efficient minimization of u(K) is made.

Facts & Assumptions

Given: An admissible finite planar code D with c crossing records and a basepoint in an edge interior.

[F1]

The code contains finite vertex, edge, and half-edge sets, a coherent cyclic traversal of one oriented circle, and one over/under label at each crossing. Finite planar codes for oriented knot diagrams

[F2]

The algorithm performs one oriented traversal, records a crossing only at its first encounter, and changes that crossing exactly when the first branch is under. Descending-diagram crossing-change sequence

Proof

Given: The admissible code and basepoint in the statement.

1.1F1F2givenconstructalgebra

The polygonal drawing has finitely many bends. If the basepoint is a bend in the geometric interior of its edge, choose a short forward segment within that edge containing no crossing or other bend and move the basepoint into its interior. The adjusted point satisfies the algorithm's input condition. Moving the point within the same oriented edge crosses no crossing vertex, so it changes neither the cyclic order of crossing encounters nor the first branch reached at any crossing. Thus the adjustment leaves the crossing-change list and updated code independent of its choice. The code has finitely many edges and crossing records by [F1]. Following its coherent half-edge pairings from the basepoint returns to the starting edge after finitely many incidences, so the traversal terminates. It visits each crossing record once at first encounter, giving exactly c processing operations.

2.1F1F2step 1.1algebra∎

Each operation either leaves the over/under label unchanged or exchanges the two labels once. It does not change vertices, edges, cyclic orders, branch pairings, orientations, or the rational drawing certificate; hence all validity conditions in [F1] remain satisfied. The resulting list has at most c entries, and every recorded first underpass has become an overpass while first overpasses remain over.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

A descending based knot diagram represents the unknot

Statement

Assume the Axiom of Countable Choice. For every finite rational polygonal code that records one oriented circle, finitely many transverse double points, and one overpassing branch at each double point, and every basepoint in the interior of an edge, if the first encounter at each crossing is the overpassing branch, then the represented knot is ambient isotopic through orientation-preserving diffeomorphisms to the standard unknot.

Facts & Assumptions

Given: ACω, an admissible finite code D, its oriented diagram, and a basepoint in the interior of an edge.

[A1]

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

[F1]

A valid code represents a smooth regular diagram after its finitely many bend vertices are smoothed; one base edge has a crossing-free subarc around the basepoint. Finite planar codes for oriented knot diagrams

[F2]

Under ACω, every smooth isotopy of embeddings of the compact source circle into the boundaryless S3 extends to an ambient isotopy. Oriented links in the three-sphere and ambient isotopy, The isotopy extension theorem

[F3]

A proper arc with one height maximum or minimum in a height ball bounds a disk with any prescribed simple boundary arc on its level sphere. An arc with one height extremum is boundary-parallel

[F4]

A smooth oriented knot bounds a genus-zero spanning surface if and only if it is ambient isotopic to the standard unknot. A knot has genus zero exactly when it is the unknot

Proof

Given: The code and hypotheses in the statement.

1.1givenF1construct

Cut the based circle at a small crossing-free subarc around the basepoint. Orient the cut subarc from the endpoint where the remaining long arc ends to the endpoint where it begins. Identify the plane with the equatorial sphere S0⊂S3 minus one point, and write the projected long arc as γ(t)∈S0, 0≤t≤1, and the cut subarc as δ(s)∈S0, 0≤s≤1. Thus γ(1)=δ(0) and δ(1)=γ(0). Choose a=1/2 and lift these paths by γ^(t)=(1−a2cos⁡2(πt) γ(t), acos⁡(πt)),δ^(s)=(1−a2cos⁡2(πs) δ(s), −acos⁡(πs)). The first height strictly decreases from a to −a and the second strictly increases from −a to a; their first derivatives vanish at the joins and their second derivatives match. Reparametrize the projected paths near their endpoints to match the smooth based-diagram jets. The resulting closed knot is smooth and has exactly one maximum and one minimum. The projected cut subarc is disjoint from the rest of the diagram except at its endpoints.

2.1A1F1F2step 1.1construct

At every double point of γ, the first encounter occurs at smaller t and therefore has strictly larger fourth coordinate; hence the lifted knot has exactly the prescribed overpassing branch at every crossing. The long lifted arc is embedded because its fourth coordinate is strictly monotone, and the base subarc is disjoint from its projection away from the endpoints, so their union is an embedding. To identify this lift with the knot represented by the diagram, let z0 be the smooth height function of any realizing lift over the same smoothed projected circle, and let z1 be the height function specified in step 1.1. For 0≤u≤1, set zu=(1−u)z0+uz1. This is a jointly smooth family with values in (−1,1), since the compact image of z0 lies in (−1,1) and ∣z1∣≤1/2. At every crossing the first-encounter inequality holds for both z0 and z1, so it holds strictly for every zu; distinct projected points remain distinct, and the projected derivative is nonzero. Thus the corresponding lifts form a smooth isotopy of embeddings of the compact circle. By [F2] it extends to an ambient isotopy, proving that the constructed lift represents the same knot as the descending diagram.

3.1F3step 2.1construct

Choose the regular level S0 between the unique minimum and maximum. It cuts the lifted knot into an upper proper arc with one maximum and a lower proper arc with one minimum. Choose one simple joining arc on S0. By [F3], each proper arc bounds an embedded disk with that same joining arc; push their interiors into the opposite open balls, so the disks intersect only in the joining arc. Their union, after smoothing its corner, is an embedded genus-zero spanning surface for the knot.

4.1F4step 2.1step 3.1∎

Apply [F4] to the spanning disk of step 3.1. The lifted knot, and therefore the represented descending diagram by step 2.1, is ambient isotopic to the standard unknot.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

One crossing change changes a Seifert matrix by rank at most one

Statement

Assume the full Axiom of Choice. Let D+ and D− be finite regular oriented knot diagrams that agree outside one crossing neighborhood and differ inside it by switching which branch is over. Let V+ and V− be the Seifert matrices obtained from their oriented disk-and-band surfaces. There are corresponding integral bases in which either V+=V− or V+−V−=±vvT for some integral column vector v. In particular, rank⁡(V+−V−)≤1.

Facts & Assumptions

Given: Full AC, two oriented knot diagrams differing at one crossing, and their Seifert disk-and-band constructions.

[A1]

Full AC is the choice-function axiom used by the knot Seifert-pairing convention. The Axiom of Choice

[F1]

The Seifert construction smooths each crossing by the orientation-compatible pairing and adds one half-twisted band per original crossing. Seifert disk-and-band construction from an oriented knot diagram

[F2]

For a knot diagram, the resulting disk-and-band data can be realized as a connected compact oriented embedded spanning surface. Seifert disks and bands form an embedded oriented spanning surface

[F3]

In an ordered integral basis, the Seifert matrix has entries Vij=lk⁡(ai+,aj), where ai+ is the positive normal push-off. Seifert pairing and matrix of an oriented knot

Proof

Given: Full AC, the two diagrams and their prescribed crossing change.

1.1A1F1F2givenconstruct

Switching over and under does not change the oriented smoothing at the distinguished crossing. Thus [F1] gives the same Seifert circles, disk records, and bands at every other crossing. Only the distinguished band changes: its two possible half-twist directions differ by one full twist. By [F2], both disk-and-band constructions give connected embedded oriented spanning surfaces, and each surface retracts to the finite graph with one vertex per disk and one edge per band.

2.1F1step 1.1construct

Let e be the distinguished edge of that graph. If e is a bridge, every graph cycle avoids e, so choose the corresponding homology basis outside the changed band; all Seifert-pairing entries are then identical. If e is not a bridge, the graph with e removed is connected. Choose a spanning tree of that graph; its fundamental cycles, together with the fundamental cycle using e, form an integral homology basis. All basis curves except the last can be represented disjoint from the distinguished band.

3.1F2F3step 2.1algebra∎

The crossing change is supported in a ball disjoint from every other band and disk. Hence the basis curves avoiding e, and their positive push-offs, have identical linking numbers before and after the change. Their pairings with the last basis curve also remain the same, because the other curve and its push-off miss that ball. The last curve passes once through the distinguished band; changing the band by a full twist adds one signed meridional turn to its positive push-off about its core, so its self-linking in [F3] changes by exactly +1 or −1. Thus only one diagonal entry changes. The matrix difference is zero in the bridge case and is ±vvT in the non-bridge case, so its rank is at most one.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Every smooth knot has a finite crossing-change sequence to the unknot

Statement

Assume the Axiom of Countable Choice. Every smooth oriented knot in S3 admits a finite rational polygonal code recording a one-component diagram with only finitely many transverse double points and an overpassing choice at each, together with a finite sequence of changes that switch overpassing choices and whose final diagram represents the standard unknot.

Facts & Assumptions

Given: ACω and a smooth oriented knot K⊂S3.

[A1]

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

[F1]

Under ACω, every smooth oriented knot has an admissible finite rational planar code for a regular diagram. Every regular knot projection admits a finite rational planar code

[F2]

The finite traversal algorithm outputs a list of crossing changes and changes at most one crossing per finite crossing record. Descending-diagram crossing-change sequence

[F3]

If every first encounter at a crossing is an overpass, the represented diagram is ambient isotopic to the standard unknot. A descending based knot diagram represents the unknot

Proof

Given: The knot K and ACω.

1.1A1F1givenchoose

Apply [F1] to choose an admissible finite code for a regular diagram of a representative of K, and choose a basepoint in the interior of one edge away from every crossing and geometric bend. There is such a point: a one-component code has at least one nondegenerate polygonal edge segment, including in the crossing-free case, and only finitely many crossings and bends are forbidden. Choose an interior point of such a segment outside that finite set.

2.1F2step 1.1algebra

Apply [F2] to that finite code. The algorithm terminates after the finite crossing records are scanned and produces a finite crossing-change list; after those changes, each crossing is first encountered as an overpass.

3.1F1F3step 1.1step 2.1∎

By [F3], the code after the listed changes represents the standard unknot. Thus the chosen code and its finite crossing-change list witness the asserted existence for K.

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-10-22 (gpt-6.1-sol)Open item page →

Bridge number and unknotting number of an oriented knot

Definition

Assume the Axiom of Countable Choice. Identify the oriented S3 with the unit sphere in R4 by an orientation-preserving diffeomorphism and fix the standard height h(x1,x2,x3,x4)=x4. Its only critical points are the two poles, and each regular level is a 2-sphere. A Morse representative of a smooth oriented knot K is a knot ambient isotopic to K on which h has only nondegenerate critical points. Define the bridge number b(K) as the minimum number of local maxima of h on a Morse representative of K. The standard unknot is the oriented unit circle in a fixed coordinate 2-plane of S3.

A regular oriented diagram is a projection of a smooth oriented knot with finitely many transverse double points, no other multiple points, and an over/under choice at each double point. A crossing change switches which branch is over at one chosen double point and leaves the projection and strand orientations unchanged. Define the unknotting number u(K) as the minimum number of crossing changes needed to turn some regular diagram of a representative of K into a diagram of the standard unknot. Both minima are taken in subsets of N. The Morse-representative set is nonempty by the first well-definedness result below; under countable choice the regular-diagram existence result and the descending-diagram theorem below make the unknotting set nonempty. The bridge-number definition and the least-element argument in N require no choice; countable choice is used only to invoke the stated regular-projection supplier for u(K).

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Normalize a decomposing sphere relative to a bridge sphere

Statement

Assume the Axiom of Countable Choice. Let K=K1#K2 be a smooth oriented connected sum with both factors nontrivial. Let S be a regular level sphere giving a bridge position: S divides S3 into two balls, and in each ball the knot is a finite collection of properly embedded arcs, each of which cobounds an embedded disk with an arc on S; the disks in each ball are pairwise disjoint. Let P be a smooth decomposing sphere meeting K transversely in two points and cutting it into the given two oriented factors. Put E=S3∖int⁡N(K) and let A=P∖int⁡N(K) be the resulting annulus, where N(K) is a small closed tubular neighborhood. Assume the inclusion-induced map π1(A)→π1(E) is injective and that there is no embedded disk in E, with interior disjoint from A∪∂E, whose boundary is the union of a properly embedded arc in A that does not cobound a disk in A with a subarc of ∂A and an arc in ∂E. Then, after isotoping P through spheres meeting K twice and changing only the bridge-spanning disk systems for the fixed pair (K,S), one can arrange that P∩S is exactly one simple closed curve and that the union of the upper and lower bridge-spanning disks meets P in exactly two arcs, each joining one point of P∩K to a point of P∩S. The two points of P∩K lie in opposite bridge balls.

Facts & Assumptions

Given: Countable choice, the fixed smooth bridge pair (K,S) with displayed disjoint spanning disks, and the specified two-puncture sphere P satisfying the two essential-annulus hypotheses.

[F1]

External input: Negami–Okita, Lemma 3-3, printed pp. 259–262, for m=2: an incompressible, boundary-incompressible twice-punctured sphere in a nonsplit link exterior can be normalized relative to a fixed bridge sphere by an isotopy of the link pair and changes of spanning disks. Its bridge-sphere intersection is one circle and all spanning-disk intersections are puncture-to-circle arcs. The last paragraph of its proof places one puncture on each side. This is an imported PL normalization theorem, including existence of the finite disk-move sequence; its innermost-arc availability argument is not reconstructed here. Negami–Okita, Lemma 3-3 and proof.

[F2]

A knot exterior is irreducible under countable choice. A smooth knot exterior is irreducible

[F3]

Compact smooth embedding isotopies extend ambiently under countable choice. The isotopy extension theorem

[F4]

Smooth ball-window attachments and removals with supplied collars preserve the displayed ball parameters. Choice-free marked smooth ball windows and disk absorption

[F5]

A two-puncture sphere determines the oriented connected-sum factors independently of the boundary caps. A decomposing sphere realizes a connected sum of knots, The oriented connected sum is independent of its local choices

Proof

1.1givenF1F2

The annulus A is incompressible: a compression would have boundary essential in A and nullhomotopic in E, contrary to the assumed injection. The stated prohibition of disks is precisely boundary-incompressibility. A knot is a nonsplit link, and [F2] supplies irreducibility for the disk-exchange isotopies in the imported result. Hence the m=2 case of [F1] applies to this specified P and the fixed bridge sphere S. Its conclusion and final puncture redistribution give the one-circle form with one puncture in each bridge ball, rather than merely the existence of an unrelated decomposing sphere.

2.1F1F2F3F4step 1.1construct

To realize that finite disk-move sequence smoothly, keep the initial smooth knot and bridge sphere fixed and round the finitely many arcs and disk seams at each stage. The moves in the source proof are disk exchange, pushing a surface band across a spanning subdisk, and replacing a spanning subdisk by a parallel surface disk. Each has a disk-product neighborhood: on a band push, move its interval coordinate using a bump function stationary near the retained boundary intervals; on disk replacement, take a small normal parallel copy and round the joining seam. A puncture slide uses the same product at a bridge endpoint and has velocity tangent to the fixed knot. Disk exchange across a sphere uses the knot-free ball from [F2], with its collars retained by [F4]. Choose these neighborhoods sufficiently small to avoid the other same-side disks and all nonincident pieces; there are only finitely many compact pieces at each stage. These operations are smooth versions of the prescribed moves, with the same incidences. Extend their embedding isotopies by [F3]. Thus the PL input yields smooth spheres meeting the fixed knot twice and smooth disjoint spanning-disk systems for the fixed bridge pair.

3.1F1F5step 1.1step 2.1construct∎

In the final configuration of [F1], every spanning-disk intersection arc has exactly one puncture endpoint and one endpoint on P∩S. Each puncture lies on exactly one spanning disk in its bridge ball, so there are exactly two such arcs. There are no circle components or other arcs by the imported normal form. Small foot perturbations make their circle endpoints distinct, preserving every incidence. All changes of P were isotopies preserving the knot setwise, so [F5] preserves the specified oriented factors. This proves the stated normal form, including opposite-side punctures.

References

Negami–Okita, Lemma 3-3, printed pp. 259–262. The complete statement and proof of this lemma were consulted. The source works in the PL category; step 2.1 explains the smooth realization of its finite disk moves. The normalization and termination theorem is an external input, not a claimed independent local reconstruction of its innermost-arc argument.

Jaco, Chapter II, printed pp. 21–22. This is the hierarchy reference used by Negami–Okita; no additional Jaco result is invoked separately here.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Bridge number one characterizes the unknot

Statement

Assume the Axiom of Countable Choice used by the bridge-number definition. For every smooth oriented knot K in the standard S3, b(K)=1 if and only if K is ambient isotopic through orientation-preserving diffeomorphisms to the fixed oriented coordinate circle used as the standard unknot.

Facts & Assumptions

Given: ACω and a smooth oriented knot K in the standard S3.

[A1]

The definition of b(K) is the least number of local maxima over Morse representatives, and the standard unknot is the fixed coordinate circle. Bridge number and unknotting number of an oriented knot

[F1]

The set of Morse representatives is nonempty for every smooth knot. Every smooth knot has a Morse representative for the fixed height

[F2]

A proper arc with one height maximum (or minimum) in a height ball bounds a bridge disk with any prescribed simple boundary arc joining its endpoints on the level sphere. An arc with one height extremum is boundary-parallel

[F3]

A smooth oriented knot bounds a genus-zero spanning surface exactly when it is ambient isotopic to the standard unknot. A knot has genus zero exactly when it is the unknot

Proof

Given: ACω and the knot K.

1.1A1F1givenchoose

Suppose b(K)=1. By [A1] and [F1], the nonempty set of maximum counts has least value 1, so choose a Morse representative K′ with exactly one local maximum. On the circle, nondegenerate critical points alternate between maxima and minima; compactness gives finitely many, and a function on a circle has at least one minimum. Hence h∣K′ has exactly one minimum. Choose a regular value between these two critical values. Its level sphere meets K′ in exactly two points, and the upper and lower balls contain one proper arc each, with respectively one maximum and one minimum.

2.1F2F3step 1.1construct

Fix a simple arc β on the level sphere joining the two intersection points. Apply [F2] to the upper arc and the lower arc, using this same β. The resulting bridge disks lie in opposite balls and meet only along β; their union, with its corner smoothed, is an embedded disk whose boundary is K′. Thus K′ has genus zero, and [F3] makes it ambient isotopic to the standard unknot.

3.1A1givenconstructalgebra∎

Conversely, choose an orientation-preserving rotation in SO(4) carrying the fixed coordinate 2-plane of the standard unknot U to the plane spanned by e1 and e4. A path of rotations from the identity gives an ambient isotopy, and on the rotated circle the fixed height is a sine or cosine with exactly one maximum. Hence b(U)≤1. Every Morse function on a compact circle has at least one maximum, so b(U)≥1 and b(U)=1. Ambient-isotopic knots have the same set of representative maximum counts, so every unknot has bridge number one.

Diagram

The dashed line represents a regular level sphere in a two-dimensional cross-section; the two solid arcs are the upper and lower height arcs. The figure is only a cross-sectional schematic. The proof uses the bridge disks from [F2], not the drawing.

Sconemaximumoneminimump1p2
TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Descending diagrams are unknotted and unknotting number is finite

Statement

Assume the Axiom of Countable Choice. Let K be a smooth oriented knot and let D be an admissible finite planar code for a regular diagram of a representative of K, based at an interior point of an edge. After moving the basepoint slightly forward within the same edge to avoid bends if necessary, the descending-diagram procedure changes at most c(D) crossings, where c(D) is the number of crossing records in the code, and its output diagram represents the standard unknot. Consequently the set of unknotting-sequence lengths for K is a nonempty subset of N, so the unknotting number u(K) is finite and satisfies u(K)≤c(D).

Facts & Assumptions

Given: ACω, a smooth oriented knot K, a finite regular diagram code D, and a basepoint in the interior of an edge.

[A1]

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

[F1]

After moving an edge-interior bend basepoint slightly forward within the same edge if necessary, the algorithm terminates, changes at most one crossing per crossing record and returns an admissible updated code; the adjustment does not change crossing encounter order or the output. Descending-diagram crossing-change sequence, The descending-diagram procedure terminates on admissible finite codes

[F2]

A code whose first encounter at every crossing is an overpass represents the standard unknot. A descending based knot diagram represents the unknot

[F3]

The unknotting number is the minimum length of a crossing-change sequence from some regular diagram of a representative to the standard unknot diagram. Bridge number and unknotting number of an oriented knot

Proof

Given: ACω, a knot K, and an admissible finite code D for a regular diagram of a representative of K, with a basepoint in an edge interior.

1.1A1F1givenalgebra

Make the basepoint adjustment in [F1] if necessary, then apply the procedure to D. Since D has c(D) crossing records, the algorithm terminates after that finite scan and returns at most c(D) crossing changes.

2.1F2F3step 1.1algebra∎

After those changes every crossing is first encountered as an overpass, so [F2] says the updated code represents the standard unknot. It follows from [F3] that the returned list witnesses u(K)≤c(D). In particular the set defining u(K) is nonempty and its minimum is finite.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Bridge number is additive under connected sum minus one

Statement

Assume the Axiom of Countable Choice. For any two smooth oriented knots K and J in S3, the bridge number of their oriented connected sum satisfies b(K#J)=b(K)+b(J)−1.

Facts & Assumptions

Given: ACω and smooth oriented knots K,J⊂S3.

[A1]

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

[F1]

The bridge-number minima are over nonempty subsets of N and are attained, and changing the connected-sum datum preserves the oriented knot class. Bridge number and unknotting number of an oriented knot, The oriented connected sum is independent of its local choices

[F2]

The connected sum is represented by removing a small trivial ball-arc neighborhood from each summand and gluing the two boundary spheres with the fixed arc-matching convention. Oriented connected sum and prime knot

[F3]

The essential-annulus normalization for the fixed bridge pair is Normalize a decomposing sphere relative to a bridge sphere. Its two final disk-intersection arcs end on P∩S, away from the knot, and the punctures lie in opposite bridge balls.

[F4]

A knot exterior has H1(E;Z)=Z[μ]. A knot exterior has first homology generated by its meridian

[F5]

Knot exteriors are irreducible under countable choice, and an incompressible boundary-compressible annulus in an irreducible smooth torus-boundary manifold is boundary-parallel. A smooth knot exterior is irreducible, Boundary-compressible annuli with torus boundary are boundary-parallel

[F6]

Smooth Schoenflies gives an ambient isotopy of a smooth sphere to the equator with compatible ball-side parameters. Disk-window attachment and removal preserve the displayed ball type. Smooth Schoenflies for an embedded two-sphere in the three-sphere, Choice-free marked smooth ball windows and disk absorption

[F7]

Compact smooth embedding isotopies extend ambiently. The isotopy extension theorem

[F8]

A two-puncture sphere determines the stated oriented connected-sum factors by boundary caps; the unknot is the connected-sum identity and has bridge number one. A decomposing sphere realizes a connected sum of knots, Oriented knot connected sum is a commutative monoid, Bridge number one characterizes the unknot

Proof

1.1A1F1F6F7construct

We first justify using bridge spheres for the height-based minimum in [F1]. In the product of regular height levels S2×(−1,1), a maximum can be raised without changing the number or kinds of critical points: take a small cap containing only that maximum, perturb its horizontal location so that its central vertical ray misses the rest of the knot, narrow the cap inside its original small chart to fit a tube about that ray, and lift it along the ray, lengthening its two descending ends monotonically. The horizontal location is available arbitrarily close to the initial cap: the projection of the remaining finite collection of compact smooth arcs has empty interior, as follows by covering each arc by finitely many intervals of derivative bound C, whose projected images lie in disks of radius Cδ and have total area tending to zero as δ→0. Compact disjointness then gives a narrow tube about the ray avoiding the rest of the knot; its two thin parallel sides are the lengthened ends. A horizontal cap perturbation and the subsequent vertical move have embedding tracks with no new extrema; the moving cap has the translated local quadratic maximum and the ends have strictly positive or negative height derivative. Extend with [F7]. Do this finitely many times, choosing distinct rays avoiding earlier cap tracks, until all maxima lie above a regular level above all minima. The upper and lower pieces are trivial tangles with simultaneous disjoint spanning disks: sweep their endpoints between successive critical heights, extending the finite point motions on each level sphere by disjoint small coordinate vector fields. Transport disjoint joining arcs by these level isotopies. At a cap choose its joining arc in its small cap chart, away from the finitely many earlier arcs (move those arcs off that chart by a level isotopy before the birth). Their swept traces, capped at the extrema, give pairwise disjoint disks. Conversely, for any smooth bridge sphere and displayed disks, [F6] first carries the sphere to a regular level. Push each bridge through its own disk to a thin collar of its foot; in disk parameters use a positive rounded arch whose height is εsin⁡(πt) above, and −εsin⁡(πt) below, with compatible endpoint collars. The disjoint same-side disks allow these isotopies simultaneously; [F7] extends them, and rounding at endpoints gives exactly one maximum per upper arc and one minimum per lower arc. Thus the minimum number of upper arcs over bridge spheres is exactly the height-defined b. In particular a minimum-height representative supplies a bridge sphere with b upper arcs, and any factor bridge sphere with n upper arcs gives b(factor)≤n.

2.1A1F1step 1.1choose

Choose bridge representatives realizing b(K) and b(J), which is possible by [F1] and step 1.1. Each comes with its bridge sphere and disjoint upper and lower bridge-spanning disks.

2.2F1F2F4F8step 1.1construct

If either factor is the unknot, [F8] gives equality immediately. Suppose therefore both are nontrivial. Choose a bridge sphere S of L=K#J with b=b(L) upper arcs, by step 1.1. Transport the connected-sum construction's two-puncture sphere through the representative isotopy; this gives a smooth sphere P cutting L into the specified factors. Choose a sufficiently small product tube adapted to its two transverse punctures and form A=P∖int⁡N(L). The annulus core is a positive or negative meridian in the tube: both its boundary components bound the normal disks P∩N(L) and its core is homotopic within A to either boundary. By [F4], composing π1(A)=Z→π1(EL) with abelianization sends its generator to ±1∈Z. The inclusion is therefore injective.

3.1F1F2step 1.1step 2.1construct

Choose one point of each knot on its bridge sphere where an upper bridge arc and a lower bridge arc meet. Take product-coordinate balls around the two points so each ball meets the sphere in a disk, the knot in one short arc crossing that disk once, and each of the two incident bridge-spanning disks in a half-disk. Remove the ball interiors and glue the punctured spheres by the connected-sum map from [F2]. The two selected upper bridge arcs join into one proper upper arc, and the two selected lower bridge arcs join into one proper lower arc. The new upper spanning disk is the union of the two punctured upper disks and the gluing rectangle; two disks joined along one boundary interval form a disk. The same construction gives the lower spanning disk. Every unselected bridge arc and disk remains unchanged and disjoint from these disks. Thus the connected-sum position has b(K)+b(J)−1 upper arcs, so b(K#J)≤b(K)+b(J)−1.

3.2F3F5F6F8step 2.2construct

There is no boundary compression of A. If there were, [F5] would give a parallelism to one of the two annuli A0 on the boundary torus between its meridional boundaries. This implies that one factor is the unknot, as can be checked with the markings: write the tube over the corresponding subinterval of the core knot as D2×I, with side A0=∂D2×I and end disks the two disks P∩N(L). Attach the annulus parallelism to this side, retaining its rim collars. It merely enlarges the radial disk coordinate in each I-fiber, so the result is a ball with boundary the original P after rounding. Its knot arc is the core {0}×I, and it cobounds with an arc on that ball's boundary a disk given by a fixed radial interval times I, rounded at its ends. Capping this arc on P produces an unknot. The same construction works for either complementary annulus of the torus; it uses its actual product parameter, not just a homological slope. By [F8] the resulting unknot is one of the given factors, contradicting nontriviality. Thus all hypotheses of [F3] hold for this particular P, and we may apply its isotopy and disk changes without changing (L,S) or the specified factors.

4.1F3F6step 3.2constructalgebra

In the resulting normal form P∩S=C is one circle disjoint from L. The two disks P±=P∩B± each contain one puncture. This is the opposite-side puncture conclusion in the Statement of [F3], rather than an inference from the existence of two arcs alone. Each P± is a proper disk cutting its bridge ball into two balls: cap it by either of the two disks on ∂B± bounded by its rim, round, and apply [F6]; the side not containing the exterior of B± is the required ball. Their collars give compatible markings. Let S1,S2 be the disks on S bounded by C, labelled by the two sides of P, and put ri=∣L∩Si∣. Then r1+r2=2b. In each original bridge ball exactly one bridge arc crosses P±: it is the arc carrying its unique puncture. Its two endpoints on S lie on opposite sides of C, because the bridge crosses that separating disk once. Every other bridge arc is wholly on one side. Consequently ri is odd.

5.1F3F6F8step 4.1constructalgebra

Cap each of the two cut ball-arcs of L by a boundary arc on P running from the upper puncture to the lower puncture and crossing C once, chosen as the two type-I traces joined by an arc of C between their distinct foot endpoints, then rounded slightly in the collar of C so that it crosses C transversely just once. Push the two caps into their respective boundary collars. On each side this cap is a trivial ball-arc meeting the capped bridge sphere Si∪(cap disk) once. Its upper and lower portions extend the severed bridge arcs. Every uncut bridge disk remains in its original region. Each of the two cut bridge disks is cut along its one trace into two disks; on each side join its disk piece to the narrow cap strip. This is a disk attached along one boundary interval, so gives a spanning disk for the extended upper or lower arc. Choose the cap strips in disjoint small quadrant collars of the traces; other disks miss them, and on a given side all disk pieces were originally disjoint. Thus these are simultaneous disjoint spanning-disk systems. The upper and lower ambient pieces are balls: attach the cap half-balls along the displayed windows on P± and use [F6]. We have therefore constructed actual bridge spheres for the two specified oriented factors, not merely diagrams with a proposed number of bridges. Each has ri+1 knot endpoints on its sphere, the extra endpoint being the single crossing of the cap. It follows that their upper arc counts are ni=(ri+1)/2, and n1+n2=b+1. Cap orientation is chosen to close the original oriented arc, so [F8] identifies the factors with K,J, up to their harmless interchange.

6.1F1F8step 1.1step 3.1step 2.2step 5.1algebra∎

Step 1.1 applied to the two factor bridge spheres gives b(K)≤n1 and b(J)≤n2. Hence b(K)+b(J)−1≤n1+n2−1=b=b(K#J). Together with step 3.1 and the unknot case in step 2.2, this proves the formula for every pair of smooth oriented knots in the Statement. The constructions use finitely many extrema, disks, cuts and collars; their smooth extension and Schoenflies uses are precisely the stated countable-choice suppliers.

Diagram

This schematic shows the joined upper and lower spanning disks after the connected-sum gluing. The upper bridge has two endpoints on S, and the lower bridge has two other endpoints; all unselected bridges and disks are omitted. The narrow shaded strips indicate where the corresponding disk pieces are joined. The bridge counts are proved in step 3.1 independently of this drawing.

Sjoinedupperdiskjoinedlowerdisk
TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-10-22 (gpt-6.1-sol)Open item page →

The classical signature bounds unknotting number

Statement

Assume full AC. For every smooth oriented knot K, the classical signature σ−1(K) of the positive-push Seifert form is independent of the chosen connected spanning surface and integral basis, and it satisfies ∣σ−1(K)∣≤2u(K). Zero eigenvalues are omitted when computing the signature of a Hermitian matrix.

Facts & Assumptions

Given: Full AC and a smooth oriented knot K.

[A1]

Full AC implies the countable-choice hypothesis of the unknotting-number definition. The Axiom of Choice, AC implies DC implies countable choice

[F1]

The unknotting set is nonempty and u(K) is its least element, measured by finite sequences of crossing changes in regular diagrams. Bridge number and unknotting number of an oriented knot

[F2]

A single crossing change admits corresponding Seifert matrices with difference zero or ±vvT. One crossing change changes a Seifert matrix by rank at most one

[F3]

Two Hermitian matrices differing by rank at most one have signatures differing by at most two, with zero eigenvalues omitted. A rank-one Hermitian perturbation changes signature by at most two

[F4]

The positive-push matrix gives H−1(V)=2(V+VT); surface and basis changes preserve its signature. At a nonroot this is the declared invariant σ−1. Levine–Tristram Hermitian form and signature, Seifert stabilization preserves the Levine–Tristram signature, The singular parameters of the Levine–Tristram form

[F5]

The skew part V−VT is the unimodular intersection pairing of a knot Seifert surface. The skew part of a Seifert matrix is the surface intersection form

Proof

1.1A1F4F5givenalgebra

At ω=−1 the form is nonsingular for every knot. Indeed V+VT≡V−VT(mod2), so its determinant is odd by [F5] and in particular is not zero. Thus H−1=2(V+VT) is nonsingular. By [F4], −1 is not an Alexander root and the actual matrix signature is precisely σ−1(K); its surface and basis independence also follows from [F4]. This removes any need to use a root-average convention at −1.

2.1F2F3F4step 1.1algebra

For two successive knots in a crossing-change sequence, use the two corresponding bases from [F2]. If their Seifert matrix difference is ±vvT, their H−1 difference is ±4vvT, of rank at most one; if the difference is zero, the same bound holds. By [F3], the absolute signature change is at most two. Step 1.1 identifies the signatures of these particular matrices with the knot invariants, regardless of which diagram surfaces occur at other stages.

3.1F1F4step 1.1step 2.1choosealgebra∎

By [F1], take a sequence of length u(K) ending at the standard unknot. Its disk Seifert surface has an empty matrix and signature zero. Apply the estimate of step 2.1 to each consecutive pair and add the finitely many inequalities. The triangle inequality yields ∣σ−1(K)∣≤2u(K), including a length-zero sequence. Together with step 1.1 this proves both claims.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Bridge number one characterizes the unknot and signature bounds unknotting number

Statement

Assume full AC. For every smooth oriented knot K, b(K)=1 if and only if K is ambient isotopic through orientation-preserving diffeomorphisms to the fixed oriented coordinate circle, and the classical signature satisfies ∣σ−1(K)∣≤2u(K), where u(K) is the minimum number of crossing changes needed to reach that circle.

Facts & Assumptions

Given: Full AC and a smooth oriented knot K.

[A1]

Full AC implies the countable-choice hypothesis of the bridge-number-one theorem. The Axiom of Choice, AC implies DC implies countable choice

[F1]

Under countable choice, b(K)=1 if and only if K is ambient isotopic through orientation-preserving diffeomorphisms to the fixed oriented coordinate circle. Bridge number one characterizes the unknot

[F2]

Under full AC, the classical signature is well-defined and satisfies ∣σ−1(K)∣≤2u(K). The classical signature bounds unknotting number

Proof

1.1A1F1given

By [A1], the hypotheses of [F1] hold, so it supplies both implications of the asserted bridge-number characterization, with the specified oriented standard unknot.

2.1F2step 1.1∎

Apply [F2] to the same knot. It gives the asserted signature inequality with the same unknotting-number convention. Combining it with step 1.1 proves the conjunction without changing either interface.

4 · Examples, counterexamples and false statements

None yet.

Sources