Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 6, Corollary (10) — for a ∈ ker s, a ∘ b = a·i(s a)⁻¹·b = ab

Proved
StrictTwoGroups.TwoEquiv.corollary_comp_ker

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

internal-categoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strict-2-group

Let G\mathcal GG be a strict 2-group, a∈ker⁡sa\in\ker sa∈kers and b∈G1b\in G_1b∈G1​ composable with aaa (sa=tbs a=t bsa=tb, i.e. tb=et b=etb=e). Then

a∘b=a  i(sa)−1  b=a b.a\circ b=a\;i(s a)^{-1}\;b=a\,b .a∘b=ai(sa)−1b=ab.

On the kernel of the source map, composition is group multiplication. This is what makes the second component of ker⁡s⋊G0\ker s\rtimes G_0kers⋊G0​ carry the composition in §§4–6.

Formalization Note The composability condition sa=tbs a=t bsa=tb is explicit; it is implicit on the page because a∘ba\circ ba∘b is only defined for composable pairs.

Differences from the source:

  • encoding: a∘ba\circ ba∘b for a∈ker⁡sa\in\ker sa∈kers (defined only for composable pairs) → hypothesis sa=tbs a=t bsa=tb and total comp; reason: the paper's composition is defined only on G1 s ⁣×tG1G_1\,{}_s\!\times_t G_1G1​s​×t​G1​.
Preamble
import Mathlib
import Definitions.Def_StrictTwoGroups_TwoEquiv_StrictTwoGroup
Formal statement
namespace StrictTwoGroups.TwoEquiv

universe u

/-- §2, p. 6, Corollary (10): for `a ∈ ker s` (and `b` composable with `a`),
`a ∘ b = a · i(s a)⁻¹ · b = a b`. -/
theorem corollary_comp_ker (G : StrictTwoGroup.{u}) (hG : IsStrictTwoGroup G)
    (a b : G.G1) (ha : G.s a = 1) (hab : G.s a = G.t b) :
    G.comp a b = a * (G.i (G.s a))⁻¹ * b ∧ G.comp a b = a * b := by sorry

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