Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Multiplicity of a subnormal uniform cover is at least the least prime

Proved
SubnormalCover.multiplicity_ge_minFac

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

combinatoricsgroup-theory

Main theorem (Sun, Theorem 4.3(i)). Let a1G1,…,akGka_1G_1,\dots,a_kG_ka1​G1​,…,ak​Gk​ be a nontrivial uniform cover of an arbitrary group GGG (each x∈Gx\in Gx∈G lies in exactly www of the cosets, and some Gi≠GG_i\ne GGi​=G) by subnormal subgroups of finite index. Put ni=[G:Gi]n_i=[G:G_i]ni​=[G:Gi​] and N=[n1,…,nk]N=[n_1,\dots,n_k]N=[n1​,…,nk​], and let p∗p_*p∗​ and p∗p^{*}p∗ be the smallest and largest prime divisors of NNN. Then among the kkk indices there is a multiple of p∗p^{*}p∗ occurring at least p∗p_*p∗​ times: there exists jjj with p∗∣njp^{*}\mid n_jp∗∣nj​ and ∣{i:ni=nj}∣≥p∗|\{i : n_i=n_j\}|\ge p_*∣{i:ni​=nj​}∣≥p∗​. In particular the maximal multiplicity M=max⁡j∣{i:ni=nj}∣M=\max_j|\{i:n_i=n_j\}|M=maxj​∣{i:ni​=nj​}∣ satisfies M≥p∗M\ge p_*M≥p∗​, which is the quantitative form of Theorem 1.1 and answers Erd\H{o}s' open question negatively for subnormal covers.

Formalization note. NNN is coverLcm K (the lcm of the indices), p∗p^{*}p∗ is BFFPyramidal.maxPrimeFac N and p∗p_*p∗​ is Nat.minFac N; the hypotheses hcov and hnt already force k≥2k\ge 2k≥2 and N≥2N\ge 2N≥2, so p∗p_*p∗​ is a genuine prime (not the junk value minFac 1=1\texttt{minFac }1=1minFac 1=1) and no separate 1<k1<k1<k assumption is needed.

Preamble
import Mathlib
import Definitions.Def_SubnormalCover_uniformCover
import Definitions.Def_BFFPyramidal_arithmetic
Formal statement
namespace SubnormalCover

open BFFPyramidal

theorem multiplicity_ge_minFac {G : Type*} [Group G] {k : ℕ}
    (K : Fin k → Subgroup G) (a : Fin k → G) (w : ℕ) (hcov : IsUniformCover K a w)
    (hfin : ∀ i, (K i).FiniteIndex) (hsn : ∀ i, (K i).IsSubnormal) (hnt : ∃ i, K i ≠ ⊤) :
    ∃ j : Fin k, maxPrimeFac (coverLcm K) ∣ (K j).index ∧
      Nat.minFac (coverLcm K) ≤ indexMultiplicity K ((K j).index) := by
  sorry

end SubnormalCover
Source
Z.-W. Sun, On the Herzog-Schönheim conjecture for uniform covers of groups, J. Algebra 273 (2004) 153-175, https://doi.org/10.1016/S0021-8693(03)00526-X, Theorem 4.3(i), first half (M≥p∗M \ge p_*M≥p∗​); equivalently the non-asymptotic half of Theorem 1.1
Read-back

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

