Collinearity

In geometry, collinearity is the property possessed by a set of points that lie on a single line.^[1] A set of points with this property is said to be collinear (sometimes spelled as colinear^[2]). In greater generality, the term has been used for aligned objects, that is, things being "in a line" or "in a row".

Points on a line

In any geometry, the set of points on a line are said to be collinear. In Euclidean geometry this relation is intuitively visualized by points lying in a row on a "straight line". However, in most geometries (including Euclidean) a line is typically a primitive (undefined) object type, so such visualizations will not necessarily be appropriate. A model for the geometry offers an interpretation of how the points, lines and other object types relate to one another and a notion such as collinearity must be interpreted within the context of that model. For instance, in spherical geometry, where lines are represented in the standard model by great circles of a sphere, sets of collinear points lie on the same great circle. Such points do not lie on a "straight line" in the Euclidean sense, and are not thought of as being in a row.

A mapping of a geometry to itself which sends lines to lines is called a collineation; it preserves the collinearity property. The linear maps (or linear functions) of vector spaces, viewed as geometric maps, map lines to lines; that is, they map collinear point sets to collinear point sets and so, are collineations. In projective geometry these linear mappings are called homographies and are just one type of collineation.

Examples in Euclidean geometry

Triangles

In any triangle the following sets of points are collinear:

• The orthocenter, the circumcenter, the centroid, the Exeter point, the de Longchamps point, and the center of the nine-point circle are collinear, all falling on a line called the Euler line.
• The de Longchamps point also has other collinearities.
• Any vertex, the tangency of the opposite side with an excircle, and the Nagel point are collinear in a line called a splitter of the triangle.
• The midpoint of any side, the point that is equidistant from it along the triangle's boundary in either direction (so these two points bisect the perimeter), and the center of the Spieker circle are collinear in a line called a cleaver of the triangle. (The Spieker circle is the incircle of the medial triangle, and its center is the center of mass of the perimeter of the triangle.)
• Any vertex, the tangency of the opposite side with the incircle, and the Gergonne point are collinear.
• From any point on the circumcircle of a triangle, the nearest points on each of the three extended sides of the triangle are collinear in the Simson line of the point on the circumcircle.
• The lines connecting the feet of the altitudes intersect the opposite sides at collinear points.^[3]:p.199
• A triangle's incenter, the midpoint of an altitude, and the point of contact of the corresponding side with the excircle relative to that side are collinear.^{[4]:p.120,#78}
• Menelaus' theorem states that three points $P_1, P_2, P_3$ on the sides (some extended) of a triangle opposite vertices $A_1,A_2, A_3$ respectively are collinear if and only if the following products of segment lengths are equal:^{[3]:p. 147}

$P_1A_2 \cdot P_2A_3 \cdot P_3A_1=P_1A_3 \cdot P_2A_1 \cdot P_3A_2.$

• The incenter, the centroid, and the Spieker circle's center are collinear.

Quadrilaterals

