The pentagram map, Poncelet polygons, and commuting difference operators
Anton Izosimov

TL;DR
This paper characterizes Poncelet polygons as convex polygons that are projectively equivalent to their pentagram map images, using commuting difference operators and elliptic curve theory.
Contribution
It provides a new characterization of Poncelet polygons in the convex case based on projective equivalence with their pentagram images, employing advanced algebraic and geometric tools.
Findings
Convex polygons projectively equivalent to their pentagram images are Poncelet polygons.
The proof utilizes commuting difference operators and properties of elliptic curves.
The characterization extends previous results relating pentagram maps and Poncelet polygons.
Abstract
The pentagram map takes a planar polygon to a polygon whose vertices are the intersection points of consecutive shortest diagonals of . This map is known to interact nicely with Poncelet polygons, i.e. polygons which are simultaneously inscribed in a conic and circumscribed about a conic. A theorem of R. Schwartz says that if is a Poncelet polygon, then the image of under the pentagram map is projectively equivalent to . In the present paper we show that in the convex case this property characterizes Poncelet polygons: if a convex polygon is projectively equivalent to its pentagram image, then it is Poncelet. The proof is based on the theory of commuting difference operators, as well as on properties of real elliptic curves and theta functions.
Click any figure to enlarge with its caption.
Figure 1| Function | Degree | Order at | Order at | Order at | Order at |
|---|---|---|---|---|---|
| - | 1 | 0 | |||
| - | 0 | 1 |
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.
The pentagram map, Poncelet polygons, and commuting difference operators
Anton Izosimov Department of Mathematics, University of Arizona, e-mail: [email protected]
Abstract
The pentagram map takes a planar polygon to a polygon whose vertices are the intersection points of consecutive shortest diagonals of . This map is known to interact nicely with Poncelet polygons, i.e. polygons which are simultaneously inscribed in a conic and circumscribed about a conic. A theorem of R. Schwartz says that if is a Poncelet polygon, then the image of under the pentagram map is projectively equivalent to . In the present paper we show that in the convex case this property characterizes Poncelet polygons: if a convex polygon is projectively equivalent to its pentagram image, then it is Poncelet. The proof is based on the theory of commuting difference operators, as well as on properties of real elliptic curves and theta functions.
Contents
-
2 Background results: polygons, difference operators, and corner invariants
-
4 Polygons fixed by the pentagram map and commuting difference operators
-
6 Proof of Theorem B: a self-dual polygon fixed by the pentagram map is Poncelet
-
7 Proof of Theorem A: a closed polygon fixed by the pentagram map is Poncelet
1 Introduction
It is a classical result of A. Clebsch [1] that every planar pentagon is projectively equivalent to the pentagon formed by intersections of diagonals of . More precisely, if we label the vertices of and in such way that the ’th vertex of is opposite to the ’th vertex of (see Figure 1), then there is a projective transformation that takes to and respects the labelings.
Furthermore, as was proved by R. Schwartz [22], Clebsch’s theorem is true for all Poncelet polygons with odd number of vertices. Recall that a Poncelet polygon is a polygon which is inscribed in a conic and circumscribed about another conic. In particular, any pentagon is Poncelet, while for -gons with being Poncelet is a non-trivial restriction. Poncelet polygons owe their name to J.-V. Poncelet and his famous “porism” which says that if there exists an -gon inscribed in a conic and circumscribed about a conic , then any point of is a vertex of such an -gon (see Figure 2).
Schwartz’s generalization of Clebsch’s theorem is as follows. Let be an -gon with odd , and let be the polygon whose vertices are the intersections of consecutive shortest diagonals of , i.e. diagonals connecting second nearest vertices. Label the vertices of as in Clebsch’s theorem: the ’th vertex of is opposite to the ’th vertex of (see Figure 3). Assume that is Poncelet. Then there is a projective transformation that carries to and respects the labelings (a weaker result saying that if is Poncelet then is circumscribed about a conic was known to Darboux, see [3, Theorem 2.1]). The goal of the present paper is to show that in the convex setting the converse is also true. More precisely, we prove the converse of Schwartz’s theorem for a broader class of weakly convex polygons. Weak convexity is a technical condition (see Definition 3.1 below) which in particular holds for truly convex polygons.
Theorem A**.**
Let be a weakly convex closed polygon with an odd number of vertices. Let also be the polygon whose vertices are the intersections of consecutive shortest diagonals of , labeled as in Figure 3. Assume that there is a projective transformation that carries to and respects the labelings. Then (and hence ) is a Poncelet polygon.
Combining Theorem A with Schwartz’s theorem, we get the following characterization of weakly convex Poncelet polygons:
Corollary 1.1**.**
Let be a weakly convex closed polygon with an odd number of vertices. Let also be the polygon whose vertices are the intersections of consecutive shortest diagonals of , labeled as in Figure 3. Then is Poncelet if and only if it is projectively equivalent to .
The map taking the polygon in Figure 3 to is known as the pentagram map. It was defined by Schwartz in 1992 [21] but became especially popular in the last decade thanks to the discovery that it is a discrete integrable system [19, 20, 25], and also because of its connections with cluster algebras [8, 7, 9, 11, 5]. Since the pentagram map commutes with projective transformations, it is usually considered as a dynamical system on the space of polygons modulo projective equivalence. Our result can thus be viewed as a description of fixed points of the pentagram map, which has been an open question since Schwartz’s first paper [21].
Remark 1.2**.**
Note that the pentagram map can be considered either on labeled polygons (i.e. polygons with labeled vertices), or on unlabeled ones. Theorem A describes fixed points of the pentagram map on the space of projective equivalence classes of labeled polygons, where the labeling rule is depicted in Figure 3. Although this is not the only possible labeling, it is the only one for which the pentagram map commutes with the action of the dihedral group, and hence the most symmetric of all labelings. A more common, non-symmetric labeling is given by the rule . One can easily see that the only fixed points of the pentagram map with this non-symmetric labeling are regular polygons (again, assuming that the number of vertices is odd). The problem of describing the fixed points of the pentagram map for an arbitrary labeling can also be approached using the techniques of the present paper, but due to the break of symmetry one should not expect an answer as nice as for the symmetric labeling.
Theorem A also has an interpretation in terms of billiards. Indeed, if the conic circumscribed about a Poncelet polygon is confocal to the inscribed conic (which can always be arranged by applying a suitable projective transformation), then can be viewed as a closed trajectory of a billiard ball in the domain bounded by . Conversely, any closed billiard trajectory in a conic is a Poncelet polygon. So, Corollary 1.1 establishes a correspondence between fixed points of the pentagram map and periodic billiard trajectories in conics. Also note that, as shown in [16], the fact that a closed billiard trajectory in a conic is projectively equivalent to its pentagram image is essentially a corollary of integrability of the corresponding billiard system. At the same time, we show that if is projectively equivalent to its pentagram image then the vertices of are contained in a conic. So, one may hope to combine our results with the approach of [16] to show that for any integrable billiard the impact points of a periodic trajectory are contained in a conic, and hence shed some light on the Birkhoff conjecture which says that the only integrable billiards are the ones in conics.
It is also an interesting question whether this correspondence between periodic billiard trajectories in conics and fixed points of the pentagram map extends to higher dimensions. There exists numerous generalizations of the pentagram map to higher-dimensional spaces [7, 12, 13, 4] and one may wonder if their fixed points are related to periodic trajectories of billiards in multidimensional quadrics.
Remark 1.3**.**
We do not know if Theorem A is true with no convexity-type assumptions, but it is for sure not true over complex numbers, as demonstrated by the following example. Let , where , and let be a heptagon in with vertices . Then a direct computation shows that there exists a projective (in fact, even affine) transformation taking to (see also Remark 4.3 below for a conceptual proof). Moreover, for any vertex of and of , the map can be chosen to take to . This means that the projective equivalence class of is fixed by the pentagram map, regardless of the labeling convention used to define the map. However, is not Poncelet. Moreover, it is not even inscribed in a conic. Indeed, the vertices of lie on a semi-cubical parabola , which has at most six intersection points with any conic. So, there exists no conic which contains all seven vertices of .
Theorem A being not true over is one of the reasons one should not expect it to have any kind of “elementary” proof, as such a proof would be valid over any field. Another reason is that the theorem is not true for non-closed polygons (see Remark 1.4 below). Again, if there was a local (i.e. involving only few adjacent vertices) geometric construction producing inscribed and circumscribed conics for based on the projective equivalence between and , such a construction would work no matter whether is closed or not.
We now outline the scheme of the proof of Theorem A. As a first step, we prove the theorem under an additional assumption that the polygon is self-dual. Recall that the dual of a polygon is the polygon in the dual projective plane whose vertices are the sides of the initial one. We label the vertices of the dual polygon as shown in Figure 4. A polygon is self-dual if it is projectively equivalent to its dual.
Under this additional assumption of self-duality, Theorem A is true in a more general setting of twisted polygons, i.e. polygons that are closed only up to a projective transformation. More precisely, a twisted -gon is a sequence such that for a certain projective transformation , called the monodromy.
Theorem B**.**
Let be a weakly convex twisted -gon with odd , and let be as in Theorem A. Assume that is self-dual and projectively equivalent to . Then is a Poncelet polygon.
Remark 1.4**.**
Theorem B is not true without the self-duality assumption (in other words, Theorem A is not true for non-closed polygons). As an example, consider a polygon in whose vertices are given by . This is a twisted -gon for any , weakly convex and projectively equivalent to its pentagram image . However, is not Poncelet (cf. Remark 1.3).
The proof of Theorem B is based on the theory of commuting difference operators, elliptic curves, and theta functions. Given the result of the theorem, the appearance of elliptic curves is not surprising, as their connection to Poncelet polygons is well-known. However, we are not given a priori that is Poncelet, so there should be some other source where the elliptic curve is coming from. In our approach, that source is the theory of commuting difference operators. Namely, we show that a twisted polygon is projectively equivalent to its pentagram image if and only if certain associated difference operators commute (see Section 4). The general theory then says that the joint spectrum of those operators is a Riemann surface , called the spectral curve (see e.g. [15]). Using further that the operators in question are of special form and, in particular, dual to each other (which is a reflection of self-duality of ), we show that the genus of is at most , i.e. is rational or elliptic (see Section 5.1). This is one of the few places in the proof where we use weak convexity in an essential way. Without that assumption, one only seems to be able to conclude that the genus is at most . In particular, it seems possible to construct non-weakly-convex counterexamples to Theorems A and B using genus theta functions.
The next step is to show that our upper bound on the genus of implies that is Poncelet (as a priori there is no connection between the elliptic curve and the one that is classically associated with a Poncelet polygon). More precisely, we show that elliptic spectral curves correspond to generic Poncelet polygons, while rational curves correspond to their degenerations (such as the regular polygon). To that end, we express coordinates of vertices of in terms of certain meromorphic functions on the spectral curve . One ends up with elementary functions or theta functions, depending on whether the curve is rational or elliptic. In both cases, using relations between those functions (e.g. Riemann’s relation in the elliptic case), one shows that is a Poncelet polygon, so Theorem B holds (see Section 6.1 for the rational case and Section 6.2 for the elliptic case). Furthermore, in the elliptic case the spectral curve turns out to be isogenous to the elliptic curve attached to due to its Poncelet property.
After that, we proceed to prove Theorem A. To that end, we first show that the self-duality assumption of Theorem B is not too restrictive. Namely, given a polygon that is projectively equivalent to its pentagram image, it can be what is called rescaled so that it becomes self-dual. This rescaling (closely related to the notion of spectral parameter) is a one-parametric group of transformations of the moduli space of twisted polygons which preserves weak convexity but not closedness. So, starting with a closed polygon as in Theorem A, we rescale it to a non-necessarily closed, but self-dual, weakly convex polygon, which is the setting of Theorem B. This way, we conclude that a weakly convex closed polygon projectively equivalent to its pentagram image is Poncelet up to rescaling. The last step is to show that this rescaling must actually be trivial. To that end, we show that no non-trivial rescaling of a weakly convex Poncelet polygon is closed. In the rational case, this is proved by an elementary argument (see Section 7.2), while the elliptic case requires careful analysis of the real part of the spectral curve (see Section 7.3). In the latter case, the proof once again essentially relies on weak convexity.
In addition to proofs of Theorems A and B, the paper contains an appendix (Section 8) where we establish an auxiliary result on correspondence between dual difference operators and dual polygons. Although that result seems to be well-known, we could not find a proof in the literature that does not rely on a computation. So, we provide a proof here.
We tried to make the exposition self-contained. In particular, we do not assume that the reader is familiar with the general theory of integrable systems or commuting difference operators. Only basic knowledge of Riemann surfaces is assumed.
Acknowledgments. The author is grateful to Boris Khesin, Valentin Ovsienko, Richard Schwartz, and Sergei Tabachnikov for fruitful discussions. Some of the figures were created with help of software package Cinderella. This work was supported by NSF grant DMS-2008021.
2 Background results: polygons, difference operators, and corner invariants
This section is an overview of mostly well known results on the relation between difference operators and polygons. Namely, we give an introduction to difference operators in Section 2.1, after which we connect them to polygons in Section 2.2. Note that while the description of the moduli space of polygons in terms of difference operators is well-known, our point of view is slightly different from the standard one. In particular, we identify the space of polygons with a certain quotient of the space of third order difference operators, as opposed to the standard approach in which one identifies polygons with a certain subspace of that space. In that respect, our approach is close to that of [2]. In addition, we provide, in Section 2.3, another description of the polygon space, in terms of so-called corner invariants. Note that while corner invariants per se are not heavily used in the paper, they are needed to define weakly convex polygons and rescaling. Rescaling is also defined in Section 2.3, while weakly convex polygons are discussed in the next Section 3.
2.1 A primer on difference operators
This section is a brief introduction to the elementary theory of difference operators. Our terminology mainly follows that of [26]. Let be the vector space of bi-infinite sequences of real numbers. For and any , let be the ’th entry of the sequence , so that . Let also be integers. A linear operator is called a difference operator supported in if it can be written as
[TABLE]
where for every and every . In matrix terms, this can be rewritten as
[TABLE]
so difference operators can be equivalently described as those whose matrices are finite band (i.e. have only finitely many non-zero diagonals). Furthermore, denoting, for every , the sequence of ’s by , formula (1) can be rewritten as
[TABLE]
where is the left shift operator , and each acts on by term-wise multiplication.
The order of difference operator (1) is the number . Difference operator (1) is called properly bounded if and for every . Clearly, for a properly bounded difference operator one has Sequences , where , form a basis in if and only if the associated difference Wronskian
[TABLE]
where stands for the determinant of the matrix , is non-vanishing for some . This is equivalent to non-vanishing of for any due to the relation
[TABLE]
Along with , difference operators naturally act on the space of bi-infinite sequences of vectors in . The case is of particular interest. Let , where , be a solution of the difference equation . Define scalar sequences by setting to be equal to the ’th coordinate of . We say that is a fundamental solution if the sequences form a basis in . As follows from the Wronskian criterion, a solution of is fundamental if and only if the vectors are linearly independent for some (equivalently, for all) .
A difference operator is -periodic if its coefficients are -periodic in the index . This is equivalent to saying that commutes with the ’th power of the shift operator: , so the kernel of an -periodic operator is invariant under the action of . The finite-dimensional operator is called the monodromy of . Note that the eigenvectors of the monodromy are exactly scalar quasi-periodic solutions of the equation , i.e. solutions which belong to the space
[TABLE]
for some .
The monodromy can also be understood in terms of fundamental solutions. Namely, notice that any two fundamental solutions of are related by , where acts on by term-wise multiplication. Furthermore, if is a fundamental solution of an -periodic operator , then so is , which means that for some . In other words, we have for every , which means that the fundamental solution of a periodic difference operator is always quasi-periodic. Furthermore, the matrix can be easily seen to be the transpose of the monodromy matrix of , written in the basis of associated with the fundamental solution . In particular, this implies that the Wronskian of an -periodic operator satisfies . Combined with (9), the latter formula gives the following expression for the determinant of the monodromy, which will be used several times throughout the paper:
[TABLE]
The dual of the operator (8) is defined by
[TABLE]
where . In other words, is the formal adjoint of with respect to the inner product on , i.e. whenever at least one of these inner products is well-defined. In the periodic case, the duality between and can also be understood as follows. If is an -periodic operator, then is -periodic as well. Furthermore, the formula
[TABLE]
defines an inner product on the space of -periodic sequences, and the restrictions of and to are dual to each other with respect to this inner product. More generally, for every , the restriction of to is dual to the restriction of to with respect to the pairing between and given by the same formula (12). As a corollary, we have
[TABLE]
In particular, a non-zero number is an eigenvalue of the monodromy of if and only if is an eigenvalue of the monodromy of .
2.2 Difference operators and polygons
In this section we describe the space of projective equivalence classes of planar polygons as a certain quotient of third order difference operators.
Definition 2.1**.**
A polygon in is a bi-infinite sequence of points satisfying the following -in-a-row condition: for every the points are in general position.
Polygons modulo projective transformations can be encoded by means of properly bounded third order difference operators, i.e. operators of the form
[TABLE]
where are such that , for any .
Proposition 2.2** (cf. Proposition 4.1 of [19]).**
For any , there is a one-to-one correspondence between projective equivalence classes of planar polygons and properly bounded difference operators supported in , considered up to the action , where are sequences of non-zero real numbers, acting on by term-wise multiplication.
Proof.
Given a properly bounded difference operator supported in , consider its fundamental solution , which is a sequence of non-zero vectors in (see Section 2.1). Each term of that sequence determines a point with homogeneous coordinates given by . Furthermore, since is a fundamental solution, the vectors , , are linearly independent, and thus the sequence satisfies the -in-a-row condition. Notice also that since the fundamental solution is unique up to a linear transformation , it follows that the polygon is well-defined up to projective equivalence. Thus, with each properly bounded difference operator supported in one can associate a polygon , defined up to a projective transformation. Conversely, given a polygon , one can revert this construction to obtain a properly bounded difference operator supported in . To that end, one first lifts every point to a vector , and then finds an operator whose fundamental solution is given by . Since the lifts of the points are unique up to a transformation , while the choice of an operator with a given fundamental solution is unique up to , where , it follows that the operator corresponding to a given polygon is defined up to the action , as desired. ∎
In what follows, we will be interested in closed and, more generally, twisted polygons. A closed -gon is a polygon satisfying for every . For such a polygon, the corresponding difference operator can be chosen to be -periodic. The converse is, however, not true: polygons corresponding to periodic operators are, in general, not closed but twisted. Indeed, if is a periodic operator, then its fundamental solution is in general not periodic but satisfies , where is the transposed monodromy of . Therefore, the corresponding polygon satisfies , where is the projective transformation determined by the linear operator .
Definition 2.3**.**
A twisted -gon in is a polygon which satisfies for some projective transformation , called the monodromy of the polygon.
The above construction (see the proof of Proposition 2.2) allows one to identify the space of projective equivalence classes of twisted -gons with an appropriate quotient of the space of -periodic properly bounded difference operators supported in . Under this identification, closed polygons correspond to those operators whose monodromy is a scalar multiple of the identity (furthermore, one can arrange that the monodromy of an operator corresponding to a closed polygon is exactly the identity).
Remark 2.4**.**
One can adapt the proof of Proposition 2.2 to show that for every there is a one-to-one correspondence between projective equivalence classes of twisted planar -gons and properly bounded -periodic difference operators supported in , considered up to the action , where are sequences of non-zero real numbers which are -quasi-periodic and have the same monodromy. In other words, one has for some where the space is defined by (10). We will not use the result in this form in the paper, so we omit the proof.
We also mention that when is not divisible by , the above described action of quasi-periodic sequences on difference operators admits a section given by -periodic operators of the form This is essentially the content of [19, Proposition 4.1]. As a result, the entries of periodic sequences , constitute a global coordinate system on the space of projective equivalence classes of twisted planar -gons. Such a coordinate system is no longer available when is divisible by , however our description of the twisted -gons space as a quotient remains valid.
Dual difference operators correspond to projectively dual polygons. Recall that the dual of a polygon is the polygon in the dual projective plane whose vertices are the sides of the initial one. Note that while there is, in general, no canonical way to label the vertices of the dual polygon, polygons with odd number of vertices admit one particular labeling which is more symmetric than the others. This labeling is depicted in Figure 4. For closed polygons, such labeling makes projective duality an involution. For twisted polygons, it is only an involution up to the action of the monodromy, but still an actual involution on projective equivalence classes.
Definition 2.5**.**
Let be a closed or twisted -gon with odd . Then the ’th vertex of its dual polygon is the side of which joins the vertices with indices , . A polygon is called self-dual if it is projectively equivalent to its dual polygon .
Remark 2.6**.**
Closed self-dual polygons are studied in [6]. In that paper, polygons which are self-dual in the sense of Definition 2.5 are called -self-dual (where is the number of vertices).
With our definition of duality, we have the following:
Proposition 2.7**.**
Let be odd. Consider a -periodic properly bounded difference operator supported in and its dual operator Then the polygons corresponding to and are dual to each other in the sense of Definition 2.5.
Proof.
This follows from more general Proposition 8.1 in the appendix. ∎
2.3 Corner invariants and rescaling
Another description of the space of polygons modulo projective transformations is by means of so-called corner invariants [23, 19]. To every vertex of a polygon, one associates two cross-ratios , as shown in Figure 5. The definition of the cross-ratio that we use is
[TABLE]
Remark 2.8**.**
Note that the definition of requires somewhat more than the -in-a-row condition. However, we do not need to care about this, since in this paper we will only be dealing with weakly convex polygons (see Definition 3.1 below) for which the numbers are well-defined by definition.
Clearly, the sequences , only depend on the projective equivalence class of the polygon. Furthermore, in the twisted case these sequences are -periodic, and is a coordinate chart on an open dense subset of twisted -gons modulo projective transformations. Therefore, since the pentagram map preserves the space of twisted polygons and commutes with projective transformations, it can be written in terms of the coordinates. The following formulas are obtained in [19]:
Proposition 2.9**.**
One has
[TABLE]
where are the corner invariants of the polygon , and are corner invariants of its pentagram image .
Here we label as in [19]. The labeling used in Figure 3 leads to the same formulas with a certain shift of indices. Although we will never use these explicit formulas, we will use the following corollary: the pentagram map, with any labeling of vertices, commutes with the -parametric group of transformations given by
[TABLE]
These transformations are known as rescaling. They were introduced in [19] to prove that the pentagram map is a completely integrable system.
We now discuss the relation between two representations of the space of polygons: in terms of difference operators, and in terms of corner invariants.
Proposition 2.10**.**
Assume we are given a polygon defined by a difference operator (13) supported in . Then the corner invariants of are given by
[TABLE]
Proof.
The proof is a computation following the lines of the proof of Lemma 4.5 in [19]. ∎
Formulas (16) allow one to describe rescaling operation (15) in terms of difference operators:
Corollary 2.11**.**
In terms of difference operators, rescaling (15) can be defined as
[TABLE]
Proof.
Formulas (16) show that multiplying and coefficients by is equivalent to multiplying variables by and variables by , which is exactly rescaling (15). ∎
Remark 2.12**.**
Note that since there are many operators corresponding to a given polygon, there are also many different ways to define the rescaling on operators. For example, the following formula defines the same operation on polygons as the formula provided above:
[TABLE]
3 Weakly convex polygons
In this section we define weakly convex polygons and describe their properties needed to prove Theorems B and A.
Definition 3.1**.**
A polygon is weakly convex if its corner invariants are well-defined and satisfy
[TABLE]
Proposition 3.2**.**
Convex polygons are weakly convex.
Proof.
For convex polygons, the collinear points , , , in Figure 5 are distinct and their cyclic order is exactly as shown. So, is well-defined and . Likewise, we have . The result follows. ∎
Remark 3.3**.**
More generally, all corner invariants of a polygon satisfy if and only if any five consecutive vertices of that polygon form a convex pentagon (where by a convex pentagon in we mean a pentagon which is convex in a suitable affine chart). So, all polygons satisfying this “5-in-a-row” condition are weakly convex. The geometric meaning of the general weak convexity condition is not that clear. However, it turns out to be really convenient for the purposes of the present paper.
The following is an exhaustive list of properties of weakly convex polygons needed for our purposes:
Proposition 3.4**.**
Assume that is a closed or twisted weakly convex -gon, where is odd. Then:
The corresponding third order -periodic difference operator (13) can be chosen in such a way that for all we have
[TABLE] 2. 2.
For any difference operator (13) corresponding to and satisfying (17), consider the operators Then the monodromies of these operators (which are real numbers because the operators are of first order) satisfy . In particular, we have . 3. 3.
Any polygon obtained from by means of rescaling (15) with is weakly convex. 4. 4.
Any polygon obtained from by means of rescaling (15) with has monodromy with distinct eigenvalues.
Proof.
To prove the first statement, consider the corner invariants of , and let
[TABLE]
Then, by Proposition 2.10, the polygon associated with is . Furthermore, the signs of coefficients of satisfy (17), as needed.
To prove the second statement, consider an arbitrary operator (13) representing and satisfying (17), along with the associated operators . Then, by formula (11), the monodromies of those operators are given by
[TABLE]
so due to (17) and being odd. Further, using formulas (16), we get
[TABLE]
where are the corner invariants of . But since is weakly convex, we have and thus . This in turn implies , because non-zero elements of the kernel of are sequences with monodromy , while non-zero elements of the kernel of are sequences with monodromy . Thus, the second statement is proved.
The third statement is obvious from the definitions of weak convexity and rescaling, so we proceed to the fourth statement. Let be a polygon obtained from by means of rescaling with . Then the corner invariants of satisfy , . To show that the monodromy of such a polygon has distinct eigenvalues, we use a result from the appendix to [10] which says the monodromy of a twisted -gon with corner invariants is conjugate to the product , where
[TABLE]
Notice that since and , the matrices are non-negative. Furthermore, the product of at least three such matrices is positive, so the matrix is positive. Therefore, by the Perron-Frobenius theorem, has a real positive eigenvalue such that its any other eigenvalue satisfies . Furthermore, since and is odd, we have , so the product of two other eigenvalues of is negative, which means that they are real and distinct. The result follows.∎
4 Polygons fixed by the pentagram map and commuting difference operators
In this section we show that a closed or twisted polygon projectively equivalent to its pentagram image gives rise to commuting difference operators. This is the first step in the proof of both Theorem A and Theorem B. In addition, in the self-dual case (i.e. in the setting of Theorem B) we show that those commuting operators are negative duals of each other.
Let be a closed or twisted -gon with odd , and let be the image of under the pentagram map, labeled as in Figure 3. Then, as explained in Section 2.2, one can encode by means of a difference operator of the form
[TABLE]
The coefficients of this operator are related to the polygon by means of the equation
[TABLE]
where ’s are lifts of the vertices of .
Proposition 4.1**.**
The vector
[TABLE]
is the lift of the vertex of .
Proof.
Indeed, we have
[TABLE]
which means that the projection of to is the intersection point of the lines and . By definition of the pentagram map with our labeling convention, this is exactly the vertex of , as desired. ∎
Now, as in Proposition 3.4, consider the operators
[TABLE]
By Proposition 4.1, these operators take the lifts of the vertices of to the lifts of the vertices of .
Proposition 4.2**.**
Assume that a closed or twisted -gon (where is arbitrary) is projectively equivalent to its pentagram image . Then:
One can choose the -periodic operator of the form (19) associated with in such a way that the corresponding operators given by (20) commute:
[TABLE] 2. 2.
Furthermore, if is weakly convex and is odd, then can be chosen to satisfy the alternating signs condition (17). 3. 3.
If, on top of that, is self-dual, then , may be chosen to be negative duals of each other (up to multiplication by ):
[TABLE]
Equivalently, the operator can be chosen to be anti-self-dual (again, up to multiplication by ):
[TABLE]
Proof of Proposition 4.2.
We begin with the first statement. Take an arbitrary -periodic operator of the form (19) representing the polygon . Then, since is projectively equivalent to , there is a fundamental solution of such that the projection of to is the ’th vertex of . Consider the projective transformation taking to . Any lift of this projective transformation will then take the sequence to a sequence of lifts of vertices of . On the other hand, by Proposition 4.1, lifts of vertices of are given by the sequence . So, there is an -periodic sequence of non-zero real numbers such that where acts on sequences of vectors by term-wise multiplication. Let . Then the operator still satisfies and hence represents the same polygons and . Furthermore, the corresponding operator satisfies Applying the operator to both sides, we get Also taking into account that , this can be rewritten as
[TABLE]
At the same time, we have
[TABLE]
so (22) gives
[TABLE]
Now it remains to notice that the commutator is of the form so equation (23) is equivalent to which, in view of the -in-a-row condition for (which holds because it holds for ), gives and thus as desired.
To prove the second statement, one repeats the same argument, with the only modification that the initial operator should be chosen to satisfy (17), which can be done by the first statement of Proposition 3.4. Then the coefficients of the operator satisfy . Furthermore, we claim that ’s are all of the same sign. Indeed, using explicit formulas (20) for and and equating the coefficients of in (21), we get
[TABLE]
Furthermore, we have for any , so taking the signs of both sides of (24) we get
[TABLE]
which means that the sequence is -periodic. But since the period of the sequence is an odd number, it follows that . Now, multiplying by is necessary, we can arrange that for all , so that has satisfies (17), as needed.
To prove the third statement, we consider the operator constructed above and show that if is self-dual, then can be replaced with another operator, which has all the properties of and is, in addition, anti-self-dual. To that end, observe that if is self-dual, then the operators and represent the same polygon, so
[TABLE]
for certain sequences of non-zero real numbers. Taking the duals, we get
[TABLE]
which implies . Further, since satisfies (17), the corresponding coefficients of and are of opposite sign, so (25) implies , and we must have . Therefore,
[TABLE]
where and without loss of generality we can assume . Furthermore, since both operators , are -periodic, the sequence is quasi-periodic, i.e. for some (actually, ). Now, let . Then the sequence is also quasi-periodic, so the operator is -periodic. Moreover, it has all the properties of and is anti-self-dual. Thus, the proposition is proved. ∎
Remark 4.3**.**
It is easy to see from the proof that the converse of the first statement is also true: if and commute, than is projectively equivalent to . For instance, consider the polygon from Example 1.3. The vertices of that polygon can be lifted to vectors , where . The sequence is annihilated by a difference operator with constant coefficients, namely by , where are such that the roots of the corresponding characteristic equation are , , and . Therefore, the associated operators and also have constant coefficients and hence commute. So, the polygon is indeed projectively equivalent to its pentagram image .
5 The spectral curve
The results of this section are central to the proof of Theorem B (and will also be used to derive Theorem A from Theorem B). Namely, in Section 5.1 we consider the joint spectrum of the commuting difference operators , constructed above (see Section 4), the so-called spectral curve, and show that the genus of that curve is at most . We note that this estimate on the genus is not predicted by the general theory of commuting difference operators. It seems that the best bound one can get from the general theory is . Proving the estimate requires somewhat more careful analysis of the field of meromorphic functions. Also note that even the result is still insufficient to prove Theorem B. Another important ingredient of the proof is the so-called eigenvector function, which encodes the joint eigenvectors of the commuting operators , . We study that function in Section 5.2 and in particular prove that it has very few poles.
5.1 The spectral curve and a bound on its genus
In this section, we construct the spectral curve associated with commuting difference operators , given by Proposition 7.1 and discuss its properties, in particular prove that its genus is at most .
Remark 5.1**.**
Note that instead of defining the spectral curve using commuting difference operators, we could have done this using the Lax representation, as in [25]. However, at the end of the day these two definitions turn out to be equivalent to each other (see Remark 5.14 below). Furthermore, even if we defined the spectral curve using the Lax representation, we would still need commuting difference operators to establish the properties of the curve that we need. So, all in all, these two approaches are equivalent, and our choice is just a matter of convenience.
Remark 5.2**.**
A different notion of a spectral curve corresponding to a difference operator (and hence a polygon) is defined in [14]. In our terminology, it is the spectral curve corresponding to commuting difference operators , where is a difference operator supported in associated with a given polygon. Since the operator does not, generally speaking, commute with and , the corresponding spectral curve seems to have no relation to ours.
Assume that is a weakly convex twisted -gon, self-dual and projectively equivalent to its pentagram image. Then, by Proposition 4.2, we have an -periodic operator which commutes with its dual. For notational convenience, we define
[TABLE]
Periodicity of these operators means that they also commute with . Therefore, we have a whole algebra of commuting operators, generated by , , and (to preserve the left-right symmetry, it is natural to include in too, so that ). To such an algebra , one can always associate an algebraic curve. This curve may be constructed using any two generic elements of . As such elements, we pick the operators and the product . This choice is motivated by a particularly simple form of the operator . Namely, that operator is self-dual and supported in :
[TABLE]
where are -periodic sequences, and for any .
Definition 5.3**.**
The affine spectral curve is the joint spectrum of and :
[TABLE]
In other words, a point is in if and only if is an eigenvalue of the restriction of to the space defined by (10).
To obtain an explicit equation of the affine spectral curve , take a basis in determined by the condition for . In this basis, the matrix of the operator is almost tridiagonal, with two additional elements in the upper-right and bottom-left corners:
[TABLE]
The affine spectral curve is the zero locus of the characteristic polynomial of (27), which, up to the factor , reads
[TABLE]
for a certain polynomial of degree . In particular, the spectral curve is algebraic, as predicted by the general theory of commuting difference operators.
Proposition 5.4**.**
The affine spectral curve is irreducible.
Proof.
This curve is the zero locus of the polynomial (28), which is irreducible whenever is non-constant. ∎
We now define the spectral curve as the Riemann surface corresponding to the affine curve . In other words, is the unique Riemann surface biholomorphic to away from a finite number of points. The existence of such a Riemann surface is guaranteed by Riemann’s theorem. It can be obtained from by means of normalization (which we actually explicitly construct in Remark 5.23 below), followed by compactification. Since is irreducible (Proposition 5.4), it follows that is connected. Furthermore, the Riemann surface comes equipped with:
- •
two meromorphic functions and , obtained from coordinate functions on , and satisfying the equation , with given by (28);
- •
a holomorphic involution , coming from the involution on , and satisfying and .
Proposition 5.5**.**
The degrees of the functions and on are equal to and respectively.
Proof.
Since the polynomial in (28) has degree , the equation has solutions in terms of for generic . So, the degree of on is . Likewise, the number of solutions of in terms of is for generic , so the degree of is . ∎
Since is a function of degree , and is a non-trivial involution preserving , it follows that interchanges the two points in any level set of . In particular, the fixed points set of coincides with the set of branch points of , i.e. points where . At the end of this section we will show that the number of such branch points is at most , which implies, by the Riemann-Hurwitz formula, that the genus of is at most . But first we need to discuss in detail the analytic properties of the functions and , as well as of some other functions on which we introduce below.
Proposition 5.6**.**
The Riemann surface is obtained from the normalization of by adding two points , interchanged by the involution . The point is a zero of order for the function , while is its pole of order . Both points are simple poles of the function .
Proof.
Let be the normalization of . This set can be described as the preimage of under the map . Also note that the image of under the latter map is precisely the closure of in , which consists of and the points and . So, the image of under the map is two points and . This means, first, that any point in is a pole of , and second, that there are at least two such points. But since has degree (Proposition 5.5), it follows that consists of exactly two points, and that these points are simple poles of . Furthermore, at one of these points, which we denote by , we have , while at the other one, which we call , we have . Finally notice that since all points of except belong to , it follows that does not have zeros or poles except for . So, is a zero of of order , while is a pole of order , as desired. ∎
Denote also by the two zeros of the function on . A priori, these two points may coincide, but later on we will show that they are distinct (see the proof of Proposition 5.18). Table 1 summarizes information about the orders of the functions and at the points , (recall that the order of a meromorphic function at a point is equal to if has a zero of order at , if has a pole of order at , and [math] otherwise). Also note that the order of and at any other point of is equal to [math]. The table also contains information about functions and , which we introduce below.
Proposition 5.7**.**
The pair , of commuting difference operators is of rank , which means that the generic common eigenspace of these operators is -dimensional.
Proof.
As follows from the explicit form (28) for the characteristic polynomial of the matrix (27), for generic that matrix has distinct eigenvalues and hence one-dimensional eigenspaces. ∎
For a generic point , let be the corresponding common eigenvector of and , normalized by the condition .
Proposition 5.8**.**
The components of extend to meromorphic functions on . The corresponding vector-function on satisfies the equations
[TABLE]
Proof.
For , let be the first row of the comatrix of , where is given by (27). Extend to a bi-infinite sequence by the rule . Then is a common eigenvector of and : , Furthermore, the components of are, by construction, rational functions of and . So, to obtain the desired function , it remains to normalize : Note that does not vanish identically on , because is a polynomial in which is linear in and hence cannot be divisible by the defining polynomial of . So, is a well-defined rational vector-function of , and hence a meromorphic function on . ∎
We call the vector-function the eigenvector function. Its analytic properties are studied in detail in the next Section 5.2.
Remark 5.9**.**
Note that at every point , the vector-function is meromorphic in the following strong sense: there exists a local holomorphic function such that is holomorphic at . Moreover, the function can chosen in such a way that does not vanish. Therefore, the value of the function at any point determines a direction in the infinite-dimensional projective space , regardless of whether the components of are finite or infinite (note also that this direction does not change if we replace our particular normalization by any other normalization). This, is however, not true at the points . At those points, the components of are still meromorphic, but the order of the pole of is an unbounded function of (see Proposition 5.21 below), so there exists no such that is holomorphic. In particular, the value of at does not determine any direction.
We now show that every operator from the commutative algebra gives rise to a meromorphic function on , which is holomorphic everywhere except possibly the points and satisfies In particular, the assignment is a homomorphism from to the algebra of meromorphic functions on which are holomorphic in . We already have and , so it remains to construct the functions and (of course, one of them determines the other, since their product must be equal to ). We denote these functions by and :
Proposition 5.10**.**
There exist meromorphic functions on which are holomorphic in and satisfy Furthermore, we have .
Proof.
By Proposition 5.7, a generic common eigenspace of and is one-dimensional, and is therefore generated by the vector , evaluated at the corresponding point of the Riemann surface . For this reason, since the operator commutes with and , at generic points of we must have
[TABLE]
for certain numbers depending on the point of . Furthermore, since the left-hand side of (30) is a meromorphic vector-function on , and so is , it follows that the functions also extend to meromorphic functions on the whole of . Moreover, given a point , renormalizing if necessary we can assume that is finite and non-zero (see Remark 5.9). But then (30) implies that the functions are holomorphic at . Finally, the equation follows directly from (30) and the second of equations (29). ∎
Proposition 5.11**.**
We have .
Remark 5.12**.**
The existence of the involution on is due to the invariance of the algebra under operator duality: . So, since , it is only natural that .
Proof of Proposition 5.11.
It suffices to show that , where is a generic pair of points interchanged by . Since the points are generic, one can assume that the vectors are finite. Under this assumption, we have Furthermore, we have , where . So, using the pairing (12) between and , we get
[TABLE]
So, to complete the proof, it suffices to show that . To that end, observe that belongs to the kernel of the operator , where , and, in the generic case, spans that kernel. So, the orthogonal complement to with respect to the pairing (12) is the image of the dual operator
[TABLE]
But for generic the operator has simple spectrum on and is, therefore, diagonalizable, which in particular implies
[TABLE]
Therefore, we have , as desired. ∎
Now, define a meromorphic function on by the formula
[TABLE]
This function does not correspond to any difference operator but can be thought of as corresponding to a pseudo-difference operator . Accordingly, the function satisfies the equation
[TABLE]
Recall that the operator on the left-hand side encodes the family of polygons obtained from by means of rescaling (15).
Proposition 5.13**.**
The function has degree . There exist three distinct points on at which . The function takes three distinct values at those points.
Proof.
We first show that . Let belong to the level set . Then, for generic , these points correspond to distinct points on the affine spectral curve . This, in particular, means that the vectors are linearly independent (as joint eigenvectors of and corresponding to distinct eigenvalues). But
[TABLE]
so , and the degree of is at most , as desired.
We now show that there exist three distinct points on at which , which, in turn, implies that the degree of is exactly . Since the polygon , given by the operator , is weakly convex, it follows from the fourth statement of Proposition 3.4 that the monodromy of has simple spectrum. This means that there exist three distinct numbers such that the operator has non-trivial (and hence one-dimensional) kernel on . Let be the generator of that kernel. Then, since the operator commutes with and , it follows that is also an eigenvector of , corresponding to some eigenvalue . Then the three points belong to the affine spectral curve , and thus give rise to at least three points with , . We now claim that . Indeed, the vector spans the joint eigenspace of and . Therefore, at each of the points , we have , where (here we assume here that the vectors are finite, which can be always arranged by multiplying by an appropriate meromorphic function, see Remark 5.9). So, by construction of the vectors we have
[TABLE]
On the other hand,
[TABLE]
so
[TABLE]
Notice also that cannot be a common zero of and , because that would imply , which is not possible by the second statement of Proposition 3.4 (the latter applies to since , ). Furthermore, cannot have a pole at by Proposition 5.10. But then (34) implies , as desired. ∎
Remark 5.14**.**
It follows from Proposition 5.13 that the function has the following meaning. Fix some generic . Then there are three points in with . Furthermore, the vectors belong to . So, is the spectrum of the monodromy of . In other words, if we consider a meromorphic mapping given by the functions , then its image belongs to the algebraic curve
[TABLE]
Using also that and , it is easy to show that the mapping is generically biholomorphic. So, is just another affine model of the spectral curve . This model can be thought of as the joint spectrum of the operators and (the latter is well-defined on a generic eigenspace of ). Furthermore, since the operator corresponds to the polygon , where is the rescaling action (15), it follows that can be regarded as the graph of the spectrum for the monodromy of . As explained in [10], this definition of the spectral curve coincides with the one used in [25] to prove algebraic integrability of the pentagram map. So, as a Riemann surface, our spectral curve is isomorphic to the one of [25].
We are now in a position to prove the main result of the section:
Proposition 5.15**.**
The genus of satisfies .
Proof.
The function on is a -fold ramified covering of the Riemann sphere whose branch points coincide with fixed points of the involution . To estimate the number of such fixed points, notice that from Proposition 5.11 and formula (32) it follows that . Thus, at each fixed point of we must have . Furthermore, by Proposition 5.13, the function takes three distinct values at points of where , and since the set is invariant under the involution which takes to , it follows that those values must be of the form , where . So, must have exactly one fixed point at the level set . In addition to that, it may have up to three fixed points at the level set , which is up to four fixed points in total. Now, the desired inequality for the genus follows from the Riemann-Hurwitz formula. ∎
Remark 5.16**.**
In fact, since the values of at points where are the eigenvalues of the monodromy of , it follows from formula (11) that they are of the form . Another way to see this is to notice that by Proposition 5.11 at fixed points of we must have and thus (here we use that the functions do not have common zeros and also do not have poles in ). This also implies that if has genus , then at points where . In other words, all eigenvalues of the monodromy of the polygon are equal to . Later on, we will see that this monodromy is in fact the identity. In other words, if the spectral curve is elliptic, then in the setting of Theorem B the polygon must be closed (see Remark 6.9).
Remark 5.17**.**
Note that without weak convexity (used to prove Proposition 5.13) we would not be able to say that there is just one fixed point of the involution at the level . In that case, nothing seems to prevent from having six fixed points, which means that may be a genus curve. Thus, it should be possible to construct a counterexample to Theorems A and B in the non-weakly-convex case using genus curves and their associated genus theta functions.
Another way to obtain the estimate is to use the existence on of meromorphic functions of degree and (namely, and ). However, this does not guarantee the estimate obtained above.
We finish this section with two additional results on the spectral curve which will be useful later on.
Proposition 5.18**.**
The degrees of the functions and their orders at points are as shown in Table 1.
Proof.
Since for any the degree of operators is , an argument analogous to the one we used to show that (see the proof of Proposition 5.13) gives . Further, let . Then, since (see Table 1), the equation implies
[TABLE]
Furthermore, using that and equation (32), we get
[TABLE]
so
[TABLE]
and since , we must have , which implies . On the other hand, we know that , and from (37) it follows that is even. So, we must have , which, along with (37) implies and thus . Similarly, adding up (35) and (36), we get . Analogously, replacing the point with , we find the orders of and at , as well as the degree of (one can also use that and ).
It now remains to find the orders of the functions and at the points . To that end, we first show that . Assume, for the sake of contradiction, that . Then is a double zero of the function . Furthermore, we have , and both and are holomorphic and have at worst a simple zero at (indeed, these functions have degree and zeros of order at the points and respectively). So, both and must have a simple zero at . But then, from the definition (32) of the function it follows that it does not have a zero at . Furthermore, cannot have zeros at other points of , because the only zero of in that domain is the point . But this means that has just two zeros counting with multiplicities, which is impossible since . Therefore, we must have that .
Now, the relation implies that at both points one of the functions has a simple zero, while the second one does not have a zero or a pole. Without loss of generality, assume that and thus . Then , and by formula (32) we get . Furthermore, from and it follows that , , and . Finally, notice that the functions and do not have zeros or poles other than the points , because for each of them the total number of zeros and poles at those points (counting with multiplicities) coincides with the degree. Thus, the proposition is proved. ∎
Proposition 5.19**.**
The affine spectral curve is a nodal curve (i.e. all its singularities are double points).
Proof.
The affine spectral curve is the zero locus of the characteristic polynomial of the matrix (27). Computing the differential of that polynomial, we get that is singular if and only if and is a multiple root of . Furthermore, computing the Hessian, we get that a singular point is a double point if and only if is a double root of . But for the matrix (27) is symmetric (equivalently, the restriction of the operator to is self-adjoint), so the multiplicity of the root of its characteristic polynomial is equal to the dimension of the corresponding eigenspace, which is
[TABLE]
So indeed all singular points of are double points. ∎
Remark 5.20**.**
It is easy to see that the genus of the normalization of is equal to where is the number of double points of . Furthermore, as can be seen from the proof of Proposition 5.19, double points of correspond to double roots of the polynomials . The polynomial is of degree , so each of those polynomials may have at most double roots. Therefore, is rational when each of the polynomials has precisely double roots (and, in addition, one simple root). Likewise, is elliptic when one of the polynomial has double roots, while the second one has double roots. Using Remark 5.16 one can show that it is the polynomial that has double roots.
5.2 The eigenvector function
In this section, we study in detail the analytic properties of the meromorphic vector-function constructed in Proposition 5.8. This will allow us to obtain analytic formulas for coordinates of vertices of the polygon (see Section 6.1 for the rational case and Section 6.2 for the elliptic case). We keep all the notation of Section 5.1.
Proposition 5.21**.**
We have .
Proof.
Let . We need to show that for every . Note that since . So it suffices to show that is a constant sequence. Also note that since and has a zero of order at (see Table 1), the sequence is -periodic. So, if it is not constant, then there must exist such that . But since is the eigenvector of the operator (26) with eigenvalue , we have
[TABLE]
Since is a non-vanishing sequence, the order of the left-hand side at can be bounded as
[TABLE]
On the other hand, since , the order of the right-hand side of (38) is . So, must be a constant sequence, as desired. ∎
We now proceed to describe the behavior of away from the points . We begin with the following preliminary lemma.
Lemma 5.22**.**
Assume that are distinct points such that (equivalently, ). Then the directions (i.e. points in , see Remark 5.9) determined by the values of at are distinct from each other.
Proof.
Without loss of generality, assume that the vectors are finite and non-zero (if not, we multiply by an appropriate meromorphic function, see Remark 5.9). One then needs to show that these vectors are linearly independent. To that end, recall that . So, if , then the vectors are independent as eigenvectors of corresponding to distinct eigenvalues. Therefore, it suffices to consider the case . In that case, we have
[TABLE]
so . Suppose for the sake of contradiction that the corresponding vectors are linearly dependent. Then, without loss of generality, we can assume that (this can be always arranged by multiplying by an appropriate meromorphic function). Denote , , . Notice that since , the differential of does not vanish at , so can be taken as a local parameter near those points. Then, differentiating the relation with respect to at , we get
[TABLE]
Taking a linear combination of these equations, we obtain where In other words, we have Similarly, using the equation , we get
[TABLE]
where Note also that . Indeed, would mean that the two branches of the curve given by the functions near are tangent to each other. This is however, not possible, since is a nodal curve (Proposition 5.19). So, since and , it follows from (40) that the operator has a non-trivial Jordan block. This is, however, not possible, since , and thus is self-adjoint on . So it must be that the vectors are linearly independent, as desired. ∎
Remark 5.23**.**
In the elliptic case (i.e. when the genus of is ), one can also prove Lemma 5.22 as follows. The vectors are common eigenvectors of the operators , , , with the corresponding eigenvalues given by the values of the function , , at the points . So, it follows that are independent as long as at least one of the functions separates from . Assume that this is not the case, which means that and . Then we have
[TABLE]
Along with , this gives . But in the elliptic case four of the six points where are fixed by (which would force ), while the remaining two points are separated by the function (by Proposition 5.15). So indeed the functions separate any pair of points on , which proves Lemma 5.22. As a byproduct, we also get the following result: the functions define an embedding . In other words, if we view and as rational functions on , then these functions provide a resolution of singularities.
Lemma 5.22 also admits an infinitesimal version, corresponding to the case when is a branch point of (equivalently, a fixed point of ). In this case, the role of is played by the vectors , , where the derivative is taken with respect to a local parameter near . Note that upon renormalization of , its derivative changes as , so the direction of is well-defined modulo the direction of . In particular, linear independence of and is well-defined.
Lemma 5.24**.**
Assume that is a branch point of (equivalently, a fixed point of ). Then the directions determined by the values of and at are distinct from each other.
Proof.
Renormalizing if necessary, we can assume that its value at is finite and non-zero. Then, differentiating the equation with respect to a local parameter near , we get
[TABLE]
Also note that since is a nodal curve, it follows that the mapping is an immersion, so at a branch point of me must have . But then (41) implies that the vectors and are linearly independent, as desired. ∎
Remark 5.25**.**
Differentiating at and using that , we get . So, Lemma 5.24 means that and form a basis of solutions for the equation .
Proposition 5.26**.**
The function has poles in , where is the genus of .
Proof.
Let , and let be the two preimages of under the function . Recall that the trace of a meromorphic function on under is a meromorphic function on is defined by . Let
[TABLE]
Note that by definition of the eigenvector function , so This means that , so in particular is meromorphic (i.e. rational). To understand the behavior of that function, fix a point . Let be the set of critical values of (this set contains two or four points depending on the genus of ). Then the following cases are possible:
Case 1. is finite, and is finite at both preimages of under . In this case, is the squared Wronskian of the solutions of equation . By Lemma 5.22, these solutions are independent, so is finite and non-zero.
Case 2. is finite, has a pole of order at one of the preimages of (say, ), and is finite at the other preimage. In this case, the function is finite at and is equal to the squared Wronskian of linearly independent solutions , of . So, has a pole of order at .
Case 3. is finite, and has poles at both preimages of . This is not possible, since after renormalizing we would get
[TABLE]
which would mean that the Wronskian of vanishes.
Case 4. (in which case we also have ). In this case , so has a pole of order at by Proposition 5.21.
All in all, the function does not vanish in , while the number of its poles in that domain is twice the number of poles of in (counting with multiplicities). Now, consider , and let be the unique point such that . Then there exists a parameter near such that the function can be locally written as . So near can be written as
[TABLE]
where . Then at we have
[TABLE]
up to a constant factor and higher order terms. So, when , we have the following two cases:
Case 5. , and is finite at the preimage of . In this case, in view of Remark 5.25, the determinant in (42) is the Wronskian of two independent solutions of , so and thus has a simple zero at .
Case 6. , and has a pole of order at the preimage of . In this case, renormalizing as in Case 2, we get that has a pole of order at .
In the latter case, one can regard a pole of order as a pole of order that collided with a simple zero. With this understanding, the number of zeros of is equal to the number of branch points of , while the number of poles of is twice the number of poles of (with some zeros and poles possibly cancelling each other out). And since the number of zeros of is equal to the number of its poles, it follows that the number of poles of is half the number of branch points of , which is . Furthermore, since is not a pole of , while is its pole of order (see Proposition 5.21), it follows that the number of poles of in is exactly , as desired. ∎
Corollary 5.27**.**
In the rational case, all functions are holomorphic in , while in the elliptic case all of them have at worst a simple pole at one and the same point , and no other poles.
Proof.
First note that by construction. Furthermore, in the rational case is holomorphic in by Proposition 5.26. So both and are holomorphic in that domain. At the same time, by (38) we have
[TABLE]
and since is holomorphic in (see Table 1), it follows by induction that so are all ’s with . Analogously, using (38) to express , we get that ’s with are holomorphic in too. This proves the corollary in the rational case.
In the elliptic case, the argument is similar, but now Proposition 5.26 implies that has a single pole in . Denoting that pole by , we get by induction that all ’s are holomorphic in , as desired. ∎
6 Proof of Theorem B: a self-dual polygon fixed by the pentagram map is Poncelet
In this section we prove Theorem B: any weakly convex self-dual twisted odd-gon projectively equivalent to its pentagram image is Poncelet. To that end, we use the results of Section 5 to obtain explicit formulas for coordinates of vertices of (see Section 6.1 for the case and Section 6.2 for the case ) and hence show that is a Poncelet polygon.
6.1 The rational case: degenerate Poncelet polygons
In this section, we prove Theorem B in the case when the genus of is [math], i.e. when is a rational curve. In that case, we will show that is a degenerate Poncelet polygon in the sense that the corresponding inscribed and circumscribed conics are not in general position. We keep the notation of the previous two sections.
Proposition 6.1**.**
The set consists of either one or three points.
Proof.
This set is invariant under the involution and contains exactly one fixed point of that involution (see the proof of Proposition 5.15). So, it must contain odd number of points, and since , it follows that or . ∎
We consider the cases and separately. First, assume that . Denote points in by , where and are switched by , while is fixed by .
Proposition 6.2**.**
The vectors , , form a basis of .
Remark 6.3**.**
Note that the vectors , , are finite because, by Corollary 5.27, the vector-function is holomorphic in , and since and (see Table 1).
Proof of Proposition 6.2.
We have by (33), so it suffices to show that these vectors are linearly independent. To that end, recall that they are eigenvectors of the operator . Furthermore, the eigenvalue corresponding to is distinct from the eigenvalue corresponding to the other two vectors. So, it suffices to prove the independence of and . But that follows from Lemma 5.22. ∎
Now recall that the polygon corresponding to the operator is . So, by Proposition 6.2 the vertices of (defined up to a projective transformation) are given by To explicitly compute the coordinates of vertices, we identify with . Note that since automorphisms of act transitively on triples of points, the map may be chosen in such a way that , , and . Then the involution , written in terms of , is , while the points are identified with and , where . Furthermore, from Proposition 5.21 and Corollary 5.27 we get where is a constant. Therefore, the vertices of are given by
[TABLE]
So the polygon is inscribed in a conic with homogeneous equation
[TABLE]
Furthermore, since is self-dual, it is also circumscribed, and hence Poncelet. Thus, the proof of Theorem B in the case when the spectral curve is rational and is complete.
Remark 6.4**.**
A direct calculation shows that the conic inscribed in the polygon (43) is
[TABLE]
The conics (44) and (45) are tangent to each other at two points and . In particular, they are not in general position (instead of four intersections we have two intersections of multiplicity ).
We now consider the case . To begin with, notice that this case can be thought of as a limit of the case , with the points , , colliding together and forming a single point . This observation leads to the following version of Proposition 6.2:
Proposition 6.5**.**
The vectors , , form a basis of , where the derivatives are taken with respect to any local parameter near .
Proof.
First, notice that since the set consists of a single point , the latter must be an order two branch point of the function . In other words, we have . So, differentiating the equation at the point twice, we get
[TABLE]
Thus, we have , and it suffices to show that these vectors are linearly independent. To that end, we differentiate the equation twice at . Using that is a branch point of and thus , we get
[TABLE]
Furthermore, since the degree of the function is , is an order branch point for , so , which means that , are eigenvectors of , while is not. Furthermore, the vectors and are linearly independent by Lemma 5.24. So, , , are indeed independent, as desired. ∎
We now find the vertices of the polygon in the same fashion as in the case . Namely, choose an identification in such a way that , , and . Then, as in the case , we get where is a constant. In particular, at the point we get , , , so up to a projective transformation the vertices of are given by
[TABLE]
These points belong to a conic
[TABLE]
so is inscribed and hence Poncelet. Thus, the proof of Theorem B in the rational case is complete.
Remark 6.6**.**
A direct calculation shows that the conic inscribed in the polygon (46) is
[TABLE]
This is an even more degenerate case: the conics (47) and (48) intersect each other at one single point , of multiplicity .
Remark 6.7**.**
Degenerate Poncelet polygons (43) and (46) correspond to degenerations of an elliptic curve to Abelian groups and respectively. Indeed, removing the tangency points with the inscribed conic (45) from the circumscribed conic (44) we get an affine curve (a hyperbola) which is naturally isomorphic to . The vertices of the Poncelet polygon (43) are uniformly spaced on that hyperbola with respect to the group structure. This should be compared with the case of genuine Poncelet polygons which are images of uniformly spaced points on an elliptic curve under a double covering map from the elliptic curve to the circumscribed conic. Thus, degenerate Poncelet polygons (43) correspond to degenerations of an elliptic curve to . Likewise, removing from (47) the tangency point with (48) we get a parabola which identifies with , and points (46) are again uniformly spaced. Thus, degenerate Poncelet polygons (46) correspond to degenerations of an elliptic curve to .
6.2 The elliptic case: genuine Poncelet polygons
In this section, we complete the proof of Theorem B in the case when the spectral curve has genus , i.e. is elliptic. The argument is similar to the rational case, but instead of elementary expressions (43) and (46), we obtain formulas for vertices of in terms of theta functions.
Recall that in the elliptic case the involution on has four fixed points, at three of which we have , while at the fourth one we have (see the proof of Proposition 5.15). Denote those points by , where , and .
Proposition 6.8**.**
The directions in determined by the values of the vector-function at the points , , (see Remark 5.9) are linearly independent.
Proof.
They are eigendirections of the operator corresponding to distinct eigenvalues , , . ∎
As in the rational case, it follows that the vectors , , form a basis of (as usual, one may need to renormalize these vectors to ensure that they are finite, see Remark 5.9). Therefore, the vertices of the corresponding polygon (defined up to projective transformation) are given by
Remark 6.9**.**
Since (see Remark 5.16), it follows that the infinite vectors , , are -periodic, so the polygon is closed.
To explicitly compute the coordinates of vertices of , we identify with , where is a lattice. Without loss of generality, assume that is spanned by and , where is in the upper half-plane. Furthermore, one can choose an identification between and in such a way that the point gets identified with . Then , understood as an involution in , is simply . So, must coincide with the remaining order points in , namely [math], , . Without loss of generality, assume that , , .
We will express the vertices of using theta functions. Recall (see e.g. [18]) that the theta function corresponding to the lattice t is defined by
[TABLE]
where , and the dependence of on is suppressed for notational convenience. We will also need theta functions with (half-integer) characteristics, defined by
[TABLE]
Choose complex numbers whose images in are the points (see Corollary 5.27 for the definition of ). Note that the points are interchanged by the involution , so modulo . Therefore, without loss of generality one can assume that . Fix satisfying the latter condition, and let .
Proposition 6.10**.**
Up to a projective transformation, the vertices of the polygon are given by
[TABLE]
Before proving this proposition, we recall standard properties of the theta function . It is easily seen from its definition that the theta function is holomorphic in , even, periodic with period , and quasi-periodic with period :
[TABLE]
In addition to that, one can show using the argument principle that the theta function has a unique simple zero at the point , and no other zeros in the fundamental parallelogram spanned by and . These properties allow one to express any meromorphic function on in terms of the theta function. The construction is based on the following well-known result: there exists a meromorphic function with zeros at and poles at if and only if . So assume that we are given a collection of points with this property. Then the expression
[TABLE]
defines a meromorphic function on which can be easily seen to be periodic with respect to both and (here we regard ’s and ’s as points in and assume that they are chosen in such a way that exactly, and not just modulo ). Therefore, this function can be viewed as a meromorphic function on . Furthermore, the only zeros of in are ’s, while its only poles are ’s. Since zeros and poles determine a meromorphic function up to a constant factor, it follows that any meromorphic function on with zeros at and poles can be written as (51) times a constant.
Proof of Proposition 6.10.
Using Proposition 5.21 and Corollary 5.27, we get
[TABLE]
where is a non-zero constant, and the term containing is found by equating the sum of zeros with the sum of poles. Note that since we are only interested in the direction of the vector , we may multiply all ’s by , which results in
[TABLE]
These are no longer meromorphic functions on , but still meromorphic functions on . Furthermore, in contrast to ’s, the functions are always finite at the points corresponding to , so the vertices of are given by Also notice that the values of the constants do not affect the latter expression, so one can assume that . Under this assumption, we get
[TABLE]
where the last equality follows from and . Similarly, we have
[TABLE]
where the second last equality follows from -periodicity of , and the last one from and . Finally,
[TABLE]
where the second equality uses the definition , the third one uses the formula for , while the last one uses that is even along with the relation .
Now, to complete the proof it remains to rewrite the obtained fromulas using theta functions with characteristics. We have , while up to a factor not depending on . Since the latter factor does not affect the projective equivalence class of , one gets the desired formulas for vertices. ∎
Remark 6.11**.**
Note that the functions may, but not necessarily do, have poles at (see Corollary 5.27). However, formula (52) is valid anyway. Indeed, if does not have a pole at , then its only pole is the point (which is of order ), while its only zero is the point (which is also of order ). So, we must have modulo , i.e. . But then the factor in (52) is a non-vanishing holomorphic function, so the analytic properties (i.e. zeros and poles) of the right-hand side of (52) are the same as for the left-hand side, which means that these functions coincide for a suitable value of .
Now, to prove that is Poncelet it suffices to establish the following:
Proposition 6.12**.**
The image of the map given by
[TABLE]
is a conic.
Proof.
First of all, notice that the functions , , have no common zeros, so the mapping is well-defined. Further, following [18], define the following operators on holomorphic functions on :
[TABLE]
Then
[TABLE]
In particular, we have , , which means that
[TABLE]
From the latter it follows that descends to a holomorphic mapping , so the image of is an algebraic curve. To find the degree of that curve, one needs to find the number of its intersections with a generic line. Clearly, that number can be found as , where is the number of zeros of a generic linear combination of , , in the fundamental parallelogram of the lattice , while is the degree of , when the latter is regarded as a mapping . The number can be easily computed using quasi-periodicity relations (55) and the argument principle. That number is equal to . Further, notice that the functions , , are even, so , which means that . Therefore, the degree of the image of is either or , i.e. the image of is a conic or a straight line. However, it cannot be a straight line, because the functions are linearly independent by (54). So, the image of is a conic. ∎
Thus, we conclude that the vertices (50) of the polygon lie on a conic. Since is self-dual, it is also circumscribed about a conic, and hence Poncelet, q.e.d. So, Theorem B is proved.
Remark 6.13**.**
One can also explicitly describe the image of the mapping (53) and hence the conic circumscribed about using Riemann’s relation
[TABLE]
where , , , . Taking , , , , we get the identity
[TABLE]
which, after a further substitution , becomes
[TABLE]
So, the conic circumscribed about is given by
[TABLE]
Similarly, the conic inscribed in is
[TABLE]
Indeed, let , , and . Then, as follows from (58), the point
[TABLE]
belongs to the conic (60). Furthermore, the tangent line to (60) at passes through the vertices and of . Indeed, that is equivalent to the relation
[TABLE]
which is a particular case of (57) corresponding to , . So indeed the polygon is circumscribed about the conic (60).
Remark 6.14**.**
Note that formula (50) describes a family of polygons, parametrized by . Our argument shows that all these polygons are inscribed in one and the same conic (59) and circumscribed about one and the same conic (60). So, polygons (50) form what is called a Poncelet family, i.e. a family of polygons inscribed in the same conic and circumscribed about the same conic (recall that every Poncelet polygon is a member of such a family by Poncelet’s porism). Also note that the expression (50) is periodic in with the periods given by the lattice . So, the Poncelet family containing our polygon is parametrized by the elliptic curve , which is a -to- covering of the spectral curve . As a corollary, the Poncelet family containing contains four polygons projectively equivalent to : one of those polygons is , while the other three can be obtained from by replacing in formula (50) with , , and . This quadruple of polygons admits a geometric description when the circumscribed conic and inscribed one are confocal. In this case, these polygons can be obtained from by means of reflection with respect to the common symmetry axes of , .
This argument also shows that the spectral curve is the same for all polygons in a Poncelet family. Using a different approach, this was earlier proved in [24]. Formulas for Poncelet families similar to (50) are given in [27].
Remark 6.15**.**
Note that since the polygon is closed (Remark 6.9), the expression (50) must be -periodic in . Therefore, we must have . Another way to see this is to consider the function on . Using Table 1 and the fact that , we conclude that this function has simple zeros at , , , a zero of order at , and a pole of order at . So, we have which implies and thus , as desired.
Also note that formula (50) still defines a Poncelet polygon if . It is then a twisted -gon, which can also be viewed as a closed -gon. Such twisted Poncelet polygons do not arise in our setting, because they are not fixed points of the pentagram map.
7 Proof of Theorem A: a closed polygon fixed by the pentagram map is Poncelet
In this section, we derive Theorem A from Theorem B. To that end, we first show, in Section 7.1, that the self-duality assumption of Theorem B is not very restrictive. Namely, any polygon satisfying all the assumptions of the theorem except for possibly self-duality, can be transformed, by means of rescaling (15) with , into a self-dual polygon. From that we conclude that a polygon as in Theorem A (i.e. weakly convex, closed, and projectively equivalent to its pentagram image) must be Poncelet up to rescaling (15) with . So to show that that polygon is actually Poncelet we need to prove that the rescaling is trivial, i.e. corresponds to . To that end, we show that if a weakly convex Poncelet polygon is rescaled in a non-trivial way, then the resulting polygon cannot be closed. This is done separately in the rational (see Section 7.2) and elliptic (see Section 7.3) cases. In the rational case we have a very simple explicit description of the corresponding degenerate Poncelet polygons (see Section 6.1), so in that case the proof is completely elementary. As for the the elliptic situation, in that case the proof relies on the study of the real part of the corresponding elliptic curve and location of various special points within that real part.
7.1 Self-duality up to rescaling
Proposition 7.1**.**
Assume that a closed or twisted weakly convex polygon is projectively equivalent to its pentagram image . Then one can choose the -periodic operator of the form (19) associated with in such a way that the corresponding commuting operators given by (20) satisfy
[TABLE]
for certain .
Proof.
Let be an -periodic operator corresponding to such that the corresponding operators commute, and, moreover, the coefficients of satisfy the alternating signs condition (17) (such exists by Proposition 4.2). Then the operator has the form
[TABLE]
Moreover from the alternating signs condition we have for all . Therefore, the operator (66) can be symmetrized. Namely, there exists a positive quasi-periodic sequence such that the operator is self-dual. That sequence can be found from the equation . So, conjugating by if needed, we may assume that the operator (66) is self-dual, meaning that
[TABLE]
We now show that under that assumption we must have (65). Let , be the monodromies of , respectively. Then, by the second statement of Proposition 3.4, we have . Furthermore, since and commute, it follows that the kernels of both of them are contained in . So, the spectrum of the monodromy of is . Moreover, we have
[TABLE]
Similarly, using that the monodromy of and is given by and respectively, we conclude that the monodromy of is , which, in view of (67) and the inequality implies . Furthermore, we have
[TABLE]
so
[TABLE]
for a certain -periodic sequence of non-zero real numbers. Taking the dual of both sides, we also get so
[TABLE]
At the same time, we have
[TABLE]
so commutes with . But that is only possible if is a constant sequence . So, (68) implies (65), with . Furthermore, since the coefficient of the highest degree term in is a sequence of negative numbers, while the coefficient of the coefficient of the highest degree term in is a sequence of positive numbers, equation (65) can only be satisfied for , as desired. ∎
Corollary 7.2**.**
Assume that a closed or twisted weakly convex polygon is projectively equivalent to its pentagram image . Then there exists a polygon with the same properties which is, in addition, self-dual (and hence Poncelet by Theorem B), such that where is the rescaling (15) with .
Proof.
Take the operator provided by Proposition 7.1. It has the form where . Consider also the operator and the associated polygon . Then, by Corollary 2.11, we have . In particular, is projectively equivalent to its pentagram image (because the pentagram map commutes with rescaling) and weakly convex (by the third statement of Proposition 3.4). Furthermore, we have so is self-dual, as desired.∎
7.2 End of proof in the rational case
Let be a weakly convex closed polygon projectively equivalent to its pentagram image , as in Theorem A. Then, by Corollary 7.2, there exists a generally speaking twisted polygon such that for some , and is self-dual. Consider the spectral curve associated with , constructed in the proof of Theorem B. In this section, we prove Theorem A in the case when the genus of is [math], i.e. when is rational. To that end, we will show that , so and hence Poncelet.
As we know from Section 6.1, in the rational case the vertices of are given by (43) or (46). In case (43), the associated difference operator reads
[TABLE]
where is such that the roots of the corresponding characteristic polynomial are , and (note that since the polygon is real, must be real too, so we must have ). Indeed, the kernel of such an operator is spanned by the sequences , , and a constant sequence, so the associated polygon is precisely (43). Likewise, in the case (46), the associated difference operator is also of the form (69), with . So, since the polygon is defined by the operator (69), the polygon is defined by
[TABLE]
The kernel of this operator is spanned by the sequences , , , where , , are the roots of the characteristic polynomial (note that we do not need to consider the case of multiple roots, because in that case the monodromy of is not diagonalizable, and the polygon cannot be closed). Moreover, since is closed, we must have , so , where is a real number. So, the roots of the polynomial must all have absolute value . Also taking into account that this polynomial is real, and that , we conclude that the roots of are of the form , where . But this yields and , so . Therefore, the polygon coincides with and hence Poncelet. Thus, the proof of Theorem A in the rational case is complete.
Remark 7.3**.**
One can also give a more concrete description of , as follows. Since the vertices of are given by (43) (with (46) being impossible due to closedness of ), and is a closed -gon, it follows that . So, applying a linear transformation to (43), we get a polygon whose vertices have affine coordinates , where . In particular, if , then is a regular -gon.
7.3 End of proof in the elliptic case
In this section, we prove Theorem A in the case when the genus of is , i.e. when is elliptic. As in the rational case, we show that , so and hence Poncelet. We keep the notation of Sections 5.1 and 6.2
Recall that a real structure on a Riemann surface is an anti-holomorphic involution . The real part of (with respect to the real structure ) is then defined as the set of fixed points of : . A meromorphic function on is called a real function if . Real functions take real values at real points (i.e. points in ).
In our case, the spectral curve is endowed with a real structure induced by the involution on the affine spectral curve .
Proposition 7.4**.**
The functions , , , , on are real (see Section 5.1 for the definition of those functions).
Proof.
The functions are real by construction of the real structure . To prove that the vector-function is real, notice that it is defined by equations (29) up to a scalar factor. Taking the complex conjugate of those equations and then applying , we get that for a certain meromorphic function . But then the normalization condition implies , as desired. Now, the reality of the functions follows from equation (30), while reality of follows from its definition (32). ∎
Corollary 7.5**.**
The points are real (see Section 5.1 for the definition of and Section 6.2 for the definition of ).
Proof.
Since is real function (Proposition 7.4), the involution takes zeros of to zeros of . But the only zero of is (see Table 1), so the latter must be real. Analogously, is real as the only pole of , is real as the only simple zero of , is real as the only simple pole of , while is real as the only point where both and are equal to (see Remark 5.16). To show that are real, observe that they constitute the set of points where , so takes the set to itself. Further, notice that the values of the function at are eigenvalues of a self-adjoint operator and hence real. Furthermore, those values are distinct, because are branch points of , while . But if, say, , then we must have , which is not possible since are real and distinct. So, cannot permute and thus preserves each of them. ∎
Corollary 7.6**.**
The real part of consists of two disjoint circles.
Proof.
The real part of any Riemann surface consists a finite number of disjoint circles (ovals). Furthermore, since the genus of is , the number of connected components of is at most by Harnack’s theorem. At the same time, the number of connected components is non-zero since the real part of is not empty (by Corollary 7.5). So, it remains to determine whether the number of connected components is or . These cases can be distinguished by counting the number of real points of order on . Namely, if is identified with in such a way that [math] is a real point, then is a subgroup of isomorphic to if is connected, and if has two components. So the number of real order points in is , where is the number of components of . Identifying with as in Section 6.2, we see that the order points are , which are all real. So, , q.e.d. ∎
This argument also shows that one of the components of contains the point and one of the points , while the second component of contains the remaining two points. Without loss of generality, assume that and are located in the same component. Denote that component by .
Proposition 7.7**.**
We have .
Proof.
The function is real-valued on and satisfies , . So, there must be at least two points on where changes sign. But the only points which have this property are (see Table 1). Similarly, , , so the function should also change sign at two points. Moreover, these cannot be the points , since at those points has a zero and a pole of order . So, we must have , as desired. ∎
Proposition 7.8**.**
The cyclic order of the points on is as shown in Figure 6.
The proof is based on the following two lemmas.
Lemma 7.9**.**
We have .
Proof.
Without loss of generality, assume that the vector is finite and non-zero (see Remark 5.9). Then, using the definition of the function and the fact that (see Table 1), we get Therefore, spans the kernel of the operator , while is the monodromy of that operator. So, by the second statement of Proposition 3.4, the number is positive and is less than the monodromy of But the monodromy of the latter operator is the same as the monodromy of , which is . So, we get and the result follows. ∎
Lemma 7.10**.**
The only point in where is the point .
Proof.
Assume that and . Then the latter condition in particular implies . Therefore, without loss of generality, we may assume that the vector is finite and non-zero (if not, we renormalize , see Remark 5.9). Under this assumption, using the inner product (12) on , we get
[TABLE]
Furthermore, since the vector is real, it follows that , and thus . So, using formula (32) for the function , we get (here we use that the value is finite and non-zero, which is true because the functions do not have common zeros or poles, see Table 1). Furthermore, recall that the set of points where consists of the point , plus points and which do not belong to . The result follows. ∎
Proof of Proposition 7.8.
The restriction of the involution to preserves the points , interchanges with , and interchanges with . For this reason, the only possible locations of those points on are the one depicted in Figure 6, as well as the ones depicted in Figure 7. Assume that are located as in Figure 7a. Then, since by Lemma 7.9, while is a pole of , there must be a point in the open arc such that or (here and below denotes an open arc going from to in counter-clockwise direction). However, the former is impossible by Lemma 7.10, while the latter is impossible since the only zero of is the point . So, the points cannot be located as in Figure 7a. Further, since , while the only points where changes sign are , in Figures 7b and 7c we must have , which is impossible by Lemma 7.9. So, the points are located as in Figure 6. ∎
Now recall that the elliptic curve is associated with a Poncelet -gon , and in addition we have a closed -gon , where . Our aim is to show that .
Proposition 7.11**.**
There is a point such that and .
Proof.
The function has one simple pole and one double pole in (see Table 1). Therefore, the degree of the mapping is equal to (depending on the orientations). In particular, this mapping is surjective. So there exists such that . To show that , recall that the polygon associated with the operator is closed. Therefore, the monodromy of the that operator has the form . At the same time, since , the explicit form of that operator is
[TABLE]
where the sequences , coincide with , up to a shift of indices. So, by formula (11), the determinant of the monodromy of this operator is . Thus, we have , and the result follows. ∎
We will now show that , which implies and thus proves Theorem A. To that end, notice that since is finite and positive, must be located in the open arc (see Figure 6). At the same time, since the function is equal to at , has a pole at , and does not take values in , it follows that in . Furthermore, the same argument applied to the function shows that in , and, in particular, in . But then cannot belong to , because it is not possible that both and are greater than . Analogously, and are both less than in , so cannot belong there either. Therefore, we must have , which implies . But this means that the polygon is the same as the polygon and hence Poncelet. So, Theorem A is proved.
8 Appendix: Duality of difference operators and polygons
The goal of this appendix is to prove that polygons corresponding to dual difference operators are dual to each other. This seems to be a well-known result, and it explicitly appears as Proposition 4.4.3 in [17]. Here we give a different proof, based on interpretation of difference operators as infinite matrices.
Proposition 8.1**.**
Let be a properly bounded difference operator supported in , and let be the corresponding polygon in , where is the order of . Then the dual operator corresponds to a polygon in the dual space whose ’th vertex is the hyperplane in spanned by the vertices of .
Proof.
Let . Then one can interpret as a finite-band matrix (7) whose non-zero diagonals have labels . (Here and in what follows, the ’th diagonal of an infinite matrix is the collection of its entries such that . In other words, the diagonals are labeled from southwest to northeast, with the main diagonal labeled by [math].) Note that even though infinite matrices do not form an algebra, any infinite matrix can be multiplied by a finite band matrix.
Lemma 8.2**.**
There exists an infinite matrix such that:
. 2. 2.
The diagonals of with labels vanish. 3. 3.
None of the entries of on the diagonals with labels and vanish.
Remark 8.3**.**
One can think of infinite matrices as formal Laurent series in terms of the shift operator , with coefficients given by sequences. In this language, Lemma 8.2 states the existence of of the form where , for any .
Proof of Lemma 8.2.
The infinite matrix can be regarded as an element of two groups: the group of invertible infinite matrices with finitely many non-zero diagonals below the main diagonal, and the group of invertible infinite matrices with finitely many non-zero diagonals above the main diagonal. Denote by the inverses of in these two groups, and set Then we clearly have . To see that is of desired form, write as where the dots denote terms of higher order in . Then the inverse of in can be computed using the Taylor series . So, the inverse of in reads and hence is of the form with . Likewise, is of the form with . The result follows. ∎
We now finish the proof of Proposition 8.1. Let be a sequence of lifts of vertices of such that . Then any scalar sequence can be obtained from by means of term-wise application of a linear functional. In particular, since , this applies to columns of the matrix . So, the ’th column of is of the form for a certain linear functional . Furthermore, since the diagonals of with labels vanish, it follows that annihilates . Moreover, since has a non-vanishing diagonal, we have . Therefore, the projection of to is exactly the hyperplane spanned by the vertices of . So, to complete the proof, it suffices to show that the sequence of ’s is annihilated by . To that end, notice that since , the rows of are annihilated by . But those rows are of the form , and since ’s span , it follows that the sequence is annihilated by , as desired. ∎
Remark 8.4**.**
It is also easy to see that the matrix provided by Lemma 8.2 is unique up to a constant factor. It takes a particularly simple form when the polygon is closed. To show that, assume for simplicity that , so that the operator is supported in . Furthermore, assume that is -periodic and has trivial monodromy (in particular, the polygon corresponding to is closed). Then, as shown in [14], there exists an -periodic operator supported in such that (the operator is closely related to the so-called Gale dual of ). Using that, one can find the inverses of in as
[TABLE]
As a result, one gets
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Clebsch. Ueber das ebene fünfeck. Math. Ann. , 4:476–489, 1871.
- 2[2] C.H. Conley and V. Ovsienko. Lagrangian configurations and symplectic cross-ratios. Math. Ann. , 375(3):1105–1145, 2019.
- 3[3] V. Dragović and M. Radnović. Bicentennial of the great Poncelet theorem (1813–2013): current advances. Bull. Amer. Math. Soc. , 51(3):373–445, 2014.
- 4[4] R. Felipe and G. Marí Beffa. The pentagram map on Grassmannians. Ann. Inst. Fourier , 69(1):421–456, 2019.
- 5[5] V.V. Fock and A. Marshakov. Loop groups, clusters, dimers and integrable systems. In Geometry and quantization of moduli spaces , pages 1–65. Springer, 2016.
- 6[6] D. Fuchs and S. Tabachnikov. Self-dual polygons and self-dual curves. Funct. Anal. Other Math. , 2(2-4):203–220, 2009.
- 7[7] M. Gekhtman, M. Shapiro, S. Tabachnikov, and A. Vainshtein. Integrable cluster dynamics of directed networks and pentagram maps. Adv. Math. , 300:390–450, 2016.
- 8[8] M. Glick. The pentagram map and Y-patterns. Adv. Math. , 227(2):1019–1045, 2011.
