Incidence (geometry)

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In geometry, an incidence relation is a binary relation between different types of objects that captures the idea being expressed when phrases such as "a point lies on a line" or "a line is contained in a plane" are used. The most basic incidence relation is that between a point, P, and a line, l, sometimes denoted P I l. If P I l the pair (P, l) is called a flag. There are many expressions used in common language to describe incidence (for example, a line passes through a point, a point lies in a plane, etc.) but the term "incidence" is preferred because it does not have the additional connotations that these other terms have, and it can be used in a symmetric manner, reflecting this property of the relation. Statements such as "line l1 intersects line l2" are also statements about incidence relations, but in this case, it is because this is a shorthand way of saying that "there exists a point P that is incident with both line l1 and line l2". When one type of object can be thought of as a set of the other type of object (viz., a plane is a set of points) then an incidence relation may be viewed as containment.

Statements such as "any two lines in a plane meet" are called incidence propositions. This particular statement is true in a projective plane, though not true in the Euclidean plane where lines may be parallel. Historically, projective geometry was developed in order to make the propositions of incidence true without exceptions, such as those caused by the existence of parallels. From the point of view of synthetic geometry, projective geometry should be developed using such propositions as axioms. This is most significant for projective planes due to the universal validity of Desargues' theorem in higher dimensions.

In contrast, the analytic approach is to define projective space based on linear algebra and utilizing homogeneous co-ordinates. The propositions of incidence are derived from the following basic result on vector spaces: given subspaces U and W of a (finite dimensional) vector space V, the dimension of their intersection is dim U + dim W − dim (U + W). Bearing in mind that the geometric dimension of the projective space P(V) associated to V is dim V − 1 and that the geometric dimension of any subspace is positive, the basic proposition of incidence in this setting can take the form: linear subspaces L and M of projective space P meet provided dim L + dim M ≥ dim P.[1]

The following sections are limited to projective planes defined over fields, often denoted by PG(2, F), where F is a field, or P2F. However these computations can be naturally extended to higher dimensional projective spaces and the field may be replaced by a division ring (or skewfield) provided that one pays attention to the fact that multiplication is not commutative in that case.


Let V be the three dimensional vector space defined over the field F. The projective plane P(V) = PG(2, F) consists of the one dimensional vector subspaces of V called points and the two dimensional vector subspaces of V called lines. Incidence of a point and a line is given by containment of the one dimensional subspace in the two dimensional subspace.

Fix a basis for V so that we may describe its vectors as coordinate triples (with respect to that basis). A one dimensional vector subspace consists of a non-zero vector and all of its scalar multiples. The non-zero scalar multiples, written as coordinate triples, are the homogeneous coordinates of the given point, called point coordinates. With respect to this basis, the solution space of a single linear equation {(x, y, z) | ax + by + cz = 0} is a two dimensional subspace of V, and hence a line of P(V). This line may be denoted by line coordinates [a, b, c] which are also homogeneous coordinates since non-zero scalar multiples would give the same line. Other notations are also widely used. Point coordinates may be written as column vectors, (x, y, z)T, with colons, (x : y : z), or with a subscript, (x, y, z)P. Correspondingly, line coordinates may be written as row vectors, (a, b, c), with colons, [a : b : c] or with a subscript, (a, b, c)L. Other variations are also possible.

Incidence expressed algebraically[edit]

Given a point P = (x, y, z) and a line l = [a, b, c], written in terms of point and line coordinates, the point is incident with the line (often written as P I l), if and only if,

ax + by + cz = 0.

This can be expressed in other notations as:

ax + by + cz = [a,b,c] \cdot (x,y,z) =(a,b,c)_L \cdot (x,y,z)_P =
 = [a:b:c] \cdot (x:y:z) = (a,b,c) \left ( \begin{matrix} x \\ y \\ z \end{matrix} \right ) = 0.

No matter what notation is employed, when the homogeneous coordinates of the point and line are just considered as ordered triples, their incidence is expressed as having their dot product equal 0.

The line incident with a pair of distinct points[edit]

Let P1 and P2 be a pair of distinct points with homogeneous coordinates (x1, y1, z1) and (x2, y2, z2) respectively. These points determine a unique line l with an equation of the form ax + by + cz = 0 and must satisfy the equations:

