Definition. Let be the field of real numbers or the field of complex numbers, and
a vector space over
. An inner product on
is a function which assigns to each ordered pair of vectors
a scalar
in
in such a way that for all
and all scalars
( a ) ;
( b ) ;
( c ) , the bar denoting complex conjugation;
( d ) if
.
The standard inner product on is defined on
and
by
.
The standard inner product on is defined for
and an
invertible matrix
over
as
.
The quadratic form determined by the inner product is the function that assigns to each vector the scalar
The polarization identities are
in which in the real case
in the complex case
Suppose is finite-dimensional and
is an ordered basis for
, for any inner product
on
, then the matrix
with
is called the matrix of the inner product in the ordered basis
. Since if
and
, then
Definition. An inner product space is a real or complex vector space, together with a specified inner product on that space.
A finite-dimensional real inner product space is often called a Euclidean space. A complex inner product space is often referred to as a unitary space.
Theorem 1. If is an inner product space, then for any vectors
and any scalar
(i) ;
(ii) for
;
(iii) ;
(iv) .
The inequality in (iii) is called the Cauchy-Schwarz inequality.
Definitions. Let and
be vectors in an inner product space
. Then
is orthogonal to
if
; since this implies
is orthogonal to
, we often simply say that
and
are orthogonal. If
is a set of vectors in
,
is called an orthogonal set provided all pairs of distinct vectors in
are orthogonal. An orthonormal set is an orthogonal set
with the additional property that
for every
.
Theorem 2. An orthogonal set of non-zero vectors is linearly independent.
Corollary. If and
is a linear combination of an orthogonal sequence of non-zero vectors
, then
is the particular linear combination
Theorem 3. Let be an inner product space and let
be any independent vectors in
. Then one may construct orthogonal vectors
in
such that for each
the set
is a basis for the subspace spanned by
.
Corollary. Every finite-dimensional inner product space has an orthonormal basis.
A best approximation to by vectors in
is a vector
such that
for every
.
Theorem 4. Let be a subspace of an inner product space
and let
.
(i) is a best approximation to
by vectors in
if and only if
is orthogonal to every vector in
.
(ii) If a best approximation to by vectors in
exists, it is unique.
(iii) If is finite-dimensional and
is any orthogonal basis for
, then the vector
is the (unique) best approximation to by vectors in
.
Definition. Let be an inner product space and
any set of vectors in
. The orthogonal complement of
is the set
of all vectors in
which are orthogonal to every vector in
.
Definition. Whenever the vector in Theorem 4 exists it is called the orthogonal projection of
on
. If every vector in
has an orthogonal projection on
, the mapping that assigns to each vector in
its orthogonal projection on
is called the orthogonal projection of
on
Corollary. Let be an inner product space,
a finite-dimensional subspace, and
the orthogonal projection of
on
. Then the mapping
is the orthogonal projection of
on
.
Theorem 5. Let be a finite-dimensional subspace of an inner product space
and let
be the orthogonal projection of
on
. Then
is an idempotent linear transformation of
onto
is the null space of
, and
.
Corollary. Under the conditions of the theorem, is the orthogonal projection of
on
. It is an idempotent linear transformation of
onto
with null space
.
Corollary. (Bessel’s inequality) Let be an orthogonal set of non-zero vectors in an inner product space
. If
is any vector in
, then
and equality holds if and only if
Theorem 6. Let be a finite-dimensional inner product space, and
a linear functional on
. Then there exists a unique vector
such that
for all
.
Theorem 7. For any linear operator on a finite-dimensional inner product space
, there exists a unique linear operator
on
such that
for all
.
Theorem 8. Let be a finite-dimensional inner product space and let
be an (ordered) orthonormal basis for
. Let
be a linear operator on
and let
be the matrix of
in the ordered basis
. Then
.
Corollary. Let be a finite-dimesional inner product space, and let
be a linear operator on
. In any orthonormal basis for
, the matrix of
is the conjugate transpose of the matrix of
.
Definition. Let be a linear operator on an inner product space
. Then we say that
has an adjoint on
if there exists a linear operator
on
such that
for all
.
- The adjoint of
depends not only on
but on the inner product as well.
- in an arbitrary ordered basis
, the relation between
and
is more complicated than that given in the corollary above.
Theorem 9. Let be a finite-dimensional inner product space. If
and
are linear operators on
and
is a scalar,
(i) ;
(ii) ;
(iii) ;
(iv) .
A linear operator such that
is called self-adjoint (or Hermitian).
Definition. Let and
be inner product spaces over the smae field, and let
be a linear transformation from
into
. We say that
preserves inner products if
for all
. An isomorphism of
onto
is a vector space isomorphism
of
onto
which also preserves inner products.
When such a exists, we shall say
and
are isomorphic.
Theorem 10. Let and
be finite-dimensional inner product spaces over the same field, having the same dimension. If
is a linear transformation from
into
, the following are quivalent.
(i) preserves inner products.
(ii) is an (inner product space) isomorphism.
(iii) carries every orthonormal basis for
onto an orthonormal basis for
.
(iv) carries some orthonormal basis for
onto an orthonormal basis for
.
Corollary. Let and
be finite-dimensional inner product space over the same field. Then
and
are isomorphic if and only if they have the same dimension.
Theorem 11. Let and
be inner product spaces over the same field, and let
be a linear transformation from
into
. Then
preserves inner products if and only if
for every
.
Definition. A unitary operator on an inner product space is an isomorphism of the space onto itself.
Theorem 12. Let be a linear operator on an inner product space
. Then
is unitary if and only if the adjoint
of
exists and
.
Definition. A complex matrix
is called unitary, if
.
Theorem 13. Let be a finite-dimensional inner product space and let
be a linear operator on
. Then
is unitary if and only if the matrix of
in some (or every) ordered orthonormal basis is a unitary matrix.
Definition. A real or complex matrix
is said to be orthogonal, if
.
Theorem 14. For every invertible complex matrix
there exists a unique lower-triangular matrix
with positive entries on the main diagonal such that
is unitary.
Let denote the set of all invertible complex
matrices. Then
is a group under matrix multiplication. This group is called the general linear group.
Corollary. For each in
there exist unique matrices
and
such that
is in
, the set of all complex
lower-triangular matrices with positive entries on the main diagonal, and
is in
, and
.
Definition. Let and
be complex
matrices. We say that
is unitarily equivalent to
if there is an
unitary matrix
such that
. We say that
is orthogonally equivalent to
if there is an
orthogonal matrix
such that
Definition. Let be a finite-dimensional inner product space and
a linear operator on
. We say that
is normal if it commutes with its adjoint, i.e.,
.
Theorem 15. Let be an inner product space and
a self-adjoint linear operator on
. Then each chareacteristic value of
is real, and characteristic vectors of
associated with distinct characteristic values are orthogonal.
Theorem 16. On a finite-dimensional inner product space of positive dimension, every self-adjoint operator has a (non-zero) characteristic vector.
Theorem 17. Let be a finite-dimensional inner product space, and let
be any linear operator on
. Suppose
is a subspace of
which is invariant under
. Then the orthogonal complement of
is invariant under
.
Theorem 18. Let be a finite-dimensional inner product space, and let
be a self-adjoint linear operator on
. Then there is an orthonormal basis for
, each vector of which is a characteristic vector for
.
Corollary. Let be an
Hermitan (self-adjoint) matrix. Then there is a unitary matrix
such that
is diagonal (
is unitarily equivalent to a diagonal matrix). If
is a real symmetric matrix, there is a real orthogonal matrix
such that
is diagonal.
Theorem 19. Let be a finite-dimensional inner product space and
a normal operator on
. Suppose
is a vector in
. Then
is a characteristic vector for
with characteristic value
if and only if
is a characteristic vector for
with characteristic value
.
Definition. A complex matrix
is called normal if
.
Theorem 20. Let be a finite-dimensional inner product space,
a linear operator on
, and
an orthonormal basis for
. Suppose that the matrix
of
in the basis
is upper triangular. Then
is normal if and only if
is a diagonal matrix.
Theorem 21. Let be a finite-dimensional complex inner product space,
a linear operator on
. Then ther eis an orthonormal basi for
in which the matrix of
is upper triangular.
Corollary. For every complex matrix
there is a unitary matrix
such that
is upper-triangular.
Theorem 22. Let be a finite-dimensional complex inner product space and
a normal operator on
. Then
has an orthonormal basis consisting of characteristic vectors for
.
Corollary. For every normal matrix there is a unitary matrix
such that
is a diagonal matrix.