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.
Artin's characterization of the braid subgroup of Aut(F_n)
Statement
Assume AC. The image of the Artin representation of The Artin representation on a free group is exactly the set of peripheral-boundary-preserving automorphisms of Peripheral-boundary-preserving automorphisms of F_n; moreover is injective, so each peripheral-boundary-preserving automorphism is for a unique braid .
Facts & Assumptions
Given: AC, the free group , the Artin representation , and the set of peripheral-boundary-preserving automorphisms of .
Necessity. For every braid word , the automorphism sends each generator to a conjugate of a generator and fixes the ordered product ; hence is peripheral-boundary-preserving. This direction is choice-free. (Artin automorphisms permute meridian conjugacy classes and fix the boundary word, Peripheral-boundary-preserving automorphisms of F_n.)
Sufficiency. Every peripheral-boundary-preserving automorphism of equals for some braid word , which may be chosen as a product of the generators and their inverses; this direction is choice-free. (Every peripheral-boundary-preserving automorphism is an Artin automorphism.)
Injectivity. Assume AC. The Artin representation is injective: a braid word acts trivially on only if it represents the trivial braid. (The Artin representation is faithful.)
Proof
The image is contained in the set of peripheral-boundary-preserving automorphisms. Let be any braid word. By [F1], is conjugate to a generator for every and , so is peripheral-boundary-preserving. Hence peripheral-boundary-preserving automorphisms.
The set of peripheral-boundary-preserving automorphisms is contained in the image. Let be peripheral-boundary-preserving. By [F2] there is a braid word with ; hence .
Uniqueness of the braid. Assume for braid words . Then because is a homomorphism, so by injectivity [F3] the word represents the trivial braid, that is, in . Hence each element of the image is for a unique braid .
Equality of the two sets. Steps 1.1 and 1.2 give
Conclusion. Step 2.1 identifies the image with the set of peripheral-boundary-preserving automorphisms and step 1.3 shows that the representing braid is unique, which is the characterization of Artin. The necessity and sufficiency directions [F1] and [F2] are choice-free; AC is consumed exactly through the injectivity statement [F3], as declared in the statement. For both -automorphism conditions are checked directly on the trivial or infinite cyclic group and the same conclusions hold with the trivial braid group.
Remarks
- For the two conditions are independent: the peripheral condition alone does not suffice (
cex-permuting-meridian-conjugacy-classes-without-fixing-the-boundary-word-is-not-artin), and together they characterize the image of . - Combining the characterization with faithfulness gives that the braid group is isomorphic to the peripheral-boundary-preserving subgroup of ; this is the form in which Artin's theorem is usually quoted.
Depends on
- Artin automorphisms permute meridian conjugacy classes and fix the boundary word
- Peripheral-boundary-preserving automorphisms of F_n
- Every peripheral-boundary-preserving automorphism is an Artin automorphism
- The Artin representation is faithful
- The Artin representation on a free group
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
23 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
- Juan Gonzalez-Meneses, Basic results on braid groups, section 1.6, Theorem 1.3, printed p. 9 (standard reference, not scraped)
- Emil Artin, Theory of Braids, Annals of Mathematics 48 (1947), pp. 101-126, Theorem 16, printed pp. 113-115 (standard reference, not scraped)