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 recovers the Alexander polynomial of a closed braid
Statement
Assume AC. Let , let with closure , and let be the reduced Burau representation of The reduced Burau representation. Then the one-variable Alexander polynomial of of The Alexander polynomial from the zeroth elementary ideal is given, up to multiplication by a unit of , by and if is a knot this equals up to units. In particular for and one has and so for this is , the trefoil value. The formula computes the oriented link invariant from any braid representative of the link, with the stated unit ambiguity.
Facts & Assumptions
Given: an integer , a braid , its closure , the reduced Burau representation and the coloured reduced Burau matrix with equal-label specialisation . AC is inherited from the reduced Burau representation and Alexander-module suppliers.
The reduced Burau module is free with the auxiliary basis (), and is the action matrix in the fixed basis , not in the basis (The reduced Burau module is free of rank n minus one, The reduced Burau representation).
The unreduced Burau matrices of The unreduced Burau matrices are the matrices that are the identity outside rows and columns , with block , acting on column vectors in the relative lifted-edge basis , and the topological action of on in that basis is this matrix representation (The topological and matrix Burau representations agree).
is the kernel of the connecting map , and in the relative basis , so that the invariant covector is and ; the exact sequence is -equivariant, so the action on is the restriction of the action on . The level- class of the -th lifted edge satisfies (The unreduced module fits an exact sequence with the reduced module, The unreduced Burau matrices, The reduced Burau module is free of rank n minus one).
The coloured reduced Burau matrix at equal labels is the product of the matrices of The coloured reduced Burau matrix along an Artin word for , where has -th row entries at , at and at , truncated at the boundary columns.
The Burau determinant formula of The Burau determinant formula for a closed braid and its axis(2): in the one-variable specialisation the one-variable Alexander polynomial satisfies , equivalently for a knot; the identifications of the strand variables are those of the closed braid.
is an invariant of the oriented link type of , well defined up to multiplication by a unit (The Alexander polynomial is an oriented link invariant, The Alexander polynomial from the zeroth elementary ideal).
Proof
The generators in the reduced basis. Put for , the basis of [F1, F3]. For the matrix of in this basis is the identity except for the block in rows and columns ; for it is the identity except for the last row . Both assertions are the finite computation using and the expression of the result in the basis , carried out on the two or three vectors moved by .
Conjugation with the equal-label matrices. Put , where is the subdiagonal shift, and . The columns of are the coordinates of the fixed basis in the auxiliary basis, so . The matrices of step 1.1 satisfy : for this is multiplication of the displayed two-row block; for the last row of is zero before column , then , as in . At the identity is the scalar . Hence . Multiplying these identities, including inverses, along the word gives , and therefore . This also agrees with the frozen generator formulas of The topological and matrix Burau representations agree.
The Alexander formula. Substituting the determinant identity of step 2.1 into the formula of [F5] gives , which is the displayed formula. For a knot, dividing by and using gives , equivalently , up to units. The right-hand side is computed from any braid representative of the link, while the left-hand side is the oriented link invariant of [F6]; this also shows that the right-hand side does not depend on the representative, up to the stated unit.
The two-strand case. For the module is one-dimensional with basis and, by step 1.1, ; hence and the formula becomes . For this is (the unknot); for it is , the trefoil value; and for the closure has two components and the same display gives , the one-variable Alexander polynomial of the Hopf link in the convention of [F5]. These computations prove the displayed specialisations of the statement.
Remarks
- The deps of this proposition include four items of the sibling pair
the-burau-representations(The unreduced Burau matrices, The unreduced module fits an exact sequence with the reduced module, The reduced Burau module is free of rank n minus one, The topological and matrix Burau representations agree). They supply the matrix realization of the abstract reduced representation used in steps 1.1–2.1; their current statements supply exactly the relative basis, invariant covector and topological action used here. - The design listed Markov's theorem among the prerequisites of this item; it is not needed, because the identity is proved for each braid representative directly from the determinant theorem, and the invariance of the left-hand side is The Alexander polynomial is an oriented link invariant.
Depends on
- The Axiom of Choice
- The reduced Burau representation
- The coloured reduced Burau matrix
- The Burau determinant formula for a closed braid and its axis
- The Alexander polynomial from the zeroth elementary ideal
- The Alexander polynomial is an oriented link invariant
- The closure of a geometric braid
- The unreduced Burau matrices
- The unreduced module fits an exact sequence with the reduced module
- The reduced Burau module is free of rank n minus one
- The topological and matrix Burau representations agree
Used by
Dependency tree · two levels
64 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): the reduced Burau determinant formula for the Alexander polynomial (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)