# Four-vertex theorem

An ellipse (red) and its evolute (blue), showing the four vertices of the curve, each vertex corresponding to a cusp on the evolute.

The classical four-vertex theorem states that the curvature function of a simple, closed, smooth plane curve has at least four local extrema (specifically, at least two local maxima and at least two local minima). The name of the theorem derives from the convention of calling an extreme point of the curvature function a vertex. This theorem has many generalizations, including a version for space curves where a vertex is defined as a point of vanishing torsion.

## Examples

An ellipse has exactly four vertices: two local maxima of curvature where it is crossed by the major axis of the ellipse, and two local minima of curvature where it is crossed by the minor axis. In a circle, every point is both a local maximum and a local minimum of curvature, so there are infinitely many vertices.

## History

The four-vertex theorem was first proved for convex curves (i.e. curves with strictly positive curvature) in 1909 by Syamadas Mukhopadhyaya.[1] His proof utilizes the fact that a point on the curve is an extremum of the curvature function if and only if the osculating circle at that point has 4th-order contact with the curve (in general the osculating circle has only 3rd-order contact with the curve). The four-vertex theorem was proved in general by Adolf Kneser in 1912 using a projective argument.[2]

## Proof

For many years the proof of the four-vertex theorem remained difficult, but a simple and conceptual proof was given by Osserman (1985), based on the idea of the minimum enclosing circle.[3] This is a circle that contains the given curve and has the smallest possible radius. If the curve includes an arc of the circle, it has infinitely many vertices. Otherwise, the curve and circle must be tangent at at least two points. At each tangency, the curvature of the curve is greater than that of the circle (else the curve would continue from the tangency outside the circle rather than inside). However, between each pair of tangencies, the curvature must decrease to less than that of the circle, for instance at a point obtained by translating the circle until it no longer contains any part of the curve between the two points of tangency and considering the last point of contact between the translated circle and the curve. Therefore, there is a local minimum of curvature between each pair of tangencies, giving two of the four vertices. There must be a local maximum of curvature between each pair of local minima, giving the other two vertices.[3][4]

## Converse

The converse to the four-vertex theorem states that any continuous, real-valued function of the circle that has at least two local maxima and two local minima is the curvature function of a simple, closed plane curve. The converse was proved for strictly positive functions in 1971 by Herman Gluck as a special case of a general theorem on pre-assigning the curvature of n-spheres.[5] The full converse to the four-vertex theorem was proved by Björn Dahlberg shortly before his death in January 1998, and published posthumously.[6] Dahlberg's proof uses a winding number argument which is in some ways reminiscent of the standard topological proof of the Fundamental Theorem of Algebra.[7]

## Application to mechanics

One corollary of the theorem is that a homogeneous, planar disk rolling on a horizontal surface under gravity has at least 4 balance points. A discrete version of this is that there cannot be a monostatic polygon. However, in three dimensions there do exist monostatic polyhedra, and there also exists a convex, homogeneous object with exactly 2 balance points (one stable, and the other unstable), the Gömböc.

illustration of the Four-vertex theorem at an ellipse

## Discrete variations

There are several discrete versions of the four-vertex theorem, both for convex and non-convex polygons.[8] Here are some of them:

• (Bilinski) The sequence of angles of a convex equilateral polygon with at least four vertices has at least four extrema.
• The sequence of side lengths of a convex equiangular polygon with at least four sides has at least four extrema.
• (Musin) A circle circumscribed around three consecutive vertices of a polygon with at least four vertices is called extremal if it contains all remaining vertices of the polygon, or has none of them in its interior. Such a convex polygon is generic if it has no four vertices on the same circle. Then every generic convex polygon with at least four vertices has at least four extremal circles.
• (LegendreCauchy) Two convex n-gons with equal corresponding side length have either zero or at least 4 sign changes in the cyclic sequence of the corresponding angle differences.
• (A.D. Alexandrov) Two convex n-gons with parallel corresponding sides and equal area have either zero or at least 4 sign changes in the cyclic sequence of the corresponding side lengths differences.

Some of these variations are stronger than the other, and all of them imply the (usual) four-vertex theorem by a limit argument.

## Generalizations to space curve

The stereographic projection from the sphere to the plane preserves critical points of geodesic curvature. Thus simple closed spherical curves have four vertices. Furthermore, on the sphere vertices of a curve correspond to points where its torsion vanishes. So for space curves a vertex is defined as a point of vanishing torsion. In 1994 V. D. Sedykh [9] showed that every simple closed space curve which lies on the boundary of a convex body has four vertices. In 2015 Mohammad Ghomi [10] generalized Sedykh's theorem to all curves which bound a locally convex disk.