Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The descended loop-reading homomorphism is surjective (Lemma 2.14)

Proved
ESL.theta_hat_surjective

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

exact-sequenceslink-homotopysurjectivity

Every descent of the loop-reading homomorphism to the link-homotopy quotient is surjective: every element of the target group is the loop tuple of some pure braid of the surface, and every class is the class of some pure braid, so every element of the target is the image of some class under the descended map. This is the surjectivity part of Lemma 2.14.

Preamble
import Mathlib
import Definitions.Def_ESL_alg
import Definitions.Def_ESL_tor
Formal statement
namespace ESL

/-!  Milestone 2 (Lemma 2.14): the induced homomorphism theta-hat from the
link-homotopy classes of pure braids on the surface to the n-fold product
of the fundamental group is surjective. Every element of the product is
the image of a pure braid, and the quotient map is surjective, so the
descent is surjective as well. -/
theorem theta_hat_surjective {n : ℕ} {PB_D PB_M HhatD HhatM Pi : Type*}
    [Group PB_D] [Group PB_M] [Group HhatD] [Group HhatM] [Group Pi]
    (W : StringLinkExactWorld n PB_D PB_M HhatD HhatM Pi) :
    ∀ thetahat : HhatM →* Pi, (∀ x : PB_M, thetahat (W.qM x) = W.theta x) →
      ∀ y : Pi, ∃ c : HhatM, thetahat c = y := by sorry

end ESL
Source
J. R. T. Theodoro de Lima, An exact sequence for generalized string links over surfaces, LAJM - Latin-American Journal of Mathematics 2 (2023) no. 1, Section 2 (Lemma 2.14, the surjectivity part).
Read-back

What the Lean code literally says, in plain math · glm-5-latest-short

Restate: in the world of the exact sequence, any homomorphism from the link-homotopy quotient of the surface pure braid group to the target group that commutes with the quotient map as the loop-reading homomorphism does hits every element of the target group. Hypotheses: the world is given; the homomorphism is assumed to satisfy the descent commutation; no further hypotheses appear.

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