Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem, §6, p. 16 — the 2-categories 2-Grp and X-Mod are 2-equivalent

Proved
StrictTwoGroups.TwoEquiv.theorem_two_equivalence

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

2-equivalencecrossed-modulep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strict-2-group

The 2-category 2-Grp2\text{-}\mathit{Grp}2-Grp of strict 2-groups (internal categories in the category of groups, with internal functors and internal natural transformations) and the 2-category X-ModX\text{-}\mathit{Mod}X-Mod of crossed modules (with crossed module morphisms and 2-morphisms) are 2-equivalent:

2-Grp ≃ X-Mod.2\text{-}\mathit{Grp}\ \simeq\ X\text{-}\mathit{Mod}.2-Grp ≃ X-Mod.

That is, both are 2-categories, and there are 2-functors F:2-Grp→X-ModF:2\text{-}\mathit{Grp}\to X\text{-}\mathit{Mod}F:2-Grp→X-Mod and E:X-Mod→2-GrpE:X\text{-}\mathit{Mod}\to2\text{-}\mathit{Grp}E:X-Mod→2-Grp together with 2-natural isomorphisms E∘F≅id2-GrpE\circ F\cong\mathrm{id}_{2\text{-}\mathit{Grp}}E∘F≅id2-Grp​ and F∘E≅idX-ModF\circ E\cong\mathrm{id}_{X\text{-}\mathit{Mod}}F∘E≅idX-Mod​.

The theorem lets one pass freely between strict 2-groups, suited to categorical reasoning, and crossed modules, suited to computation. The paper's witnesses are F=TF=TF=T, E=SE=SE=S and the round-trip isomorphisms ξ\xiξ, ζ\zetaζ, which are the milestones.

Formalization Note The 2-categories are the concrete twoGrp and xMod. TwoEquivalent includes that both satisfy all 2-category axioms, that both 2-functors preserve vertical and horizontal composition and identities on 2-cells as well as 1-cells, and that the 2-natural isomorphisms satisfy the 2-cell part of diagram (7). All groups live in one universe.

Differences from the source:

  • encoding: groups of arbitrary size → all groups in one universe u, the statement holding for every u; reason: Lean's universe stratification; every set-sized group lives in some universe.
  • encoding: 2-categories given by their cells, compositions and identities; morphisms and 2-morphisms are group morphisms / maps with their source and target → raw data (Raw2Cat) with lawfulness predicates IsOb, Is1, Is2, every law quantified over lawful cells only; 2-cells typed by their objects with the boundary 1-cells as explicit arguments; cells are plain functions and "is a group morphism" is a clause of Is1 / Is2; reason: changes no instance: the lawful objects, 1-cells and 2-cells are exactly the paper's, and nothing is asserted about the others.
  • encoding: applicative composition (γ′ ∘ γ, η′ ∘ η, E ∘ F) → diagrammatic comp1 f g, vcomp, hcomp and Raw2Functor.comp ("first, then second"); reason: notation only; every composite is the same map as on the page.
  • encoding: composition ∘ : G1 s×t G1 → G1 of a strict 2-group → total function comp : G1 → G1 → G1 with every axiom stated on composable pairs; reason: values off the pullback are never constrained or used.
  • reading: an action α : G × H → H of a crossed module → α : G →* MulAut H (an action by group automorphisms); reason: the standard meaning of a crossed module's action, and the one the paper uses: the semidirect product H ⋊ G of §5 (p. 12) and S₀'s target map being a morphism (p. 13) require it; for a mere set action H ⋊ G is not a group.
Preamble
import Mathlib
import Definitions.Def_StrictTwoGroups_TwoEquiv_Functors
Formal statement
namespace StrictTwoGroups.TwoEquiv

universe u

/-- §6, p. 16, Theorem: the 2-categories `2-Grp` and `X-Mod` are 2-equivalent. -/
theorem theorem_two_equivalence : TwoEquivalent twoGrp.{u} xMod.{u} := by sorry

end StrictTwoGroups.TwoEquiv
Source
Porst, Strict 2-Groups are Crossed Modules, arXiv:0812.1464v1, p. 16, §6 Theorem
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