Centroaffine Duality for Spatial Polygons
Marcos Craizer, Sinesio Pesco

TL;DR
This paper explores the centroaffine geometry of spatial polygons, establishing duality relations, vertex-flattening point correspondences, and applications to flattening point theorems.
Contribution
It introduces a new duality framework for spatial polygons and proves novel correspondences and properties within centroaffine geometry.
Findings
Vertices correspond to flattening points in dual polygons
Constant curvature polygons are dual to planar polygons
Provides a new proof of the 4 flattening points theorem
Abstract
In this paper, we discuss centroaffine geometry of polygons in -space. For a polygon that is locally convex with respect to an origin together with a transversal vector field , we define the centroaffine dual pair similarly to [6]. We prove that vertices of correspond to flattening points for and also that constant curvature polygons are dual to planar polygons. As an application, we give a new proof of a known flattening points theorem for spatial polygons.
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.
††thanks: The authors want to thank CNPq and CAPES for financial support during the preparation of this manuscript.
E-mail of the corresponding author: [email protected]
Centroaffine Duality for Spatial Polygons
Marcos Craizer
Departamento de Matemática- PUC-Rio\brRio de Janeiro, RJ, Brasil
Sinesio Pesco
Departamento de Matemática- PUC-Rio\brRio de Janeiro, RJ, Brasil
(Date: November 10, 2018)
Abstract.
In this paper, we discuss centroaffine geometry of polygons in -space. For a polygon that is locally convex with respect to an origin together with a transversal vector field , we define the centroaffine dual pair similarly to [6]. We prove that vertices of correspond to flattening points for and also that constant curvature polygons are dual to planar polygons. As an application, we give a new proof of a known flattening points theorem for spatial polygons.
Key words and phrases:
Affine vertices, Planar points, Flattening points, Support points, Four vertices theorem, Four planar points theorem.
1991 Mathematics Subject Classification:
53A15, 52C35
1. Introduction
Affine differential geometry of curves in -space studies differential concepts that are invariant under the affine group. When a distinguished origin is fixed, the study of such curves becomes part of the centroaffine differential geometry. We shall consider in this paper centroaffine concepts of spatial polygons that comes from discretizations of differential concepts, and so our results can be classified into discrete differential centroaffine geometry.
We shall consider spatial polygons that are locally convex with respect to an origin , which means that the determinant
[TABLE]
does not changes sign, together with transversal vector fields , which means that
[TABLE]
also does not change sign. The (centroaffine) normal plane is the plane generated by and , while the (centroaffine) focal set is the envelope of normal planes ([3]). We show that the focal set reduces to a line if and only if the pair has constant curvature.
We define the dual pair of , which is also a locally convex spatial polygon together with a transversal vector field . This definition is a discrete counterpart of the centroaffine duality introduced in [6] for general smooth codimension centroaffine immersions (see also [2], where the smooth spatial curves case is more explicit). We prove many properties of this duality, among them a correspondence between vertices of and flattening points of the dual pair . We show also that has constant curvature if and only if is planar. As a consequence, we describe explicitly the constant curvature pairs.
Equal-volume polygons are the discrete counterpart of curves parameterized by centroaffine arc-length ([3]). Such polygons admit natural transversal vector fields that are parallel and unimodular. By using the duality tools, we give a characterization of the constant curvature equal-volume polygons.
As an application of this centroaffine duality theory, we give another proof of a known flattening points theorem for polygons in -space, by assuming that some radial projection is convex. This is a discrete counterpart of a theorem of Arnold for spatial smooth curves ([1]).
The paper is organized as follows: In section 2 we give the basic definitions and properties of centroaffine geometry of spatial polygons. In section 3 we introduce the duality and prove its mais properties. In section 4 we characterize the constant curvature polygons, while in section 5 we prove the above mentioned flattening points theorem.
2. Centroaffine Geometry of Polygons
2.1. Notation and terminology
In this paper, we consider polygons in -space. In order to avoid misunderstandings, we use the terms ”edge” and ”nodes” for the elements of a polygon, leaving the terms ”vertex” and ”flattening point” for special edges or nodes.
We denote by the set of integers and by the set . A discrete function is a map from or to , while a discrete vector field is a map from or to . For any discrete function , we shall use the notation
[TABLE]
and so on. For periodic functions of period , we shall use the periodic notation , . We shall denote by the standard volume in .
2.2. Locally convex polygons and transversal parallel vector fields
Consider a closed spatial polygon with nodes , , and . Let be defined by
[TABLE]
We say that is locally convex with respect to if , for any . Consider a vector field along given by , . Define by
[TABLE]
We say that is transversal to with respect to if , for any . Along this paper, we shall consider to be the origin.
A transversal vector field to is called parallel if
[TABLE]
for certain scalar function . We call the curvature of the edge .
2.3. Affine focal sets and vertices
For a locally convex spatial polygon with a transversal vector field , the line
[TABLE]
is called the normal line at . The plane generated by and is called the (centroaffine) normal plane.
Lemma 2.1**.**
Consider a transversal vector field . Then is a parallel vector field contained in the normal plane of the pair if and only if we can write
[TABLE]
for some constants and , .
Proof.
If is of the form (2.2), then clearly is parallel and belongs to the normal plane. Conversely, if belongs to the normal plane, then we can write . Since is also parallel, and must be constants, thus proving the lemma. ∎
The normal lines at and meet at
[TABLE]
The (centroaffine) focal set is the envelope of the normal planes, i.e., the conical polyhedron with center over the polygon whose nodes are , ([3]).
Proposition 2.2**.**
The following statements are equivalent:
- (1)
The focal set of reduces to a line. 2. (2)
The curvature of is constant. 3. (3)
There exists a constant vector field contained in all normal planes of . 4. (4)
There exists a constant vector field such that , for some constants and .
Proof.
It is easy to verify that three consecutive normal lines at , and of are concurrent if and only if . So defined by Equation (2.3) is constant if and only if is constant. Moreover, the affine focal set reduces to a line if and only if is constant. Thus and the implication also holds. If we assume that (3) holds, the affine focal set is the line passing through and and so (1) also holds. The equivalence between and is given by Lemma 2.1. ∎
We say that an edge is a vertex of if
[TABLE]
2.4. Flattening points
Let be defined by
[TABLE]
A node of the polygon is said to be a flattening point if
[TABLE]
Geometrically, the flattening point condition means that and are in the same side with respect to the plane defined by . We remark that, in [7, p.218], a flattening point is called a support point.
For each , take such that belongs to the osculating plane, i.e.,
[TABLE]
Lemma 2.3**.**
We can write
[TABLE]
where .
Proof.
If follows from Equation (2.5) that Equation (2.6) holds and
[TABLE]
thus proving the lemma. ∎
Lemma 2.4**.**
We have that
[TABLE]
Proof.
Take the difference of Equation 2.5 at and to obtain, after some manipulations, the following relation:
[TABLE]
Now from Equation (2.6) we obtain
[TABLE]
thus proving the lemma. ∎
From the above lemma, we conclude the following proposition:
Proposition 2.5**.**
The node is a flattening point for if and only if
[TABLE]
where and is any transversal parallel vector field along .
2.5. Equal-volume polygons
We say that the polygon is equal-volume with respect to the origin if , for any (see [3]). We say that a transversal vector field is unimodular with respect to if , for any .
For equal-volume polygons, there is a natural choice of a transversal parallel vector field, namely
[TABLE]
It is easy to see that is unimodular.
Lemma 2.6**.**
The vector field defined by Equation (2.7) is parallel.
Proof.
We use the results of [3]. Write
[TABLE]
for some scalar functions , and satisfying the compatibility equation
[TABLE]
Defining by , we have that
[TABLE]
is parallel. Now condition (2.5) says that
[TABLE]
thus implying that . ∎
Proposition 2.7**.**
Let be transversal vector field that is parallel and unimodular. Then
[TABLE]
where is defined by Equation (2.7) and is some constant.
Proof.
Since is parallel, , for certain constants and . Since , we conclude that , thus proving the proposition. ∎
3. Duality
3.1. Definition and properties
The general notion of duality for codimension centroaffine immersions can be found in [5, N9] and [6]. For an explicit description of centroaffine duality of smooth spatial curves, see [2]. We describe here a version of this duality for polygons in -space.
Since , one can define a polygon and a vector field along uniquely by the following conditions:
[TABLE]
and
[TABLE]
We say that is the dual pair of . The following lemma is straightforward:
Lemma 3.1**.**
Consider a locally convex polygon with a parallel transversal vector field and denote by its dual pair. Then
[TABLE]
and
[TABLE]
Moreover, is the dual pair of .
Recall that
[TABLE]
and
[TABLE]
Lemma 3.2**.**
We have that
[TABLE]
where and .
Proof.
Write
[TABLE]
Taking the vector product of both equations we obtain
[TABLE]
Now take the dot product with to obtain the first formula. By duality, we can write
[TABLE]
Now use the first formula to obtain the second one. ∎
From the above lemma, we conclude that is a locally convex polygon and that is a transversal vector field.
Lemma 3.3**.**
The transversal vector field is parallel and
[TABLE]
where . We conclude that .
Proof.
Observe that is orthogonal to and to and the same occurs with . Thus we conclude that is parallel to , and we write . We claim that . In fact, substituting
[TABLE]
in Equation (2.5) we obtain
[TABLE]
Since , we conclude that
[TABLE]
and the same holds for . Thus
[TABLE]
which implies that . Since
[TABLE]
the lemma is proved. ∎
Next lemma shows that duality preserves the centroaffine normal plane.
Lemma 3.4**.**
Let be the dual of and consider another transversal vector field given by Equation (2.2). Then the dual pair of is given by
[TABLE]
Proof.
Straightforward verifications. ∎
3.2. The equal-volume case
Lemma 3.5**.**
Assume is equal-volume and is a parallel and unimodular transversal vector field. Denoting by the dual pair, we have that also is equal-volume and is a parallel and unimodular transversal vector field.
Proof.
This lemma is a direct consequence of Lemma 3.2. ∎
3.3. Coplanarity and concurrency
Proposition 3.6**.**
Four consecutive nodes of are coplanar if and only if the corresponding three normal lines of meet at a point.
Proof.
From Section 2.3, we have that three consecutive normal lines of at , and , are concurrent if and only if . By Lemma 3.3, this is equivalent to . From Lemma 2.4, this is equivalent to , thus proving the proposition. ∎
We say that the polygon is generic if no four consecutive nodes are coplanar.
Corollary 3.7**.**
The polygon is generic if and only if , for any .
3.4. Vertex and flattening points
The main result of the section is the following:
Proposition 3.8**.**
Assume that is a generic polygon. Then the node is a flattening point of if and only if the edge is a vertex of .
Proof.
We have that the edge of is a vertex if and only if
[TABLE]
From Lemma 3.3, this is equivalent to
[TABLE]
By Proposition 2.5, this condition is equivalent to the node of being a flattening point. ∎
4. Planar and Constant Curvature Polygons
4.1. Affine cylindrical pedal
Consider a locally convex planar polygon and let be a transversal planar vector field that is parallel, i.e., we can write
[TABLE]
for some scalar function . The lines , , are called the normal lines of the pair .
The lifting of is the pair given by
[TABLE]
Observe that is parallel along and that .
The affine cylindrical pedal of is defined by
[TABLE]
where denotes the co-normal vector field of , i.e.,
[TABLE]
It is easy to verify that the constant vector field is transversal to and is dual to . By Proposition 2.2, is a constant curvature pair.
The following proposition says that if, conversely, we start with a spatial polygon transversal to a constant vector field , then it is necessarily the affine cylindrical pedal of some planar pair .
Proposition 4.1**.**
Assume that is a locally convex spatial polygon transversal to a constant vector field . Then is the affine cylindrical pedal of some planar parallel pair .
Proof.
Denote by the dual of . Since is a constant curvature pair, Proposition 3.6 implies that is planar. Moreover, since is orthogonal to , it must belong to the same plane. Thus is the lifting of some planar pair . ∎
Remark 4.2*.*
Consider any locally convex polygon . Then it is locally transversal to a constant vector field that we may assume, by an affine change of coordinates, to be . Then Proposition 4.1 implies is locally an affine cylindrical pedal.
Corollary 4.3**.**
Consider a polygon in -space and a transversal parallel vector field such that the pair has constant curvature. Then is the affine cylindrical pedal of a planar polygon with a transversal parallel vector field .
Proof.
It follows from Proposition 2.2 that has constant curvature if and only if there exists a constant transversal vector field satisfying , for some constant . By Proposition 4.1, is the affine cylindrical pedal of some planar pair . ∎
4.2. Constant curvature equal-volume polygons
A planar polygon is called equal-area if
[TABLE]
where denotes the area of two planar vectors (see [4]). We say that a transversal vector field is unimodular if
[TABLE]
For equal-area polygons, it is easy to verify that
[TABLE]
is the only transversal vector field that is parallel and unimodular. Observe that, in this case, the lifting of is equal-volume and the transversal vector field is parallel and unimodular.
The affine cylindrical pedal of is a pair , where is a locally convex polygon and . Moreover, by Lemma 3.5, the pair is also equal-volume and unimodular.
We remark that it is not always true that a locally convex polygon is the affine cylindrical pedal of a pair with equal-area and unimodular. In fact, we have the following proposition:
Proposition 4.4**.**
Consider an equal-volume polygon in -space. Then it is the cylindrical pedal of an equal-area polygon with unimodular if and only if there exists a unimodular constant vector field transversal to .
Proof.
If is unimodular, then its dual is also unimodular. By Proposition 4.1, is the lifting of a planar pair , with equal-area and unimodular. ∎
Next proposition gives a characterization of equal-volume polygons of constant curvature:
Proposition 4.5**.**
Consider an equal-volume polygon in -space. Then it has constant curvature if and only if it is the affine cylindrical pedal of some equal-area planar polygon .
Proof.
Given an equal-volume polygon , denote by a parallel and unimodular transversal vector field. Then Proposition 2.2 says that the pair has constant curvature if and only if there exists a constant vector field that is also transversal and unimodular, which by Proposition 2.7 must be of the form , for some constant . By Proposition 4.4, this is equivalent to being the affine cylindrical pedal of some planar equal-area polygon . ∎
5. Application: A Flattening Points Theorem
As an application of the centroaffine duality, we shall give a new proof of a flattening theorem for convex polygons in -space. The proof is based on a -vertex theorem for planar polygons described in [8].
5.1. Statement of the theorem
We say that a polygon is said to be weakly convex if it lies in the surface of its convex hull ([7, p.201]). We shall consider a stronger convexity condition, namely, that some radial projection of the spatial polygon is a planar convex polygon (see Figure 1). The following theorem is proved in [7] with the hypothesis of weak convexity.
Theorem 5.1**.**
Let be a generic closed polygon in -space such that, for some center , the radial projection of in a plane is a convex planar polygon. Then admits at least flattening points.
This theorem is a polygonal version of the following well-known Arnold’s -flattening points theorem for smooth spatial curves ([1]). Recall that a flattening point of a smooth curve is a point such that belongs to the osculating plane of at .
Theorem 5.2**.**
Let be a closed smooth curve such that, for some center , the radial projection of in a plane is a convex planar curve. Then admits at least flattening points.
For a discussion of different types of convexity of spatial curves and other smooth flattening points theorems, see [9].
5.2. Dual of a convex affine cylindrical pedal
Assume that is a locally convex spatial polygon transversal to . By Proposition 4.1, is the affine cylindrical pedal of a planar polygon .
Proposition 5.3**.**
If , with and convex containing in its interior, then is convex (see Figure 2).
Proof.
Recall that a locally convex planar polygon is convex if and only if its index is . One can think of the index of a planar locally convex polygon as the sum of its external angles divided by .
If the index of were greater than , then the index of its co-normal vector field would also be greater than . On the other hand, by the convexity of , the polygon intersects each ray from at most once, which is a contradiction. ∎
5.3. Proof of Theorem 5.1
Consider a locally convex polygon in -space whose projection in a plane with respect to a center is a convex planar curve. We may assume that and that the plane of projection is . Thus there exist such that
[TABLE]
where is a convex planar polygon. We can also assume, w.l.o.g., that is contained in the interior of . This implies that is a transversal vector field along .
Denoting by the dual pair of , Proposition 5.3 says that we can write and , for some planar convex polygon and parallel planar vector field along . Moreover, is the affine pedal of , i.e., is the co-normal of and
[TABLE]
We claim that vertices of correspond to vertices of in the sense of [8]. In fact, we can write
[TABLE]
where is defined in Equation (2.1). This equation implies that is exact with respect to and that the edge is a vertex of if and only if ([8]). By Equation (2.4), this is equivalent to the edge being a vertex of .
The vector field is called generic for in [8] if no consecutive normal lines intersect at a point. This is equivalent to say that no consecutive lines intersect at a point. By Proposition 3.6, this is equivalent to the condition that no consecutive points of are coplanar, which in fact means that is generic.
We are now in position to use the following theorem, proved in [8]:
Theorem 5.4**.**
Assume that is a planar convex polygon and that the generic transversal vector field is exact. Then the pair admits at least vertices.
From this theorem, we conclude that , and hence , admits at least vertices. By Proposition 3.8, this implies that admits at least flattenings, thus completing the proof of Theorem 5.1.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V.I.Arnold: On the number of flattening points of space curves , Amer.Math.Soc.Transl. 171, 11-22, 1995.
- 2[2] M.Craizer and R.A.Garcia: Centro-affine codimension 2 immersions: Umbilical and inflection points , Arxiv:1811.07331.
- 3[3] M.Craizer and S.Pesco: Affine geometry of equal-volume polygons in 3 3 3 -space , Comp.Aided Geom.Design, 57, 44-56, 2017.
- 4[4] M.Craizer, R.Teixeira and M.da Silva: Affine properties of convex equal-area polygons , Disc.Comp.Geometry, 48(3), 580-595, 2012.
- 5[5] K.Nomizu and T.Sasaki: Affine Differential Geometry , Cambridge University Press, 1994.
- 6[6] K.Nomizu and T.Sasaki: Centroaffine immersions of codimension two and projective hypersurface theory , Nagoya Math. J., 132, 63-90, 1993.
- 7[7] I.Pak: Lectures on Discrete and Polyhedral Geometry , http://www.math.ucla.edu/ pak/geompol 8.pdf, 2010.
- 8[8] S.Tabachnikov: A Four Vertex Theorem for Polygons , Amer.Math.Monthly, 107(9), 830-833, 2000.
