Ptolemy's inequality
In Euclidean geometry, Ptolemy's inequality relates the six distances determined by four points in the plane or in a higher-dimensional space.
It states that, for any four points A, B, C, and D, the following inequality holds: It is named after the Greek astronomer and mathematician Ptolemy.
The four points can be ordered in any of three distinct ways (counting reversals as not distinct) to form three different quadrilaterals, for each of which the sum of the products of opposite sides is at least as large as the product of the diagonals.
[1] As a special case, Ptolemy's theorem states that the inequality becomes an equality when the four points lie in cyclic order on a circle.
The other case of equality occurs when the four points are collinear in order.
Ptolemy's inequality is often stated for a special case, in which the four points are the vertices of a convex quadrilateral, given in cyclic order.
[2][3] However, the theorem applies more generally to any four points; it is not required that the quadrilateral they form be convex, simple, or even planar.
[4][5] Alternatively, it can be derived by interpreting the four points as complex numbers, using the complex number identity: to construct a triangle whose side lengths are the products of sides of the given quadrilateral, and applying the triangle inequality to this triangle.
[6] One can also view the points as belonging to the complex projective line, express the inequality in the form that the absolute values of two cross-ratios of the points sum to at least one, and deduce this from the fact that the cross-ratios themselves add to exactly one.
[7] A proof of the inequality for points in three-dimensional space can be reduced to the planar case, by observing that for any non-planar quadrilateral, it is possible to rotate one of the points around the diagonal until the quadrilateral becomes planar, increasing the other diagonal's length and keeping the other five distances constant.
For four points in order around a circle, Ptolemy's inequality becomes an equality, known as Ptolemy's theorem: In the inversion-based proof of Ptolemy's inequality, transforming four co-circular points by an inversion centered at one of them causes the other three to become collinear, so the triangle equality for these three points (from which Ptolemy's inequality may be derived) also becomes an equality.
{\displaystyle {\overline {AB}}\cdot {\overline {CD}}+{\overline {BC}}\cdot {\overline {DA}}>{\overline {AC}}\cdot {\overline {BD}}}
[9][10] For other types of metric space, the inequality may or may not be valid.
For instance, consider the four-vertex cycle graph, shown in the figure, with all edge lengths equal to 1.
Therefore, the shortest path distances in this graph are not Ptolemaic.
The graphs in which the distances obey Ptolemy's inequality are called the Ptolemaic graphs and have a restricted structure compared to arbitrary graphs; in particular, they disallow induced cycles of length greater than three, such as the one shown.
If a complete Riemannian manifold is Ptolemaic, it is necessarily a Hadamard space.
[13] Another necessary and sufficient condition for there to exist such an inner product is for the norm to satisfy the parallelogram law:
If this is the case then this inner product will be unique and it can be defined in terms of the norm by using the polarization identity.
