Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The algebraic layer: link-homotopy congruences and trivial elements

Definition
HGL_alg

by Lucas · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

braid-groupsequivalence-relationslink-homotopy

The algebraic interface of link homotopy for generalized string links over surfaces. The definition carries: a link-homotopy congruence on a monoid - an equivalence relation together with compatibility with the concatenation product, so that equivalent factors concatenate to equivalent products, the algebraic form of Lemma 3.4 of the paper - and the triviality predicate for elements of the monoid, through which the link-homotopically trivial braids of Proposition 3.6 are expressed: an element is trivial when it is equivalent to the identity under the congruence. The congruence is the interface through which the quotient structures of the paper - the class group and the quotient of the surface braid group by its trivial braids - are constructed, and it is what makes those quotients respect the concatenation product.

Definition code
import Mathlib

/-!
# The algebraic layer: link-homotopy congruences and trivial elements

The algebraic layer of the HGL mission, carrying the interface of Juliana
R. T. Theodoro de Lima, "Homotopy of braids on surfaces: extending
Goldsmith's answer to Artin" (Journal of Knot Theory and Its Ramifications
28 (2019) 1950013): the congruence on a monoid determined by the
link-homotopy moves - an equivalence relation compatible with the
concatenation product, the algebraic form of Lemma 3.4 - together with the
triviality predicate for elements equivalent to the identity, through which
the link-homotopically trivial braids of Proposition 3.6 are expressed.
-/

namespace HGL

/-- The equivalence relation generated by a relation: the inductive
closure of the relation under reflexivity, symmetry, and transitivity.
The link-homotopy relation of the world layer is the equivalence relation
generated by the elementary link-homotopy moves. -/
inductive EqvGen {S : Type*} (r : S → S → Prop) : S → S → Prop
  | refl (s : S) : EqvGen r s s
  | symm {s t : S} : EqvGen r s t → EqvGen r t s
  | trans {s t u : S} : EqvGen r s t → EqvGen r t u → EqvGen r s u
  | step {s t : S} : r s t → EqvGen r s t

/-- A link-homotopy congruence on a monoid: an equivalence relation
together with compatibility with the multiplication, the algebraic
counterpart of Lemma 3.4 of the source paper. -/
structure LinkHomotopyCongruence (S : Type*) [Monoid S] where
  /-- The underlying relation. -/
  rel : S → S → Prop
  /-- Reflexivity. -/
  refl : ∀ s : S, rel s s
  /-- Symmetry. -/
  symm : ∀ s t : S, rel s t → rel t s
  /-- Transitivity. -/
  trans : ∀ s t u : S, rel s t → rel t u → rel s u
  /-- Compatibility with the multiplication: equivalent factors concatenate
  to equivalent products. -/
  mul_compat : ∀ s t u v : S, rel s t → rel u v → rel (s * u) (t * v)

/-- The element s is trivial under the relation rel: it is equivalent to
the identity. The link-homotopically trivial braids are the braids whose
images are trivial under link-homotopy. -/
def TrivialUnder {S : Type*} [Monoid S] (rel : S → S → Prop) (s : S) : Prop :=
  rel s 1

end HGL
Source
J. R. T. Theodoro de Lima, Homotopy of braids on surfaces: extending Goldsmith's answer to Artin, Journal of Knot Theory and Its Ramifications 28 (2019) 1950013, arXiv:1811.02006, Section 3 (Lemma 3.4, the congruence of the link-homotopy relation; Proposition 3.6, the triviality predicate).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me