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.
A linear representation need not be faithful
Statement refuted
Exhibiting a finite-dimensional linear representation of a group already exhibits a faithful one.
Counterexample
Given: , the classical braid group with its Artin presentation and generators (The braid group by Artin presentation), and a field .
The endpoint permutation. Since the transpositions satisfy and for , the assignment , , respects the Artin presentation and is a homomorphism. Composing it with the standard permutation representation gives a linear representation of degree over any field.
The kernel is nontrivial. The exponent-sum map , , is well defined because every Artin relator has equal total exponent on both sides; hence and in . The element is pure: its image under is . Therefore is a nontrivial element of , and a fortiori of ; for the kernel of the permutation representation is the nontrivial pure braid group.
Linear does not mean faithful. Thus for every the group admits the linear representation of degree with . Linearity of is therefore not witnessed by an arbitrary representation: the content of Every classical braid group is linear lies in the faithfulness of , not merely in the existence of a representation, and the claim stated above is refuted.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- Bigelow, Braid groups are linear, J. Amer. Math. Soc. 14 (2001) 471-486 (standard reference, not scraped)
- Kassel and Turaev, Braid Groups, Graduate Texts in Mathematics 247 (standard reference, not scraped)