Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pyramidal groups are solvable

Proved
BFFPyramidal.isSolvable_of_isPyramidal

by burkh4rt · Sep 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricscoset-partitionsgroup-theoryherzog-schonheim

Every pyramidal group is solvable.

Indeed, in the defining chain each step has index equal to the least prime factor of the order of the preceding term, and a subgroup of least prime index is normal; so the chain is a composition series with cyclic factors of prime order, whence the group is solvable. This is why the class of pyramidal groups sits between the supersolvable groups (all of which are pyramidal) and the solvable groups.

Formalization note. Solvability is Mathlib's Group.IsSolvable. The trivial group is included and is solvable.

Preamble
import Mathlib
import Definitions.Def_BFFPyramidal_pyramidal
Formal statement
namespace BFFPyramidal

theorem isSolvable_of_isPyramidal {G : Type*} [Group G] [Finite G] (hG : IsPyramidal G) :
    Group.IsSolvable G := by
  sorry

end BFFPyramidal
Source
Berger--Felzenbaum--Fraenkel 1987, Remark on the multiplicity of a partition of a group into cosets, Fund. Math. 128 (1987) 139-144, https://doi.org/10.4064/fm-128-3-139-144, p. 139, the remark following eq. (2) (citing Rotman, The Theory of Groups, Exer. 3.43)
Read-back

What the Lean code literally says, in plain math · claude-opus-5

Read-back: BFFPyramidal.isSolvable_of_isPyramidal

The declaration asserts a single implication, universally quantified over a type together with two typeclass structures on it.

