In geometry, an incidence relation is a heterogeneous relation 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, Template:Math, and a line, Template:Math, sometimes denoted Template:Math. If P and l are incident, Template:Math, the pair Template:Math 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. Statements such as "line Template:Math intersects line Template:Math" 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 Template:Math that is incident with both line Template:Math and line Template:Math". 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 Template:Math and Template:Math of a (finite-dimensional) vector space Template:Math, the dimension of their intersection is Template:Math. Bearing in mind that the geometric dimension of the projective space Template:Math associated to Template:Math is Template:Math and that the geometric dimension of any subspace is positive, the basic proposition of incidence in this setting can take the form: linear subspaces Template:Math and Template:Math of projective space Template:Math meet provided Template:Math.<ref>Joel G. Broida & S. Gill Williamson (1998) A Comprehensive Introduction to Linear Algebra, Theorem 2.11, p 86, Addison-Wesley Template:ISBN. The theorem says that Template:Math. Thus Template:Math implies Template:Math.</ref>
The following sections are limited to projective planes defined over fields, often denoted by Template:Math, where Template:Math is a field, or Template:Math. 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.
Template:MathEdit
{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}
Let Template:Math be the three-dimensional vector space defined over the field Template:Math. The projective plane Template:Math consists of the one-dimensional vector subspaces of Template:Math, called points, and the two-dimensional vector subspaces of Template:Math, 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 Template:Math 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 Template:Math} is a two-dimensional subspace of Template:Math, and hence a line of Template:Math. This line may be denoted by line coordinates Template:Math, 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, Template:MathT, with colons, Template:Math, or with a subscript, Template:Math. Correspondingly, line coordinates may be written as row vectors, Template:Math, with colons, Template:Math or with a subscript, Template:Math. Other variations are also possible.
Incidence expressed algebraicallyEdit
Given a point Template:Math and a line Template:Math, written in terms of point and line coordinates, the point is incident with the line (often written as Template:Math), if and only if,
This can be expressed in other notations as:
- <math>ax + by + cz = [a,b,c] \cdot (x,y,z) =(a,b,c)_L \cdot (x,y,z)_P =</math>
- <math> = [a:b:c] \cdot (x:y:z) = (a,b,c) \left ( \begin{matrix} x \\ y \\ z \end{matrix} \right ) = 0. </math>
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 pointsEdit
Let Template:Math and Template:Math be a pair of distinct points with homogeneous coordinates Template:Math and Template:Math respectively. These points determine a unique line Template:Math with an equation of the form Template:Math and must satisfy the equations:
In matrix form this system of simultaneous linear equations can be expressed as:
- <math>\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).</math>
This system has a nontrivial solution if and only if the determinant,
- <math> \left| \begin{matrix} x & y & z \\ x_1 & y_1 & z_1 \\x_2 & y_2 & z_2 \end{matrix} \right| = 0.</math>
Expansion of this determinantal equation produces a homogeneous linear equation, which must be the equation of line Template:Math. Therefore, up to a common non-zero constant factor we have Template:Math where:
In terms of the scalar triple product notation for vectors, the equation of this line may be written as:
where Template:Math is a generic point.
CollinearityEdit
{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}}
Points that 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 Template:Math, and Template:Math, then these points are collinear if and only if
- <math> \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,</math>
i.e., if and only if the determinant of the homogeneous coordinates of the points is equal to zero.
Intersection of a pair of linesEdit
{{#invoke:Labelled list hatnote|labelledList|Main article|Main articles|Main page|Main pages}} Let Template:Math and Template:Math be a pair of distinct lines. Then the intersection of lines Template:Math and Template:Math is point a Template:Math that is the simultaneous solution (up to a scalar factor) of the system of linear equations:
The solution of this system gives:
Alternatively, consider another line Template:Math passing through the point Template:Math, that is, the homogeneous coordinates of Template:Math satisfy the equation:
Combining this equation with the two that define Template:Math, we can seek a non-trivial solution of the matrix equation:
- <math>\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).</math>
Such a solution exists provided the determinant,
- <math> \left| \begin{matrix} a & b & c \\ a_1 & b_1 & c_1 \\a_2 & b_2 & c_2 \end{matrix} \right| = 0.</math>
The coefficients of Template:Math and Template:Math in this equation give the homogeneous coordinates of Template:Math.
The equation of the generic line passing through the point Template:Math in scalar triple product notation is:
ConcurrenceEdit
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, Template:Math to be concurrent is that the determinant,
- <math> \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.</math>
See alsoEdit
- Menelaus theorem
- Ceva's theorem
- Concyclic
- Hopcroft's problem of finding point–line incidences
- Incidence matrix
- Incidence algebra
- Incidence structure
- Incidence geometry
- Levi graph
- Hilbert's axioms
ReferencesEdit
- Harold L. Dorwart (1966) The Geometry of Incidence, Prentice Hall.