Herzog-Schönheim conjecture for pyramidal groups
ProvedBFFPyramidal.herzog_schonheim_pyramidalHerzog-Schönheim for pyramidal groups. Let be a pyramidal group and suppose the cosets , , partition with . Then two of the indices coincide:
Herzog and Schönheim conjectured this for arbitrary groups; it remains open in general, and is open even for finite solvable groups. It is a consequence of the multiplicity bound of Berger-Felzenbaum-Fraenkel, since that bound is always at least .
Formalization note. The conclusion is stated for the indices (K i).index, matching the conjecture as usually stated; for a finite group equality of indices is equivalent to equality of orders. The indices range over the index type Fin t, and refers to distinct indices, so the two cosets are distinct parts of the partition even if the subgroups happen to be equal.
import Mathlib import Definitions.Def_BFFPyramidal_pyramidal import Definitions.Def_BFFPyramidal_cosetPartition
namespace BFFPyramidal
theorem herzog_schonheim_pyramidal {G : Type*} [Group G] [Finite G] (hG : IsPyramidal G)
{t : ℕ} (ht : 1 < t) (K : Fin t → Subgroup G) (a : Fin t → G)
(hpart : IsCosetPartition K a) :
∃ i j : Fin t, i ≠ j ∧ (K i).index = (K j).index := by
sorry
end BFFPyramidal
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: BFFPyramidal.herzog_schonheim_pyramidal
Shape of the statement. The declaration asserts a single implication, universally quantified over four objects and three typeclass/propositional hypotheses. In order, the binders are:
- — a type, implicit (inferred from later arguments), at an arbitrary universe level;
- a instance-implicit assumption that carries a group structure;
- a instance-implicit assumption that is finite (mere finiteness of the underlying type, no chosen enumeration);
- — an explicit hypothesis that is pyramidal in the sense unfolded below;
- — a natural number, implicit;
- — an explicit hypothesis , i.e. (strict inequality on ; and are excluded);
- — an explicit function assigning to each a subgroup ;
- — an explicit function assigning to each an element ;
- — an explicit hypothesis that the family is a coset partition of , unfolded below.
The conclusion is
Both and are existentially quantified over the same index set (of size exactly ), the two quantifiers being nested in that order with the conjunction in their common scope. Here denotes the index of in , defined as the cardinality of the left-coset space as a natural number (with the convention that it is when that space is infinite — irrelevant here, since is assumed finite, so every index is a positive natural number dividing ). The asserted relation between the two indices is equality of natural numbers, not inequality or distinctness: the claim is that among the indices there are two positions carrying the same index value. Nothing is asserted about the subgroups themselves being distinct, about the cosets being distinct, or about which value the common index takes; in particular the conclusion is satisfied outright if for some .
Unfolding "coset partition" (). The hypothesis states literally:
The condition is equivalent to , so this says: every element of lies in the left coset for exactly one index . The uniqueness is over indices, not over cosets: if two indices gave the same coset , the hypothesis would fail. Consequently the cosets are pairwise disjoint, cover , and are pairwise distinct as sets; since , at least two of them exist and each is nonempty, so and , i.e. . (These are consequences, not extra hypotheses.) Note in particular that the hypothesis is unsatisfiable when is the trivial group: then every is the whole group and every index satisfies , contradicting uniqueness for . No hypothesis asserts that the are proper, nontrivial, normal, distinct, or of index ; index for some is excluded only indirectly, via the uniqueness clause together with .
Unfolding "pyramidal" (). (defined only for a type with a group structure and a finiteness instance) states literally:
Here is itself and is the trivial subgroup; is a total function on all of , so its values at indices are completely unconstrained (junk values are permitted there), and the step condition is imposed exactly for (strict ). is the index of inside , which under the accompanying containment equals the ordinary relative index . denotes the order of the subgroup (the cardinality of its underlying set, as a natural number), and is the least prime factor of , with the total-function conventions and . Because , the descent need not be strict: once the chain reaches (order ) it may repeat with relative index , so is not determined by . Degenerately, imposes no step conditions and requires only and , so the trivial group is pyramidal; more generally the existential over and makes this a purely existential condition on . Solvability, normality of the steps, and supersolvability appear nowhere in the definition.
Truncation and arithmetic conventions. The statement itself contains no natural-number subtraction and no natural-number division; the only truncating conventions in play are those of at and inside the pyramidal hypothesis and the " when infinite" convention for indices (inert under the finiteness instance). The auxiliary quantity defined in the same imported file (a truncating natural-number division) is not used in this statement.
Degenerate and boundary situations covered. The index type is nonempty and has at least two elements by , so the conclusion's requirement is not automatically unsatisfiable. The trivial group is admitted by but excluded by as noted. Nothing prevents from being a constant family together with a suitable (e.g. all equal to a fixed subgroup of index and enumerating coset representatives), in which case the conclusion is immediate.
Proof status. The proof body is sorry: the declaration is stated and admitted, with no proof supplied.
Confirmed by the mission captain (proposal self-audit).