Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 7, (11) — ϕ : G₁ → ker s ⋊ G₀, a ↦ (a·i(s a)⁻¹, s a), is a group isomorphism with inverse (h, g) ↦ h·i(g)

Proved
StrictTwoGroups.TwoEquiv.phi_mulEquiv

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1semidirect-productstrict-2-group

Let G\mathcal GG be a strict 2-group and let G0G_0G0​ act on the normal subgroup ker⁡s⊆G1\ker s\subseteq G_1kers⊆G1​ by g↦Adigg\mapsto\mathrm{Ad}_{ig}g↦Adig​, Adig(h)=ig h (ig)−1\mathrm{Ad}_{ig}(h)=ig\,h\,(ig)^{-1}Adig​(h)=igh(ig)−1. Then

φ:G1⟶ker⁡s⋊G0,a⟼(a i(sa)−1, sa)\varphi:G_1\longrightarrow\ker s\rtimes G_0,\qquad a\longmapsto\bigl(a\,i(sa)^{-1},\ sa\bigr)φ:G1​⟶kers⋊G0​,a⟼(ai(sa)−1, sa)

is a group isomorphism, and its inverse is φ−1(h,g)=h ig\varphi^{-1}(h,g)=h\,igφ−1(h,g)=hig.

The isomorphism transports the strict 2-group to the semidirect product on which the crossed module T0GT_0\mathcal GT0​G and the round trip STGST\mathcal GSTG live; it is the component ξG\xi_{\mathcal G}ξG​ of §6.

Formalization Note The statement asserts a MulEquiv whose forward map and inverse are given by the two formulas. It is stated for every StrictTwoGroup (groups, group morphisms s,t,is,t,is,t,i with s i=t i=ids\,i=t\,i=\mathrm{id}si=ti=id), without the composition axioms IsStrictTwoGroup, which the claim does not involve.

Differences from the source:

  • generalization: G\mathcal GG a strict 2-group → any StrictTwoGroup data, without IsStrictTwoGroup; reason: every strict 2-group is such data, so the Lean statement specializes to the paper's.
Preamble
import Mathlib
import Definitions.Def_StrictTwoGroups_TwoEquiv_StrictTwoGroup
Formal statement
namespace StrictTwoGroups.TwoEquiv

universe u

/-- §2, p. 7, (11): the map `ϕ : G₁ → ker s ⋊ G₀`, `a ↦ (a · i(s a)⁻¹, s a)`, is a group
isomorphism with inverse `ϕ⁻¹(h, g) = h · i(g)`; the semidirect product is taken with respect to
the adjoint action `g ↦ Ad_{i g}` of `G₀` on `ker s`. -/
theorem phi_mulEquiv (G : StrictTwoGroup.{u}) :
    ∃ e : G.G1 ≃* (↥G.s.ker ⋊[MulAut.conjNormal.comp G.i] G.G0),
      (∀ a : G.G1, ((e a).left : G.G1) = a * (G.i (G.s a))⁻¹ ∧ (e a).right = G.s a) ∧
      ∀ x : ↥G.s.ker ⋊[MulAut.conjNormal.comp G.i] G.G0,
        e.symm x = (x.left : G.G1) * G.i x.right := by sorry

end StrictTwoGroups.TwoEquiv
Source
Porst, Strict 2-Groups are Crossed Modules, arXiv:0812.1464v1, p. 7, §2 isomorphism (11)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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