Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A pyramidal group has a unique Sylow subgroup for its largest prime

Proved
BFFPyramidal.lemma_III

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

combinatoricscoset-partitionsgroup-theoryherzog-schonheim

Lemma III. Every pyramidal group GGG contains a unique Sylow P(∣G∣)P(|G|)P(∣G∣)-subgroup, where P(∣G∣)P(|G|)P(∣G∣) is the greatest prime factor of the order of GGG; being unique, that subgroup is normal.

Formalization note. Uniqueness is stated as Subsingleton (Sylow (maxPrimeFac (Nat.card G)) G) — any two Sylow P(∣G∣)P(|G|)P(∣G∣)-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 maxPrimeFac 1=0\mathrm{maxPrimeFac}\,1 = 0maxPrimeFac1=0 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.

Preamble
import Mathlib
import Definitions.Def_BFFPyramidal_pyramidal
import Definitions.Def_BFFPyramidal_arithmetic
Formal statement
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
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, pp. 140-141, Lemma III and eq. (8)
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 GGG is an implicit argument (in an arbitrary universe), and it carries two instance-implicit assumptions: GGG is a group, and GGG is finite (finiteness only, not a chosen enumeration or explicit cardinality). There is one explicit hypothesis, named hGh_GhG​, namely that GGG 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 P(∣G∣)P(|G|)P(∣G∣), where ∣G∣|G|∣G∣ denotes Nat.card G, the cardinality of GGG as a type (for a finite group this is the group order, and it is ≥1\ge 1≥1; it would be 000 only for an infinite type, which the finiteness instance excludes), and where PPP is the custom function maxPrimeFac\mathrm{maxPrimeFac}maxPrimeFac.

The number P(m)P(m)P(m) (unfolded). P(m)P(m)P(m) is defined as the supremum, taken inside N\mathbb{N}N with sup⁡∅=0\sup \emptyset = 0sup∅=0, of the finite set of prime factors of mmm. Thus P(m)P(m)P(m) is the largest prime dividing mmm when m≥2m \ge 2m≥2, and by the empty-supremum convention

P(0)=P(1)=0.P(0) = P(1) = 0 .P(0)=P(1)=0.

In particular, if GGG is the trivial group then ∣G∣=1|G| = 1∣G∣=1 and the prime used in the conclusion is the number 000, not a prime at all. Note that nowhere in the statement is it asserted or assumed that P(∣G∣)P(|G|)P(∣G∣) is prime, nor that ∣G∣>1|G| > 1∣G∣>1; the conclusion is taken at face value for whatever natural number P(∣G∣)P(|G|)P(∣G∣) happens to be.

Hypothesis hGh_GhG​: GGG is pyramidal (unfolded). This asserts the existence of 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, whose values at indices >n> n>n are entirely unconstrained — such that

c0=⊤ (the whole group),cn=⊥ (the trivial subgroup),c_0 = \top \ (\text{the whole group}), \qquad c_n = \bot \ (\text{the trivial subgroup}),c0​=⊤ (the whole group),cn​=⊥ (the trivial subgroup),

and such that for every kkk with k<nk < nk<n (strictly less; the condition is imposed at k=0,…,n−1k = 0, \dots, n-1k=0,…,n−1 and at no other index):

  1. ck+1≤ckc_{k+1} \le c_kck+1​≤ck​ (containment of subgroups, not necessarily strict), and
  2. relIndex(ck+1,ck)=minFac(∣ck∣)\mathrm{relIndex}(c_{k+1}, c_k) = \mathrm{minFac}\big(|c_k|\big)relIndex(ck+1​,ck​)=minFac(∣ck​∣),

where relIndex(H,K)\mathrm{relIndex}(H, K)relIndex(H,K) is the index of H∩KH \cap KH∩K in KKK (so, given condition 1, the ordinary index [ck:ck+1][c_k : c_{k+1}][ck​:ck+1​]), ∣ck∣|c_k|∣ck​∣ is the cardinality of the subgroup ckc_kck​ viewed as a type, and minFac\mathrm{minFac}minFac is the least prime factor function, with the standard conventions minFac(1)=1\mathrm{minFac}(1) = 1minFac(1)=1 and minFac(0)=2\mathrm{minFac}(0) = 2minFac(0)=2. Two degenerate readings are visible: with n=0n = 0n=0 the step condition is vacuous and the hypothesis reduces to ⊤=⊥\top = \bot⊤=⊥, i.e. GGG trivial; and because descent need not be strict, a chain may sit at ⊥\bot⊥ for many steps, since minFac(1)=1\mathrm{minFac}(1) = 1minFac(1)=1 forces relative index 111 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 P(∣G∣)P(|G|)P(∣G∣)-subgroups of GGG is a subsingleton: any two of its elements are equal. Elements of this type are subgroups S≤GS \le GS≤G that are P(∣G∣)P(|G|)P(∣G∣)-groups (every element g∈Sg \in Sg∈S satisfies g P(∣G∣)k=1g^{\,P(|G|)^k} = 1gP(∣G∣)k=1 for some k∈Nk \in \mathbb{N}k∈N) and are maximal among such subgroups. So the first conjunct says: there is at most one maximal P(∣G∣)P(|G|)P(∣G∣)-subgroup of GGG. It does not by itself assert existence; existence for GGG finite and P(∣G∣)P(|G|)P(∣G∣) prime is a separate (classical) fact, and for P(∣G∣)=0P(|G|) = 0P(∣G∣)=0 the notion degenerates — every group is a "000-group" under the stated condition, since taking k=1k = 1k=1 gives 01=00^1 = 001=0 and g0=1g^0 = 1g0=1 for all ggg — so for the trivial group (and, more generally, whenever P(∣G∣)=0P(|G|) = 0P(∣G∣)=0) the only maximal such subgroup is ⊤\top⊤ and both conjuncts hold automatically.

Conclusion, second conjunct. For every SSS 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 SSS is normal in GGG: for every xxx in that subgroup and every g∈Gg \in Gg∈G, the conjugate gxg−1g x g^{-1}gxg−1 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 GGG admitting a chain ⊤=c0≥c1≥⋯≥cn=⊥\top = c_0 \ge c_1 \ge \dots \ge c_n = \bot⊤=c0​≥c1​≥⋯≥cn​=⊥ in which each relative index equals the least prime factor of the order of the preceding term, the maximal PPP-subgroup of GGG for PPP the greatest prime factor of ∣G∣|G|∣G∣ (with P=0P = 0P=0 when ∣G∣=1|G| = 1∣G∣=1) is unique if it exists, and every such maximal PPP-subgroup is normal. No positivity hypothesis on ∣G∣|G|∣G∣, no primality hypothesis on P(∣G∣)P(|G|)P(∣G∣), no non-triviality hypothesis on GGG, 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.

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