- Incidence (geometry)
In
geometry , therelation s 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-dimension al space). That is, they are thebinary relation s describing howsubset s 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 aprojective plane , though not true inEuclidean 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 ofsynthetic geometry it was considered that projective geometry "should be" developed using such propositions asaxiom s. This turns out to make a major difference only for the projective plane (for reasons to do withDesargues' theorem ).The modern approach is to define
projective space starting fromlinear algebra andhomogeneous co-ordinates . Then the propositions of incidence are derived from the following basic result onvector space s: 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 subspace s 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::
:where "m"1 and "m"2 are
slope s and "b"1 and "b"2 arey-intercept s. Moreover let "g" be the duality mapping:which maps lines onto their dual points. Then the intersection of lines "L"1 and "L"2 is point "P"3 where: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::
:Let "g"−1 be the inverse duality mapping::which maps points onto their dual lines. Then the unique line passing through points "P"1 and "P"2 is "L"3 where:
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 isperpendicular to the point (so that theirdot product is zero); that is, if:where "g" is the duality mapping.An equivalent way of checking for this same incidence is to see whether:is true.
Concurrence
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: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:
"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:"Proof." Letting "g" denote the duality mapping, then:The three lines are concurrent if and only if:According to the previous section, the intersection of the first two lines is a subset of the third line if and only if:Substituting equation (1) into equation (2) yields:but "g" distributes with respect to thecross product , so that: and "g" can be shown to be isomorphic w.r.t. the dot product, like so::so that equation (3) simplifies to:"Q.E.D. "Collinearity
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 :but if the points are expressed in homogeneous coordinates then these three different equations can be collapsed into one equation::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: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.