Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.2.a) for TTT: the complement VVV is cyclic

Proved
OddOrder.Peterfalvi.S16.V_cyclic

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite minimal simple odd-order group (IsMinimalSimpleOdd G) with no maximal subgroup of type V (hnoV), and assume the noncoherence refuter OddOrder.Peterfalvi.S13.H0CNoncoherenceRefuter G (hncH0C). Let hyp be a Peterfalvi §14 configuration (OddOrder.Peterfalvi.S16.Hypothesis) for GGG. Then the subgroup VVV of hyp.base is cyclic:

V is cyclic(IsCyclic ↥hyp.base.V).V \text{ is cyclic}\quad(\texttt{IsCyclic ↥hyp.base.V}).V is cyclic(IsCyclic ↥hyp.base.V).

Here VVV is the abelian Frobenius kernel complement on the TTT-side; the statement is the TTT-side analogue of the cyclicity of UUU. It is used to show that K=VK = VK=V is cyclic in (14.11).

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_SubgroupM
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_CoherentEtaOrthogonality
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_BetaVanishing
Formal statement
namespace OddOrder.Peterfalvi.S16

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Isaacs

open scoped Pointwise

open scoped BigOperators

variable {G : Type*} [Group G]

open scoped IsMulCommutative in

theorem V_cyclic [Finite G] (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M)
    (hncH0C : OddOrder.Peterfalvi.S13.H0CNoncoherenceRefuter G)
    (hyp : Hypothesis (G := G)) : IsCyclic ↥hyp.base.V := by sorry

end OddOrder.Peterfalvi.S16
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/Peterfalvi/S16_NonExistenceG/BetaVanishing.lean#L318-L423

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