A pyramidal group has a unique Sylow subgroup for its largest prime
ProvedBFFPyramidal.lemma_IIILemma III. Every pyramidal group contains a unique Sylow -subgroup, where is the greatest prime factor of the order of ; being unique, that subgroup is normal.
Formalization note. Uniqueness is stated as Subsingleton (Sylow (maxPrimeFac (Nat.card G)) G) — any two Sylow -subgroups are equal — and normality as a separate conjunct asserting that each such Sylow subgroup is normal. The degenerate case of the trivial group is included: there and the assertion is vacuously true. Note that the conclusion is about Sylow subgroups for the greatest prime factor, whereas the definition of pyramidality constrains indices by the least prime factor.
import Mathlib import Definitions.Def_BFFPyramidal_pyramidal import Definitions.Def_BFFPyramidal_arithmetic
namespace BFFPyramidal
theorem lemma_III {G : Type*} [Group G] [Finite G] (hG : IsPyramidal G) :
Subsingleton (Sylow (maxPrimeFac (Nat.card G)) G) ∧
∀ S : Sylow (maxPrimeFac (Nat.card G)) G, (S : Subgroup G).Normal := by
sorry
end BFFPyramidal
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back of BFFPyramidal.lemma_III
Shape of the statement. The declaration is a single implication with one universally quantified type. The type is an implicit argument (in an arbitrary universe), and it carries two instance-implicit assumptions: is a group, and is finite (finiteness only, not a chosen enumeration or explicit cardinality). There is one explicit hypothesis, named , namely that is pyramidal in the sense of the accompanying definition (unfolded below). The conclusion is a conjunction of two claims, both about Sylow subgroups for the number , where denotes Nat.card G, the cardinality of as a type (for a finite group this is the group order, and it is ; it would be only for an infinite type, which the finiteness instance excludes), and where is the custom function .
The number (unfolded). is defined as the supremum, taken inside with , of the finite set of prime factors of . Thus is the largest prime dividing when , and by the empty-supremum convention
In particular, if is the trivial group then and the prime used in the conclusion is the number , not a prime at all. Note that nowhere in the statement is it asserted or assumed that is prime, nor that ; the conclusion is taken at face value for whatever natural number happens to be.
Hypothesis : is pyramidal (unfolded). This asserts the existence of a natural number and a function — a total function on all of , whose values at indices are entirely unconstrained — such that
and such that for every with (strictly less; the condition is imposed at and at no other index):
- (containment of subgroups, not necessarily strict), and
- ,
where is the index of in (so, given condition 1, the ordinary index ), is the cardinality of the subgroup viewed as a type, and is the least prime factor function, with the standard conventions and . Two degenerate readings are visible: with the step condition is vacuous and the hypothesis reduces to , i.e. trivial; and because descent need not be strict, a chain may sit at for many steps, since forces relative index there. The hypothesis is a plain existential statement, and it is satisfiable (e.g. by the trivial group, or by cyclic groups), so the theorem is not vacuous.
Conclusion, first conjunct. The type of Sylow -subgroups of is a subsingleton: any two of its elements are equal. Elements of this type are subgroups that are -groups (every element satisfies for some ) and are maximal among such subgroups. So the first conjunct says: there is at most one maximal -subgroup of . It does not by itself assert existence; existence for finite and prime is a separate (classical) fact, and for the notion degenerates — every group is a "-group" under the stated condition, since taking gives and for all — so for the trivial group (and, more generally, whenever ) the only maximal such subgroup is and both conjuncts hold automatically.
Conclusion, second conjunct. For every of that same Sylow type (a universal quantifier over a type that the first conjunct has just declared to have at most one element), the underlying subgroup of is normal in : for every in that subgroup and every , the conjugate again lies in the subgroup. If the Sylow type is empty, this conjunct is vacuously true.
Summary of what is literally asserted. For every finite group admitting a chain in which each relative index equals the least prime factor of the order of the preceding term, the maximal -subgroup of for the greatest prime factor of (with when ) is unique if it exists, and every such maximal -subgroup is normal. No positivity hypothesis on , no primality hypothesis on , no non-triviality hypothesis on , and no existence claim for a Sylow subgroup appear in the statement. There is no natural-number subtraction anywhere; natural-number division appears only implicitly inside the index/relative-index notions, which are Mathlib's total functions on subgroups.
Confirmed by the mission captain (proposal self-audit).