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 module fits an exact sequence with the reduced module
Statement
Assume AC (inherited through the lift of braid mapping classes, used only for the -equivariance clause below; the exact sequence and the connecting-map computation are choice free). Let , , and identify with the Laurent polynomial ring of The Laurent polynomial ring as the principal localisation of Z[t] at t by sending the class of the fixed lift to ; let be the augmentation of that item (sum of coefficients). Then the long exact sequence of the pair gives an exact sequence of -modules in which the first map is induced by inclusion and is injective because and , and the last map is the augmentation because and every component of meets the fibre. In the relative lifted-edge basis of The unreduced Burau matrices the connecting map is , equivalently against the invariant covector of The invariant vector and the invariant covectors of the unreduced Burau; it is -equivariant, and is exactly the image of , carried to under the basis identification. The element is invariant but lies outside since . No integral complement is asserted: the exact sequence is not claimed to split over , The invariant complement obtained after extension to the fraction field need not be an integral complement.
Facts & Assumptions
Given: , the cover with deck group , the fibre , the modules and with their -structures, and the relative lifted-edge basis of .
Singular simplices into the discrete set are constant: is path-connected hence connected, a continuous image of a connected space is connected, and a connected subset of a discrete space is a single point (The standard topological simplex and its affine face maps, Every path-connected space is connected, and every path component lies inside a component, A continuous image of a connected space is connected, and connectedness is a topological property, The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Singular simplices and singular chain groups with coefficients).
The singular boundary of a constant -simplex is the alternating sum of its equal faces (The singular boundary operator); of a space is free on its path components, and of a nonempty path-connected space is (Zero-th singular homology is free on path components, The singular chain complex and singular homology).
The pair gives the long exact sequence and the connecting map is given on a relative cycle by ; a map of pairs induces a commuting morphism of the long exact sequences, including the connecting maps (Long exact sequence of a pair, Relative connecting homomorphism on cycles, Relative singular homology, Naturality of the pair long exact sequence).
The deck group acts on the pair, making all terms of [F3] -modules and all maps -linear; the braid lifts of Braid mapping classes lift equivariantly to the Burau cover fix pointwise and commute with the deck action, so they act trivially on and make -equivariant (The reduced Burau homology module, The unreduced Burau relative homology module, Braid mapping classes lift equivariantly to the Burau cover, Naturality of the pair long exact sequence).
The spine of The cyclic cover retracts onto the lifted flower and has a deck-equivariant spine model identifies with relative basis ; the connecting map of sends the oriented edge class from to to ; the design basis is .
is an integral domain, , and the augmentation sends , so is -linear and (The Laurent polynomial ring as the principal localisation of Z[t] at t, Units, powers and the domain property of the Laurent polynomial ring).
Proof
The homology of the fibre. Let . Since is discrete, every singular simplex is constant by [F1]; hence is free on and, by [F2], the boundary of the constant simplex at is in degree . Therefore on and is the identity on , so and is free on the fibre.
The -identifications. The deck action is free and transitive on -torsor , so is the free -module of rank one on the class of , with ; we identify it with , . The spine is path-connected: its vertices are joined by finite strings of edges of type , and every point of an edge is joined to an endpoint. The homotopy equivalences of [F5] therefore make path-connected, so by [F2], and the map sends every point class to the single generator; under the identification this is , which is -linear with kernel by [F6].
The connecting map on the basis. Use the deck-equivariant identification of [F5], under which identifies with ; naturality of the pair sequence [F3] identifies the connecting maps. For the relative class of the oriented edge from to , the boundary is , so in ; for the design basis this gives . Hence for one has , so . Since is a domain and by [F6], .
The exact sequence. The long exact sequence [F3] of the pair reads . By step 1.1 the first term vanishes, so the first map is injective with image ; by step 1.2 the map is surjective, so by exactness and the displayed segment is the asserted four-term sequence of -modules. All maps are -linear by [F4], so the sequence is a sequence of -modules; the annihilation of and the identification of the last map with are step 1.2.
Consequences and non-splitting. By exactness in step 2.1 the image of in is exactly , which step 1.3 identifies with ; the invariant vector of The invariant vector and the invariant covectors of the unreduced Burau satisfies , a product of two nonzero elements of the domain by [F6] and The invariant vector and the invariant covectors of the unreduced Burau(c), hence nonzero; so . Nothing in the argument produces a -linear splitting of the sequence, and none is asserted; the integral structure is exactly the displayed four terms. AC enters only through the -equivariance clause, via the braid lifts of [F4]; the exact sequence, the fibre computation, the connecting map and the non-splitting observation are choice free.
Depends on
- The unreduced Burau matrices
- The unreduced Burau relative homology module
- The reduced Burau homology module
- The cyclic cover retracts onto the lifted flower and has a deck-equivariant spine model
- The invariant vector and the invariant covectors of the unreduced Burau
- The unreduced Burau matrices satisfy the Artin relations
- Braid mapping classes lift equivariantly to the Burau cover
- Long exact sequence of a pair
- Naturality of the pair long exact sequence
- Relative connecting homomorphism on cycles
- Relative singular homology
- Singular simplices and singular chain groups with coefficients
- The singular boundary operator
- The standard topological simplex and its affine face maps
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies
- Every path-connected space is connected, and every path component lies inside a component
- A continuous image of a connected space is connected, and connectedness is a topological property
- Homotopy equivalences induce isomorphisms on singular homology
- Zero-th singular homology is free on path components
- The singular chain complex and singular homology
- The Laurent polynomial ring as the principal localisation of Z[t] at t
- Units, powers and the domain property of the Laurent polynomial ring
- The Axiom of Choice
Used by
- Specializing Burau at t = 1 recovers permutation data Example
- Unreduced and reduced Burau matrices for three strands Example
- The Burau determinant recovers the Alexander polynomial of a closed braid Proposition
- The reduced and unreduced Burau representations have the same kernel Proposition
- The topological and matrix Burau representations agree Theorem
Dependency tree · two levels
114 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
- Joan S. Birman and Tara E. Brendle, Braids: A Survey (background on Burau matrices, the cyclic cover and absolute homology) (standard reference, not scraped)
- Vasudha Bharathram, Joan S. Birman and Tara E. Brendle, The Burau representation is faithful for n = 4, arXiv:2607.05283v1 (6 July 2026), section 2 (printed pp. 1-5) (standard reference, not scraped)