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 representation detects every power of the fourth power of the half twist in B3
Statement
Assume AC (inherited through the definition of the reduced representation and the agreement theorem with the topological representation). Let be the half twist of and let be the reduced Burau representation in the basis of The topological and matrix Burau representations agree, over . Then for every , and if and only if . Consequently no nonzero power , , lies in the kernel of , and the cyclic subgroup maps isomorphically onto its image under .
Facts & Assumptions
Given: AC; the half twist of ; the reduced representation in the basis ; the ring with its element .
In the basis , , , and for the full twist (The topological and matrix Burau representations agree).
is a group homomorphism; hence for every and every , where negative powers are taken in the group (The reduced Burau representation).
in for every integer (Units, powers and the domain property of the Laurent polynomial ring, clause (b)).
is the full twist of and for every (The Garside half twist and simple positive braids).
Proof
The full twist in the reduced representation. Write and as in [F1]. Since is a homomorphism and by [F4], in the composition order of the conventions. Direct computation gives and , so , confirming the displayed value .
All powers of the fourth power. For , by [F2], [F4] and step 1.1. For set ; the matrix is invertible with inverse , and , so , the same formula. Hence for every .
Detection. The scalar matrix equals if and only if in , and by [F3] applied to this holds if and only if , that is, if and only if . Therefore is possible only for : no nonzero power of lies in the kernel. Consequently the restriction of the homomorphism to the cyclic subgroup has trivial kernel, so it is injective and maps that subgroup isomorphically onto its image.
Depends on
Used by
Dependency tree · two levels
30 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), Introduction and section 2 (printed pp. 1-5) (standard reference, not scraped)