Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Based twisted loops take values in the identity path component

Open
QAlgorithms.Papers.Independent.Intakethird100.P59.based_twisted_loops_identity_component

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

prove2quantum

Let GGG be a compactly generated topological group, let α∈G\alpha\in Gα∈G, and let G0G^0G0 denote the path component of its identity. Define

Ω(α)G={γ∈C(R,G):γ(t+1)=αγ(t)α−1 for every t∈R, γ(0)=1}.\Omega_{(\alpha)}G=\{\gamma\in C(\mathbb R,G):\gamma(t+1)=\alpha\gamma(t)\alpha^{-1}\text{ for every }t\in\mathbb R,\ \gamma(0)=1\}.Ω(α)​G={γ∈C(R,G):γ(t+1)=αγ(t)α−1 for every t∈R, γ(0)=1}.

Every such loop takes values in G0G^0G0. Restricting its codomain gives the canonical identification

Ω(α)G≅ΩAd⁡(α)∣G0G0.\Omega_{(\alpha)}G\cong\Omega_{\operatorname{Ad}(\alpha)|_{G^0}}G^0.Ω(α)​G≅ΩAd(α)∣G0​​G0.

This is an identification of topological groups, with compactly generated compact-open topologies and pointwise operations. If GGG is discrete, Ω(α)G\Omega_{(\alpha)}GΩ(α)​G consists solely of the constant identity loop. The twist α\alphaα is arbitrary and need not lie in G0G^0G0.

Formalization Note Lean states equality of the sets after inclusion in C(R,G)C(\mathbb R,G)C(R,G), together with a homeomorphism that preserves every evaluation. Evaluation preservation also preserves the pointwise group operations. No connected component is substituted for the path component.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P59
Formal statement
namespace QAlgorithms.Papers.Independent.Intakethird100.P59

universe u v

/-- Unnumbered identity-component assertion, PDF p.14. The equality is via
inclusion of G0 into G, with Ad(alpha) restricted to G0. Both groups are the
same set of continuous G-valued functions, hence have the same induced
compact-open (and compactly generated compact-open) topology and pointwise
operations. The discrete specialization asserts the entire group is trivial. -/
theorem based_twisted_loops_identity_component
    (G : Type u) [Group G] [TopologicalSpace G] [IsTopologicalGroup G]
    [CompactlyGeneratedSpace G] (alpha : G) :
    basedTwistedLoopSet alpha =
      includeIdentityLoop '' identityBasedTwistedLoopSet alpha ∧
    (∃ e : KSubspace C(ℝ, G) (basedTwistedLoopSet alpha) ≃ₜ
        KSubspace C(ℝ, pathComponent (1 : G)) (identityBasedTwistedLoopSet alpha),
      ∀ gamma t, ((e gamma).1 t).1 = gamma.1 t) ∧
    (DiscreteTopology G → basedTwistedLoopSet alpha = {1}) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P59
Source
Mapping stacks of topological stacks, arXiv:0809.2373v2, PDF p. 14, Unnumbered §7: based twisted loops see only G0
Read-back

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

For every group GGG equipped with a topology making it a topological group and a compactly generated space, and every α∈G\alpha\in Gα∈G, let G1G_1G1​ be the path component of 111, with its subspace topology. Define LαL_\alphaLα​ to be the set of continuous maps γ:R→G\gamma:\mathbb R\to Gγ:R→G such that γ(0)=1\gamma(0)=1γ(0)=1 and γ(t+1)=αγ(t)α−1\gamma(t+1)=\alpha\gamma(t)\alpha^{-1}γ(t+1)=αγ(t)α−1 for every real ttt. Define Lα1L_\alpha^1Lα1​ to be the set of continuous maps η:R→G1\eta:\mathbb R\to G_1η:R→G1​ satisfying the same two equations after their values are viewed in GGG. Then all three assertions hold: LαL_\alphaLα​ is exactly the image of Lα1L_\alpha^1Lα1​ under composition with the inclusion G1↪GG_1\hookrightarrow GG1​↪G; there exists a homeomorphism e:Lα→Lα1e:L_\alpha\to L_\alpha^1e:Lα​→Lα1​, where each set carries the compactly generated modification of its subspace topology in the corresponding continuous-map space with the compact-open topology, such that for every γ∈Lα\gamma\in L_\alphaγ∈Lα​ and every t∈Rt\in\mathbb Rt∈R, the value e(γ)(t)e(\gamma)(t)e(γ)(t), viewed in GGG, equals γ(t)\gamma(t)γ(t); and, if the given topology on GGG is discrete, then LαL_\alphaLα​ is the singleton consisting of the constant map t↦1t\mapsto1t↦1. The defining equations apply to all real times, including negative times, and both sets contain the constant identity map.

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