Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Canonical unit and contraction isomorphisms

Open
QAlgorithms.Papers.Independent.Intakethird100.P93.lemma_2_7

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, let T=GT=GT=G with structure map ttt, and let X∗X^*X∗ have the same underlying space with structure map ψ−1\psi^{-1}ψ−1 and right action x⋅g=xα(ψ(x))−1(g−1)x\cdot g=x\alpha(\psi(x))^{-1}(g^{-1})x⋅g=xα(ψ(x))−1(g−1). Tensor products are the balanced quotients (x,y)k=(xk,k−1y)(x,y)k=(xk,k^{-1}y)(x,y)k=(xk,k−1y). There are canonical structure-preserving right equivariant homeomorphisms

X⊗T≅X,T⊗X≅X,X⊗X∗≅T.X\otimes T\cong X,\qquad T\otimes X\cong X,\qquad X\otimes X^*\cong T.X⊗T≅X,T⊗X≅X,X⊗X∗≅T.

The unit maps send [x,g][x,g][x,g] to xgxgxg and [g,x][g,x][g,x] to g⋅xg\cdot xg⋅x. The contraction sends [x,y][x,y][x,y] to the unique ggg such that g⋅y=xg\cdot y=xg⋅y=x, with t(g)=ψ(x)ψ(y)−1t(g)=\psi(x)\psi(y)^{-1}t(g)=ψ(x)ψ(y)−1. These specified maps give the unit and dual identifications used in tensor constructions.

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.7, PDF p.6, all three canonical isomorphisms. Their formulas,
right equivariance and structure-map identities are asserted on representatives.
The contraction sends [x,y] to the unique g with gy=x. -/
theorem lemma_2_7 {X : Type u} [TopologicalSpace X] (B : Bispace C X) :
    (∃ e : RightUnitTensor C B ≃ₜ X,
      (∀ x g, e (Quot.mk _ (x, g)) = B.right.act x g) ∧
      (∀ x g k, e (Quot.mk _ (x, g * k)) =
        B.right.act (e (Quot.mk _ (x, g))) k) ∧
      (∀ x g, B.psi (e (Quot.mk _ (x, g))) = B.psi x * C.t g)) ∧
    (∃ e : LeftUnitTensor C B ≃ₜ X,
      (∀ g x, e (Quot.mk _ (g, x)) = inducedLeft C B g x) ∧
      (∀ g x k, e (Quot.mk _ (g, B.right.act x k)) =
        B.right.act (e (Quot.mk _ (g, x))) k) ∧
      (∀ g x, B.psi (e (Quot.mk _ (g, x))) = C.t g * B.psi x)) ∧
    (∃ e : DualTensor C B ≃ₜ G,
      (∀ x y, inducedLeft C B (e (Quot.mk _ (x, y))) y = x) ∧
      (∀ x y k, e (Quot.mk _ (x, inducedLeft C B k⁻¹ y)) =
        e (Quot.mk _ (x, y)) * k) ∧
      (∀ x y, C.t (e (Quot.mk _ (x, y))) = B.psi x * (B.psi y)⁻¹)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P93
Source
On the existence of bibundles, arXiv:1102.4388v2, PDF p. 6, Lemma 2.7
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 group homomorphism t:G→Ht:G\to Ht:G→H and a group homomorphism α:H→Aut⁡(G)\alpha:H\to\operatorname{Aut}(G)α:H→Aut(G) such that (h,g)↦αh(g)(h,g)\mapsto\alpha_h(g)(h,g)↦αh​(g) is continuous, 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 all h∈Hh\in Hh∈H and g,k∈Gg,k\in Gg,k∈G; assume also that each of 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) has a continuous right inverse on some open neighborhood of every point of its target. Let XXX be a topological space and BBB consist of a continuous right action x⋅gx\cdot gx⋅g of GGG on XXX, with x⋅1=xx\cdot1=xx⋅1=x and (x⋅g)⋅k=x⋅(gk)(x\cdot g)\cdot k=x\cdot(gk)(x⋅g)⋅k=x⋅(gk), together with a continuous map ψ:X→H\psi:X\to Hψ:X→H satisfying ψ(x⋅g)=ψ(x)t(g)\psi(x\cdot g)=\psi(x)t(g)ψ(x⋅g)=ψ(x)t(g). Assume XXX is nonempty and, for every x∈Xx\in Xx∈X, the map g↦x⋅gg\mapsto x\cdot gg↦x⋅g is a homeomorphism G→XG\to XG→X. Define g⋆x=x⋅αψ(x)−1(g)g\star x=x\cdot\alpha_{\psi(x)}^{-1}(g)g⋆x=x⋅αψ(x)−1​(g), where the inverse is the inverse automorphism. Form the quotient spaces TRT_RTR​ of X×GX\times GX×G, TLT_LTL​ of G×XG\times XG×X, and TDT_DTD​ of X×XX\times XX×X by imposing, respectively, (x,g)∼(x⋅a,a−1g)(x,g)\sim(x\cdot a,a^{-1}g)(x,g)∼(x⋅a,a−1g), (g,x)∼(ga,a−1⋆x)(g,x)\sim(ga,a^{-1}\star x)(g,x)∼(ga,a−1⋆x), and (x,y)∼(x⋅a,y⋅a)(x,y)\sim(x\cdot a,y\cdot a)(x,y)∼(x⋅a,y⋅a) for every a∈Ga\in Ga∈G. Then there exist homeomorphisms eR:TR→Xe_R:T_R\to XeR​:TR​→X, eL:TL→Xe_L:T_L\to XeL​:TL​→X, and eD:TD→Ge_D:T_D\to GeD​:TD​→G satisfying all the following identities, for every x,y∈Xx,y\in Xx,y∈X and g,k∈Gg,k\in Gg,k∈G:

eR([x,g]R)=x⋅g,eR([x,gk]R)=eR([x,g]R)⋅k,ψ(eR([x,g]R))=ψ(x)t(g),eL([g,x]L)=g⋆x,eL([g,x⋅k]L)=eL([g,x]L)⋅k,ψ(eL([g,x]L))=t(g)ψ(x),eD([x,y]D)⋆y=x,eD([x,k−1⋆y]D)=eD([x,y]D)k,t(eD([x,y]D))=ψ(x)ψ(y)−1.\begin{aligned} e_R([x,g]_R)&=x\cdot g,& e_R([x,gk]_R)&=e_R([x,g]_R)\cdot k,& \psi(e_R([x,g]_R))&=\psi(x)t(g),\\ e_L([g,x]_L)&=g\star x,& e_L([g,x\cdot k]_L)&=e_L([g,x]_L)\cdot k,& \psi(e_L([g,x]_L))&=t(g)\psi(x),\\ e_D([x,y]_D)\star y&=x,& e_D([x,k^{-1}\star y]_D)&=e_D([x,y]_D)k,& t(e_D([x,y]_D))&=\psi(x)\psi(y)^{-1}. \end{aligned}eR​([x,g]R​)eL​([g,x]L​)eD​([x,y]D​)⋆y​=x⋅g,=g⋆x,=x,​eR​([x,gk]R​)eL​([g,x⋅k]L​)eD​([x,k−1⋆y]D​)​=eR​([x,g]R​)⋅k,=eL​([g,x]L​)⋅k,=eD​([x,y]D​)k,​ψ(eR​([x,g]R​))ψ(eL​([g,x]L​))t(eD​([x,y]D​))​=ψ(x)t(g),=t(g)ψ(x),=ψ(x)ψ(y)−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