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.
Peripheral-boundary-preserving automorphisms of F_n
Definition
Let and let
be the free group of Free group on a set of generators on
the letters , with reduced words and free reduction as in
Reduced words form the free group on an alphabet. The ordered boundary product is
the element
the word ; under the identification of with the class of
the standard meridian of Standard meridians of a punctured disk it is
the element represented by the positively oriented boundary loop (proved in
lem-the-oriented-boundary-loop-represents-the-ordered-product-of-the-standard-meridians).
An automorphism (Group isomorphisms, automorphisms and the set ) is peripheral-boundary-preserving if
- (peripheral) for every the element is conjugate in to one of the generators ; equivalently, after rewriting in the reduced normal form of Reduced words form the free group on an alphabet, there are a permutation of and a reduced word with
- (boundary-preserving) fixes the ordered boundary product,
These are exactly the two hypotheses of Artin's characterization of the braid subgroup of .
The two formulations of condition 1 agree. If , its class in the abelianisation is the class of ; conversely, an automorphism induces an automorphism of , so if every is conjugate to a generator, the assignment is an invertible self-map of the basis and is a permutation. The element is not unique, but it is unique up to left-multiplication by powers of the middle generator: if then commutes with , hence lies in the centraliser , so for some integer ; thus the invariant content of condition 1 is " is conjugate to a generator", and the displayed form is a normalised way of writing that conjugacy. Condition 2 fixes the ordered product itself, not merely its conjugacy class or its image in the abelianisation. No choice principle is used in this definition.
Remarks
- For the group is trivial or infinite cyclic and the conditions are checked directly; the ordered product is for .
- For the conditions are independent. The basis transposition preserves peripheral conjugacy classes and changes . Conversely, the substitution , , fixing the other generators, fixes and is an involution, hence an automorphism. Its image of has abelianised class , so it is not conjugate to any positive basis generator.
Depends on
Used by
- A conjugate-permuting automorphism that does not fix the boundary word is not in the braid image Counterexample
- An extremal cancellation shortens an Artin substitution Lemma
- Artin's product-cancellation dichotomy Lemma
- Artin's characterization of the braid subgroup of Aut(Fₙ) Theorem
- Every peripheral-boundary-preserving automorphism is an Artin automorphism Theorem
Dependency tree · two levels
13 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
- Emil Artin, Theory of Braids, Annals of Mathematics 48 (1947), pp. 101-126, equations (11), (13), (16) and Theorem 16, printed pp. 111-115 (standard reference, not scraped)
- Juan Gonzalez-Meneses, Basic results on braid groups, section 1.6, Theorem 1.3 and the preceding paragraph (the two necessary conditions), printed pp. 9-10 (standard reference, not scraped)