Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Remark 5.4

Open
QAlgorithms.Papers.Independent.Intakethird100.P07.loopContractible_iff_pathExtensionSplits

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let GGG be a topological group and PGPGPG its compact-open based path group. Write ΩG\Omega GΩG for the kernel of evaluation ev⁡1:PG→G\operatorname{ev}_1:PG\to Gev1​:PG→G. Then

G is loop contractible⟺∃ a continuous group homomorphism s:G→PG with ev⁡1∘s=id⁡G.G\text{ is loop contractible}\quad\Longleftrightarrow\quad\exists\text{ a continuous group homomorphism }s:G\to PG\text{ with }\operatorname{ev}_1\circ s=\operatorname{id}_G.G is loop contractible⟺∃ a continuous group homomorphism s:G→PG with ev1​∘s=idG​.

This is the continuous splitting meaning of the semidirect-product assertion. With the parameter running from the identity element to the identity map, the section is s(g)(t)=Φ(g,t)s(g)(t)=\Phi(g,t)s(g)(t)=Φ(g,t), and a section gives the homotopy Φ(g,t)=s(g)(t)\Phi(g,t)=s(g)(t)Φ(g,t)=s(g)(t). No commutativity of GGG is required.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P07
Formal statement
noncomputable section

universe u v

namespace QAlgorithms.Papers.Independent.Intakethird100.P07

open CategoryTheory Topology TopologicalSpace

/-- Remark 5.4, PDF p. 20: the based-path extension splits by a continuous
group-homomorphic section exactly when G is loop contractible. The section
homotopy is phi(g,t)=s(g)(t), and the section from phi is g↦(t↦phi(g,t)). -/
theorem loopContractible_iff_pathExtensionSplits
    (G : Type u) [TopologicalSpace G] [Group G] [IsTopologicalGroup G] :
    LoopContractible G ↔
      ∃ s : C(G, BasedPaths G),
        (∀ g, basedPathEndpoint (s g) = g) ∧
        (∀ g h, s (g * h) = basedPathMul (s g) (s h)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P07

end
Source
Cohomology of Local Cochains, arXiv:1110.2661v2, PDF p. 20, Remark 5.4
Read-back

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

For every topological group GGG, the following are equivalent: there exists a continuous map ϕ:G×[0,1]→G\phi:G\times[0,1]\to Gϕ:G×[0,1]→G such that ϕ(g,0)=1\phi(g,0)=1ϕ(g,0)=1 and ϕ(g,1)=g\phi(g,1)=gϕ(g,1)=g for every g∈Gg\in Gg∈G, and ϕ(gh,t)=ϕ(g,t)ϕ(h,t)\phi(gh,t)=\phi(g,t)\phi(h,t)ϕ(gh,t)=ϕ(g,t)ϕ(h,t) for every t∈[0,1]t\in[0,1]t∈[0,1] and g,h∈Gg,h\in Gg,h∈G; and there exists a continuous map s:G→P(G)s:G\to P(G)s:G→P(G), where P(G)P(G)P(G) is the space of continuous paths [0,1]→G[0,1]\to G[0,1]→G starting at 111, with its subspace topology from the compact-open topology, such that s(g)(1)=gs(g)(1)=gs(g)(1)=g for every g∈Gg\in Gg∈G and s(gh)(t)=s(g)(t)s(h)(t)s(gh)(t)=s(g)(t)s(h)(t)s(gh)(t)=s(g)(t)s(h)(t) for every g,h∈Gg,h\in Gg,h∈G and t∈[0,1]t\in[0,1]t∈[0,1].

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me