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.
Oriented Links, Braid Closures, and Markov Equivalence — Examples
1 · Prerequisites
- Abelian Categories
- Absolute and Conditional Convergence; Rearrangement; Products
- Applications of the Fundamental Group
- Approximation and Compactness in C(K)
- Artin Presentation Completeness and Braid Combing
- Asymptotic Cones and the Sublinear Triangle Criterion
- Binary Operations, Monoids, Groups and Subgroups
- Braided and Symmetric Monoidal Categories
- Braids as Fundamental Groups of Configuration Spaces
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Cayley Graphs, Word Metrics and Quasi-Isometry
- Chain Complexes and Homology
- Chain Homotopy and the Homotopy Category
- Classification of Compact Connected Surfaces
- Classification of Covering Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- 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
- Cup Cap Cross Products and Cohomology Rings
- Cw Complexes and Cellular Homology
- Darboux, L'Hôpital, and Taylor's Theorem
- Derived Functors
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Exactness and the Member Calculus
- Ext and Balanced Resolutions
- Exterior Powers, Orientation and Hodge Duality
- Fibrations Fiber Bundles and Homotopy Exact Sequences
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- 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
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hereditary and Productive Behaviour of the Separation Axioms
- Higher Homotopy Groups and Cofiber Sequences
- 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
- Kunneth Exactness and Splittings over Principal Ideal Domains
- Limits and Colimits
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Long Exact Sequences in Homology
- Manifolds with Boundary Collars and Orientations
- Matrices, the Matrix of a Linear Map, and Change of Basis
- 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
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordered and Unordered Configuration Spaces
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Orientations Poincare Lefschetz and Alexander Duality
- Oriented Links, Braid Closures, and Markov Equivalence
- Partitions of Unity and Paracompactness
- Permutation Statistics, Inversions and Eulerian Numbers
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Plane Graphs, Euler's Formula and the Five Colour Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Preadditive and Additive Categories and Biproducts
- Projective and Injective Resolutions
- Properties of the Integral and the Working FTC
- Punctured Disks, Mapping Classes, and Point Pushing
- Pure Braids, Fadell–Neuwirth, and Asphericity
- Rank Theorems and Embedded Submanifolds
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Relative Homology Excision and Mayer Vietoris
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sard Theorem and Transversality
- Semidirect Products, Automorphism Groups and Split Extensions
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Simplicial Subdivision and Simplicial Approximation
- Simply Connected Plane Domains: the Grand Equivalence
- Singular Chains and Singular Homology
- Singular Cohomology and Coefficient Theorems
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Subobject Lattices Generators and the Grothendieck Axioms
- Subspaces, Products, and Quotients
- Suprema and Infima
- 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 Artin Action on a Free Group
- The Ascoli–Arzelà Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- 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 Fundamental Group
- The Fundamental Group of the Circle
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Seifert–van Kampen Theorem
- 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
- Uniform Spaces: the Three Definitions
- Universal Coefficients and Kunneth Theorems
- Universal Properties, Representables and the Yoneda Lemma
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Whitney Embedding Tubular Neighbourhoods and Approximation
2 · Summary
These four entries make the closure and Markov machinery of the companion page concrete. The first computes the closures of the two-strand braids : the component count is the cycle count of the endpoint permutation, the pictures are the torus links, and the cases give the two-component unlink, the unknot and the two mirror trefoils. The second exhibits both signs of a Markov stabilization of the trivial one-strand braid and unwinds the added kink by the explicit Reidemeister I isotopy, so that both stabilizations preserve the unknot closure.
The third runs the Yamada-Vogel algorithm on the standard diagram of , smooths its crossings to a Seifert picture, performs the two reducing moves of the source and reads off the resulting braid word, whose closure is the knot; the example also records that the algorithm's output is not minimal for the braid index. The fourth is a counterexample: the braids in and in have equivalent closures, both the unknot, but they cannot be conjugate in a single braid group because conjugacy preserves the number of strands; at least one stabilization or destabilization is therefore genuinely necessary in Markov's classification.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Torus links as closures of two-strand braids
Example
For let (The braid group by Artin presentation), and let be its oriented closure (The closure of a geometric braid). Then is the torus link: it has components, namely two components when is even and one component when is odd. In the small cases the closure is the standard picture of the torus link: for it is the two-component unlink, for it is the unknot, and for it is the trefoil, the two signs giving the two mirror images. Here the unknot is the closure of the trivial one-strand braid, the two-component unlink is the closure of the trivial two-strand braid, and the trefoil is the closure of ; those closures are the definitions used for these three links on this page.
Facts & Assumptions
Given: An integer and the finite word in ; no choice axiom is assumed.
The fixed closure map is ; permutation cycles give its components. Finite words have explicit smooth endpoint-flat models, and the trivial two-braid bounds the specified disjoint latitude-cap disks (The closure of a geometric braid).
For the fixed basepoints are , , and a signed elementary half twist rotates them through the corresponding signed half turn; its permutation is (The elementary geometric half twist, its support disc, and its opposite, The braid group by Artin presentation).
A smooth Euclidean map with nonzero Jacobian determinant has a smooth local inverse, without any choice assumption (Choice-free smooth inverse function theorem in Euclidean space).
Verification
The literal word model and component count. Write . The finite signed half-turn word has disk strands , where is smooth, , and all positive-order endpoint derivatives vanish. Take at ; concatenating the finitely many flattened half-turn angles gives such a for every other . The two points stay distinct. Its literal smooth closure has , by [F1]. The endpoint permutation is , so there is one component when is odd and two when is even, including . This is , with the positive gcd convention for negative .
An explicit ambient isotopy to the uniform torus model. Set . Its values at both ends are zero, its first derivatives at both ends are , and all higher endpoint derivatives agree; hence it is a smooth function on the page circle. Choose a fixed smooth radial cutoff equal to one near and zero near . On use . Its inverse rotates by the negative angle, since is unchanged. It is a smooth isotopy, and through the explicit it extends by identity across the axis because the cutoff is zero near the disk boundary. It preserves orientation as a smooth path of diffeomorphisms starting at identity. At the curve is exactly , . For odd , concatenate its two strands with parameter ; this gives , , with winding pair after parameter . For even , each strand is a circle with winding pair and the two are disjoint. These are the standard torus curves , including the stated component count. No generic continuous-braid smoothing theorem or Markov-preservation assumption is used.
The two one-crossing oriented unknots without Choice. For , use the chart of with and . Its inverse is , so it is explicitly . The curve from step 2.1 has constant. Move this disk point along the real segment from to by finitely many small cutoff translations , with compact support in and . A fixed smooth bump and a sufficiently fine finite subdivision suffice because that compact segment has positive distance from the boundary. The inverse is the unique limit of , starting at : successive differences are bounded by a geometric sequence with ratio at most , so the explicit sequence converges and its fixed point is unique. The Jacobian has determinant ; [F3] makes the already constructed inverse smooth locally and hence globally. Each map is identity outside its compact interior support, so gives a disk diffeomorphism. Compose these finitely many disk-map families with the same parameter ; the finite smooth composition starts at identity and at sends to . Its product with the unchanged extends by identity across , since there. This ambient isotopy takes the curve to . The explicit unitary rotation , , then takes it to the trivial one-braid circle . For its orientation is already the positive page orientation. For reverse that circle's negative angular orientation using ; this map is the endpoint of the explicit rotation in the real plane of the two imaginary coordinates, an orientation-preserving path in . Thus both signs give the oriented unknot. Every construction is explicit or a finite selection; no countable choice is used.
The unlink, trefoils and conclusion. At step 1.1 is the literal trivial two-braid closure, whose explicit disjoint spanning disks are [F1]. At , step 2.1 gives the standard torus knots, the trefoils named in the Statement. The map changes to and reverses the ambient orientation, so the two are mirrors. Steps 1.1-3.1 give the component formula and both one-crossing unknots, and the coordinate curves verify for every integer .
A Markov stabilization preserves the unknot closure
Example
Assume . The trivial braid closes to the unknot, and both stabilizations and in also close to the unknot; the explicit isotopies are the R1 unwinding of the added kink, one for each sign. Here the unknot is the closure of the trivial one-strand braid.
Facts & Assumptions
Given: , the trivial braid , its two stabilizations , in the sense of Markov conjugation and stabilization moves, and the closure construction of The closure of a geometric braid.
Stabilization adjoins one new strand on the right carrying the half twist , we use the particular ambient isotopy constructed in proof step 1.2 of Markov moves preserve the oriented closure up to isotopy, which moves the added circle and an old-strand collar to a fixed-framing ball near the axis and exhibits the signed kink. The strand insertion and literal closure have the conventions of Markov conjugation and stabilization moves and The closure of a geometric braid.
Assume : a stabilization preserves the oriented closure up to equivalence, because the added strand differs from the trivial strand by a kink which is unwound by one Reidemeister I isotopy; both signs of the kink are covered by the two signs of the stabilization (Markov moves preserve the oriented closure up to isotopy).
The trivial one-strand braid closes to a single circle about the axis, the round unknot, and the closure of a braid with one cycle of its endpoint permutation has one component (The closure of a geometric braid).
Verification
The closures of the stabilizations. By the preliminary ambient positioning in [F1], the two fixed-framing closures have representatives which are the round unknot with respectively a positive and a negative kink. Both closures are one-component links by [F3], since the endpoint permutation of each stabilization of is the transposition of the two strands.
The R1 isotopies. The explicit isotopy for the positive sign is the R1 move that pulls the kink straight inside a small ball neighbourhood of the kink, keeping the rest of the closed braid fixed; for the negative sign the mirror isotopy unrolls the opposite kink. In both cases the R1 move is realized by an ambient isotopy by [F2], so the closure of each stabilization is equivalent to the closure of the trivial braid, the unknot.
Conclusion. Both stabilizations and in close to the unknot, with the explicit R1 isotopies of the two signs; the example illustrates that stabilization preserves the closure in the simplest possible case.
The Yamada-Vogel algorithm on a small diagram
Example
Assume the Axiom of Choice. Run the Yamada-Vogel algorithm on the standard five-crossing diagram of the knot , the first knot in the tables whose standard diagram has height greater than zero. Its Seifert picture has four Seifert circles and five positive signed arcs, so ; two reducing moves along the arcs of the source bring it to height zero, and reading the resulting closed braid gives
the algorithm gives this nine-crossing four-braid. Braid relations and one ordinary destabilization, with conjugations, give an eight-crossing three-braid, which simplifies to the six-letter three-braid . Thus the algorithm's initial four-braid has nonminimal braid index, and the eight-letter three-braid word is not shortest.
Facts & Assumptions
Given: AC, the standard diagram of the knot with its five crossings, the Seifert smoothing of Seifert smoothing and Seifert circles of an oriented link diagram, and the Yamada-Vogel algorithm (Defect regions, reducing arcs and the Yamada-Vogel reducing move).
Smoothing the five positive crossings of gives the Seifert picture of the source: four Seifert circles and five positive signed arcs, and the height counts the incoherent pairs (Seifert smoothing and Seifert circles of an oriented link diagram, Defect regions, reducing arcs and the Yamada-Vogel reducing move, Coherence of Seifert circles and the height of a diagram).
If there is a defect region and a reducing arc; a reducing move lowers the height by exactly one (A positive-height diagram has a defect region, A reducing move lowers the height by one).
A height-zero diagram represents the closure of the braid read in angular order from a cut ray of its nested chain, after a sphere isotopy and choice of planar chart (A height-zero diagram represents a closed braid).
Artin inverse cancellation, far commutations and are the defining braid relations (The braid group by Artin presentation).
For , conjugate by , right stabilize, and conjugate by to insert as ; stabilizations have (Markov conjugation and stabilization moves).
Under countable choice every ordinary Markov move preserves the oriented closure, and AC implies that choice principle (Markov moves preserve the oriented closure up to isotopy, AC implies DC implies countable choice).
The geometric product runs the rightmost factor first (Stacking of geometric braids is a well-defined associative operation on isotopy classes).
The fixed positive generator is an anticlockwise half twist in the oriented transverse disk, with its first indexed point passing through negative second coordinate (The elementary geometric half twist, its support disc, and its opposite).
Verification
The source's five-arc picture and six circle pairs. Number the four circles in the first sketch of Figure 4 by their northwest, northeast, southwest and southeast positions. The northwest and southeast arrows are counterclockwise; the northeast and southwest arrows clockwise. For side-by-side circles in , coherence requires opposite planar orientations, since the common annulus is outside their two disk interiors. Thus exactly the two diagonal pairs are incoherent; each of the four side pairs is coherent, so . The five positive arcs are the two between the top circles, one on each vertical side and one on the bottom side, as shown in that rendered source panel. Their signs and incident circles record the original five crossings by [F1]. The heavy joins the northwest and southeast incoherent pair; [F2] licenses its first reduction.
The two reductions. Perform the reducing move along : it replaces the chosen incoherent pair by two coherent circles joined by two oppositely signed arcs, and by [F2] the height drops to ; the new picture has a remaining incoherent pair, and the source's second reducing arc joins it. Performing the reducing move along drops the height to , and the resulting picture has all pairs of Seifert circles coherent. The two moves are Reidemeister II moves of the original diagram, so the represented knot is unchanged.
The source word and its product convention. The final sketch has four concentric counterclockwise circles. Number them outermost to innermost and read from twelve o'clock counterclockwise. The ordered signed events are , giving the displayed chronological list . For this counterclockwise motion use the transverse frame ; together with tangent it preserves ambient orientation. Its positive half twist has the first outer indexed point go through negative physical depth, so the source's crossing signs agree with the fixed signed generators. By [F7] the actual geometric element of this chronological list is , not automatically . We verify both closures by an explicit word comparison. Write , , . The Artin relations [F4] give The successive operations are , commuting with , and . Put , , so . By the interior insertion sequence [F5], this is related by one positive ordinary destabilization and conjugations to the three-braid . Inverse cancellation gives , a six-letter three-braid. Word reversal is an anti-automorphism because the Artin relations are palindromic or far commutations. It carries a right stabilization to a left one of the same sign, which cyclic conjugation converts to a right stabilization; hence the reversed identities likewise give by ordinary Markov moves. Finally put . Directly Therefore . Combining the two destabilization comparisons with this old-strand conjugation gives an explicit Markov sequence between and . By [F6], both have the oriented closure of the source diagram. The algorithm itself yields the nine-letter four-braid; is its eight-letter three-braid after destabilization and is a strictly shorter word for that same three-braid.
Conclusion. The verified two reductions give the source's four-strand, nine-crossing closed braid. Step 3.1 proves that its actual chronological interpretation and the commissioned word have the same oriented closure, and explicitly gives the eight-letter and six-letter three-braid words. The existence of the three-braid proves that the initial four-braid uses more strands than necessary; the six-letter representative proves that the eight-letter word is longer than necessary. These are separate index and length comparisons, with no assertion that the three-braid has nonminimal braid index. AC supplies the reducing/height-zero constructions and the countable choice in [F6].
Conjugacy alone does not classify braid closures
Statement refuted
Assume AC. Two braids have equivalent oriented closures if and only if they are connected using conjugations alone, without changing strand number.
Facts & Assumptions
Given: AC, the braids , , and the closure construction of The closure of a geometric braid.
Stabilization replaces by the product in of the standard inclusion of with , the new strand being added on the right; conjugacy always takes place inside a single group and never changes the number of strands (Markov conjugation and stabilization moves).
The stabilizations and close to the unknot, with the explicit R1 isotopies, so the closure of the stabilization of the trivial one-strand braid is the unknot; the example item A Markov stabilization preserves the unknot closure records this for both signs.
Markov moves preserve the oriented closure up to equivalence; in particular the closure of a stabilized braid is equivalent to the closure of the original (Markov moves preserve the oriented closure up to isotopy).
By closure of a braid, the number of components is the number of cycles of the endpoint permutation; the permutation of is the transposition with one cycle, and the permutation of is a three-cycle, also with one cycle, so both closures have one component (The closure of a geometric braid, The braid group by Artin presentation).
Counterexample
Assume the Axiom of Choice. The braids and have equivalent closures — both the unknot — but are not conjugate to each other, since conjugacy preserves the braid group and . Hence conjugation alone, with the number of strands fixed, does not classify braid closures; at least one stabilization or destabilization is genuinely necessary.
Both closures are unknots. The trivial braid closes to a round unknot. Its positive stabilization is , whose closure is the unknot by [F2]; stabilizing once more, adding the third strand on the right, gives the braid , whose closure is equivalent to the closure of by [F3], hence also an unknot. The component count is one in both cases by [F4], so both closures are one-component links, and by [F2] and [F3] they are the unknot.
They are not conjugate. Conjugation, by [F1], stays inside a fixed braid group and never changes the number of strands. The braid has two strands and has three; no sequence of conjugations within a single braid group can relate them, because such a sequence would have to identify an element of with an element of . Therefore conjugation alone does not classify braid closures: the two closures are equivalent oriented links (both the unknot) while the braids are not conjugate.
Conclusion. The braids and have equivalent closures but are not conjugate; the only difference between the two braids in Markov terms is the stabilization that changes the group from to , which is the strand-changing move that conjugacy cannot simulate. This verifies the counterexample and shows that at least one stabilization or destabilization is genuinely necessary for the classification. The statement retains AC because it consumes the countable-choice-stated closure-preservation lemma [F3], with countable choice following from AC by AC implies DC implies countable choice and the ambient isotopy theory behind [F2].
Sources
- Birman and Brendle, Braids: A Survey, Handbook of Knot Theory chapter, author manuscript; section 2, printed pp. 12-26
- Ozsvath, Stipsicz and Szabo, Grid Homology for Knots and Links, AMS Surveys and Monographs 208 (2015); section 2.1, printed pp. 13-19; Appendix B.1, printed pp. 367-372
- Birman and Brendle, Braids: A Survey, Handbook of Knot Theory chapter, author manuscript; section 2.3 and the stabilization figures, printed pp. 17-19
- Traczyk, A new proof of Markov's braid theorem, Banach Center Publications 42 (1998), 409-419; section 1
- Birman and Brendle, Braids: A Survey, Handbook of Knot Theory chapter, author manuscript; Example 2.1 and Figure 4, printed pp. 14-15
- Birman and Brendle, Braids: A Survey, Handbook of Knot Theory chapter, author manuscript; section 2.3, printed pp. 17-19