In this paper
AbstractIntroductionThe ideaHow the proof worksPreliminariesCoset intersections and reductionsSun’s coset union boundExponent vectors and weightsQuotient and local indicesThe subgroup F and local divisibilityLargest prime other than 7The prime 7Proof of the main theoremFormal proofAcknowledgmentsReferencesWorksMathematics
The Herzog–Schönheim Conjecture for Solvable Groups
Abstract
The Herzog–Schönheim conjecture states that if a group is partitioned into finitely many, and at least two, cosets of subgroups, then two of these subgroups have the same index. We prove the conjecture for all solvable groups, finite or infinite. Sun's bound on unions of cosets, applied in a quotient, is combined with divisibility restrictions on local indices relative to the subgroup generated by the -elements, where is the largest prime divisor of the order of a minimal counterexample. These restrictions are obtained by counting fixed points in a primitive solvable quotient. This suffices except at the prime , where the counting bound narrowly fails and an additional overlap argument is needed. The proof has been formalized in Lean~4 with mathlib.
Introduction
Erdős conjectured that in any partition of the integers into finitely many, and at least two, arithmetic progressions, the largest common difference occurs at least twice. This was proved independently by Mirsky and Newman and by Davenport and Rado; see the introduction of [9] for the history. Viewing arithmetic progressions as cosets of subgroups of , Herzog and Schönheim proposed the following generalization [11].
Conjecture 1.1 (Herzog–Schönheim). Let be a group and let
be a partition of into left cosets. Then for some .
We call the cosets the parts of the partition. Following [9], we say that is if every such partition of contains two cosets whose underlying subgroups have equal index. The conjecture is known for finite nilpotent groups [4] and pyramidal groups [5], for partitions by subnormal subgroups [18], under conditions on the prime divisors of [10], for groups of order less than 1440 [13], and for simple and symmetric groups [9]. For arbitrary groups, Akman and Sissokho proved it for partitions into cosets of at most seven distinct subgroups [1]. They also study Steiner partitions, which use exactly one coset of each subgroup, when the subgroups commute pairwise; the case of five mutually commuting subgroups is treated in [3]; see also [2]. A preprint claiming the solvable case was withdrawn [6]; we do not use its argument. Our main result is the following.
Theorem 1.2. Every solvable group is .
The idea
For a finite group, a partition (1) satisfies . Garonzi and Margolis prove the conjecture for simple and symmetric groups by showing that the sum of over the distinct subgroup indices of is less than 2 [9 Lemma 2.1]. Such a criterion depends only on the set of subgroup indices, and it cannot work for solvable groups: the sum is unbounded already on cyclic groups, as they note. Our argument also uses where the cosets lie. We compare the reciprocal sum of a family of parts with the size of the union of their images in a quotient , and bound that size from below by a theorem of Sun on unions of cosets.
For a finite group , put , with ranging over primes. Ginosar and Schnabel showed that implies that is HS [10 Theorem A]. Our criterion (Proposition 5.1) takes to be the largest prime divisor of . It combines the corresponding product over the primes below with a factor that depends on the multiplicative orders of the primes modulo and tends to zero with . That factor comes from the local indices, which are not visible to a criterion on $|G| alone.
How the proof works
Let be a finite solvable group of least order that is not HS, and let . No two are coprime, because cosets of subgroups of coprime index always meet. Using the minimality of , an elementary reduction (Lemma 2.3) also shows that no equals 2 and that the largest prime dividing is at least 5. The rest of the proof plays two facts against each other. The indices must be spread out, since they are distinct numbers whose reciprocals sum to 1. But the group structure forces them into a thin set.
Step 1: split each index at a normal subgroup (Sections 3 and 4). Let be the subgroup generated by the elements of -power order in . It is a nontrivial normal subgroup, and it has no proper normal subgroup of index prime to . Each index factors as
We call the quotient index and the local index of the part. The part meets each -coset it touches in elements. A part with is a union of -cosets; we call it universal. If every part is universal, the partition descends to the smaller group with the same indices, contrary to minimality. So the set of indices of the non-universal parts is nonempty.
Step 2: Sun’s bound applied in the quotient (Theorem 2.4 and Lemma 3.2). Record each positive integer by its exponent vector , the list of exponents in its prime factorization, and give that vector the weight . Let be the set of vectors that are coordinatewise at least for some ; these are the vectors of the multiples of the quotient indices. Write for the total weight of . The non-universal parts together cover a union of -cosets, so their images cover of the cosets in , where . Sun’s lower bound for the size of a union of cosets then gives , where depends only on the primes involved.
Step 3: local indices are restricted (Lemma 4.2). For distinct primes , write for the multiplicative order of modulo . If , a Sylow -subgroup of lies in a maximal subgroup of containing . The primitive solvable quotient of acting on the cosets of has prime-power degree , and the Sylow subgroup acts on its minimal normal subgroup nontrivially, because has no proper normal subgroup of index prime to . Counting fixed points shows that each is divisible by or by for some prime .
Step 4: counting gives a contradiction for (Proposition 5.1 and Lemma 5.2). Since , we have . By Step 3, every with lies either in or in for some prime . Shifting a set by multiplies its weight by . Accounting for their overlap, the union of these shifted sets has weight at most , where
tends to zero as grows. The are distinct and their weights add up to , so , which requires . Here is taken over all primes at most . Exact rational estimates for the small primes, an interval argument up to 255, and a uniform elementary bound for show that for every prime except 7; the finite inequalities are also checked in the Lean development.
Step 5: the prime 7 (Section 6). At a local index may be divisible by , and the shifted copy has the comparatively large weight . As a result is about 1.1 with all four primes included, and the count of Step 4 falls short of a contradiction by about 10%. We retain information that the generic count discards: which minimal quotient-index vectors actually carry parts of local index exactly 7 or exactly 8, and which parts meet the same -coset as such a part (Lemma 6.1). A missing-point and overlap-charging argument turns this incidence information into incompatible bounds (Proposition 6.3).
We use Sun’s coset union bound and the standard structure theory of primitive solvable groups. The new ingredients are the combination of the local divisibility restriction with the quotient count, and the additional argument at the prime 7. Section 8 describes the Lean formalization [14].
Preliminaries
Throughout, . For a subgroup of a group , its normal core is .
Coset intersections and reductions
The following standard fact is used repeatedly.
Lemma 2.1 ([17 Lemma 2.1 and Remark 2.2]). Let be a finite group and with and coprime. Then , and every coset of meets every coset of .
Sun’s Lemma 2.1 states for subgroups of finite coprime index in any group. His Remark 2.2 states that if for some then the indices are not coprime. The same statement appears in [10 Corollary 2.1] and, in terms of harmonic tuples, in [13 Lemma 2.2].
Lemma 2.2. If every finite solvable group is HS, then every solvable group is HS. More precisely, for a partition (1) of a group the subgroup is normal of finite index, and the cosets partition with .
Proof. By Korec and Znám [12 Theorem 1], every has finite index in . Hence has finite index, with [12 Lemma 1], and so does its normal core , the intersection of the finitely many conjugates of [12 Lemma 2]. Each part is a union of -cosets, so the images are pairwise disjoint and partition , with the same indices. This is [12 Theorem 4]. The group is solvable if is.
Lemma 2.3. Let be a finite solvable group of least order that is not HS, and fix a partition (1) with and distinct indices . Then
(a) and every ;
(b) no two of the are coprime;
(c) no equals 2;
(d) the largest prime divisor of is at least 5.
Proof. (a) The parts have sizes and are disjoint. A part of index 1 would be all of , but . (The sum is [12 Theorem 2].)
(b) Distinct parts are disjoint, so this follows from Lemma 2.1. (This is also [12 Theorem 3].)
(c) Suppose . The other parts partition the complementary coset . Each forces , and translating by gives a partition of into cosets of the , , with distinct indices . If this partition has at least two parts,
contradicting the minimality of . If then and , contradicting distinctness. This is the reduction of [10 Lemma 2.3]; see also [13 Lemma 2.3].
(d) If , every index is of the form . By (b), either all indices are even or all are divisible by : if an odd index occurs, it is a nontrivial power of and every other index is divisible by . By (c), the index is excluded. We have the following reciprocal sums:
The form a finite subset of one of these two infinite index sets, so , contrary to (a).
Part (d) also follows from [10 Theorem B]: every finite group whose order has exactly two prime divisors is HS (a -group is nilpotent, so covered by [4]). The argument above keeps the proof self-contained. □
Sun’s coset union bound
A set that is invariant under translation by some positive integer has density , which does not depend on the choice of . For example, .
Theorem 2.4 (Sun’s coset union bound). Let be a finite solvable group and let be a nonempty finite family of cosets of subgroups of . Then
This is the case of [18 Theorem 3.1]. Sun’s theorem concerns a subgroup of finite index and subgroups containing , under either of two hypotheses; the second is a composition series from to the whole group with factors of prime order, which a finite solvable group has. With , Sun’s conclusion says that the union of the cosets has at least as many elements as there are divisible by some , and this number is the left side above. Sun’s theorem has no hypothesis that the cosets cover the group, and we apply it to families whose union is a proper subset. In the nilpotent case the bound goes back to Berger, Felzenbaum and Fraenkel [4].
Exponent vectors and weights
Fix a finite set of primes. For a positive integer whose prime divisors lie in , let be its exponent vector. Order coordinatewise. For and , put
Thus is the set of vectors of the multiples of whose prime divisors lie in . For let be the unit vector at . A set is upward closed if and imply ; every set is upward closed. Define
so that and . For a set and a vector write . Then
Lemma 2.5. Let be positive integers whose prime divisors lie in , and put . Then
Proof. This is a reformulation of [18 Lemma 3.4], which Sun attributes to an earlier paper of his; we give the short proof for completeness. For a nonempty let . Then and . By inclusion–exclusion and (2), the two sides of (3) are and .
Quotient and local indices
In this section is a finite solvable group with a partition (1), is a normal subgroup of , and . We take to contain every prime divisor of .
Definition 3.1. For each part put
so that . We call the quotient index and the local index of the part. The part is universal if , that is, if . Let be the set of indices of the non-universal parts, let be the image of , and put
The image is a coset of and has elements. If meets an -coset in a point , then has elements.
Lemma 3.2. For every ,
Moreover , so
(4)
Proof. The first inequality is trivial for . Otherwise apply Theorem 2.4 in the solvable group to the cosets , , whose subgroups have index , and then Lemma 2.5.
An -coset met by a non-universal part cannot meet a universal part, since a universal part contains every -coset it meets. Hence the union of the non-universal parts is exactly the inverse image of . Its size is , which gives .
The subgroup F and local divisibility
An element of a finite group is a -element if its order is a power of . The subgroup generated by the -elements is also generated by the Sylow -subgroups. For primes , denotes the multiplicative order of modulo .
Lemma 4.1. Let be a finite group and a prime dividing , and let be the subgroup generated by the -elements of . Then is a nontrivial normal subgroup of , and every normal subgroup of of index prime to is itself.
Proof. is characteristic in , and it contains a Sylow -subgroup of , which is nontrivial. Let with . A -subgroup of maps to a -subgroup of , whose order is prime to . Thus . Each Sylow -subgroup of consists of -elements, so it is a -subgroup of and lies in . These subgroups generate ; hence . □
Lemma 4.1 does not require solvability. Only its property concerning normal subgroups of index prime to is used in the next lemma.
Lemma 4.2 (Cyclotomic divisibility). Let be a finite solvable group and a prime such that every normal subgroup of of index prime to is itself. If and , then some prime dividing satisfies
Proof. Let be a Sylow -subgroup of . The -orbits on have -power sizes summing to , so fixes some coset , that is, . Replacing by this conjugate does not change the index, so we may assume . Choose a maximal subgroup of containing , let , and let be a minimal normal subgroup of the solvable group . Then is elementary abelian of order for a prime , and .
We have , since otherwise the normal subgroup would lie in . Hence by maximality. The subgroup contains , so it is normal in , as is abelian; it is also normalized by , hence normal in . As is the largest normal subgroup of contained in , this gives , and therefore . So . As divides , which is prime to , we get ; and divides .
Since and , the map , , is a bijection. For it satisfies
Thus it carries conjugation by on to left multiplication by on . If fixed every point of , then ; but contains a Sylow -subgroup, so is prime to and by hypothesis, contrary to . Hence the fixed subgroup has order with . The non-singleton -orbits on have size divisible by , so , hence and . Therefore , which divides . □
The argument is the usual one for solvable primitive groups, where a minimal normal subgroup of the primitive quotient acts regularly; compare [16 Theorem 7.2.6]. Counting fixed points avoids a separate appeal to the orders of general linear groups.
Largest prime other than 7
For a partition and normal subgroup , we use the notation of Definition 3.1: , , , and . The weight and the product are as in Section 2, for the specified prime set .
For a prime put
where here and below sums and products indexed by run over primes.
Proposition 5.1. Let be a finite solvable group with a partition (1) whose indices are distinct, let be the largest prime divisor of , and let be the subgroup generated by the -elements
of ; use the notation of Definition 3.1 for this . If some part is not universal relative to , then
Proof. Take to be the set of primes at most , so that and . Write . For the local index is the index of a proper subgroup of . By Lemmas 4.1 and 4.2, either or for a prime dividing , and such a is less than . So every vector with lies in
The vectors , , are distinct, and their total weight is . For each , the intersection of and contains , since is upward closed. Counting first and then the portions of the other sets outside it, and using (2), gives
By Lemma 3.2, which applies Sun’s bound in , the right side is at most . As , the assertion follows. □
Lemma 5.2. For every prime ,
Proof. At 5 the expression is ; at 7 it is
For the other primes up to 31 the following upper bounds suffice. Each bound on is obtained by finding the least with for each and adding . For example, modulo 13 the orders of 2, 3, 5, 7, 11 are 12, 3, 4, 12, 12, so ; modulo 29 the two largest terms are and (the orders of 17 and 7 are 4 and 7), and the other terms are below in total, giving .
| upper bound for | upper bound for | |
| 11 | ||
| 13 | ||
| 17 | ||
| 19 | ||
| 23 | ||
| 29 | ||
| 31 |
Table 1.
Let be prime, with . Since and , we have . Moreover : order 1 would give , and order 2 would give , hence , which is even and at least 4. So
For , monotonicity of and (6) bound the expression in the lemma by
by summing the rational terms. No prime lies strictly between 251 and 256.
The range . We first bound . Every prime greater than 7 is of the form or with . Put . All primes occur among these pairs for . Including both entries of every pair, even when an entry is composite or at least , only increases the product, since each factor is greater than 1. Hence
For the pair factor satisfies
To verify this inequality, write the right side minus the left side over the positive denominator . Its numerator is
Writing , expansion gives
The resulting product telescopes, because :
Since , we obtain
Next let be the integer with . As , we have . In (6), bound each of the at most terms with by , and the remaining terms by . Extending the latter sum to all integers greater than gives
For ,
Consequently, for ,
Letting and using yields
Also , so
Since , we have . Thus (8) gives
Finally, for , and hence
Taking cube roots proves the required bound for .
All the finite inequalities in this proof are also checked by exact rational arithmetic in the formalization. For the row , the orders for are . Remark 6.4 shows that the failure at cannot be removed merely by sharpening the uniform weight bound for the same divisibility shells.
The Python script solvable_paper_numerics.py, provided as an ancillary file with the arXiv version of this paper, checks the small-prime values, every bound in the table, the interval estimate (7), and the polynomial and telescoping identities in the argument for , using exact arithmetic. It requires only the Python standard library and can be run with
python solvable_paper_numerics.py
The prime 7
The generic count of Proposition 5.1 uses only the divisibility of local indices. At it fails: is one of the relevant cyclotomic divisors, the shifted set has weight , and by Lemma 5.2 the right side of (5) is about 1.1. We therefore use two kinds of information that the generic count ignores. The first is which minimal heads (defined below) have no part of local index exactly 7 or exactly 8; these give the missing points. The second is which parts meet the same -coset as a part of local index 7 or 8 (Lemma 6.1). Together these yield incompatible lower and upper bounds involving the weights of the missing points.
In this section , the partition, , , and are as in Proposition 5.1 with , and . In particular,
We write
Since and , Lemma 4.2 shows that the local index of every non-universal part is divisible by at least one of , , , .
After Lemma 6.1, which needs only the notation introduced so far, we introduce the minimal heads , the sets and , the missing points and , and the sets and ; these are used throughout the rest of the section.
Lemma 6.1. Let two distinct parts meet the same -coset. Then their local indices are not coprime. If one of them has local index 7, the other has local index divisible by 7. If one of them has local index 8, the other has local index divisible by 7 or by 8.
Proof. Both parts are non-universal, since a universal part contains every -coset it meets. If meets in a point , then . So two parts meeting give disjoint pieces and . Translating by , we obtain disjoint cosets and in , where , , and because and lie in the same left coset . The indices are the local indices . By Lemma 2.1, and are not coprime. This proves the first assertion, and the second follows because 7 is prime.
For the third, suppose . If there is nothing to prove. Otherwise contains a Sylow 7-subgroup of . The action of on the eight cosets of is nontrivial. Indeed, if lay in the core of , that normal subgroup of would have index prime to 7, so it would be by Lemma 4.1, contrary to . A nontrivial 7-group action on eight points has one orbit of size 7 and one fixed point . Since , the -orbit of and its complement are -invariant, so the complement has size 0 or 7. In the first case is transitive on , so . Then , since , contrary to the two disjoint pieces. In the second case fixes and is contained in its stabilizer, a conjugate of . Thus . □
We call the head of part . Let be the set of minimal elements of , so that is a finite antichain and . We call the elements of the minimal heads. Let consist of those for which some part has head and local index exactly 7, and let consist of those for which some part has head and local index exactly 8. Set
We call the elements of the missing points. A missing point may still be the vector of some other part if it lies in both and . To handle this we use the overlap set
and we put
Inclusion–exclusion and (2) give
Lemma 6.2 (Missing points in the overlap). With the notation above:
(1)
(2)
(3) if and or , then lies in neither nor .
Proof. We use repeatedly that for and , implies : some has , and because is an antichain. In particular, for neither nor lies in , since or with would give .
(1) For each and , consider . Each lies in , because , and in , because and is upward closed. None lies in : an equality with gives . Hence , and their weights add to .
These triples are disjoint. If then , so are comparable; the antichain property gives and then . They also avoid . The point lies in . For suppose with , so . Since , some satisfies , contradicting the antichain property. The disjoint triples and all lie in , which proves (1).
(2) A point of lies in , and by the first paragraph it does not lie in .
(3) Put and , so that . Suppose first that , so that for some . If , then , hence . Thus and , so part has head and local index , contrary to . If , then , so . It also lies in , and by the first paragraph it does not lie in . Hence , again a contradiction.
Now suppose that , so that for some . If , then , hence . Thus and , so part has head and local index , contrary to . If , then , so . It also lies in , and by the first paragraph it does not lie in . Hence , a contradiction. □
Proposition 6.3. Let be a finite solvable group with a partition (1) whose indices are distinct, suppose that is the largest prime divisor of , and let be the subgroup generated by the -elements of . Then every part is universal relative to .
Proof. Suppose, for a contradiction, that . Then . Put
By (4), .
Step 1: a lower bound for the missing points. Let be the union of the images of the parts with local index exactly and head in , and define likewise using local index and . Put and . Membership of a head in or asserts the existence of a part of local index or with that head; we select only parts with the specified local index. By Lemma 3.2, and . Parts of local index or whose heads are not minimal are not needed here. Since and by (2),
With the same argument for gives
The sets and are disjoint: an -coset in both would be met by parts of local indices and , contrary to Lemma 6.1. Let be the set of parts meeting the inverse image of in , and let . These parts are non-universal, because each such -coset is met by a non-universal part. Their union contains the inverse image of . For the quotient map , this inverse image has proportion
As the are distinct,
By Lemma 6.1, the local index of each part in is divisible by 7 or 8. Hence , and Lemma 6.2(3) shows that does not meet . Therefore, using (10),
Adding the two inequalities (11) and using (12),
Since , this gives , that is,
Step 2: an upper bound for the missing points. Divide the non-universal parts by local divisibility: , , and let and be the corresponding sets of vectors . They are disjoint because the are distinct, and . We have , and by Lemma 6.2(3) the set meets neither nor . These two sets lie in and are disjoint by Lemma 6.2(2). Hence . For , the local index is divisible by or , so and . Adding and using (10),
Since by Lemma 3.2 and , this gives
The coefficient in (13) comes from and . A point of may also lie in , so below it contributes up to times its weight, which is exactly the factor in Lemma 6.2(1).
Step 3: conclusion. Put and . Then . By Lemma 6.2(2), , so splitting into its parts outside , in , and in gives . By Lemma 6.2(1),
Combining this with (13) and (14) gives
which is false: the left side exceeds the right side by . □
Remark 6.4. The shortfall is not an artifact of the union bound in the proof of Proposition 5.1. Let , list the shifts as , and let be nonempty and upward closed. Put . Since is upward closed, , so . Iterating, and using ,
For the four shifts lie on distinct coordinates, so is a product and equality holds. Thus is the best uniform constant, and still .
Proof of the main theorem
Proof of Theorem 1.2. By Lemma 2.2 it suffices to treat finite groups. Suppose that is a finite solvable group of least order that is not HS, and fix a partition with distinct indices. By Lemma 2.3, the largest prime divisor of is at least 5. Let be the subgroup generated by the -elements of . By Lemma 4.1, it is a nontrivial normal subgroup. If every part is universal relative to , the partition descends to a partition of the smaller solvable group with the same indices, contradicting minimality. Otherwise Proposition 5.1 and Lemma 5.2 exclude , and Proposition 6.3 excludes . □
Remark 7.1. Solvability is used in two places: in Theorem 2.4, applied to the quotient , and in Lemma 4.2, where a minimal normal subgroup of the primitive quotient is elementary abelian, so that the degree is a prime power. Lemma 4.1 holds for every finite group. The counting in Sections 5 and 6 uses only the conclusions of these results. Sun’s theorem also holds without solvability for cosets of subnormal subgroups [18 Theorem 3.1], but the images need not be subnormal, and for nonsolvable groups primitive degrees need not be prime powers, so Lemma 4.2 would also need replacement.
Remark 7.2. The only direct uses of minimality of are to exclude index 2 and to descend to . In the setting of the proof minimality gives more when . The parts meeting a non-universal -coset number at least two, and after translation by an element of their pieces form a partition of into left cosets. As is a smaller solvable group, it is HS, so there exist two distinct parts meeting with equal local index. We do not use this, because the proof cannot assume , including when . For example, in the subgroup generated by the 7-elements is the whole group when acts nontrivially and irreducibly on . This semidirect product is unique up to isomorphism, since has a unique conjugacy class of cyclic subgroups of order 7. This group is HS, so it is not a counterexample, but largest prime 7 and solvability do not by themselves force .
Formal proof
The accompanying Lean development [14] proves Theorem 1.2 as
Erdos274.herzog_schonheim.variants.solvable.
The proof revision is d701decf37c2. It is pinned to Lean v4.35.0-rc2 and the mathlib tag v4.35.0-rc2, a release candidate, by the files lean-toolchain and lakefile.toml. The repository consists of exactly the import closure of the main theorem. From its root, build it with
lake exe cache get
lake build
In a Lean file importing the module Erdos274.KnownCases.Solvable, the command
#print axioms Erdos274.herzog_schonheim.variants.solvable
reports precisely
[propExt, Classical.choice, Quot.sound]
Thus the elaborated theorem has no further axiomatic dependencies, including sorryAx. This check concerns the formal theorem; the interpretation of its hypotheses and its correspondence with the paper remain mathematical questions. In mathematical notation, the formal theorem reads as follows. Let be a solvable group with more than one element, and let be a finite type with at least two elements. Let be subgroups and elements of such that the left cosets are nonempty, pairwise disjoint, and have union . Then for some . No finiteness hypothesis is placed on , and the cosets are left cosets, as in (1). The index is mathlib’s Subgroup.index, which is 0 for a subgroup of infinite index; in a finite partition every index is finite (Lemma 2.2). The hypothesis follows from the others and is kept to match the upstream statement. The exact covering structure is copied field for field from the Erdős problem 274 file of the Formal Conjectures repository [7, 8], and the file Challenge.lean of the repository states the theorem using only mathlib and that structure, so the formal statement can be audited without reading the proof.
The formalization follows Sections 3–6. Its treatment of the inputs from Section 2 differs in form only. Lean proves Sun’s bound itself, in a more general form for orbits, and states it as , where is the set of divisors of the orders . Counting elements of a cyclic group of order by their orders shows that the left side equals the left side of Theorem 2.4. Lemma 2.5 is proved there by decomposing into fibres over the divisors of a common multiple, rather than by inclusion–exclusion. Likewise, to see that every part of a partition of a possibly infinite group has finite index, Lean uses mathlib’s version of B. H. Neumann’s lemma [15 Lemma 4.1], in place of [12 Theorem 1].
Acknowledgments
The author thanks Leo Margolis for a careful reading of an earlier version, many helpful comments, and his encouragement.
Under the author’s direction, OpenAI GPT-5.6 Sol contributed the comparison of reciprocal sums with unions of quotient cosets (Section 3), the cyclotomic divisibility argument, and the argument for the prime 7, including the overlap set and Lemma 6.2. Anthropic Claude Opus 5 developed and formalized the early solvable track and the enlargement to all non-universal parts. Claude Opus 5.5 audited and formalized the final argument and completed the theorem for arbitrary solvable groups; its simplifications include localizing at the subgroup generated by the -elements, the fixed-point proofs of the local divisibility restrictions, including the maximal-subgroup proof of Lemma 4.2, the bound , and the elementary estimates in Section 5. OpenAI GPT-5.6 Sol, reviewing the paper, proposed the present form of the large-prime estimate in the proof of Lemma 5.2. Claude Fable 5 contributed earlier known-case formalizations and conditional reductions. Reviews by DeepSeek (version not recorded) and Z.ai GLM 5.2 clarified the earlier cyclotomic argument. OpenAI GPT-6 in Codex agreed with the exposition and attribution audit. The commit history of the repository [14] records the AI contributions to the formalization through its Co-Authored-By trailers.
The author thanks the Lean and mathlib communities for the libraries supporting the formal proof. The author is responsible for the mathematical claims, their attribution, and the correspondence between the paper and the formal statements.
References
References
- [1]F. Akman and P. Sissokho, Transversal coset partitions of groups, Beitr. Algebra Geom. 66 (2025), 417–441, doi:10.1007/s13366-024-00748-9.DOI
- [2]F. Akman and P. Sissokho, Steiner coset partitions of groups, Canad. Math. Bull. 68 (2025), 1359–1373, doi:10.4153/S0008439525100787.DOI
- [3]F. Akman and P. Sissokho, Steiner coset partitions for five mutually commuting subgroups, Acta Math. Hungar. (2026), published online, doi:10.1007/s10474-026-01635-6.DOI
- [4]M. A. Berger, A. Felzenbaum, and A. S. Fraenkel, The Herzog–Schönheim conjecture for finite nilpotent groups, Canad. Math. Bull. 29 (1986), no. 3, 329–333.DOI
- [5]M. A. Berger, A. Felzenbaum, and A. S. Fraenkel, Remark on the multiplicity of a partition of a group into cosets, Fund. Math. 128 (1987), 139–144.
- [6]M. C. Burkhart, The Herzog–Schönheim conjecture for solvable groups, arXiv:1901.10131 (2019), withdrawn in version 2, March 1, 2019.arxiv.org/abs/1901.10131
- [7]The Formal Conjectures Authors, The Formal Conjectures Repository, 2025, https://github.com/google-deepmind/formal-conjectures.
- [8]M. Firsching, P. Lezeau, S. Mercuri, M. Z. Horváth, Y. Dillies, C. Sönne, E. Wieser, F. Zhang, T. Hubert, B. Agüera y Arcas, and P. Kohli, Formal Conjectures: An open and evolving benchmark for verified discovery in mathematics, 2026, arXiv:2605.13171v1.arxiv.org/abs/2605.13171
- [9]M. Garonzi and L. Margolis, The Herzog–Schönheim conjecture for simple and symmetric groups, Algebra & Number Theory, to appear; arXiv:2509.25118v2.arxiv.org/abs/2509.25118
- [10]Y. Ginosar and O. Schnabel, Prime factorization conditions providing multiplicities in coset partitions of groups, J. Comb. Number Theory 3 (2011), no. 2, 75–86.
- [11]M. Herzog and J. Schönheim, Research problem no. 9, Canad. Math. Bull. 17 (1974), 150.
- [12]I. Korec and Š. Znám, On disjoint covering of groups by their cosets, Math. Slovaca 27 (1977), no. 1, 3–7.
- [13]L. Margolis and O. Schnabel, The Herzog–Schönheim conjecture for small groups and harmonic subgroups, Beitr. Algebra Geom. 60 (2019), no. 3, 399–418; arXiv:1803.03569.arxiv.org/abs/1803.03569
- [14]M. Menon, The Herzog–Schönheim conjecture for solvable groups in Lean 4, source repository, https://github.com/Jostamon/erdos274-hs-solvable, commit d701decf37c225a3e5326fade4bd92121b1f93d4 (October 2, 2026).
- [15]B. H. Neumann, Groups covered by permutable subsets, J. London Math. Soc. 29 (1954), 236–248, doi:10.1112/jlms/s1-29.2.236.DOI
- [16]D. J. S. Robinson, A Course in the Theory of Groups, second ed., Graduate Texts in Mathematics, vol. 80, Springer, New York, 1996.
- [17]Z.-W. Sun, Finite covers of groups by cosets or subgroups, Internat. J. Math. 17 (2006), no. 9, 1047–1064, arXiv:math/0501451.DOI
- [18]Z.-W. Sun, On the Herzog–Schönheim conjecture for uniform covers of groups, J. Algebra 273 (2004), 153–175, arXiv:math/0306099.DOI