Transversal Difference Numbers in Finite Abelian Quotients
Abstract.
Given finite abelian groups, a transversal for has fixed size , but its ambient difference support can vary with the embedding of in . We call the transversal difference number of the pair . This invariant is related to finite abelian factorisation, tiling complements, and small-sumset questions, and is motivated by recent work regarding ambient Galois labels in CRT transforms for cyclotomic-subfield homomorphic encryption. We prove various results regarding this invariant, including a general lower bound where is the largest order of a subgroup of disjoint from . The bound is sharp for cyclic quotients, and Kneser’s theorem gives a cross-transversal estimate leading to exact product families with one nonsplit cyclic coordinate and arbitrary split factors. These results isolate the first genuinely new residual obstruction, namely the same-prime square plane
For odd , this case is the technical core of the paper. Here transversals are graphs of functions , and decomposes into carry-corrected finite-field derivative images. We conjecture that
for all odd primes , prove the unconditional lower bound , and give small-prime, probabilistic, and fixed-polynomial evidence for the conjecture.
1. Introduction
A quotient group remembers the cosets of , but it forgets how a choice of coset representatives sits inside the ambient group. This ambient information can vary substantially from one section to another. Throughout, all groups are finite abelian and written additively. Given , a transversal for has cardinality . However, its difference support can varry substantially in size and a natural question is how small this set can be. We call
the transversal difference number of the pair , where ranges over all transversals for .
This invariant depends on the embedding , not only on the abstract quotient. For instance, and , although both quotients are isomorphic to . When trying to find , transversals can easily be found, but proving that their pairwise differences are as small as possible in the ambient group can be challenging.
After translating we may assume ; then is a set-theoretic tiling complement to , so every element of is written uniquely as with and . Thus is a support minimisation problem for finite abelian factorisations , where denotes unique representation rather than an internal direct product. This places it near the classical theory of unique-representation factorisations and algebraic tilings [HAJ42, RÉD65, STE74, DIN06, SS09]. The lower-bound methods are closest to small-sumset, critical-pair, and Kneser-type stabiliser arguments [KNE54, KEM60, FRE73, TV06, GRY13, GR07]. It is not a difference-set or a relative difference-set problem, where multiplicity conditions rather than support minimisation are central [SIN38, BUT63, PSZ14], nor a difference-basis problem, where the set itself may vary in size while its differences cover the ambient group [BG19]. Here has fixed size and must be a transversal; only the number of distinct ambient differences is minimised.
Our motivation comes from the Galois-theoretic bookkeeping that appears in Peikert and Pepin’s Vive Galois! programme [PP26]. In exact fully homomorphic encryption one often wants many plaintext “slots” over a prescribed finite field or finite ring, so that one ciphertext carries a vector of plaintexts and homomorphic operations act componentwise on that vector. This is the SIMD idea of Smart and Vercauteren [SV14]. Cyclotomic rings provide fast arithmetic, many automorphisms, and good geometric properties, but their slot structure is arithmetically rigid: the residue degree of the chosen plaintext prime determines the slot type, and an unwanted extension degree gives fewer slots of a larger field than the application naturally wants. The point of the Peikert–Pepin construction is that cyclotomic subfields, and more generally abelian number rings, give a more flexible Galois-theoretic way to obtain the desired slot type and number of slots, while still supporting CRT bases, structured transforms, and packed bootstrapping.
A finite choice of representatives enters this construction quite explicitly. In a tower of abelian extensions , write
Peikert and Pepin choose a transversal for the quotient in order to index a CRT basis and the corresponding top-down sparse CRT transform [PP26]*Def. 5.8. Their Lemma 5.13 [PP26]*Lemma 5.13 shows that, in the relevant automorphism expansion, a coefficient can be nonzero only for an ambient automorphism of the form
Thus the possible ambient automorphism labels are contained in . In the additive notation of this paper, the same support is . Consequently, the purely finite-abelian problem of minimising over quotient transversals is exactly the problem of minimising the representative-dependent ambient label support forced by this part of the Galois/CRT bookkeeping.
This is the precise sense in which a small value of can be useful for the FHE framework. In Peikert–Pepin’s homomorphic CRT transforms [PP26]*Secs. 3.2 and 4, structured linear maps are evaluated by applying automorphisms and taking linear combinations. Each distinct ambient automorphism label that is actually used is a potential automorphism operation, and in an FHE implementation such an operation typically comes with key-switching data and key-switching cost. The first and third phases of packed bootstrapping are precisely CRT transforms: they move noisy decryption coefficients into the SIMD slots, allow the slotwise nonlinear decoding step, and then move the result back. Hence, for an implementation model in which each distinct ambient automorphism label carries cost, a transversal with smaller may reduce the candidate automorphism/key-switch label set and simplify the linear part of packed bootstrapping.
A word of caution about this motivation is worth mentioning. The quantity measures just the size of the support of ambient automorphism labels forced by a choice of representatives, and therefore it should not be mistaken for a statement about runtime, memory, key-switching cost, parameter selection, or security. Several effects sit between this invariant and any real implementation. The label set records which automorphisms can occur, but some of the corresponding coefficients may vanish for reasons the transversal cannot see; the cost of applying an automorphism depends on the particular FHE platform; and the Ring-LWE hardness assumptions used in this line of work are unaffected by how small is. Once these caveats are set aside, what remains is a clean, finite, and entirely algebraic question, and that is the one we pursue: how small can the difference support of a section of a finite abelian quotient be, what is its value across broad families, and where does the naive split-or-cyclic intuition fail?
Main results. The first part of the paper develops the theory in the finite abelian setting. Here the trivial lower bound is attained exactly when has a subgroup complement. To go further, we isolate the singleton quotient directions of a transversal: their canonical lifts form a subgroup of disjoint from , and quotienting by it makes the transversal primitive, leaving no nonzero singleton fibres. This reduction yields the uniform lower bound , where is the largest order of a subgroup of disjoint from . For cyclic quotients the bound is sharp, and feeding Kneser’s theorem (Theorem 2.2) into a cross-transversal estimate pins down exact product families with one nonsplit cyclic coordinate and arbitrary split factors. This cyclic sharpness sits within the prime-cyclic critical-pair tradition initiated by Vosper [VOS56], and more broadly within Kemperman’s analysis of small sumsets in abelian groups [KEM60]. The precise statements are given in Sections 3 and 4, and there results therein should be viewed as both a general theory and as delimitation results: they identify the regimes in the ideas described above already determine the invariant. The main new difficulty begins when these mechanisms no longer control the support, namely in same-prime residual quotients with more than one nonsplit direction.
Section 5 marks this transition. A residual quotient that contains a plane already forces a strict gap from the trivial lower-bound.
For odd primes, however, the parity argument disappears, and the first case left open by all the preceding exact results is
This odd square-plane problem, treated from Section 6 onward, is the technical core of the paper. Here transversals become graphs of functions , and the fibres of turn into carry-corrected finite-field derivative images. Read in these terms, the square-plane problem sits close to finite-field sum-product [BKT04] and image-expansion [MP17] questions, while the fixed-polynomial evidence gathered in Section 7 lies nearest to value-set questions for polynomial maps [MWW13]. We conjecture that and prove the unconditional bound . We also prove that random liftings meet the lower bound with probability tending to one, and that no fixed integer-polynomial lifting can produce counterexamples once the prime is large enough. The final section gathers the primitive-quotient and square-modulus open problems that emerge along the way.
2. Preliminaries and notation
Throughout the paper all groups are finite abelian and are written additively. For subsets we write , , and . If is a subgroup, then denotes the union of the -cosets meeting .
Let . The quotient map will be denoted
When no confusion is possible we put
A transversal for is a subset such that is bijective. Equivalently, contains exactly one element from each coset of in .
For a transversal we define its difference support
The invariant studied in this paper is the transversal difference number of the pair :
| (2.1) |
where ranges over all transversals for . Translating a transversal by an element of does not change its difference support. Hence, whenever convenient, we shall assume that is normalized, meaning that .
A normalized transversal is the same thing as a set-theoretic complement to : every element has a unique expression , with , and . This is a unique-representation factorisation of the set ; it does not mean that is a subgroup unless this is explicitly stated. We use the terminology of set factorisations and complements in the standard sense of [SS09]; see also [HAJ42, RÉD65, STE74] for the classical factorisation and tiling background.
It will be useful to identify a transversal with its section of the quotient map. Thus, for a normalized transversal , we write
| (2.2) |
for the unique section such that , , and . For a quotient direction we define the corresponding difference fibre
| (2.3) |
The fibres are nonempty and decompose the difference support into the following disjoint union Note that in particular . We call a singleton direction for if . The set of singleton directions will be denoted
| (2.4) |
If , the unique element of will sometimes be written ; equivalently, for all . Therefore, .
We write
for the corresponding lifted singleton set. Thus is a subset of the quotient , while is a subset of the ambient group .
Definition 2.1.
A normalized transversal for is called primitive if . Equivalently, no nonzero quotient direction has a singleton difference fibre.
The following subgroup invariant will also appear in our work:
| (2.5) |
Note that and the case in which the pair , satisfies will be called residual. A subgroup is a subgroup complement to if and . In particular, has a subgroup complement in if and only if .
For later use we recall Kneser’s theorem (see [KNE54] or [TV06]*Theorem 5.5) in the finite form needed below. If , its stabilizer is
Theorem 2.2 (Kneser).
Let be nonempty subsets of a finite abelian group , and write . Then
3. First bounds, singleton reduction and cyclic quotients
The first estimates come from decomposing the difference support over quotient directions. We notice that singleton fibres lift to a subgroup of disjoint from and quotienting by this subgroup makes the transversal primitive, gives the uniform lower bound in terms of , and leads to an exact formula for cyclic quotients.
The first proposition below is the support-minimisation analogue of the basic exact-factorisation question: when does a set-theoretic complement become a subgroup complement? Classical factorisation results of Hajós [HAJ42] and Rédei [RÉD65] are related to this phenomenon.
Proposition 3.1.
Let . Then if and only if has a subgroup complement in .
Proof.
Let . For every transversal and every fixed , the translate has elements and is contained in . Hence for every , so .
If is a subgroup complement to , then is a transversal for and . Thus , and equality follows.
Conversely, suppose , and choose a transversal with . Translating if necessary, assume . Then because for every . Since the two sets have the same cardinality, . Therefore is closed under subtraction. As is finite and contains , it is a subgroup of . Since is also a transversal for , it is a subgroup complement to . ∎
3.1. Singleton directions and primitive quotient transversals
We use the notation , , and from Section 2. The next proposition explains the quotient reduction behind primitive transversals.
Proposition 3.2.
Let , and let be a normalized transversal for . Then:
-
(1)
is a subgroup of ;
-
(2)
the map
is an injective group homomorphism, its image is a subgroup of , and
-
(3)
one has
so is a union of cosets modulo ;
-
(4)
if
and denotes the image of in , then is a transversal for and
-
(5)
the transversal has no nonzero singleton directions.
Proof.
Put and write for the normalized section attached to . The zero direction is singleton, since . Let . Then, for every ,
Hence
Thus is a singleton direction and
Since is finite, closure under addition and the presence of imply that is a subgroup. The displayed identity also shows that is a group homomorphism. This proves (1) and the homomorphism assertion in (2).
For we have
because for every . Hence the homomorphism is injective, and its image is a subgroup of with . If , then , hence . Therefore
This proves (2).
If , then
for every . As varies over , so does , and therefore translation by permutes the elements of . Thus
Subtracting gives
so is a union of cosets modulo .
Let be the quotient map. We prove (4). The image plainly meets every -coset. For uniqueness, suppose that and lie in the same -coset. Then
Write , with and . Since , the element belongs to . But
Since is a transversal for , this forces , hence . Thus is a transversal.
Moreover,
Since is a union of -cosets, each element of has exactly preimages in . Hence
It remains to show that is primitive. Under the natural identification
suppose that a nonzero class has singleton fibre for , and choose a representative . Then, for some ,
Indeed, the quotient fibre in direction is the image of the fibres , ; if that image is a singleton, then each such fibre lies in one -coset. For every , the fibre in direction satisfies
Thus the union of the fibres above lies in the single coset , whose size is . The fibres in this union are nonempty and disjoint because they lie over distinct quotient directions. Hence each is a singleton. In particular , so , a contradiction. Thus has no nonzero singleton directions. ∎
Every transversal becomes primitive after quotienting by its lifted singleton subgroup. This is the structural reason for the lower bound below.
Proposition 3.3.
For every one has
More precisely, for every normalized transversal one has
Proof.
Let be a normalized transversal for . Put , , and . By the fibre decomposition,
because the singleton fibres have size and all other fibres are nonempty of size at least . This proves the more precise bound. By Proposition 3.2, the lifted singleton subgroup is disjoint from , so . Thus
Taking the minimum over all transversals proves the proposition. ∎
Remark 3.4.
Looking at the proof above, if is a normalized transversal, it is easy to see that the equality
holds if and only if
and every non-singleton quotient-direction fibre has size exactly .
3.2. Cyclic quotients
The bound of Proposition 3.3 is sharp for all cyclic quotients.
Theorem 3.5.
Let , and suppose that is cyclic of order . Then
Proof.
The lower bound is Proposition 3.3. We first handle the residual case . Choose whose image generates . If , there is nothing to prove. For , the integer divides . The equality would make a nontrivial subgroup disjoint from , contradicting residuality. Hence
Now observe that is a transversal for , and . These elements are distinct because any two exponents in the displayed range differ by an integer of absolute value at most , which is strictly smaller than . Thus in the residual cyclic case.
For the general case, let be a subgroup disjoint from with , and write . Since is cyclic, the image of in is the unique subgroup of order . Hence
is cyclic of order .
The pair is residual. Indeed, if were nontrivial and disjoint from , then . In particular, , because . But then would be a subgroup of disjoint from and strictly larger than , contradicting the maximality of .
By the residual case just proved, there is a transversal for
such that
Choose representatives for , and define
Since represents the quotient and maps isomorphically onto its image in , the set is a transversal for . Moreover,
Modulo , this support is exactly , so it is a union of distinct -cosets. Therefore
Together with the lower bound, this proves the formula. ∎
For a cyclic ambient group with a prescribed subgroup, the formula becomes completely explicit. In what follows, we write for the cyclic subgroup of order , for any .
Corollary 3.6.
Let , let , and let be the subgroup of order . If is the largest divisor of that is coprime to , then
Proof.
In a cyclic group there is a unique subgroup of each order. A subgroup of order intersects trivially if and only if . Since such a subgroup must inject into , its order must also divide . Therefore is exactly the largest divisor of that is coprime to . The claim follows from Theorem 3.5. ∎
Example 3.7 (Mixed-prime square-modulus products).
Let be distinct primes, let , and put
Then
Indeed, the Chinese remainder theorem identifies with Here and . In Corollary 3.6, with , the largest divisor of coprime to is . Hence . Thus square-modulus products with distinct prime factors behave cyclically. The first obstruction not covered by the cyclic analysis is therefore not a product over distinct primes, but a same-prime -primary quotient of rank at least two. This is the source of the square-plane problem studied later in the manuscript.
4. Chains, products, and cross-transversal estimates
The aim of this section is to study the behaviour of the invariant with respect to subgroup chains and direct products. The technique we use for this study involves slicing a transversal over an intermediate quotient. Kneser’s theorem then upgrades the elementary nonzero-fibre count and gives exact product families with one nonsplit cyclic coordinate and arbitrary split factors. The resulting estimates are cross-transversal bounds based on Kneser’s theorem, and should be read against the structural additive theory of small sumsets in finite abelian groups [KEM60, TV06, GRY13].
We start with some elementary chain bounds: a multiplicative construction and two lower bounds coming from the zero and nonzero quotient fibres.
Proposition 4.1.
Let , and write
Then
Proof.
Choose a transversal for with , and choose a transversal for with . Then
is a transversal for . Moreover
Thus
For the first lower bound, let be a transversal for , and write for its slice over . Choose one element of each nonempty slice; these elements form a transversal for , so . Each translated slice is a transversal for , so the zero -fibre of contains at least elements. Since meets that zero fibre only in ,
For the second lower bound, one translated slice gives at least elements in the zero fibre. In every nonzero -direction, the cross-difference between two corresponding slices maps onto all of : the two slices each meet every -coset inside their -coset. Hence that fibre has at least elements, and
Taking the minimum over all proves the proposition. ∎
The proof above isolates the point where information is lost: in each nonzero -direction it uses only that a cross-difference of two slices surjects onto . Kneser’s theorem gives a uniform replacement for this crude fibre count.
Theorem 4.2.
Let , put , and let be transversals for . Then
Proof.
Let , and let be the quotient map. Denote by , and by . The exact sequence
gives . By Kneser’s theorem, applied to ,
Since contains one element in each -coset, the set contains, in each -coset, at least one coset of . Hence
The same argument gives and therefore .
If , then , so is a subgroup of disjoint from . Thus
and hence
If , then , and so
Since , this implies
and the theorem follows. ∎
Applying the theorem to pairs of slices in the chain replaces the elementary contribution in every nonzero -fibre by .
Corollary 4.3.
Let , and put
Then
Proof.
The bound is Proposition 4.1. Let be a transversal for and slice it above the cosets of . The zero -fibre contains the difference set of one translated slice and contributes at least elements.
For a nonzero direction in , the corresponding fibre contains a translated cross-difference between two slices. After translation into , these are transversals for , so Theorem 4.2 gives at least
elements. Summing over the nonzero directions in gives
Taking the minimum over proves the claim. ∎
Remark 4.4.
Passing to quotients contained in can only identify differences. If , then
Indeed, the image of a transversal for under the quotient map is a transversal for , and quotienting can only identify differences.
Proposition 3.2 gives a more precise form of quotienting for the particular subgroup attached to a transversal : in that case the image transversal is primitive and the difference support satisfies the exact multiplicative identity
Applying the chain estimates to the two natural coordinate chains gives the following elementary product bounds. Let , put
Then
| (4.1) |
The product of optimal transversals gives the upper bound: if is a transversal for with , then is a transversal for
and
Thus the difference support has size .
For the lower bounds, apply Proposition 4.1 to the chain
and then to the symmetric chain
The identities
follow from projection and the fixed-coordinate construction. Substituting them in the two chains gives the displayed estimates.
The same sharpening applies to products through the two coordinate chains. With , Corollary 4.3 gives
Remark 4.5.
Since , the Kneser-sharpened product terms dominate the corresponding elementary product terms above. The improvement is strict in the term where the factor providing is nonsplit, meaning , and the other quotient is nontrivial.
The Cartesian-product construction need not be optimal.
Example 4.6 (Products need not be multiplicative).
The cyclic formula gives
However
By Corollary 3.6,
Thus the optimal value for the product pair is , not .
The cross-transversal estimate is exact after adjoining a split factor, provided the base pair already attains the lower bound.
Corollary 4.7.
Let , let be a finite abelian group, for which we write , and . Then
If , the inequality above holds with equality.
Proof.
Let be a transversal for
For each , define
Because quotient cosets are indexed by , each is a transversal for .
For each , the -coordinate fibre of contains
By Theorem 4.2,
These fibres are disjoint for different , so
Taking the minimum over proves the lower bound.
For the upper bound under the displayed hypothesis, choose a transversal for with
Then is a transversal for , and
Thus
which proves equality. ∎
Together with the cyclic quotient formula, this gives the main exact product family of the section.
Corollary 4.8.
Let be prime, let , and let be a finite abelian group. Then
Proof.
Remark 4.9.
Corollary 4.8 is not a product multiplicativity statement: the added factor is split, with subgroup . It does not cover a second nonsplit -primary coordinate, which is why is the first genuinely new same-prime case.
5. Noncyclic residual obstructions
The cyclic quotient formula shows that the fibre lower bound is sharp for every cyclic quotient. Noncyclic residual quotients behave differently: the first obstruction is already visible in a quotient plane of order four, and it separates the cyclic theory from the higher-rank phenomena studied later.
The two-torsion obstruction gives a strict improvement whenever the quotient contains a two-dimensional -torsion plane.
Theorem 5.1.
Let be residual, so that . Suppose that contains a subgroup isomorphic to . Then every transversal for satisfies
In particular, the residual fibre lower bound is not sharp for such a pair.
Proof.
Let , let , and normalize , with associated section . Since the pair is residual, Proposition 3.2 implies that no nonzero quotient direction can be singleton. Therefore
For directions of order two there is a stronger parity fact. If has order two, then , hence
No element of this fibre can be fixed by negation: if , then and , so is a nontrivial subgroup disjoint from . Thus every order-two direction has an even fibre of size at least .
Choose a subgroup
with . We claim that the three nonzero fibres over cannot all have size . Suppose, to the contrary, that they do. Put
Since each of the three fibres is stable under negation and has two elements, we have
for some signs . The first two identities give
If and , this gives . If and , it gives . If and , it gives . Finally, if , then ; using gives either or . In all cases, one of , , or has order two. Its image in is respectively , , or , hence nonzero. The subgroup it generates is therefore nontrivial and disjoint from , again contradicting residuality. Thus at least one of the three fibres over has size at least .
Counting quotient-direction fibres now gives
This proves the theorem. ∎
For square-modulus -groups this gives an exact value in rank two. The follwing corollary is immediate.
Corollary 5.2.
Let , let
Then
For , the equality is realized by the transversal .
The preceding obstruction is specific to quotient directions of order two. For odd primes there is no analogous negation parity argument. The same square-modulus construction is residual for every prime, and the coordinate box gives the basic upper bound.
Proposition 5.3.
Let be a prime and let
Then . Moreover the coordinate box gives
Proof.
Let . If has order , then . If has order , then is a nonzero element of . Hence every nontrivial subgroup of meets nontrivially, and therefore .
The coordinate box
is a transversal for . Its difference support is
which has size . This proves the upper bound. ∎
Thus, for odd , the pair
is the first same-prime residual case not covered by the cyclic formula, the two-torsion obstruction, or the one-nonsplit-coordinate product theorem. The rest of the paper rewrites its transversals as graphs and studies the resulting carry-corrected finite-field difference images.
6. The odd square-plane problem
We now specialize to the first unresolved same-prime residual case. Throughout this section is an odd prime,
By Proposition 5.3, the pair is residual and the coordinate box gives
We rewrite its transversals in finite-field terms and prove a uniform lower bound towards the box value. The resulting corrected-derivative images are finite-field image sets; these are adjacent to the sum-product/expander literature [BKT04, MP17] and, for graph/function language to relative difference sets and planar functions works such as [PSZ14].
6.1. Carry-corrected derivative images
We identify the quotient with . For , let denote the coordinatewise standard lift. Every normalized transversal for has a unique form
where satisfies . This normalization is harmless for difference supports: translating by an element of subtracts a constant from .
For , define the carry vector
Here the numerator is computed in using standard representatives; its coordinates are either or , so has coordinates or modulo . We then define the carry-corrected derivative
and its image
The finite-field parametrisation gives an exact fibre decomposition of the difference support.
Lemma 6.1.
For every one has
Moreover .
Proof.
The difference between the representative above and the representative above is
in . In the quotient fibre , the possible -parts are exactly . The quotient fibres are disjoint, so summing over all gives the formula. For one has and , hence . ∎
The coordinate box corresponds to , and its support has size . This motivates the central conjecture.
Conjecture 6.2.
For every odd prime ,
Equivalently, for every function ,
The general residual fibre lower bound gives only
Thus the conjecture asks for an additional
forced differences coming from the rank-two same-prime geometry.
6.2. Cycle and curl identities
The deterministic input is a pair of elementary identities using only that the corrected derivatives come from a global quotient section.
Lemma 6.3.
Let be an odd prime and let . For all one has the curl identity
Moreover, for every nonzero and every affine -line,
one has the cycle identity
Consequently:
-
(1)
for every ;
-
(2)
if , then is contained in an affine line parallel to .
Proof.
Expanding the definition of gives
and the analogous expression with and interchanged. The -terms are identical. The carry terms are also identical, since
This proves the curl identity.
For the cycle identity, sum in the successive differences from the representative above to the representative above :
These differences go once around the affine cycle, so their sum is zero in :
Dividing by modulo gives
in .
If for some , then the cycle identity gives , a contradiction. Hence for every nonzero .
Finally suppose . On a fixed affine -line, let be the number of points at which takes the value . Then the other points take the value , and the cycle identity gives
The cases and would make the left-hand side zero, so is nonzero modulo . Thus
Therefore lies in an affine line parallel to . ∎
6.3. A deterministic lower bound
Two independent quotient directions with minimal derivative images already force the conjectural box lower bound.
Lemma 6.4.
Let be an odd prime and let . Suppose there are two linearly independent directions such that
Then
Proof.
By Lemma 6.3, the two images and are respectively contained in affine lines parallel to and . Therefore
By the curl identity these two quantities are equal. Since and are independent, , so both quantities vanish. Hence is invariant in the -direction and is invariant in the -direction.
Assume now that , and choose representatives . Following first steps in the -direction and then steps in the -direction, define
The direct corrected derivative differs from by a constant depending only on and on our standard-lift carry convention, not on . This is just the telescoping of the -increments along the chosen path; the discrepancy between the path carry and the standard carry for is independent of the starting point. Hence contains a translate of the sum of the two images of and . Since is invariant in the -direction, depends only on the -coordinate of and its image lies in an affine line parallel to . Moreover differs from the direct derivative by a constant, so
Similarly, because is invariant in the -direction, depends only on the -coordinate, has image contained in an affine line parallel to , and
As the - and -coordinates of vary independently, the pair runs over . Since the two image directions are parallel to the independent lines and , addition is injective on their product. Therefore
for every mixed direction with .
There are nonzero multiples of , nonzero multiples of , and mixed directions. Using Lemma 6.1, we get
∎
This dichotomy gives an unconditional lower bound for every odd prime.
Theorem 6.5.
For every odd prime ,
Equivalently, every transversal for satisfies
Proof.
Normalize the transversal and write it as . Let
If contains two independent directions, then Lemma 6.4 gives the stronger bound
Since
for , the desired estimate follows in this case.
It remains to consider the case where contains no two independent directions. Then is contained in a single one-dimensional subspace of , so
By Lemma 6.3, every nonzero direction contributes at least , and every nonzero direction outside contributes at least . Together with , this gives
This proves the theorem. ∎
6.4. Small-prime square-plane certificates
We verified the conjecture for and by deterministic Python computations using the graph parametrisation and fibre decomposition above. For the search also uses the cycle and curl constraints from this section and the action of . Since is negation-invariant and is the only self-inverse element in an odd-order group, is odd. Thus it suffices to exclude the largest odd support below the box value: the computations rule out for and for . The coordinate boxes attain and , so
The Python scripts used and the results could be consulted on our online companion github.com/georgeturcasubb/transversals.
We could not complete a verification of the conjecture for due to the high computational complexity. However, in these case we conducted many unsuccessful searches for transversals that could give rise to counter-examples.
7. Asymptotic evidence for the square-plane conjecture
The exact values in Subsection 6.4 cover the first two odd primes. We add two asymptotic pieces of evidence: a uniformly random lifting satisfies the box lower bound with probability tending to one, and no fixed integer-polynomial rule produces counterexamples for all sufficiently large primes.
7.1. Random liftings
Call a nonzero direction mixed if . For a function , define
Thus records mixed directions whose corrected derivative image is too small for the box contribution.
Theorem 7.1.
Let be an odd prime. Choose uniformly at random, with the values independent and uniformly distributed. Then
In particular,
The same conclusion holds for uniformly random normalized liftings .
Proof.
Before normalization, uniform functions give the uniform model on transversals for ; subtracting only translates by an element of .
Fix . By Lemma 6.1,
The zero direction contributes , and Lemma 6.3 gives at least from every nonzero direction. There are nonzero axis directions and mixed directions; the mixed directions outside contribute at least , while those in still contribute at least . Hence
Thus is sufficient for the box lower bound, and failure forces .
We bound this last event. Fix a mixed direction and a set with . The translation partitions into disjoint -cycles. On one cycle, write and . The condition is
After choosing , there are at most choices for each edge increment; ignoring the closing condition only overcounts. Thus one cycle has probability at most
The cycles use disjoint values of , hence are independent. The probability that this fixed contains all values of is therefore at most . Hence there are at most subsets of of size at most . It follows that, for the fixed mixed ,
Finally, there are mixed directions. A union bound gives
Since failure of the box lower bound implies , this proves the estimate. Its logarithm is , which tends to . ∎
7.2. Fixed-polynomial liftings
The random theorem shows that counterexamples, if they exist, are rare among all functions. We next rule out another natural source: liftings defined by one fixed polynomial rule as the prime varies.
Let be fixed. For a prime , let be its reduction modulo , and set
The word fixed is essential: for a single prime , every function has polynomial representatives of degree less than in each variable, for instance by finite-field interpolation. The theorem excludes only one integer-polynomial rule independent of . This fixed-polynomial setting is close to value-set questions for polynomial maps over finite fields [MWW13] and to finite-field polynomial/rational image-expansion results [BT12].
Theorem 7.2.
For every fixed , there is an integer such that, for every prime ,
The proof uses a nonzero-Jacobian image bound, large-rectangle estimates, and a degenerate-Jacobian classification.
Lemma 7.3.
Fix . Let
be a polynomial map with and . If , then
where one may take .
Proof.
Let . Its zero set has at most points by the elementary polynomial zero bound over finite fields. For , the fibre is cut out by two plane curves of degrees at most . Discard any common fibre components contained in ; those points are already excluded below. Off the critical curve, the remaining fibre curves have no common component: otherwise their gradients would be dependent at a smooth point of that component, forcing to vanish generically there. Bezout’s theorem for plane curves [CLO25] then bounds every noncritical fibre by geometric, hence rational, points. Thus the points of outside map with fibres of size at most , and
∎
We also use three elementary estimates on large rectangles. Let be intervals of consecutive standard residues, each of size at least , and put .
-
(1)
A nonzero linear form has . This is immediate if one coefficient vanishes, and otherwise follows from Cauchy–Davenport [TV06].
-
(2)
If is nonconstant of degree at most , then for every .
-
(3)
If is nonconstant of degree at most , then every nonempty fibre has at most points by the elementary zero bound, so .
The second input handles the degenerate Jacobian case, using singular subspaces of matrices.
Lemma 7.4.
Let be an infinite field and let be a linear subspace such that every element of is singular. Then either all matrices in have a common nonzero kernel vector, or all their images lie in a common line in .
Proof.
If , both alternatives hold. Otherwise choose a nonzero rank-one matrix in and change source and target bases so that it is . For , the matrix is singular for every . Since is infinite,
vanishes as a polynomial in . Hence . Since is singular, also . Linearity forces either for all , or for all ; otherwise a linear combination would have both off-diagonal entries nonzero and would be nonsingular. These are exactly the common-kernel and common-image cases. ∎
This gives the needed classification for polynomial maps with singular Jacobian differences.
Lemma 7.5.
Let be a field of characteristic zero, and let be a polynomial map satisfying
Then there are and such that one of the following holds:
for a nonzero linear form and a one-variable polynomial map , or
for some nonzero and some polynomial .
Proof.
Fix and let be the linear span of
The determinant quadratic form vanishes on each generator and on each difference of two generators. Its polar form therefore vanishes on pairs of generators, so the determinant vanishes on all of . Lemma 7.4 gives a common kernel vector or a common image line.
Write with . If has a common kernel vector , the directional derivative of along is zero. After a linear change of coordinates, is independent of one coordinate and has the form . If has common image line , all derivatives of lie in . A linear form annihilating is constant on , so takes values in and . ∎
Proof of Theorem 7.2.
We first remove affine terms, which do not change the support size. Adding a constant translates by an element of . Adding a linear term applies the automorphism
where denotes reduction modulo ; its inverse is . Thus both operations preserve , and affine-linear liftings have the coordinate-box support . Let . If , we are done.
Assume first that and
is not the zero polynomial over . Expand in the -variables and choose a nonzero coefficient polynomial . After excluding finitely many primes depending only on , the reduction of is nonzero; hence, for all sufficiently large , all but directions have . For these directions, the finite difference
has degree at most and nonzero Jacobian determinant.
For each good , choose a carry cell : a rectangular cell of standard residue representatives on which is constant, with both side lengths at least , so . On , the map is a constant translate of . By Lemma 7.3, with ,
There are good directions, each contributing , so Lemma 6.1 gives
For all sufficiently large primes this exceeds , proving the generic case.
It remains to treat the case . Then
for all over , so Lemma 7.5 applies. Excluding the finitely many primes where the rational classification data have denominator problems, where the nonzero linear form or target vector vanishes after reduction, where the relevant leading forms vanish, or where the characteristic is too small for the degree bounds, we remove the affine part as above. One of two forms remains.
First suppose , with . If , the map is affine-linear, already handled. Otherwise, for all sufficiently large primes and every with , the difference has a nonconstant coordinate of degree . On a large carry cell, the linear-form and univariate image estimates above give
The such directions contribute , which exceeds for all sufficiently large .
Second suppose , with . If , the map is affine-linear, already handled. Otherwise, for all sufficiently large primes the highest homogeneous part remains nonconstant. The directions for which vanishes identically form a proper linear subspace, so all but at most directions give a nonconstant difference of degree at most . On a large carry cell, is a constant translate of , so multiplication by preserves cardinality and the bivariate image estimate gives
Again the total contribution is , which exceeds for all sufficiently large .
The generic and degenerate cases give an integer such that the claimed inequality holds for every prime . ∎
Remark 7.6.
These results do not settle Conjecture 6.2: they exclude random counterexamples with high probability and fixed algebraic rules for large , while the conjecture allows arbitrary -dependent liftings.
8. Open problems and outlook
The cyclic and one-nonsplit-coordinate cases are settled by the fibre lower bound, singleton reduction, and Kneser estimate. The remaining obstruction is the same-prime nonsplit rank-two case: the odd-prime box statement is still conjectural, and the fixed-prime certificates and asymptotic evidence have only the limited scope proved above. The fixed-polynomial evidence also resonates with the broader finite-field polynomial-method tradition, exemplified by Dvir’s finite-field Kakeya breakthrough [DVI09]; however, our result is not a Kakeya theorem and uses only the polynomial image constraints developed above.
8.1. Square-plane problem
The central open problem is Conjecture 6.2. In the notation of Lemma 6.1, it asks whether for every , with equality for the coordinate box. Theorem 6.5 leaves gap , so any counterexample would have to realize a structured loss among low corrected-derivative images.
Sharper bounds for low corrected-derivative images may require incidence technology beyond the cycle-curl identities used here, such as Rudnev’s [RUD18] point-plane incidence theorem and the Stevens–de Zeeuw point-line incidence bound over arbitrary fields [Sd17].
Problem 8.1.
Let be odd and let . Classify, or sharply bound, the oriented nonzero directions for which . In particular, decide whether any loss from these low images is necessarily compensated by larger corrected-derivative images in the remaining directions.
8.2. Higher-rank square-modulus quotients
The coordinate box suggests the following higher-rank analogue.
Conjecture 8.2.
For every odd prime and every ,
For higher-rank quotients, one natural next layer could be iterated sumset-growth technology in the Plünnecke–Ruzsa tradition [PLÜ70, RUZ89], together with arbitrary-abelian-group small-doubling structure [GR07].
The cases and are respectively the cyclic residual theorem and Conjecture 6.2. For , the same graph-and-fibre identity holds, and the rank-two argument suggests looking for a frame of low directions and product-type lower bounds for mixed directions.
8.3. Primitive quotients and residual geometries
The primitive quotient reduction separates singleton directions from the primitive quotient part, so the remaining classification can be phrased in primitive terms.
Problem 8.3.
Classify the pairs for which every primitive transversal satisfies , and identify the primitive quotient geometries that force a strict improvement.
Cyclic residual quotients attain the bound ; residual quotients containing a plane do not. The product results control one nonsplit cyclic coordinate with arbitrary split factors, leaving the next case.
Problem 8.4.
Let be prime, , and , with for at least two indices. Determine , or give sharp lower bounds in terms of the nonsplit -primary coordinates.
The square-plane case is the smallest instance of Problem 8.4. Resolving it would clarify the first residual nonsplit geometry left open by the transversal difference number.
Code and data availability
The computations mentioned in Subsection 6.4 were carried using Python and are released in the form of an online companion on GitHub at the link below
Use of Artificial Intelligence Tools
The authors used OpenAI ChatGPT Deep Research, accessed through ChatGPT to help locate and organize potentially relevant bibliographic material. The authors also used OpenAI Codex with GPT-5.5, accessed through the Codex agentic programming environment, to assist with Python experiments, realization of the GitHub repository and copy-editing of the manuscript. These tools were used as research aids, not as authors. In line with the transparency and human-responsibility principles of the Leiden Declaration on Artificial Intelligence and Mathematics [LEI26], the human authors checked the sources, code, numerical results and take full responsibility for the results presented in the article.
References
- [BG19] (2019) Difference bases in finite Abelian groups. Acta Scientiarum Mathematicarum 85 (1–2), pp. 119–137. External Links: Document, Link, 1704.02471 Cited by: §1.
- [BKT04] (2004) A sum-product estimate in finite fields, and applications. Geometric and Functional Analysis 14 (1), pp. 27–57. External Links: Document, math/0301343 Cited by: §1, §6.
- [BT12] (2012) Sum-product estimates for rational functions. Proceedings of the London Mathematical Society 104 (1), pp. 1–26. External Links: Document, 1002.2554 Cited by: §7.2.
- [BUT63] (1963) Relations among generalized Hadamard matrices, relative difference sets, and maximal length linear recurring sequences. Canadian Journal of Mathematics 15, pp. 42–48. External Links: Document, Link Cited by: §1.
- [CLO25] (2025) Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra. 5th edition, Undergraduate Texts in Mathematics, Springer, Cham. External Links: Document, ISBN 978-3-031-91841-4, Link Cited by: §7.2.
- [DIN06] (2006) Full rank tilings of finite Abelian groups. SIAM Journal on Discrete Mathematics 20 (1), pp. 160–170. External Links: Document, Link Cited by: §1, §3.2.
- [DVI09] (2009) On the size of kakeya sets in finite fields. Journal of the American Mathematical Society 22 (4), pp. 1093–1097. External Links: Document, 0803.2336 Cited by: §8.
- [FRE73] (1973) Foundations of a structural theory of set addition. Translations of Mathematical Monographs, Vol. 37, American Mathematical Society, Providence, RI. Cited by: §1.
- [GR07] (2007) Freiman’s theorem in an arbitrary abelian group. Journal of the London Mathematical Society 75 (1), pp. 163–175. External Links: Document, math/0505198 Cited by: §1, §8.2.
- [GRY13] (2013) Structural additive theory. Developments in Mathematics, Vol. 30, Springer, Cham. External Links: Document, ISBN 978-3-319-00416-7, Link Cited by: §1, §2, §4.
- [HAJ42] (1942) Über einfache und mehrfache Bedeckung des -dimensionalen Raumes mit einem Würfelgitter. Mathematische Zeitschrift 47, pp. 427–467. External Links: Document Cited by: §1, §2, §3.
- [KEM60] (1960) On small sumsets in an abelian group. Acta Mathematica 103, pp. 63–88. External Links: Document Cited by: §1, §1, §2, §4.
- [KNE54] (1954) Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen. Mathematische Zeitschrift 61, pp. 429–434 (German). External Links: Document, Link Cited by: §1, §2.
- [LEI26] (2026-06-02) Leiden declaration on artificial intelligence and mathematics. Note: https://leidendeclaration.ai/; accessed June 2026 External Links: Document, Link Cited by: Use of Artificial Intelligence Tools.
- [MWW13] (2013) Value sets of polynomial maps over finite fields. The Quarterly Journal of Mathematics 64 (4), pp. 1191–1196. External Links: Document, 1210.8119 Cited by: §1, §7.2.
- [MP17] (2017) A second wave of expanders in finite fields. In Combinatorial and Additive Number Theory II: CANT, New York, NY, USA, 2015 and 2016, M. B. Nathanson (Ed.), Springer Proceedings in Mathematics & Statistics, Vol. 220, pp. 215–238. External Links: Document, 1701.01635 Cited by: §1, §6.
- [PP26] (2026) Vive Galois! part 1: optimal SIMD packing and packed bootstrapping for FHE. In Theory of Cryptography – TCC 2025, B. Applebaum and H. Lin (Eds.), Lecture Notes in Computer Science, Vol. 16268, Cham, pp. 185–219. External Links: Document, ISBN 978-3-032-12287-2, Link Cited by: §1, §1, §1.
- [PLÜ70] (1970) Eine zahlentheoretische anwendung der graphentheorie. Journal für die reine und angewandte Mathematik 243, pp. 171–183. External Links: Document Cited by: §8.2.
- [PSZ14] (2014) Semifields, relative difference sets, and bent functions. In Algebraic Curves and Finite Fields: Cryptography and Other Applications, H. Niederreiter, A. Ostafe, D. Panario, and A. Winterhof (Eds.), Radon Series on Computational and Applied Mathematics, Vol. 16, pp. 161–178. External Links: Document, 1401.3294 Cited by: §1, §6.
- [RÉD65] (1965) Die neue theorie der endlichen abelschen gruppen und verallgemeinerung des hauptsatzes von hajós. Acta Mathematica Academiae Scientiarum Hungaricae 16, pp. 329–373. External Links: Document Cited by: §1, §2, §3.
- [RUD18] (2018) On the number of incidences between points and planes in three dimensions. Combinatorica 38 (1), pp. 219–254. External Links: Document, 1407.0426 Cited by: §8.1.
- [RUZ89] (1989) An application of graph theory to additive number theory. Scientia, Series A: Mathematical Sciences 3, pp. 97–109. Cited by: §8.2.
- [SIN38] (1938) A theorem in finite projective geometry and some applications to number theory. Transactions of the American Mathematical Society 43 (3), pp. 377–385. External Links: Document, Link Cited by: §1.
- [SV14] (2014) Fully homomorphic SIMD operations. Designs, Codes and Cryptography 71 (1), pp. 57–81. Note: Preliminary version in Cryptology ePrint Archive, Report 2011/133 External Links: Document, Link Cited by: §1.
- [STE74] (1974) Algebraic tiling. The American Mathematical Monthly 81 (5), pp. 445–462. External Links: Document Cited by: §1, §2, §3.2.
- [Sd17] (2017) An improved point-line incidence bound over arbitrary fields. Bulletin of the London Mathematical Society 49 (5), pp. 842–858. External Links: Document, 1609.06284 Cited by: §8.1.
- [SS09] (2009) Factoring groups into subsets. Lecture Notes in Pure and Applied Mathematics, Vol. 257, Chapman & Hall/CRC, Boca Raton, FL. External Links: Document, ISBN 978-1-4200-9046-8, Link Cited by: §1, §2, §3.2.
- [TV06] (2006) Additive combinatorics. Cambridge Studies in Advanced Mathematics, Vol. 105, Cambridge University Press. Cited by: §1, §2, §2, §4, item 1.
- [VOS56] (1956) The critical pairs of subsets of a group of prime order. Journal of the London Mathematical Society s1-31 (2), pp. 200–205. External Links: Document Cited by: §1.