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 Burau determinant for a two-strand torus link
Example
Assume the Axiom of Choice (The Axiom of Choice), as required by the Alexander module and determinant formula. For the reduced Burau representation is one-dimensional, , and the formula of The Burau determinant recovers the Alexander polynomial of a closed braid gives For this is the unknot with ; for it is the trefoil with ; for it is the mirror trefoil with ; and for it is the Hopf link with . For even the closure of has two components (the -torus link) and the same display gives the one-variable Alexander polynomial of that link, , which for is ; the knot formula is the special case of odd .
Verification
Given: AC and the braid , the reduced Burau representation , , and the closure . AC is used through the Alexander module and determinant formula; the finite scalar calculations require no further choice.
[A1] for , with the unit ambiguity (The Burau determinant recovers the Alexander polynomial of a closed braid, The Alexander polynomial from the zeroth elementary ideal).
[A2] For the reduced module is free of rank one with and fixed basis (The reduced Burau representation). In that fixed basis , as supplied by The Burau determinant recovers the Alexander polynomial of a closed braid.
[A3] The closure of has as many components as the permutation of has cycles (The closure of a geometric braid); for the permutation is the transposition for odd and the identity for even , and the braid group is presented by the Artin generators (The braid group by Artin presentation).
Proof technique: direct substitution into the determinant formula.
The one-dimensional representation. By [A2] the image of is the matrix , so is the scalar displayed.
The formula. Substituting step 1.1 into [A1] with gives , the displayed formula.
The odd cases. For : , the unknot value. For : , the trefoil value. For : , which differs from by the unit , the mirror trefoil value; by [A3] these three closures are knots ( odd).
The even cases. For even the permutation of is the identity, so by [A3] the closure has two components; the same display gives , and for this is , the one-variable Alexander polynomial of the Hopf link in the convention of [A1]. The formula with the factor is the classical formula for knots and links, so no separate knot hypothesis is needed for the value; the distinction is only that for even the closure is not a knot.
The two-component value. The Hopf link is the closure of , whose two components correspond to the two cycles of the identity permutation of by [A3]; its value is the unit multiple representative of the Alexander polynomial of the Hopf link in the normalization of [A1]. This completes the verification of the displayed values.
Remarks
- The values (trefoil) and (mirror trefoil) are exchanged by , as the Alexander polynomial of mirror links requires.
- The example is the smallest case of the determinant formula; the general case is The Burau determinant recovers the Alexander polynomial of a closed braid, and the Hopf-link value agrees with the direct computation of the zeroth elementary ideal of its total-linking Alexander module.
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
- Joan S. Birman and Tara E. Brendle, Braids: A Survey, section 4.2 equation (15) (printed p. 47) and Example 4.1 (printed p. 49) (standard reference, not scraped)
- H. R. Morton, The multivariable Alexander polynomial for a closed braid, arXiv:math/9803138, Remark (1) and Remark (2) (printed pp. 3-4) (standard reference, not scraped)