Setting. Let GGG be an arbitrary group and kkk an implicit natural number. We are given subgroups K0,…,Kk−1≤GK_0,\dots,K_{k-1} \le GK0​,…,Kk−1​≤G indexed by Fin k\mathrm{Fin}\,kFink (repetitions permitted), elements a0,…,ak−1∈Ga_0,\dots,a_{k-1} \in Ga0​,…,ak−1​∈G, a natural number www, and the hypotheses:

  • (hcov)(hcov)(hcov) the system of left cosets aiKia_iK_iai​Ki​ is a uniform cover of weight www: for every x∈Gx \in Gx∈G, the number of indices iii with ai−1x∈Kia_i^{-1}x \in K_iai−1​x∈Ki​ (equivalently x∈aiKix \in a_iK_ix∈ai​Ki​) is exactly www;
  • (hfin)(hfin)(hfin) every KiK_iKi​ has finite index: [G:Ki]≠0[G:K_i] \ne 0[G:Ki​]=0, where [G:S][G:S][G:S] is the number of left cosets #(G/S)\#(G/S)#(G/S), equal to 000 by convention when infinite;
  • (hsn)(hsn)(hsn) every KiK_iKi​ is subnormal in GGG, i.e. sits in a finite chain Ki⊴⋯⊴GK_i \trianglelefteq \cdots \trianglelefteq GKi​⊴⋯⊴G of successively normal subgroups;
  • (hnt)(hnt)(hnt) there exists an index iii with Ki≠GK_i \ne GKi​=G; this forces k≥1k \ge 1k≥1, hence (with (hcov)(hcov)(hcov)) w≥1w \ge 1w≥1, and forces lcm⁡i[G:Ki]≥2\operatorname{lcm}_i[G:K_i] \ge 2lcmi​[G:Ki​]≥2.

Conclusion. Write N=lcm⁡i[G:Ki]N = \operatorname{lcm}_{i}[G:K_i]N=lcmi​[G:Ki​] for the least common multiple of all kkk indices (the Finset lcm, which would be 111 on an empty index family), P(m)P(m)P(m) for the greatest prime factor of mmm taken as the supremum of mmm's prime-factor set, with P(0)=P(1)=0P(0) = P(1) = 0P(0)=P(1)=0 since that set is empty, and mult(m)=#{i:[G:Ki]=m}\mathrm{mult}(m) = \#\{i : [G:K_i] = m\}mult(m)=#{i:[G:Ki​]=m} for the number of indices taking the value mmm. Then there exists j∈Fin kj \in \mathrm{Fin}\,kj∈Fink (existence only, no uniqueness, and jjj need not be one of the indices witnessing (hnt)(hnt)(hnt)) such that simultaneously:

  1. P(N)∣[G:Kj]P(N) \mid [G:K_j]P(N)∣[G:Kj​] (the greatest prime factor of the lcm of the indices divides the jjj-th index), and
minFac(N)  ≤  mult([G:Kj]),\mathrm{minFac}(N) \;\le\; \mathrm{mult}\big([G:K_j]\big),minFac(N)≤mult([G:Kj​]),

where minFac(n)\mathrm{minFac}(n)minFac(n) is Mathlib's least prime factor of nnn, with the conventions minFac(0)=2\mathrm{minFac}(0) = 2minFac(0)=2 and minFac(1)=1\mathrm{minFac}(1) = 1minFac(1)=1; the right-hand side counts all indices iii (including jjj) with [G:Ki]=[G:Kj][G:K_i] = [G:K_j][G:Ki​]=[G:Kj​], so it is at least 111.

Edge behaviour. The inequality is non-strict (≤\le≤) and points from the least prime factor of the lcm up to a multiplicity. If NNN were 111, clause 1 would demand 0∣[G:Kj]0 \mid [G:K_j]0∣[G:Kj​], i.e. [G:Kj]=0[G:K_j] = 0[G:Kj​]=0, contradicting (hfin)(hfin)(hfin); but (hnt)(hnt)(hnt) already rules out N=1N = 1N=1, so minFac(N)\mathrm{minFac}(N)minFac(N) is a genuine prime ≥2\ge 2≥2. The case k=0k = 0k=0 cannot occur, since (hnt)(hnt)(hnt) is unsatisfiable over an empty index type. The weight www, the elements aia_iai​ and the subnormality hypothesis appear only among the hypotheses, not in the conclusion.

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

  • Endorsed by burkh4rt · Sep 14, 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