Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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 reduced Burau homology module

Definition

Let p:X~→X be the Burau infinite cyclic cover of The Burau infinite cyclic cover with deck generator t, and let Λ1=Z[t±1] be the Laurent polynomial ring of The Laurent polynomial ring as the principal localisation of Z[t] at t. The reduced Burau module is the absolute singular homology Mred:=H1(X~;Z) (The singular chain complex and singular homology) equipped with the left Λ1-module structure on which tk acts by the induced automorphism (Ttk)∗ of the deck transformation Ttk, extended uniquely to a unital ring homomorphism Λ1→End⁡Z(Mred) (Deck transformations and the deck-transformation group of a covering).

Conventions. Integral coefficients and ordinary absolute singular homology are used. Deck transformations act on the left. The module structure is defined by the deck action through the universal property below and is not an extra choice.

Facts & Assumptions

Given: The Burau infinite cyclic cover p:X~→X, its deck group Deck⁡(X~/X)={Ttk:k∈Z} generated by Tt=t, and the abelian group Mred=H1(X~;Z).

[F1]

Λ1 has the universal property that every unital ring homomorphism Z[t]→A carrying t to a unit of A extends uniquely to a unital ring homomorphism Λ1→A; equivalently, each unit u of a unital ring A determines a unique unital ring homomorphism Λ1→A with t↦u (The Laurent polynomial ring as the principal localisation of Z[t] at t).

[F2]

A continuous map f:X~→X~ induces chain maps f#,n and homomorphisms Hn(f#), functorially: Hn(g∘f)=Hn(g)∘Hn(f) and Hn(id⁡)=id⁡ (The induced singular chain map of a continuous map, Singular chains and singular homology are covariantly functorial).

[F3]

Each deck transformation Ttk is a homeomorphism of X~ over X, the deck group is a group under composition with Ttk∘Ttl=Ttk+l and Ttk−1=Tt−k, and it acts on X~ on the left (Deck transformations and the deck-transformation group of a covering, The Burau infinite cyclic cover).

[F4]

Mred=H1(X~;Z) is the degree-one homology of the singular chain complex with integral coefficients (The singular chain complex and singular homology).

Proof

technique · direct
1.1F2F3F4

Each deck transformation induces an automorphism. By [F3] each Ttk is a homeomorphism, so by [F2] it induces (Ttk)∗:=H1((Ttk)#), an endomorphism of Mred. Since Ttk∘Tt−k=id⁡=Tt−k∘Ttk by [F3], functoriality in [F2] gives (Ttk)∗∘(Tt−k)∗=id⁡ and (Tt−k)∗∘(Ttk)∗=id⁡; hence each (Ttk)∗ is an automorphism of Mred, and t∗:=(Tt)∗ is a unit of the ring End⁡Z(Mred) with inverse (Tt−1)∗.

2.1F1step 1.1

The Λ1-module structure. By [F1] applied directly to the unital ring End⁡Z(Mred), where the inverse of t∗ was proved in step 1.1, the unit t∗ determines a unique unital ring homomorphism φ:Λ1⟶End⁡Z(Mred),t⟼t∗, and we let Λ1 act on Mred through φ. This gives Mred the structure of a left Λ1-module, since Λ1 is commutative; it is well defined because φ is unique, so no further choice enters.

3.1F2F3step 2.1∎

The action of tk is the induced automorphism. Since φ is a unital ring homomorphism, φ(tk)=φ(t)k=(t∗)k for every k∈Z, and by functoriality of [F2] applied to the composition of Tt with itself, (t∗)k=(Ttk)∗. Hence tk acts on Mred exactly by (Ttk)∗, as asserted, and in particular the action is the deck action and not an additional datum. No choice principle is used.

Depends on

Used by

Dependency tree · two levels

40 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