Definition.
R
R
is a
linear map if
(i)
v
w
v
w
, for any
v
w (``additivity''), and
(ii)
v
v
, for any vector
v
and scalar
(``homogeneity'').
Example. Let
be an
matrix,
and let
be defined by
x
x (where
x
is any column vector). Then
is a linear map, by the
algebraic properties of matrix operations.
Observations. If
is a linear map then
(a)
0
0 (the origin goes to the origin),
(b)
v
w
v
w
(
is
compatible with linear combinations).
Outline of proof. Use the standard basis of
R
:
e
e
.
For any
, let
be the matrix whose
-th row is
e
; then
x
is the same as
x
for
x
one of the
e
and so for any
x,
since every vector
x in
R
is a linear combination
of standard basis vectors and
preserves linear combinations.
Thus
.
Remarks
(1) Linear maps leave the origin fixed. We'll also be discussing ``affine'' maps, which are a generalization in which the origin can move. Because these still take lines to lines, some texts also call affine maps ``linear''.
(2) If we're thinking about linear maps
abstractly we'll use just the letter
; if we have
in
mind we'll use
. By the Theorem these two points of
view are equivalent. Later on we'll use
for other kinds
of maps as well.
(3) The definition of
x
as
x assumes that
the
-tuple
x is represented as a row vector; this is a
common assumption in computer graphics packages. If we use column
vectors, it would be
x. Notes in this course generally assume
row vectors.
(4) In projective geometry, it is shown that any one-to-one
maps of
R
onto itself taking lines to lines and the
origin to the origin must be a linear map. (This is a deep
fact.)