Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27
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.

The Artin presentation surjects onto the geometric braid group

Statement

Let n∈N. Write Gn for the geometric braid group of The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism, let σ1,…,σn−1 be the geometric half twists of The elementary geometric half twist, its support disc, and its opposite, with classes [σi]∈Gn, and let Bn=⟨x1,…,xn−1∣R⟩ be the Artin braid group of The braid group by Artin presentation, whose generator written there as σi is here written xi to keep it distinct from the geometric half twist. Then the assignment

φ(xi):=[σi](1≤i≤n−1)

extends to a homomorphism φ ⁣:Bn→Gn, it does so uniquely, and φ is surjective. Consequently every element of Gn is a finite product of the classes [σi]±1 of the half twists, and the composition of φ with the endpoint permutation homomorphism π ⁣:Gn→Sn is the permutation map xi↦(i i+1) of the presented group.

Only surjectivity is asserted. Nothing here shows that φ is injective, that is, that the Artin relations are a complete set of relations for the geometric braid group; the presentation is shown to surject onto Gn only. For n≤1 the presentation has no generator and Bn and Gn are both trivial, so the assertions are vacuous.

Facts & Assumptions

Given: A natural number n, the geometric braid group Gn of The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism, the Artin presentation Bn=⟨X∣R⟩ of The braid group by Artin presentation with X={σ1,…,σn−1} for n≥2 and X=∅ for n≤1, and the elementary half twists of The elementary geometric half twist, its support disc, and its opposite.

[F1]

For n≥2 the group Bn is the quotient of the free group on X={σ1,…,σn−1} by the normal closure of the relations σiσi+1σi=σi+1σiσi+1 (1≤i≤n−2) and σiσj=σjσi (∣i−j∣>1), interpreted in the sense of Group presentation by generators and relations and Relators and relations; finitely generated, finitely related, and finite presentations; for n=0 and n=1 there are no generators and Bn is the trivial group of the empty presentation (The braid group by Artin presentation, Group presentation by generators and relations, Free group on a set of generators, Group and abelian group).

[F2]

In the presentation ⟨X∣R⟩ of [F1] an equation u=v is recorded by the relator u−1v in the sense of the free group on X (Relators and relations; finitely generated, finitely related, and finite presentations, Free group on a set of generators, Group presentation by generators and relations).

[F3]

Let ⟨X∣R⟩ be a presentation, H a group, and u ⁣:X→H a function. If the evaluation of every r∈R under u is eH, then there is a unique homomorphism u‾ ⁣:⟨X∣R⟩→H with u‾([x])=u(x) for every x∈X; moreover u‾ is surjective if and only if u(X) generates H (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).

[F4]

The half twist σi and its opposite σi− are braids based at Q with classes [σi],[σi]−1∈Gn, and their endpoint permutations are the transposition of i and i+1; the endpoint permutation is a homomorphism π ⁣:Gn→Sn (The elementary geometric half twist, its support disc, and its opposite, The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism).

[F5]

For ∣i−j∣>1 the half twists satisfy [σi][σj]=[σj][σi] in Gn, and for n≤3 there are no such pairs of indices, so the assertion is vacuous (Far commutativity of elementary geometric half twists).

[F6]

For 1≤i≤n−2 the half twists satisfy [σi][σi+1][σi]=[σi+1][σi][σi+1] in Gn, and for n≤2 there is no such index, so the assertion is vacuous (The geometric three strand braid relation).

[F7]

Every braid class in Gn is a finite product of the classes [σ1],…,[σn−1] and their inverses; equivalently, the set {[σ1],…,[σn−1]} generates Gn in the sense of The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups, and for n≤1 the empty family generates the trivial subgroup {e} (Every geometric braid is isotopic to a stacking of signed elementary half twists, The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups).

Proof

technique · direct
1.1

The relators of the Artin presentation evaluate to the identity under the half-twist assignment. Assume n≥2, let X={σ1,…,σn−1} and let u ⁣:X→Gn be the assignment u(σi):=[σi]; the relators of [F1] are, by [F2], the words (σiσi+1σi)−1(σi+1σiσi+1) for 1≤i≤n−2 and (σiσj)−1(σjσi) for ∣i−j∣>1. Their evaluations are ([σi][σi+1][σi])−1[σi+1][σi][σi+1]=e by [F6] and ([σi][σj])−1[σj][σi]=e by [F5].

F1F2F5F6
1.2

The cases n≤1. For n≤1 the presentation has no generators and defines the trivial group Bn by [F1], while ⟨∅⟩={e} is the trivial subgroup of Gn and [F7] says that this empty family generates Gn, so Gn is trivial as well; the unique map Bn→Gn is therefore a group homomorphism, it is the only homomorphism between these groups, and it is surjective because its codomain is trivial.

F1F3F7
2.1

Von Dyck extends the assignment to a homomorphism. By step 1.1 the hypothesis of [F3] is satisfied, so there is a unique homomorphism φ ⁣:Bn→Gn with φ(xi)=[σi] for every generator, and φ is surjective if and only if the set of these images generates Gn.

F1F3step 1.1
3.1

Surjectivity. The images φ({σ1,…,σn−1})={[σ1],…,[σn−1]} generate Gn by [F7], so the surjectivity criterion of [F3] applies to the homomorphism of step 2.1 and φ is surjective; consequently every element of Gn is a finite product of the classes [σi]±1, and composing the unique homomorphism with the endpoint permutation homomorphism of [F4] gives the permutation map xi↦(i i+1), because π([σi]) is that transposition.

F3F4F7step 2.1
4.1

Conclusion. Steps 2.1 and 3.1 give, for n≥2, a unique homomorphism φ ⁣:Bn→Gn with φ(xi)=[σi], and step 1.2 gives the same for n≤1; in both cases φ is surjective, and no injectivity is claimed. ∎

F1F3step 2.1step 3.1step 1.2

Remarks

Depends on

Used by

Dependency tree · two levels

43 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