Alphabeta Math
Pipeline-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.

✓ 4 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 4 also cleared it.

The Burau Representations — Examples

1 · Prerequisites

2 · Summary

These four entries make the companion page's constructions concrete in the smallest cases and delimit one tempting overstatement.

The first example writes out the unreduced Burau matrices for n=3 in the frozen relative lifted-edge basis, verifies the braid relation by direct 3×3 multiplication, and reads the reduced matrices off the invariant-covector kernel in the basis (g1,g2)=(te1−e2, te2−e3), checking the braid relation again at the 2×2 level. The second computes the image of the center: the full twist Δ2 maps to the scalar t3I2, so the image of Z(B3) is infinite cyclic and ρˉ3 is injective on it, while at t=−1 the same scalar becomes −I2 even though its square is the identity.

The third assumes n≥2 and specializes at t=1, where the unreduced matrices become permutation matrices and the representation factors through the symmetric group; the rational splitting of the sum-zero lattice is visible, but over Z the sum Zv+{x:∑ixi=0} is only the proper sublattice {x:∑ixi≡0 mod n}, so the rational splitting is not integral.

The counterexample refutes the statement that every invariant line in a finite free module over Λ1 has an invariant complement: the Burau line Λ1v is Bn-invariant, but an invariant complement would give an equivariant projection, hence an invariant covector λ=c σ with c σ(v)=1; that would make 1+t+⋯+tn−1 a unit of Λ1, which it is not for n≥2. This is the integral obstruction behind the field-only splitting used by the same-kernel proposition.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Unreduced and reduced Burau matrices for three strands

Example

Assume AC (inherited through the identification of the reduced matrices with the topological representation). For n=3 the unreduced Burau matrices over Λ1=Z[t±1] are ρ3(σ1)=(1−tt0100001),ρ3(σ2)=(10001−tt010), and they satisfy ρ3(σ1)ρ3(σ2)ρ3(σ1)=ρ3(σ2)ρ3(σ1)ρ3(σ2). The reduced matrices in the basis (g1,g2)=(te1−e2, te2−e3) of the invariant-covector kernel ker⁡σ are ρˉ3(σ1)=(−tt01),ρˉ3(σ2)=(101−t), and they also satisfy the braid relation; they are the matrices of the restriction of the unreduced matrices to ker⁡σ, that is, the reduction of the unreduced matrices to the invariant-covector kernel, in agreement with clause (2) of The topological and matrix Burau representations agree.

Verification

Given: the ring Λ1=Z[t±1] with its element t; n=3; the unreduced matrices B1,B2 of The unreduced Burau matrices; the vectors σ=(1,t,t2), g1=te1−e2, g2=te2−e3; the reduced representation ρˉ3 of The reduced Burau representation.

[A1] Bi is the identity outside rows and columns i,i+1 and has the block (1−tt10) there, acting on column vectors by ei↦(1−t)ei+ei+1, ei+1↦tei; matrices compose in the library order, so a word acts by the product of its matrices (The unreduced Burau matrices).

[A2] In the basis (g1,…,gn−1), gi=tei−ei+1 (1≤i≤n−1), of ker⁡σ={x:σ(x)=0} with σ=(1,t,…,tn−1), the reduced representation acts by the three-term formulas gj−1↦gj−1+gj, gj↦−tgj, gj+1↦tgj+gj+1, all other gi fixed; for n=3 this gives the two displayed 2×2 matrices (The topological and matrix Burau representations agree, clause (2); The reduced Burau representation).

[A3] σBi=σ for i=1,2, so ker⁡σ is invariant under both B1 and B2: if σ(x)=0 then σ(Bix)=σ(x)=0 (The invariant vector and the invariant covectors of the unreduced Burau, clause (b)).

[A4] Mred is free of rank n−1 and is carried onto ker⁡σ by the basis identification of the pair sequence (The reduced Burau module is free of rank n minus one, The unreduced module fits an exact sequence with the reduced module); in particular ker⁡σ is free of rank 2 for n=3.

