Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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 reduced Burau representation is faithful for at most three strands

Statement

Assume AC (inherited through the definition of the reduced representation and the agreement theorem with the topological representation). For 1≤n≤3 the reduced Burau representation ρˉn:Bn→GL⁡n−1(Λ1) over Λ1=Z[t±1] is faithful; that is, ker⁡ρˉn is trivial and ρˉn is injective. In detail: B1 is trivial; B2≅Z is generated by σ1 (The two-strand braid group is infinite cyclic) and ρˉ2(σ1k)=(−t)k, which is I1 only for k=0 (Units, powers and the domain property of the Laurent polynomial ring); and if β∈ker⁡ρˉ3, then its specialization at t=−1 lies in ker⁡ρˉ3(−1)=⟨Δ4⟩ (The minus-one specialization of three-strand Burau has kernel generated by Delta to the fourth), say β=Δ4k, and The reduced Burau representation detects every power of the fourth power of the half twist in B3 forces t6k=1, hence k=0 and β=1. The case n=4 is not claimed. Magnus and Peluso established faithfulness for n=3 by a direct algebraic computation, and the argument for n=3 given here, via the t=−1 specialization, is independent of theirs. The AC hypothesis is exactly the inherited one.

Facts & Assumptions

Given: AC; the ring Λ1=Z[t±1]; the reduced representations ρˉ1,ρˉ2,ρˉ3 in their fixed bases; the half twist Δ=σ1σ2σ1 of B3.

[F1]

For n=0 and n=1 there are no Artin generators and Bn is the trivial group (The braid group by Artin presentation).

[F2]

B2 is infinite cyclic generated by σ1; in the one-element basis of the reduced module for n=2 the representation is ρˉ2(σ1)=−t and ρˉ2(σ1k)=(−t)k (The two-strand braid group is infinite cyclic, The topological and matrix Burau representations agree, clause (2); The reduced Burau representation).

[F3]

ρˉ3(−1):B3→GL⁡2(Z) denotes the homomorphism obtained by evaluating the matrices of ρˉ3 at t=−1; its kernel is ker⁡ρˉ3(−1)=⟨Δ4⟩={Δ4k:k∈Z} (The minus-one specialization of three-strand Burau has kernel generated by Delta to the fourth).

[F4]

ρˉ3(Δ4k)=t6kI2 for every k∈Z, and t6kI2=I2 if and only if k=0 (The reduced Burau representation detects every power of the fourth power of the half twist in B3).

[F5]

tm≠1 in Λ1 for every m≠0, and in particular (−t)k=1 implies k=0: if (−t)k=1 then t2k=((−t)k)2=1, so 2k=0 (Units, powers and the domain property of the Laurent polynomial ring, clause (b)).

Proof

technique · direct
1.1F1

The case n=1. By [F1] the group B1 is trivial, so its only element is the identity and ker⁡ρˉ1={1}; hence ρˉ1 is injective and faithful.

1.2F2F5algebra

The case n=2. By [F2] every element of B2 is σ1k for a unique k∈Z, and ρˉ2(σ1k)=(−t)k. If σ1k∈ker⁡ρˉ2 then (−t)k=1, so t2k=1 and hence 2k=0 by [F5], giving k=0 and σ1k=1. Thus ker⁡ρˉ2 is trivial and ρˉ2 is faithful.

1.3F3F4

The case n=3. Let β∈ker⁡ρˉ3, so ρˉ3(β)=I2. Applying the evaluation homomorphism of [F3] entrywise gives ρˉ3(−1)(β)=I2, so β∈ker⁡ρˉ3(−1)=⟨Δ4⟩, say β=Δ4k with k∈Z. Then [F4] gives I2=ρˉ3(β)=ρˉ3(Δ4k)=t6kI2, so t6k=1 and hence k=0; therefore β=Δ0=1. Since β was an arbitrary element of the kernel, ker⁡ρˉ3 is trivial and ρˉ3 is faithful.

2.1step 1.1step 1.2step 1.3∎

Conclusion. Steps 1.1, 1.2 and 1.3 cover n=1,2,3 respectively, so the reduced Burau representation is faithful for 1≤n≤3. AC is inherited through the cited representation items as declared; the group-theoretic and specialization computations are choice free.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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