Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Generic helpers for `SemidirectProduct`

Definition
OddOrder_Mathlib_SemidirectProduct

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Supplements to Mathlib's SemidirectProduct. The main result is that a semidirect product of two ppp-groups is a ppp-group (IsPGroup.semidirectProduct), the core of the argument in Isaacs Lemma 4.32 (PPP a ppp-group acting on a ppp-group GGG gives [G,P]<G[G,P]<G[G,P]<G and CG(P)>1C_G(P)>1CG​(P)>1) that Γ=G⋊P\Gamma=G\rtimes PΓ=G⋊P is a ppp-group hence nilpotent.

Declarations: SemidirectProduct.finite (a Finite instance via equivProd) and SemidirectProduct.commutator_inl_inr (the commutator [inl n,inr g]=inl(n⋅φg(n)−1)[\mathrm{inl}\,n,\mathrm{inr}\,g]=\mathrm{inl}(n\cdot\varphi_g(n)^{-1})[inln,inrg]=inl(n⋅φg​(n)−1)).

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/Mathlib/SemidirectProduct.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.SemidirectProduct
import Mathlib.GroupTheory.PGroup
import Mathlib.GroupTheory.Nilpotent

/-- **半直積の Finite instance**. `SemidirectProduct.equivProd` 経由. -/
instance SemidirectProduct.finite {N G : Type*} [Group N] [Group G] [Finite N] [Finite G]
    {φ : G →* MulAut N} : Finite (N ⋊[φ] G) :=
  Finite.of_equiv _ SemidirectProduct.equivProd.symm

/-- **`inl.range ⊔ inr.range = ⊤`**: 半直積は `inl` と `inr` の像で生成される.

`inl_left_mul_inr_right` (∀ x, `inl x.left * inr x.right = x`) から従う.
Γ 内 commutator `⁅inl.range, inr.range⁆` に Isaacs Lem 4.1 (`⁅H, K⁆ ⊴ ⟨H, K⟩`) を
適用する際の前提. -/
theorem SemidirectProduct.inl_range_sup_inr_range_eq_top
    {N G : Type*} [Group N] [Group G] {φ : G →* MulAut N} :
    (SemidirectProduct.inl : N →* N ⋊[φ] G).range ⊔
      (SemidirectProduct.inr : G →* N ⋊[φ] G).range = ⊤ := by
  refine top_le_iff.mp fun x _ => ?_
  rw [← SemidirectProduct.inl_left_mul_inr_right x]
  exact Subgroup.mul_mem_sup ⟨x.left, rfl⟩ ⟨x.right, rfl⟩

open scoped commutatorElement in
/-- **`⁅inl n, inr g⁆ = inl (n * (φ g) n⁻¹)`**: Γ = N ⋊[φ] G 内の commutator は
`inl` の中で計算できる. これが `actionCommutator φ` の Γ 内 commutator 表示の核. -/
theorem SemidirectProduct.commutator_inl_inr
    {N G : Type*} [Group N] [Group G] {φ : G →* MulAut N} (n : N) (g : G) :
    ⁅(SemidirectProduct.inl n : N ⋊[φ] G), (SemidirectProduct.inr g : N ⋊[φ] G)⁆ =
      SemidirectProduct.inl (n * (φ g) n⁻¹) := by
  rw [commutatorElement_def]
  ext <;> simp [SemidirectProduct.mul_left, SemidirectProduct.mul_right,
                SemidirectProduct.inv_left, SemidirectProduct.inv_right, mul_assoc]
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/Mathlib/SemidirectProduct.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