The multiplicity bound is at least two (arithmetic ingredient)
ProvedBFFPyramidal.two_le_multiplicity_bound_arithFor every integer ,
equivalently , where is the greatest prime factor of and is Euler's totient function.
This arithmetic inequality is what turns the multiplicity bound of Berger-Felzenbaum-Fraenkel into the Herzog-Schönheim conjecture for pyramidal groups: the bound always forces at least two subgroups of equal order. The hypothesis cannot be dropped — at one has and the left-hand side is .
Formalization note. This is a statement of pure arithmetic: no group appears in it. It is separated out because it is the ingredient that turns the multiplicity bound into the Herzog-Schönheim conjecture.
The floor is natural-number division, which truncates, so the statement is 2 ≤ (maxPrimeFac l * Nat.totient l) / l + 1.
import Mathlib import Definitions.Def_BFFPyramidal_arithmetic
namespace BFFPyramidal
theorem two_le_multiplicity_bound_arith (l : ℕ) (hl : 2 ≤ l) :
2 ≤ (maxPrimeFac l * Nat.totient l) / l + 1 := by
sorry
end BFFPyramidal
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: BFFPyramidal.two_le_multiplicity_bound_arith
The declaration asserts a single arithmetic inequality, universally quantified over one explicit natural-number variable. There are no implicit arguments, no instance-implicit (typeclass) arguments, no type variables, and no existential quantifiers anywhere in the statement.
Statement. For every natural number , and under the single hypothesis
the conclusion is
Both the hypothesis and the conclusion are non-strict inequalities (, in that direction: the constant is the smaller side in both). The quantifier order is: first, then the hypothesis as an assumption, then the conclusion; i.e. the whole claim is . The variable ranges over (so it includes and , which the hypothesis then excludes), and every quantity appearing — , , the quotient, and the sum — is a natural number, not a rational or real number.
The two arithmetic functions, unfolded.
-
is Euler's totient function, Mathlib's standard
Nat.totient, with the usual conventions and . -
is a definition supplied by the accompanying definitions file, not a standard library notion. It is the greatest prime factor of , defined as the supremum (maximum) of the finite set of prime divisors of , taken with the convention that the supremum of the empty set is . Consequently:
- and , since neither nor has any prime factor recorded in that set (Mathlib's set of prime factors of is empty);
- for , is the largest prime with , so .
Note that this is the greatest prime factor, not the least; the definitions file remarks that the least prime factor is a different function.
Truncating operations. The division is natural-number (floor) division: it is , and by Lean's convention division by yields (relevant only if , which the hypothesis excludes). There is no natural-number subtraction in the statement. Because of the floor, the conclusion is not equivalent to the real-number statement ; unfolding, the conclusion says exactly
Degenerate and boundary behaviour.
- : excluded by the hypothesis. Had it been allowed, the left expression would be , and the claim would be false.
- : excluded by the hypothesis. Had it been allowed, , and the claim would again be false.
- So the hypothesis is used (the statement is false without it at ), it is satisfiable (every satisfies it, so the theorem is not vacuous), and the boundary case gives , meeting the bound with equality.
- For a prime : .
What the statement does not involve. The definitions file also defines a divisor-closure operation on finite sets of naturals and a measure ; neither of these appears in the statement being audited. Nothing in the statement mentions groups, subgroups, multiplicities, pyramidal structures, or any object other than the natural number and the two arithmetic functions above, despite the declaration's name. The statement is a pure inequality between natural numbers.
Proof status. The proof body of the declaration is sorry: the theorem is asserted but not proved in this artifact.
Confirmed by the mission captain (proposal self-audit).