Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 n≥2, let β∈Bn with closure β^, and let ρˉn:Bn⟶GL⁡n−1(Λ1),Λ1=Z[t±1], 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 ±tm of Λ1, by Δβ^(t)≐(1−t) det⁡(In−1−ρˉn(β))1−tn, and if β^ is a knot this equals det⁡(In−1−ρˉn(β))/(1+t+⋯+tn−1) up to units. In particular for n=2 and β=σ1m one has ρˉ2(σ1m)=(−t)m and Δσ1m^(t)≐(1−t)(1−(−t)m)1−t2, so for m=3 this is t2−t+1, 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 n≥2, a braid β∈Bn, its closure β^, the reduced Burau representation ρˉn and the coloured reduced Burau matrix B‾β(t1,…,tn) with equal-label specialisation Bβ(t). AC is inherited from the reduced Burau representation and Alexander-module suppliers.

[F1]

The reduced Burau module Mred is free with the auxiliary basis hj=εj−εn (hn=0), and ρˉn(β) is the action matrix in the fixed basis bj=tj(hj−hj+1), not in the h basis (The reduced Burau module is free of rank n minus one, The reduced Burau representation).

[F2]

The unreduced Burau matrices of The unreduced Burau matrices are the matrices Bi that are the identity outside rows and columns i,i+1, with block (1−tt10), acting on column vectors in the relative lifted-edge basis e1,…,en, and the topological action of Bn on U=H1(X~,p−1d;Z) in that basis is this matrix representation (The topological and matrix Burau representations agree).

[F3]

Mred is the kernel of the connecting map ∂∗:U→Λ1, and in the relative basis ∂∗(ei)=ti−1(t−1), so that the invariant covector is σ(ei)=ti−1 and Mred=ker⁡σ; the exact sequence 0→Mred→U→Λ1→Z→0 is Bn-equivariant, so the action on Mred is the restriction of the action on U. The level-0 class εi of the i-th lifted edge satisfies εi=t−(i−1)ei (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).

[F4]

The coloured reduced Burau matrix at equal labels Bβ(t)=B‾β(t,…,t) is the product of the matrices C‾i(t)±1 of The coloured reduced Burau matrix along an Artin word for β, where C‾i(t) has i-th row entries t at (i,i−1), −t at (i,i) and 1 at (i,i+1), truncated at the boundary columns.

[F5]

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 Δβ^(t)≐(1−t)det⁡(I−Bβ(t))/(1−tn), equivalently Dβ^(t)≐det⁡(I−Bβ(t))/(1−tn) for a knot; the identifications of the strand variables are those of the closed braid.

[F6]

Δβ^ is an invariant of the oriented link type of β^, well defined up to multiplication by a unit ±tm (The Alexander polynomial is an oriented link invariant, The Alexander polynomial from the zeroth elementary ideal).

Proof

1.1F1F2F3algebra

The generators in the reduced basis. Put hj:=εj−εn=t−(j−1)ej−t−(n−1)en for 1≤j≤n−1, the basis of [F1, F3]. For 1≤i≤n−2 the matrix of σi in this basis is the identity except for the block (1−t1t0) in rows and columns i,i+1; for i=n−1 it is the identity except for the last row (−1,−1,…,−1,−t). Both assertions are the finite computation Bihj=∑k(Ri)kjhk using Bihj∈ker⁡σ and the expression of the result in the basis h, carried out on the two or three vectors moved by Bi.

2.1F1F2F3F4step 1.1algebra

Conjugation with the equal-label matrices. Put P=In−1−S, where S is the subdiagonal shift, and D=diag⁡(t,t2,…,tn−1). The columns of Q=PD are the coordinates of the fixed basis bj=tj(hj−hj+1) in the auxiliary h basis, so ρˉn(σi)=Q−1RiQ. The matrices of step 1.1 satisfy RiP=PC‾i(t): for i<n−1 this is multiplication of the displayed two-row block; for i=n−1 the last row of RiP is zero before column n−2, then t−1,−t, as in PC‾i(t). At n=2 the identity is the scalar −t=−t. Hence ρˉn(σi)=D−1C‾i(t)D. Multiplying these identities, including inverses, along the word gives ρˉn(β)=D−1B‾β(t)D, and therefore det⁡(In−1−B‾β(t))=det⁡(In−1−ρˉn(β)). This also agrees with the frozen generator formulas of The topological and matrix Burau representations agree.

3.1F5F6step 2.1algebra

The Alexander formula. Substituting the determinant identity of step 2.1 into the formula of [F5] gives Δβ^(t)≐(1−t)det⁡(In−1−ρˉn(β))/(1−tn), which is the displayed formula. For a knot, dividing by 1−t and using 1−tn=(1−t)(1+t+⋯+tn−1) gives Dβ^(t)≐det⁡(In−1−ρˉn(β))/(1−tn), equivalently Δβ^(t)≐det⁡(In−1−ρˉn(β))/(1+t+⋯+tn−1), 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.

4.1F5step 1.1step 3.1algebra∎

The two-strand case. For n=2 the module Mred=ker⁡σ is one-dimensional with basis h1=e1−t−1e2 and, by step 1.1, ρˉ2(σ1)=−t; hence ρˉ2(σ1m)=(−t)m and the formula becomes Δσ1m^≐(1−t)(1−(−t)m)1−t2. For m=1 this is ≐1 (the unknot); for m=3 it is (1−t)(1+t3)1−t2=1+t31+t=t2−t+1, the trefoil value; and for m=2 the closure σ12^ has two components and the same display gives Δ≐(1−t)(1−t2)/(1−t2)=1−t, the one-variable Alexander polynomial of the Hopf link in the convention of [F5]. These computations prove the displayed specialisations of the statement.

Remarks

Depends on

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