[A5] Λ1 is an integral domain in which t≠0; hence at=0 implies a=0. Matrices record the images of basis vectors as columns (Units, powers and the domain property of the Laurent polynomial ring (a), The Laurent polynomial ring as the principal localisation of Z[t] at t).

Proof technique: direct.

1.1A1algebra

The unreduced matrices. For n=3 the block of [A1] sits in rows and columns 1,2 for B1 and in rows and columns 2,3 for B2, with all other entries those of the identity: B1=(1−tt0100001) and B2=(10001−tt010), as displayed.

1.2A1algebra

The braid relation for the unreduced matrices. Direct matrix multiplication gives B1B2=(1−tt−t2t2100010) and B2B1=(1−tt01−t0t100); multiplying on the right by B1 respectively B2 gives in both cases the matrix (1−tt−t2t21−tt0100), so B1B2B1=B2B1B2.

1.3A1A2A3A4A5algebra

The kernel basis and the restricted action. σ(g1)=t−t=0 and σ(g2)=t⋅t−t2=0, so g1,g2∈ker⁡σ; they are independent, because ag1+bg2=0 reads (at, −a+bt, −b)=0 with t≠0, so b=0, then a=0 by [A5]. They also span: if x=x1e1+x2e2+x3e3 satisfies x1+tx2+t2x3=0, set b=−x3 and a=−x2−tx3. Then ag1+bg2 has coordinates (at,−a+bt,−b)=(−tx2−t2x3,x2,x3)=(x1,x2,x3). Thus independence and this explicit spanning prove that (g1,g2) is a Λ1-basis of ker⁡σ. Since ker⁡σ is B1- and B2-invariant by [A3], the matrices act on this basis: using the actions of [A1], B1g1=t((1−t)e1+e2)−te1=−t2e1+te2=−tg1 and B1g2=t(te1)−e3=t2e1−e3=tg1+g2; likewise B2g1=te1−((1−t)e2+e3)=te1+(t−1)e2−e3=g1+g2 and B2g2=t((1−t)e2+e3)−te2=−t2e2+te3=−tg2. Reading the two images as columns gives ρˉ3(σ1)=(−tt01) and ρˉ3(σ2)=(101−t), the displayed reduced matrices.

2.1step 1.3algebra

The braid relation for the reduced matrices. Direct multiplication gives M1M2=(0−t21−t) and M2M1=(−tt−t0) for M1=(−tt01), M2=(101−t); multiplying by M1 respectively M2 gives M1M2M1=M2M1M2=(0−t2−t0), so the reduced matrices satisfy the braid relation.

3.1A2step 1.3step 2.1∎

Reduction of the unreduced matrices. Step 1.3 exhibited the restricted actions of B1,B2 on the invariant kernel ker⁡σ in the basis (g1,g2) as exactly M1,M2, and step 2.1 verified the braid relation at both levels; hence the displayed reduced matrices are the reduction of the displayed unreduced matrices to the invariant-covector kernel, and they agree with clause (2) of [A2]. AC is inherited through the cited identification of the reduced matrices with the topological representation; the matrix computations are choice free.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

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.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Specializing Burau at t = 1 recovers permutation data

Example

Let n≥2. At t=1 the unreduced Burau matrices specialize to permutation matrices: the block of The unreduced Burau matrices becomes (0110), so ρnmat(1)(σi) is the permutation matrix of the transposition (i  i+1) and the specialization factors through the surjection πn:Bn→Sn of The braid group surjects onto the symmetric group, giving the natural permutation representation of Sn on Zn. Under this specialization the invariant vector v=(1,…,1)T spans a trivial submodule, and the short exact sequence 0→ker⁡σ→Λ1n→(t−1)σ(t−1)Λ1→0 (the image part of the exact sequence of The unreduced module fits an exact sequence with the reduced module, used here only through its choice-free exactness and connecting-map clauses; its Bn-equivariance clause and the AC inherited there are not needed, and σ is the invariant covector) specializes at t=1 to 0→{x∈Zn:∑ixi=0}→Zn→ ∑ Z→0. Over Q this splits as Qn=Qv⊕{x:∑ixi=0}, with Qv trivial and the second summand the reduced permutation representation of Sn; over Z the sum Zv+{x:∑ixi=0} is only the proper sublattice {x:∑ixi≡0(modn)}, so the rational splitting is not an integral direct sum. The case n=2 gives the sign representation on the reduced summand.

