On The Expected Total Curvature of Confined Equilateral Quadrilaterals
Gabriel Khan

TL;DR
This paper proves that the expected total curvature of random spatial equilateral quadrilaterals decreases as their diameter increases, using curvature inequalities and stochastic ordering in action-angle coordinates.
Contribution
It introduces new curvature monotonicity inequalities and applies Crofton's differential equation extension to analyze expected total curvature behavior.
Findings
Expected total curvature decreases with increasing diameter
Established curvature monotonicity inequalities
Applied stochastic ordering and differential equations
Abstract
In this paper, we prove that the total expected curvature for random spatial equilateral quadrilaterals with diameter at most decreases as increases. To do so, we prove several curvature monotonicity inequalities and stochastic ordering lemmas in terms the of the action-angle coordinates. Using these, we can use Baddeley's extension of Crofton's differential equation to show that the derivative of the expected total curvature is non-positive.
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.
Taxonomy
TopicsGeometric Analysis and Curvature Flows · Point processes and geometric inequalities · Geometry and complex manifolds
On the total curvature of confined equilateral quadrilaterals
Gabriel Khan
Abstract.
In this paper, we prove that the total expected curvature for random spatial equilateral quadrilaterals with diameter at most decreases as increases. To do so, we prove several curvature monotonicity inequalities and stochastic ordering lemmas in terms the of the action-angle coordinates. Using these, we can use Baddeley’s extension of Crofton’s differential equation to show that the derivative of the expected total curvature is non-positive.
1. Introduction
Random spatial polygons have been studied extensively from many different viewpoints. The original motivation for this problem is that spatial polygons are a simple model for the folding of polymers. As such, it is of considerable interest to understand the statistical properties of the geometry and topology of such objects.
The moduli space of spatial polygons with given edge lengths is a fascinating object in its own right. When or a generic assumption on the edge lengths is made, this moduli space is a smooth Kähler manifold of dimension [6]. There are still many open questions about this space, which remains an active subject of research. It is also possible to use the symplectic structure of the moduli space to establish theorems about the geometry of random walks and polygons [3].
In this work, we study confined random polygons, using the diameter of a polygon as a measure of its confinement. There are other possible measures as well, such as the confinement radius or the gyration radius of the polygon [8]. Imposing confinement on a random polygon affects the geometry in subtle ways and is a topic of active research. In this work we study the curvature of confined random polygons, which was previously studied by Diao et al. [4]. We define to be the moduli space of equilateral spatial polygons with diameter at most and the expected total curvature of polygons in . More precisely,
[TABLE]
where the symplectic volume form.
It has been observed that confinement tends to increase the expected total curvature. Numerical simulation bears this out and heuristically, a polygon must turn on itself repeatedly in order to remain confined. However, proving this rigorously for general polygons seems to be a difficult problem. The main contribution of our work is to prove this conjecture for equilateral random quadrilaterals.
Theorem 1**.**
* is non-increasing as increases.*
This result gives some insight, albeit indirectly, into the probability that a random problem is knotted. This is a question of considerable interest, as the knottedness of a polymer can directly affect its physical properties. Heuristically, we expect that confinement forces the polygon to tangle and so confined polygons are more likely to be knotted than unconfined ones. This has been demonstrated numerically [7], but it is very difficult to explicitly compute knotting probabilities.
Polygons with curvature less than are unknots via the Fary-Milnor theorem [9], so expected total curvature can be used as a very rough proxy for knottedness. As all quadrilaterals and pentagons are unknotted, our main theorem does not give direct insight into the knottedness phenomena. However, we also show that when the number of sides is even, the probability of a random polygon being knotted is decreasing when the confinement diameter is close to .
1.1. Acknowledgments
Thanks to Clayton Shonkwiler for informing the author of this problem and for some helpful discussions. Thanks also to Alex Wright for providing some flexible polygons made from straw and string which were very helpful for experiments. He also provided some very helpful lectures and notes [11] on the moduli space of spatial polygons. This work was partially supported by DARPA/ARO Grant W911NF-16-1-0383 (Information Geometry: Geometrization of Science of Information, PI: Zhang).
2. Notation and Conventions
To define the moduli space of equilateral spatial polygons, we consider the unit sphere and consider the map :
[TABLE]
The moduli space of spatial equilateral polygons is defined to be . Colloquially, are the collection of edges that sum to 0 (i.e form a closed polygon), from which we quotient out the action of isometries. In the language of [11], is equivalent to but we will focus on equilateral polygons and so suppress the repeated ones. It can be shown that is not a manifold in general ([math] is not a regular value for when is even), but is a manifold when is odd or is equal to 4.
1$$2$$3$$1$$1$$2$$v_{1}$$v_{4}$$v_{3}$$v_{2}$$\ell_{3}
Figure 0: An equilateral spatial quadrilateral with labeled.
Given an equilateral spatial polygon , we can consider its vertices and edges with the convention that connects and . From this, we induce action-angle coordinates on , where, at a point , and the angle coordinate is given by the angle of rotation about the line . For quadrilaterals, is the angle between the triangles and . The action-angle values form coordinates on all but a set of positive codimension on and induce with a natural symplectic structure with invariant volume form [6]. For most of this paper, we will not use of the symplectic structure, but do use its associated volume form.
In order to consider confined polygons, we denote to be the moduli space of equilateral polygons with diameter at most . More precisely,
[TABLE]
We then define the total expected curvature of polygons in :
[TABLE]
2.1. Notation for quadrilaterals
We now specialize to quadrilaterals. To aid the intuition, it might be worthwhile to observe that is a topologically Riemann sphere but its intrinsic metric may not be round. Although we will not need to use this fact explicitly, it helps inform the geometric intuition.
To better understand , we introduce a slight change of coordinates that are useful for computation. Given , we can perform an isometry on so that
[TABLE]
We treat and as coordinates, in which case we have and . Since there is a single and coordinate in this case, we will drop the subscripts, denoting them as and , respectively.
Note that there are symmetries of an equilateral polygon induced by relabeling the vertices, which correspond to distinct points in . Using these symmetries will help simplify the calculations. For instance, we denote to be the subset of where . Similarly, we denote to be the subset of where . Any quadrilateral whose vertices are in the above form is either in or can be reflected to a polygon in . As such, polygons in and have the same expected curvature, so it suffices to work solely in terms of .
3. The geometry of and its boundary sets
We now define some natural boundary sets of . We define to be the set . Letting go to zero, we define as the set-theoretic limit
[TABLE]
More explicitly, consists of two separate parts; the set where and and the set where and . We denote the former part by and the latter by . Note that is not the boundary of in the traditional sense, as it does not include the parts where , , or . In Figure 1, is the shaded region in -coordinates. The top and right parts of the boundary is .
Figure 1: and for
We can define two projections from onto . The first of these, projects to by fixing the coordinate. The second, projects to in a way that fixes the coordinate. More precisely, for a given ,
[TABLE]
Using the uniform measure on , we induce with two measures and . Heuristically, is the natural boundary measure, whereas is the marginal probability measure induced from the uniform measure on . To define , we consider the uniform measure on , normalized so that its total measure is 1. We define to be the limit of these measures on . This turns out to be a uniform measure on , but is not the uniform measure on . In Figure 1, the distance of the green curve from the black corresponds to the density .
Intuitively, we define as the marginal distributions of and with respect to the normalized uniform measure on . For purposes that will later become clear, we want the measure to be the same as . To ensure this, we set and . Using symmetry, it is possible to show that , but we will not prove this here.
For , we define
[TABLE]
Similarly, for and , we define
[TABLE]
When , is not a probability measure on . The reason for this is that for a polygon with , independent of . To avoid this issue, we restrict our attention to the range . We will return to the case for larger later.
3.1. Semi-explicit calculations of and
It is necessary to calculate these measures more explicitly to understand their properties. To do so, note that
[TABLE]
In coordinates, this is given by the expression
[TABLE]
For , this allows us to write out the boundary sets explicitly.
[TABLE]
[TABLE]
In order to find the density , we must calculate the derivatives and . Doing so, we find
[TABLE]
The measure satisfies the following.
[TABLE]
We will not compute explicitly on . However, for a fixed value, is proportional to the height of the shaded region in Figure 1 as a function of .
4. Stochastic orderings of the boundary measures
We now prove various lemmata on the stochastic ordering of and . To do so, we first note the following two lemmas. These can be proven directly by differentiating the relevant distance formulas, so we omit the proofs here.
Lemma 2**.**
For a fixed action coordinate , the distance is monotonically increasing in and the other distances are unchanged. As such, is star-shaped with respect to
Since for fixed , is decreasing in the -coordinate, we have the following.
Lemma 3**.**
If and , then .
Combining these two lemmas, this implies that the density is non-increasing as a function of on . Since and are normalized to have the same total mass on , this shows the following.
Lemma 4**.**
The measure is stochastically less than on as a function of .
Although it is more difficult to prove, a similar phenomena also occurs on .
Lemma 5**.**
For , the measure is stochastically less than on as a function of .
Proof.
To show this, we will prove the monotonicity of likelihood ratio property, which implies first-order stochastic dominance. On , we consider
[TABLE]
We want to show that this is increasing in . To do so, we take a further derivative.
[TABLE]
The denominator of this term is negative, so we disregard it and consider only the terms in parenthesis in the numerator, which we define as :
[TABLE]
If we can show that is non-negative for , then necessarily the entire expression will be as well. However, vanishes at . As such, we consider and show that this is non-negative. Doing so, we find that
[TABLE]
Since this is non-negative for , is non-negative for and hence is non-decreasing on . This implies that is stochastically less than , as desired.
∎
5. Monotonicity of total curvature
We now consider the curvature of spatial quadrilaterals, in order to show that larger polygons have smaller total curvature. More precisely, we show that the curvature is decreasing in the the and coordinates. We first show that the curvature is decreasing if one increases the angle coordinate while leaving the coordinate fixed.
Lemma 6**.**
Suppose has action-angle coordinates . Then, the -coordinates, the total curvature of the spatial polygon is monotonically decreasing in as varies from [math] to .
Proof.
Changing only changes the angle between and . As such, it suffices to show that both of these are decreasing in . As before, we suppose , . We consider as the argument is exactly the same. The angle satisfies , which is decreasing in as ranges from [math] to . ∎
The curvature is also decreasing if we increase the action coordinate. From experimentation with spatial polygons, this is intuitively plausible, but it is not so simple to prove analytically. The reason for this is that when , the total curvature is constant in . As such, any proof must be sensitive to the fact that all derivatives of the total curvature vanish when .
Lemma 7**.**
For a quadrilateral with fixed angle coordinate , the total curvature is non-increasing in .
Proof.
Using our initial embedding for quadrilaterals, we can see that the total curvature is
[TABLE]
To continue, we change our coordinates to and . In these new coordinates,
[TABLE]
Taking the derivative of with respect to , we find the following.
[TABLE]
To show that this expression is non-positive, we fix and maximize the first term with respect to . Note that this is equivalent to maximizing
[TABLE]
which is the slope of the secant line for the function
[TABLE]
through the points and . Computing the second derivative of , we find the following.
[TABLE]
This is non-positive and so is concave. Since , in order to maximize the slope of the secant line, we set . Doing so, we find that
[TABLE]
∎
These two lemmas show that if we increase either the angle or the action (or both), the total curvature decreases. When combined with Lemma 1, the results of this section show the following.
Lemma 8**.**
The total curvature of a quadrilateral in is decreasing as a function of . Similarly, the total curvature of a quadrilateral in is non-increasing as a function of .
6. The derivative of the expected total curvature
In order to calculate the derivative of the expected total curvature, we will use Crofton’s differential equation. This formula was first derived by Crofton in 1885 but was only proven rigorously in later work of Baddeley [1]. For a good survey on the topic, we refer to the paper of Eisenberg and Sullivan [5]. In this section, we also use the notion of transport for probability measures. For a complete reference on this topic, we refer the reader to the first chapter of the book by Villani [10].
We define as the expected total curvature when polygons are chosen from with respect to the measure . More precisely,
[TABLE]
We also define to be the total expected curvature when the polygons are chosen from with respect to the measure :
[TABLE]
With this notation, Crofton’s differential equation shows the following:
[TABLE]
Combining Lemma 7 and the stochastic ordering lemmas (Lemmas 4 and 5), this shows that . To compare and , note that there is a natural transport from and , induced by . Lemmas 6 and 7 imply that this transport decreases the total curvature, which implies .
Combining the previous two inequalities, we find that . As such, the second term in the above differential equation is non-positive, so the expected total curvature is non-increasing. This proves the following.
Theorem 9**.**
For , is non-increasing in .
7. The proof for
In this section, we prove that is also decreasing for . In this range, the diameter is exactly twice the radius of the polygon so this proves that the expected curvature is also decreasing as a function of the radius. It is worth noting that this approach can be adapted to work for as well.
Figure 2: and its boundary for
We define the set to be
[TABLE]
Explicitly, this is the subset of where and is depicted in Figure 2 in coordinates. Given any polygon , we can find an associated polygon in which is obtained from by a mirror reflection and a relabeling of the vertices. As such, the expected curvature on is the same as the expected curvature on .
We now define the natural boundary of :
[TABLE]
As before, we set to be the natural boundary measure on and to be the marginal distribution of the uniform measure on in terms of . The construction of analogous to and except that consists of a single segment so there is no need to consider . In Figure 2, the height of the green curve corresponds the density , which is constant. The height of the red curve corresponds to the density . We can also define the associated projection which fixes the coordinate.
For fixed , is decreasing in and for fixed , is increasing in . As such, is stochastically less than . Furthermore, the transport from to decreases the total curvature. This allows us to immediately repeat the previous argument involving Crofton’s differential equation and prove Theorem 1, which we restate for convenience.
Theorem 10**.**
For , is non-increasing in .
As before, this relies on the curvature monotonicity lemmas, but does not use the second lemma on stochastic ordering.
8. Miscellaneous results
For arbitrary , it is possible to control the total curvature of when the diameter is either very large or very small. The following two lemmas can be obtained using straightforward estimates on angles between each edge, so we omit their proofs.
Lemma 11**.**
If the diameter is 1, then the total curvature of an equilateral polygon with edges is at least .
Lemma 12**.**
If is even and the diameter is greater than with small, the total curvature of an equilateral polygon with edges is .
From the work in [3], the expected total curvature is of an equilateral random polygon converges to as gets large. The previous two inequalities give lower and upper bounds on , respectively and in conjunction with Crofton’s differential equation, these estimates show that is decreasing near for large and near for even .
Furthermore, the final estimate can be applied to show a similar result for the knotting probability. For sufficiently small, if an equilateral polygon has diameter at least , then its total curvature is less than . Appealing to the Fary-Milnor theorem, any such polygon must be unknotted. Therefore, the probability of knotting is decreasing when the confinement diameter is close to .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Baddeley, A. (1977). Integrals on a moving manifold and geometrical probability. Advances in Applied Probability , 9(3), 588-603.
- 2[2] Cantarella, J., Grosberg, A. Y., Kusner, R., & Shonkwiler, C. (2015). The expected total curvature of random polygons. American Journal of Mathematics , 137(2) , 411-438.
- 3[3] Cantarella, J., & Shonkwiler, C. (2016). The symplectic geometry of closed equilateral random walks in 3-space. The Annals of Applied Probability , 26(1) , 549-596.
- 4[4] Diao, Y., Ernst, C., Montemayor, A., & Ziegler, U. (2013). Curvature of random walks and random polygons in confinement. Journal of Physics A: Mathematical and Theoretical , 46(28) .
- 5[5] Eisenberg, B., & Sullivan, R. (2000). Crofton’s differential equation. The American Mathematical Monthly , 107(2) , 129-139.
- 6[6] Kapovich, M., & Millson, J. (1996). The symplectic geometry of polygons in Euclidean space. J. Differential Geom, 44(3) , 479-513.
- 7[7] Micheletti, C., Marenduzzo, D., Orlandini, E., & Summers, D. W. (2006). Knotting of random ring polymers in confined spaces. The Journal of Chemical Physics , 124(6) .
- 8[8] Millett, K. C. (2012). Physical knot theory: an introduction to the study of the influence of knotting on the spatial characteristics of polymers. Introductory Lectures on Knot Theory: Selected Lectures Presented at the Advanced School and Conference on Knot Theory and Its Applications to Physics and Biology 346–378.
