Pure braids are products of half-twists
ProvedTarchaBraids.pureBraid_le_halfTwist_closureEvery pure braid is a product of elementary half-twists: the image of the pure braid group in the geometric braid group, under the map induced by the projection from ordered to unordered configurations, is contained in the subgroup generated by the classes .
This is the substantive half of Teorema 3.11. Generation of the full braid group splits into two parts along the exact sequence . The quotient part is easy, since the half-twists map onto the adjacent transpositions and those generate the symmetric group; given that, an arbitrary braid can be corrected by a product of half-twists until it becomes pure, and what remains is to know that pure braids are already products of half-twists. That is the statement here.
Classically it is proved by the Fadell–Neuwirth induction. Forgetting the last point gives a fibration of the ordered configuration space over the ordered configuration space on one fewer point, with fibre a punctured plane; the resulting short exact sequence
splits, so is generated by together with the free factor. The free factor is generated by the loops in which the last strand encircles one earlier strand, and each is an explicit word in half-twists --- conjugating by a product of half-twists that carries strand into position. Induction on finishes.
Stated as a containment rather than an equality because the reverse inclusion is false in general: the half-twists themselves are not pure.
import Mathlib import Definitions.Def_BraidsLinksMCG_ConfigSpace import Definitions.Def_TarchaBraids_HalfTwist
namespace TarchaBraids
open BraidsLinksMCG
theorem pureBraid_le_halfTwist_closure (n : ℕ) :
(FundamentalGroup.map (configProj n) (baseOrdered n)).range ≤
Subgroup.closure (Set.range (fun i : Fin (n - 1) => halfTwistBraid n i)) := by sorry
end TarchaBraids