Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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 image of the full twist under the Burau representation

Example

Assume AC (inherited through the definition of the reduced representation and the agreement theorem with the topological representation). For n=3 let Δ=σ1σ2σ1 be the half twist and Δ2 the full twist, which generates the center Z(B3) (The center of b n is generated by the full twist for n greater than two). Then the reduced Burau representation over Λ1=Z[t±1] sends the full twist to the scalar matrix ρˉ3(Δ2)=t3I2, so the image of the center is the infinite cyclic subgroup ⟨t3I2⟩ of GL⁡2(Λ1), and ρˉ3 is injective on the center: ρˉ3(Δ2k)=I2 holds if and only if k=0. In particular, although the specialization t↦−1 sends the scalar t3 to −1 (so that the image of Δ2 becomes −I2 and Δ2 itself is not in the kernel of ρˉ3(−1)), neither Δ2 nor any Δ2k with k≠0 lies in the kernel of ρˉ3 over Λ1.

Verification

Given: the ring Λ1=Z[t±1]; the half twist Δ=σ1σ2σ1 of B3 and the full twist Δ2; the reduced representation ρˉ3:B3→GL⁡2(Λ1) in the basis (g1,g2); the evaluation homomorphism ε:Λ1→Z, t↦−1, applied entrywise.

[A1] In the basis (g1,g2), ρˉ3(σ1)=(−tt01), ρˉ3(σ2)=(101−t) and ρˉ3(Δ2)=t3I2; ρˉ3 is a group homomorphism, so ρˉ3(βm)=ρˉ3(β)m for every β∈B3 and every m∈Z (The topological and matrix Burau representations agree, The reduced Burau representation).

[A2] The center of B3 is infinite cyclic and generated by the full twist: Z(B3)=⟨Δ2⟩={Δ2k:k∈Z}, with Δ=σ1σ2σ1 the half twist (The center of b n is generated by the full twist for n greater than two, The Garside half twist and simple positive braids).

[A3] tm≠1 in Λ1 for every integer m≠0 (Units, powers and the domain property of the Laurent polynomial ring, clause (b)); in particular t3k≠1 for k≠0, and t3I2 has infinite order in GL⁡2(Λ1).

[A4] The assignment t↦−1 extends uniquely to a unital ring homomorphism ε:Λ1→Z with ε(tm)=(−1)m, and composition with ε entrywise sends a homomorphism into GL⁡2(Λ1) to one into GL⁡2(Z) (The Laurent polynomial ring as the principal localisation of Z[t] at t, Ring homomorphism: additive, multiplicative, and required to send 1 to 1).

Proof technique: direct.

1.1A1A2algebra

The full twist and its powers. By [A1] and Δ2=(σ1σ2σ1)2, the full twist satisfies ρˉ3(Δ2)=t3I2; hence for every k∈Z the homomorphism property gives ρˉ3(Δ2k)=(t3I2)k=t3kI2.

2.1A2A3step 1.1

The image of the center. Since Z(B3)=⟨Δ2⟩ by [A2], the image of the center is ⟨ρˉ3(Δ2)⟩=⟨t3I2⟩. The matrix t3I2 has infinite order by [A3], so ⟨t3I2⟩ is infinite cyclic. Moreover ρˉ3(Δ2k)=t3kI2=I2 holds if and only if t3k=1, which by [A3] happens if and only if 3k=0, that is, if and only if k=0; hence ρˉ3 is injective on Z(B3).

3.1A1A4step 2.1∎

The specialization at t=−1. Apply the homomorphism ε of [A4] entrywise to ρˉ3(Δ2)=t3I2: the result is ρˉ3(−1)(Δ2)=(−1)3I2=−I2≠I2; so Δ2∉ker⁡ρˉ3(−1), even though its square Δ4 has image (−I2)2=I2. Over Λ1 the same conclusion is step 2.1: ρˉ3(Δ2k)≠I2 for every k≠0, so neither Δ2 nor any nonzero power Δ2k lies in the kernel of ρˉ3. AC is inherited through the cited agreement theorem; the scalar and matrix computations are choice free.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

47 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