Incidence (geometry)

Last updated

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, 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. 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.

Contents

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.

PG(2,F)

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

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:

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

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:

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

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.

Collinearity

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 P1 = (x1, y1, z1), P2 = (x2, y2, z2), and P3 = (x3, y3, z3), then these points 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.

Intersection of a pair of lines

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:

Such a solution exists provided the determinant,

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.

Concurrence

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,

See also

Related Research Articles

In mathematics, and more specifically in linear algebra, a linear map is a mapping between two vector spaces that preserves the operations of vector addition and scalar multiplication. The same names and the same definition are also used for the more general case of modules over a ring; see Module homomorphism.

<span class="mw-page-title-main">Linear algebra</span> Branch of mathematics

Linear algebra is the branch of mathematics concerning linear equations such as:

<span class="mw-page-title-main">Vector space</span> Algebraic structure in linear algebra

In mathematics and physics, a vector space is a set whose elements, often called vectors, may be added together and multiplied ("scaled") by numbers called scalars. Scalars are often real numbers, but can be complex numbers or, more generally, elements of any field. The operations of vector addition and scalar multiplication must satisfy certain requirements, called vector axioms. The terms real vector space and complex vector space are often used to specify the nature of the scalars: real coordinate space or complex coordinate space.

<span class="mw-page-title-main">Linear subspace</span> In mathematics, vector subspace

In mathematics, and more specifically in linear algebra, a linear subspace, also known as a vector subspace is a vector space that is a subset of some larger vector space. A linear subspace is usually simply called a subspace when the context serves to distinguish it from other types of subspaces.

<span class="mw-page-title-main">Plane (geometry)</span> Flat two-dimensional surface

In mathematics, a plane is a Euclidean (flat), two-dimensional surface that extends indefinitely. A plane is the two-dimensional analogue of a point, a line and three-dimensional space. Planes can arise as subspaces of some higher-dimensional space, as with one of a room's walls, infinitely extended, or they may enjoy an independent existence in their own right, as in the setting of two-dimensional Euclidean geometry. Sometimes the word plane is used more generally to describe a two-dimensional surface, for example the hyperbolic plane and elliptic plane.

<span class="mw-page-title-main">Row and column spaces</span>

In linear algebra, the column space of a matrix A is the span of its column vectors. The column space of a matrix is the image or range of the corresponding matrix transformation.

<span class="mw-page-title-main">System of linear equations</span> Several equations of degree 1 to be solved simultaneously

In mathematics, a system of linear equations is a collection of one or more linear equations involving the same variables.

<span class="mw-page-title-main">Normal (geometry)</span> Line or vector perpendicular to a curve or a surface

In geometry, a normal is an object such as a line, ray, or vector that is perpendicular to a given object. For example, the normal line to a plane curve at a given point is the (infinite) line perpendicular to the tangent line to the curve at the point. A normal vector may have length one or its length may represent the curvature of the object ; its algebraic sign may indicate sides.

In mathematics, the matrix representation of conic sections permits the tools of linear algebra to be used in the study of conic sections. It provides easy ways to calculate a conic section's axis, vertices, tangents and the pole and polar relationship between points and lines of the plane determined by the conic. The technique does not require putting the equation of a conic section into a standard form, thus making it easier to investigate those conic sections whose axes are not parallel to the coordinate system.

<span class="mw-page-title-main">Projective space</span> Completion of the usual space with "points at infinity"

In mathematics, the concept of a projective space originated from the visual effect of perspective, where parallel lines seem to meet at infinity. A projective space may thus be viewed as the extension of a Euclidean space, or, more generally, an affine space with points at infinity, in such a way that there is one point at infinity of each direction of parallel lines.

<span class="mw-page-title-main">Homogeneous coordinates</span> Coordinate system used in projective geometry

In mathematics, homogeneous coordinates or projective coordinates, introduced by August Ferdinand Möbius in his 1827 work Der barycentrische Calcul, are a system of coordinates used in projective geometry, just as Cartesian coordinates are used in Euclidean geometry. They have the advantage that the coordinates of points, including points at infinity, can be represented using finite coordinates. Formulas involving homogeneous coordinates are often simpler and more symmetric than their Cartesian counterparts. Homogeneous coordinates have a range of applications, including computer graphics and 3D computer vision, where they allow affine transformations and, in general, projective transformations to be easily represented by a matrix.

<span class="mw-page-title-main">Real projective plane</span> Compact non-orientable two-dimensional manifold

In mathematics, the real projective plane is an example of a compact non-orientable two-dimensional manifold; in other words, a one-sided surface. It cannot be embedded in standard three-dimensional space without intersecting itself. It has basic applications to geometry, since the common construction of the real projective plane is as the space of lines in passing through the origin.

In geometry, a striking feature of projective planes is the symmetry of the roles played by points and lines in the definitions and theorems, and (plane) duality is the formalization of this concept. There are two approaches to the subject of duality, one through language and the other a more functional approach through special mappings. These are completely equivalent and either treatment has as its starting point the axiomatic version of the geometries under consideration. In the functional approach there is a map between related geometries that is called a duality. Such a map can be constructed in many ways. The concept of plane duality readily extends to space duality and beyond that to duality in any finite-dimensional projective geometry.

In linear algebra, linear transformations can be represented by matrices. If is a linear transformation mapping to and is a column vector with entries, then

<span class="mw-page-title-main">Line (geometry)</span> Straight figure with zero width and depth

In geometry, a line is an infinitely long object with no width, depth, or curvature. Thus, lines are one-dimensional objects, though they may exist in two, three, or higher dimension spaces. The word line may also refer to a line segment in everyday life, which has two points to denote its ends. Lines can be referred by two points that lay on it or by a single letter.

In mathematics, the kernel of a linear map, also known as the null space or nullspace, is the linear subspace of the domain of the map which is mapped to the zero vector. That is, given a linear map L : VW between two vector spaces V and W, the kernel of L is the vector space of all elements v of V such that L(v) = 0, where 0 denotes the zero vector in W, or more symbolically:

In geometry, Plücker coordinates, introduced by Julius Plücker in the 19th century, are a way to assign six homogeneous coordinates to each line in projective 3-space, P3. Because they satisfy a quadratic constraint, they establish a one-to-one correspondence between the 4-dimensional space of lines in P3 and points on a quadric in P5. A predecessor and special case of Grassmann coordinates, Plücker coordinates arise naturally in geometric algebra. They have proved useful for computer graphics, and also can be extended to coordinates for the screws and wrenches in the theory of kinematics used for robot control.

<span class="mw-page-title-main">Blowing up</span>

In mathematics, blowing up or blowup is a type of geometric transformation which replaces a subspace of a given space with all the directions pointing out of that subspace. For example, the blowup of a point in a plane replaces the point with the projectivized tangent space at that point. The metaphor is that of zooming in on a photograph to enlarge part of the picture, rather than referring to an explosion.

<span class="mw-page-title-main">Three-dimensional space</span> Geometric model of the physical space

Three-dimensional space is a geometric setting in which three values are required to determine the position of an element. This is the informal meaning of the term dimension.

<span class="mw-page-title-main">Real projective line</span>

In geometry, a real projective line is a projective line over the real numbers. It is an extension of the usual concept of a line that has been historically introduced to solve a problem set by visual perspective: two parallel lines do not intersect but seem to intersect "at infinity". For solving this problem, points at infinity have been introduced, in such a way that in a real projective plane, two distinct projective lines meet in exactly one point. The set of these points at infinity, the "horizon" of the visual perspective in the plane, is a real projective line. It is the set of directions emanating from an observer situated at any point, with opposite directions identified.

References

  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.