Concept

Inégalité de Ptolémée

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. Thus the three product terms in the inequality can be additively permuted to put any one of them on the right side of the inequality, so the three products of opposite sides or of diagonals of any one of the quadrilaterals must obey the triangle inequality. 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. The inequality does not generalize from Euclidean spaces to arbitrary metric spaces. The spaces where it remains valid are called the Ptolemaic spaces; they include the inner product spaces, Hadamard spaces, and shortest path distances on Ptolemaic graphs. 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. 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. For points in the plane, Ptolemy's inequality can be derived from the triangle inequality by an inversion centered at one of the four points. 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.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.