Alphabeta Math
DefinitionDefinition: 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 unreduced Burau matrices

Definition

Let U=H1(X~,p−1d;Z) be the unreduced Burau module over Λ1=Z[t±1] (The unreduced Burau relative homology module) and use the relative lifted-edge basis e1,…,en of the lifted spine Σ, where for the design's conventions ei is the relative class of the i-th lifted spine edge taken at deck level i−1: ei=ti−1ϵi with ϵi the level-0 class of The cyclic cover retracts onto the lifted flower and has a deck-equivariant spine model. The unreduced Burau matrices are the matrices B1,…,Bn−1∈GL⁡n(Λ1) that are the identity outside rows and columns i,i+1 and whose 2×2 block in rows and columns i,i+1 is Bi=(1−tt10), acting on column vectors: the first column is the image of ei and the second the image of ei+1, so ei↦(1−t)ei+ei+1 and ei+1↦tei. Each Bi is invertible with Bi−1=t−1(0t1t−1), since det⁡Bi=−t is a unit of Λ1. The assignment σi↦Bi defines a representation of the presented braid group only through The unreduced Burau matrices satisfy the Artin relations ↗; its topological meaning on U is The topological and matrix Burau representations agree ↗. Convention: matrix multiplication follows the library composition order, so a braid word σi1⋯σik acts by Bi1⋯Bik on column vectors, the rightmost letter acting first; this displayed block and that order control every later matrix.

Facts & Assumptions

Given: n≥1, the unreduced Burau module U with its Λ1-module structure, the relative lifted-edge basis ϵ1,…,ϵn of the lifted spine Σ, and the ring Λ1=Z[t±1].

[F1]

The deck-equivariant homotopy equivalence of pairs identifies U=H1(X~,p−1d;Z) with H1(Σ,Σ0), which is the free Λ1-module ⨁i=1nΛ1ϵi on the relative classes of the level-0 edges; the deck generator acts by t⋅ϵi=ϵi(1), the level-1 class (The cyclic cover retracts onto the lifted flower and has a deck-equivariant spine model, The unreduced Burau relative homology module).

[F2]

t is a unit of Λ1, so every power ti−1 is a unit and −t is a unit; multiplication by a unit carries a basis to a basis (The Laurent polynomial ring as the principal localisation of Z[t] at t, Units, powers and the domain property of the Laurent polynomial ring).

[F3]

GL⁡n(Λ1) is the group of invertible n×n matrices over Λ1, the matrix of a Λ1-linear map in a fixed basis has as its columns the images of the basis vectors, and the determinant of a square matrix is computed from its entries; a 2×2 matrix (abcd) has determinant ad−bc (Invertible square matrices and similarity over a commutative ring, The Leibniz formula gives det⁡(abcd)=ad−bc, A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit).

Proof

technique · direct
1.1F1F2

The relative lifted-edge basis. By [F1] the classes ϵ1,…,ϵn form a Λ1-basis of U; since ei=ti−1ϵi differs from ϵi by the unit ti−1 by [F2], the family e1,…,en is again a Λ1-basis of U. In particular every element of U has a unique expression ∑i=1nciei with ci∈Λ1.

1.2F2F3algebra

Invertibility. Put Ci:=t−1(0t1t−1)=(01t−1(t−1)t−1), the identity outside the same block. Multiplying the two 2×2 blocks in the order BiCi gives (1−tt10)(01t−1(t−1)t−1)=(1(1−t)+(t−1)01)=I2, and the reverse order gives I2 by the same computation, so BiCi=In=CiBi: Bi is invertible with inverse Ci, and det⁡Bi=(1−t)⋅0−t⋅1=−t by the 2×2 formula, a unit of Λ1 by [F2].

2.1F3step 1.1

The block action. For i∈{1,…,n−1} let Bi be the identity outside rows and columns i,i+1 with the displayed 2×2 block. By the column convention of [F3] the images of the basis vectors are the columns of Bi, namely ei↦(1−t)ei+ei+1, ei+1↦tei and ej↦ej for j∉{i,i+1}; these three formulas determine Bi uniquely as a Λ1-linear map on U followed by the chosen basis.

3.1F1F3step 1.1step 2.1∎

Conventions and what is deferred. The assignment σi↦Bi is defined for 1≤i≤n−1; that it extends to a homomorphism on the presented braid group of The braid group by Artin presentation requires the Artin relations verified in The unreduced Burau matrices satisfy the Artin relations ↗, and that its action on U is realised by the geometric half twists is The topological and matrix Burau representations agree ↗; both are proved later on this page and are not used here. Matrices act on column vectors, and a word σi1⋯σik acts by Bi1⋯Bik with the rightmost letter first, matching the library's leftmost-outermost composition convention of [F3].

Depends on

Used by

Dependency tree · two levels

60 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