Verification

Given: n≥2, the ring Λ1=Z[t±1] with its augmentation ε:Λ1→Z, t↦1 (kernel (t−1)), the matrices B1,…,Bn−1 and the homomorphism ρnmat:Bn→GL⁡n(Λ1), the vectors v=(1,…,1)T and σ=(1,t,…,tn−1).

[A1] The matrices Bi, the homomorphism ρnmat, the invariant vector v and covector σ are as in The unreduced Burau matrices, The unreduced Burau matrices satisfy the Artin relations and The invariant vector and the invariant covectors of the unreduced Burau.

[A2] The augmentation is a unital ring homomorphism with ε(tk)=1 and ker⁡ε=(t−1); the exact sequence 0→ker⁡σ→Λ1n→(t−1)σ(t−1)Λ1→0 is the image part of The unreduced module fits an exact sequence with the reduced module, with σ(x)=∑iti−1xi (The Laurent polynomial ring as the principal localisation of Z[t] at t, Ring homomorphism: additive, multiplicative, and required to send 1 to 1).

[A3] The braid group surjects onto the symmetric group by σi↦(i  i+1), and Sn has the Coxeter presentation with generators si=(i  i+1) and relations si2=1, sisi+1si=si+1sisi+1, sisj=sjsi for ∣i−j∣>1; von Dyck's theorem attaches a homomorphism to any generator assignment satisfying the relators (The braid group surjects onto the symmetric group, The symmetric group has the Coxeter presentation, Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group, The finite symmetric group Sn, one-line notation, and cycle notation).

[A4] Matrix arithmetic is entrywise over the commutative ring Λ1 or Z, and the matrix of a linear map in a fixed basis records the images of the basis vectors as columns (Invertible square matrices and similarity over a commutative ring).

Proof technique: direct.

1.1A1A2A4algebra

Specialization of the generators. Applying the augmentation ε entrywise to ρnmat gives the homomorphism Θ:=ε∗∘ρnmat:Bn→GL⁡n(Z), since ε is a unital ring homomorphism [A2]. On the generator, ε(1−t)=0 and ε(t)=1, so the block of Bi becomes (0110) and the identity entries stay 1; hence Θ(σi)=Ei, the permutation matrix of the transposition (i  i+1), namely the matrix swapping the i-th and (i+1)-st coordinates.

2.1A3step 1.1

Factorization through πn. The matrices Ei satisfy Ei2=I, EiEi+1Ei=Ei+1EiEi+1 and EiEj=EjEi for ∣i−j∣>1, because they are the matrices of the corresponding permutations of the coordinate basis. By the Coxeter presentation and von Dyck [A3] there is a homomorphism Φ:Sn→GL⁡n(Z) with Φ(si)=Ei, the natural permutation representation on Zn; then Φ∘πn and Θ are homomorphisms Bn→GL⁡n(Z) agreeing on the generators, hence equal. So the specialization factors through the surjection πn and is exactly the permutation representation.

3.1A1A2step 2.1algebra

Invariant line and the specialized sequence. Every permutation matrix fixes v, so Zv is a trivial submodule. Put N=ker⁡σ. Since σ(e1)=1, every x∈Λ1n has the unique decomposition x=(x−σ(x)e1)+σ(x)e1, giving Λ1n=N⊕Λ1e1. Consequently N∩(t−1)Λ1n=(t−1)N, and N/(t−1)N injects into Zn. Its image is the sum-zero lattice: one inclusion follows by evaluating σ(x)=0 at t=1; conversely, if xˉ∈Zn has sum zero, take its constant-coordinate lift x and replace it by x−σ(x)e1, which is in N and still reduces to xˉ. Multiplication a↦(t−1)a is an isomorphism Λ1→(t−1)Λ1, because Λ1 is a domain and t−1≠0 by Units, powers and the domain property of the Laurent polynomial ring. Thus the specialized target is (t−1)Λ1/(t−1)2Λ1≅Z, where the class of (t−1)a maps to ε(a); the map (t−1)σ becomes the sum functional. This proves the asserted specialized exact sequence, without assuming that an arbitrary specialization preserves injectivity.

