Incidence (geometry)

Incidence (geometry)

In geometry, the relations of incidence are those such as 'lies on' between points and lines (as in 'point P lies on line L'), and 'intersects' (as in 'line L1 intersects line L2', in three-dimensional space). That is, they are the binary relations describing how subsets meet. The propositions of incidence stated in terms of them are statements such as 'any two lines in a plane meet'. This is true in a projective plane, though not true in Euclidean space of two dimensions where lines may be parallel.

Historically, projective geometry was introduced in order to make the propositions of incidence true (without exceptions such as are caused by parallels). From the point of view of synthetic geometry it was considered that projective geometry "should be" developed using such propositions as axioms. This turns out to make a major difference only for the projective plane (for reasons to do with Desargues' theorem).

The modern approach is to define projective space starting from linear algebra and homogeneous co-ordinates. Then the propositions of incidence are derived from the following basic result on vector spaces: given subspaces "U" and "V" of a vector space "W", the dimension of their intersection is at least dim "U" + dim "V" − dim "W". Bearing in mind that the dimension of the projective space P("W") associated to "W" is dim "W" − 1, but that we require an intersection of subspaces of dimension at least 1 to register in projective space (the subspace {0} being common to all subspaces of "W"), we get the basic proposition of incidence in this form: linear subspaces L and M of projective space P meet provided dim L + dim M is at least dim P.

Intersection of a pair of lines

Let "L"1 and "L"2 be a pair of lines, both in a projective plane and expressed in homogeneous coordinates:: L_1 : [m_1 : b_1 : 1] _L

: L_2 : [m_2 : b_2 : 1] _L where "m"1 and "m"2 are slopes and "b"1 and "b"2 are y-intercepts. Moreover let "g" be the duality mapping: g : [x : y : z] mapsto [x : -z : y] which maps lines onto their dual points. Then the intersection of lines "L"1 and "L"2 is point "P"3 where: P_3 = g(L_1 imes L_2).

Determining the line passing through a pair of points

Let "P"1 and "P"2 be a pair of points, both in a projective plane and expressed in homogeneous coordinates:: P_1 : [x_1 : y_1 : z_1] ,

: P_2 : [x_2 : y_2 : z_2] . Let "g"−1 be the inverse duality mapping:: g^{-1} : [x : y : z] mapsto [x : z : -y] which maps points onto their dual lines. Then the unique line passing through points "P"1 and "P"2 is "L"3 where: L_3 = g^{-1}(P_1 imes P_2).

Checking for incidence of a line on a point

Given line "L" and point "P" in a projective plane, and both expressed in homogeneous coordinates, then "P"⊂"L" if and only if the dual of the line is perpendicular to the point (so that their dot product is zero); that is, if: gL cdot P = 0 where "g" is the duality mapping.

An equivalent way of checking for this same incidence is to see whether: L cdot g^{-1} P = 0 is true.


Three lines in a projective plane are concurrent if all three of them intersect at one point. That is, given lines "L"1, "L"2, and "L"3; these are concurrent if and only if: L_1 cap L_2 = L_2 cap L_3 = L_3 cap L_1. If the lines are represented using homogeneous coordinates in the form ["m":"b":1] "L" with "m" being slope and "b" being the y-intercept, then concurrency can be restated as: L_1 imes L_2 equiv L_2 imes L_3 equiv L_3 imes L_1.

"Theorem." Three lines "L"1, "L"2, and "L"3 in a projective plane and expressed in homogeneous coordinates are concurrent if and only if their scalar triple product is zero, viz. if and only if: = L_1 cdot L_2 imes L_3 = 0. "Proof." Letting "g" denote the duality mapping, then: L_1 cap L_2 = gL_1 imes gL_2. qquad qquad (1)The three lines are concurrent if and only if: (L_1 cap L_2) subset L_3. According to the previous section, the intersection of the first two lines is a subset of the third line if and only if: gL_3 cdot (L_1 cap L_2) = 0 qquad qquad (2)Substituting equation (1) into equation (2) yields: (gL_1 imes gL_2) cdot gL_3 = 0 qquad qquad (3)but "g" distributes with respect to the cross product, so that: g(L_1 imes L_2) cdot gL_3 = 0, and "g" can be shown to be isomorphic w.r.t. the dot product, like so:: A cdot B = gA cdot gB so that equation (3) simplifies to: (L_1 imes L_2) cdot L_3 = = 0. "Q.E.D."


The dual of concurrency is collinearity. Three points "P"1, "P"2, and "P"3 in the projective plane are collinear if they all lie on the same line. This is true if and only if: P_1.P_2 equiv P_2.P_3 equiv P_3.P_1, but if the points are expressed in homogeneous coordinates then these three different equations can be collapsed into one equation:: = P_1 cdot P_2 imes P_3 = 0 which is more symmetrical and whose computation is straightforward.

If "P"1 : ("x"1 : "y"1 : "z"1), "P"2 : ("x"2 : "y"2 : "z"2), and "P"3 : ("x"3 : "y"3 : "z"3), then "P"1, "P"2, and "P"3 are collinear if and only if: left| egin{matrix} x_1 & y_1 & z_1 \ x_2 & y_2 & z_2 \ x_3 & y_3 & z_3 end{matrix} ight| = 0,i.e. if and only if the determinant of the homogeneous coordinates of the points is equal to zero.

ee also

* Menelaus theorem
* Ceva's theorem
* concyclic
* Incidence matrix
* incidence algebra
* angle of incidence
* incidence structure
* incidence geometry
* Levi graph
* Hilbert's axioms
* Incidence (descriptive geometry)

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Incidence geometry (structure) — An incidence geometry is a mathematical structure composed of objects of various types and an incidence relation between them. The number of types of object used in the structure is called the rank of the incidence geometry.Incidence geometries… …   Wikipedia

  • De Bruijn–Erdős theorem (incidence geometry) — See also: De Bruijn–Erdős theorem (graph theory) In incidence geometry, the De Bruijn–Erdős theorem, originally published by Nicolaas Govert de Bruijn and Paul Erdős (1948), states a lower bound on the number of lines determined by n points… …   Wikipedia

  • Incidence — may refer to:* Incidence (epidemiology), a measure of the risk of developing some new condition within a specified period of time * Incidence (geometry), the binary relations describing how subsets meet * Angle of incidence, a measure of… …   Wikipedia

  • Incidence structure — In combinatorial mathematics, an incidence structure is a triple :C=(P,L,I)., where P is a set of points , L is a set of lines and I subseteq P imes L is the incidence relation. The elements of I are called flags. If :(p,ell) in I,we say that… …   Wikipedia

  • Incidence matrix — In mathematics, an incidence matrix is a matrix that shows the relationship between two classes of objects. If the first class is X and the second is Y, the matrix has one row for each element of X and one column for each element of Y. The entry… …   Wikipedia

  • incidence — /ˈɪnsədəns / (say insuhduhns) noun 1. the range of occurrence or influence of a thing, or the extent of its effects: the incidence of a disease. 2. the falling, or direction or manner of falling, of a ray of light, etc., on a surface. 3. a… …   Australian English dictionary

  • Buekenhout geometry — In mathematics, a Buekenhout geometry or diagram geometry is a generalization of projective space, Tits buildings, and several other geometric structures, introduced by Buekenhout (1979). Definition A Buekenhout geometry consists of a set X whose …   Wikipedia

  • Configuration (geometry) — Configurations (4362) (a complete quadrangle, at left) and (6243) (a complete quadrilateral, at right). In mathematics, specifically projective geometry, a configuration in the plane consists of a finite set of points, and a finite arrangement of …   Wikipedia

  • Line (geometry) — Three lines the red and blue lines have the same slope, while the red and green ones have same y intercept …   Wikipedia

  • Ordered geometry — is a form of geometry featuring the concept of intermediacy (or betweenness ) but, like projective geometry, omitting the basic notion of measurement. Ordered geometry is a fundamental geometry forming a common framework for affine, Euclidean,… …   Wikipedia