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 reduced Burau representation detects every power of the fourth power of the half twist in B3

Statement

Assume AC (inherited through the definition of the reduced representation and the agreement theorem 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 in the basis (g1,g2) of The topological and matrix Burau representations agree, over Λ1=Z[t±1]. Then ρˉ3(Δ2)=t3I2,henceρˉ3(Δ4k)=t6kI2 for every k∈Z, and t6kI2=I2 if and only if k=0. Consequently no nonzero power Δ4k, k≠0, lies in the kernel of ρˉ3, and the cyclic subgroup ⟨Δ4⟩={Δ4k:k∈Z} maps isomorphically onto its image under ρˉ3.

Facts & Assumptions

Given: AC; the half twist Δ=σ1σ2σ1 of B3; the reduced representation ρˉ3 in the basis (g1,g2); the ring Λ1=Z[t±1] with its element t.

[F1]

In the basis (g1,g2), ρˉ3(σ1)=(−tt01), ρˉ3(σ2)=(101−t), and ρˉ3(Δ2)=t3I2 for the full twist Δ2=(σ1σ2σ1)2 (The topological and matrix Burau representations agree).

[F2]

ρˉ3:B3→GL⁡2(Λ1) is a group homomorphism; hence ρˉ3(βm)=ρˉ3(β)m for every β∈B3 and every m∈Z, where negative powers are taken in the group GL⁡2(Λ1) (The reduced Burau representation).

[F3]

tm≠1 in Λ1 for every integer m≠0 (Units, powers and the domain property of the Laurent polynomial ring, clause (b)).

[F4]

Δ2=(σ1σ2σ1)2 is the full twist of B3 and Δ4k=(Δ2)2k for every k∈Z (The Garside half twist and simple positive braids).

Proof

technique · direct
1.1F1F2F4algebra

The full twist in the reduced representation. Write M1=ρˉ3(σ1)=(−tt01) and M2=ρˉ3(σ2)=(101−t) as in [F1]. Since ρˉ3 is a homomorphism and Δ2=(σ1σ2σ1)2 by [F4], ρˉ3(Δ2)=(M1M2M1)2 in the composition order of the conventions. Direct computation gives M1M2=(0−t21−t) and M1M2M1=(0−t2−t0), so (M1M2M1)2=((−t2)(−t)00(−t)(−t2))=t3I2, confirming the displayed value ρˉ3(Δ2)=t3I2.

2.1F2F4step 1.1algebra

All powers of the fourth power. For k≥0, ρˉ3(Δ4k)=ρˉ3((Δ2)2k)=(ρˉ3(Δ2))2k=(t3I2)2k=t6kI2 by [F2], [F4] and step 1.1. For k<0 set k′=−k>0; the matrix t3I2 is invertible with inverse t−3I2, and Δ4k=(Δ2)−2k′, so ρˉ3(Δ4k)=(ρˉ3(Δ2))−2k′=(t−3I2)2k′=t6kI2, the same formula. Hence ρˉ3(Δ4k)=t6kI2 for every k∈Z.

3.1F3step 2.1∎

Detection. The scalar matrix t6kI2 equals I2 if and only if t6k=1 in Λ1, and by [F3] applied to m=6k this holds if and only if 6k=0, that is, if and only if k=0. Therefore Δ4k∈ker⁡ρˉ3 is possible only for k=0: no nonzero power of Δ4 lies in the kernel. Consequently the restriction of the homomorphism ρˉ3 to the cyclic subgroup ⟨Δ4⟩={Δ4k:k∈Z} has trivial kernel, so it is injective and maps that subgroup isomorphically onto its image.

Depends on

Used by

Dependency tree · two levels

30 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