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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

50 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