Pyramidal groups
DefinitionBFFPyramidal_pyramidalA finite group is pyramidal if it admits a chain of subgroups
in which each step has index equal to the least prime factor of the order of the preceding term:
where denotes the least prime factor of .
It is classical that a subgroup whose index is the smallest prime dividing the group order is normal; such a chain is therefore a composition series, so every pyramidal group is solvable, and every supersolvable group is pyramidal. Pyramidality is thus a chain condition lying between supersolvability and solvability. It is the hypothesis under which Berger, Felzenbaum and Fraenkel establish their multiplicity bound for coset partitions.
Formalization note. The chain is a function c : ℕ → Subgroup G together with a length , with c 0 = ⊤, c n = ⊥, and the step condition imposed exactly for k < n; values of c beyond are unconstrained. Each step asserts both c (k+1) ≤ c k and that Subgroup.relIndex (c (k+1)) (c k) — the index of c (k+1) ⊓ c k in c k — equals Nat.minFac (Nat.card (c k)); the containment is what makes the relative index the ordinary index. Descent is not required to be strict: once the chain reaches , Nat.minFac 1 = 1 forces index , so may repeat and is not determined by . None of this changes the class of groups described. Normality of the steps is a consequence, not a hypothesis, and solvability is stated separately as BFFPyramidal.isSolvable_of_isPyramidal.
import Mathlib
namespace BFFPyramidal
/-- A finite group `G` is **pyramidal** if it admits a chain of subgroups
`⊤ = c 0 ≥ c 1 ≥ ⋯ ≥ c n = ⊥` in which every step has relative index equal to the *least*
prime factor of the order of the preceding term:
`[c k : c (k+1)] = Nat.minFac |c k|` for every `k < n`.
This is conditions (1)–(2) of Berger–Felzenbaum–Fraenkel.
Three points about the formalization, none of which changes the class of groups described.
The chain is a total function on `ℕ`; only its values at indices `≤ n` are constrained, and the
step condition is imposed exactly for `k < n`. The containment `c (k+1) ≤ c k` is stated
alongside the index condition, and is what makes `Subgroup.relIndex (c (k+1)) (c k)` — the index
of `c (k+1) ⊓ c k` in `c k` — equal to the ordinary index `[c k : c (k+1)]`. Descent is not
required to be strict: once a chain reaches `⊥`, `Nat.minFac 1 = 1` forces index `1`, so `⊥` may
repeat, and `n` is therefore not determined by `G`.
It is classical that a subgroup whose index is the least prime dividing the order is normal, so
such a chain is a composition series and a pyramidal group is solvable; that consequence is *not*
part of this definition and is stated separately as `BFFPyramidal.isSolvable_of_isPyramidal`.
Every supersolvable group is pyramidal. -/
def IsPyramidal (G : Type*) [Group G] [Finite G] : Prop :=
∃ (n : ℕ) (c : ℕ → Subgroup G),
c 0 = ⊤ ∧ c n = ⊥ ∧
∀ k < n, c (k + 1) ≤ c k ∧
Subgroup.relIndex (c (k + 1)) (c k) = Nat.minFac (Nat.card (c k))
end BFFPyramidal
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: BFFPyramidal.IsPyramidal
The artifact introduces a definition, not a theorem: it defines a predicate (a Prop-valued property) named on types. Its arguments are: an explicit type variable (in an arbitrary universe), and two instance-implicit typeclass arguments — a group structure on , and a proof that is finite (Finite G, i.e. is in bijection with some Fin m; note this is the propositional finiteness class, not a chosen enumeration). Nothing else is assumed; in particular is not assumed nontrivial, and no commutativity or solvability assumption appears.
The predicate asserts the existence of the following data and properties:
where is the lattice of all subgroups of , such that
- , i.e. is the whole group ;
- , i.e. is the trivial subgroup ;
- for every natural number with (strict inequality; so this is the set of indices , empty when ), both of the following hold:
- as subgroups, i.e. is contained in (non-strict containment: equality is permitted);
Here the left-hand side is Mathlib's relative index , which by definition is the index, inside the group , of the subgroup of . It is stated in that intersected form regardless of the containment hypothesis; given the containment imposed in the same conjunct, this intersection is just , so the quantity is the ordinary index . (Indices here are Mathlib's natural-number index, which is defined to be when the index is infinite; since is finite this degenerate value cannot occur, and the index is a positive natural number.)
The right-hand side is , the least prime factor function on , applied to , the cardinality of the underlying set of the subgroup viewed as a type. Because is finite and a subgroup is nonempty, , so the junk value is unreachable. The genuinely relevant boundary value is : Mathlib defines , so at a step where is the trivial subgroup the condition reads , which (with ) is automatic. Consequently the chain is not required to descend strictly: once it reaches it may stall at for arbitrarily many further steps, and more generally the containments are non-strict wherever , which happens exactly when . For any the required index is the least prime dividing , hence , forcing strict descent there.
Three further points about what the quantifiers silently include:
- is a total function on all of ; its values at indices are completely unconstrained, and the conditions in (3) are imposed only for . So the existential over is really an existential over the finite tuple .
- The case is allowed. Then conditions (1) and (2) together say , i.e. is the trivial group, and condition (3) is vacuous. Hence the trivial group satisfies the predicate via ; for a nontrivial the witness must be at least . The number is not pinned down by (it can always be increased by repeating ).
- No normality is required of any , no assertion that is prime as such is made beyond its being the least prime factor of (which for is the non-prime value ), and nothing about solvability, composition series, or supersolvability is asserted by this definition.
Finally, the declaration carries a long documentation comment describing the intended meaning, attributing conditions to Berger–Felzenbaum–Fraenkel, and asserting that such groups are solvable and that every supersolvable group is pyramidal. Those remarks are prose only: they are not part of the logical content of the definition and nothing in the artifact proves them.
Confirmed by the mission captain (proposal self-audit).