§5, pp. 12–13 — S₀(χ) = (G, H ⋊ G, s, t, i) is a strict 2-group
ProvedStrictTwoGroups.TwoEquiv.toTwoGrp_isStrictTwoGroupLet be a crossed module and let be the semidirect product with . With
the tuple is a strict 2-group: the composition is a group morphism on composable pairs (interchange law), and the source, target, unit and associativity axioms hold.
This is the object part of the 2-functor . The same construction, in a different encoding of strict 2-groups (with an extra arrow-inverse datum), is the proved platform theorem QAlgorithms.Papers.Independent.Renew46.P18.crossedModule_strictTwoGroup.
Formalization Note That are group morphisms and are part of the definition toTwoGrp ( is a morphism by equivariance); the theorem asserts the remaining axioms, IsStrictTwoGroup (toTwoGrp χ), under the Peiffer identity. The composition is the total map , the paper's formula on composable pairs.
Differences from the source:
- encoding: composition defined on composable pairs → total map ; reason: on composable pairs it is the paper's formula, and the axioms of
IsStrictTwoGroupare stated on composable pairs only. - 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.
import Mathlib import Definitions.Def_StrictTwoGroups_TwoEquiv_Functors
namespace StrictTwoGroups.TwoEquiv
universe u
/-- §5, pp. 12–13: for a crossed module `χ = (G, H, τ, α)`,
`S₀(χ) = (G, H ⋊ G, s, t, i)` with composition `(j, τ(h) g) ∘ (h, g) = (j h, g)` is a strict
2-group. -/
theorem toTwoGrp_isStrictTwoGroup (χ : CrossedModule.{u}) (hχ : IsCrossedModule χ) :
IsStrictTwoGroup (toTwoGrp χ) := by sorry
end StrictTwoGroups.TwoEquiv
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.