Inductive step: pure braids on one more strand are half-twist words
ProvedTarchaBraids.pureBraid_le_halfTwist_closure_stepThe inductive step for the generation of the braid group by half-twists: if every pure braid on strands is a product of half-twists, the same holds on strands.
Precisely, the image of in lying inside the subgroup generated by the elementary half-twists implies the corresponding statement with replaced by .
The base case is elementary and is proved in the parent submission: for the unordered configuration space is a single point, so its fundamental group is trivial and the containment is vacuous. Everything else follows by induction from the step asserted here.
The classical argument is Artin combing, and three of its four ingredients are already available on the platform.
The pure braid group on strands is generated by the kernel of the strand-forgetting map together with the image of a section of that map; this is BraidsLinksMCG.pureBraid_ker_sup_section_eq_top, which is proved, and it rests in turn on the explicit section BraidsLinksMCG.pureBraid_forget_section, also proved, which adjoins a point lying to the right of all the others.
The kernel is identified with the fundamental group of a punctured plane by the Fadell--Neuwirth exact sequence, BraidsLinksMCG.fadellNeuwirth_incl_injective and BraidsLinksMCG.fadellNeuwirth_range_eq_ker. That group is free on the standard loops, by BraidsLinksMCG.puncturedPlaneGroup_free_on_standardGen.
What is left, and what this statement packages, is the geometric computation that each standard loop --- the last strand encircling one earlier puncture --- projects to a product of elementary half-twists, together with the bookkeeping that carries the inductive hypothesis across the section. In the classical notation the first of these is the identity
exhibiting the pure braid generator as a half-twist word; the second is the observation that adding a far-right strand carries half-twists to half-twists.
Stating the step rather than the whole theorem means the induction, which is routine, does not have to be redone, and it isolates the two genuinely geometric facts above.
import Mathlib import Definitions.Def_BraidsLinksMCG_ConfigSpace import Definitions.Def_TarchaBraids_HalfTwist
namespace TarchaBraids
open BraidsLinksMCG
theorem pureBraid_le_halfTwist_closure_step (n : ℕ)
(ih : (FundamentalGroup.map (configProj n) (baseOrdered n)).range ≤
Subgroup.closure (Set.range (fun i : Fin (n - 1) => halfTwistBraid n i))) :
(FundamentalGroup.map (configProj (n + 1)) (baseOrdered (n + 1))).range ≤
Subgroup.closure
(Set.range (fun i : Fin (n + 1 - 1) => halfTwistBraid (n + 1) i)) := by sorry
end TarchaBraids