Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Isaacs Theorem 6.9 (p>qp>qp>q case): a Frobenius actor has no noncyclic subgroup of order pqpqpq with q<pq<pq<p

Proved
OddOrder.Isaacs.Ch06.false_of_frobeniusAction_actorSubgroup_not_isCyclic_card_mul_prime_lt

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let AAA be a group acting by automorphisms on a finite nontrivial group UUU (MulDistribMulAction A U) such that the action is Frobenius (IsFrobeniusAction A U: every nonidentity a∈Aa\in Aa∈A fixes only the identity of UUU). Let B≤AB\le AB≤A be a finite subgroup of order ∣B∣=pq|B|=pq∣B∣=pq with p,qp,qp,q primes and q<pq<pq<p. Then BBB is cyclic; equivalently, the assumption that BBB is not cyclic leads to a contradiction: False\text{False}False.

Such a subgroup BBB would be a solvable Frobenius group: its Sylow ppp-subgroup is normal, a Sylow qqq-subgroup is a complement, and any fixed nonidentity pair would generate the whole group cyclically. This is the p>qp>qp>q branch of Isaacs Thm 6.9 for subgroups of order pqpqpq.

Formalization Note The statement is given as ¬ IsCyclic B → False; AAA is not assumed finite.

Preamble
import Definitions.Def_OddOrder_Isaacs_Ch06_FrobeniusActions_FrobeniusActionTI
import Definitions.Def_OddOrder_Mathlib_Subgroup
import Definitions.Def_OddOrder_Isaacs_Ch06_FrobeniusActions_FrobeniusGroup
Formal statement
namespace OddOrder.Isaacs.Ch06

open scoped IsMulCommutative

section

theorem false_of_frobeniusAction_actorSubgroup_not_isCyclic_card_mul_prime_lt
    {A U : Type*} [Group A] [Group U] [Finite U] [Nontrivial U]
    [MulDistribMulAction A U]
    (hFrob : IsFrobeniusAction A U) (B : Subgroup A) [Finite B]
    {p q : ℕ} [hp : Fact p.Prime] [hq : Fact q.Prime]
    (hqp : q < p) (hCard : Nat.card B = p * q)
    (hNotCyclic : ¬ IsCyclic B) :
    False := by sorry

end

end OddOrder.Isaacs.Ch06
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/Ch06_FrobeniusActions/FrobeniusGroup.lean#L1106-L1199

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