Alphabeta Math
LemmaStatement: 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 minus-one specialization of three-strand Burau has kernel generated by Delta to the fourth

Statement

Assume AC (inherited through the identification of the reduced matrices with the topological representation). Let Δ=σ1σ2σ1 be the half twist of B3 and let ρˉ3:B3→GL⁡2(Λ1) be the reduced Burau representation. Evaluate the matrices of The topological and matrix Burau representations agree at t=−1 and call the resulting homomorphism ρˉ3(−1):B3→GL⁡2(Z); in the basis (g1,g2) it sends σ1⟼U=(1−101),σ2⟼V=(1011). Then U,V generate SL⁡2(Z); the group with presentation ⟨U,V∣UVU=VUV, (UVU)4=1⟩ is isomorphic to SL⁡2(Z); the map ρˉ3(−1) is surjective with image SL⁡2(Z); and its kernel is ker⁡ρˉ3(−1)=⟨Δ4⟩={Δ4k:k∈Z}, the infinite cyclic central subgroup generated by Δ4. Equivalently, the only braid-group relation added to the Artin presentation of B3 by the specialization is Δ4=1.

Facts & Assumptions

Given: AC; the reduced representation ρˉ3 in the basis (g1,g2); the entrywise evaluation Λ1→Z, t↦−1; the matrices U,V above; the braid group B3=⟨σ1,σ2∣σ1σ2σ1=σ2σ1σ2⟩; the half twist Δ=σ1σ2σ1.

[F1]

In the basis (g1,g2), ρˉ3(σ1)=(−tt01) and ρˉ3(σ2)=(101−t); a homomorphism into GL⁡2(Λ1) composes with the ring homomorphism Λ1→Z, t↦−1, to give a homomorphism into GL⁡2(Z) (The topological and matrix Burau representations agree, The reduced Burau representation, The Laurent polynomial ring as the principal localisation of Z[t] at t).

[F2]

Put S=(0−110) and T=(1101). By definition, the quotient q:SL⁡2(Z)→PSL⁡2(Z) has kernel {±I}=⟨S2⟩.

[F3]

Let C4=⟨a∣a4=1⟩, C6=⟨b∣b6=1⟩ and let C4∗C2C6 be the amalgam identifying the order-two subgroup ⟨a2⟩ with the order-two subgroup ⟨b3⟩. Then C4∗C2C6 has the presentation ⟨a,b∣a4=1, b6=1, a2=b3⟩: applying A free product with amalgamation has the factor presentations plus the amalgamating relations to these two presentations with the amalgamating words ua2=a2, va2=b3 for the generator a2 of the common subgroup C2 adds exactly the relation a2b−3=1, and amalgamated products are pushouts along monomorphisms (Free products with amalgamation along monomorphisms).

[F4]

PSL⁡2(Z) is the free product C2∗C3: with x the class of S and y the class of ST, every element has a unique expression yi0xyi1x⋯yin−1xyin with ij taken modulo 3 and all inner exponents nonzero, and the emptiness of further relations is proved by the entry-sum argument for products of SR and SR2 (Keith Conrad, SL_2(Z), Appendix C, Theorem C.1 and its proof; see the cited locator). In particular the assignment x↦s, y↦t for arbitrary elements s,t of a group with s2=t3=1 extends to a homomorphism C2∗C3→⟨s,t⟩ (A free product has the union presentation of presentations of its factors); uniqueness of the normal form is the cited external theorem.

[F5]

The center of Bn for n≥3 is infinite cyclic and generated by the full twist Δ2; hence Δ4=(Δ2)2 is central of infinite order (The center of b n is generated by the full twist for n greater than two, The Garside half twist and simple positive braids).

[F6]

Matrix arithmetic is entrywise. For 2×2 matrices A,B, expanding the four entries of AB in det⁡(AB) and cancelling cross terms gives det⁡(AB)=det⁡(A)det⁡(B); the relevant matrices have determinant 1, so their products lie in SL⁡2(Z) (Invertible square matrices and similarity over a commutative ring).

[F7]

The matrices S,T generate SL⁡2(Z) (Keith Conrad, SL2(Z), Theorem 1.1 and its algebraic proof in Section 2, printed p. 1). That proof applies integer division to the first column, decreasing the absolute value of its lower entry until it vanishes; the resulting upper triangular determinant-one matrix is a signed power of T.