4.1step 3.1algebra

Rational splitting and integral failure. Over Q every x∈Qn is (∑ixi/n)v+(x−(∑ixi/n)v) with the second summand of sum zero, and Qv∩{x:∑ixi=0}=0 because nav=0 forces a=0; both summands are preserved by the permutation action, and Qv is trivial, so the second summand is the reduced permutation representation. Over Z, an element of Zv+{x:∑ixi=0} has coordinate sum na for some a∈Z, so the sum is contained in {x:∑ixi≡0 mod n}, and conversely x with n∣∑ixi is av+y with a=(∑ixi)/n and y of sum zero; the containment is proper because (1,0,…,0) has sum 1 and n≥2. Hence the rational splitting is not an integral direct sum.

5.1step 4.1∎

The case n=2. For n=2 the sum-zero lattice is Z(1,−1), on which the transposition (1  2) acts by x↦−x, the sign representation; this is the reduced summand of step 4.1. No choice principle is used.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

An invariant line need not have an invariant complement over a Laurent ring

Statement refuted

Every invariant line in a finite free module over the Laurent ring Λ1=Z[t±1] admits an invariant complement.

Facts & Assumptions

Given: the ring Λ1=Z[t±1]; an integer n≥2; the free module W=Λ1n with standard basis e1,…,en and the unreduced Burau action ρnmat of Bn; the column vector v=(1,…,1)T and the row vector σ=(1,t,…,tn−1).

[A1]

Biv=v for every i, hence ρnmat(β)v=v for every β∈Bn; and a row vector τ satisfies τBi=τ for every i if and only if τ=c σ for some c∈Λ1 (The invariant vector and the invariant covectors of the unreduced Burau, clauses (a) and (b); the action is defined on generator matrices by The unreduced Burau matrices and extended by The unreduced Burau matrices satisfy the Artin relations).

[A2]

For n≥2 the element 1+t+⋯+tn−1 is not a unit of Λ1 (Units, powers and the domain property of the Laurent polynomial ring, clause (d)); in particular it is not a unit of the form ±tm.

Counterexample

Given: the same data as above.

Proof technique: direct.

1.1A1

The invariant line. By [A1], ρnmat(β)v=v for every β∈Bn; hence Λ1v={av:a∈Λ1} is a Bn-invariant line in the finite free module W.

1.2A1algebra

No invariant complement. Suppose, for contradiction, that C⊆W is a Λ1-submodule with W=Λ1v⊕C and ρnmat(β)(C)⊆C for every β∈Bn. Let π:W→Λ1v be the projection along C, so π is Λ1-linear, π(v)=v, and π is Bn-equivariant: writing x=av+c with a∈Λ1, c∈C, invariance of C and v give ρnmat(β)x=av+ρnmat(β)c with ρnmat(β)c∈C, so π(ρnmat(β)x)=av=π(x). Writing π(x)=λ(x)v defines a Λ1-linear functional λ:W→Λ1 with λ(v)=1 and λ(ρnmat(β)x)=λ(x) for all β∈Bn and x∈W.

2.1A1A2step 1.2∎

The contradiction. Since λ(ρnmat(β)x)=λ(x) for every β, evaluating on β=σi gives λBi=λ for every i; by the classification in [A1] there is c∈Λ1 with λ=c σ as row vectors. Then 1=λ(v)=c σ(v)=c (1+t+⋯+tn−1), so 1+t+⋯+tn−1 has the multiplicative inverse c in Λ1. This contradicts [A2] for n≥2. Hence the invariant line Λ1v has no Bn-invariant complement, and the refuted statement fails already for n=2. This is the integral obstruction behind the caveat of The reduced and unreduced Burau representations have the same kernel that its splitting Kn=ker⁡σ⊕Kv is only a field statement. AC is inherited from the cited same-kernel proposition; the module and matrix computations are choice free.

Sources