Let be an integer, and let be a -variable polynomial with real coefficients, such that, for any points in the Cartesian plane,
if and only if they form the vertices of a regular -gon in some order, or are all equal. Determine the smallest possible degree of .
Solution
The smallest possible degree is . In what follows, we will frequently write , and abbreviate to or as a function of any points.
Suppose that is valid. First, we note a key property:
**Claim (Sign of ).** attains either only nonnegative values, or only nonpositive values.
Proof. This follows from the fact that the zero-set of is very sparse: if takes on a positive and a negative value, we can move from the negative value to the positive value without ever having them form a regular -gon — a contradiction.
The strategy for showing is the following. We will animate the points linearly in a variable ; then will have degree at most (assuming it is not zero). The claim above then establishes that any root of must be a multiple root, so if we can show that there are at least roots, we will have shown , and so .
Geometrically, our goal is to exhibit linearly moving points so that they form a regular -gon a total of times, but not always form one.
We will do this as follows. Draw mirrors through the origin, as lines making angles of with each other. Then, any point has a total of reflections in the mirrors, as shown below for . (Some of these reflections may overlap.)
Draw the angle bisectors of adjacent mirrors. Observe that the reflections of form a regular -gon if and only if lies on one of the bisectors.
We will animate on any line which intersects all bisectors (but does not pass through the origin), and let be its reflections. Clearly, these are also all linearly animated, and because of the reasons above, they will form a regular -gon exactly times, when meets each bisector. So this establishes for the reasons described previously.
Now we pass to constructing a polynomial of degree having the desired property. First of all, we will instead find a polynomial which has this property, but only when points with sum zero are input. This still solves the problem, because then we can choose
where is the centroid of . This has the upshot that we can now always assume , which will simplify the ensuing discussion.
We will now construct a suitable as a sum of squares. This means that, if we write , then if and only if , and that if their degrees are , then has degree at most .
Thus, it is sufficient to exhibit several polynomials, all of degree at most , such that points with zero sum are the vertices of a regular -gon if and only if the polynomials are all zero at those points.
First, we will impose the constraints that all are equal. This uses multiple degree 2 constraints.
Now, we may assume that the points all lie on a circle with centre 0, and . If this circle has radius 0, then all coincide, and we may ignore this case.
Otherwise, the circle has positive radius. We will use the following lemma.
Lemma. Suppose that are complex numbers of the same non-zero magnitude, and suppose that , . Then form a regular -gon centred at the origin. (Conversely, this is easily seen to be sufficient.)
Proof. Since all the hypotheses are homogenous, we may assume (mostly for convenience) that lie on the unit circle. By Newton's sums, the -th symmetric sums of are all zero for in the range .
Taking conjugates yields , . Thus, we can repeat the above logic to obtain that the -th symmetric sums of are also all zero for . However, these are simply the -th symmetric sums of (divided by ), so the first symmetric sums of are all zero. This implies that form a regular -gon centred at the origin.
We will encode all of these constraints into our polynomial. More explicitly, write ; then the constraint can be expressed as , where and are real polynomials in the coordinates. To incorporate this, simply impose the constraints and ; these are conditions of degree , so their squares are all of degree at most .
To recap, taking the sum of squares of all of these constraints gives a polynomial of degree at most which works whenever . Finally, the centroid-shifting trick gives a polynomial which works in general, as wanted.
Remark 1. Here is a more detailed approach of the mirror-reflection argument. Let be the polar representation of the point . The polar representations of its mirrored images are then
Clearly, they are all linear with respect to and lie on the circle of radius centred at the origin. As listed above, the images are not necessarily in circular order around the circle. For convenience, assume , so the list now displays them in circular order. These images form the vertices of a regular -gon if and only if the angle between every two consecutive terms in the list (read circularly) is . This is clearly the case if and only if . Consequently, the images are the vertices of a regular -gon if and only if lies on the internal bisector of the angle formed by some pair of consecutive mirrors.
Remark 2. We sketch here some versions of the arguments in the solution above.
To show that , we use the same constancy of sign claim and the convention that the polynomial is a function of points (= pairs of coordinates) . Assume that the values of are all non-negative.
Write . Choose a substitution
Notice that the coordinates of the points are all linear functions in and , so, substituting these expressions into , we get a polynomial with .
Now, the values of are all non-negative (each being one of ), and, on the circle , it vanishes at exactly points, namely, , . We show that these properties already yield .
Obviously, if possesses the properties listed above, then so does , and hence so does .
The polynomial is even in , so it in fact depends only on , and we may plug into it, to obtain a polynomial with which is non-negative on and vanishes on this segment exactly at . These are such points, and, except , they should all be roots of of even multiplicity, due to sign conservation. All in all, this provides roots of , counted with multiplicity, hence , as desired.
For a bit alternative construction of a suitable , one may notice that the Lemma in the above solution can be changed to impose vanishing of the elementary symmetric polynomials , , instead of Newton sums. Indeed, if the all vanish, then so do the polynomials
so also vanishes for . Hence are the roots of , as desired.