Isaacs Lemma 3.1: uniqueness of split extensions up to isomorphism
DefinitionOddOrder_Isaacs_Ch03_SplitExtensions_SplitExtensionUniquenessfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Formalizes Isaacs, Finite Group Theory, §3A, Lemma 3.1 (pp. 69–70) in its two-abstract-groups form: if is complemented by and is complemented by , and isomorphisms , are compatible with the conjugation actions, then there is exactly one isomorphism extending them. So a split extension is determined up to isomorphism by , and the action of on . Existence goes through Mathlib's semidirect product.
The main definition is conjAutHom, the homomorphism given by conjugation of a subgroup on a normal subgroup .
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