Sum-Product Phenomena for Planar Hypercomplex Numbers
Matthew Hase-Liu, Adam Sheffer

TL;DR
This paper investigates the sum-product problem in planar hypercomplex numbers, specifically dual and double numbers, revealing their unique combinatorial behaviors and extending incidence geometry techniques.
Contribution
It introduces new sum-product bounds for hypercomplex numbers and develops analogs of the Szemeredi-Trotter theorem for these systems.
Findings
Sum-product bounds depend on specific parameters of hypercomplex systems.
Dual numbers exhibit a range where sum and product growth are balanced.
Extended incidence bounds differ from classical real and complex cases.
Abstract
We study the sum-product problem for the planar hypercomplex numbers: the dual numbers and double numbers. These number systems are similar to the complex numbers, but it turns out that they have a very different combinatorial behavior. We identify parameters that control the behavior of these problems, and derive sum-product bounds that depend on these parameters. For the dual numbers we expose a range where the minimum value of is neither close to nor to . To obtain our main sum-product bound, we extend Elekes' sum-product technique that relies on point-line incidences. Our extension is significantly more involved than the original proof, and in some sense runs the original technique a few times in a bootstrapping manner. We also study point-line incidences in the dual plane and in the double plane, developing analogs of the Szemeredi-Trotter…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Sum-Product Phenomena for Planar Hypercomplex Numbers111This research project was done as part of the 2018 CUNY Combinatorics REU, supported by NSF grant DMS-1710305.
Matthew Hase-Liu Harvard University, Cambridge, MA, USA. [email protected]
Adam Sheffer Department of Mathematics, Baruch College, City University of New York, NY, USA. [email protected]. Supported by NSF award DMS-1710305 and PSC-CUNY award 61666-00-49.
Abstract
We study the sum-product problem for the planar hypercomplex numbers: the dual numbers and double numbers. These number systems are similar to the complex numbers, but it turns out that they have a very different combinatorial behavior. We identify parameters that control the behavior of these problems, and derive sum-product bounds that depend on these parameters. For the dual numbers we expose a range where the minimum value of is neither close to nor to .
To obtain our main sum-product bound, we extend Elekes’ sum-product technique that relies on point-line incidences. Our extension is significantly more involved than the original proof, and in some sense runs the original technique a few times in a bootstrapping manner. We also study point-line incidences in the dual plane and in the double plane, developing analogs of the Szemerédi–Trotter theorem. As in the case of the sum-product problem, it turns out that the dual and double variants behave differently than the complex and real ones.
1 Introduction
It is not uncommon for a combinatorial problem to be defined over , to then be generalized to , and then further generalized to the quaternions. For example, this is the case for the sum-product problem [1, 15, 24], for geometric incidence problems [18, 21, 22], and for the Sylvester–Gallai problem [5].
Both the complex numbers and the quaternions are types of hypercomplex numbers. A system of hypercomplex numbers is a unital algebra with every element having the form
[TABLE]
Here , , and are called imaginary units. To be an algebra over the reals, the system also needs to include a multiplication table for the imaginary units. The dimension of the system is , agreeing with the standard definition of the dimension of a vector space. For example, the complex numbers are a two-dimensional system with the multiplication rule . The quaternions form a system of dimension four and involves a multiplication table for the three imaginary units. For a nice basic introduction to hypercomplex numbers, see for example [12].
We refer to two-dimensional systems of hypercomplex numbers as planar. Up to isomorphisms, there are exactly three such planar systems: The complex numbers, the dual numbers, and the double numbers (for a proof of this claim, see for example [12, Section 2]). The dual numbers are of the form , where , and with the multiplication rule . The double numbers are of the form with the multiplication rule . Double number are often also called split-complex numbers, and more generally have at least 18 different names in the literature (Clifford referred to them as algebraic motors, and some other names are spacetime numbers and anormal-complex numbers).
The dual and double numbers seem to appear in many different fields. For example, they are used in String Theory [8], Kinematics [7], and Signal Processing [11]. Dual numbers play a role in the theory of schemes (for example, see [10]). They are used in geometry, and we were originally introduced to them through Kisil’s lecture notes on the Erlangen program [14]. Double numbers were even used to design algorithms for dating sites [16]. However, to the best of our knowledge, dual and double numbers were not seriously studied from a combinatorial perspective. The goal of the current work is initiate such a combinatorial study.
We study a variant of the sum-product problem for dual and double numbers. To obtain sum-product results, we also study other combinatorial properties of these number systems. In particular, we derive variants of the Szemerédi–Trotter theorem for dual and double numbers.
Beyond initiating a combinatorial study of dual and double numbers, we believe that our results are also of intrinsic interest to the study of sum-product phenomena. The sum-product problem seems to have a similar behavior over the reals, over the complex, and over the quaternions. Results over the reals are usually extended to the complex and to the quaternions. Surprisingly, the sum-product problem has a significantly different behavior over the dual numbers. In addition, our main technique is based on a new idea: Using Elekes’ sum-product technique several times, each time relying on the previous result in a bootstrapping manner.
The sum product problem. Given a finite set , the sum set and product set of are respectively defined as
[TABLE]
Erdős and Szemerédi [6] conjectured that for every , any sufficiently large satisfies . (Since is already taken and is also used in our analysis, throughout the paper we will use as a small positive real number.) The problem was later generalized to sets of real numbers, sets of complex numbers, quaternions, finite fields, and more. The problem remains wide-open for all of these variants. For the case of , in 2009 Solymosi [19] proved the bound . In the -notation, we neglect subpolynomial factors such as and . The same holds for the -notation and for the -notation. After a series of improvements, the current best bound over , derived in [17], is . Similar bounds exist for the complex numbers and for the quaternions (for example, see [1, 24]). The best know upper bound for all of these variants is .
Dual numbers. Let be the set of dual numbers: The extension of with the extra element and the rule . We write a number as . Imitating the complex numbers, we refer to as the real part of , and to as the imaginary part of . Unlike and , the dual numbers do not form a field, since some dual numbers are not invertible. In particular, a dual number has an inverse if and only if it has a non-zero real part.
Unlike the cases of , , and the quaternions, the sum–product conjecture is false over the dual numbers. For example, consider the set
[TABLE]
and note that
[TABLE]
That is, the sizes of both the sum set and product set are linear in . Note that all of the elements of are invertible, and so are the elements of and of . When allowing non-invertible elements, one can have a product set of size one and a linear-sized sum set. However, we are not interested in constructions that are based on non-invertible elements.
It turns out that the maximum number of elements of that have the same real part plays an important role. We say that a set has multiplicity if every real number is the real part of at most elements of . We usually denote the size of as and the multiplicity of as , for some .
To adapt the above construction to the case of multiplicity , we consider the set
[TABLE]
and note that
[TABLE]
Note that in this construction indeed has multiplicity . The size of the sum set is and the size of the product set is . Thus, the sum-product conjecture is false for any . On the other hand, we show that is super-linear in when is not too large. Set .
Theorem 1.1**.**
Let be a set of dual numbers with multiplicity , for some . Then for every ,
[TABLE]
Combining Theorem 1.1 with the above construction leads to a surprising observation: When the bound for the sum-product problem is neither nor . It is hard to guess what the actual value should be. One possibility is that the sum-product conjecture holds when , and is replaced with when .
Different bounds in the statement of Theorem 1.1 are obtained using different approaches. The bound for the range is obtained from a relatively simple adaptation of Solymosi’s technique from [19]. Surprisingly, we were able to obtain a stronger bound when by relying on an earlier approach of Elekes [4]. While we use Elekes’ approach, our technique is significantly more involved, and is the main result of this work. In addition to having several new steps, we use Elekes’ approach several times, each time relying on the result of the previous case.
Our extension of Elekes’ technique leads to the bounds of Theorem 1.1 for range and also for the range . This technique breaks down when . The bound for the range of is obtained by a naive approach — removing elements from to decrease the multiplicity to , and then applying the bound of Theorem 1.1 for the range .
Double numbers. Let be the set of double numbers: The extension of with the extra element and the rule . We write a number as . As before, we refer to as the real part of , and to as the imaginary part of . The double numbers do not form a field, since some double numbers are not invertible.
Unlike the case of a dual numbers, we could not find a counterexample to the sum-product conjecture in the case of double numbers. To see some other surprising behavior of the double numbers, consider the sets
[TABLE]
Note that . That is, the product set of two large sets could be of size one. This example will not be very relevant for us, since it heavily relies on non-invertible elements.
We say that a set has multiplicity if for every at most elements satisfy and at most satisfy . Recall that . We derive the following sum-product bound for double numbers.
Theorem 1.2**.**
Let be a set of double numbers with multiplicity , for some . Then for every ,
[TABLE]
While Theorem 1.2 contains the same bounds as Theorem 1.1, the proof of Theorem 1.2 is more involved. In some sense it is easier to study dual numbers than double numbers. That is why we first prove Theorem 1.1 in Section 2, and then prove Theorem 1.2 in Section 3.
Point-line incidences. Our sum-product technique requires studying point-line incidences in the plane. Thus, we first study analogs of the Szemerédi–Trotter theorem in and in .
Given a set of points and a set of lines in , an incidence is a pair such that the point is contained in the line . The number of incidences in is denoted as .
Theorem 1.3** (The Szemerédi-Trotter theorem [25]).**
Let be a set of points and let be a set of lines, both in . Then
[TABLE]
As shown in [22, 27, 28], Theorem 1.3 still holds when replacing with . A common approach for incidences in the complex plane is to think of as , obtaining an incidence problem between points and two-dimensional planes. In particular, the following is a special case of a result of Solymosi and Tao [22]. Consider a point set and a set of two-dimensional planes, both in . We say that an incidence is generic if there is no additional incidence such that is a line. That is, two planes that form generic incidences with the same point do not have any other intersection points.
Theorem 1.4**.**
Let be a set of points and let be a set of arbitrary two-dimensional planes, both in . Then for every , the number of generic incidences in is
[TABLE]
As we will see below, Theorem 1.3 cannot be extended to and to . In either case, one can construct a configuration of points and lines with incidences. As in the sum-product problem, this maximum number of point-line incidences is controlled by the notion of multiplicity.
We begin with the case of the dual plane. There are several different ways to define the multiplicity in a point-line incidence problem in , and we only present one example here. One may use Lemma 2.1 to obtain other similar results. Let be a set of lines in , each defined by an equation of the form with . We say that has multiplicity if for every , at most lines of satisfy . We also let contain any number of lines of the form , without this affecting the multiplicity of the set. (Our incidence bound also holds when allowing to contain lines of the form with .)
Theorem 1.5**.**
Let be a set of points and let be a set of lines, both in . Let have multiplicity for some . Then for every ,
[TABLE]
As we see in Section 2.1, the term is tight and cannot be removed from the bound of Theorem 1.5. We can also obtain a construction with incidences. The in the bound is almost certainly redundant. It is much less clear what should be the correct dependency in in .
We obtain similar incidence results in the double plane . As in the dual case, there are several different ways to define the multiplicity of a point-line incidence problem in , and we only present one example. Let be a set of lines in , each defined by an equation of the form with . We say that has multiplicity if for every , at most lines of satisfy and at most such lines satisfy . We also let contain any number of lines of the form , without this affecting the multiplicity of the set. (Our incidence bound still holds also when allowing to contain lines of the form with non-invertible .)
Theorem 1.6**.**
Let be a set of points and let be a set of lines, both in . Let have multiplicity for some . Then for every ,
[TABLE]
As in the dual plane, the term is tight and cannot be removed from the bound of Theorem 1.5. We can also obtain a construction with incidences.
The Szemerédi-Trotter theorem (Theorem 1.3) is considered to have a dual formulation, in the sense that there is a simple combinatorial argument for moving between one formulation and the other. Given a set of lines , we say that a point of is -rich if is incident to at least lines of .
Theorem 1.7** (Dual Szemerédi-Trotter).**
Let be a set of lines in , and let be a positive integer. Then the number of -rich points of is .
**More about the multiplicities. ** Both for the sum-product problem and for the incidence problem, we established that the dual and double variants behave quite differently than the real, complex, and quaternion cases. An obvious possible explanation for this difference is that and are not fields. But these are not fields only because some degenerate numbers have no inverse. And all of our results hold also when all of the numbers in the problem have inverses. Moreover, our definitions of multiplicity are not directly about non-invertible elements.
Instead of non-invertible elements in , both definitions of multiplicity ask not to contain many non-invertible elements. Indeed, in the dual case, is non-invertible when . In the double case, is non-invertible when or . This curious connection between the multiplicity definitions in the dual and double cases might hide a deeper general principle. In addition, this seems related to a result of Tao [26, Theorem 5.4], which holds in a much more general scenario. Vaguely and inaccurately, this result states that a set satisfying implies the existence of a linear subspace of zero-divisors, such that has a large intersection with a translate of (see also [13]). This is indeed the situation in our case. For example, in the dual case is the line . Continuing to expose this hidden principle could potentially be an exciting research front.
Additional connections to previous sum-product works. Similarly to the complex numbers and to the quaternions, one can represent dual and double numbers as matrices. The standard matrix representations for these numbers are
[TABLE]
With these representations, matrix addition and multiplication correspond to the addition and multiplication of dual and double numbers.
With the above matrix representation, our construction of with and corresponds to a construction of Chang [2] for matrices in . Other papers, such as [23, 24], study sum-product phenomena for matrices of specific types. To the best of our knowledge, none of the previous works is relevant to the cases of dual numbers and double numbers. For example, Theorem 4 of Solymosi and Wong [24] depends on the 1-norm of the matrices. This notion is completely unrelated to our notions of multiplicity.
Recall that when , our sum-product bound for the dual numbers is neither nor . A somewhat similar situation was observed before for the sum-product problem in finite fields. For simplicity, we only consider finite fields where is a prime. Garaev [9] constructed a set such that and . On the other hand, as shown in [3], every set with satisfies .
Another elegant argument of Solymosi [20] shows that every finite satisfies . The last paragraph of that paper states that “A similar argument works for quaternions and for other hypercomplex numbers.” We now briefly discuss how the current work compares with the results of [20]. A reader who is not familiar with [20] can safely skip this discussion.
The proof in [20] relies on the standard property that holds for (in particular, this property is used in Lemma 2.1 of [20]). When working with dual or double numbers, this absolute value property fails when using the standard definition . In the case of dual numbers, an alternative definition is , which does maintain the property . When using this definition, a different part of Lemma 2.1 of [20] fails: The claim that no number is covered by more than seven disks. A similar situation occurs for the double numbers.
Note that the proof of [20] should not hold for dual numbers, since then it would contradict the above construction. We did manage to get a variant of the argument in [20] to hold for dual and double numbers, while depending on the notion of multiplicity (thus also eliminating the contradiction with the dual construction). Let be a set of dual or double numbers with multiplicity . In the proof of Lemma 2.1, instead of being covered by at most 7 disks, no number is covered by more than “disks”. Then, in the definition of good sets one changes the constant 28 with . Now the proof then holds again, implying the bound . It is not difficult to verify that the bounds of Theorem 1.1 and 1.2 are stronger for every relevant value of .
Acknowledgements. We would like to thank Misha Rudnev for suggesting this problem, and to Ben Lund, Cosmin Pohoata, and Frank de Zeeuw for helpful discussions. We would also like to thank József Solymosi — while he was not even aware of this project, quite a few of his works affected every part of it.
2 Dual numbers
In this section we study dual numbers, and in particular prove Theorem 1.1. In Section 2.1 we study properties of lines in the dual plane. We derive a point-line incidence bound in , and study additional properties of such incidences. In Section 2.2 we adapt Elekes’ sum-product technique to the dual numbers. As mentioned above, we add several additional steps to Elekes’ original argument. In Section 2.3, we adapt Solymosi’s sum-product argument to the dual numbers.
2.1 Lines in the dual plane
Recall that we denote by the set of dual numbers: The extension of with the extra element and the rule . We write a number as . Multiplication of dual numbers is commutative, and 1 is the unit element. A dual number has an inverse element if and only if . The inverse element is then . Indeed, we have
[TABLE]
We define a line in as the set of points on which a linear equation vanishes. Let be the line defined by , where . This corresponds to
[TABLE]
or equivalently
[TABLE]
When , the first equation becomes trivial while the second still exists. In any other case, the two equations are linearly independent. We can think of as , and then is either a 2-flat or a hyperplane, depending on whether . We refer to the lines of the latter type as degenerate lines. Note that a line defined by is degenerate if and only if both and are non-invertible.
In the real and complex planes, any two lines intersect in at most one point. In , two lines can have an infinite intersection, even when excluding non-invertible coefficients in the line equations. For example, consider the set of non-degenerate lines
[TABLE]
It is not difficult to verify that every line of contains every point of the form with . By taking lines from and points of the form we get incidences. That is, the point–line incidence problem in is trivial. This remains true when excluding degenerate lines, and also when using only invertible numbers in the definitions of the points and the lines. We now study when collections of lines have an infinite intersection.
For , denote by the real part of . That is, .
Lemma 2.1**.**
(a) Let and be distinct lines in , respectively defined by and . Then contains more than one point if and only if , , and . When these conditions are satisfied, is a line in and there exist such that every point satisfies and .
(b) Let be a set of lines of the form that have an infinite common intersection. Then all of these lines have the same values for and , and there exist such that every point in the infinite intersection satisfies and . Moreover, either all the values are identical or there exists such that every line satisfies .*
Proof.
(a) To study the intersection points of the two lines, we combine and , obtaining , or equivalently . Splitting this equation into real and imaginary parts gives
[TABLE]
First assume that . In this case we can rewrite the above system as
[TABLE]
Since this system has a unique solution, when the two lines intersect in a single point.
We next assume that . In this case, equation (1) implies . Then the line equations and become
[TABLE]
Combining the second and third equations of this system gives . If then the second and third equations of the system imply that either or (depending on whether or not ). We may thus assume that , to obtain
[TABLE]
Thus, the intersection is infinite (it is a line in ). Moreover, all of the points of have the same real parts .
(b) By part (a), all the lines in have the same values for and , and there exist such that every point in the infinite intersection satisfies and . That is, every line of is defined by , where are fixed and change between different lines. By the proof of part (a), two lines defined by and satisfy
[TABLE]
To have every pair of lines of satisfy , either and then all of the values are identical, or there exists such that every line satisfies . ∎
We are now ready to prove Theorem 1.5. We first recall the statement of this theorem.
Theorem 1.5. *Let be a set of points and let be a set of lines, both in . Let have multiplicity for some . Then for every , *
[TABLE]
Proof.
By the definition of multiplicity, the set may contain at most degenerate lines. Together these lines participate in at most incidences. Every point of is incident to at most one line of the form , so such lines contribute at most incidences. It remains to consider incidences with non-degenerate lines of of the form .
We discard from the degenerate lines and lines of the form . We can then partition into disjoint subsets , such that the multiplicity of each is one. For every , set . Note that . Since each subset has no multiplicity, by Lemma 2.1 every two lines from the same intersect in at most one point. That is, when thinking of as , the set becomes a set of two-dimensional planes, each two intersecting in at most one point. We may thus apply Theorem 1.4 with and . Note that in this case every incidence is generic by definition, so Theorem 1.4 gives a bound for the total number of incidences. By doing that for every and then applying Hölder’s inequality, we obtain
[TABLE]
∎
For our sum-product results in , we need additional properties of point-line incidences in . We define the real part of as the copy of , and say that a point corresponds to the point in the real part of . When thinking of as , the real part of is the projection of to the two real coordinates. Thus, each point in the real part of has an imaginary plane associated with it, which is also copy of . For example, the point is the point in the imaginary plane associated with the point in the real part of .
We refer to a set of lines in with an infinite common intersection as a line family. Let be such a line family. By Lemma 2.1(b), every line of corresponds to the same line in the real part of . We refer to this line as the real line of . By the same lemma, the infinite intersection of the lines of is contained in a single point of the real part of . That is, this intersection is a line in the imaginary plane associated with a single point in the real part of . We say that is the special point of the line family .
Let be a line in the real part of . Then there could be several line families whose real part is . In addition, a line in whose real part is can participate in many line families that that have as their real line. For example, the line defined by is contained in the real line and is part of every family defined by and such that (see Lemma 2.1(b)). We now study the interaction between line families that have the same real line.
Lemma 2.2**.**
*Let and be two distinct line families in that correspond to the same real line . Assume that is not parallel to the -axis.
(a) If and have the same special point then they have no lines in common.
(b) If and have different special points then they have at most one line in common.*
Proof.
As before, we define a line in using the equation . Since the line families and have the same real part, every line in these families have the same values of and .
(a) Denote the common special point as . As shown in the proof of Lemma 2.1(b), every two lines and from the same family satisfy a relation of the form .
First assume that . In this case, every line of has the same , and so does every line of . The two values of are distinct, since otherwise and would have been the same family. Since no line can have two different values of , the two line families are disjoint.
We now assume that . Then exist such that every line of satisfies and every line of satisfies . If a line satisfies both requirements, we obtain that and thus . This is impossible, since it implies that the two line families are identical. We conclude that no line can be in both families.
(b) Denote the special point of as and the special point of as . Since these are distinct points on the line that is not parallel to the -axis, we have . A line that is in both and satisfies and . Since this system has at most one solution for the values of and , implying that at most one line is in both families. ∎
2.2 Adapting Elekes’ argument to dual numbers
We are now ready to present our main proof for dual numbers. We first repeat the relevant part of Theorem 1.1
Theorem 2.3**.**
Let be a set of dual numbers and multiplicity , for some . Then for any ,
[TABLE]
Proof.
By the multiplicity assumption, contains at most non-invertible elements. We discard these elements. This does not change the asymptotic size of and can only decrease the sizes of and . Thus, it suffices to prove the bound for the resulting smaller set. Abusing notation, in the rest of the proof we refer to this revised set as .
Consider the point set
[TABLE]
and the set of lines
[TABLE]
Note that and . Since the revised consists of invertible elements, there are no degenerate lines in .
The proof is based on double counting . A line of defined by contains every point of of the form for every . That is, we have that . For the rest of the proof we will derive upper bounds on .
We partition the incidences in into two types, as follows. We say that an incidence is special if is incident to a second line such that and are members of the same line family. Since lines from the same family intersect only in their special point, the special point of this family is . If an incidence is not special, we say that it is a standard incidence.
We first bound the number of standard incidences. By considering as , we obtain an incidence problem with two-dimensional flats. If and are standard incidences, then . These are regular incidences, as defined before Theorem 1.4. By that theorem, the number of standard incidences is .
When the number of standard incidences is larger than the number of special incidences, we have that
[TABLE]
Combining this with leads to . This immediately implies the assertion of the theorem, for any .
Handling special incidences. It remains to consider the case where the number of special incidences is larger than the number of standard incidences. Denote by the number of special incidences that satisfy:
- •
Let be the line in the real part of that corresponds to . Then corresponds to at least lines of and to fewer than such lines.
- •
There is a line family that contains whose special point is , and that contains at least and fewer than lines of .
- •
The real point corresponds to at least points of and fewer than such points.
- •
The real point is the special point of at least and to fewer than line families that satisfy the property stated in the second item.
Note that we can take elements such that every special incidence in is counted in at least one of those elements. Thus, the number of special incidences is upper bounded by the maximum size of times .
We study some basic properties of the parameters that maximize . For this purpose, we assume that are fixed. We denote by the set of special points that participate in incidences of . Let be the set of lines in the real part of that correspond to lines of that participate in incidences of . Let be the set of line families that contain at least lines of and fewer than such lines. Since and every line of corresponds to lines of , we get that .
By the multiplicity of and the definition of , at most lines of can correspond to the same line of . That is, we have . We also have that , since otherwise there are not enough lines corresponding to a real line to create a family in .
We consider the maximum number of lines from that a line family can contain. Recall that a line in is defined by an equation of the form , and that a line in is defined by an equation of the form with . By Lemma 2.1(b), all the lines in the same family have the same and values, so the real parts of and are fixed. By the same lemma, either all the lines in a family have the same value, or they all satisfy a relation of the form . In either case, choosing the imaginary part of uniquely determines the imaginary part of . Due to the multiplicity of , the family has at most lines from . Since any line family contains at most lines of , we have that .
Since the multiplicity of is , at most sums in can have the same real part. Similarly, at most products in can have the same real part. Since , at most points of can correspond to the same point in the real part of . That is, . We also have the straightforward bound , or equivalently .
Next, we consider the maximum number of line families of that can have the same special point. Recall that the lines of are defined as where . For every choice of and , there is a unique real part of such that the real part of the resulting line is incident to . That is, for a fixed special point and , there are at most elements such that the resulting line is incident to the special point. By Lemma 2.2(a), if two families have the same real line and the same special point, then they have no lines in common. This yields .
To recap:
[TABLE]
We next bound the number of families in . Recall that , and that each line of corresponding to fewer than lines of . For a fixed line , by Lemma 2.2 every two families corresponding to have at most one line in common. There are fewer than pairs of lines of that correspond to . Each such pair can appear in at most one line family, and each line family subsumes at least such pairs. Thus, the number of families that correspond to is . By summing up over every , we obtain that .
We derive several upper bounds for :
- •
Since each special point corresponds to points of , we have .
- •
Since , and each special point subsumes families of , we obtain .
- •
Given a point , by Lemma 2.2(a) each line of corresponds to families that have as their special point. Thus, every point of is incident to lines of . Recalling that , Theorem 1.7 implies that
[TABLE]
Consider the imaginary plane associated with a special point . There are families incident to , each corresponding to a distinct line in the imaginary plane of . There are points of in this imaginary plane. By the Szemerédi–Trotter theorem (Theorem 1.3), the number of incidences between these points and lines is . Since each line in the imaginary plane corresponds to lines of , the number of incidences in the special point is
[TABLE]
To obtain an upper bound for , we can multiply (2) with any of our three upper bounds for . Then, to obtain an upper bound on the total number of incidences, we can multiply the resulting bound for with . We divide the rest of the analysis into cases, according to the term that dominates the inner parentheses in (2).
The case where dominates. We first assume that is larger than the other two terms in the inner parentheses of (2). This case occurs when . Using the bound , we obtain that the number of special incidences is
[TABLE]
Since we assume that the number of special incidences is larger than the number of standard incidences, the above is also a bound for the total number of incidences. Combining this bound with gives
[TABLE]
Multiplying both sides by 3 and rearranging gives
[TABLE]
We repeat the above argument with the different bound . In this case we get that the number of incidences is
[TABLE]
We split the current case into two additional cases, according to the dominating term in the above bound.
(i) When (4) is dominated by the first term, combining it with gives
[TABLE]
Combining this with (3) gives
[TABLE]
Dividing by 12 gives .
We next use the bound to obtain that the number of incidences is
[TABLE]
Combining this with , and then applying and yields
[TABLE]
This immediately implies .
(ii) We next consider the case where the incidence bound (4) is dominated by the term . Combining this with gives
[TABLE]
In this case we still have the bound (5) for the number of incidences. Combining (5) with , and then applying , , and yields
[TABLE]
Similarly to the previous case, this implies .
The cases where or dominate. Assume that is larger than the other two terms in the inner parentheses of (2). This happens when . Using the bound , we get that the number of incidences is
[TABLE]
Combining this with implies that , or equivalently . This in turn implies that . Since this contradicts the assumption concerning , we conclude that cannot dominate the inner parentheses of (2).
Finally, assume that is larger than the other two terms in the inner parentheses of (2). This happens when . By using the bound we get that the number of incidences is
[TABLE]
Combining this with implies
[TABLE]
This immediately implies .
By going over each case that occurs when the number special incidences is larger, we note that the weakest bound that was obtained is . To complete the proof, for each value of we use the weaker bound out of the one obtained when there are more standard incidences, and the one obtained when there are more special incidences. ∎
Remark. It may at first seem surprising that in our analysis of special incidences we obtain bounds such as . In particular, when there is no multiplicity and each family consists of a single line, so one might expect to get the standard Elekes bound of . The reason for obtaining a stronger bound is our assumption that each family has a single special point. Thus, when setting , we force each line to form an incidence with at most one point. It is not surprising that we get a stronger bound under such a strong assumption.
We next prove the bound of Theorem 1.1 for the case where . Recall that .
Corollary 2.4**.**
Let be a set of dual numbers with multiplicity , for some . Then for any ,
[TABLE]
Proof.
Consider a sufficiently small . We remove elements from until it has multiplicity . This yields a subset of size . Applying Theorem 1.1 on with multiplicity , and assuming that is sufficiently small, leads to
[TABLE]
Finally, when . ∎
2.3 Adapting Solymosi’s argument to dual numbers
For any we have . When is invertible, we also have . For , we define
[TABLE]
In other words, is the number of ways to obtain as the real part of a product of two elements of , and similarly for . For a finite set , we define the multiplicative energy of as
[TABLE]
We are now ready to adapt Solymosi’s sum-product argument [19] to sets of dual numbers.
Theorem 2.5**.**
Let be a set of dual numbers with multiplicity , for some . Then
[TABLE]
Proof.
By assumption, may contain up to non-invertible elements. We discard these elements without changing the asymptotic size of .
If at least half of the elements of have a positive real part, we discard from elements with a negative real part. Otherwise, we discard from the elements that have a positive real part and multiply the remaining elements by . In either case, all the elements of the revised set have a positive real part. The asymptotic size of is unchanged and the sizes of and can only decrease. Thus, it suffices to derive a lower bound for for the revised . Abusing notation, we still refer to this set as and its size as .
Since each pair contributes to exactly one set , we have
[TABLE]
If satisfies then . This implies that
[TABLE]
Using dyadic decomposition, we partition this sum to
[TABLE]
This implies that there exists such that
[TABLE]
We set , and denote the elements of as . Since we have
[TABLE]
Consider the planar point set Since , we have that .
For each let denote the line in defined by . We think of these lines as being in the real part of (which is a copy of ). Let be the set of points that satisfy . In other words, this is the set of points that satisfy the real part of the line equation, but not necessarily the imaginary part. By definition, for each of these lines we have . Let denote the set of points in the real part of that correspond to at least one point of . Note that is in while is in , and that .
The lines are all incident to the origin. In addition, the points of lie in the interior of the wedge formed by and in the first quadrant of . Thus, for any , the sets and are disjoint.
Fix . For any and (these are points in ), we have that unless and . Indeed, for variables , the system has a unique solution. Hence, for any and that satisfy or , we have . Since and since has multiplicity , for each at most pairs satisfy . For each point in we arbitrarily consider one point of that corresponds to it, and denote the resulting set as . Note that and that consists of points with distinct real parts. We claim that . In other words, we claim that every element of can be written as a sum in a unique way. Indeed, for and we clearly have when . If then and have distinct imaginary parts, again implying . This leads to
[TABLE]
Combining this with (6) yields
[TABLE]
By the Cauchy-Schwarz inequality,
[TABLE]
Combining this with (7) leads to
[TABLE]
Rearranging this gives
[TABLE]
This immediately implies the assertion of the theorem. ∎
3 Double numbers
In this section we study double numbers, and in particular prove Theorem 1.2. In Section 3.1 we study properties of lines in the double plane. We derive a point-line incidence bound in , and study additional properties of such incidences. This case is more involved than the analog for dual lines in Section 2, since we cannot easily separate into a real part and an imaginary part as we did for . In Section 3.2 we adapt Elekes’ sum-product argument to the double numbers. As in the dual case, we add several additional steps to Elekes’ original approach. In Section 3.3, we adapt Solymosi’s sum-product argument to the double numbers.
3.1 Lines in the double plane
Recall that we denote by the set of the double numbers: The extension of with the extra element and the rule . We write a number as . Multiplication of double numbers is commutative, and 1 is the unit element. A double number has an inverse element if and only if (equivalently, ). The inverse element is then . Indeed,
[TABLE]
For , we define and . For any where is invertible, we have
[TABLE]
It is not difficult to verify that the above equations still hold when replacing with .
We define a line in as the set of points on which a linear equation vanishes. Let be the line defined by , where . This corresponds to
[TABLE]
or equivalently
[TABLE]
The two above equations are linearly dependent if and only if , , and , where all three represent the same operation. We can think of as , and then is either a 2-flat or a hyperplane, depending on whether the two above equations are linearly dependent. We refer to the lines of the latter type as “degenerate lines”. Note that for a line defined by to degenerate, all three , , and must be non-invertible.
As in the dual case, lines in the double plane can have an infinite intersection, even when excluding non-invertible coefficients in the line equations. For example, consider the set of non-degenerate lines
[TABLE]
It is not difficult to verify that every line of contains the line parameterized by with . By taking lines from and points on , we get incidences. That is, the point–line incidence problem in is trivial. We now study when collections of lines have an infinite intersection.
Lemma 3.1**.**
*In each of the following parts, every represents the same operation, and every represents the other operation.
(a) Let and be distinct lines in , respectively defined by and . The intersection contains more than one point if and only if , and . When these conditions are satisfied, is a line in and every point in satisfies .
(b) Let be a set of lines of the form that have an infinite common intersection. Then exist such that every line of satisfies and . There also exists such that every point in the infinite intersection satisfies .*
- •
If then every line has the same , and every point in the common intersection satisfies .
- •
If then exist such that every line satisfies and . Every point in the common intersection satisfies .
Proof.
(a) To study the intersection points of the two lines, we combine and , obtaining , or equivalently . Splitting this equation into real and imaginary parts gives
[TABLE]
We consider the above as a linear system in and . This system has a unique solution unless . That is, the intersection contains at most one point unless . If then the two lines are either parallel or identical. Thus, it remains to study the case where .
We either have that or that . We first consider the former case. By the equations of (9), either and the two lines do not intersect or and the two lines have an infinite intersection. In the case of an infinite intersection, the equations of (9) also imply .
It remains to consider the case where . By (9), either and the two lines do not intersect or and the two lines have an infinite intersection. In the case of an infinite intersection, the equations of (9) also imply .
(b) If distinct 2-flats in have an infinite intersection, then this intersection is a line. Let be the line in that is the infinite intersection of the lines of . By part (a), there exists such that every satisfies and every distinct satisfy . This implies that the symbol represents the same operation for all lines in . By part (a) we also have that , or equivalently that . That is, every line of has the same value for . Similarly, the condition leads to every line of having the same value for .
If , then every two lines satisfy , or equivalently . Since every has the same value, we also obtain . That is, every line of has the same . Consider a line of defined by . Splitting this equation to real and imaginary parts, we obtain and . Combining these two equations gives
[TABLE]
If then every distinct satisfy . This implies that there exists such that every line of satisfies . By part (a), we have , or equivalently . Thus, and there exists such that every line of satisfies .
Consider a line of defined by . Splitting this equation into real and imaginary parts, we obtain and . Combining these two equations gives
[TABLE]
∎
The example before Lemma 3.1 was obtained by setting and . The rest followed from Lemma 3.1.
Using Lemma 3.1, we can prove Theorem 1.6. This proof is identical to the proof of Theorem 1.5, so we do not repeat it here.
To derive our sum-product bounds in , we need additional properties of point-line incidences in . We refer to a set of lines that have an infinite common intersection as a family of lines. Let be such a family. By Lemma 3.1(b), there exist constants such that every point in the common intersection of the lines of satisfies and . We say that is the point parameter of the family . Also by Lemma 3.1(b), there exist such that every line of satisfies and . We define the line parameter of to be .
We can study the interaction between different line families by studying their point parameters and line parameters. We say that a line family is positive or negative according to the meaning of the sign in the definition of the point parameter of the family. In the notation of Lemma 3.1(b), a family is positive if . We refer to this property as the sign of a line family.
Lemma 3.2**.**
*Let and be distinct line families in with the same sign.
(a) If and do not have the same line parameter, then no line is contained in both families.
(b) If and have the same line parameter and the same value for , then no line is contained in both families.
(c) If and have the same line parameter but not the same , then at most one line of is in both families.*
Proof.
(a) By the definition of the line parameter, either the lines of and the lines of have different values of or these lines have different values of (or both). Since no line can have two different values for or two different values for , the two families are disjoint.
(b) Let denote the sign of and , let denote the opposite sign, and denote the common value of as . Since the two families have the same line parameter and the same sign, every line in has the same value of and the same value of . We assume for contradiction that there exists a line in that is contained in both families.
We first consider the case of . By Lemma 3.1(b), all the lines in the same family have the same . Since the two families contain a line in common, every line of has the same value of and the same value of . Since these families also have the same value of they are identical, contradicting the assumption.
Next, consider the case of . By Lemma 3.1(b), in this case there exist such that every line of satisfies and every line of satisfies . Since there is a line in both families, we obtain or equivalently . By a symmetric argument, the values of both families are identical. Since the value of is also identical for both line families, we conclude that the two families are identical, contradicting the assumption.
We got a contradiction in both cases, so the two line families cannot have any lines in common.
(c) Let denote the sign of and , let denote the opposite sign, and let be a line that is in both families. As in the proof of part (b), every line in has the same value of and the same value of . Denote the values of and as and , respectively. Then there exist such that satisfies and . These are two independent linear equations in the variables , and thus have a unique solution. We conclude that there is at most one line common to both families. ∎
We can also use the line parameter to study the behavior of line families in .
Lemma 3.3**.**
When considering every line in as a 2-flat in , the 2-flats of a line family are all contained in a common hyperplane. Two line families of the same sign are contained in the same hyperplane if and only if they have the same line parameter.
Proof.
Consider a line family with line parameter , and a line from defined by . Splitting this equation into real and imaginary parts, we obtain and . Combining these two equations leads to
[TABLE]
That is, every line of corresponds to a 2-flat that is contained in the hyperplane defined by . It can now be easily verified that two families are contained in the same hyperplane if and only if they have the same line parameter . ∎
Finally, we study the interaction between two line families with opposite signs.
Lemma 3.4**.**
Let and be distinct line families in with opposite signs. Then at most one line is contained in both families.
Proof.
Without loss of generality, assume that the lines of have the same value of and that the lines of have the same value of . Then all the lines of have the same value of and all the lines of have the same value of . It can be easily verified that there are unique values for that satisfy all four restrictions. We conclude that at most one line can be in both families. ∎
3.2 Adapting Elekes’ argument to double numbers
We are now ready to adapt the proof from Section 2.2 to the double numbers. The two proofs are similar, but not identical. We thus provide most of the proof, skipping only the last part, which is technical calculation identical to the one in Section 2.2. We first repeat the relevant part of Theorem 1.2.
Theorem 3.5**.**
Let be a set of double numbers and multiplicity , for some . Then for any ,
[TABLE]
Proof.
By the multiplicity assumption, contains at most non-invertible elements. We discard these elements. This does not change the asymptotic size of and can only decrease the sizes of and . Thus, it suffices to prove the bound for the resulting smaller set. Abusing notation, in the rest of the proof we refer to this revised set as .
Consider the point set
[TABLE]
and the set of lines
[TABLE]
Note that and . Since the revised consists only of invertible elements, there are no degenerate lines in . We think of both as a point set in and as a point set in . Similarly, we think of both as a set of lines in and as a set of 2-flats in .
The proof is based on double counting . A line defined by contains every point of of the form for every . That is, we have that . For the rest of the proof we will derive upper bounds for .
We partition the incidences in into two types, as follows. We say that an incidence is special if there exists a second line such that and are members of the same line family, and is in the infinite intersection of this family. If an incidence is not special, then we say that it is a standard incidence.
We first bound the number of standard incidences. By considering as , we obtain an incidence problem with two-dimensional flats. If and are standard incidences, then . These are regular incidences, as defined in Theorem 1.4. By that theorem, the number of standard incidences is .
When the number of standard incidences is larger than the number of special incidences, we have that
[TABLE]
Combining this with leads to . This immediately implies the assertion of the theorem, for any .
Handling special incidences. It remains to consider the case where the number of special incidences is larger than the number of standard incidences. We say that a special incidence corresponds to a line family if the line is contained in the line family and the point is in the infinite intersection of the family. By the definition, each special incidence corresponds to at least one line family. By Lemmas 3.2 and 3.4, a special incidence can correspond to at most one positive family and to at most one negative family. In the rest of the analysis, we assume that at least half of the special incidences correspond to a positive family. The other case, in which at least half of the special incidences correspond to a negative family, is handled in a symmetric manner.
We remove the special incidences that are not associated with positive line family. By the above assumption, this does not asymptotically change . The removal process may turn some special incidences to standard incidences. We bound the number of new standard incidences in the same way we bound the number of the original standard incidences. As before, if most of the original special incidences became standard incidences, then we are done.
It remains to study the case where most of the original value of comes from the remaining special incidences. Denote by the number of special incidences that satisfy the following. Let be the positive line family that corresponds to , let be the point parameter of , and let be the line parameter of .
- •
The number of lines of that satisfy and is at least and smaller than .
- •
The number of lines of that are in is at least and smaller than .
- •
The number of points that satisfy and is at least and smaller than .
- •
The pair is the point parameter of at least and fewer than positive line families that satisfy the property stated in the second item.
Note that we can take elements such that every special incidence is counted in at least one of those elements. Thus, the number of special incidences is at most the maximum size of times .
We study some basic properties of the parameters that maximize . For that purpose, we assume that are fixed. We denote by the set of point parameters that participate in incidences of . Let be the set of line families that contain at least lines of and fewer than such lines. Let be the set of line parameters of the families of . Since and every pair of corresponds to lines of , we get that .
We study how many lines of can correspond to a given line parameter . Recalling that every line of is of the form , we note that uniquely determines . Since has multiplicity , there are choices for . Recalling from (8) that , we get that for a fixed there are choices for . Thus, the number of lines in with a given line parameter is . This implies that . We also have that , since otherwise there are not enough lines with the same line parameter to create a family in .
We now consider how many lines from can be part of the same line family. In general we consider lines defined by an equation of the form , and a line in is defined by an equation of the form with . By Lemma 3.1, all the lines in the same positive family have the same and . The multiplicity of implies that there are at most possible values . Also by Lemma 3.1, either all the lines in a family have the same , or they all satisfy relations of the form and . In either case, the values of are uniquely determined by the values of . That is, choosing uniquely determines . We conclude that every family contains at most lines from , so .
Recall from (8) that . Since the multiplicity of is , at most sums in can have the same value for . Similarly, since , at most products in can have the same value for . Since , at most points of can correspond to the same point parameter in . Thus, . We also have the straightforward bound , or equivalently .
Next, we consider the maximum number of line families of that can have the same point parameter. Recall that every line of a positive family with point parameter satisfies (for example, see the proof of Lemma 3.1(b)). Since the lines of are defined as with , for every choice of and a point parameter, the value of is uniquely determined. This implies that a specific point parameter has lines of corresponding to it. We conclude that .
To recap:
[TABLE]
We next bound the number of families in . Recall that , and that each pair of corresponds to fewer than lines of . For a fixed , by Lemma 3.2 every two families corresponding to have at most one line in common. There are fewer than pairs of lines of that correspond to . Every pair of lines can appear together in at most one line family, and each line family subsumes at least such pairs. Thus, the number of families that correspond to is . By summing up over every , we obtain that .
Since each pair corresponds to points of , we have . Since and each point parameter subsumes families of , we obtain .
We think of a point parameter as corresponding to the 2-flat in defined by and . By Lemma 3.3, a line family is fully contained in a hyperplane in , and two positive families are contained in the same hyperplane if and only if they have the same line parameter. Let be a generic 2-flat in , such that intersects every 2-flat that corresponds to a point parameter in a single distinct point, and that intersects every hyperplane containing a line family at a distinct line. Let be the resulting set of points in and let be the resulting family of lines in . By definition, every point of is incident to lines of . Recalling that , Theorem 1.7 implies that
[TABLE]
Recall that a point parameter is associated with the plane in defined by and . Denote this plane as . There are families with point parameter , each intersecting in a common line in . There are points of in . The intersection lines of the different families are distinct by definition. By the Szemerédi–Trotter theorem, the number of incidences between these points and lines is . Since each line in the imaginary plane corresponds to lines of , the number of incidences in the is
[TABLE]
Note that (10) is identical to (2). In addition, we obtained the exact same bounds for , and as in the proof of Theorem 2.3. We may thus repeat the technical calculation at the end of the proof of Theorem 2.3. We do not repeat the entire calculation here. As in the proof of Theorem 2.3, this leads to . ∎
Proving the bound of Theorem 1.2 for the case where is identical to the proof of Corollary 2.4. Thus, we do not repeat this proof here.
3.3 Adapting Solymosi’s argument to double numbers
We now adapt Solymosi’s sum-product argument [19] to sets of double numbers.
Theorem 3.6**.**
Let be a set of dual numbers with multiplicity , for some . Then
[TABLE]
Proof.
The proof is similar to the proof of Theorem 2.5, with replaced by . Equations (8) illustrate that has the same arithmetic properties we used with . For , we refer to as the parameter of .
For , we define
[TABLE]
In other words, is the number of ways to obtain as the parameter of a product of two elements of , and similarly for .
We repeat the pruning steps of as in the proof of Theorem 2.5, to obtain that every element of has a positive parameter. We then repeat the multiplicative energy calculation from the proof of Theorem 2.5. This implies that exists with such that
[TABLE]
(The multiplicative energy is defined as in Section 2.3.)
Consider the planar point set Since , we have that .
For each let denote the line in defined by . Let be the set of points that satisfy (equivalently, ). By definition, for each of the lines we have . Let be the set of points such that . Note that is in while is in , and that .
The lines are all incident to the origin. In addition, for every and , the point lies in the interior of the wedge formed by and in the first quadrant of . Indeed, if positive satisfy , then . Thus, for any , the sets and are disjoint.
Fix . For any and , we have that unless and . Indeed, for variables , the system has a unique solution. In other words, for any and that satisfy or , we have . Since and since has multiplicity , for each at most pairs satisfy . For each point in we arbitrarily consider one point of that corresponds to it, and denote the resulting set as . Note that and that consists of points with distinct parameters. We claim that . In other words, we claim that every element of can be written as a sum in a unique way. Indeed, for and we clearly have when . If then and have distinct imaginary parts, again implying . This leads to
[TABLE]
The rest of the analysis is a technical calculation identical to the one at the end of proof of Theorem 2.5. We do not repeat this analysis here. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Basit and B. Lund, An improved sum-product bound for quaternions, ar Xiv:1809.02214.
- 2[2] M.-C. Chang, Additive and multiplicative structure in matrix spaces, Comb. Probab. Comput. 16 (2007), 219–238.
- 3[3] C. Chen, B. Kerr, and A. Mohammadi, A new sum-product estimate in prime fields, ar Xiv:1807.10998.
- 4[4] G. Elekes, On the number of sums and products, Acta Arith. 81 (1997), 365–367.
- 5[5] N. Elkies, L. M. Pretorius, and K. J. Swanepoel, Sylvester–Gallai theorems for complex numbers and quaternions, Discrete Comput. Geom. 35 (2006), 361–373.
- 6[6] P. Erdős and E. Szemerédi, On sums and products of integers, Studies in pure mathematics, To the memory of Paul Turán, 213–218, Birkhäuser, Basel-Boston, Mass., 1983.
- 7[7] I. Fischer, Dual-number methods in kinematics, statics and dynamics , CRC press, 2000.
- 8[8] G. W. Gibbons, M. B. Green, and M. J. Perry, Instantons and seven-branes in type IIB superstring theory, Phys. Lett. B 370 (1996), 37–44.
