The link-homotopy relation is a congruence for the concatenation product (Lemma 3.4)
ProvedHGL.homotopy_congruenceIf two generalized string links are link-homotopic and two further generalized string links are link-homotopic, then their concatenations are link-homotopic. The elementary link-homotopy moves are compatible with concatenation on either side - carried by the world - and this one-sided compatibility lifts through the equivalence closure of the moves to the componentwise compatibility of products: link homotopy is a congruence for the concatenation product of the monoid of generalized string links, the algebraic form of Lemma 3.4.
import Mathlib import Definitions.Def_HGL_alg import Definitions.Def_HGL_tor
namespace HGL
/-! Milestone 1 (Lemma 3.4): the link-homotopy equivalence relation is
compatible with concatenation: if two generalized string links are
link-homotopic, then so are the products with any other generalized string
link, on either side, and componentwise products of homotopic links are
homotopic. The proof lifts the one-sided compatibility of the elementary
moves through the equivalence closure by induction. -/
theorem homotopy_congruence {n g : ℕ} {B S Cl : Type*} [Group B] [Monoid S] [Group Cl]
(W : LinkHomotopyWorld n g B S Cl) :
∀ s t u v : S, EqvGen W.moves s t → EqvGen W.moves u v →
EqvGen W.moves (s * u) (t * v) := 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, if the first pair of generalized string links is link-homotopic and the second pair is link-homotopic, then the concatenation of the first elements of the two pairs is link-homotopic to the concatenation of the second elements. Hypotheses: the world of generalized string links over the surface is given; the four homotopies are witnesses of the equivalence closure of the elementary moves; no further hypotheses appear.