Affine space
In mathematics, an affine space is a geometric structure that generalizes certain properties of parallel lines in Euclidean space. In an affine space, there is no distinguished point that serves as an origin. Hence, no vector has a fixed origin and no vector can be uniquely associated to a point. In an affine space, there are instead displacement vectors between two points of the space. Thus it makes sense to subtract two points of the space, giving a vector, but it does not make sense to add two points of the space. Likewise, it makes sense to add a vector to a point of an affine space, resulting in a new point displaced from the starting point by that vector.
The simplest example of an affine space is a linear subspace of a vector space that has been translated away from the origin. In finite dimensions, such an affine subspace corresponds to the solution set of an inhomogeneous linear system. The displacement vectors for that affine space live in the solution set of the corresponding homogeneous linear system, which is a linear subspace. Linear subspaces, in contrast, always contain the origin of the vector space.
Informal descriptions
The following characterization may be easier to understand than the usual formal definition: an affine space is what is left of a vector space after you've forgotten which point is the origin (or, in the words of the French mathematician Marcel Berger, "An affine space is nothing more than a vector space whose origin we try to forget about, by adding translations to the linear maps"^{[1]}). Imagine that Alice knows that a certain point is the actual origin, but Bob believes that another point — call it p — is the origin. Two vectors, a and b, are to be added. Bob draws an arrow from point p to point a and another arrow from point p to point b, and completes the parallelogram to find what Bob thinks is a + b, but Alice knows that he has actually computed
- p + (a − p) + (b − p).
Similarly, Alice and Bob may evaluate any linear combination of a and b, or of any finite set of vectors, and will generally get different answers. However, if the sum of the coefficients in a linear combination is 1, then Alice and Bob will arrive at the same answer.
If Bob travels to
- λa + (1 − λ)b
then Alice can similarly travel to
- p + λ(a − p) + (1 − λ)(b − p) = λa + (1 − λ)b.
Then, for all coefficients λ + (1 − λ) = 1, Alice and Bob describe the same point with the same linear combination, starting from different origins.
While Alice knows the "linear structure", both Alice and Bob know the "affine structure"—i.e. the values of affine combinations, defined as linear combinations in which the sum of the coefficients is 1. An underlying set with an affine structure is an affine space.
Definition
An affine space^{[2]} is a set Template:Mvar together with a vector space Template:Mvar over a field Template:Mvar and a transitive and free group action of Template:Mvar (with addition of vectors as group action) on Template:Mvar. (That is, an affine space is a principal homogeneous space for the action of V.)
Explicitly, an affine space is a point set Template:Mvar together with a map
with the following properties:.^{[3]}^{[4]}^{[5]}
- Left identity
- Associativity
- Uniqueness
- is a bijection.
(Since the group V is abelian, there is no difference between its left and right actions, so it is also permissible to place vectors on the right.)
By choosing an origin, Template:Mvar, one can thus identify Template:Mvar with Template:Mvar, hence turn Template:Mvar into a vector space. Conversely, any vector space, Template:Mvar, is an affine space over itself.
Subtraction and Weyl's axioms
The uniqueness property ensures that subtraction of any two elements of Template:Mvar is well defined, producing a vector of Template:Mvar:
- is the unique vector in Template:Mvar such that .
One can equivalently define an affine space as a point set Template:Mvar, together with a vector space Template:Mvar, and a subtraction map
with the following properties:^{[6]}
These two properties are called Weyl's axioms.
Affine combinations
For any choice of origin Template:Mvar, and two points Template:Mvar, Template:Mvar in Template:Mvar and scalar Template:Mvar, there is a unique element of Template:Mvar, denoted by such that
This element can be shown to be independent of the choice of origin Template:Mvar. Instead of arbitrary linear combinations, only such affine combinations of points have meaning.
Examples
- When children find the answers to sums such as 4 + 3 or 4 − 2 by counting right or left on a number line, they are treating the number line as a one-dimensional affine space.
- Any coset of a subspace Template:Mvar of a vector space is an affine space over that subspace.
- If Template:Mvar is a matrix and b lies in its column space, the set of solutions of the equation T x = b is an affine space over the subspace of solutions of T x = 0.
- The solutions of an inhomogeneous linear differential equation form an affine space over the solutions of the corresponding homogeneous linear equation.
- Generalizing all of the above, if T : V → W is a linear mapping and y lies in its image, the set of solutions x ∈ V to the equation T x = y is a coset of the kernel of Template:Mvar, and is therefore an affine space over Ker T .
Affine subspaces
An affine subspace (sometimes called a linear manifold, linear variety, or a flat) of a vector space Template:Mvar is a subset closed under affine combinations of vectors in the space. For example, the set
is an affine space, where is a family of vectors in Template:Mvar; this space is the affine span of these points. To see that this is indeed an affine space, observe that this set carries a transitive action of the vector subspace Template:Mvar of Template:Mvar
This affine subspace can be equivalently described as the coset of the Template:Mvar-action
where Template:Mvar is any element of Template:Mvar, or equivalently as any level set of the quotient map V → V/W. A choice of Template:Mvar gives a base point of Template:Mvar and an identification of Template:Mvar with Template:Mvar, but there is no natural choice, nor a natural identification of Template:Mvar with Template:Mvar.
A linear transformation is a function that preserves all linear combinations; an affine transformation is a function that preserves all affine combinations. A linear subspace is an affine subspace containing the origin, or, equivalently, a subspace that is closed under linear combinations.
For example, in , the origin, lines and planes through the origin and the whole space are linear subspaces, while points, lines and planes in general as well as the whole space are the affine subspaces.
Affine combinations and affine dependence
{{#invoke:main|main}} An affine combination is a linear combination in which the sum of the coefficients is 1. Just as members of a set of vectors are linearly independent if none is a linear combination of the others, so also they are affinely independent if none is an affine combination of the others. The set of linear combinations of a set of vectors is their "linear span" and is always a linear subspace; the set of all affine combinations is their "affine span" and is always an affine subspace. For example, the affine span of a set of two points is the line that contains both; the affine span of a set of three non-collinear points is the plane that contains all three.
Vectors
- v_{1}, v_{2}, … , v_{n}
are linearly dependent if there exist scalars a_{1}, a_{2}, … , a_{n}, not all zero, for which Template:NumBlk
Similarly they are affinely dependent if in addition the sum of coefficients is zero:
a condition that ensures that the combination (Template:EquationNote) makes sense as a displacement vector.
Geometric objects as points and vectors
In an affine space, geometric objects have two different (although related) descriptions on languages of points (elements of Template:Mvar) and vectors (elements of Template:Mvar). A vector description can specify an object only up to translations.
Geometry | Points | Vectors |
---|---|---|
A point | One point P | none (zero vector space) |
A line (1-subspace) | Can be specified with two distinct points | A non-zero vector up to multiplication to (non-zero) scalars |
A line segment | Two (independent) points: P, Q |
One vector Template:Vec, or two dependent (mutually opposite) vectors Template:Vec and Template:Vec |
A plane (2-subspace) | Can be specified with three points not lying on one line | A linear 2-subspace, can be specified with two linearly-independent vectors |
A triangle | Three (independent) points: △P Q R |
Three dependent vectors related as Template:Vec = Template:Vec + Template:Vec, or Template:Vec + Template:Vec + Template:Vec = 0, or just two independent vectors |
A parallelogram | Four points: ▱P Q R S of which any three determine the fourth |
Two independent vectors: Template:Vec = Template:Vec Template:Vec = Template:Vec |
Axioms
Affine space is usually studied as analytic geometry using coordinates, or equivalently vector spaces. It can also be studied as synthetic geometry by writing down axioms, though this approach is much less common. There are several different systems of axioms for affine space.
Template:Harvtxt axiomatizes affine geometry (over the reals) as ordered geometry together with an affine form of Desargues's theorem and an axiom stating that in a plane there is at most one line through a given point not meeting a given line.
Affine planes satisfy the following axioms Template:Harv: (in which two lines are called parallel if they are equal or disjoint):
- Any two distinct points lie on a unique line.
- Given a point and line there is a unique line which contains the point and is parallel to the line
- There exist three non-collinear points.
As well as affine planes over fields (or division rings), there are also many non-Desarguesian planes satisfying these axioms. Template:Harv gives axioms for higher-dimensional affine spaces.
Relation to projective spaces
Affine spaces are subspaces of projective spaces: an affine plane can be obtained from any projective plane by removing a line and all the points on it, and conversely any affine plane can be used to construct a projective plane as a closure by adding a line at infinity whose points correspond to equivalence classes of parallel lines.
Further, transformations of projective space that preserve affine space (equivalently, that leave the hyperplane at infinity invariant as a set) yield transformations of affine space. Conversely, any affine linear transformation extends uniquely to a projective linear transformations, so the affine group is a subgroup of the projective group. For instance, Möbius transformations (transformations of the complex projective line, or Riemann sphere) are affine (transformations of the complex plane) if and only if they fix the point at infinity.
However, one cannot take the projectivization of an affine space, so projective spaces are not naturally quotients of affine spaces: one can only take the projectivization of a vector space, since the projective space is lines through a given point, and there is no distinguished point in an affine space. If one chooses a base point (as zero), then an affine space becomes a vector space, which one may then projectivize, but this requires a choice.
See also
- Space (mathematics)
- Affine geometry
- Affine group
- Affine transformation
- Affine variety
- Affine hull
- Heap (mathematics)
- Equipollence (geometry)
- Interval measurement, an affine observable in statistics
- Exotic affine space
Notes
- ↑ Template:Harvard citation no brackets
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ Template:Harvard citation no brackets
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ {{#invoke:citation/CS1|citation |CitationClass=citation }}
- ↑ Template:Harvard citation no brackets
References
- {{#invoke:citation/CS1|citation
|CitationClass=citation }}
- {{#invoke:citation/CS1|citation
|CitationClass=citation }}
- {{#invoke:citation/CS1|citation
|CitationClass=citation }}
- {{#invoke:citation/CS1|citation
|CitationClass=citation }}
- Template:Eom
- {{#invoke:citation/CS1|citation
|CitationClass=citation }}
- {{#invoke:citation/CS1|citation
|CitationClass=citation }}
- {{#invoke:citation/CS1|citation
|CitationClass=citation }}