Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A unit-type bispace is reconstructed from its unit level

Open
QAlgorithms.Papers.Independent.Intakethird100.P93.lemma_2_12

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

prove2quantum

Let t:G→Ht:G\to Ht:G→H be a topological crossed module, with continuous action α:H→Aut⁡(G)\alpha:H\to\operatorname{Aut}(G)α:H→Aut(G). Thus t(α(h)g)=ht(g)h−1t(\alpha(h)g)=ht(g)h^{-1}t(α(h)g)=ht(g)h−1 and α(t(g))k=gkg−1\alpha(t(g))k=gkg^{-1}α(t(g))k=gkg−1. Put G1=ker⁡tG_1=\ker tG1​=kert and give both G/G1G/G_1G/G1​ and H/t(G)H/t(G)H/t(G) their quotient topologies. Assume their quotient projections admit continuous local sections. All actions, structure maps and isomorphisms below are continuous, all principal bundles are locally trivial, and a bispace has a nonempty principal homogeneous underlying right space.

Let (X,ψ)(X,\psi)(X,ψ) be an (H,G)(H,G)(H,G)-bispace with Type⁡(X)=1\operatorname{Type}(X)=1Type(X)=1, and put X1=ψ−1(1)X_1=\psi^{-1}(1)X1​=ψ−1(1). Then the actual extension from G1G_1G1​ reconstructs XXX:

X1×G1G→ ≅ X,[x,g]⟼xg.X_1\times_{G_1}G\xrightarrow{\ \cong\ } X,\qquad [x,g]\longmapsto xg.X1​×G1​​G ≅ ​X,[x,g]⟼xg.

This is a right equivariant homeomorphism with structure map ψ([x,g])=t(g)\psi([x,g])=t(g)ψ([x,g])=t(g). Neither the existence of the reduction nor a reconstruction isomorphism is an input; both are consequences of the unit-type condition.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P93
Formal statement
namespace QAlgorithms.Papers.Independent.Intakethird100.P93

universe u

variable {G H : Type u} [Group G] [TopologicalSpace G] [IsTopologicalGroup G]
  [Group H] [TopologicalSpace H] [IsTopologicalGroup H]

variable (C : CrossedModule G H)

/-- Lemma 2.12, PDF p.8: reconstruct from the actual unit-level set, by [x,g]↦xg.
No reduction or reconstruction is assumed as a hypothesis. -/
theorem lemma_2_12 {X : Type u} [TopologicalSpace X] (B : Bispace C X)
    (htype : bispaceType C B = unitType C) :
    ∃ e : ExtensionSpace B.right C.t.ker (unitLevel C B) ≃ₜ X,
      (∀ x g, e (extensionClass B.right C.t.ker (unitLevel C B) x g) =
        B.right.act x.val g) ∧
      (∀ x g k, e (extensionClass B.right C.t.ker (unitLevel C B) x (g * k)) =
        B.right.act (e (extensionClass B.right C.t.ker (unitLevel C B) x g)) k) ∧
      (∀ x g, B.psi (e (extensionClass B.right C.t.ker (unitLevel C B) x g)) =
        C.t g) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P93
Source
On the existence of bibundles, arXiv:1102.4388v2, PDF p. 8, Lemma 2.12
Read-back

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

Let G,HG,HG,H be topological groups, and let CCC consist of a continuous homomorphism t:G→Ht:G\to Ht:G→H and a homomorphism α:H→Aut⁡(G)\alpha:H\to\operatorname{Aut}(G)α:H→Aut(G) with continuous evaluation, satisfying t(αh(g))=h t(g) h−1t(\alpha_h(g))=h\,t(g)\,h^{-1}t(αh​(g))=ht(g)h−1 and αt(g)(k)=gkg−1\alpha_{t(g)}(k)=gkg^{-1}αt(g)​(k)=gkg−1 for every h∈Hh\in Hh∈H and g,k∈Gg,k\in Gg,k∈G. Assume the quotient maps G→G/ker⁡tG\to G/\ker tG→G/kert and H→H/t(G)H\to H/t(G)H→H/t(G) each admit continuous right inverses on open neighborhoods of every target point. Let XXX be a topological space with a continuous right GGG-action x⋅gx\cdot gx⋅g satisfying the identity and action laws, such that XXX is nonempty and each orbit map g↦x⋅gg\mapsto x\cdot gg↦x⋅g is a homeomorphism G→XG\to XG→X, and let ψ:X→H\psi:X\to Hψ:X→H be continuous with ψ(x⋅g)=ψ(x)t(g)\psi(x\cdot g)=\psi(x)t(g)ψ(x⋅g)=ψ(x)t(g). Let x0x_0x0​ be the point selected by classical choice from this nonemptiness, and assume ψ(x0)t(G)=t(G)\psi(x_0)t(G)=t(G)ψ(x0​)t(G)=t(G) in H/t(G)H/t(G)H/t(G). Put U={x∈X:ψ(x)=1}U=\{x\in X:\psi(x)=1\}U={x∈X:ψ(x)=1}, with its subspace topology, and let EEE be the quotient of U×GU\times GU×G obtained by imposing (x,g)∼(x⋅a,a−1g)(x,g)\sim(x\cdot a,a^{-1}g)(x,g)∼(x⋅a,a−1g) for a∈ker⁡ta\in\ker ta∈kert. Then there exists a homeomorphism e:E→Xe:E\to Xe:E→X such that, for every x∈Ux\in Ux∈U and g,k∈Gg,k\in Gg,k∈G,

e([x,g])=x⋅g,e([x,gk])=e([x,g])⋅k,ψ(e([x,g]))=t(g).e([x,g])=x\cdot g,\qquad e([x,gk])=e([x,g])\cdot k,\qquad \psi(e([x,g]))=t(g).e([x,g])=x⋅g,e([x,gk])=e([x,g])⋅k,ψ(e([x,g]))=t(g).
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