Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 topological and matrix Burau representations agree

Statement

Assume AC (inherited from the topological definition of the reduced representation and the lift of braid mapping classes). Write U=H1(X~,p−1d;Z) and Mred=H1(X~;Z) over Λ1=Z[t±1], with the relative lifted-edge basis e1,…,en of The unreduced Burau matrices and the reduced basis gi=tei−ei+1 (1≤i≤n−1) of ker⁡σ=ker⁡∂∗ from The unreduced module fits an exact sequence with the reduced module and The invariant vector and the invariant covectors of the unreduced Burau. Then:

(1) the topological action of Bn on U in the basis e1,…,en is the matrix representation ρnmat of The unreduced Burau matrices, i.e. ρnmat(β) is the matrix of the lifted braid action for every β∈Bn;

(2) under the isomorphism Mred≅ker⁡∂∗ induced by the inclusion of the pair, the reduced Burau representation ρˉn of The reduced Burau representation acts in the basis (g1,…,gn−1) by the formulas gj−1⟼gj−1+gj,gj⟼−tgj,gj+1⟼tgj+gj+1, every other gi fixed; in particular, for n=3, in the basis (g1,g2), ρˉ3(σ1)=(−tt01), ρˉ3(σ2)=(101−t), and ρˉ3(Δ2)=t3I2 for the full twist Δ2.

Caveat: the inclusion carries the fixed basis bi of The reduced Burau representation to ti(ϵi−ϵi+1)=tei−ei+1=gi, since ei=ti−1ϵi. Thus this identifies the two representations as matrices in the frozen bases; it does not claim that the integral extension 0→Mred→U→∂∗Λ1→εZ→0 splits.

Facts & Assumptions

Given: AC; the unreduced module U with its relative lifted-edge basis e1,…,en; the reduced module Mred with its fixed basis; the exact sequence 0→Mred→U→∂∗Λ1→εZ→0 of The unreduced module fits an exact sequence with the reduced module; the candidate reduced basis gi=tei−ei+1.

[F1]

The topological action gives a homomorphism Bn→Aut⁡Λ1(U), β↦(h~)∗, where h~ is the basepoint-normalised lift of a representative homeomorphism of β; isotopic representatives give the same automorphism (Braid mapping classes lift equivariantly to the Burau cover, Braid group as boundary-fixed punctured-disk mapping classes, The Artin presentation is complete for geometric braids).

[F2]

ρnmat:Bn→GL⁡n(Λ1) is the homomorphism with ρnmat(σi)=Bi, and on the generator σi the topological action on U has matrix exactly Bi in the basis e1,…,en (The unreduced Burau matrices satisfy the Artin relations, The geometric half twist acts on the lifted-edge basis by the Burau block).

[F3]

The inclusion of the pair induces an isomorphism Mred→ker⁡∂∗, and ∂∗=(t−1)σ where σ(x)=∑iti−1xi; the maps are compatible with the braid actions in the sense that the inclusion Mred→U is natural for homeomorphisms of the pair, so the action on Mred corresponds to the restriction of the action on U to ker⁡∂∗ (The unreduced module fits an exact sequence with the reduced module, Functoriality of relative homology, Relative singular homology).

[F4]

The matrices act on column vectors, and the matrix of a Λ1-linear map in a fixed basis has the images of the basis vectors as its columns; Λ1 is a domain and t≠1 (Invertible square matrices and similarity over a commutative ring, Units, powers and the domain property of the Laurent polynomial ring, The Laurent polynomial ring as the principal localisation of Z[t] at t).

Proof

technique · direct
1.1F1F2F4

Clause (1). Both β↦(h~)∗ (in the basis e1,…,en) and ρnmat are homomorphisms from the presented group Bn to GLn(Λ1) by [F1], [F2]; they agree on each generator σi, where the matrix of the topological action is Bi by [F2]. Since Bn is generated by the σi, the two homomorphisms agree on all of Bn, which is clause (1).

1.2F3algebra

The basis (g1,…,gn−1) of ker⁡∂∗. By [F3], ∂∗(x)=0 means ∑iti−1xi=0 for x=∑ixiei. Given such an x, set ck:=−∑i>kti−1−kxi for 1≤k≤n−1 and c0:=cn:=0; then ∑k=1n−1ckgk=∑j(tcj−cj−1)ej with tcj−cj−1=xj for every j, the case j=1 using ∑iti−1xi=0 and the case j=n the definition cn=0. Hence the gi span ker⁡∂∗. They are independent: if ∑k=1n−1ckgk=0, the coefficient of en is −cn−1, then the coefficient of en−1 is tcn−1−cn−2=−cn−2, and induction downwards gives ck=0 for all k. So (g1,…,gn−1) is a Λ1-basis of ker⁡∂∗.

2.1F2F3F4step 1.2algebra

Clause (2): the action on the reduced basis. For the generator σj, the unreduced action of clause (1) is ej↦(1−t)ej+ej+1, ej+1↦tej and ek↦ek otherwise [F2]. Substituting, gj−1=tej−1−ej↦tej−1−(1−t)ej−ej+1=(tej−1−ej)+(tej−ej+1)=gj−1+gj; gj=tej−ej+1↦t(1−t)ej+tej+1−tej=−t(tej−ej+1)=−tgj; gj+1=tej+1−ej+2↦t2ej−ej+2=(t2ej−tej+1)+(tej+1−ej+2)=tgj+gj+1; and every other gi involves only basis vectors outside {ej,ej+1} and is fixed. Boundary conventions: for j=1 there is no g0, for j=n−1 there is no gn. By [F3] the action on Mred corresponds to this action on ker⁡∂∗, so the matrix of ρˉn(σj) in the basis (gi) is as displayed.

3.1step 2.1algebra

The case n=3. In the basis (g1,g2) the formulas of step 2.1 for j=1 give g1↦−tg1, g2↦tg1+g2, i.e. ρˉ3(σ1)=(−tt01), and for j=2 give g1↦g1+g2, g2↦−tg2, i.e. ρˉ3(σ2)=(101−t). Multiplying, ρˉ3(σ1)ρˉ3(σ2)ρˉ3(σ1)=(0−t2−t0), whose square is t3I2; since Δ2=(σ1σ2σ1)2 in B3, this is ρˉ3(Δ2)=t3I2.

4.1step 1.1step 2.1step 3.1∎

Conclusion. Clause (1) is step 1.1 and clause (2) is steps 2.1 and 3.1; the identification is in the frozen bases and no Λ1-linear splitting of the exact sequence of [F3] is constructed or claimed.

Depends on

Used by

Cited to discharge well-definedness by The unreduced Burau matrices.

Dependency tree · two levels

103 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