Peterfalvi (14.6): in the -side case (9.7.b),
ProvedOddOrder.Peterfalvi.S16.CaseBForSData.two_q_lt_ufeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let hyp be a Peterfalvi §14 configuration with hyp.base.q and hyp.base.u, and let data : CaseBForSData hyp be the -side case-(9.7.b) data. Then
This is the size input from the -side cyclotomic value consumed by the norm-cascade contradiction in (14.11.4).
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_SubgroupL
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]
namespace CaseBForSData
theorem two_q_lt_u {hyp : Hypothesis (G := G)} (data : CaseBForSData hyp) :
2 * hyp.base.q < hyp.base.u := by sorry
end CaseBForSData
end OddOrder.Peterfalvi.S16Source
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/KeyInequality.lean#L212-L260