The term "homogeneous" more accurately describes the linear expressions that will be discussed. But it will most often be omitted.
It is easy to extend this definition to include linear expressions in more variables, like x,y,z,w,... .However, this will not be done. Instead, discussions will involve only algebraic ideas that relate directly to the familiar geometric objects of point, line, plane and (3-dimensional) space. These four objects will be called linear objects in these discussions. They are to be distinguished from other geometric objects like circles, spheres, sine curves, helices,... .
In most discussions the coefficients of expressions will be integers, or, occasionally, rational numbers.
It is simple to find values for the linear expressions
[1.2] (Corresponding functions) The correspoinding function F for a matrix M is obtained by defining F by F(x,y) = (linear array in x and y with coefficients from row 1 of M, linear array in x and y with coefficients from row 2 of M,....). If three variables are involved, F(x,y,z) = (linear array in x,y and z with coefficients from row 1 of M, linear array in x,y and z with coefficients from row 2 of M,....)
Subsets of geometric points can form recognizable objects: lines, circles, squares, cones,... . Some of these objects are more fundamental to discussions here: points, lines, planes, entire 3 dimensional space. They may be called basic affine objects. They have dimensions 0,1,2, and 3 respectively. They are fundamental parts of the subjects of plane and solid geometry. If they contain special points called origins, then they are basic linear objects. The term "basic" will often be omitted in these discussions.
Since linear objects have origins, position vectors exist. These have been denoted by p,q,r which locate points P,Q,R and can be expressed as p = OP, q = OQ, r = OR. For a geometric motivation for linear transformations click here.
[2.1] (Linear transformations) A function F from a linear object to a linear object is a linear transformation if and only if it satisfies the following two conditions:
(a) F(p + q) = F(p) + F(q); (homomorphism)
(b) F(λp) = λF(p) (homogeneous)
where p and q are any (position) vectors in the first linear object and λ is any real number.
Example:
Consider the function F from any linear object onto itself, defined by F(p) = 2p, for every point P in the first linear object.. Then F(q) = 2q, F(r) = 2r for position vectors q,r.... Intuitively speaking, F stretches any position vector to another vector pointing in the same direction but twice the length. F satisfies both conditions (a) and (b) of [2.1]:
(a) F(p + q) = 2(p + q) = 2p + 2q = F(p) + F(q).
(b) F(λp) = 2(λp) = λ(2p) = λF(p).
The following is a generalization of the defintion [2.1] of a linear transformation.
[2.2] Every linear transformation carries any linear combination of position vectors onto a linear combination of position vectors with the same coefficients.
Notation: If F is a linear transformation then F(λp + σq + ... + ωr) =
λF(p) + σF(q) + ... + ωF(r).
In a linear object position vectors locate points, and to those points are "attached" linear arrays. Therefore, linear arrays can be represented by position vectors. If a position vector p in a plane locates a point P(x,y), then p = (x,y). Similarly, if p in space locates point P(x,y,z) then p = (x,y,z). As a result,definition [2.1] may be stated for linear arrays by replacing p and q by their equals (x1,y1) and (x2,y2): F(p) = F(x1,y1), and F(q) = F(x2,y2). Similarly if F is from space: F(p) = F(x1,y1,z1), and F(q) = F(x2,y2,z2). (Here the two F's denote different functions because they involve different linear objects, namely plane and space.)
Example: The function F defined by F(x,y) = (x + y, x - y) is a linear transformation from a plane onto itself. It carries point (1,1) onto point (2,0), point (5,3) onto (8,2). Click here to see the proof that it satisfies both conditions
The following functions F,G,H are also linear transformations:
[2.3] A function from a plane into a linear object is a linear transformation if and only if carries an arbitrary point (x,y) onto a point whose coordinates are linear expressions of x and y. A function from space is a linear transformation if and only if it carries an arbitrary point (x,y,z) onto a point whose coordinates are linear expressions of x,y and z.
The pair of special unit arrays in a plane (1,0) = i and (0,1) = j as well as the triple of special unit arrays in space (1,0,0) = i, (0,1,0) = j and (0,0,1) = k play special roles with linear transformations.
Example: suppose F(1,0) = (4,5) and F(0,1) = (6,7). Onto what point does F carry the arbitrary point (x,y)? Notice that array (x,y) = x(1,0) + y(0,1). Then F(x,y) = xF(1,0) + yF(0,1) = x(4,5) + y(6,7) = (4x + 6y, 5x + 7y). Therefore, F carries the arbitrary point (x,y) onto the point (4x + 6y, 5x + 7y). This fact completely defines and determines F.
[2.4a] (Linear transformation from the plane is determined by images of two special points) From the identity
[2.4b] (Linear transformation from space is determined by images of three special points) From the identity
The expression xF(1,0) + yF(0,1) is actually an array whose coordinates are linear expressions in x and y. If F(1,0) = (α1, β1) and F(0,1) = (α2, β2) then
The coefficients of the linear expressions in (#) and (##) can be collected into matrices M2 and M3:
[2.5a] (Linear transformations from a plane into some linear object) If F is any linear transformation from a plane into some linear object then F(x,y)' = M(x,y)' where M is the matrix
[2.5b] (Linear transformations from space into some linear object) If F is any linear transformation from space into some linear object then F(x,y,z)' = M(x,y,z)' where M is the matrix
Recall that if a function F carries a point P onto a point Q, and a function G carries point Q onto a point R, then the composite GF carries P onto R.
[2.6] (Composition of linear transformations) The composite of two linear transformations is a linear transformation.
Notation: if F and G are linear transformations, then GF is a linear transformation.
F carries a position vector p + q onto a position vector F(p + q). Then G carries F(p + q) onto GF(p + q). But GF(p + q) = G(F(p) + F(q)) = GF(p) + GF(p + q). Also GF(λp) = G(λF(p)) = λGF(b>p); Therefore GF is a linear transformation. As was mentioned earlier, linear transformations and their corresponding matrices behave the same way, except for notation. Therefore, the following statement comes as no surprise.
[2.7] (Composition and matrix product) The matrix that corresponds to the composite of two linear transformations is equal to the product in the same order of the matrices that correspond to the individual linear transformations.
Notation: If M is the matrix that corresponds to linear transformation F, and N is the matrix that corresponds to linear transformation G, then the (matrix) product MN of the two matrices is the matrix that corresponds to the composite GF of the two transformations.