Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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 pure braid extension splits as a semidirect product

Statement

Assume the Axiom of Choice and let n≥2, with the notation PBn, PBn−1, Fn−1 and the forgetful homomorphism φ of The Fadell-Neuwirth short exact sequence for pure braids. Then the section of the planar forgetful map from A choice-free continuous section of planar coordinate forgetting, adjusted at the basepoint by a path in the puncture fibre, induces a group homomorphism s:PBn−1⟶PBnwithφ∘s=id⁡PBn−1, and consequently the extension splits: PBn≅Fn−1⋊PBn−1, the semidirect product formed with the action of PBn−1 on the free kernel Fn−1 given by conjugation with the chosen section, g⋅x=s(g) x s(g)−1. The action depends on the chosen section and the path that adjusts it; no trivial action and no direct-product decomposition are asserted.

Facts & Assumptions

Given: the Axiom of Choice, an integer n≥2, a base configuration q=(q1,…,qn)∈Fn(int⁡D2) with q′=(q1,…,qn−1), and the fibre Mn−1=int⁡D2∖{q1,…,qn−1} of the last-coordinate forgetful map.

[A1]

The Axiom of Choice holds (The Axiom of Choice).

[F1]
[F2]

Under AC the forgetful map φ:PBn→PBn−1 of the closed-disc convention sits in the short exact sequence 1→Fn−1→κPBn→φPBn−1→1, where κ is induced by the inclusion x↦(q1,…,qn−1,x) of the fibre and φ is induced by forgetting the last coordinate; in the open-disc model these maps are i∗ and p∗ for the fibration p:Fn(int⁡D2)→Fn−1(int⁡D2), and the inclusion ι∗F identifies the two models (The Fadell-Neuwirth short exact sequence for pure braids).

[F3]

For n≥2, every path α in Mn−1 from q to the value s′(q′) of the transported planar section induces by path conjugation a homomorphism σ:π1(Fn−1(int⁡D2),q′)→π1(Fn(int⁡D2),q) with p∗∘σ=id⁡, and the conjugation isomorphism is the one of Conjugating loop classes by a path is an isomorphism of fundamental groups; the construction uses no choice principle (A choice-free continuous section of planar coordinate forgetting).

[F4]

For a short exact sequence 1→N→iG→πH→1: a homomorphic section s:H→G of π exists exactly when the extension splits, exactly when G≅(ker⁡π)⋊H compatibly with the injection and quotient, and for a given section the action is h⋅x=s(h)xs(h)−1 (Splitting lemma for groups: a section, a complement, and a semidirect-product decomposition are equivalent).

[F5]

For a group extension 1→N→E→Q→1 that admits a homomorphic section, the extension is equivalent to 1→N→N⋊Q→Q→1 for the corresponding action (A group extension splits exactly when it has a complement or a compatible semidirect-product model, and a kernel retraction forces a direct product).

[F6]

Induced maps on fundamental groups are functorial, (g∘f)∗=g∗∘f∗, and for the inclusions and forgetful maps of the two models the identity pD∘ιF=ιF∘p of maps holds because both sides forget the last coordinate (Induced fundamental-group maps are well defined, functorial and invariant under based homotopy).

Proof

technique · direct
1.1A1F1

Choice bookkeeping. By [F1] the Axiom of Choice [A1] yields DC, so the short exact sequence of [F2] is available; the explicit section itself is choice-free and AC enters only through that published sequence.

1.2F3

The based section in the open model. Fix a path α in Mn−1 from q to s′(q′), which exists by [F3] and is a single selection, not an instance of AC; by [F3] the resulting homomorphism σ:π1(Fn−1(int⁡D2),q′)→π1(Fn(int⁡D2),q) satisfies p∗∘σ=id⁡.

1.3F2

The short exact sequence. By [F2] the sequence 1→Fn−1→κPBn→φPBn−1→1 is exact, and the isomorphisms ι∗F transport the open-disc maps i∗, p∗ to κ, φ.

1.4F4F5

The splitting criterion. By [F4] a homomorphic section of φ exists exactly when the extension splits, exactly when PBn≅Fn−1⋊PBn−1 compatibly with κ and φ, with action g⋅x=s(g)xs(g)−1 for a given section; by [F5] the same conclusion is the semidirect-product model of the split extension.

1.5F6

Naturality of the transport. Both pD and p forget the last coordinate, so pD∘ιF=ιF∘p as maps; by the functoriality [F6] the induced maps satisfy p∗D∘ι∗F=ι∗F∘p∗ on fundamental groups at configurations of interior points.

2.1step 1.2step 1.3step 1.5

A section for φ. Define s:PBn−1→PBn by s:=ι∗F∘σ∘(ι∗F)−1, where ι∗F is the isomorphism of [F2] at the relevant configurations. Then φ∘s=p∗D∘ι∗F∘σ∘(ι∗F)−1=ι∗F∘p∗∘σ∘(ι∗F)−1=ι∗F∘(ι∗F)−1=id⁡PBn−1, using the naturality of step 1.5 and p∗∘σ=id⁡ from step 1.2; being a composite of group homomorphisms, s is a homomorphism.

3.1step 1.4step 2.1

The semidirect product. Step 2.1 exhibits a homomorphic section of φ, so the criterion of [F4] applies and the extension of [F2] splits with PBn≅Fn−1⋊PBn−1 and action g⋅x=s(g)xs(g)−1. The decomposition is built from the particular section s and the particular path α, both non-canonical: choosing another path or another section changes the action by an inner automorphism of Fn−1 in general, and no trivial action, direct product, or independence-of-choice statement is asserted.

The section is the based version of the explicit planar cross-section, the extension is the published choice-dependent Fadell–Neuwirth sequence, and no claim is made that the splitting is canonical. ∎

Depends on

Used by

Dependency tree · two levels

37 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