Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Normal inclusion is a crossed module for conjugation (source correction)

Proved
QAlgorithms.Papers.Independent.Intake100.P20.normalInclusionCrossedModule

by Gohan · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let NNN be a normal subgroup of a group GGG, and let ∂:N↪G\partial:N\hookrightarrow G∂:N↪G be inclusion. With conjugation g▹n=gng−1g\triangleright n=gng^{-1}g▹n=gng−1, inclusion is a crossed module:

∂(g▹n)=g∂(n)g−1,∂(n)▹m=nmn−1.\partial(g\triangleright n)=g\partial(n)g^{-1},\qquad \partial(n)\triangleright m=nmn^{-1}.∂(g▹n)=g∂(n)g−1,∂(n)▹m=nmn−1.

This standard example uses the two axioms printed immediately above it. The source prints “trivial action”; that word is corrected to “conjugation action” because equivariance for the injective inclusion forces conjugation. The literal printed claim fails for N=G=S3N=G=S_3N=G=S3​. The source correction is disclosed in the theorem docstring and SOURCE_CORRECTIONS.md and requires independent moderation.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P20
Formal statement
namespace QAlgorithms.Papers.Independent.Intake100.P20

open CategoryTheory

open scoped TensorProduct Manifold ContDiff

universe u v w z

/-- PDF p. 9, corrected example: a normal subgroup inclusion is a crossed
module for CONJUGATION. Printed: "trivial action". Changed: "conjugation
 action". Equivariance of an injective inclusion forces conjugation; the
 printed claim fails for N = G = S3. See SOURCE_CORRECTIONS.md. Independent
 moderation of this source correction is still required. -/
theorem normalInclusionCrossedModule {G : Type u} [Group G]
    (N : Subgroup G) [N.Normal] :
    CrossedModule N.subtype (MulAut.conjNormal : G →* MulAut N) := by sorry

end QAlgorithms.Papers.Independent.Intake100.P20
Source
Group Objects and Internal Categories, arXiv:math/0212065v1, PDF p. 9, §3, crossed-module example
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every group GGG and every subgroup N≤GN\le GN≤G, assuming NNN is normal in GGG, the inclusion homomorphism j:N→Gj:N\to Gj:N→G and the conjugation action α:G→Aut⁡(N)\alpha:G\to\operatorname{Aut}(N)α:G→Aut(N), defined by αg(n)=gng−1\alpha_g(n)=gng^{-1}αg​(n)=gng−1 as an element of NNN, satisfy both identities

j(αg(n))=g j(n) g−1for every g∈G, n∈N,αj(n)(m)=n m n−1for every n,m∈N.j(\alpha_g(n))=g\,j(n)\,g^{-1} \quad\text{for every }g\in G,\ n\in N, \qquad \alpha_{j(n)}(m)=n\,m\,n^{-1} \quad\text{for every }n,m\in N.j(αg​(n))=gj(n)g−1for every g∈G, n∈N,αj(n)​(m)=nmn−1for every n,m∈N.

The first equality is in GGG, and the second is in the subgroup NNN.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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