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.
The braid index of an oriented link
Definition
Assume the Axiom of Choice. For an oriented link (Oriented links in the three-sphere and ambient isotopy) put
the braid index of . Here an -braid is a geometric braid based at (The closure of a geometric braid) and is its oriented closure.
For the empty link, : the empty braid in has that closure, while a positive-strand braid has at least one permutation cycle and hence a nonempty closure.
The minimum is well defined. The defining set is nonempty: by Alexander's theorem (Alexander's theorem: every link is a closed braid, which assumes AC) every oriented link is equivalent to the closure of a braid on some number of strands. The set is a subset of and is well ordered (The natural numbers (von Neumann)), so it has a least element. The value of the minimum is a property of alone: the closure construction is well defined on braid isotopy classes and, by the closure-invariance lemma (The closure depends only on the braid isotopy class), replacing a braid by a braid-isotopic one does not change the equivalence class of the closure, so the condition " equivalent to " depends only on the braid class, not on the chosen representative. The existence statement is Alexander's theorem under AC, and the invariance statement assumes , which is discharged here from AC through the choice-implication bridge (AC implies DC implies countable choice); the definition therefore declares AC in accordance with the axiom-strength convention of this page.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
35 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Birman and Brendle, Braids: A Survey, Handbook of Knot Theory chapter, author manuscript; section 2.2, printed p. 17 (standard reference, not scraped)