ax1 + by1 + cz1 = 0 and
ax2 + by2 + cz2 = 0.

In matrix form this system of simultaneous linear equations can be expressed as:

\left( \begin{matrix} x & y & z \\ x_1 & y_1 & z_1 \\ x_2 & y_2 & z_2 \end{matrix} \right) \left( \begin{matrix} a \\ b \\ c \end{matrix} \right) = \left( \begin{matrix} 0 \\ 0 \\ 0 \end{matrix} \right).

This system has a nontrivial solution if and only if the determinant,

 \left| \begin{matrix} x & y & z \\ x_1 & y_1 & z_1 \\x_2 & y_2 & z_2 \end{matrix} \right| = 0.

Expansion of this determinantal equation produces a homogeneous linear equation which must be the equation of line l. Therefore, up to a common non-zero constant factor we have l = [a, b, c] where:

a = y1z2 - y2z1,
b = x2z1 - x1z2, and
c = x1y2 - x2y1.

In terms of the scalar triple product notation for vectors, the equation of this line may be written as:

PP1 × P2 = 0,

where P = (x, y, z) is a generic point.


Main article: Collinear

Points which are incident with the same line are said to be collinear. The set of all points incident with the same line is called a range.

If P1 = (x1, y1, z1), P2 = (x2, y2, z2), and P3 = (x3, y3, z3), then these points are collinear if and only if

 \left| \begin{matrix} x_1 & y_1 & z_1 \\ x_2 & y_2 & z_2 \\ x_3 & y_3 & z_3 \end{matrix} \right| = 0,

i.e., if and only if the determinant of the homogeneous coordinates of the points is equal to zero.

Intersection of a pair of lines[edit]

Let l1 = [a1, b1, c1] and l2 = [a2, b2, c2] be a pair of distinct lines. Then the intersection of lines l1 and l2 is point a P = (x0, y0, z0) that is the simultaneous solution (up to a scalar factor) of the system of linear equations:

a1x + b1y + c1z = 0 and
a2x + b2y + c2z = 0.

The solution of this system gives:

x0 = b1c2 - b2c1,
y0 = a2c1 - a1c2, and
z0 = a1b2 - a2b1.

Alternatively, consider another line l = [a, b, c] passing through the point P, that is, the homogeneous coordinates of P satisfy the equation:

ax+ by + cz = 0.

Combining this equation with the two that define P, we can seek a non-trivial solution of the matrix equation:

\left( \begin{matrix} a & b & c \\ a_1 & b_1 & c_1 \\ a_2 & b_2 & c_2 \end{matrix} \right) \left( \begin{matrix} x \\ y \\ z \end{matrix} \right) = \left( \begin{matrix} 0 \\ 0 \\ 0 \end{matrix} \right).

Such a solution exists provided the determinant,

 \left| \begin{matrix} a & b & c \\ a_1 & b_1 & c_1 \\a_2 & b_2 & c_2 \end{matrix} \right| = 0.

The coefficients of a, b and c in this equation give the homogeneous coordinates of P.

The equation of the generic line passing through the point P in scalar triple product notation is:

ll1 × l2 = 0.


Lines that meet at the same point are said to be concurrent. The set of all lines in a plane incident with the same point is called a pencil of lines centered at that point. The computation of the intersection of two lines shows that the entire pencil of lines centered at a point is determined by any two of the lines that intersect at that point. It immediately follows that the algebraic condition for three lines, [a1, b1, c1], [a2, b2, c2], [a3, b3, c3] to be concurrent is that the determinant,

 \left| \begin{matrix} a_1 & b_1 & c_1 \\a_2 & b_2 & c_2 \\ a_3 & b_3 & c_3 \end{matrix} \right| = 0.

See also[edit]


  1. ^ Joel G. Broida & S. Gill Williamson (1998) A Comprehensive Introduction to Linear Algebra, Theorem 2.11, p 86, Addison-Wesley ISBN 0-201-50065-5. The theorem says that dim (L + M) = dim L + dim M − dim (LM). Thus dim L + dim M > dim P implies dim (LM) > 0.
  • Harold L. Dorwart (1966) The Geometry of Incidence, Prentice Hall.