Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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 n∈N and let Fn=⟨x1,…,xn⟩ be the free group of Free group on a set of generators on the n letters x1,…,xn, with reduced words and free reduction as in Reduced words form the free group on an alphabet. The ordered boundary product is the element δ:=x1x2⋯xn∈Fn, the word x1⋯xn; under the identification of xi 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 A∈Aut⁡(Fn) (Group isomorphisms, automorphisms and the set Aut⁡(G)) is peripheral-boundary-preserving if

  1. (peripheral) for every i the element A(xi) is conjugate in Fn to one of the generators x1,…,xn; equivalently, after rewriting A(xi) in the reduced normal form of Reduced words form the free group on an alphabet, there are a permutation π of {1,…,n} and a reduced word Qi with A(xi)=Qi−1 xπ(i) Qi;and
  2. (boundary-preserving) A fixes the ordered boundary product, A(x1x2⋯xn)=x1x2⋯xn.

These are exactly the two hypotheses of Artin's characterization of the braid subgroup of Aut⁡(Fn).

The two formulations of condition 1 agree. If A(xi)=Qi−1xπ(i)Qi, its class in the abelianisation Fnab≅Zn is the class of xπ(i); conversely, an automorphism induces an automorphism of Zn, so if every A(xi) is conjugate to a generator, the assignment ei↦eπ(i) is an invertible self-map of the basis and π is a permutation. The element Qi is not unique, but it is unique up to left-multiplication by powers of the middle generator: if Q−1xjQ=R−1xjR then RQ−1 commutes with xj, hence lies in the centraliser ⟨xj⟩, so R=xjmQ for some integer m; thus the invariant content of condition 1 is "A(xi) 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 n≤1 the group Fn is trivial or infinite cyclic and the conditions are checked directly; the ordered product is x1 for n=1.
  • For n≥2 the conditions are independent. The basis transposition x1↔x2 preserves peripheral conjugacy classes and changes δ. Conversely, the substitution x1↦x1−1, x2↦x12x2, fixing the other generators, fixes δ and is an involution, hence an automorphism. Its image of x1 has abelianised class −e1, so it is not conjugate to any positive basis generator.

Depends on

Used by

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