Concyclic points

In general the centre O of a circle on which points P and Q lie must be such that OP and OQ are equal distances. Therefore O must lie on the perpendicular bisector of the line segment PQ.^[1] For n distinct points there are n(n − 1)/2 bisectors, and the concyclic condition is that they all meet in a single point, the centre O.

The vertices of every triangle fall on a circle called the circumcircle. (Because of this, some authors define "concyclic" only in the context of four or more points on a circle.)^[2] Several other sets of points defined from a triangle are also concyclic, with different circles; see Nine-point circle^[3] and Lester's theorem.^[4]

The radius of the circle on which lie a set of points is, by definition, the radius of the circumcircle of any triangle with vertices at any three of those points. If the pairwise distances among three of the points are a, b, and c, then the circle's radius is

${\displaystyle R={\sqrt {\frac {a^{2}b^{2}c^{2}}{(a+b+c)(-a+b+c)(a-b+c)(a+b-c)}}}.}$ 

The equation of the circumcircle of a triangle, and expressions for the radius and the coordinates of the circle's center, in terms of the Cartesian coordinates of the vertices are given here.

In any triangle all of the following nine points are concyclic on what is called the nine-point circle: the midpoints of the three edges, the feet of the three altitudes, and the points halfway between the orthocenter and each of the three vertices.

Lester's theorem states that in any scalene triangle, the two Fermat points, the nine-point center, and the circumcenter are concyclic.

If lines are drawn through the Lemoine point parallel to the sides of a triangle, then the six points of intersection of the lines and the sides of the triangle are concyclic, in what is called the Lemoine circle.

The van Lamoen circle associated with any given triangle ${\displaystyle T}$  contains the circumcenters of the six triangles that are defined inside ${\displaystyle T}$  by its three medians.

A triangle's circumcenter, its Lemoine point, and its first two Brocard points are concyclic, with the segment from the circumcenter to the Lemoine point being a diameter.^[5]

 

A quadrilateral ABCD with concyclic vertices is called a cyclic quadrilateral; this happens if and only if ${\displaystyle \angle CAD=\angle CBD}$  (the inscribed angle theorem) which is true if and only if the opposite angles inside the quadrilateral are supplementary.^[6] A cyclic quadrilateral with successive sides a, b, c, d and semiperimeter s = (a + b + c + d) / 2 has its circumradius given by^[7][8]

${\displaystyle R={\frac {1}{4}}{\sqrt {\frac {(ab+cd)(ac+bd)(ad+bc)}{(s-a)(s-b)(s-c)(s-d)}}},}$ 

an expression that was derived by the Indian mathematician Vatasseri Parameshvara in the 15th century.

By Ptolemy's theorem, if a quadrilateral is given by the pairwise distances between its four vertices A, B, C, and D in order, then it is cyclic if and only if the product of the diagonals equals the sum of the products of opposite sides:

${\displaystyle AC\cdot BD=AB\cdot CD+BC\cdot AD.}$ 

If two lines, one containing segment AC and the other containing segment BD, intersect at X, then the four points A, B, C, D are concyclic if and only if^[9]

${\displaystyle \displaystyle AX\cdot XC=BX\cdot XD.}$ 

The intersection X may be internal or external to the circle. This theorem is known as power of a point.

A convex quadrilateral is orthodiagonal (has perpendicular diagonals) if and only if the midpoints of the sides and the feet of the four altitudes are eight concyclic points, on what is called the eight-point circle.

 

More generally, a polygon in which all vertices are concyclic is called a cyclic polygon. A polygon is cyclic if and only if the perpendicular bisectors of its edges are concurrent.^[10] Every regular polygon is a cyclic polygon.

For a cyclic polygon with an odd number of sides, all angles are equal if and only if the polygon is regular. A cyclic polygon with an even number of sides has all angles equal if and only if the alternate sides are equal (that is, sides 1, 3, 5, … are equal, and sides 2, 4, 6, … are equal).^[11]

A cyclic pentagon with rational sides and area is known as a Robbins pentagon. In all known cases, its diagonals also have rational lengths, though whether this is true for all possible Robbins pentagons is an unsolved problem.^[12]

In any cyclic n-gon with even n, the sum of one set of alternate angles (the first, third, fifth, etc.) equals the sum of the other set of alternate angles. This can be proven by induction from the n = 4 case, in each case replacing a side with three more sides and noting that these three new sides together with the old side form a quadrilateral which itself has this property; the alternate angles of the latter quadrilateral represent the additions to the alternate angle sums of the previous n-gon.

A tangential polygon is one having an inscribed circle tangent to each side of the polygon; these tangency points are thus concyclic on the inscribed circle. Let one n-gon be inscribed in a circle, and let another n-gon be tangential to that circle at the vertices of the first n-gon. Then from any point P on the circle, the product of the perpendicular distances from P to the sides of the first n-gon equals the product of the perpendicular distances from P to the sides of the second n-gon.^[13]

Let a cyclic n-gon have vertices A₁ , …, A_n on the unit circle. Then for any point M on the minor arc A₁A_n, the distances from M to the vertices satisfy^[14]

