A standard loop projects to a half-twist word
ProvedBraidsLinksMCG.standardGen_image_mem_halfTwistThe image of a standard loop is a product of elementary half-twists.
Precisely: take the -th standard loop of the plane punctured at points, include it as the last strand of a configuration of points, and project to unordered configurations. The resulting braid lies in the subgroup generated by the elementary half-twists.
This is the classical identity exhibiting a pure braid generator as a half-twist word,
read geometrically. The standard loop runs the last strand out along a parabola, once around the -th puncture, and back. As a braid this is: carry the last strand leftwards past the strands lying between it and the -th, which is the word ; perform a full twist with the -th strand, which is the encircling; then carry it back, which is the inverse word.
Everything around this statement is now discharged. The inductive step for generation is proved from it together with the combing skeleton and the fact that adding a far-right strand sends half-twists to half-twists; the reduction of that step to this statement goes through the Fadell--Neuwirth identification of the kernel with the fundamental group of the punctured plane and the fact that the standard loops generate that group.
Two remarks on why it is stated this way.
It is stated for the image of a standard loop rather than for an abstractly given generator, because the generators must be named for the statement to have content: an unspecified free basis of carries no information about which braid its elements become. The loops are constructed explicitly in Def_BraidsLinksMCG_StandardLoops for exactly this reason.
It asks only for membership in the half-twist subgroup, not for the explicit word above. A proof may produce whatever word is convenient; the displayed identity is the classical choice, and the geometric reading is what a formal proof would have to reproduce, most directly by exhibiting a homotopy between the projected standard loop and the corresponding concatenation of half-twist loops.
import Mathlib import Definitions.Def_BraidsLinksMCG_ConfigSpace import Definitions.Def_BraidsLinksMCG_StandardLoops import Definitions.Def_TarchaBraids_HalfTwist
namespace BraidsLinksMCG
open TarchaBraids
theorem standardGen_image_mem_halfTwist (n : ℕ) (j : Fin n) :
(FundamentalGroup.map (configProj (n + 1)) (baseOrdered (n + 1)))
((FundamentalGroup.mapOfEq (configIncl n) (configIncl_base n)) (standardGen n j))
∈ Subgroup.closure
(Set.range (fun i : Fin (n + 1 - 1) => halfTwistBraid (n + 1) i)) := by sorry
end BraidsLinksMCG