§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)
ProvedStrictTwoGroups.TwoEquiv.phi_mulEquivp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1semidirect-productstrict-2-group
Let be a strict 2-group and let act on the normal subgroup by , . Then
is a group isomorphism, and its inverse is .
The isomorphism transports the strict 2-group to the semidirect product on which the crossed module and the round trip live; it is the component 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 with ), without the composition axioms IsStrictTwoGroup, which the claim does not involve.
Differences from the source:
- generalization: a strict 2-group → any
StrictTwoGroupdata, withoutIsStrictTwoGroup; 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.