Approximation of quasi-states on manifolds
Adi Dickstein, Frol Zapolsky

TL;DR
This paper introduces a numerical algorithm to approximate median quasi-states on the 2-sphere, based on metric properties of quasi-states and probability measures, with implications for understanding quantum mechanics.
Contribution
It presents the first algorithm for numerically computing median quasi-states on the 2-sphere, leveraging Wasserstein metrics for error estimation.
Findings
Algorithm achieves arbitrary accuracy in computing median quasi-states.
Error estimates depend on metric continuity properties.
Non-approximation results are provided for symplectic quasi-states.
Abstract
Quasi-states are certain not necessarily linear functionals on the space of continuous functions on a compact Hausdorff space. They were discovered as a part of an attempt to understand the axioms of quantum mechanics due to von Neumann. A very interesting and fundamental example is given by the so-called median quasi-state on the 2-sphere. In this paper we present an algorithm which numerically computes it to any specified accuracy. The error estimate of the algorithm crucially relies on metric continuity properties of a map, which constructs quasi-states from probability measures, with respect to appropriate Wasserstein metrics. We close with non-approximation results, particularly for symplectic quasi-states.
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.
Approximation of quasi-states on manifolds
Adi Dickstein1)1)1)School of Mathematical Sciences, Tel Aviv University. and Frol Zapolsky2)2)2)Department of Mathematics, University of Haifa.
Abstract
Quasi-states are certain not necessarily linear functionals on the space of continuous functions on a compact Hausdorff space. They were discovered as a part of an attempt to understand the axioms of quantum mechanics due to von Neumann. A very interesting and fundamental example is given by the so-called median quasi-state on . In this paper we present an algorithm which numerically computes it to any specified accuracy. The error estimate of the algorithm crucially relies on metric continuity properties of a map, which constructs quasi-states from probability measures, with respect to appropriate Wasserstein metrics. We close with non-approximation results, particularly for symplectic quasi-states.
1 Introduction and results
Quasi-states on a topological space are a certain generalization of integration against a Borel probability measure. These objects arose from an attempt to understand von Neumann’s axioms of quantum mechanics, according to which a quantum system is found in a state, which is a positive linear functional on the algebra of observables, which are bounded linear operators on a complex Hilbert space. However, physicists objected to this linearity, because it is meaningless from the point of view of physics, unless the two observables in question commute. Thus the notion of a quantum quasi-state appeared, wherein the linearity assumption was replaced by the less restrictive assumption of linearity on commuting observables. The natural question whether nonlinear quantum quasi-states exist was finally settled by Gleason [14], who showed that quantum quasi-states are linear provided the underlyng Hilbert space has dimension at least three. See also [11] and references therein.
The quantum-classical correspondence principle says that a classical mechanical system is in a certain sense the limit of quantum systems when the Planck constant , considered as a parameter, tends to [math]. Since there are no non-linear quantum quasi-states, a natural question therefore is whether classical quasi-states exist. This was answered in the positive by Aarnes in [1]. Later, Entov and Polterovich discovered an even more stringent subtype of symplectic quasi-states [8]. Remarkably, when the underlying symplectic manifold is the -sphere, what they obtained is the so-called median quasi-state, which also appears indirectly in Aarnes’s topological theory. It is therefore among the most fundamental examples of quasi-states, and also among the simplest. It is described in Example 1.3.
Due to the fundamental nature and interest of the median quasi-state, it is desirable to be able to numerically compute it. Our main contribution in this paper is an algorithm with does that to any specified accuracy. We estimate the error of the algorithm using metric continuity of a natural construction of quasi-states from measures. Other results here are that, inter alia, certain quasi-states on symplectic manifolds of dimension , coming from Floer theory [9], cannot be approximated by this construction. Curiously, Wasserstein metrics make an appearance here.
Quasi-states had long remained a largely theoretical topic, but this is starting to change. For instance, in [22] this concept is applied to the definition of a multidimensional median. See also the references therein. Our paper also brings this topic closer to the applied side.
1.1 Basic examples and the approximation algorithm
Let be a compact Hausdorff space, and let be the Banach algebra of real-valued continuous functions on , endowed with the -norm . For the subalgebra it generates is defined as .
Definition 1.1**.**
A quasi-state on is a functional such that
- (i)
; 2. (ii)
for with ; 3. (iii)
for each , is linear on .
We moreover call simple if for all .
Remark 1.2**.**
- (i)
Note that if is a Borel probability measure on , the functional defines a linear quasi-state, which is simple if and only if is a delta-measure. 2. (ii)
It easily follows from the definition that a quasi-state on is -Lipschitz with respect to the -norm, that is for .
The existence of nonlinear quasi-states is due to Aarnes [1]. He developed a general construction of quasi-states, which we will describe in detail in Section 1.2 below.
Let us start with two interesting examples of simple quasi-states on the sphere . A quasi-state is Lipschitz with respect to the -norm by Remark 1.2, therefore uniquely defined by its values on the -dense subset of Morse functions. Let us fix a Morse function .
Example 1.3**.**
- (i)
The median quasi-state : Let be the normalized Lebesgue measure on coming from the standard round area form. There is a unique component of a level set of , called the median of , with the property that for every connected component of . The value of the median quasi-state at is . 2. (ii)
The Aarnes quasi-state corresponding to a finite subset of odd cardinality : let be the uniformly distributed discrete probability measure supported on . Then there is a unique component of a level set of , called the -median of , such that every connected component of has . The value of the Aarnes quasi-state at is .
As we mentioned above, the median quasi-state arises independently from quasi-morphisms on the group of area- and orientation-preserving diffeomorphisms of , which are construction using Floer theory [7]. It can be characterized as the unique quasi-state on which is invariant under the group of area-preserving diffeomorphisms and which vanishes on functions supported in disks of area at most . As such, it is of fundamental interest, and thus it is desirable to be able to numerically compute it on a wide class of functions.
Let us endow with the metric induced from the Euclidean metric on , and for let be its Lipschitz constant with respect to this metric. We can now formulate our main result.
Theorem 1.4**.**
There is an algorithm which accepts as input a Lipschitz function and an integer parameter , and produces as output a number which differs from by no more than
[TABLE]
The algorithm has complexity .
Remark 1.5**.**
- (i)
Alternatively, one can first specify the accuracy , and the theorem says that there is an algorithm of complexity which produces a number differing from by at most . 2. (ii)
The constant appearing in (1) is probably far away from being sharp. Due to the large value of the constant, the estimate is of limited importance in practice. The main point is to prove the existence of a convergent algorithm computing . 3. (iii)
In practice, Lipschitz functions on are given for instance by restrictions of polynomials on . If
[TABLE]
is such a function, where are the coordinates on , then
[TABLE]
where is the degree of the initial polynomial.
The algorithm replaces with a function which is piecewise linear with respect to a suitable triangulation of , and then algorithmically computes where is a carefully chosen subset of the set of vertices of the triangulation. The estimate (1) relies on a metric approximation result for quasi-states on manifolds, Theorem 1.8 below. Theorem 1.4 is proved in Section 2.2.
1.2 Quasi-states from measures
In this section we describe a map which assigns a simple quasi-state to a measure on a CW complex with vanishing first cohomology, and formulate its continuity properties, which are crucial for the proof of the estimate (1) of Theorem 1.4. The median quasi-state and the Aarnes quasi-states of Example 1.3 are the value of on the Lebesgue measure on and on the discrete measure , respectively.
The map is constructed in two steps. The first step is the Aarnes representation theorem, proved in [1], which furnishes a bijection between quasi-states and certain set functions, known as topological measures. The second step constructs topological measures from measures.
1.2.1 Topological measures
Let and be the collections of closed and open subsets of , respectively, and let .
Definition 1.6**.**
A function is called a topological measure if
- (i)
; 2. (ii)
for with ; 3. (iii)
for , such that the are all mutually disjoint and ; 4. (iv)
for every .
We say that is simple if it only takes values .
Remark 1.7**.**
Note that the restriction to of a Borel probability measure on is a topological measure, which is simple if and only if it is a delta-measure.
The Aarnes representation theorem proved in [1] says that quasi-states and topological measures are in a -to- correspondence, as follows. If is a quasi-state on , the corresponding topological measure is defined for by
[TABLE]
and for by , where is the indicator function of . Conversely, if is a topological measure on , the corresponding quasi-state is given by
[TABLE]
for . The Aarnes representation theorem extends the usual Riesz representation theorem, in the sense that the restriction of a Borel probability measure to corresponds by the above bijection to the integral . Moreover, simple quasi-states correspond to simple topological measures.
1.2.2 Aarnes’s construction
In [2] Aarnes describes a general method of constructing simple topological measures on spaces satisfying a condition which Knudsen showed in [19] to be equivalent to if is a CW complex. Since we are only concerned with smooth manifolds, and any compact manifold is homeomorphic to a finite CW complex, for instance via a triangulation [5], this latter condition is the one we will use.
Aarnes’s method uses so-called solid sets. A set is solid if it is connected and its complement is also connected. To use Aarnes’s method, we need the notion of the spectrum of a Borel probability measure (see [4], where it is called the split spectrum). Let denote the space of Borel probability measures on . For its spectrum is the set of numbers such that there are disjoint solid with , . We then have [2]: if is such that , then there is a unique simple topological measure , such that for solid we have
[TABLE]
For future use we note that if is solid, then if and otherwise.
Denoting
[TABLE]
we therefore have the map announced at the beginning of this section:
[TABLE]
where is the set of quasi-states on , and is the quasi-state corresponding to by the Aarnes representation theorem.
1.2.3 Continuity of
Here we state our main result concerning the metric continuity property of , which is used in Section 2.2 to prove the estimate (1). To this end we need certain natural metrics on the spaces of measures and quasi-states in case is a metric space. Let us therefore assume that is a compact metric space. Wasserstein metrics are a natural family of metrics on parametrized by . They appear in optimal transport theory, see [23]. For we have the -Wasserstein metric
[TABLE]
where runs over Borel probability measures on with marginals and , that is and where are the two projections. The -Wasserstein metric is defined by
[TABLE]
with as before. The Kantorovich–Rubinstein duality [18], [12], [23] expresses via integration of Lipschitz functions on . Namely, let us denote by the space of Lipschitz functions on and for its Lipschitz pseudo-norm
[TABLE]
Then
[TABLE]
It is tempting to try to define analogous metrics on , but the major issue is that constructing quasi-states on with given marginals is quite a nontrivial task, see [16]. However the dual definition of , suggested to us by Leonid Polterovich, admits a straightforward generalization to :
[TABLE]
and, as it turns out, this is exactly the metric we need:
Theorem 1.8**.**
Let be a closed connected manifold with and let be a metric on inducing its topology. Then the map
[TABLE]
is -Lipschitz, that is for all and we have
[TABLE]
For completeness we include the following continuity result, which does not use metrics.
Theorem 1.9**.**
Assume is a closed connected manifold with . Then the map is continuous, where and are given the weak topology.
Theorems 1.8, 1.9 are proved in Section 2.3. It is interesting to note that they do not simply follow from one another, even though their proofs use similar ideas. Let us describe the reason in more detail. It is well-known that the -Wasserstein distances for finite induce the weak topology on [23]. Similarly we have the following proposition, proved in Section 2.3:
Proposition 1.10**.**
If is a compact metric space, then the metric on induces the weak topology.
However the topology induced on by is strictly stronger than the weak topology, for instance on we have as , while for all . For this reason we cannot simply say that Theorem 1.9 follows from Theorem 1.8, since the topologies on appearing in the two theorems are different. In the opposite direction, Theorem 1.9 implies that is continuous with respect to the weak topology on and the topology induced on by , but it does not imply the Lipschitz property.
1.3 Non-approximation results
In this section we present a wide class of quasi-states which cannot be approximated by quasi-states of the form for . The main application is the fact that symplectic quasi-states constructed via Floer homology on symplectic manifolds of dimension at least cannot be approximated by such quasi-states.
We have the following general non-approximation result for quasi-states “supported” on submanifolds of codimension at least .
Theorem 1.11**.**
Let be a closed connected Riemannian manifold with , and let be the induced distance function. Let and be a quasi-state and a topological measure on , corresponding to one another by the Aarnes representation theorem. Assume that there are closed connected submanifolds , of codimension at least , whose triple intersections are all empty, such that for all . Then there is a constant such that for all we have
[TABLE]
In particular, cannot be weakly approximated by quasi-states of the form for , thanks to Proposition 1.10.
A typical application of this theorem is in a situation when is invariant under a sufficiently large symmetry group and when there is a closed connected submanifold of codimension at least with . Here the result holds if there are symmetries of such that the quadruple of sets has empty triple intersections. What follows is a general result of this type in the context of symplectic geometry.
Theorem 1.12**.**
Let be a closed connected symplectic manifold of dimension such that , let be a quasi-state invariant under the action of the Hamiltonian group , and assume that there is a closed connected Lagrangian with the property that , where is the topological measure associated to . Then, given a Riemannian metric on , there is a constant such that
[TABLE]
for all .
Remark 1.13**.**
The assumption on the dimension is essential. Indeed, if is the median quasi-state on from Example 1.3 and is the corresponding topological measure, then is invariant under , where is the standard round symplectic form. A great circle is a Lagrangian submanifold with . Of course, is the value of at the Lebesgue measure.
The following corollary is the application of interest to us. Here refers to symplectic quasi-states constructed in [7].
Corollary 1.14**.**
Let be , , or , endowed with the standard Kähler structure. Then there is a constant such that for all we have
[TABLE]
This result is interesting, because quasi-states of the form , are constructed using “soft” techniques, referring in symplectic topology to results which do not use elliptic PDEs such as pseudoholomorphic curves (see [15]). On the other hand the quasi-states are constructed using “hard” techniques of symplectic topology, and it would be indeed very surprising if could be obtained as a weak limit of the .
Remark 1.15**.**
There are many more examples for which Corollary 1.14 holds, see [10], however for the sake of simplicity we only mention these two examples, which suffice to illustrate our point.
We do not know the optimal value of the constant in Corollary 1.14, which prompts the following
Question 1.16**.**
What is the optimal value of the constant ?
An explicit sharp value would be worthwhile to compute.
Acknowledgements**.**
We would like to thank Leonid Polterovich for suggesting the problems which gave rise to the results of this paper, for his constant interest, and for numerous discussions. We also thank Asaf Kislev, Pazit Haim-Kislev, and Eyal Ackerman for discussions regarding algorithms computing Reeb graphs of PL functions and the quasi-states corresponding to discrete measures. A. D. is partially supported by the Israel Science Foundation grant 1380/13. F. Z. is partially supported by the Israel Science Foundation grant 1825/14, and by grant number 1281 from the GIF, the German–Israeli Foundation for Scientific Research and Development.
2 Proofs
2.1 Preliminaries
2.1.1 Simple quasi-states on manifolds
Theorem 1.4 is concerned with the median quasi-state, which is a simple quasi-state on . Here we describe a general method of computing simple quasi-states on manifolds, in particular obtaining the descriptions of Example 1.3. The material here is not new. We gather it here for completeness and to establish notation.
Let be a compact tree, that is a finite simply-connected -dimensional CW complex. The result of [24] says that a quasi-state on must be linear. If , it follows that , being a simple quasi-state on , is the evaluation at a point by Remark 1.2. The definition of in this case says that is the unique point with the property that every connected component of satisfies . Indeed, we have , therefore, if are the connected components of , we have for all , and since are all open solid sets, it follows that . The uniqueness follows from the assumption that does not belong to the spectrum of .
Let now be a closed connected manifold with and let be a Morse function. Let be the Reeb graph of [21], that is the quotient space of by the equivalence relation whose equivalence classes are the connected components of level sets of . Let be the quotient map. It is well-known that is surjective on fundamental groups, which implies that is a tree. Let . It can be checked that if is closed and solid, then so is , which implies that , and moreover that . It follows that , meaning for .
The above considerations then imply that is the evaluation at a point, which we refer to as the -median of , denoted . In particular, if is such that , then
[TABLE]
Conclusion: the value of the simple quasi-state on the Morse function is the value of at the median , which is the unique point of with the property that every connected component of is such that . Stated in terms of and only, there is a unique component of a level set of with the property that every connected component of satisfies , and is the value of on .
The same reasoning applies when is a finite polyhedron with and is a piecewise linear function such that its values at the vertices of are pairwise distinct, meaning that for we can define the Reeb tree of , the -median and then is the value of on . We will use this particular case in the proof of Theorem 1.4, using a triangulation of and the corresponding piecewise linear approximation of a given function.
2.1.2 estimate
The metric continuity result, Theorem 1.8, will be used in the proof of the estimate (1) asserted in Theorem 1.4. It will be applied in the following form.
Proposition 2.1**.**
Let be a compact metric space, let be a measurable partition, and let . Pick for all and define
[TABLE]
Then
[TABLE]
Proof.
For a measurable set define by for measurable . The probability measure
[TABLE]
has as its marginals. A point lies in the support of if an only if there is such that and , thus and the result follows from the definition of , (4). ∎
For the proof of estimate (1) we need the following particular case. We will subdivide into regions of equal area and Euclidean diameter as in [25], choose a point in the interior of every region, and assemble these points into a set . Letting be the Lebesgue measure and be the probability measure uniformly distributed on , Proposition 2.1 in this case says that
[TABLE]
2.2 Proof of Theorem 1.4
The proof consists of a description of the announced algorithm, and a verification of the estimate (1). Before we move on to the details, let us give an overview of the algorithm as well as the estimate. We remind the reader that the metric on we are using is the restriction of the Euclidean metric on , and we denote it by .
2.2.1 Overview
First, given the parameter , we construct a triangulation of having triangles, using a regular inscribed icosahedron. The lower bound on is explained below. We replace the given function by the unique function which is piecewise linear on the simplexes of and which coincides with at the vertices of . The triangulations we use imply that
[TABLE]
Note the numerical values of these constants: and respectively. The second constant especially is most likely far from the actual values obtained in practice; here we present constants for which we can obtain relatively simple proofs.
Since by Remark 1.2, quasi-states are -Lipschitz with respect to the -norm, we have
[TABLE]
The next step is to approximate . This is done as follows. We subdivide into regions of equal area and diameter , where is an odd integer . We assume this bound for the estimates in Lemmata 2.2, 2.4, 2.3 to work. Moreover, we assume that , which in particular forces . This assumption and the specific subdivision we use guarantees that each region contains a vertex of in its interior. We fix such a vertex for every region, and let be the set of these vertices. The idea now is to replace by , where is the Aarnes quasi-state corresponding to , see Example 1.3. Equation (6) says that , and therefore Theorem 1.8 yields , whence
[TABLE]
therefore in total we obtain
[TABLE]
or, taking the maximal value of permitted by the above assumption, which implies , we have
[TABLE]
where , which is the estimate asserted in Theorem 1.4.
It remains to compute , which will be the output of the algorithm. We can perturb such that it has pairwise distinct values at the vertices of . Such a perturbation can be made arbitrarily small in the -norm, and thus its effect on is arbitrarily small. It follows from the discussion in Section 2.1.1 that is obtained as follows. Let be the quotient map onto the Reeb tree of . The restriction of to the set of vertices of is injective by the definition of the Reeb graph, therefore is the uniformly distributed discrete measure supported on the set . The -median of is the unique point in such that every connected component of satisfies , meaning that contains less than half the points of the set . We use an algorithm described in [6] to compute as a rooted tree whose nodes are in bijection with the vertices of . It follows that must be a node of , and the remaining step of the algorithm finds it via enumeration.
2.2.2 The algorithm
Here we present a detailed description of the algorithm summarized above, together with a computation of its complexity. The algorithm is comprised of several steps. From the point of view of complexity, the most demanding step, and indeed the step whose complexity dominates that of the other ones, is the computation of the Reeb tree of the piecewise linear function . There are a few auxiliary results, whose proofs we defer to Section 2.2.4.
Fix parameters satisfying the assumptions in Section 2.2.1.
Step 1. We subdivide into an odd number of regions having equal area and diameter , using the algorithm described in [25]. To every region we associate a boolean flag , initially set to false.
Lemma 2.2**.**
The complexity of this step if .
Step 2. We construct a triangulation of into triangles, as follows. Take a regular icosahedron inscribed into , subdivide each one of its faces into congruent triangles, and project them to via the radial projection. For each vertex of we create a boolean flag , initially set to false. Then we enumerate the vertices, and for each vertex we compute the region containing in its interior, and if is set to true, we move on to the next vertex, otherwise we set and to true.
We have the following important result. A spherical cap is the intersection of with a half-space of .
Lemma 2.3**.**
Every region of the subdivision of Step 1 contains a spherical cap for which the Euclidean distance from its center to the rim is at least
[TABLE]
Together with the assumption on , this implies that the algorithm results in a choice of a unique vertex of for every region , thereby marking vertices.
The particular algorithm from Step 1 which computes the regions allows for the following.
Lemma 2.4**.**
The complexity of finding the region containing a given point in is .
Since the enumeration has complexity times the maximal complexity of each step, and the latter is as implied by the lemma, we see that the total complexity for this step is .
Step 3. Replace with the PL function whose values at the vertices of the triangulation coincide with those of . This has complexity .
Step 4. Using the algorithm described in [6], we compute the Reeb tree of . This algorithm runs in time , see ibid. Its output is a rooted tree with the root being the absolute minimum of , and the nodes being in a one-to-one correspondence with the vertices of . The total complexity of this step is .
Step 5. Label the nodes of the Reeb tree with the flags of Step 2, and treat them as integers, so that false corresponds to [math] while true corresponds to . Create an integer counter for each node of the tree and set it to zero. Define the following recursive function COUNT which takes as input a node of and whose output is a nonnegative integer: the function, applied to a node returns the sum of (treated as an integer) and the return values of COUNT applied to all the children of if it has any; also COUNT records the integer thus obtained in the counter .
After running COUNT on the Reeb tree of every node carries the number of vertices marked as true by the flags where runs over all the descendants of including itself.
This step has complexity .
Step 6. The last step computes the -median of . We remarked above that it is one of the nodes of . Indeed, since the measure is concentrated on nodes, cannot lie in the interior of an edge, because it would violate uniqueness. We claim that the desired node is the unique one satisfying the following conditions: (i) its count from the previous step is at least and (ii) it has maximal depth with respect to the root of . The uniqueness can be seen as follows. If are two such nodes, they have the same root depth, therefore the subtrees rooted at must be disjoint, since otherwise they would coincide. But then the total count of and would be at least , contradicting the fact that contains points. It is also clear that such a node exists since the count of the root of is , and it drops as we move away from the root.
It follows that can be found by enumerating the nodes of . This has complexity .
Total complexity of the algorithm: We see that the total complexity of the algorithm is , as claimed.
2.2.3 The estimate
It remains to prove the inequalities (7), which is what we do here. Recall that we are using the restriction of the Euclidean metric to .
First, we treat the case of general triangulations. By a triangulation we mean a finite collection of points in , arranged into triples, corresponding to the vertices of the triangles of the triangulation, such that the following holds:
- •
if is such a triple, then the corresponding linear simplex, which is the convex hull of the in , does not pass through ;
- •
if is the radial projection, the images cover as varies over the linear simplexes corresponding to the triangles of the triangulation, while their interiors are pairwise disjoint;
- •
if two triangles of the triangulation intersect, they either coincide, or the intersection is a common vertex or a common edge of .
In this case there is a unique continuous function such that for every linear simplex , where and is the unique affine function which coincides with at the vertices of . We have
Proposition 2.5**.**
- (i)
, where runs over the linear simplexes corresponding to the triangulation; 2. (ii)
* is Lipschitz with respect to and*
[TABLE]
where is such that all the linear simplexes of the triangulation have the property that each one of their angles lies in .
To prove the estimates (7), we need to prove the following lemma. By a curvilinear simplex we mean the image of a linear simplex of the triangulation. Recall the icosahedral triangulation from Step 2 of Section 2.2.2.
Lemma 2.6**.**
The icosahedral triangulation with triangles satisfies: (i) the maximal diameter of a curvilinear simplex is at most
[TABLE]
(ii) the angle of point (ii) of Proposition 2.5 can be chosen to equal
[TABLE]
therefore the constant in equation (8) is
[TABLE]
2.2.4 Proofs of auxiliary results
Here we give the proofs of Lemmata 2.2, 2.3, 2.4, 2.6, and Proposition 2.5.
Proof of Lemma 2.3.
Let us summarize the necessary information from [25]. The result we need from there is Theorem 2.8, whose proof starts on page 25. For concreteness, we fix the parameters on that page to their sample values as stated on page 27 after equation (2.4). What is written there is that the estimates based on the values of the parameters hold when the number of regions of the subdivision is at least . Moreover, the number of regions should be at least for the estimates to work. This is the ultimate reason for our assumptions on .
We denote the spherical metric on by throughout, that is for .
Points on will be denoted here using their spherical coordinates . The regions of the subdivision are given by rectangles in spherical coordinated . The construction described in the proof of Theorem 2.8 ibid. results in the subdivision of into bands bounded by parallels with latitudes
[TABLE]
where is the largest odd integer . The band bounded between and contains regions, each one given in spherical coordinates by the rectangle
[TABLE]
We have .
Fix an integer . Consider the center of in spherical coordinates:
[TABLE]
It is not hard to see that the minimal spherical distance from to a parallel passing through the top or the bottom edge of is . Elementary spherical geometry also shows that the minimal spherical distance from to a meridian passing through the right or the left edge of is
[TABLE]
It follows that the minimal spherical distance from to a point in the boundary is
[TABLE]
Using the inequalities and for , this implies
[TABLE]
Let us estimate the second term in the minimum. For this we use the known fact that the area between parallels with latitudes is . On the other hand, since this band contains regions, it has area , meaning
[TABLE]
Thus we have
[TABLE]
Equation (2.20) in [25] reads
[TABLE]
where and . The constants are defined in equations (2.5), (2.12), (2.13), respectively, and . Combined with our estimates so far, this means that
[TABLE]
This holds for all the regions in the bands between and for . What remains are the polar bands, given by the rectangles
[TABLE]
Letting be the center of one of these regions in spherical coordinates, the above discussion shows that its spherical distance to the boundary of the region is at least
[TABLE]
Let
[TABLE]
It follows that every region in the subdivision contains a spherical cap with spherical radius
[TABLE]
and therefore a spherical cap with Euclidean radius at least
[TABLE]
We have
[TABLE]
∎
Proof of Lemma 2.4.
The subdivision algorithm of [25] produces approximate latitudes , which form an arithmetic progression and exact latitudes for the parallels bounding the bands which are then subdivided into the regions. There are estimates [25, Equation (2.20)]:
[TABLE]
Given the latitude of the given point in , we can find the interval to which it belongs. Since the angles are an arithmetic progression, that is , finding the appropriate amounts to computing the integer part of a number, which has complexity . The actual interval we are looking for is . The above estimates tell us that the number of the corresponding interval differs from the value found in the previous calculation by at most a constant. We can then enumerate all the candidate intervals to find which one contains . This also has complexity , since the number of intervals we have to enumerate is bounded above by a constant independent of . Finally, since the azimuths of the regions form another arithmetic progression, namely , finding the corresponding interval of azimuthal angles which contains the azimuth of the given point amounts to computing the integer part of a number is therefore it has complexity . ∎
Proof of Lemma 2.2.
As mentioned in the proof of Lemma 2.3, the regions of the subdivision are rectangles with respect to the spherical coordinates. The latitudes of the parallels bounding the bands are obtained in two stages. The total number of bands is approximately . In the first stage, one finds approximate angles, which are equally spaced, for which the complexity is . Then one corrects the approximate angles to exact ones, using Lemma 2.11 of [25]. The lemma uses an inductive procedure which runs on a list of length , and at every step corrects the two outermost entries in the list on each side. The total number of operations therefore is linear in the size of the list and thus has complexity . Finally each band is subdivided into the required number of regions. Computing the azimuthal angles of the regions therefore has complexity proportional to the total number of the regions, that is . The total complexity therefore is . ∎
Proof of Proposition 2.5.
Keep the notations of Section 2.2.3. For a linear simplex let be the corresponding curvilinear simplex on .
For (i), let and assume that is a linear simplex with . Without loss of generality we assume that . Since and is an affine function, it follows that , thus
[TABLE]
and
[TABLE]
and we are done.
For (ii), let be the union of the linear simplexes of the triangulation, let be the restriction of the radial projection map, and let be defined by for all . Note that is a polyhedron, is a homeomorphism, is a well-defined PL function on , and .
For , define to be the length of a shortest path on between of the form where is a round geodesic on between and . It is not hard to see that is a metric on . Due to our assumptions on the triangulation it follows that on every linear simplex , where is the Euclidean metric on .
Note that is a contraction, that is -Lipschitz, where is the round metric on . Since , it follows that is -Lipschitz, and therefore
[TABLE]
where we wrote the metrics explicitly. It therefore suffices to show that
[TABLE]
where is the angle appearing in the formulation.
We claim that
[TABLE]
Clearly the left-hand side is the right-hand side. To see the opposite inequality, let be two distinct points and let be a shortest path on with , . Let be the distinct linear simplexes which intersect the image of along the interior or along the interior of an edge. Renaming them if necessary, we can assume that there are points such that for . Note that the same simplex cannot intersect in two different segments, because is a shortest round geodesic on between and the images of the linear simplexes by are geodesically convex subsets of , therefore they can only intersect a shortest geodesic along a connected segment.
Let us denote for . Note that since is a straight segment, it is the shortest path between , and therefore is the length of . Since is the length of , which in turn is the sum of the lengths of the , which as we just saw is the sum of , we obtain
[TABLE]
It follows that
[TABLE]
as claimed.
It remains to show that . Let . For the purpose of estimating the Lipschitz constant, we can translate and rotate so that it is contained in . We can further assume that relative to the coordinates on , we have , , , with , and, subtracting a constant from , we can assume that . Denote , . Let be the the linear function such that , . Since , the Lipschitz constants of and are the same. Since is linear, its Lipschitz constant is
[TABLE]
We have
[TABLE]
Next,
[TABLE]
where is the angle between and . We have
[TABLE]
Let . Then for . Moreover, since by assumption , we have and . Plugging these estimates into the last expression, we obtain
[TABLE]
and the proof of the proposition is thereby complete. ∎
Proof of Lemma 2.6.
For (i), let be one of the congruent triangles. The corresponding curvilinear simplex is where is the radial projection. Since is , its Lipschitz constant can be estimated in terms of the operator norm of its differential, namely if we restrict to the complement of the Euclidean ball of radius , then
[TABLE]
where
[TABLE]
An explicit calculation shows that , and therefore
[TABLE]
It follows that
[TABLE]
where is the distance of the origin to the closest point on . We have where is the insphere radius of the icosahedron.
Next, since is one of the congruent triangles into which we subdivided a face of the icosahedron, its diameter is times the diameter of the face, which equals its edge length , since it is an equilateral triangle. In total
[TABLE]
The ratio of the edge length to the insphere radius for the icosahedron is \sqrt{3}\big{(}3-\sqrt{5}\big{)}, thus
[TABLE]
For (ii) we will present a general argument for estimating the angles of a linear simplex whose vertices are obtained by radially projecting three points lying inside the -ball bounded by . Let be fixed and consider the disk , where is the closed Euclidean ball of radius . Consider a triangle with vertices and let . In our case is equilateral so all of its interior angles are , and we would like to estimate the angles of the Euclidean triangle with vertices , more specifically we wish to obtain a lower estimate on these angles. The strategy is to obtain upper bounds on these angles, since if every angle is at most , then every angle is at least .
First, note that each interior spherical angle of the spherical triangle is at least the angle of at the corresponding vertex. Therefore to obtain upper bounds on the angles of we can bound the spherical angles of from above. This can be done by considering the differential of . Let be one of the vertices of and let be two unit vectors tangent to pointing from in the directions of the other two vertices. Then
[TABLE]
and similarly for . Letting be angle between , the angles between and , respectively, and the angle between , which is the spherical angle of at , an elementary calculation shows that
[TABLE]
Since we wish to obtain an upper bound on , we need to establish a lower bound on . Using the fact that is constrained to the disk , we can prove that . Since by assumption, we have . Moreover writing , , we come to the minimization problem of the function
[TABLE]
over the square . Since the angles are not independent, because the angle between is set to , the actual lower bound on is going to be larger than the absolute minimum of this function, but the latter is much more easily computed, and in fact it is attained at the point , therefore it equals , so in total we obtain
[TABLE]
For the icosahedral triangulation all the triangles lie in planes which are at a distance from at least the insphere radius of the icosahedron, which is , therefore can be set to this number, which implies that the spherical angles of the projection of one of the triangles of the triangulation are all at most \arccos\big{(}1-\frac{1}{2z^{2}}\big{)} radians. By the above, this also is an upper bound on the angles of the corresponding Euclidean triangle, which in turn implies that all the angles are at least
[TABLE]
∎
2.3 Approximation results
We start by proving Theorems 1.8 and 1.9. For this we will need the results of Section 2.1.1 as well as the following elementary fact: if is any topological measure on , then any two closed subsets with must intersect. Indeed, otherwise by the additivity and monotonicity of we would have
[TABLE]
which is a contradiction.
Proof of Theorem 1.8.
Let us first prove the theorem for a Morse function . Let . Let . Let be the closed -neighborhood of . The complement is a countable disjoint union of open connected sets . Let be the decomposition into connected components. Since , every is contained in one of the .
For a Borel subset let us denote
[TABLE]
Fix one of the components , and assume . We see that is connected and disjoint from . Since and is itself connected and disjoint from , it follows that .
Proposition 5 of [13] exhibits another formula for :
[TABLE]
It follows that
[TABLE]
implying that . From the countable additivity of [17] it follows that . Since , it follows that . Since and since is Lipschitz, we obtain
[TABLE]
The assertion now follows from the definition of , (4).
If is an arbitrary Lipschitz function, for every there is a Morse function with and . It then follows that
[TABLE]
Since quasi-states are -Lipschitz with respect to the -norm, the first and third terms in the right-hand side are at most , and for the middle term we have just established an upper bound of , thus
[TABLE]
and the result follows upon taking . ∎
Proof of Theorem 1.9.
The space being metrizable, it suffices to show that if is a sequence converging to , then for every .
Let us first prove the theorem when is a Morse function. Let . Let be the connected components of . Recall that for all . Let be the Reeb graph of and let be the quotient map. Let be the continuous function such that . The function induces a metric on , where is the infimum of total variations of over all paths connecting .
Fix . Let be the preimage by of the open -neighborhood of in with respect to , and let . Then . Indeed, otherwise we would have \mu\big{(}m\cup\bigcup_{j\neq i}C_{j}\big{)}=\frac{1}{2} and , and since and are closed and disjoint, this would contradict the assumption .
Note that is connected. Since it is also closed, it follows from the portmanteau theorem [3] that , and therefore that there is such that for all and we have . Since the complement of is connected as well, we see that is solid, and therefore from (3) it follows that , and therefore from additivity that . From monotonicity it follows that . Since , from the discussion at the beginning of the subsection it follows that . Since , we see that
[TABLE]
which proves that .
Let now be arbitrary. Then for there is a Morse function with . We have
[TABLE]
and owing to the Lipschitz property of quasi-states we see that the first and the last terms in the right-hand side are . Taking with respect to , we obtain
[TABLE]
and since is arbitrary, we arrive at the desired conclusion . ∎
We also prove Proposition 1.10, which states that the distance induces the weak topology on .
Proof of Proposition 1.10.
In one direction, assume that a net of quasi-states converges to with respect to , that is for every Lipschitz we have , therefore . By the Stone–Weierstraß theorem, is dense in , therefore for every and we can find with , therefore
[TABLE]
Quasi-states being -Lipschitz, the first and the third terms on the right are , while the middle term goes to zero as , because is Lipschitz, therefore
[TABLE]
and taking , we see that . Thus weakly.
For the other direction, note that if we fix , then the subspace
[TABLE]
is compact due to the Arzelà–Ascoli theorem. It follows that in (5) the supremum is attained, that is for every there is such that
[TABLE]
Assume now that weakly. It is enough to prove that . Let us pass to a subnet such that
[TABLE]
and let us prove that the latter limit is zero. To simplify notation, we will write for this subnet as well.
For every fix with
[TABLE]
Since is compact, there is a subnet of converging to . By abuse of notation we denote this subnet again by . Then we have
[TABLE]
where we again used the Lipschitz property of quasi-states. Now by the definition of , and by the weak convergence of to . Thus and the proposition is proved. ∎
2.4 Non-approximation results
For the proof of Theorem 1.11 we need the following elementary lemma.
Lemma 2.7**.**
Let be a probability space. Assume there are such that the triple intersections are all empty. Then there is such that .
Proof.
Assume the contrary: for all . Since the triple intersections are empty, we have
[TABLE]
which implies
[TABLE]
which is a contradiction since the sets are pairwise disjoint for . ∎
Proof of Theorem 1.11.
For a subset we let the open -neighborhood of be denoted by .
There is such every is a tubular neighborhood of , and such that the triple intersections of are still empty. Fix . It follows from Lemma 2.7 that there is such that . Since is assumed to have codimension at least , the tubular neighborhood has connected complement and is therefore solid. From (3) it follows that . Thus and for all .
Let us define to be the distance from . Then and thus . We then have
[TABLE]
since the integrand is for . On the other hand, since and , we have . Therefore, since is -Lipschitz, we have
[TABLE]
as claimed. ∎
Proof of Theorem 1.12.
Let be a Weinstein neighborhood of (see [20, Theorem 3.33]), that is there is an open subset containing and a symplectomorphism where , and . Let be the zero function. For generically chosen Morse functions , the functions , all have pairwise disjoint critical point sets. In particular, the Lagrangian submanifolds , have empty triple intersections, where for a -form on we let be the image of viewed as a section . Indeed, for two -forms on we have , which is in bijection with the zero set of .
Scaling if necessary, we can assume that for all , and so we can define Lagrangian submanifolds . It is a standard fact that are Hamiltonian isotopic to . Therefore we have found a quadruple of Lagrangian submanifolds in , all Hamiltonian isotopic to , with empty triple intersections. Since and are invariant under the action of the Hamiltonian group of , it follows that for . Since Lagrangians have codimension , we see that all the conditions of Theorem 1.11 are satisfied, and the conclusion follows. ∎
Proof of Corollary 1.14.
If , it is known that the topological measure associated to satisfies where is the Clifford torus [10]. If , then for the product of equators we have , ibid. The result now follows from Theorem 1.12, using the fact that is invariant under the Hamiltonian group. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Johan F. Aarnes. Quasi-states and quasi-measures. Adv. Math. , 86(1):41–67, 1991.
- 2[2] Johan F. Aarnes. Construction of non-subadditive measures and discretization of Borel measures. Fund. Math. , 147(3):213–237, 1995.
- 3[3] Rabi Bhattacharya and Edward C. Waymire. Weak Convergence of Probability Measures on Metric Spaces , pages 135–157. Springer International Publishing, Cham, 2016.
- 4[4] S. Butler. q 𝑞 q -functions and extreme topological measures. J. Math. Anal. Appl. , 307(2):465–479, 2005.
- 5[5] Stewart S. Cairns. A simple triangulation method for smooth manifolds. Bull. Amer. Math. Soc. , 67:389–390, 1961.
- 6[6] Kree Cole-Mc Laughlin, Herbert Edelsbrunner, John Harer, Vijay Natarajan, and Valerio Pascucci. Loops in Reeb graphs of 2-manifolds. Discrete Comput. Geom. , 32(2):231–244, 2004.
- 7[7] Michael Entov and Leonid Polterovich. Calabi quasimorphism and quantum homology. Int. Math. Res. Not. , 30:1635–1676, 2003.
- 8[8] Michael Entov and Leonid Polterovich. Quasi-states and symplectic intersections. Comm. Math. Helv. , 81(1):75–99, 2006. DOI: 10.4171/CMH/43.
