Loops of the last strand are half-twist words
ProvedBraidsLinksMCG.fadellNeuwirth_ker_image_le_halfTwistEvery loop of the last strand around an earlier puncture is a product of elementary half-twists.
Precisely: the image, under the projection to unordered configurations, of the kernel of the strand-forgetting map lies in the subgroup generated by the elementary half-twists on strands.
This is the one remaining geometric ingredient in the inductive step for Teorema 3.11, everything else about that step being proved. The kernel of the forgetting map consists of the pure braids in which only the last strand moves; by Fadell--Neuwirth it is the image of of a plane punctured at the other points, and that group is generated by the standard loops. So the statement amounts to the classical identity exhibiting the pure braid generator as a half-twist word,
read geometrically: the last strand is carried past the strands between it and the -th, made to encircle the -th by a full twist, and carried back.
Two remarks on scope.
The statement is a containment, not an equality, and deliberately so. The half-twist subgroup is the whole braid group once generation is known, whereas the kernel image is a proper subgroup of it; only one inclusion is asserted and only one is wanted.
The statement is phrased in terms of the kernel rather than in terms of the standard loops, so that a proof may choose its route. One may either identify the kernel with of the punctured plane, via BraidsLinksMCG.fadellNeuwirth_incl_injective and BraidsLinksMCG.fadellNeuwirth_range_eq_ker, and then use that the standard loops generate it; or work directly with the kernel if a more economical description is available. The first route is the classical one and is the reason this statement is currently out of reach: it needs the Fadell--Neuwirth sequence, which rests on the homotopy lifting property of a fibration that is not a covering map.
import Mathlib import Definitions.Def_BraidsLinksMCG_ConfigSpace import Definitions.Def_TarchaBraids_HalfTwist
namespace BraidsLinksMCG
open TarchaBraids
theorem fadellNeuwirth_ker_image_le_halfTwist (n : ℕ) :
Subgroup.map (FundamentalGroup.map (configProj (n + 1)) (baseOrdered (n + 1)))
(FundamentalGroup.mapOfEq (configForget n) (configForget_base n)).ker
≤ Subgroup.closure
(Set.range (fun i : Fin (n + 1 - 1) => halfTwistBraid (n + 1) i)) := by sorry
end BraidsLinksMCG