Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Artin's characterization of the braid subgroup of Aut(F_n)

Statement

Assume AC. The image of the Artin representation ρ:Bn→Aut⁡(Fn) 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 Fn=⟨x1,…,xn⟩, the Artin representation ρ:Bn→Aut⁡(Fn), and the set of peripheral-boundary-preserving automorphisms of Fn.

[F1]

Necessity. For every braid word β, the automorphism ρ(β) sends each generator to a conjugate of a generator and fixes the ordered product x1⋯xn; 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.)

[F2]

Sufficiency. Every peripheral-boundary-preserving automorphism of Fn 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.)

[F3]

Injectivity. Assume AC. The Artin representation ρ is injective: a braid word acts trivially on Fn only if it represents the trivial braid. (The Artin representation is faithful.)

Proof

technique · direct, assembling necessity, sufficiency and injectivity
1.1F1

The image is contained in the set of peripheral-boundary-preserving automorphisms. Let β be any braid word. By [F1], ρ(β)(xi) is conjugate to a generator for every i and ρ(β)(x1⋯xn)=x1⋯xn, so ρ(β) is peripheral-boundary-preserving. Hence im⁡ρ⊆{peripheral-boundary-preserving automorphisms}.

1.2F2

The set of peripheral-boundary-preserving automorphisms is contained in the image. Let A be peripheral-boundary-preserving. By [F2] there is a braid word β with A=ρ(β); hence A∈im⁡ρ.

1.3F3

Uniqueness of the braid. Assume ρ(β1)=ρ(β2) for braid words β1,β2. Then ρ(β1β2−1)=ρ(β1)ρ(β2)−1=id⁡ because ρ is a homomorphism, so by injectivity [F3] the word β1β2−1 represents the trivial braid, that is, β1=β2 in Bn. Hence each element of the image is ρ(β) for a unique braid β.

2.1step 1.1step 1.2

Equality of the two sets. Steps 1.1 and 1.2 give im⁡ρ={A∈Aut⁡(Fn):A is peripheral-boundary-preserving}.

3.1F1F2F3step 2.1step 1.3∎

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 n≤1 both Fn-automorphism conditions are checked directly on the trivial or infinite cyclic group and the same conclusions hold with the trivial braid group.

Remarks

  • For n≥2 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 Aut⁡(Fn); this is the form in which Artin's theorem is usually quoted.

Depends on

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