This is a continuation of the previous post about computing some examples of ECH capacities. My goals in this post are (1) to recap some of the previous discussion using better notation, (2) to explain an effective way to compute the ECH capacities of triangles, and (3) to give an update on the status of the conjectures in the previous post.
(1) Let me briefly recall what we are doing. For every domain in the first quadrant of the plane we have a subset of , namely the inverse image of under the map sending . We also have a sequence of numbers
which are the ECH capacities of . We would like to calculate , at least for some examples of interest.
Let’s recall what we know about the numbers . To do so it will help to introduce a bit of notation. Let denote the set of nondecreasing sequences where each is a real number (or ) and . The ECH capacities of give such a sequence which we denote by . Given two sequences , define a new sequence by
Observe that the operation is associative and commutative. Also, write if for all . Write if and . (For this purpose we define . But that is not important for now because the examples of interest have finite ECH capacities.) If , define a new sequence by
Note that the operation is not inverse to . In particular, it is easy to verify that , but the reverse inequalities do not in general hold.
Now here are some properties of :
- If and are in the interior of the first quadrant, and “affine equivalent”, meaning that one can be obtained from the other by the action of and translation, then .
- If , or more generally if symplectically embeds into , then .
- If where and intersect only along their boundaries, then , and .
- If is convex and intersects the axes in at most two points, then , where is defined to be the minimum, over convex paths in the plane that enclose at least lattice points, of the length of , as measured using the dual of a norm whose unit ball is a translate of .
Here the first property follows from the symplectomorphism invariance of ECH capacities. The second property follows from the monotonicity axiom for ECH capacities. In the third property, the first inequality follows from the monotonicity and disjoint union axioms for ECH capacities, and the second inequality is a consequence of the first. These inequalities are not sharp in general, but they are sharp in some lucky cases. The fourth property follows from Theorem 1.1 in my paper “Quantitative ECH”, as discussed in the previous post. The assumption on intersecting the axes in at most two points can be dropped for rectangles and right triangles with legs on the axes, and quite possibly more generally. In any case we always know using monotonicity that .
(2) The formula for when is convex, while combinatorial, is rather difficult to compute with. I discussed some ways to simplify it in the previous post when is a polygon, and now I would like to explain a way to simplify it even more when is a triangle. First recall that if is affine equivalent to a right triangle with legs on the axes, then we can compute very easily: If the vertices are , then we simply write down all nonnegative integer linear combinations of and in nondecreasing order. Second, note that a general triangle can be approximated by a rational triangle, i.e. a triangle with vertices in . Third, observe that any rational triangle is affine equivalent to a triangle with all vertices on the axes. The ECH capacities of the latter kind of triangle can be effectively computed using the following proposition, which is a generalization of Lemma 2.6(ii) in Dusa McDuff’s paper “The Hofer conjecture on embedding symplectic ellipsoids”:
PROPOSITION. Suppose is affine equivalent to a triangle with vertices where . Let denote the triangle with vertices , and let denote the triangle with vertices . Then
PROOF: We know from the general properties above that , so we just need to show that . For this purpose it is enough to show that , since we know that while and .
By an approximation argument, we may assume that and are irrational.
Recall from the previous post that if is any triangle, then is the minimum of over triangles that enclose at least lattice points and are obtained from by scaling by and translating. Also denotes the area of . (In the previous post I also rotated by 90 degress, as that was natural in the context of the discussion there, but since this does not change the answer I will not do it here.) Let us call a triangle “minimal” if it achieves this minimum. Note that if a triangle is minimal, then every edge must contain a lattice point; otherwise we could move an edge towards an opposite vertex so as to decrease . If is affine equivalent to a right triangle with legs on the axes, then the converse is also true, i.e. is minimal if and only if every edge of encloses a lattice point.
Now fix and let be a minimal triangle for computing . Since is minimal, it follows as above that the bottom, horizontal edge of must have integer coordinate. So by translating we may assume that the bottom edge of is on the axis, and by further translating we can assume that the top vertex of has coordinate in the interval . Now let denote the triangle formed by the left edge of together with the axes, and let denote the number of lattice points enclosed by . Let denote the triangle formed by the right edge of and the axes. Note that each of the nonhorizontal edges of contains exactly one lattice point (because is minimal and and are irrational). Consequently, encloses lattice points, is minimal for computing , and is minimal for computing . Now write the bottom vertices of as with . Then it follows from the above that
Thus as desired.
(3) Enough for now about computing when is convex (although there are still some interesting mysteries which I plan to discuss later). If is a nonconvex polygon, can we compute combinatorially using the above properties? Or do we have to go back to the definition of ECH capacities and count holomorphic curves? I don’t know.
In the previous post I considered the example where is a quadrilateral with vertices where . One can get a lower bound on by cutting into two triangles (each affine equivalent to a right triangle with legs on the axes). And one can get an upper bound on by adding a triangle (whose ECH capacities are determined by the above proposition) to get a right triangle with legs on the axes. I noticed that in some examples I worked out, the lower and upper bounds are equal.
Since then, I tried a couple more examples. I found one case where the upper and lower bounds are not equal. This case is where . In this case the lower bound on is , while the upper bound on is . However, in all other examples that I computed (which admittedly were not very many), the upper and lower bounds were equal. So I don’t know what’s going on here.
Anyway, this does not disprove Conjecture 2 in the previous post, although it does cast some doubt on it. Recall that Conjecture 2 in the previous post was introduced because it implies Conjecture 1 in the previous post. However Conjecture 2 is much more than is needed to prove Conjecture 1. To prove Conjecture 1, one does not need to equal the lower bound; one just needs good enough upper bounds on .
Anyway, I think a lot more calculation and/or intelligent thought is needed to sort all this out. Meanwhile, if anyone is still reading this and has questions about how the calculations work, please post a comment or email me. I am happy to clarify. Also, since these are just informal notes, I may well have made mistakes.