Binders. There is one implicit type variable GGG (implicit: the reader/user never supplies it explicitly; it is inferred). There are two instance-implicit hypotheses: GGG carries a group structure, and GGG is finite (Mathlib's Finite, i.e. GGG is in bijection with some {0,…,m−1}\{0,\dots,m-1\}{0,…,m−1}; this is the non-constructive finiteness predicate, not a chosen enumeration). There is then one explicit hypothesis, named hGh_GhG​, asserting that GGG is pyramidal in the sense of the accompanying definition, unfolded below. The conclusion is that GGG is solvable. Note that the finiteness instance is not merely an ambient convenience: it is required even to state the hypothesis, since the pyramidality predicate itself takes a finiteness instance as an argument. So the claim is:

∀G, ∀(group structure on G), ∀(proof that G is finite),IsPyramidal(G)  ⟹  G is solvable.\forall G,\ \forall (\text{group structure on } G),\ \forall (\text{proof that } G \text{ is finite}),\quad \mathrm{IsPyramidal}(G) \;\Longrightarrow\; G \text{ is solvable}.∀G, ∀(group structure on G), ∀(proof that G is finite),IsPyramidal(G)⟹G is solvable.

Unfolding "pyramidal". IsPyramidal(G)\mathrm{IsPyramidal}(G)IsPyramidal(G) is the following existential statement. There exist a natural number nnn and a function c:N→{subgroups of G}c : \mathbb{N} \to \{\text{subgroups of } G\}c:N→{subgroups of G} — a total function on all of N\mathbb{N}N, so ckc_kck​ is defined for every kkk, including k>nk > nk>n, but only some of its values are constrained — such that

  1. c0=⊤c_0 = \topc0​=⊤, the whole group GGG viewed as a subgroup of itself;
  2. cn=⊥c_n = \botcn​=⊥, the trivial subgroup {1}\{1\}{1};
  3. for every natural number kkk with k<nk < nk<n (strict inequality), both of the following hold:
    • ck+1≤ckc_{k+1} \le c_kck+1​≤ck​, i.e. ck+1c_{k+1}ck+1​ is contained in ckc_kck​ as a subgroup; and
    • relIndex(ck+1,ck)=minFac(∣ck∣)\mathrm{relIndex}(c_{k+1}, c_k) = \mathrm{minFac}\big(\lvert c_k \rvert\big)relIndex(ck+1​,ck​)=minFac(∣ck​∣).

Here relIndex(H,K)\mathrm{relIndex}(H, K)relIndex(H,K) is Mathlib's relative index: by definition it is the index of the subgroup H∩KH \cap KH∩K inside KKK, i.e. the number of cosets of H⊓KH \sqcap KH⊓K in KKK, as a natural number, with the convention that this value is 000 when that index is infinite (which cannot occur here, GGG being finite). Under the accompanying containment ck+1≤ckc_{k+1} \le c_kck+1​≤ck​ this equals the ordinary index [ ck:ck+1 ][\,c_k : c_{k+1}\,][ck​:ck+1​]; the containment is stated separately and is not implied by the index equation. Next, ∣ck∣\lvert c_k \rvert∣ck​∣ denotes Nat.card of the subgroup ckc_kck​ regarded as a type — its cardinality as a natural number (again 000 for an infinite type, which cannot occur here). And minFac(m)\mathrm{minFac}(m)minFac(m) is Mathlib's least-prime-factor function on N\mathbb{N}N, with the total-function conventions minFac(0)=2\mathrm{minFac}(0) = 2minFac(0)=2 and minFac(1)=1\mathrm{minFac}(1) = 1minFac(1)=1; for m≥2m \ge 2m≥2 it is the smallest prime dividing mmm. No truncated subtraction or division appears anywhere in the statement; the only "junk value" conventions in play are those just listed for minFac\mathrm{minFac}minFac, Nat.card, and the index.

So the hypothesis says: GGG admits a descending (not necessarily strictly descending) chain of subgroups G=c0⊇c1⊇⋯⊇cn={1}G = c_0 \supseteq c_1 \supseteq \cdots \supseteq c_n = \{1\}G=c0​⊇c1​⊇⋯⊇cn​={1} in which each successive index equals the smallest prime dividing the order of the previous term.

Degenerate and boundary cases implicit in this. The case n=0n = 0n=0 is allowed: then conditions (1) and (2) together force ⊤=⊥\top = \bot⊤=⊥, i.e. GGG is the trivial group, and condition (3) is vacuous (there is no k<0k < 0k<0). The hypothesis is thus satisfiable and in particular holds for the trivial group, for which the conclusion is also true; the theorem is therefore not vacuous, and the hypothesis is not unsatisfiable. Because the chain need not descend strictly, and because minFac(1)=1\mathrm{minFac}(1) = 1minFac(1)=1, once the chain reaches ⊥\bot⊥ at some index the step condition at later indices k<nk < nk<n is satisfied by ck+1=ck=⊥c_{k+1} = c_k = \botck+1​=ck​=⊥ (index 111); hence nnn is not determined by GGG and may be taken arbitrarily large. Values ckc_kck​ for k>nk > nk>n are entirely unconstrained. The values of ckc_kck​ at indices k≤nk \le nk≤n are constrained only by (1)–(3); in particular nothing requires ckc_kck​ to be normal in GGG or in ck−1c_{k-1}ck−1​, and nothing directly requires ckc_kck​ to be proper. Since GGG is finite, ∣ck∣≥1\lvert c_k \rvert \ge 1∣ck​∣≥1 always, so the minFac(0)=2\mathrm{minFac}(0) = 2minFac(0)=2 convention is never reached, but the minFac(1)=1\mathrm{minFac}(1) = 1minFac(1)=1 case is reachable exactly when ckc_kck​ is trivial.

Unfolding the conclusion. Group.IsSolvable G is Mathlib's solvability predicate: there exists a natural number mmm with the mmm-th term of the derived series of GGG equal to the trivial subgroup, G(m)={1}G^{(m)} = \{1\}G(m)={1}, where G(0)=GG^{(0)} = GG(0)=G and G(i+1)=[ G(i),G(i) ]G^{(i+1)} = [\,G^{(i)}, G^{(i)}\,]G(i+1)=[G(i),G(i)] is the commutator subgroup of the previous term. Equivalently, GGG has a finite chain of normal-in-the-previous subgroups descending to 111 with abelian quotients. For the trivial group this holds with m=0m = 0m=0.

Proof status. The proof body is sorry: the statement is asserted but not proved in this artifact, and the file will compile only with a sorry warning. No part of the statement is stated as an iff, an uniqueness claim, or a strict inequality other than the index bound k<nk < nk<n noted above.

Human review
  • Endorsed by Shuze Chen · Sep 13, 2026

  • Endorsed by burkh4rt · Sep 13, 2026

    Confirmed by the mission captain (proposal self-audit).

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