The short exact sequence of the pure link-homotopy classes (Proposition 3.8)
ProvedHGL.pure_sequence_exactThe permutation map of the class group onto the symmetric group is surjective, and its kernel is exactly the set of classes of pure braids: a class is pure - represented by a braid with trivial permutation - exactly when it lies in the kernel. The sequence from the pure link-homotopy classes through the class group onto the symmetric group is therefore short exact, the sequence of Proposition 3.8.
import Mathlib import Definitions.Def_HGL_alg import Definitions.Def_HGL_tor
namespace HGL
/-! Milestone 6 (Proposition 3.8): the short exact sequence from the pure
link-homotopy classes to the full class group and onto the symmetric
group. The permutation map of the class group is surjective - every
permutation is realized by a braid - and its kernel is exactly the set of
classes of pure braids, so the sequence of Proposition 3.8 is exact. -/
theorem pure_sequence_exact {n g : ℕ} {B S Cl : Type*} [Group B] [Monoid S] [Group Cl]
(W : LinkHomotopyWorld n g B S Cl) :
(∀ p : Equiv.Perm (Fin n), ∃ c : Cl, W.permCl c = p) ∧
(∀ c : Cl, W.permCl c = 1 ↔ ∃ b : B, W.perm b = 1 ∧ W.cls (W.incl b) = c) := by sorry
end HGL
Read-back
What the Lean code literally says, in plain math · glm-5-latest-short
Restate: in a link-homotopy world, every permutation of the strands is the permutation of some class, and a class has trivial permutation exactly when it is the class of the image of a pure braid - a braid whose own permutation is trivial. Hypotheses: the world is given; no further hypotheses appear.