Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Retracts of locally equiconnected spaces

Open
QAlgorithms.Papers.Independent.Intakenext100.P83.retract_lec_closedCofibration

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

A topological space is locally equiconnected (LEC) when its diagonal into its square is a closed cofibration. Let i:A↪Xi:A\hookrightarrow Xi:A↪X be a subspace inclusion, and let r:X→Ar:X\to Ar:X→A be a continuous retraction, so r∘i=idAr\circ i=\mathrm{id}_Ar∘i=idA​. If XXX is LEC, then

i is a closed cofibration,A is LEC.i\text{ is a closed cofibration},\qquad A\text{ is LEC}.i is a closed cofibration,A is LEC.

This preserves both the homotopy extension property of the inclusion and the local equiconnectivity of the retract. The formalization uses the equivalent cylinder-corner retraction definition of a closed cofibration.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P83
Formal statement
open CategoryTheory

open scoped Simplicial

namespace QAlgorithms.Papers.Independent.Intakenext100.P83

universe u v

/-- Theorem 5.1, PDF p. 21. A retract inclusion of a locally equiconnected
space is a closed cofibration, and its domain is locally equiconnected.
`hi` records precisely that the domain has the subspace topology. -/
theorem retract_lec_closedCofibration
    {A : Type u} {X : Type v} [TopologicalSpace A] [TopologicalSpace X]
    (i : C(A, X)) (hi : Topology.IsEmbedding i)
    (r : C(X, A)) (hr : Function.LeftInverse r i)
    (hX : IsLocallyEquiconnected X) :
    IsClosedCofibration i ∧ IsLocallyEquiconnected A := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P83
Source
Two-Categorical Bundles and Their Classifying Spaces, arXiv:math/0612549v2, PDF p. 21, Theorem 5.1
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let AAA and XXX be arbitrary topological spaces, let i:A→Xi:A\to Xi:A→X be a continuous topological embedding, and let r:X→Ar:X\to Ar:X→A be continuous with r(i(a))=ar(i(a))=ar(i(a))=a for every a∈Aa\in Aa∈A. Assume that the diagonal ΔX(x)=(x,x)\Delta_X(x)=(x,x)ΔX​(x)=(x,x) is a topological embedding with closed image and that the subspace DX={(t,(x,y))∈[0,1]×(X×X):t=0 or x=y}D_X=\{(t,(x,y))\in[0,1]\times(X\times X):t=0\ \text{or}\ x=y\}DX​={(t,(x,y))∈[0,1]×(X×X):t=0 or x=y} admits a continuous retraction from [0,1]×(X×X)[0,1]\times(X\times X)[0,1]×(X×X), meaning a continuous map into DXD_XDX​ fixing every point of DXD_XDX​. Then both of the following hold: iii is a topological embedding with closed image and there exists a continuous map from [0,1]×X[0,1]\times X[0,1]×X onto the subspace Ki={(t,x):t=0 or ∃a∈A, i(a)=x}K_i=\{(t,x):t=0\ \text{or}\ \exists a\in A,\ i(a)=x\}Ki​={(t,x):t=0 or ∃a∈A, i(a)=x} fixing every point of KiK_iKi​; and the diagonal ΔA(a)=(a,a)\Delta_A(a)=(a,a)ΔA​(a)=(a,a) is a topological embedding with closed image and the subspace DA={(t,(a,b))∈[0,1]×(A×A):t=0 or a=b}D_A=\{(t,(a,b))\in[0,1]\times(A\times A):t=0\ \text{or}\ a=b\}DA​={(t,(a,b))∈[0,1]×(A×A):t=0 or a=b} admits a continuous retraction from [0,1]×(A×A)[0,1]\times(A\times A)[0,1]×(A×A). No nonemptiness is assumed, although the specified maps force AAA and XXX to be either both empty or both nonempty.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me