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
- Abelian Categories
- Absolute and Conditional Convergence; Rearrangement; Products
- Alexander polynomials from Seifert matrices
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Cayley Graphs, Word Metrics and Quasi-Isometry
- Chain Complexes and Homology
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Chain Homotopy and the Homotopy Category
- Chern and Pontryagin Classes by Splitting and Complexification
- Classification of Compact Connected Surfaces
- Classification of Covering Spaces
- Codimension One Foliations, Secondary Classes and Characteristic Disk Foundations
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Connected sums and prime decomposition
- Connectedness
- Constant Rank, Submersions, Immersions and Regular Level Sets
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Covering Spaces and Lifting
- Crossing signs, writhe, and linking number
- Cup Cap Cross Products and Cohomology Rings
- Cw Complexes and Cellular Homology
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Derived Functors
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Exactness and the Member Calculus
- Ext and Balanced Resolutions
- Exterior Powers, Orientation and Hodge Duality
- Filters and Ultrafilters
- Finite basis projector energies and variational electronic structure
- Finite Counting, Factorials and Binomial Coefficients
- Formal Immersions and the Smale Hirsch Theorem
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Free Products and Amalgamation
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Geodesics, the Exponential Map, Completeness, and Hopf–Rinow
- Geometric Braids and Artin Generators
- Gradient Like Vector Fields and Morse Trajectories
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Handle Decompositions Duality and Rearrangement
- Hausdorff via the Diagonal
- Hecke Markov Traces and Polynomial Link Invariants
- Hereditary and Productive Behaviour of the Separation Axioms
- Higher Homotopy Groups and Cofiber Sequences
- Homology Axioms Degree and Classical Applications
- Homotopy and Homotopy Equivalence
- Hurewicz Whitehead Freudenthal and Cw Approximation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Isotopy Extension and Embedding Theory Beyond Whitney
- Khovanov homology detects the unknot
- Knot exteriors and peripheral systems
- Kunneth Exactness and Splittings over Principal Ideal Domains
- Lebesgue Measure on Euclidean Space
- Levine–Tristram signatures and the Arf invariant
- Limits and Colimits
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Local Coefficients, Twisted Homology, and Duality
- Localisation of Modules and Support
- Long Exact Sequences in Homology
- Manifolds with Boundary Collars and Orientations
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Morse Critical Points Hessians and Indices
- Morse Functions Critical Values and Genericity
- Noetherian Rings and Hilbert Basis
- Normal Subgroups and Quotient Groups
- Normal-surface unknot recognition
- Normalization Finiteness for Affine Domains
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Orientations Poincare Lefschetz and Alexander Duality
- Oriented and Mod Two Intersection Numbers
- Oriented Links, Braid Closures, and Markov Equivalence
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Plane Graphs, Euler's Formula and the Five Colour Theorem
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Preadditive and Additive Categories and Biproducts
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Projective and Injective Resolutions
- Properties of the Integral and the Working FTC
- Quasi Coherent and Coherent Sheaves and Vector Bundles
- Rank Theorems and Embedded Submanifolds
- Reeb Stability and Global Foliation Constructions
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Relative Homology Excision and Mayer Vietoris
- Relative smooth triangulation and bundle fitting
- Riemannian Metrics Length Distance and Volume
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sard Theorem and Transversality
- Satellite knots and JSJ tori
- Seifert matrices and the Alexander module
- Seifert surfaces and knot genus
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Simplicial Subdivision and Simplicial Approximation
- Singular Chains and Singular Homology
- Singular Cohomology and Coefficient Theorems
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Surgery Traces and Handle Trading
- Smooth Vector Bundles and Sections
- Splitting Fields
- Sublevel Deformation and the Handle Attachment Theorem
- Subobject Lattices Generators and the Grothendieck Axioms
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Tensor Fields Exterior Algebra and Differential Forms
- Tensor Products of Modules
- The Burau Representations
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The de Rham Theorem and Degree
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Diagram Lemmas in an Abelian Category
- The Exponential Function
- The Exterior Derivative and Cartan Calculus
- The Field of Fractions and Localisation
- The Fundamental Group
- The Fundamental Group of the Circle
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Galois Correspondence
- The Group Algebra and Representations of Finite Groups
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Lebesgue Integral and the Convergence Theorems
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Seifert–van Kampen Theorem
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Trees, Forests and Spanning Trees
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Universal Coefficients and Kunneth Theorems
- Universal Properties, Representables and the Yoneda Lemma
- Vanishing Cycles, Novikov and Taut Foliations
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Whitney Embedding Tubular Neighbourhoods and Approximation
- Wirtinger presentations and knot groups
- Zero traces and the Conway nonsliceness theorem
2 · Logical flowchart
3 · Definitions, theorems and proofs
Every smooth knot has a Morse representative for the fixed height
Statement
Identify the oriented standard with the unit sphere in and fix . For every smooth oriented knot , there is an orientation-preserving ambient isotopy carrying to a smooth knot for which has only nondegenerate critical points.
Statement references
Facts & Assumptions
Given: A smooth oriented knot and the fixed height under the standard identification .
For a compact embedded smooth manifold , a generic direction makes a Morse function on . For a compact manifold embedded in Euclidean space, the restricted linear height is Morse for generic directions
Proof
Given: The smooth oriented knot and the fixed height in the statement.
Regard as a compact embedded smooth 1-manifold in . By [F1], the exceptional set of non-Morse directions is null in every smooth atlas of . It cannot contain all of , since a nonempty coordinate ball has positive Euclidean measure; choose . Then is Morse on .
Choose with . Such a rotation is obtained in the plane spanned by and ; if , use a half-turn in a plane containing . A rotation path from the identity to is an ambient isotopy of the oriented sphere. On , the fixed height equals , which is Morse by step 1.1. Thus is the required representative.
An arc with one height extremum is boundary-parallel
Statement
Assume the Axiom of Countable Choice. On the unit sphere with height , let be a regular value and let be a smooth properly embedded arc in the upper ball , with endpoints on , such that has exactly one nondegenerate interior maximum and no other critical point. For every simple smooth arc joining those endpoints, there is an embedded disk in with boundary . The corresponding statement for one nondegenerate minimum in the lower ball also holds.
Statement references
Facts & Assumptions
Given: , the standard coordinate height on the unit , a regular level sphere , the upper ball , a smooth proper arc with one nondegenerate maximum and endpoints on , and a simple arc with the same endpoints.
The Axiom of Countable Choice, written . The Axiom of Countable Choice ()
The regular level spheres of are explicitly identified by , for .
Under , 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.
Let be the unique maximum. The two components of are strictly monotone in height, so each intermediate regular level meets in exactly two points. In a Morse chart on near , the height is ; a short level arc joining the two nearby points and the subarc through 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 .
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 for a simple arc .
Let be the initial cap arc on the reference , and let be the ambient isotopy from [F2] carrying its endpoint pair to the two intersection points on level . The arc is a simple arc with the same endpoints as . Bigon elimination gives an isotopy of , fixed at those endpoints, with . Precompose the transported cap arc by before applying , where is zero near the cap level and increases smoothly to at . Every fixes the reference endpoints, so the joining arcs still have the required endpoint tracks; at the joining arc is exactly . The union of this family with the cap disk is therefore an embedded disk bounded by . Reversing height proves the lower-ball statement.
A rank-one Hermitian perturbation changes signature by at most two
Statement
Let and be Hermitian forms on the same finite-dimensional complex vector space, and suppose that the linear map representing has rank at most one. Then , where the signature is the number of positive eigenvalues minus the number of negative eigenvalues, with multiplicity and with zero eigenvalues omitted.
Statement references
Facts & Assumptions
Given: Hermitian forms and on the same finite-dimensional complex vector space, with .
For a Hermitian form , its positive index is the largest dimension of a subspace on which for every nonzero ; its negative index is defined using . Its signature is .
Proof
Let . Rank-nullity and the rank hypothesis give . If is a positive subspace for of dimension , then . On the forms agree, so this intersection is positive for . Thus . Interchanging and proves .
Apply the same argument to and to obtain . Therefore .
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.
Every regular knot projection admits a finite rational planar code
Statement
Assume the Axiom of Countable Choice. Every smooth oriented knot in has an admissible finite planar code whose rational polygonal drawing certificate represents a regular oriented diagram of that knot.
Statement references
Facts & Assumptions
Given: The Axiom of Countable Choice and a smooth oriented knot .
The Axiom of Countable Choice, written . The Axiom of Countable Choice ()
Under , a smooth oriented link contained in admits a regular orthogonal projection; the projection has finitely many transverse double points and no triple points. Existence of regular projections
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
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
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 .
A smooth embedded circle has empty interior in : in every submanifold chart it is a coordinate line, which contains no open three-dimensional ball. Choose . Choose an orientation-preserving rotation carrying to the fixed point at infinity; a rotation path from the identity to restricts to an ambient isotopy of . Thus misses infinity, and stereographic coordinates regard it as a compact smooth oriented knot in . 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.
In each crossing disk, choose a nearby rational point 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 , in the same cyclic order as the branch germs. Replace the branches near 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.
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].
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 is made.
Statement references
Facts & Assumptions
Given: An admissible finite planar code with crossing records and a basepoint in an edge interior.
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
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.
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 processing operations.
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 entries, and every recorded first underpass has become an overpass while first overpasses remain over.
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.
Statement references
Facts & Assumptions
Given: AC, an admissible finite code , its oriented diagram, and a basepoint in the interior of an edge.
The Axiom of Countable Choice, written AC. The Axiom of Countable Choice ()
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
Under AC, every smooth isotopy of embeddings of the compact source circle into the boundaryless extends to an ambient isotopy. Oriented links in the three-sphere and ambient isotopy, The isotopy extension theorem
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
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.
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 minus one point, and write the projected long arc as , , and the cut subarc as , . Thus and . Choose and lift these paths by The first height strictly decreases from to and the second strictly increases from to ; 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.
At every double point of , the first encounter occurs at smaller 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 be the smooth height function of any realizing lift over the same smoothed projected circle, and let be the height function specified in step 1.1. For , set . This is a jointly smooth family with values in , since the compact image of lies in and . At every crossing the first-encounter inequality holds for both and , so it holds strictly for every ; 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.
Choose the regular level 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 . 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.
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.
One crossing change changes a Seifert matrix by rank at most one
Statement
Assume the full Axiom of Choice. Let and be finite regular oriented knot diagrams that agree outside one crossing neighborhood and differ inside it by switching which branch is over. Let and be the Seifert matrices obtained from their oriented disk-and-band surfaces. There are corresponding integral bases in which either or for some integral column vector . In particular, .
Statement references
Facts & Assumptions
Given: Full AC, two oriented knot diagrams differing at one crossing, and their Seifert disk-and-band constructions.
Full AC is the choice-function axiom used by the knot Seifert-pairing convention. The Axiom of Choice
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
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
In an ordered integral basis, the Seifert matrix has entries , where 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.
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.
Let be the distinguished edge of that graph. If is a bridge, every graph cycle avoids , so choose the corresponding homology basis outside the changed band; all Seifert-pairing entries are then identical. If is not a bridge, the graph with removed is connected. Choose a spanning tree of that graph; its fundamental cycles, together with the fundamental cycle using , form an integral homology basis. All basis curves except the last can be represented disjoint from the distinguished band.
The crossing change is supported in a ball disjoint from every other band and disk. Hence the basis curves avoiding , 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 or . Thus only one diagonal entry changes. The matrix difference is zero in the bridge case and is in the non-bridge case, so its rank is at most one.
Every smooth knot has a finite crossing-change sequence to the unknot
Statement
Assume the Axiom of Countable Choice. Every smooth oriented knot in 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.
Statement references
Facts & Assumptions
Given: AC and a smooth oriented knot .
The Axiom of Countable Choice, written AC. The Axiom of Countable Choice ()
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
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
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 and AC.
Apply [F1] to choose an admissible finite code for a regular diagram of a representative of , 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.
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.
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 .
Bridge number and unknotting number of an oriented knot
Definition
Assume the Axiom of Countable Choice. Identify the oriented with the unit sphere in by an orientation-preserving diffeomorphism and fix the standard height . Its only critical points are the two poles, and each regular level is a 2-sphere. A Morse representative of a smooth oriented knot is a knot ambient isotopic to on which has only nondegenerate critical points. Define the bridge number as the minimum number of local maxima of on a Morse representative of . The standard unknot is the oriented unit circle in a fixed coordinate 2-plane of .
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 as the minimum number of crossing changes needed to turn some regular diagram of a representative of into a diagram of the standard unknot. Both minima are taken in subsets of . 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 require no choice; countable choice is used only to invoke the stated regular-projection supplier for .
Normalize a decomposing sphere relative to a bridge sphere
Statement
Assume the Axiom of Countable Choice. Let be a smooth oriented connected sum with both factors nontrivial. Let be a regular level sphere giving a bridge position: divides 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 ; the disks in each ball are pairwise disjoint. Let be a smooth decomposing sphere meeting transversely in two points and cutting it into the given two oriented factors. Put and let be the resulting annulus, where is a small closed tubular neighborhood. Assume the inclusion-induced map is injective and that there is no embedded disk in , with interior disjoint from , whose boundary is the union of a properly embedded arc in that does not cobound a disk in with a subarc of and an arc in . Then, after isotoping through spheres meeting twice and changing only the bridge-spanning disk systems for the fixed pair , one can arrange that is exactly one simple closed curve and that the union of the upper and lower bridge-spanning disks meets in exactly two arcs, each joining one point of to a point of . The two points of lie in opposite bridge balls.
Statement references
Facts & Assumptions
Given: Countable choice, the fixed smooth bridge pair with displayed disjoint spanning disks, and the specified two-puncture sphere satisfying the two essential-annulus hypotheses.
External input: Negami–Okita, Lemma 3-3, printed pp. 259–262, for : 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.
A knot exterior is irreducible under countable choice. A smooth knot exterior is irreducible
Compact smooth embedding isotopies extend ambiently under countable choice. The isotopy extension theorem
Smooth ball-window attachments and removals with supplied collars preserve the displayed ball parameters. Choice-free marked smooth ball windows and disk absorption
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
The annulus is incompressible: a compression would have boundary essential in and nullhomotopic in , 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 case of [F1] applies to this specified and the fixed bridge sphere . 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.
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.
In the final configuration of [F1], every spanning-disk intersection arc has exactly one puncture endpoint and one endpoint on . 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 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.
Bridge number one characterizes the unknot
Statement
Assume the Axiom of Countable Choice used by the bridge-number definition. For every smooth oriented knot in the standard , if and only if is ambient isotopic through orientation-preserving diffeomorphisms to the fixed oriented coordinate circle used as the standard unknot.
Statement references
Facts & Assumptions
Given: and a smooth oriented knot in the standard .
The definition of 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
The set of Morse representatives is nonempty for every smooth knot. Every smooth knot has a Morse representative for the fixed height
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
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: and the knot .
Suppose . By [A1] and [F1], the nonempty set of maximum counts has least value , so choose a Morse representative 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 has exactly one minimum. Choose a regular value between these two critical values. Its level sphere meets in exactly two points, and the upper and lower balls contain one proper arc each, with respectively one maximum and one minimum.
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 . Thus has genus zero, and [F3] makes it ambient isotopic to the standard unknot.
Conversely, choose an orientation-preserving rotation in carrying the fixed coordinate 2-plane of the standard unknot to the plane spanned by and . 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 . Every Morse function on a compact circle has at least one maximum, so and . Ambient-isotopic knots have the same set of representative maximum counts, so every unknot has bridge number one.
Sources
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.
Descending diagrams are unknotted and unknotting number is finite
Statement
Assume the Axiom of Countable Choice. Let be a smooth oriented knot and let be an admissible finite planar code for a regular diagram of a representative of , 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 crossings, where 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 is a nonempty subset of , so the unknotting number is finite and satisfies .
Statement references
Facts & Assumptions
Given: , a smooth oriented knot , a finite regular diagram code , and a basepoint in the interior of an edge.
The Axiom of Countable Choice, written . The Axiom of Countable Choice ()
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
A code whose first encounter at every crossing is an overpass represents the standard unknot. A descending based knot diagram represents the unknot
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: , a knot , and an admissible finite code for a regular diagram of a representative of , with a basepoint in an edge interior.
Make the basepoint adjustment in [F1] if necessary, then apply the procedure to . Since has crossing records, the algorithm terminates after that finite scan and returns at most crossing changes.
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 . In particular the set defining is nonempty and its minimum is finite.
Bridge number is additive under connected sum minus one
Statement
Assume the Axiom of Countable Choice. For any two smooth oriented knots and in , the bridge number of their oriented connected sum satisfies
Statement references
Facts & Assumptions
Given: AC and smooth oriented knots .
The Axiom of Countable Choice, written AC. The Axiom of Countable Choice ()
The bridge-number minima are over nonempty subsets of 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
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
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 , away from the knot, and the punctures lie in opposite bridge balls.
A knot exterior has . A knot exterior has first homology generated by its meridian
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
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
Compact smooth embedding isotopies extend ambiently. The isotopy extension theorem
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
We first justify using bridge spheres for the height-based minimum in [F1]. In the product of regular height levels , 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 , whose projected images lie in disks of radius and have total area tending to zero as . 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 above, and 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 . In particular a minimum-height representative supplies a bridge sphere with upper arcs, and any factor bridge sphere with upper arcs gives .
Choose bridge representatives realizing and , which is possible by [F1] and step 1.1. Each comes with its bridge sphere and disjoint upper and lower bridge-spanning disks.
If either factor is the unknot, [F8] gives equality immediately. Suppose therefore both are nontrivial. Choose a bridge sphere of with upper arcs, by step 1.1. Transport the connected-sum construction's two-puncture sphere through the representative isotopy; this gives a smooth sphere cutting into the specified factors. Choose a sufficiently small product tube adapted to its two transverse punctures and form . The annulus core is a positive or negative meridian in the tube: both its boundary components bound the normal disks and its core is homotopic within to either boundary. By [F4], composing with abelianization sends its generator to . The inclusion is therefore injective.
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 upper arcs, so .
There is no boundary compression of . If there were, [F5] would give a parallelism to one of the two annuli 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 , with side and end disks the two disks . Attach the annulus parallelism to this side, retaining its rim collars. It merely enlarges the radial disk coordinate in each -fiber, so the result is a ball with boundary the original after rounding. Its knot arc is the core , and it cobounds with an arc on that ball's boundary a disk given by a fixed radial interval times , rounded at its ends. Capping this arc on 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 , and we may apply its isotopy and disk changes without changing or the specified factors.
In the resulting normal form is one circle disjoint from . The two disks 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 is a proper disk cutting its bridge ball into two balls: cap it by either of the two disks on bounded by its rim, round, and apply [F6]; the side not containing the exterior of is the required ball. Their collars give compatible markings. Let be the disks on bounded by , labelled by the two sides of , and put . Then . In each original bridge ball exactly one bridge arc crosses : it is the arc carrying its unique puncture. Its two endpoints on lie on opposite sides of , because the bridge crosses that separating disk once. Every other bridge arc is wholly on one side. Consequently is odd.
Cap each of the two cut ball-arcs of by a boundary arc on running from the upper puncture to the lower puncture and crossing once, chosen as the two type-I traces joined by an arc of between their distinct foot endpoints, then rounded slightly in the collar of so that it crosses 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 (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 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 knot endpoints on its sphere, the extra endpoint being the single crossing of the cap. It follows that their upper arc counts are , and . Cap orientation is chosen to close the original oriented arc, so [F8] identifies the factors with , up to their harmless interchange.
Step 1.1 applied to the two factor bridge spheres gives and . Hence . 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 , 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.
The classical signature bounds unknotting number
Statement
Assume full AC. For every smooth oriented knot , the classical signature of the positive-push Seifert form is independent of the chosen connected spanning surface and integral basis, and it satisfies Zero eigenvalues are omitted when computing the signature of a Hermitian matrix.
Statement references
Facts & Assumptions
Given: Full AC and a smooth oriented knot .
Full AC implies the countable-choice hypothesis of the unknotting-number definition. The Axiom of Choice, AC implies DC implies countable choice
The unknotting set is nonempty and is its least element, measured by finite sequences of crossing changes in regular diagrams. Bridge number and unknotting number of an oriented knot
A single crossing change admits corresponding Seifert matrices with difference zero or . One crossing change changes a Seifert matrix by rank at most one
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
The positive-push matrix gives ; surface and basis changes preserve its signature. At a nonroot this is the declared invariant . Levine–Tristram Hermitian form and signature, Seifert stabilization preserves the Levine–Tristram signature, The singular parameters of the Levine–Tristram form
The skew part is the unimodular intersection pairing of a knot Seifert surface. The skew part of a Seifert matrix is the surface intersection form
Proof
At the form is nonsingular for every knot. Indeed , so its determinant is odd by [F5] and in particular is not zero. Thus is nonsingular. By [F4], is not an Alexander root and the actual matrix signature is precisely ; its surface and basis independence also follows from [F4]. This removes any need to use a root-average convention at .
For two successive knots in a crossing-change sequence, use the two corresponding bases from [F2]. If their Seifert matrix difference is , their difference is , 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.
By [F1], take a sequence of length 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 , including a length-zero sequence. Together with step 1.1 this proves both claims.
Bridge number one characterizes the unknot and signature bounds unknotting number
Statement
Assume full AC. For every smooth oriented knot , if and only if is ambient isotopic through orientation-preserving diffeomorphisms to the fixed oriented coordinate circle, and the classical signature satisfies , where is the minimum number of crossing changes needed to reach that circle.
Statement references
Facts & Assumptions
Given: Full AC and a smooth oriented knot .
Full AC implies the countable-choice hypothesis of the bridge-number-one theorem. The Axiom of Choice, AC implies DC implies countable choice
Under countable choice, if and only if is ambient isotopic through orientation-preserving diffeomorphisms to the fixed oriented coordinate circle. Bridge number one characterizes the unknot
Under full AC, the classical signature is well-defined and satisfies . The classical signature bounds unknotting number
Proof
By [A1], the hypotheses of [F1] hold, so it supplies both implications of the asserted bridge-number characterization, with the specified oriented standard unknot.
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
- Marco Gualtieri, Topology I: Smooth Manifolds, Part 10
- Ozsváth, Stipsicz, and Szabó, Grid Homology for Knots and Links
- Jennifer Schultens, Additivity of Bridge Numbers of Knots
- Burde and Zieschang, Knots, 2nd revised and extended edition
- Danny Calegari, Introduction to Knot Theory
- Cole Charbonneau, Computing the Wirtinger Presentation of a Knot Group from a Knot Diagram
- Signature Invariants Related to the Unknotting Number
- Seiya Negami and Kazuo Okita, The Splittability and Triviality of 3-Bridge Links
- William Jaco, Lectures on Three-Manifold Topology
- Anthony Conway, The Levine–Tristram signature: a survey