Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Source kernels of strict 2-groups are crossed modules

Proved
QAlgorithms.Papers.Independent.Bridge50.P08.strictTwoGroup_sourceKernel_crossedModule

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

prove2quantum

Let GGG be the object group and KKK the tensor group of arrows of a strict 2-group, with source and target homomorphisms s,t:K→Gs,t:K\to Gs,t:K→G and identity homomorphism i:G→Ki:G\to Ki:G→K. Let H=ker⁡(s)H=\ker(s)H=ker(s). Restrict ttt to obtain β:H→G\beta:H\to Gβ:H→G, and set α(g)h=i(g)hi(g)−1\alpha(g)h=i(g)h i(g)^{-1}α(g)h=i(g)hi(g)−1. Then this specified action and homomorphism form a crossed module: for every g∈Gg\in Gg∈G and h,k∈Hh,k\in Hh,k∈H,

β(α(g)h)=gβ(h)g−1,α(β(h))k=hkh−1.\beta(\alpha(g)h)=g\beta(h)g^{-1},\qquad \alpha(\beta(h))k=hkh^{-1}.β(α(g)h)=gβ(h)g−1,α(β(h))k=hkh−1.

This recovers the algebraic crossed module from the given strict 2-group. It does not assert that the source kernel is a Lie subgroup.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Bridge50_P08
Formal statement
namespace QAlgorithms.Papers.Independent.Bridge50.P08

open Set Filter Topology

open QAlgorithms.Papers.Independent.Renew46.P18

open QAlgorithms.Papers.Independent.Claimed50.P22

open QAlgorithms.Papers.Independent.Next46.P35

universe u v w z

/-- Remark II.4, PDF p. 10: the converse algebraic construction has
H = ker(s), beta = t restricted to ker(s), and the identity-conjugation
action. Both crossed-module axioms are conclusions. No Lie subgroup or
smoothness of the kernel is asserted. -/
theorem strictTwoGroup_sourceKernel_crossedModule
    {G : Type u} {K : Type v} [Group G] [Group K]
    (s t : K →* G) (identity : G →* K)
    (comp : K → K → K) (arrowInv : K → K)
    (h : IsStrictTwoGroup s t identity comp arrowInv) :
    IsCrossedModule (t.comp s.ker.subtype)
      (sourceKernelAction s identity (fun g => (h.1 g).1)) := by sorry

end QAlgorithms.Papers.Independent.Bridge50.P08
Source
Principal 2-bundles and their gauge 2-groups, arXiv:0803.3692v4, PDF p. 10, Remark II.4: source kernel yields a crossed module
Read-back

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

Let GGG and KKK be arbitrary groups, let s,t:K→Gs,t:K\to Gs,t:K→G and i:G→Ki:G\to Ki:G→K be group homomorphisms, and let C:K×K→KC:K\times K\to KC:K×K→K and J:K→KJ:K\to KJ:K→K be total functions. Assume all the following identities: s(i(g))=t(i(g))=gs(i(g))=t(i(g))=gs(i(g))=t(i(g))=g for every g∈Gg\in Gg∈G; whenever s(b)=t(a)s(b)=t(a)s(b)=t(a), one has s(C(b,a))=s(a)s(C(b,a))=s(a)s(C(b,a))=s(a) and t(C(b,a))=t(b)t(C(b,a))=t(b)t(C(b,a))=t(b); C(i(t(a)),a)=a=C(a,i(s(a)))C(i(t(a)),a)=a=C(a,i(s(a)))C(i(t(a)),a)=a=C(a,i(s(a))) for every a∈Ka\in Ka∈K; whenever s(b)=t(a)s(b)=t(a)s(b)=t(a) and s(c)=t(b)s(c)=t(b)s(c)=t(b), one has C(c,C(b,a))=C(C(c,b),a)C(c,C(b,a))=C(C(c,b),a)C(c,C(b,a))=C(C(c,b),a); for every a∈Ka\in Ka∈K, one has s(J(a))=t(a)s(J(a))=t(a)s(J(a))=t(a), t(J(a))=s(a)t(J(a))=s(a)t(J(a))=s(a), C(J(a),a)=i(s(a))C(J(a),a)=i(s(a))C(J(a),a)=i(s(a)), and C(a,J(a))=i(t(a))C(a,J(a))=i(t(a))C(a,J(a))=i(t(a)); s(1K)=t(1K)=1Gs(1_K)=t(1_K)=1_Gs(1K​)=t(1K​)=1G​ and i(1G)=1Ki(1_G)=1_Ki(1G​)=1K​; for all a,b∈Ka,b\in Ka,b∈K, s(ab)=s(a)s(b)s(ab)=s(a)s(b)s(ab)=s(a)s(b) and t(ab)=t(a)t(b)t(ab)=t(a)t(b)t(ab)=t(a)t(b); for all g,g′∈Gg,g'\in Gg,g′∈G, i(gg′)=i(g)i(g′)i(gg')=i(g)i(g')i(gg′)=i(g)i(g′); whenever s(b)=t(a)s(b)=t(a)s(b)=t(a) and s(d)=t(c)s(d)=t(c)s(d)=t(c), one has C(bd,ac)=C(b,a)C(d,c)C(bd,ac)=C(b,a)C(d,c)C(bd,ac)=C(b,a)C(d,c); s(a−1)=s(a)−1s(a^{-1})=s(a)^{-1}s(a−1)=s(a)−1 and t(a−1)=t(a)−1t(a^{-1})=t(a)^{-1}t(a−1)=t(a)−1 for every a∈Ka\in Ka∈K; i(g−1)=i(g)−1i(g^{-1})=i(g)^{-1}i(g−1)=i(g)−1 for every g∈Gg\in Gg∈G; and whenever s(b)=t(a)s(b)=t(a)s(b)=t(a), one has C(b−1,a−1)=C(b,a)−1C(b^{-1},a^{-1})=C(b,a)^{-1}C(b−1,a−1)=C(b,a)−1. Here J(a)J(a)J(a) and the group inverse a−1a^{-1}a−1 are separate operations, and the conditions on CCC with composability hypotheses impose those conditions only when the hypotheses hold. Then the homomorphism τ:ker⁡s→G\tau:\ker s\to Gτ:kers→G given by τ(h)=t(h)\tau(h)=t(h)τ(h)=t(h), together with the homomorphism ρ:G→Aut⁡(ker⁡s)\rho:G\to\operatorname{Aut}(\ker s)ρ:G→Aut(kers) given by ρ(g)(h)=i(g)h i(g)−1\rho(g)(h)=i(g)h\,i(g)^{-1}ρ(g)(h)=i(g)hi(g)−1, satisfies both identities

τ(ρ(g)(h))=g τ(h) g−1andρ(τ(h))(k)=hkh−1\tau(\rho(g)(h))=g\,\tau(h)\,g^{-1} \quad\text{and}\quad \rho(\tau(h))(k)=hkh^{-1}τ(ρ(g)(h))=gτ(h)g−1andρ(τ(h))(k)=hkh−1

for every g∈Gg\in Gg∈G and every h,k∈ker⁡sh,k\in\ker sh,k∈kers; the action is defined using the assumed identity s(i(g))=gs(i(g))=gs(i(g))=g.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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