${\displaystyle {\begin{cases}{\overline {MA_{1}}}+{\overline {MA_{3}}}+\cdots +{\overline {MA_{n-2}}}+{\overline {MA_{n}}}<n/{\sqrt {2}}&{\text{if }}n{\text{ is odd}};\\{\overline {MA_{1}}}+{\overline {MA_{3}}}+\cdots +{\overline {MA_{n-3}}}+{\overline {MA_{n-1}}}\leq n/{\sqrt {2}}&{\text{if }}n{\text{ is even}}.\end{cases}}}$ 

For a regular n-gon, if ${\displaystyle {\overline {MA_{i}}}}$  are the distances from any point M on the circumcircle to the vertices A_i, then ^[15]

${\displaystyle 3({\overline {MA_{1}}}^{2}+{\overline {MA_{2}}}^{2}+\dots +{\overline {MA_{n}}}^{2})^{2}=2n({\overline {MA_{1}}}^{4}+{\overline {MA_{2}}}^{4}+\dots +{\overline {MA_{n}}}^{4}).}$ 

 

Any regular polygon is cyclic. Consider a unit circle, then circumscribe a regular triangle such that each side touches the circle. Circumscribe a circle, then circumscribe a square. Again circumscribe a circle, then circumscribe a regular pentagon, and so on. The radii of the circumscribed circles converge to the so-called polygon circumscribing constant

${\displaystyle \prod _{n=3}^{\infty }{\frac {1}{\cos \left({\frac {\pi }{n}}\right)}}=8.7000366\ldots .}$ 

(sequence A051762 in the OEIS). The reciprocal of this constant is the Kepler–Bouwkamp constant.

In contexts where lines are taken to be a type of generalised circle with infinite radius, collinear points (points along a single line) are considered to be concyclic. This point of view is helpful, for instance, when studying inversion through a circle or more generally Möbius transformations (geometric transformations generated by reflections and circle inversions), as these transformations preserve the concyclicity of points only in this extended sense.^[16]

In the complex plane (formed by viewing the real and imaginary parts of a complex number as the x and y Cartesian coordinates of the plane), concyclicity has a particularly simple formulation: four points in the complex plane are either concyclic or collinear if and only if their cross-ratio is a real number.^[17]

Some cyclic polygons have the property that their area and all of their side lengths are positive integers. Triangles with this property are called Heronian triangles; cyclic quadrilaterals with this property (and that the diagonals that connect opposite vertices have integer length) are called Brahmagupta quadrilaterals; cyclic pentagons with this property are called Robbins pentagons. More generally, versions of these cyclic polygons scaled by a rational number will have area and side lengths that are rational numbers.

Let θ₁ be the angle spanned by one side of the cyclic polygon as viewed from the center of the circumscribing circle. Similarly define the central angles θ₂, ..., θ_n for the remaining n − 1 sides. Every Heronian triangle and every Brahmagupta quadrilateral has a rational value for the tangent of the quarter angle, tan θ_k/4, for every value of k. Every known Robbins pentagon (has diagonals that have rational length and) has this property, though it is an unsolved problem whether every possible Robbins pentagon has this property.

The reverse is true for all cyclic polygons with any number of sides; if all such central angles have rational tangents for their quarter angles then the implied cyclic polygon circumscribed by the unit circle will simultaneously have rational side lengths and rational area. Additionally, each diagonal that connects two vertices, whether or not the two vertices are adjacent, will have a rational length. Such a cyclic polygon can be scaled so that its area and lengths are all integers.

This reverse relationship gives a way to generate cyclic polygons with integer area, sides, and diagonals. For a polygon with n sides, let 0 < c₁ < ... < c_n−1 < +∞ be rational numbers. These are the tangents of one quarter of the cumulative angles θ₁, θ₁ + θ₂, ..., θ₁ + ... + θ_n−1. Let q₁ = c₁, let q_n = 1 / c_n−1, and let q_k = (c_k − c_k−1) / (1 + c_kc_k−1) for k = 2, ..., n−1. These rational numbers are the tangents of the individual quarter angles, using the formula for the tangent of the difference of angles. Rational side lengths for the polygon circumscribed by the unit circle are thus obtained as s_k = 4q_k / (1 + q_k²). The rational area is A = ∑_k 2q_k(1 − q_k²) / (1 + q_k²)². These can be made into integers by scaling the side lengths by a shared constant.

A set of five or more points is concyclic if and only if every four-point subset is concyclic.^[18] This property can be thought of as an analogue for concyclicity of the Helly property of convex sets.

A related notion is the one of a minimum bounding circle, which is the smallest circle that completely contains a set of points. Every set of points in the plane has a unique minimum bounding circle, which may be constructed by a linear time algorithm.^[19]

Even if a set of points are concyclic, their circumscribing circle may be different from their minimum bounding circle. For example, for an obtuse triangle, the minimum bounding circle has the longest side as diameter and does not pass through the opposite vertex.

• Weisstein, Eric W. "Concyclic". MathWorld.
• Four Concyclic Points by Michael Schreiber, The Wolfram Demonstrations Project.

 

Wikimedia Commons has media related to Concyclic points.