Math 2.0

Geometry Triangles and circles Theorem

Ptolemy's theorem

Builds on Cyclic quadrilateralConcyclic pointsEuclidean distance

Statement

Let AA, BB, CC and DD be concyclic points of the Euclidean plane ℝ2\mathbb{R}^2, and let dd be the Euclidean distance. Suppose that the segments ACAC and BDBD meet in a point that is inside both segments. Thus ABCDABCD is a convex cyclic quadrilateral with the diagonals ACAC and BDBD. Then d(A,C) d(B,D)=d(A,B) d(C,D)+d(B,C) d(A,D).d(A, C)\, d(B, D) = d(A, B)\, d(C, D) + d(B, C)\, d(A, D).

Remarks

In words: the product of the diagonals is the sum of the products of the opposite sides. The converse is also true. If a quadrilateral has this property, then it is cyclic. For each four points of the plane, d(A,C) d(B,D)≤d(A,B) d(C,D)+d(B,C) d(A,D)d(A, C)\, d(B, D) \leq d(A, B)\, d(C, D) + d(B, C)\, d(A, D). This is Ptolemy's inequality. For a rectangle with the sides aa and bb, the theorem gives a2+b2=c2a^2 + b^2 = c^2, with the diagonal cc. This is the Pythagorean theorem.

History

The theorem has the name of the astronomer Ptolemy. He used it to make his table of chords, a trigonometric table for astronomy.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Concyclic points concept
  2. Cyclic quadrilateral concept
  3. Euclidean distance concept
  4. Ptolemy's theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Ptolemy%27s_theorem, lead section
  2. Web https://en.wikipedia.org/wiki/Ptolemy%27s_theorem, Ptolemy's inequality
About this page
Tag058YS05YP5
URIm2://058YS05YP5
Kindstatement, theorem
WritingW1 stated
MSC51M04
StatusThis copy of the site has no build data. Run m2 status 058YS05YP5.
UsesCyclic quadrilateral, Concyclic points, Euclidean distance
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.