Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generated
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 β=σ1m∈B2 the reduced Burau representation is one-dimensional, ρˉ2(σ1m)=(−t)m, and the formula of The Burau determinant recovers the Alexander polynomial of a closed braid gives Δσ1m^(t)≐(1−t)(1−(−t)m)1−t2. For m=1 this is the unknot with Δ≐1; for m=3 it is the trefoil with Δ≐t2−t+1; for m=−3 it is the mirror trefoil with Δ≐t−2−t−1+1; and for m=2 it is the Hopf link with Δ≐1−t. For even m the closure of σ1m has two components (the (2,m)-torus link) and the same display gives the one-variable Alexander polynomial of that link, Δ≐(1−t)(1−tm)/(1−t2), which for m=2 is 1−t; the knot formula is the special case of odd m.

Verification

Given: AC and the braid β=σ1m∈B2, the reduced Burau representation ρˉ2:B2→GL⁡1(Λ1), Λ1=Z[t±1], and the closure σ1m^. AC is used through the Alexander module and determinant formula; the finite scalar calculations require no further choice.

[A1] Δβ^(t)≐(1−t)det⁡(In−1−ρˉn(β))1−tn for β∈Bn, with the unit ambiguity ±tm (The Burau determinant recovers the Alexander polynomial of a closed braid, The Alexander polynomial from the zeroth elementary ideal).

[A2] For n=2 the reduced module is free of rank one with h1=[ϵ1−ϵ2] and fixed basis b1=th1 (The reduced Burau representation). In that fixed basis ρˉ2(σ1m)=(−t)m, as supplied by The Burau determinant recovers the Alexander polynomial of a closed braid.

[A3] The closure of β∈Bn has as many components as the permutation of β has cycles (The closure of a geometric braid); for σ1m∈B2 the permutation is the transposition (1  2) for odd m and the identity for even m, and the braid group is presented by the Artin generators (The braid group by Artin presentation).

Proof technique: direct substitution into the determinant formula.

1.1A2

The one-dimensional representation. By [A2] the image of σ1m is the 1×1 matrix (−t)m, so det⁡(I1−ρˉ2(σ1m))=1−(−t)m is the scalar displayed.

2.1A1step 1.1

The formula. Substituting step 1.1 into [A1] with n=2 gives Δσ1m^(t)≐(1−t)(1−(−t)m)/(1−t2), the displayed formula.

3.1A3step 2.1algebra

The odd cases. For m=1: (1−t)(1+t)/(1−t2)=1, the unknot value. For m=3: (1−t)(1+t3)/(1−t2)=(1+t3)/(1+t)=t2−t+1, the trefoil value. For m=−3: (1−t)(1+t−3)/(1−t2)=(1+t−3)/(1+t)=t−3(t2−t+1), which differs from t−2−t−1+1=t−2(t2−t+1) by the unit t−1, the mirror trefoil value; by [A3] these three closures are knots (m odd).

3.2A1A3step 2.1algebra

The even cases. For even m the permutation of σ1m is the identity, so by [A3] the closure has two components; the same display gives Δ≐(1−t)(1−tm)/(1−t2), and for m=2 this is (1−t)(1−t2)/(1−t2)=1−t, the one-variable Alexander polynomial of the Hopf link in the convention of [A1]. The formula with the factor (1−t) 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 m the closure is not a knot.

4.1A1A3step 3.2∎

The two-component value. The Hopf link is the closure of σ12, whose two components correspond to the two cycles of the identity permutation of B2 by [A3]; its value 1−t is the unit multiple ±tk 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 t2−t+1 (trefoil) and t−2−t−1+1 (mirror trefoil) are exchanged by t↦t−1, as the Alexander polynomial of mirror links requires.
  • The example is the smallest case of the determinant formula; the general n case is The Burau determinant recovers the Alexander polynomial of a closed braid, and the Hopf-link value 1−t 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