Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Isaacs Lemma 3.1: uniqueness of split extensions up to isomorphism

Definition
OddOrder_Isaacs_Ch03_SplitExtensions_SplitExtensionUniqueness

by burkh4rt · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Formalizes Isaacs, Finite Group Theory, §3A, Lemma 3.1 (pp. 69–70) in its two-abstract-groups form: if N⊴GN\trianglelefteq GN⊴G is complemented by HHH and N0⊴G0N_0\trianglelefteq G_0N0​⊴G0​ is complemented by H0H_0H0​, and isomorphisms N≅N0N\cong N_0N≅N0​, H≅H0H\cong H_0H≅H0​ are compatible with the conjugation actions, then there is exactly one isomorphism G≅G0G\cong G_0G≅G0​ extending them. So a split extension is determined up to isomorphism by NNN, HHH and the action of HHH on NNN. Existence goes through Mathlib's semidirect product.

The main definition is conjAutHom, the homomorphism H→Aut(N)H\to\mathrm{Aut}(N)H→Aut(N) given by conjugation of a subgroup HHH on a normal subgroup NNN.

The bundle also proves 1 supporting lemma used by later statements.

Definition code
/-
Copyright (c) 2026 Yawara Ishida. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yawara Ishida
-/
-- From github.com/yawara/odd-order @ 20a6fccbb63c (Apache-2.0; LICENSE at that commit):
--   OddOrder/Isaacs/Ch03_SplitExtensions/SplitExtensionUniqueness.lean
-- Generated for Prove2Me by deleting declarations; the remaining commands are verbatim except:
-- `private` dropped where another file uses the declaration, and a solution's main theorem
-- renamed `_root_.solution` (platform convention).
import Mathlib.GroupTheory.Complement
import Mathlib.GroupTheory.SemidirectProduct

namespace OddOrder.Isaacs.Ch03

variable {G G₀ : Type*} [Group G] [Group G₀]

section

/-- 正規部分群 `N ◁ G` への部分群 `H ≤ G` の共役作用を束ねた準同型 `H →* MulAut N`
(`n ↦ h * n * h⁻¹`).

mathlib の `Subgroup.normalizerMonoidHom : N.normalizer →* MulAut N` を
`N.normalizer = ⊤` で `H` 全体に引き戻した形 (仮定特殊化)。Isaacs が Lemma 3.1 /
Thm 3.2 で「`H` が `N` に共役で作用する」と書くときの作用がこれ。 -/
def conjAutHom (N H : Subgroup G) [N.Normal] : H →* MulAut N :=
  N.normalizerMonoidHom.comp (Subgroup.inclusion (N.normalizer_eq_top ▸ le_top))

@[simp]
theorem conjAutHom_apply_coe (N H : Subgroup G) [N.Normal] (h : H) (n : N) :
    ((conjAutHom N H h n : N) : G) = (h : G) * (n : G) * (h : G)⁻¹ :=
  rfl

end

end OddOrder.Isaacs.Ch03
Source
Yawara Ishida, Lean 4 formalization of the Feit–Thompson (odd order) theorem, github.com/yawara/odd-order @ 20a6fccbb63c (Apache-2.0), https://github.com/yawara/odd-order/blob/20a6fccbb63c0b138acda9f7fafd798c42f9441b/OddOrder/Isaacs/Ch03_SplitExtensions/SplitExtensionUniqueness.lean

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