• In a convex quadrilateral ABCD whose opposite sides intersect at E and F, the midpoints of AC, BD, and EF are collinear and the line through them is called the Newton line (sometimes known as the Newton-Gauss line). If the quadrilateral is a tangential quadrilateral, then its incenter also lies on this line.^[5]
• In a convex quadrilateral, the quasiorthocenter H, the "area centroid" G, and the quasicircumcenter O are collinear in this order, and HG = 2GO.^[6] (See Quadrilateral#Remarkable points and lines in a convex quadrilateral.)

• Other collinearities of a tangential quadrilateral are given in Tangential quadrilateral#Collinear points.
• In a cyclic quadrilateral, the circumcenter, the vertex centroid (the intersection of the two bimedians), and the anticenter are collinear.^[7]
• In a cyclic quadrilateral, the area centroid, the vertex centroid, and the intersection of the diagonals are collinear.^[8]
• In a tangential trapezoid, the tangencies of the incircle with the two bases are collinear with the incenter.
• In a tangential trapezoid, the midpoints of the legs are collinear with the incenter.

Hexagons

• Pascal's theorem (also known as the Hexagrammum Mysticum Theorem) states that if an arbitrary six points are chosen on a conic section (i.e., ellipse, parabola or hyperbola) and joined by line segments in any order to form a hexagon, then the three pairs of opposite sides of the hexagon (extended if necessary) meet in three points which lie on a straight line, called the Pascal line of the hexagon. The converse is also true: the Braikenridge–Maclaurin theorem states that if the three intersection points of the three pairs of lines through opposite sides of a hexagon lie on a line, then the six vertices of the hexagon lie on a conic, which may be degenerate as in Pappus's hexagon theorem.

Conic sections

• By Monge's theorem, for any three circles in a plane, none of which is inside one of the others, the three intersection points of the three pairs of lines, each externally tangent to two of the circles, are collinear.
• In an ellipse, the center, the two foci, and the two vertices with the smallest radius of curvature are collinear, and the center and the two vertices with the greatest radius of curvature are collinear.
• In a hyperbola, the center, the two foci, and the two vertices are collinear.
• Let a conic S and a point P on the plane. Construct three lines d_a, d_b, d_c through P such that they meet the conic at A, A'; B, B' ; C, C' respectively. Let D be a point on the polar of point P with respect to (S) or D lies on the conic (S). Let DA' ∩ BC =A₀; DB' ∩ AC = B₀; DC' ∩ AB= C₀. Then A₀, B₀, C₀ are collinear.^[9][10][11]

Cones

• The center of mass of a conic solid of uniform density lies one-quarter of the way from the center of the base to the vertex, on the straight line joining the two.

Tetrahedrons

• The centroid of a tetrahedron is the midpoint between its Monge point and circumcenter. These points define the Euler line of the tetrahedron that is analogous to the Euler line of a triangle. The center of the tetrahedron's twelve-point sphere also lies on the Euler line.

Algebra

Collinearity of points whose coordinates are given

In coordinate geometry, in n-dimensional space, a set of three or more distinct points are collinear if and only if, the matrix of the coordinates of these vectors is of rank 1 or less. For example, given three points X = (x₁, x₂, ... , x_n), Y = (y₁, y₂, ... , y_n), and Z = (z₁, z₂, ... , z_n), if the matrix

$\begin{bmatrix} x_1 & x_2 & \dots & x_n \\ y_1 & y_2 & \dots & y_n \\ z_1 & z_2 & \dots & z_n \end{bmatrix}$

is of rank 1 or less, the points are collinear.

Equivalently, for every subset of three points X = (x₁, x₂, ... , x_n), Y = (y₁, y₂, ... , y_n), and Z = (z₁, z₂, ... , z_n), if the matrix

$\begin{bmatrix} 1 & x_1 & x_2 & \dots & x_n \\ 1 & y_1 & y_2 & \dots & y_n \\ 1 & z_1 & z_2 & \dots & z_n \end{bmatrix}$

is of rank 2 or less, the points are collinear. In particular, for three points in the plane (n = 2), the above matrix is square and the points are collinear if and only if its determinant is zero; since that 3 × 3 determinant is plus or minus twice the area of a triangle with those three points as vertices, this is equivalent to the statement that the three points are collinear if and only if the triangle with those points as vertices has zero area.

Collinearity of points whose pairwise distances are given

A set of at least three distinct points is called straight, meaning all the points are collinear, if and only if, for every three points A, B, and C, the following determinant of a Cayley–Menger determinant is zero (with d(AB) meaning the distance between A and B, etc.):

$\det \begin{bmatrix} 0 & d(AB)^2 & d(AC)^2 & 1 \\ d(AB)^2 & 0 & d(BC)^2 & 1 \\ d(AC)^2 & d(BC)^2 & 0 & 1 \\ 1 & 1 & 1 & 0 \end{bmatrix} = 0.$

This determinant is, by Heron's formula, equal to −16 times the square of the area of a triangle with side lengths d(AB), d(BC), and d(AC); so checking if this determinant equals zero is equivalent to checking whether the triangle with vertices A, B, and C has zero area (so the vertices are collinear).

Equivalently, a set of at least three distinct points are collinear if and only if, for every three points A, B, and C with d(AC) greater than or equal to each of d(AB) and d(BC), the triangle inequality d(AC) ≤ d(AB) + d(BC) holds with equality.

Number theory

Two numbers m and n are not coprime—that is, they share a common factor other than 1—if and only if for a rectangle plotted on a square lattice with vertices at (0, 0), (m, 0), (m, n), and (0, n), at least one interior point is collinear with (0, 0) and (m, n).

Concurrency (plane dual)

In various plane geometries the notion of interchanging the roles of "points" and "lines" while preserving the relationship between them is called plane duality. Given a set of collinear points, by plane duality we obtain a set of lines all of which meet at a common point. The property that this set of lines has (meeting at a common point) is called concurrency, and the lines are said to be concurrent lines. Thus, concurrency is the plane dual notion to collinearity.

Collinearity graph

Given a partial geometry P, where two points determine at most one line, a collinearity graph of P is a graph whose vertices are the points of P, where two vertices are adjacent if and only if they determine a line in P.

Usage in statistics and econometrics

In statistics, collinearity refers to a linear relationship between two explanatory variables. Two variables are perfectly collinear if there is an exact linear relationship between the two, so the correlation between them is equal to 1 or −1. That is, $X_{1}$ and $X_{2}$ are perfectly collinear if there exist parameters $\lambda_0$ and $\lambda_1$ such that, for all observations i, we have

$X_{2i} = \lambda_0 + \lambda_1 X_{1i}.$

This means that if the various observations (X_1i, X_2i ) are plotted in the (X₁, X₂) plane, these points are collinear in the sense defined earlier in this article.

Perfect multicollinearity refers to a situation in which k (k ≥ 2) explanatory variables in a multiple regression model are perfectly linearly related, according to

$X_{ki} = \lambda_0 + \lambda_1 X_{1i} + \lambda_2 X_{2i} + \dots + \lambda_{k-1} X_{(k-1),i}$

for all observations i. In practice, we rarely face perfect multicollinearity in a data set. More commonly, the issue of multicollinearity arises when there is a "strong linear relationship" among two or more independent variables, meaning that

$X_{ki} = \lambda_0 + \lambda_1 X_{1i} + \lambda_2 X_{2i} + \dots + \lambda_{k-1} X_{(k-1),i} + \varepsilon_i$

where the variance of $\varepsilon_i$ is relatively small.

The concept of lateral collinearity expands on this traditional view, and refers to collinearity between explanatory and criteria (i.e., explained) variables.^[12]

Usage in other areas

Antenna arrays

An antenna mast with four collinear directional arrays.

In telecommunications, a collinear (or co-linear) antenna array is an array of dipole antennas mounted in such a manner that the corresponding elements of each antenna are parallel and aligned, that is they are located along a common line or axis.

Photography

The collinearity equations are a set of two equations, used in photogrammetry and remote sensing to relate coordinates in an image (sensor) plane (in two dimensions) to object coordinates (in three dimensions). In the photography setting, the equations are derived by considering the central projection of a point of the object through the optical centre of the camera to the image in the image (sensor) plane. The three points, object point, image point and optical centre, are always collinear. Another way to say this is that the line segments joining the object points with their image points are all concurrent at the optical centre.^[13]

See also

• Pappus's hexagon theorem
• No-three-in-line problem
• Incidence (geometry)#Collinearity
• Coplanarity

Notes

1. The concept applies in any geometry Dembowski (1968, pg. 26), but is often only defined within the discussion of a specific geometry Coxeter (1969, pg. 168), Brannan, Esplen & Gray (1998, pg.106)
2. Colinear (Merriam-Webster dictionary)
3. Johnson, Roger A., Advanced Euclidean Geometry, Dover Publ., 2007 (orig. 1929).
4. Altshiller-Court, Nathan. College Geometry, Dover Publications, 1980.
5. Dušan Djukić, Vladimir Janković, Ivan Matić, Nikola Petrović, The IMO Compendium, Springer, 2006, p. 15.
6. Myakishev, Alexei (2006), "On Two Remarkable Lines Related to a Quadrilateral" (PDF), Forum Geometricorum 6: 289–295.
7. Honsberger, Ross (1995), "4.2 Cyclic quadrilaterals", Episodes in Nineteenth and Twentieth Century Euclidean Geometry, New Mathematical Library 37, Cambridge University Press, pp. 35–39, ISBN 978-0-88385-639-0
8. Bradley, Christopher (2011), Three Centroids created by a Cyclic Quadrilateral (PDF)
9. Nguyen Ngoc Giang, A proof of Dao theorem, Global Journal of Advanced Research on Classical and Modern Geometries, Vol.4, (2015), Issue 2, page 102-105, ISSN 2284-5569
10. Geoff Smith (2015). 99.20 A projective Simson line. The Mathematical Gazette, 99, pp 339-341. doi:10.1017/mag.2015.47
11. O.T.Dao 29-July-2013, Two Pascals merge into one, Cut-the-Knot
12. Kock, N.; Lynn, G. S. (2012). "Lateral collinearity and misleading results in variance-based SEM: An illustration and recommendations" (PDF). Journal of the Association for Information Systems 13 (7): 546–580.
13. It's more mathematically natural to refer to these equations as concurrency equations, but photogrammetry literature does not use that terminology.

References

• Brannan, David A.; Esplen, Matthew F.; Gray, Jeremy J. (1998), Geometry, Cambridge: Cambridge University Press, ISBN 0-521-59787-0
• Coxeter, H. S. M. (1969), Introduction to Geometry, New York: John Wiley & Sons, ISBN 0-471-50458-0
• Dembowski, Peter (1968), Finite geometries, Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 44, Berlin, New York: Springer-Verlag, ISBN 3-540-61786-8, MR 0233275