Proof

technique · direct
1.1F1F6algebra

The specialization. Evaluating the matrices of [F1] at t=−1 gives ρˉ3(−1)(σ1)=U and ρˉ3(−1)(σ2)=V as displayed. Computations give UVU=(0−110)=:S=VUV and S4=I (indeed S2=−I), so the relations UVU=VUV and (UVU)4=1 hold in SL⁡2(Z); also det⁡U=det⁡V=1, so ρˉ3(−1) takes values in SL⁡2(Z).

1.2F3algebra

The presented group is the amalgam C4∗C2C6. Let P=⟨x,y∣xyx=yxy, (xyx)4=1⟩ and set a=xyx, b=xy as words in P. Symbolically, b−1a=(xy)−1(xyx)=y−1x−1xyx=y−1yx=x and a−1b2=(xyx)−1(xy)2=x−1y−1x−1xyxy=x−1y−1yxy=y, so P=⟨a,b⟩; moreover (xy)3=(xyx)(yxy)=(xyx)2=a2 using the relation, so b3=a2, and hence b6=a4=1. These relations define a homomorphism θ:C4∗C2C6→P sending the amalgam generators to the words a,b. Conversely, in C4∗C2C6 the elements x:=b−1a and y:=a−1b2 satisfy xyx=a and yxy=a, so they satisfy the relators of P and define a homomorphism η:P→C4∗C2C6. Direct substitution shows that ηθ fixes a,b and θη fixes x,y, hence the homomorphisms are inverse and P≅C4∗C2C6.

1.3F2F6F7algebra

Generation. The matrices S,T generate SL⁡2(Z) by [F7]. Direct calculation gives U=T−1 and UVU=S, so ⟨U,V⟩ contains both S and T. Since U,V∈SL⁡2(Z) by [F6], it follows that ⟨U,V⟩=SL⁡2(Z).

2.1F2F3F4step 1.1step 1.3step 1.2

The amalgam is SL⁡2(Z). By von Dyck applied to [F3] with a↦S, b↦ST (which satisfy S4=I, (ST)6=I, S2=(ST)3=−I), there is a homomorphism φ:C4∗C2C6→SL⁡2(Z), surjective because its image contains S and ST, which generate SL⁡2(Z): indeed T=S−1(ST). Let q:SL⁡2(Z)→PSL⁡2(Z) be the quotient of [F2]. The composite ψ=q∘φ sends a↦Sˉ and b↦ST‾, so it factors through the quotient by a2=b3; by [F4] its induced map on that quotient is the isomorphism C2∗C3≅PSL⁡2(Z) with generators a↦Sˉ, b↦ST‾. Its kernel is the normal closure of a2, since quotienting [F3] by a2=b3 gives ⟨a,b∣a2=1,b3=1⟩=C2∗C3. The element a2=b3 is central in the amalgam, because it is central in both cyclic factors, and has order at most two; its image under φ is S2=−I≠I, so the kernel of ψ is exactly {1,a2}. If φ(w)=I, then w∈{1,a2}, and the nontriviality of φ(a2) forces w=1. Hence φ is injective and C4∗C2C6≅SL⁡2(Z). By step 1.2, P≅SL⁡2(Z) via x↦U, y↦V; in particular ρˉ3(−1) is surjective onto SL⁡2(Z) by steps 1.1 and 1.3.

3.1F5step 2.1∎

The kernel. The Artin presentation of B3 has the single relation σ1σ2σ1=σ2σ1σ2, and step 2.1 exhibits SL⁡2(Z) as the quotient of B3 by the normal closure of Δ4=(σ1σ2σ1)4 under σ1↦U, σ2↦V. Hence ker⁡ρˉ3(−1)=⟨⟨Δ4⟩⟩. By [F5] the element Δ4 is central of infinite order, so its normal closure is the cyclic subgroup ⟨Δ4⟩={Δ4k:k∈Z}≅Z. This is the assertion, including the equivalent description as the only relation added to the Artin presentation. AC is inherited through the cited representation agreement; the matrix, presentation and centre computations are choice free.

Depends on

Used by

Dependency tree · two levels

72 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