Graduate Texts in Mathematics
Linear Algebra
Volume 23 1975
Springer
Graduate Texts in Mathematics 23
Editorial Board: F. W. Gehring P. R. Halmos (Managing Editor) C. C. Moore
Werner Greub
Linear Algebra Fourth Edition
Springer-Verlag
New York Heidelberg Berlin
Werner Greub University of Toronto Department of Mathematics Toronto M5S 1A1 Canada
Managing Editor P. R. Halmos Indiana University Department of Mathematics Swain Hall East Bloomington, Indiana 47401
Editors F. W. Gehring
C. C. Moore
University of Michigan Department of Mathematics Ann Arbor, Michigan 48104
University of California at Berkeley Department of Mathematics Berkeley, California 94720
AMS Subject Classifications 15-01, 15A03, 15A06, 15A18, 15A21, 16-01 Library
Greub,
of Congress Cataloging in Publication Data Werner Hildbert, 1925—
algebra. (Graduate texts in mathematics; v. 23) Bibliography: p. 445 1. Algebras, Linear. 1. Title. II. Series. QA184.G7313 1974 512'.S 74-13868 Linear
All rights
reserved.
No part of this book may be translated or reproduced in any form without written permission from Springer-Verlag. © 1975 by Springer-Verlag New York Inc. Softcover reprint of the hardcover 4th edition 1975 ISBN 978-1-4684-9448-8 DOl 10.1007/978-1-4684-9446-4
ISBN 978-1-4684-9446-4 (eBook)
To Roif Nevanlinna
Preface to the fourth edition This textbook gives a detailed and comprehensive presentation of linear algebra based on an axiomatic treatment of linear spaces. For this fourth edition some new material has been added to the text, for instance, the intrinsic treatment of the classical adjoint of a linear transformation in Chapter IV, as well as the discussion of quaternions and the classification of associative division algebras in Chapter VII. Chapters XII and
XIII have been substantially rewritten for the sake of clarity, but the contents remain basically the same as before. Finally, a number of problems covering new topics — e.g. complex structures, Caylay numbers and symplectic spaces — have been added.
I should like to thank Mr. M. L. Johnson who made many useful suggestions for the problems in the third edition. I am also grateful to my colleague S. Halperin who assisted in the revision of Chapters XII and XIII and to Mr. F. Gomez who helped to prepare the subject index. Finally, I have to express my deep gratitude to my colleague J. R. Vanstone who worked closely with me in the preparation of all the revisions and additions and who generously helped with the proof reading.
Toronto, February 1975
WERNER H. GREUB
Preface to the third edition The major change between the second and third edition is the separation
of linear and multilinear algebra into two different volumes as well as the incorporation of a great deal of new material. However, the essential
character of the book remains the same; in other words, the entire presentation continues to be based on an axiomatic treatment of vector spaces.
In this first volume the restriction to finite dimensional vector spaces has been eliminated except for those results which do not hold in the infinite dimensional case. The restriction of the coefficient field to the real and complex numbers has also been removed and except for chapters VII to XI, § 5 of chapter I and § 8, chapter IV we allow any coefficient
field of characteristic zero. In fact, many of the theorems are valid for modules over a commutative ring. Finally, a large number of problems of different degree of difficulty has been added.
Chapter I deals with the general properties of a vector space. The topology of a real vector space of finite dimension is axiomatically characterized in an additional paragraph. In chapter lIthe sections on exact sequences, direct decompositions and duality have been greatly expanded. Oriented vector spaces have been incorporated into chapter IV and so chapter V of the second edition has disappeared. Chapter V (algebras) and VI (gradations and homology)
are completely new and introduce the reader to the basic concepts associated with these fields. The second volume will depend heavily on some of the material developed in these two chapters.
Chapters X (Inner product spaces) XI (Linear mappings of inner product spaces) XII (Symmetric bilinear functions) XIII (Quadrics) and XIV (Unitary spaces) of the second edition have been renumbered but remain otherwise essentially unchanged. Chapter XII (Polynomial algebra) is again completely new and developes all the standard material about polynomials in one indeterminate. Most of this is applied in chapter XIII (Theory of a linear transformation). This last chapter is a very much expanded version of chapter XV of the
second edition. Of particular importance is the generalization of the
Preface to the third edition
results in the second edition to vector spaces over an arbitrary coefficient field of characteristic zero. This has been accomplished without reversion
to the cumbersome calculations of the first edition. Furthermore the concept of a semisimple transformation is introduced and treated in some depth.
One additional change has been made: some of the paragraphs or sections have been starred. The rest of the book can be read without reference to this material.
Last but certainly not least, I have to express my sincerest thanks to everyone who has helped in the preparation of this edition. First of all I am particularly indebted to Mr. S. HALPERIN who made a great number of valuable suggestions for improvements. Large parts of the book, in particular chapters XII and XIII are his own work. My warm thanks also go to Mr. L. YONKER, Mr. G. PEDERZOLI and Mr. J. SCHERK who did the proofreading. Furthermore I am grateful to Mrs. V. PEDERZOLI
and to Miss M. PETTINGER for their assistance in the preparation of the
manuscript. Finally I would like to express my thanks to professor K. BLEULER for providing an agreeable milieu in which to work and to the publishers for their patience and cooperation.
Toronto, December 1966
WERNER H. GREUB
Preface to the second edition Besides the very obvious change from German to English, the second
edition of this book contains many additions as well as a great many other changes. It might even be called a new book altogether were it not
for the fact that the essential character of the book has remained the same; in other words, the entire presentation continues to be based on an axiomatic treatment of linear spaces. In this second edition, the thorough-going restriction to linear spaces of finite dimension has been removed. Another complete change is the
restriction to linear spaces with real or complex coefficients, thereby removing a number of relatively involved discussions which did not really contribute substantially to the subject. On p. 6 there is a list of those chapters in which the presentation can be transferred directly to spaces over an arbitrary coefficient field.
Chapter I deals with the general properties of a linear space. Those concepts which are only valid for finitely many dimensions are discussed in a special paragraph.
Chapter II now covers only linear transformations while the treatment of matrices has been delegated to a new chapter, chapter III. The discussion of dual spaces has been changed; dual spaces are now introduced abstractly and the connection with the space of linear functions is not established until later. Chapters IV and V, dealing with determinants and orientation respectively, do not contain substantial changes. Brief reference should
be made here to the new paragraph in chapter IV on the trace of an endomorphism — a concept which is used quite consistently throughout the book from that time on. Special emphasis is given to tensors. The original chapter on Multilinear Algebra is now spread over four chapters: Multilinear Mappings (Ch. VI), Tensor Algebra (Ch. VII), Exterior Algebra (Ch. VIII) and
Duality in Exterior Algebra (Ch. IX). The chapter on multilinear mappings consists now primarily of an introduction to the theory of the tensor-product. In chapter VII the notion of vector-valued tensors has
been introduced and used to define the contraction. Furthermore, a
XII
Preface to the second edition
treatment of the transformation of tensors under linear mappings has been added. In Chapter VIII the antisymmetry-operator is studied in greater detail and the concept of the skew-symmetric power is introduced. The dual product (Ch. IX) is generalized to mixed tensors. A special paragraph in this chapter covers the skew-symmetric powers of the unit tensor and shows their significance in the characteristic polynomial. The paragraph "Adjoint Tensors" provides a number of applications of the duality theory to certain tensors arising from an endomorphism of the underlying space.
There are no essential changes in Chapter X (Inner product spaces) except for the addition of a short new paragraph on normed linear spaces.
In the next chapter, on linear mappings of inner product spaces, the orthogonal projections 3) and the skew mappings 4) are discussed in greater detail. Furthermore, a paragraph on differentiable families of automorphisms has been added here. Chapter XII (Symmetric Bilinear Functions) contains a new paragraph dealing with Lorentz-transformations. Whereas the discussion of quadrics in the first edition was limited to quadrics with centers, the second edition covers this topic in full. The chapter on unitary spaces has been changed to include a more thorough-going presentation of unitary transformations of the complex plane and their relation to the algebra of quaternions. The restriction to linear spaces with complex or real coefficients has of course greatly simplified the construction of irreducible subspaces in chapter XV. Another essential simplification of this construction was achieved by the simultaneous consideration of the dual mapping. A final paragraph with applications to Lorentz-transformation has been added to this concluding chapter. Many other minor changes have been incorporated — not least of which are the many additional problems now accompanying each paragraph.
Last, but certainly not least, I have to express my sincerest thanks to everyone who has helped me in the preparation of this second edition. First of all, I am particularly indebted to CORNELIE J. RHEINBOLDT
who assisted in the entire translating and editing work and to Dr. WERNER C. RHEINBOLDT who cooperated in this task and who also made a number of valuable suggestions for improvements, especially in the chapters on linear transformations and matrices. My warm thanks
also go to Dr. H. BOLDER of the Royal Dutch/Shell Laboratory at Amsterdam for his criticism on the chapter on tensor-products and to Dr. H. H. KELLER who read the entire manuscript and offered many
Preface to the second edition
XIII
important suggestions. Furthermore, I am grateful to Mr. GI0RGI0 PEDERZOLI who helped to read the proofs of the entire work and who collected a number of new problems and to Mr. KHADJA NESAMUDDIN KHAN for his assistance in preparing the manuscript.
Finally I would like to express my thanks to the publishers for their patience and cooperation during the preparation of this edition. Toronto, April 1963
WERNER H. GREUB
Contents Chapter 0. Prerequisites
Chapter I. Vector spaces § 1. Vector spaces § 2. Linear mappings § 3. Subspaces and factor spaces § 4. Dimension § 5. The topology of a real finite dimensional vector space
37
Chapter II. Linear mappings § 1. Basic properties § 2. Operations with linear mappings § 3. Linear isomorphisms § 4. Direct sum of vector spaces § 5. Dual vector spaces § 6. Finite dimensional vector spaces
41 41
Chapter III. Matrices § 1. Matrices and systems of linear equations § 2. Multiplication of matrices § 3. Basis transformation § 4. Elementary transformations
83 83 89 92 95
Chapter IV. Determinants § 1. Determinant functions § 2. The determinant of a linear transformation § 3. The determinant of a matrix § 4. Dual determinant functions § 5. The adjoint matrix § 6. The characteristic polynomial §7. The trace § 8. Oriented vector spaces Chapter V. Algebras § 1. Basic properties
51
55 56
63 76
104 109 112 114 120 126 131
Change of coefficient field of a vector space
144 144 158 163
Chapter VI. Gradations and homology § 1. G-graded vector spaces § 2. G-graded algebras § 3. Differential spaces and differential algebras.
167 167 174 178
Chapter VII. Inner product spaces § 1. The inner product § 2. Orthonormal bases
186 186
§2. Ideals § 3.
191
Contents
XVI
Normed determinant functions Duality in an inner product space Normed vector spaces § 6. The algebra of quaternions Chapter VIII. Linear mappings of inner product spaces § 1. The adjoint mapping § 2. Selfadjoint mappings § 3. Orthogonal projections § 4. Skew mappings § 5. Isometric mappings
195
§ 3. § 4. § 5.
§ 6.
Rotations of Euclidean spaces of dimension 2, 3and4
§ 7.
Differentiable families of linear automorphisms.
202 205
208 216
216 221
226 229 232
237 249
Chapter IX. Symmetric bilinear functions § 1. Bilinear and quadratic functions § 2. The decomposition of E § 3. Pairs of symmetric bilinear functions § 4. Pseudo-Euclidean spaces § 5. Linear mappings of Pseudo-Euclidean spaces.
261
Chapter X. Quadrics § 1.
296 296
§
301
261 265
272
.
§
281 288
Affine spaces 2. Quadrics in the affine space 3. Affine equivalence of quadrics
§ 4.
310 316
Quadrics in the Euclidean space
Chapter XI. Unitary spaces § 1. Hermitian functions § 2. Unitary spaces § 3. Linear mappings of unitary spaces § 4. Unitary mappings of the complex plane § 5. Application to Lorentz-transformations
325 325 327 334 340
Chapter XII. Polynomial algebra . § 1. Basic properties § 2. Ideals and divisibility § 3. Factor algebras § 4. The structure of factor algebras.
351 351 357
Chapter XIII. Theory of a linear transformation § 1. Polynomials in a linear transformation § 2. § 3.
345
366 369
.
Generalized eigenspaces Cyclic spaces
.
383 390
397
§ 4. Irreducible spaces
402
Application of cyclic spaces Nilpotent and semisimple transformations 7. Applications to inner product spaces .
§ 5.
§ 6. §
383
.
.
415 425 436
Bibliography
445
Subject Index
447
Interdependence of Chapters Vector spaces F
Linear mappings J
Matrices
Determinants
Inner product spaces
Gradations and homology
Linear mappings of inner product spaces
Symmetric bilinear functions
r
Unitary spaces
Algebras
Polynomial algebra
Quadrics
Theory of a linear transformation
Chapter 0
Prerequisites 0.1. Sets. The reader is expected to be familiar with naive set theory
up to the level of the first half of [11]. In general we shall adopt the notations and definitions of that book; however, we make two exceptions. First, the word function will in this book have a very restricted meaning, and what Halmos calls a function, we shall call a mapping or a set mapping. Second, we follow Bourbaki and call mappings that are one-to-one (onto, one-to-one and onto) injective (surjective, bijective). 0.2. Topology. Except for § 5 chap. I, § 8, Chap. IV and parts of chapters VII to IX we make no use at all of topology. For these parts of the book the reader should be familiar with elementary point set topology as found in the first part of [16]. 0.3. Groups. A group is a set G, together with a binary law of composition x G—+G which satisfies the following axioms (x, y) will be denoted by xy): 1. Associativity: (xy)z = x (yz) 2. Identity: There exists an element e, called the identity such that
xe = ex = x. 3. To each element xeG corresponds a second element
xx' =
such that
= e.
The identity element of a group is uniquely determined and each element has a unique inverse. We also have the relation
(xy)' As an example consider the set of all permutations of the set { 1. n} and define the product of two permutations a, t by . .
(crt)i=a(ti) In this way
i=1...n.
becomes a group, called the group of permutations of n objects. The identity element of is the identity permutation.
I
Greub. linear Algebra
Chapter 0. Prerequisites
Let G and H be two groups. Then a mapping G —*
H
is called a homomorphism if
X,yEG.
=
A homomorphism which is injective (resp. surjective, bijective) is called a monomorphism (resp. epimorphism, isomorphism). The inverse mapping of an isomorphism is clearly again an isomorphism. A subgroup H of a group G is a subset H such that with any two elementsyeHand zeH the productyz is contained in Hand that the inverse of every element of H is again in H. Then the restriction of p to the subset Hx H makes H into a group. A group G is called commutative or abelian if for each x, yeG xy=yx.
In an abelian group one often writes x+y instead of xy and calls x+y the sum of x and y. Then the unit element is denoted by 0. As an example consider the set of integers and define addition in the usual way. 0.4. Factor groups of commutative groups.* Let G be a commutative
group and consider a subgroup H. Then H determines an equivalence relation in G given by x
x'
if and only if
x—
x' e H.
The corresponding equivalence classes are the sets {H+x} and are called the cosets of H in G. Every element xeG is contained in precisely one coset ?. The set G/H of these cosets is called the factor set of G by H and the surjective mapping G
G/H
defined by XEX
called the canonical projection of G onto G/H. The set G/H can be made into a group in precisely one way such that the canonical projection becomes a homomorphism; i.e., is
it(x + y) = irx + 7ry. To define the addition in G/H let
e G/H, 9 e G/H be arbitrary and choose
xeG and yeG such that and
my=9.
*) This concept can be generalized to non-commutative groups.
Chapter 0. Prerequisites
Then the element it (x +y) depends only on
two other elements satisfying whence
3
and 9. In
and icy' =9
we
fact, if x', y' are
have
x'—xeH and y'—yeH (x' + y') — (x
+ y)eH
and so ir(x'+y')—ic(x+y). Hence, it makes sense to define the sum by
is easy to verify that the above sum satisfies the group axioms. Relation (0.1) is an immediate consequence of the definition of the sum in G/H. Finally, since it is a surjective map, the addition in G/H is uniquely deterIt
mined by (0.1). The group G/H is called the factor group of G with respect to the subgroup H. Its unit element is the set H. 0.5. Fields. Afield is a set F on which two binary laws of composition, called respectively addition and multiplication, are defined such that 1. F is a commutative group with respect to the addition. 2. The set F — {0} is a commutative group with respect to the multiplication.
3. Addition and multiplication are connected by the distributive
law,
The rational numbers the real numbers 11 and the complex numbers C are fields with respect to the usual operations, as will be assumed without proof. A homomorphism p:F—÷F' between two fields is a mapping that preserves addition and multiplication. A subset A F of a field which is closed under addition, multiplication and the taking of inverses is called a subfield. If A is a subfield of F, F is called an extension field of A. Given a field F we define for every positive integer k the element ke (c unit element of F) by
The field F is said to have characteristic zero if ke + 0 for every positive integer k. If F has characteristic zero it follows that kc+k'c whenever k+k'. Hence, a field of characteristic zero is an infinite set. Throughout this book it will be assumed without explicit mention that all fields are of characteristic zero.
Chapter 0. Prerequisites
4
For more details on groups and fields the reader is referred to [29]. 0.6. Partial order. Let cl be a set and assume that for some pairs X. Y (XE.ci. YE.cl) a relation, denoted by X Y, is defined which satisfies the following conditions: (i) XX for every Xe.cl (Reflexivity) (ii) if X Y and Y X then X = Y (Antisymmetry) (iii) If X Y and Y Z, then X Z (Transitivity). Then is called a partial order in d.
A homomorphism of partial/v ordered sets is a map go:
such
that goX go Y whenever X Y
Clearly a subset of a partially ordered set is again partially ordered.
Let d be a partially ordered set and suppose A Ed is an element such that the relation A X implies that A = X. Then A is called a maximal element of ci. A partial ordered set need not have a maximal element. A partially ordered set is called linear/v ordered or a chain if for every
pairX, YeitherXYor be a subset of the partially ordered set ci. Then an element if X A for every XEc11. A ed is called an upper hound for In this book we shall assume the following axiom: A partially ordered set in which every chain has an upper bound, contains a maximal element. This axiom is known as Zorn's lemma, and is equivalent to the axiom Let
of choice (cf. [11]).
d be a 0.7. Lattices. Let d be a partially ordered set and let subset. An element Aed is called a least upper hound (l.u.b.) for d1 if 1) A is an upper bound for cl1. 2) If X is any upper bound, then A X. It follows from (ii) that if a l.u.b. for d1 exists, then it is unique. In a similar way, lower bounds and the greatest lower bound (g.1.b.) for a subset of d are defined. A partially ordered set ci is called a lattice, if for any two elements X, Y the subset {X, Y} has a 1.u.b. and a g.l.b. They are denoted by X v Y and X A Y. It is easily checked that any finite subset (X1, ..., Xr) of a lattice
has a 1.u.b. and a g.l.b. They are denoted by V
and A X,.
As an example of a lattice, consider the collection of subsets of a given set, X, ordered by inclusion. If U, V are any two subsets, then
UAV=UflV and UvV=UUV.
Chapter 1
Vector Spaces § 1.
Vector spaces
1.1. Definition. A vector (linear) space, E, over the field F is a set of elements x, y, ... called vectors with the following algebraic structure:
I. E is an additive group; that is, there is a fixed mapping Ex E—+E denoted by (1.1)
and satisfying the following axioms: 1.1. (x +y) +z = x + (y + z) (associative law)
1.2. x+y=y+x (commutative law) 1.3. there exists a zero-vector 0; i.e., a vector such that x+0= O+x=x for every xeE. 1.4. To every vector x there is a vector —x such that x+(—x)=O.
II. There is a fixed mapping F x
denoted by
(2,x)—÷Ax
(1.2)
and satisfying the axioms: 11.1. (associative law) 11.2.
A(x + y) = Ax + Ay (distributive laws) 11.3.
unit element of F)
(The reader should note that in the left hand side of the first distributive law, + denotes the addition in F while in the right hand side, + denotes the addition in E. In the sequel, the name addition and the symbol + will continue to be used for both operations, but it will always be clear from the context which one is meant). F is called the coefficient field of the vector space E, and the elements of F are called scalars. Thus the mapping
Chapter 1. Vector spaces
(1.2) defines a multiplication of vectors by scalars, and so it is called scalar multiplication.
If the coefficient field 1' is the field l1 of real numbers (the field C of complex numbers), then £ is called a real (complex) vector space. For the rest of this paragraph all vector spaces are defined over a fixed, but arbitrarily chosen field F of characteristic 0. If {x1 ,...,x,1} is a finite family of vectors in E, the sum x1 + will often be denoted
Now we shall establish some elementary properties of vector spaces. It follows from an easy induction argument on a that the distributive laws hold for any finite number of terms,
A) x .
Ax
holds if and only if
=
=
0
2=0 or x=0.
Proof Substitution of pc=O in the first distributive law yields Ax = Ax + Ox
whence Ox =0. Similarly, the second distributive law shows that
20 = 0. Conversely, suppose that Ax=O and assume that 2+0. Then the associative law 11.1 gives that
lx = (A1A)x = A1(Ax) = Ab0 = 0 and hence axiom 11.3 implies that x=O. The first distributive law gives for Ax + (— A)x =
(A
—
—A
A)x =
whence (— A)
x = — Ax.
0
§ 1. Vector spaces
In the same way the formula 2(— x) = — 2x is
proved.
1.2. Examples. 1. Consider the set F "=
of n-tuples
and define addition and scalar multiplication by I
+
1
+
=
1,
+
and
Then the associativity and commutativity of addition follows at once from the associativity and commutativity of addition in F. The zero vector is the n-tuple (0, ..., 0) and the inverse of is the n-tuple ..., Consequently, addition as defined above makes the set ..., F" into an additive group. The scalar multiplication satisfies I1.i, 11.2, and 11.3, as is equally easily checked, and so these two operations make F" into a vector space. This vector space is called the n-space over F. In particular, F is a vector space over itself in which scalar multiplication coincides with the field multiplication.
2. Let C be the set of all continuous real-valued functions, f, in the
interval I:Ot 1, R.
1ff, g are two continuous functions, then the function f+g defined by (1 + g) (t) is
= f (t) + g (t)
again continuous. Moreover, for any real number 2, the function 2f
defined by
(1f)(t) = 2.1(t) is
continuous as well. It is clear that the mappings (1' g) —p
f +g
and
(2,1)
2]
the systems of axioms 1. and 11. and so C becomes a real vector space. The zero vector is the function 0 defined by satisfy
0(t) =
0
Chapter 1. Vector spaces
and the vector —f is the function given by
(- f)(t) = - f(t). Instead of the continuous functions we could equally well have considered the set of k-times differentiable functions, or the set of analytic functions.
3. Let X be an arbitrary set and E be a vector space. Consider all and define the sum of two mappings f and g as the xeX (f + g)(x) = f(x) + g(x) and the mapping )f by
mappings J: mapping
(i.[)(x) =
XEX.
Under these operations the set of all mappings f:
becomes a vector space, which will be denoted by (X; E). The zero vector of (X; E) is the function f defined by f(x)=0, XEX. 1.3. Linear combinations. Suppose E is a vector space and x1 are vectors in E. Then a vector XEE is called a linear combination of the vectors x1 if it can be written in the form x=
be any family of vectors. Then a vector More generally, let if there is a family xEE is called a linear combination of the vectors only finitely many different from zero, such that of scalars, x= where the summation is extended over those We shall simply write =
for which
cLEA
and it is to be understood that only finitely many are different from zero. In particular, by setting =0 for each we obtain that the 0-vector is a linear combination of every family. It is clear from the definition that if x is a linear combination of the family {xj then x is a linear combination of a finite subfamily. Suppose now that x is a linear combination of vectors cteA
x= rzeA
and assume further that each x2 is a linear combination of vectors
§ 1. Vector spaces
9
JJeB2,
=
e F. p
Then the second distributive law yields X
=
x2
r
=
Yap'
=
hence x is a linear combination of the vectors A subset ScEis called a system of generators for Eif every vector xeE is a linear combination of vectors of S. The whole space E is clearly a system of generators. Now suppose that S is a system of generators for E and that every vector of S is a linear combination of vectors of a subset Tc: S. Then it follows from the above discussion that T is also a system of generators for E. 1.4. Linear dependence. Let be a given family of vectors. Then a non-trivial linear combination of the vectors is a linear combination where at least one scalar is different from zero. The family {xa} and
is called linearly dependent if there exists a non-trivial linear combination of the that is, if there exists a system of scalars such that (1.3)
and at least one + 0. It follows from the above definition that if a subfamily of the family is linearly dependent, then so is the full family. An equation of the form (1.3) is called a non-trivial linear relation. A family consisting of one vector x is linearly dependent if and only if x 0. In fact, the relation
1.0=0 that the zero vector is linearly dependent. Conversely, if the vector x is linearly dependent we have that 2x=O where 2+0. Then Proposition I implies that x=0. It follows from the above remarks that every family containing the zero vector is linearly dependent. shows
is linearly dependent if and Proposition II: A family of vectors is a linear combination of the vectors x2, cx+fl. only if for some fleA, Proof: Suppose that for some fleA, xp
Chapter 1. Vector spaces
10
Then setting
—1
we obtain
=
o
and hence the vectors x2 are linearly dependent.
Conversely, assume that
=
0
and that
for some fleA. Then multiplying by view of II.! and 11.2 0= +
we obtain in
2*/i
()ji)_l)2x
xp=— a*f1
Corollary: Two vectors x, y are linearly dependent if and only ify=Ax (or x==)Ly) for some AcT. 1.5. Linear independence. A family of vectors (x2)26A is called linearly
independent if it is not linearly dependent; i.e., the vectors x2 are linearly independent if and only if the equation
= implies that A2=O for each
0
It is clear that every subfamily of a line-
arly independent family of vectors is again linearly independent. If flEA,
is a linearly independent family, then for any two distinct indices is injective. and so the map
Proposition III: A family (x2)2EA of vectors is linearly independent if and only if every vector x can be written in at most one way as a linear combination of the x2 i.e., if and only if for each linear combination
X>22X2
(1.4)
the scalars A2 are uniquely determined by x. Proof. Suppose first that the scalars A2 in (1.4) are uniquely determined by x. Then in particular for x=0, the only scalars A2 such that =0
are the scalars A2=O. Hence, the vectors x2 are linearly independent. Con-
§ 1. Vector spaces
versely,
suppose that the
11
are linearly independent and consider the
relations Then
=0
—
whence in view of the linear independence of the i.e., 1.6. Basis. A family of vectors
in E is called a basis of E if it is simultaneously a system of generators and linearly independent. In view of Proposition III and the definition of a system of generators, we have that A is a basis if and only if every vector xeE can be written in precisely one way as
The scalars
are called the components of x with respect to the basis
As an example, consider the n-space, ['fl, over F defined in example 1, sec. 1.2. It is easily verified that the vectors
i=1...n
x1=(O,...,O,l,O...O)
form a basis for F". We shall prove that every non-trivial vector space has a basis. For
the sake of simplicity we consider first vector spaces which admit a finite system of generators. Proposition IV: (i) Every finitely generated non-trivial vector space has a finite basis (ii) Suppose that S=(x1 ,...,Xm) is a finite system of generators of E and that the subset R c S given by R = (x1 Xr) (r m) consists of
linearly independent vectors. Then there is a basis,
of E such that
RcTcS. Proof: (i) Let x1 the vectors x1
x,, be a minimal system of generators of E. Then are linearly independent. In fact, assume a relation
=
0.
Chapter I. Vector spaces
12
If
= 0 for some 1, it follows that
;eT and so the vectors
(1.5)
generate E. This contradicts the minimality
of ii. (ii) We proceed by induction on ,i
(nr). If n=r then there is nothing to prove. Assume now that the assertion is correct for ii — I. Consider the vector space, F, generated by the vectors x1 Xr+i Then by induction, F has a basis of the form X1
Xr,
where V1ES
Ys
1
(j = 1
Now consider the vector x,1. If the vectors x1
). 1
x, are
linearly independent, then they form a basis of E which has the desired property. Otherwise there is a non-trivial relation
= 0.
+ Since the vectors x1
are
that y+O. Thus
linearly independent, it follows
r
x,7= Q=l
71 generate E. Since they are linearly
Hence the vectors x1
independent, they form a basis. Now consider the general case. Theorem I: Let E be a non-trivial vector space. Suppose S is a system
of generators and that R is a family of linearly independent vectors in E such that R S. Then there exists a basis, of E such that R S. Proof Consider the collection .W(R, S) of all subsets, X, of E such that
1) RcXcS 2) the vectors of X are linearly independent. The a partial order is defined in d(R, 5) by inclusion (cf. sec. 0.6). We show that every chain, in .&(R, 5) has a maximal element A. In fact, R
A
set A =
We
have to show that A ed(R, S). Clearly,
S. Now assume that x5,eA.
(1.6)
§ 1. Vector spaces
Then, for each assume that
i,
for some
is a chain, we may
Since
(i=1...n).
(1.7)
are linearly independent it follows that Since the vectors of (v = ... n) whence A ed(R, S). Now Zorn's lemma (cf. sec. 0.6) implies that there is a maximal element, L in d(R, S). Then R c: Tc:S and the vectors of Tare linearly 1
independent. To show that T is a system of generators, let xeE be arbitrary. Then the vectors of T U x are linearly dependent because otherwise it would follow that x U Ted(R, S) which contradicts the maximality of T Hence there is a non-trivial relation ,tVET, Since
the vectors of T are linearly independent, it follows that
whence
xv.
This equation shows that T generates E and so it is a basis of E.
Corollary I: Every system of generators of E contains a basis. In particular, every non-trivial vector space has a basis.
Corollary II: Every family of linearly independent vectors of E can be extended to a basis. 1.7. The free vector space over a set. Let X be an arbitrary set and such that f(x)+0 only for finitely many XEX. consider all maps f:
Denote the set of these maps by C(X). Then, if fe C(X), ge C(X) are scalars, 2f+ is again contained in C(X). As in example 3, sec. 1.2, we make C(X) into a vector space. For any aeX denote by the map given by and ).,
x=a
51
Then the vectors (aEX) form a basis of C(X). In fact, let fe C(X) be the (finitely many) distinct points be given and let a1 a, such that [(a) 0. Then we have
f where
= [(a)
i=1
(1 =
1
n)
Chapter I. Vector spaces
14
and so the element a relation
(aEX) generate C(X). On the other hand, assume
= 0. j=1
Then we have for each 1(1= ... ii) 1
0
1
=
... a). This shows that the vectors
(aeX) are
linearly independent and hence they form a basis of C(X). Now consider the inclusion map X—*C(X) given by
ix(a)=Ja
aEX.
This map clearly defines a bijection between X and the basis vectors
of C(X). If we identify each element aeX with the corresponding map then X becomes a basis of C(X). C(X) is called the free vector space over X or the vector space generated by X.
Problems 1. Show that axiom 11.3 can be replaced by the following one: The equation 2x=O holds only if 2=0 or x=0. 2. Given a system of linearly independent vectors (x1, ..., xe,), prove that the system (x1, .. i4j with arbitrary 2 is again linearly independent. 3. Show that the set of all solutions of the homogeneous linear differential equation d2y dt2
+
dy + qy = 0 dt
p and q are fixed functions of t, is a vector space. 4. Which of the following sets of functions are linearly dependent in the vector space of Example 2? where
a)f1=3t; f2=t+5; f3=2t2; b)f1=(t+1)2;f2=t2—1; f3=2t2+2t—3 f2=et; f3=e_t c) f1=1; d)f1=t2; e)
f1=1—t;
f2=t;
f3=1
f2=t(1—t); f3=1—t2.
§ 1. Vector spaces
5. Let E be a real linear space. Consider the set E x E of ordered pairs
(x, y) with xeE and yeE. Show that the set Ex E becomes a complex vector space under the operations: (x1,y1) + (x2,y2) =
(x1
+ x2,y1 + Y2)
and + i fJ)(x, y) =
x—
,8
y, y + J3 x)
/3 real numbers).
6. Which of the following sets of vectors in (a generating set, a basis)?
linearly independent,
a) (1, 1, 1, 1), (1, 0, 0, 0), (0, 1, 0, 0), (0, 0, 1, 0), (0, 0, 0, 1) b) (1, 0, 0, 0), (2, 0, 0, 0) c) (17, 39, 25, 10), (13, 12, 99, 4), (16, 1,0,0) 0, 0, d) (1, 1, 0, 0), (0, 0, 1, 1), (0, 4, 4, 1),
Extend the linearly independent sets to bases. 7. Are the vectors x1 (1, 0, 1); x2 = (i, 1, 0), x3 = (1, 2, 1 +1) linearly independent in C3? Express x = (1, 2, 3) and y = (1, 1, 1) as linear combibinations of x1, x2, x3. is defined by a map 8. Recall that an n-tuple given by
(i=1...n). Show that the vector spaces C{l...n} and F" are equal. Show further that the basis J defined in sec. 1.7 coincides with the basis x defined in sec. 1 .6.
9. Let S be any set and consider the set of maps
f: S
F"
such thatf(x)=0 for all but finitely many xeS. in a manner similar to that of sec. 1.7, make this set into a vector space (denoted by C(S, F')). Construct a basis for this vector space. be a basis for a vector space E and consider a vector 10. Let
a= that for some fleA. again a basis for E. Suppose
Show that the vectors
form
Chapter I. Vector spaces
11. Prove the following exchange theorem of Steinitz: Let be a a system of linearly independent vectors. basis of E and Then it is possible to exchange certain p of the vectors by the vectors a such that the new system is again a basis of F. Hint: Use problem 10. 12. Consider the set of polynomial functionsf:
f (x) =
xi.
Make this set into a vector space as in Example 3, and construct a natural basis. § 2.
Linear mappings
In this paragraph, all vector spaces are defined over a fixed but arbitrarily chosen field F of characteristic zero.
1.8. Definition. Suppose that E and F are vector spaces, and let (p:
be a set mapping. Then 'p will be called a linear mapping if
'p(x+y)='px+'py x,yeE
(1.8)
and
)LEF,xEE
= 2çox
(1.9)
(Recall that condition (1.8) states that 'p is a homomorphism between abelian groups). If F=F then 'p is called a linear function in E. Conditions (1.8) and (1.9) are clearly equivalent to the condition =
'p
'p
and so a linear mapping is a mapping which preserves linear combinations. From (1.8) we obtain that for every linear mapping, 'p, 'p 0
whence 'p (0)
=
'p (0
+0) =
'p (0)
+ 'p (0)
0. Suppose now that
=0 is a linear relation among the vectors 'p x1
=
'p
)!
Then we have
=
'p0
=0
§ 2. Linear mappings
whence
= 0.
17
(1.11)
Conversely, assume that ço:E—*F is a set map such that (1.11) holds whenever (1.10) holds. Then for any x, yeE and )LEF set
u=x+y and v=2x. Since
u—x—y=0 and v—2x=0
it follows that x
(x + y) —
—
y= 0
and ç (2 x) —2 (p x =
0
and hence p is a linear mapping. This shows that linear mappings are precisely the set mappings which preserve linear relations. In particular, it follows that if x1 . ..v,. are linearly dependent, then so If X1 .• . are linearly independent, it does not, are the vectors çox1 however, follow that the vectors cOXi...cOXr are linearly independent. In fact, the zero mapping defined by (px=0,xEE,is clearly a linear mapping which maps every family of vectors into the linearly dependent set (0). A bijective linear mapping (p: E3F is called a linear isomorphism and will be denoted by p: Given a linear isomorphism (p: the set mapping (p 1: E+—F. It is easy to verify that p again satisfies the .
. . .
conditions (1.8) and (1.9) and so it is a linear mapping. p' is bijective and hence a linear isomorphism. It is called the inverse isomorphism of (p. Two vector spaces E and F are called isomorphic if there exists a linear
isomorphism from E onto F. is called a linear transformation of E. A A linear mapping (p bijective linear transformation will be called a linear automorphism of E. 1.9. Examples: 1. Let E=F" and define (p:E—+E by =
+
satisfies the conditions (1.8) and (1.9) and hence it is a linear transformation of E. 2. Given a set S and a vector space E consider the vector space (S; E) be the mapping given by defined in Example 3, sec. 1.2. Let (S;
Then
(pf=f(a) fe(S;E) where aES is a fixed element. Then (p is 2
Greub. Linear Atgebra
a linear mapping.
Chapter
18
1.
Vector spaces
where )LeT is a be the mapping defined by 3. Let fixed element. Then p is a linear transformation. In particular, the ideaWv map i:E—+E, ix=x, is a linear transformation. 1.10. Composition. Let p: E—*F and i/i: F—*G be two linear mappings. Then the composition of ço and /i0ço:E—*G
is defined by XEE. The relation
x) =
(/9
ço x1)
k/i
= p is a linear mapping of E into G. k/Jo p will often be denoted simply by k/1p. If p is a linear transformation in E, then we denote (/9 o (p by (p2. More generally, the linear transformation p ... p is denoted by
shows that k/Jo
i. A linear transformation, p, satisfying (p2 = i is called an involution in E. 1.11. Generators and basis. S—*F Proposition I: Suppose S is a system of generators for E and is a set map (Fa second vector space). Then Po can be extended in at most one way to a linear mapping We extend the definition to the case k=O by setting (p°=
F.
(p: E
A necessary and sufficient condition for the existence of such an extension is that 0
whenever
= 0.
Proof If (p X1
is
an extension of
we
have for each finite set of vectors
ES
=
=
Since the set S generates E it follows from this relation that is (/9 uniquely determined by (po Moreover, if
XES
§ 2. Linear mappings
it follows that =
=
=
cOO
=
0
and so condition (1.12) is necessary. Conversely, assume that (1.12) is satisfied. Then define
by (1.13)
To prove that
is
a well defined map assume that
Then =o
—
whence in view of (1.12)
0
—
and so
= The linearity of p follows immediately from the definition, and it is clear that p extends cOo.
Proposition II: Let be a basis of E and cOo: be a set can be extended in a unique way to a linear mapping map. Then (p:
F.
Proof. The uniqueness follows from proposition I. To prove the existence of p consider a relation = 0. Since the vectors
are linearly independent it follows that each
whence
= 0.
Now proposition I shows that
can be extended to a linear mapping
Corollary: Let S be a linearly independent subset of E and be a set map. Then cOo can be extended to a linear mapping
Chapter I. Vector spaces
20
Proof. Let T be a basis of F containing S (cf. sec. 1.6). Extend c°o in an T—+F. Then k/I0 may be extended to a linear arbitrary way to a set map mapping t/i:E—+F and it is clear that k/i extends
Now let be a surjective linear map, and suppose that S is a system of generators for E. Then the set = is a system of generators for F. In fact, since çü is surjective, every vector yEF can be written as = x
for some xeE. Since S generates E there are vectors such that x=
and scalars
whence
y=
=
This shows that every vector yEF is a linear combination of vectors in
'p (5) and hence 'p (5) is a system of generators for(5). 'p Next, suppose that p: E—÷ F is injective and that S is a linearly independent subset of E. Then 'p (5) is a linearly independent subset of F. in
fact the relation implies that
Since 'p
is
= 0,
= 0.
injective we obtain
=
0
whence, in view of the linear independence of the vectors 'p (5) is a linearly independent set. In particular, if çø: E—+F is a linear isomorphism and for E, then is a basis for F.
A! =0. Hence
is a basis
Proposition III: Let ço:E—+Fbe a linear mapping and be a basis of E. Then 'p is a linear isomorphism if and only if the vectors = form a basis for F. Proof. If 'p is a linear isomorphism then the vectors form a linearly independent system of generators for F. Hence they are a basis. Converse-
§ 2. Linear mappings
ly, assume that the vectors
21
form a basis of F. Then we have for every
yEF y= and so
is
=
surjective.
Now assume that jf Xci.
Then it follows that o=
—
= Since the vectors each and so
—
are linearly independent, we obtain that
for
1?
It follows that 'p is injective, and hence a linear isomorphism.
Problems 1. Consider the vector space of all real valued continuous functions defined in the interval a t b. Show that the mapping 'p given by (p:X(t)—* is
tX(t)
linear.
2. Which of the following mappings of F4 into itself are linear transformations?
-
a) b)
+
c)
+
+
Let E be a vector space over F, and letf1 . given by E. Show that the mapping p: 3.
.
be linear functions in
= (ft(x), ...,fr(X)) is
linear.
4. Suppose
is a linear map, and write 'p x = (f1 (x), .. , fr (x)).
Show
that the
are linear functions in E.
Chapter I. Vector spaces
22
5. The unirersal property of C(X). Let X be any set and consider the free vector space, C(X). generated by X (cf. sec. 1 .7).
(i) Show that if j: then there is a unique linear map p:
X into a vector space F such that (p0
where X—*C(X) is the inclusion map. (ii) Let Y be a set map. Show that there is a unique linear C(X)—*C(Y) such that the diagram map
tX1.
C(X)f'4 C(Y)
is a second set map prove the composition
commutes. If [3: formula
(fib
=
(iii) Let E be a vector space. Forget the linear structure of E and form
the space C(E). Show that there is a unique linear map mE:
C(E)—÷E
such that mE ° 1E
(iv) Let E and F be vector spaces and let E—*F be a map between the underlying sets. Show that is a linear map if and only if ltFO(p*_ (POThE (v) Denote by N(E) the subspace of C(E) generated by the elements of the form a, beE, /IEF — (cf.
part (iii)). Show that
kermE = N(E).
6.Let v=O
be a fixed polynomial and letf be any linear function in a vector space E. Define a function P(f): E-÷F by
P(f)x =
(x)".
Find necessary and sufficient conditions on P that P(f) function. § 3.
be
again a linear
Subspaces and factor spaces
In this paragraph, all vector spaces are defined over a fixed, but arbitrarily chosen field F of characteristic 0.
§ 3. Subspaces
and factor spaces
23
1.12. Subspaces. Let E be a vector space over the field F. A non-empty subset, E1, of E is called a subspace if for each x, yEE1 and every scalar
x+yEE1
(1.14)
and
Equivalently, a subspace is a subset of E such that Ax + /IyEE1
whenever x, yeE1. In particular, the whole space E and the subset (0) consisting of the zero vector only are subspaces. Every subspace E1 E contains the zero vector. In fact, if x1 e E1 is an arbitrary vector we have that 0= x1 — x1 E E1. A subspace E1 of E inherits the structure of a vector space from E. Now consider the injective map i: E1 —* E defined by
ix=x,
xeE1.
In view of the definition of the linear operations in E1 i is a linear mapping, called the canonical injection of E1 into E. Since i is injective it follows from (sec. 1.11) that a family of vectors in E1 is linearly independent (dependent) if and only if it is linearly independent (dependent) in E. Next let S be any non-empty subset of E and denote by E5 the set of linear combinations of vectors in S. Then any linear combination of vecis a linear combination of vectors in S (cf. sec. 1.3) and hence tors in Thus is a subspace of E, called the subspace generated it belongs to by 5, or the linear closure of S. In particular, if the set S is Clearly, S is a system of generators for linearly independent, then S is a basis of We notice that = S if and only if S is a subspace itself. 1.13. Intersections and sums. Let E1 and E2 be subspaces of E and consider the intersection E1 n E2 of the sets E1 and E2. Then E1 fl E2 is again a subspace of E. In fact, since OeE1 and OeE2 we have OEE1 fl E2 and so E1 fl E2 is not empty. Moreover, it is clear that the set E1 n E2 satisfies again conditions (1.14) and (1.15) and so it is a subspace of E. E1 n E2 is called the intersection of the subspaces E1 and E2. Clearly, E1 fl E2 is a subspace of E1 and a subspace of E2. The sum of two subspaces E1 and E2 is defined as the set of all vectors of the form x1eE1,x2EE2 (1.16) x=x1 +x2,
Chapter 1. Vector spaces
24
and is denoted by E1 +122. Again it is easy to verify that E1 +E2 is a subspace of E. Clearly E1 + E2 contains E1 and E2 as subspaces. A vector x of E1 + E2 can generally be written in several ways in the form (1.16). Given two such decompositions
x=x1+x2 and it follows that x1
—
=
x'2 —
x2.
Hence, the vector z = x1
—
fl E2. Conversely, let x=x1 +x2, x1 eE1, x2eE2 be a decomposition of x and z be an arbitrary vector of E1 fl E2. Then the vectors
is contained in the intersection
=
— zEE1
=
and
x2
+ zEE2
form again a decomposition of x. It follows from this remark that the decomposition (1.16) of a vector xeE1 +E2 is uniquely determined if and only if E1 n E2 0. In this case E1 + E2 is called the (internal) direct sum of E1 and 122 and is denoted by Now let S1 and be systems of generators for E1 and E2. Then clearly is a system of generators for E1 +E2. If T1 and T2 are respectively S1 U
bases for E1 and E2 and the sum is direct, E1 fl 122=0, then T1 U T2 is a To prove that the set T1 U T2 is linearly independent, basis for suppose that = 0, + Then
=
=
fl
—
0
whence and
Now the x1 are linearly independent, and so )J=O. Similarly it follows
that Suppose that
E=E1$E2
(1.17)
is a decomposition of E as a direct sum of subspaces and let F be an arbitrary subspace of E. Then it is not in general true that
F=F
n E1
Fn
E2
§ 3. Subspaces
and factor spaces
the example below will show. However, if E1 In fact, it is clear that
as
25
then (1.18) holds. (1.19)
On the other hand, it'
y=x1 +x2
x1eE1,x2eE2
is the decomposition of any vector yEF, then
x1eE1=Ffl E1, x2=y—x1eFfl E2. It
follows that
FcFfl
E2.
(1.20)
The relations (1.19) and (1.20) imply (1.18). Example 1: Let E be a vector space with a basis e1, e2. Define E1, E2 and F as the subspaces generated by e1, e2 and e1 + e2 respectively. Then
E =E1 while on the other hand
Fn
E1
=F
n E2
= 0.
Hence
F+Fn
E2.
1.14. Arbitrary families of subspaces. Next consider an arbitrary family of subspaces E, Then the intersection flEa is again a subspace of E. The sum EE1 is defined as the set of all vectors which can be written as finite sums,
(1.21)
and is a subspace of E as well. If for every
then each vector of the sum
can be uniquely represented in the form
(1.21). In this case the space
is called the (internal) direct sum of the
and is denoted by
subspaces
If
is a system of generators for
then the set
If the sum of the
is direct and
generators for then
is a basis for
is a system of
is a basis of
Chapter 1. Vector spaces
26
Example 2. Let by Then
be a basis of E and E2 be the subspace generated
E= Suppose (1.22)
is a direct sum of subspaces. Then we have the canonical injections We define the canonical projections
determined by
= where
It is clear that the are surjective linear mappings. Moreover, it is easily verified that the following relations hold: c'
XEE.
1.15. Complementary subspaces. An important property of vector spaces is given in the
Proposition I: If E1 is a subspace of E, then there exists a second subspace E2 such that E = E1 E2. E2 is called a complementary subspace for E1 in E. Proof We may assume that E1 E and E1 (0) since the proposition is trivial in these cases. Let (xx) be a basis of E1 and extend it with vectors to form a basis of E (cf. Corollary TI to Theorem I, sec. 1.6). Let E2 Then be the subspace of E generated by the vectors
E=
E1
E2.
In fact, since (xx) U (yp) is a system of generators for E, we have that
E=E1+E2.
(1.23)
On the other hand, if XEE1 fl E2, then we may write
x=
x=
Yfi II
and factor spaces
§ 3. Subspaces
27
whence
= 0.
— 13
Now since the set (x2) U
(y13) is
linearly independent, we obtain and
whence x=0. It follows that E1 fl E2=O and so the decomposition (1.23) is direct. As an immediate consequence of the proposition we have Corollary I. Let E1 be a subspace of E and : E1 —* F a linear mapping (Fa second vector space). Then ço1 may be extended (in several ways) to a linear map (p: E—*F.
Proof Let E2 be a complementary subspace for E1 in E,
E=E1Ej3E2
(1.24)
and define p by çox =
where
x—y+z is the decomposition of x determined by (1.24). Then 'p
=
+
'p
=
+
=
= and so q, is linear. It is trivial that 'p extends 'pr.
As a special example we have:
Corollary II: Let E1 be a subspace of E. Then there exists a surjective linear map —*
E1
such that
çox=x
xEE1.
Chapter I. Vector spaces
28
Proof Simply extend the identity map i : E1 —÷E1 to a linear map (p:E-*E1. 1.16.
Factor spaces. Suppose E1 is a subspace of the vector space E.
Two vectors XE E and x' e E are called equivalent mod E1 if x' — XE E1. it
is easy to verify that this relation is reflexive, symmetric and transitive and hence is indeed an equivalence relation. (The equivalence classes are the cosets of the additive subgroup E1 in E(cf. sec. 0.4)). Let E/E1 denote the set of the equivalence classes so obtained and let be
the set mapping given by
7rXX, where
XEE
is the equivalence class containing x. Clearly m is a surjective
map.
Proposition II: There exists precisely one linear structure in E/E1 such that m is a linear mapping. Proof: Assume that E/E1 is made into a vector space such that m is a linear mapping. Then the equations
m(x + y) =
mx
+ my
and m (2 x) =
2
mx
show that the linear operations in E/E1 are uniquely determined by the linear operations in E. it remains to be shown that a linear structure can be defined in E/E1 such that m becomes a linear mapping. Let i and 9 be two arbitrary elements of E/E1 and choose vectors XEE and yEE such that
my=9. Then the class m (x + y) depends only on
and 9. Assume for instance that
x'EE is another vector such that mx'=i. Then mx' = mx and hence we may write
x'=x+z,
zEE1.
it follows that
x' + y = (x + y) + z whence
m(x' + y)= m(x + y).
§ 3. Subspaces and factor spaces
We now define the sum of the elements where
29
and 9eE/E1 by
and 9=7ry.
(1.25)
It is easy to verify that E/E1 becomes an abelian group under this operation and that the class = E1 is the zero-element. Now let be an arbitrary element and 2eF be a scalar. Choose xeE such that Then a similar argument shows that the class ir(Ax) depends only on (and not on the choice of the vector x). We now define the scalar multiplication in E/E1 by where
(1.26)
Again it is easy to verify that the multiplication satisfies axioms 11.1—11.3
and so E/E1 is made into a vector space. It follows immediately from (1.25) and (1.26) that
ir(x+y)=itx+iry
x,yeE
= 2itx i.e., iv is a linear mapping.
The vector space E/E1 obtained in this way is called the factor space of E with respect to the subspace E1. The linear mapping iv is called the canonical projection of E onto E1. If E1 = E, then the factor space reduces to the vector 0. On the other hand, if E1 =0, two vectors xeE and yeE are equivalent mod E1 if and only if y = x. Thus the elements of E/(0) are the singleton sets {x} where x is any element of E, and iv is the linear isomorphism Consequently we identify E and E/(0). 1.17. Linear dependence mod a subspace.. Let E1 be a subspace of E, and suppose that (x2) is a family of vectors in E. Then the will be called linearly dependent mod E1 if there are scalars not all zero, such that
If the
are not linearly dependent mod E1 they will be called linearly
independent mod E1. Now consider the canonical projection
It follows immediately from the definition that the vectors dependent (independent) mod E1 if and only if the vectors dependent (independent) in E/E1.
are linearly are linearly
Chapter 1. Vector spaces
1.18. Basis of a factor space. Suppose that U (:fl) is a basis of E form a basis of E1. Then the vectors 7r:p form a such that the vectors basis of E/E1. To prove this let E2 be the subspace of E generated by the vectors zp . Then
(1.27)
Now consider the linear mapping
defined by
goz=rrz Then
ZEE2.
is surjective. In fact, let
be an arbitrary vector. Since
it:E—*E/E1 is surjective we can write
x—irx,
xEE.
In view of (1.27) the vector x can be decomposed in the form
x=y+z
yEE1,ZEE2.
(1.28)
Equation (1.28) yields
= irx = icy + Trz = and so çø is surjective. To show that çø is injective assume that
çoz=çoz'
=
z,z'eE2.
Then —
z) = p(z' — z) = 0
and hence z'—zeE1. On the other hand we have that z'—zeE2 and thus
z'—zeE1 fl is a linear isomorphism and now PropoIt follows that sition Ill of sec. 1.11 shows that the vectors irzp form a basis of E/E1.
Problems 1. Let be an arbitrary vector in F3. Which of the following subsets are subspaces? a) all vectors with b) all vectors with =0 c) all vectors with d) all vectors with = F,,, Fd generated by the sets of problem 1, 2. Find the subspaces and construct bases for these subspaces.
§ 3. Subspaces and factor spaces
31
3. Construct bases for the factor spaces determined by the subspaces of problem 2.
4. Find complementary spaces for the subspaces of problem 2, and construct bases for these complementary spaces. Show that there exists more than one complementary space for each given subspace. 5. Show that
a) 13=Fa+Fb b)
13=Fb+FC
c) 13=Fa+Fc Find the intersections Fa fl Fb, Fb fl
Fa n
and decide in which cases
the sums above are direct.
6. Let S be an arbitrary subset of E and let be its linear closure. is the intersection of all subspaces of E containing S. Show that 7. Assume a direct composition Show that in each class of E with respect to E1 (i.e. in each coset there is exactly one vector of E2. 8. Let E be a plane and let E1 be a straight line through the origin. What is the geometrical meaning of the equivalence classes with respect to E1. Give a geometrical interpretation of the fact that x
y
x' + i.
Suppose S is a set of linearly independent vectors in E, and suppose T is a basis of E. Prove that there is a subset of T which, together with S, is again a basis of E. and E_ defined 10. Let w be an involution in E. Show that the sets 9.
by
= {xeE; wx = x}, are
E_ = {xeE; wx = — x}
subspaces of E and that
E=
E..
11. Let E1, E2 be subspaces of E. Show that E1 + E2 is the linear closure of E1 u E2. Prove that
E1 + E2 =
E1
U E2
if and only if
E1DE2 or E2DE1. 12. Find subspaces E1, E2, E3 of r3 such that
i) En E1=0 (i+j) ii) E1 + E2 + E3 = p3 iii) the sum in ii) is not direct.
Chapter I. Vector spaces
32
§ 4.
Dimension
In this paragraph all vector spaces are defined over a fixed, but arbitrarily chosen field F of characteristic 0. 1.19. Finitely generated vector spaces. Suppose E is a finitely generated vector space, and consider a surjective linear mapping (p:E—+F. Then F is a system of generators for is finitely generated as well. In fact, if generate F. In particular, the factor space E, then the vectors çox1, ..., of a finitely generated space with respect to any subspace is finitely generated. Now consider a subspace E1 of E. In view of Cor. II to Proposition I, sec. 1.15 there exists a surjective linear mapping ço:E—÷E1. It follows that E1 is finitely generated.
1.20. Dimension. Recall that every system of generators of a nontrivial vector space contains a basis. It follows that a finitely generated non-trivial vector space has a finite basis. In the following it will be shown that in this case every basis of E consists of the same number of vectors.
This number will be called the dimension of E and will be denoted by dim E. E will be called a finite-dimensional vector space. We extend the definition to the case E=(0) by assigning the dimension 0 to the space (0). If E does not have finite dimension it will be called an infinite-dimensional vector space.
Proposition 1. Suppose a vector space has a basis of 11 vectors. Then every family of (n+ 1) vectors is linearly dependent. Consequently, ii is the maximum number of linearly independent vectors in E and hence every basis of E consists of n vectors. Proof: We proceed by induction on ii. Consider first the case n= 1 and let a be a basis vector of E. Then if x 0 and y 0 are two arbitrary vectors we have that whence
and y=pa, ii+O —
= 0.
Thus the vectors x and y are linearly dependent. Now assume by induction that the proposition holds for every vector space having a basis of 1 vectors. = 1. ii) be a basis of E and a family of ii + I vectors. We may assume that + 0 because
Let F be a vector space, and let alL x1 . .
. .
1
§ 4. Dimension
33
otherwise it would follow immediately that the vectors x1 . 1 were linearly dependent. Consider the factor space E1 =E/(xn+ i) and the canonical projection
it: E —÷ E/(xn+i) Since the system where (xn+ i) denotes the subspace generated by generates E1 it contains a basis of E1 (cf. Cor. Ito Theorem I, a1, ...,
sec. 1.6). On the other hand the equation Xn+i
implies that
vi
AV
=0
and so the vectors (a1, ..., an) are linearly dependent. It follows that E1
has a basis consisting of less than n vectors. Hence, by the induction hypothesis, the vectors are linearly dependent. Consequently, there exists a non-trivial relation
=0 and so
=
Xn+i.
This formula shows that the vectors Xi...Xn+i are linearly dependent and
closes the induction.
Example: Since the space vectors it follows that
n
(cf. Example 1, sec. 1.2) has a basis of n
= n.
Proposition II: Two finite dimensional vector spaces E and F are isomorphic if and only if they have the same dimension. Proof: Let be an isomorphism. Then it follows from Proposition III, sec. 1.11 that p maps a basis of E injectively onto a basis of F and so dim E=dim F. Conversely, assume that dim E=dim F—n and let and = 1.. .n) be bases of E and F respectively. According to Propo-
sition II, sec. 1.11 there exists a linear mapping
such that
1...n). Then p maps the basis onto the basis it is a linear isomorphism by Proposition Ill, sec. 1.11.
and hence
3
(Ireub. Lineur Algebra
Chapter I. Vector spaces
34
1.21. Subspaces and factor spaces. Let E1 be a subspace of the n-dimen-
sional vector space E. Then E1 is finitely generated and so it has finite dimension in. Let Xi...Xm be a basis of E1. Then the vectors xi...xm are linearly independent in E and so Cor. II to Theorem I, sec. 1.6 implies that the vectors may be extended to a basis of E. Hence
dimE1 dimE.
(1.29)
if equality holds, then the vectors xi...xm form a basis of E and it follows that E1 = E. Now it will be shown that
dimE=dimE1 +dimE/E1.
(1.30)
If E1 =(0) or E1 =E (1.30) is trivial and so we may assume that E1 is a proper non-trivial subspace of E,
0< dimE1
Let X1.. .Xr be a basis of E1 and extend it to a basis x1.. .Xr.
the vectors
.
follows.
Finally, suppose that E is a direct sum of two subspaces E1 and E2,
E=E1 Then
dimE = dimE1 + dimE2. In fact, if x1 . is a basis of E1 and .xp+q is a basis of E2, then is a basis of E whence (1.31). More generally, if E is the direct sum of several subspaces, .
E
=
then
dimE = EdimE1. Formula (1.31) can also be generalized in the following way. Let E1 and E2 be arbitrary subspaces of E. Then dim(E1 + E2) + dirn(E1 fl E2) = dimE1 + dimE2. In fact, let z1 .. . :r
be
a basis of E1 n
E2
and extend it to a basis
(1.32)
§ 4. Dimension Xr+i . .
of E1 and to a basis Z1 .. .Zr, Yr+ Zr,
35
Yq of E2. Then the vectors
Xr+ 1'
Yr+ 1
(1.33)
Yq
form a basis of E1 +E2. Clearly, the vectors (1.33) generate E1 +E2. To show that they are linearly independent, we comment first that the vectors are linearly independent mod (E1 n E2). In fact, the relation n
implies that
= whence
=0 and JL" =0. Now assume a relation
= 0.
+
+
j
i
k
Then
= i
—
—
j
k
whence fl
Since the vectors x1 are linearly independent mod (E1 fl E2) it follows that In the same way it is shown that ij-'=O. Now it follows that
and so the vectors (1.33) are linearly independent. Hence, they form a basis of E1 + E2 and we obtain that
dim(E1 +E2)=r+(v—r)+(q—r)
=p+q—r
= dimE1 + dimE2 — dim(E1
n
Problems 1. Let (x1, x2) be a basis of a 2-dimensional vector space. Show that the vectors X1 + X2, X2 = X1 — X2 and be the components of a vector respectively. Express the comx relative to the bases (x1, x2) and in terms of the components ponents 2. Consider an n-dimensional complex vector space E. Since the multiplication with real coefficients in particular is defined in E, this space may
again form a basis. Let
Chapter I. Vector spaces
also be considered as a real vector space. Let (z1 ...;) be a basis of E. Prove that the vectors z1 iZ1 form a basis of E if E is considered as a real vector space. 3. Let E be an n-dimensional real vector space and C the complex linear space as constructed in § 1, Problem 5. If (v 1 .. .n) is a basis of E, prove that the vectors (xv, 0) (v = n) form a basis of C. 4. Consider the space of n-tuples of scalars 2EF. Choose as basis the vectors: . . .
. . .
1 . . .
e1 =(1,1,...,1,1) = (0, 1, ..., 1, 1) en
(o,o,...,o,1).
ij2, ..., Compute the components of the vector •, relative to the above basis. For which basis in is the connection be..., tween the components of x and the scalars particularly simple? 5. In F4 consider the subspace Tof all vectors
satisfying
Show that the vectors: x1 =(l, 0, 1, 0) and x2= (0, 1, 0, 1) are linearly independent and lie in T; then extend this set of two vectors to a basis of T. 6. Let be fixed real numbers. Show that all vectors (ii', in 1R4 obeying form a subspace V. Show that V is generated by x1
Verify
= (1,0,0,x1);
that x1, x2, x3
x2 = (0,
(0,0,
x3
form a basis of the subspace V. n—
7. In the space P of all polynomials of degree
bases
and
1
consider the two
defined by
= = (t Express the vectors
—
a)v
(a, constant; v =
0,
...,n —
1).
explicitly in terms of the vectors
8. A subspace E1 of a vector space E is said to have co-dimension n if the factor space E/E1 has dimension n. Let E1 and F1 be subspaces of finite codimension, and let E2, F2 be complementary subspaces,
E1$E2=E, Show that dim E2 = codim E1,
dim F2 = codim F1.
§ 5. The topology of a real finite-dimensional vector space
37
Prove that E1 fl F1 has finite codimension, and that
codim(E1 n F1)dimE2+dimF2.
9. Under the hypothesis of problem 8, construct a decomposition such that H1 has finite codimension and i) H1 ii) H2
E1 n F1 E1 + F1.
Show that n
and n Ha).
and (Yp)fl€B be two bases for a vector space E. Establish 10. Let correspondence between the sets A and B. 11. Let E be an n-dimensional real vector space and E1 be an (n — 1)dimensional subspace. Denote by E1 the set of all vectors xeE which are not contained in E1. Define an equivalence relation in E1 as follows: Two vectors xEE' and yeE' are equivalent, if the straight segment a1—
1
x(t)=(1—t)x+ty is disjoint to E1. Prove that there are precisely two equivalence classes. 12. Show that a vector space is not the union of finitely many proper subspaces.
13. Let E be an n-dimensional vector space. Let F, (i= I ... k) be subspaces such that
dim F, r
(i =
1
... k)
where r < n is a given integer. Show that there is a subspace F E of dimension n—r such that F fl F1=0 (1=1 ... k). Hint: Use problem 12.
§
5. The topology of a real finite-dimensional vector space 1.22. Real topological vector spaces. Let E be a real vector space in
which a topology is defined. Then E is called a topological vector space if the linear operations
ExE
E
and
l1 x E E defined by +y
Chapter I. Vector spaces
38
and
are continuous. Since the set 111" is the Cartesian Example: Consider the space by the topology in a topology is induced in product of n copies of It is easy to verify that the linear operations are continuous with reis a topological vector space. A second spect to this topology and so example is given in problem 6. In the following it will be shown that a real vector space of finite dimension carries a natural topology. Then Proposition: Let E be an n-dimensional vector space over there exists precisely one topology in E satisfying the conditions T1: E is a topological vector space T2: Every linear function in E is continuous. Proof: To prove the existence of such a topology let (v = 1, ..., n) be a given by fixed basis of E and consider the linear isomorphism p:
Then define the open sets in E by p (U) where U is an open set in Clearly p becomes a homeomorphism and the linear operations in E are continuous in this topology. Now letf be a linear function in E. Then we have for every x0eE, XEE (es,). (x - xo) =
11171.
1(x) - f (xo) = f
-
Given an arbitrary positive number
consider the neighbourhood,
çoU, of x0 defined by
v=1,...,n where 5>0 is a number such that
Then if XEçOU we have that
If (x) — I
<5
f
which proves the continuity off at x=x0.
It remains to be shown that the topology of E is uniquely determined by T1 and T2. In fact, suppose that an arbitrary topology is defined in E which satisfies T1 and T2.
Let
§ 5. The topology of a real finite-dimensional vector space
39
1, ..., n) be a basis of E and define mappings p:
and
by and
where x= T1 implies that 'p is continuous. On the other hand, the functions are linear and hence it follows from T2 that i/i is continuous. Since
and
coOt//—1E
we obtain that 'p is a homeomorphism of 11.' onto E. Hence the topology of E is uniquely determined by T1 and T2. Corollary: The topology of E constructed above is independent of the basis
Let F be a second finite-dimensional real vector space and let p: be a linear mapping. Then 'p is continuous. In fact, 1, ..., ni) a basis of F we can write
is
'px = are linear functions in E. Now the continuity of 'p follows from T1 and T2. 1.23. Complex topological vector spaces. The reader should verify that the results of sec. 1.22 carry over word for word in the case of complex
where the
spaces.
Problems 1. Letf be a real valued continuous function in the real n-dimensional linear space E such that
f(x + y) =f(x)+f(y)
x,yeE.
Prove that f is linear. a surjective linear mapping of finite dimensional real vector spaces. Show that 'p is open (the image of an open set in E1 under 'p is open in E2). 2. Let
be
Chapter I. Vector spaces
3. Let m:E—÷E/F be the canonical projection, where E is a real finite dimensional vector space, and F is a subspace. Then the topology in E determines a topology in E/F (a subset UcE/F is open if and only if
m'Uis open in E). a) Prove that this topology coincides with the natural topology in the vector space E/F. b) Prove that the subspace topology of F coincides with the natural topology of F. 4. Show that every subspace of a finite dimensional real vector space is a closed set. 5. Construct a topology for finite dimensional real vector spaces that satisfies T1 but not T2, and a topology that satisfies T2 but not T1. 6. Let E be a real vector space. Then every finite dimensional subspace of E carries a natural topology. Let E1 be any finite dimensional subspace of E, and let U1 E1 be an open set. Moreover let E2 be a complementary subspace in E, Then U1 and E2 determine a set 0 given by
0={x+y;xeU1,yEE2}.
(1.34)
Suppose that
0' =
{x + y;
is a second set of this form. Prove that 0 n 0' is again a set of this form. Hint: Use problems 8 and 9, § 4.
Conclude that the sets OcE of the form (1.34) form a basis for a topology in E. 7. Prove that the topology defined in problem 6 satisfies T1 and T2. 8. Prove that the topology of problem 7 is regular. Show that E is not metrizable if it has infinite dimension.
Chapter II
Linear Mappings In this chapter all vector spaces are defined over a fixed but arbitrarily chosen field, F, of characteristic 0.
§ 1. Basic properties 2.1. Kernel and image space. Suppose E, F are vector spaces and let p: E—*F be a linear mapping. Then the kernel of 'p, denoted by ker ço, is the subset of vectors xeE such that px=O. It follows from (1.8) and (1.9) that ker ço is a subspace of E. The mapping p is injective if and only if (0).
ker p
In fact, if p is injective there is at most one vector xeE such that px=O. But p0 = 0 and so it follows that ker 'p = (0). Conversely, assume that (2.1) holds. Then if (pX1 =
for two vectors x1, x2eE we have —
whence x1— x2 e ker 'p. 'p is injective.
x2)
=
0
It follows that x1— x2 = 0 and so x1 = x2. Hence
The image space of p, denoted by Tm 'p, is the set of vectors ye F of the form y=çox for some xeE. Im 'p is a subspace of F. It is clear that 'p is surjective if and only if Tm 'p = F.
Example 1. Let E1 be a subspace of E and consider the canonical projection Then ker ir = E1
and Tm it = E/E1.
Chapter II. Linear mappings
42
2.2. The restriction of a linear mapping. Suppose go: mapping and let E1 c E, F1 c: F be subspaces such that XEE1.
for
goxEF1
is a linear
Then the linear mapping E1
F1
defined by
xeE1
go1x=gox
is called the restriction of go to F1, F1. It satisfies the relation
F are the canonical injections. Equivalently,
where iE: E1 —÷E and
the diagram 4,
E
IF
tEl E1
F1
is commutative. 2.3. The induced mapping in the factor spaces. Let go: E—*F be a linear be its restriction to subspaces E1 c F and F1 c F. mapping and go1 : F1 Then there exists precisely one linear mapping E/E1
F/F1
such that (2.2)
where
and
are the canonical projections. Since is surjective, the mapping is uniquely determined by (2.2) if it exists. To define we notice first that =
(2.3)
whenever (2.4)
In fact, (2.4) implies that = E1.
x1 —
But by the hypothesis gox1 — gox2
=
go(x1
and so
=
—
X2)EF1
=
§ 1. Basic properties
43
It follows from (2.3) and (2.4) that there is a set map E/E1 satisfying (2.2). To prove that is linear let eE/E1 and 9eE/E1 be arbitrary and choose vectors x e E and y e E such that ICEX = and 7CEY 9. Then it follows from (2.2) that
+ iip)= and hence
+ +
+ jiy)
=
=
2(19X
+ P'PY
is a linear mapping.
The reader should notice that the relation (2.2) is equivalent to the requirement that the diagram E
F
E/E1
F/F1
xeE and 7rFY—9, yeF we can rewrite
be commutative. Setting (2.2) in the form
= 'pX. 2.4. The factoring of a linear mapping. Let p: be a linear mapping and consider the subspaces E1 =ker 'p and F1 =(O). Since 'px=O, xEE1 a linear mapping
çö: E/ker 'p
F
is induced by 'p (cf. sec. 2.3) such that (2.5)
where ir denotes the canonical projection ir: E The mapping xEker 'p and
restriction
E/ker 'p.
is injective. In fact, if ?,öirx = 0 we have that çox
0.
Hence
so rrx=O. It follows that
is injective. In particular, the to E/kerço, Im 'p (also denoted by is a linear isomorph-
ism
4 Im'p. Formula (2.5) shows that every linear mapping can be written as the composition of a surjective and an injective linear mapping,
E-*F 4,
E/ker'p
Chapter II. Linear mappings
44
As an application it will now be shown that for any two subspaces c E and 122 E there is a natural isomorphism E1/(E1 n
+E2)/E2.
(2.6)
Consider the canonical projection
+E2)/E2
ir:E1
and let 'p be the restriction of ir toE1, (E1 +E2)/E2. Then 'p is surjective. In fact, if X1EE1,X2EE2 X—X1+X2, is
any vector of
+ E2 we
have
irx = ir(x1 + x2) = irx1 = (px1. Since
ker'p = kent it
n E1
=
E2 n
follows that 'p induces a linear isomorphism n
E2)4(E1 +E2)/E2.
Now consider the special case that
E=E1 E2
= 0 and hence the relation (2.6) reduces to
E14E/E2. a second example, let define a subspace Fc E by As
(i = 1. r) . .
be
r
linear
functions in E
F= i= 1
Now consider the linear mapping p:
defined by
'p x = (f1 (x), . ., fr(X)) .
Then clearly
ker'p= flkerf1=F i= 1
and so 'p determines a linear isomorphism c
and
§ 1. Basic properties
45
It follows that Im go, and hence E/F, has dimension r,
dim ElF r. G are linear mappings such
Proposition I: Suppose go: E—*F and i/i:
that kergo
ken/i.
Then i/i can be factored over (p; that is, there exists a linear mapping
such that = Since
'1'.
maps ker go into 0 it induces a linear mapping
E/ker go
-÷G such that where E/ker go
it: E
is the canonical projection. Let E/ker go 4 Im go
be the linear isomorphism determined by go, and define a linear mapping by
Finally, let x: F—* G be any linear mapping which extends
Then we have
that go = 4)
0
(p0 it = it
whence Xo(P
=
=
=
= l/1.
Our result is expressed in the commutative diagram
ix G
2.5. Exact sequences. Exact sequences provide a sophisticated method for describing elementary properties of linear mappings. A sequence of linear mappings (2.7)
Chapter II. Linear mappings
46
is called exact at E if
Imp = We exhibit the following special cases:
1. F=O. Then the exact sequence (2.7) reads 4,
(2.8)
Since Im (p=O it follows that ker 11=0 i.e., çti is injective. Conversely, is injective. Then ker/i=0, and so the sequence (2.8) suppose Ji: is exact at E.
2. G=0. Then the exact sequence (2.7) has the form 4,
(2.9)
Since ,fi is the zero mapping it follows that
Imq = ker/i =
E
and so p is surjective. Conversely, if the linear mapping jective, then the sequence (2.9) is exact.
F—*E is sur-
A short exact sequence is a sequence of the form (2.10)
which is exact at F, E and G. As an example consider the sequence (2.11)
where E1 is a subspace of E and 1, projection respectively. Then
Imi =
it denote
E1
the canonical injection and
= kent
and so (2.11) is exact at E. Moreover, since i and are itrespectively injective and surjective, it follows that (2.11) is exact at E1 and E/E1 and so (2.11) is a short exact sequence.
The example above is essentially the only example of a short exact sequence. *)
It is clear that the first and the last mapping in the above diagram are the zero
mappings.
§ 1. Basic properties
47
In fact, suppose
is a short exact sequence. Let E1
lmço = ken/i
and consider the exact sequence
Since the mapping (p:F—÷Eis injective its restriction ço1 to F, E1 is a linear
isomorphism, Pi
On the other hand, i/i
induces
a linear iso-
morphism G.
Now it follows easily from the definitions that the diagram (2.12)
is commutative. 2.6. Homomorphisms of exact sequences. A commutative diagram of the form (pi
o —f F1
—÷
o —+ F2
—*
E1
—*
G1
0
E2
—÷
G2
0
(2.13) 402
where both horizontal sequences are short exact sequences, and Q, a, t are linear mappings, is called a homomorphism of exact sequences. If a, -r are linear isomorphisms, then (2.13) is called an isomorphism between the two short exact sequences. In particular, (2.12) is an isomorphism of short exact sequences. 2.7. Split short exact sequences. Suppose that (2.10)
is a short exact sequence, and assume that there X:E4—G is a linear mapping such that = Then x is said to split the sequence (2.10) and the sequence x
is called a split short exact sequence.
Chapter II. Linear mappings
48
Proposition II: Every short exact sequence can be split. Proof: Given a short exact sequence, (2.10) let E1 be a complementary subspace of ker in E, of i/i to E1, G. Since ker /11 =0, and consider the restriction, is a linear isomorphism, i/i 1: E1 G. Then the mapping x: E1 G defined by 1 satisfies the relation x=
zeG and hence x splits the sequence. 2.8. Stable subspaces. Consider now the case F=E; i.e., let ço be
a linear transformation of the vector space E. Then a subspace E1
E
will be called stable under 'p if (pXEE1
for xeE1.
It is easy to verify that the subspaces ker 'p and Im p are stable. If E1 is a stable subspace, the restriction, 'ps. of 'p to E1, E1 will be called the restriction qf p to E1. Clearly, is a linear transformation of E1. We also have that the induced map
is a linear transformation of E/E1.
Problems 1. Let C be the space of continuous functions f: D1—+ 111 and define the mapping p: C—k C by
Prove that Tm 'p consists of all continuously differentiable functions while
the kernel of 'p is 0. Conclude that 'p is injective but not bijective. 2. Find the image spaces and kernels of the following linear transfor-
mations of ['s: a)
b) c)
= = =
-
+
+
+
§ 1. Basic properties 3.
49
Find the image spaces and kernels of the following linear mappings
ofF4 into =
a) b)
=
c)
—
+
+
+ +
—
+
+ —
+
+ +
+ —
4. Construct bases for the factor spaces F4/ker i/i and F4/ker ço of problems 2 and 3. Determine the action of the induced mappings on these bases and verify that the induced mappings are injective. 5. Prove that if ço:E—*F and are linear mappings, then the relation
ker(p
is necessary for the existence of a linear mapping
such that
in parts a, b, c of problems 2 and 3. Decide Consider the pairs (k/I, be factored over p, or if ço can be factored over i//, in each case if k// can 6.
or
if both factorings are possible. Whenever i/i can be factored over conversely) construct an explicit factoring map. 7. a) Use formula (2.6) to obtain an elegant proof of formula (1.32). b) Establish a linear isomorphism
(or
(E/F)/(E1/F) where Fc: E1
E/E1
E.
8. Consider the short exact sequence
-+0.
0-+E1
correspondence between linear mappings x: E+-E/E1 which split the sequence, and complementary subspaces of E1 in E. G—÷0 is split if and only 9. Show that a short exact sequence if there exists a linear mapping w: F+-E such that w (p 1. correspondence between the split short In the process establish a 1 — exact sequences of the form
Show that the relation
x defines a 1 — 1
1
4,
0-+F-+E#G-+0 x
and of the form w 4
Greub. Linear Algebra
Chapter II. Linear mappings
such that the diagram (1)
is again a short exact sequence. 10. Assume a commutative diagram of linear maps
j.4'3
F1
—+
/33
132
13
F2
—*
F3
/34
—*
F4
—÷
F5
where both horizontal sequences are exact. i) Show that if ço4 is injective and m is surjective, then kercp3 =
ii) Show that if p2 is surjective and p5 is injective, then Im
Conclude that if the maps
iii)
then
'p3 =
so is
'p4, p5 are linear isomorphisms.
(5-lemma).
11. Consider a system of linear mappings
0
0
—*
I
I
'I.
0
0
E00
(Pot —÷
(P00 —÷
/'ooj.
/1021
0— E10
/'iol 0
—*
('II —p
/1iiI
E20
—÷
1
.1.
where
//121 (P21 —÷
1
all the horizontal and the vertical sequences are exact at each
Assume
=
Construct
n
a linear isomorphism between
1
and
12. Given an exact sequence (P
prove
1) by
that the diagram is commutative. Define spaces
that 'p is
surjective if and
1'
x
only if x is injective.
1,j•
§ 2. Operations with linear mappings
13. Prove the hexagonal lemma: Given a diagram of linear maps A &
B
the diagonals 120 i1 and
k1 k2 are isomorphisms and i2 are exact at E, show that
l1ok1oh1 + l2ok2 oh2 =
§ 2.
Operations with linear mappings
2.9. The space L(E; F). Let E and F be vector spaces and consider the set L(E; F) of linear mappings p: If p and cli are two such mappings + i/i and 2p of E into F are defined by (q, +
=
çox + clix
and
xeE.
It is easy to verify that p + cli and 2p are again linear mappings, and so the set L (E; F) becomes a linear space, called the space of linear mappings
of E into F. The zero vector of L (E; F) is the linear mapping 0 defined by 0 x=O, xeE. In the case that F=F ('p and cli are linear functions) L(E; F) is denoted simply by L(E). 2.10. Composition. Recall (sec. 1.10) that if and cli: F—÷ G are linear mappings then the mapping p: G defined by p) x =
i/i ('p
x)
is again linear. If H is a fourth linear space and x: G—*H is a linear mapping, we have for each xEE
= x(clioco)x = x[cli(px)] = (xocli)cox = [(xocli)oço]x whence
Consequently, we can simply write x 0 cl' 0 'p.
(2.14)
Chapter 11. Linear mappings
is a linear mapping and 1E and 1F are the identity mappings If ço : of E and F we have clearly and
(2.15)
is the inverse isomorphism
Moreover, if ço is a linear isomorphism and
we have the relations (2.16)
and
Finally, if checked that
E—* F and
F—p G are linear mappings, then it is easily
and
(2.17)
=
2.11. Left and right inverses. Let and cli: E+-F be linear mappings. Then is called a right in verse of p if çü cli = /i is called a left inverse of p if p=
surjective if and only if it I. A linear mapping has a right inverse. It is injective if and only if it has a left inverse. Proof: Suppose çü has a right inverse, Then we have for every reF Proposition
y=
c/' Y
and so yelm ço; i.e., çø is surjective. Conversely, if p is surjective, let E1 be a complementary subspace of ker p in E,
E=
E1
kerp.
Then the restriction ço1 of çü to E1, F is a linear isomorphism. Define the linear mapping c/i:E1÷—Fby where i1 :E1—*E is the canonical injection. Then = yeF y = j',
i.e., poi/'=lr. For the proof of the second part of the proposition assume that ço has a left inverse. Then if xeker p we have that
x = c/ipx = c/iO =
0
whence ker 'p=O. Consequently p is injective.
§ 2. Operations with linear mappings
53
Conversely, if p is injective, consider the restriction Pi of p toE, Im ço.
is a linear isomorphism. Let ir:F—*Im
Then
be
a linear mapping
such that
iry=y
yEIm(p
for
(cf. Cor. II, Proposition I, sec. 1.15) and define t/i:E+—F by
= Then we have that
whence /i
=
Hence
has
a left inverse. This completes the proof.
Corollary: A linear isomorphism right (left) inverse, namely, (p1. Proof: Relation (2.16) shows that (p Now let lji be any inverse of (p,
has a uniquely determined is
a left (and right) inverse to çø.
= Then multiplying by
1 from the right we obtain
= whence of (p is
t/i = ço
In the same way it is shown that the only right inverse
2.12. Linear automorphisms. Consider the set GL(E) of all linear auto-
morphisms of E. Clearly, GL(E) is closed under the composition ((p,
and it satisfies the following conditions:
i) x p) = (x ol/J) o (p (associative law) ii) there exists an element i (the identity map) such that (p i = lo(p=(p for every çoeGL(E) iii) to every (pEGL(E) there is an element p EGL(E) such that 1
1.
In other words, the linear automorphisms of E form a group.
Problems 1. Show that if E, F are vector spaces, then the inclusions
L(E; F)
C(E; F)
(E; F)
Chapter II. Linear mappings
54
are proper ((E; F) is defined in Example 3, sec. 1.2 and C(E; F) is defined in problem 9, § I, chap. I). Under which conditions do any of these spaces have finite dimension? 2. Suppose and are
linear mappings. Assume
that coi, P2 are injective,
I'2 are surjec-
tive and Xi' /2 are bijective. Prove that a) (p2ocoi is injective is surjective b) c) /2°/i is bijective
3. Let linear mappings then
be a linear mapping. a) Consider the space M'(q) of E4—F such that Prove that if is surjective
b) Consider the space (po/J=O. Prove that if
is
of linear mappings Ji: injective then
such that
4. Suppose that go:E—+F is injective and let M'(ço) be the subspace defined in problem 3. Show that the set of left inverses of is a coset in the factor space L(F; E)/Ml (ço), and conclude that the left inverse of is uniquely determined if and only if is surjective. Establish a similar result for surjective linear mappings. 5. Show that the space M'(ço) of problem 3 is the set of linear mappings /i: such that Im ker /i. Construct a natural linear isomorphism between M'(ço) and L(F/Im p; E).
Construct a natural linear isomorphism between Mr(p) (cf. problem 3) and L(F; ker p). 6. Assume that E—÷E is a linear transformation such that Ji = /i for every linear transformation /i. Prove that ço = It where I is a scalar. Hint: Show first that, foreveryvectorxEE there is a scalar 1(x) such that cox=2(x)x. Then prove that 1(x) does not depend on x. 7. Prove that the group GL(E) is not commutative for dim E> 1. If dim E= 1, show that GL(E) is isomorphic to the multiplicative group of the field F. 8. Let E be a vector space and S be a set of linear transformations of E. A subspace Fc E is called stable with respect to S if F is stable under every pES. The space E is called irreducible with respect to S if the only stable subspaces are F=O and F=E. Prove Schur's Lemma: Let E and F be vector spaces and be a linear mapping. Assume that SE and SF are two sets of linear transfor:
§ 3. Linear isomorphisms
mations of E
and
F such that SE = SF
to every transformation cOESE there exists a transformation i/JESF and conversely. Prove that =0 or is a linear such that ço = isomorphism of E onto F.
i.e.
§
3.
Linear isomorphisms
2.13. It is customary to state simply that a linear isomorphism preserves all linear properties. We shall attempt to make this statement more precise, by listing without proof (the proofs being all trivial) some of the important properties which are preserved under an isomorphism p: F. Property I: The image under 'p of a generating set (linearly independent set, basis) in E is a generating set (linearly independent set, basis) in F.
Property II: If E1 is any subspace in E, and E/E1 is the corresponding factor space, then 'p determines linear isomorphisms E1
'pE1
and
E/E14 (pE/çDE1. Property III: If
G is a third vector space, then the mappings
t/ieL(E;G) and
are linear isomorphisms
L(E;
G)4 L(F; G)
and
L(G;E)4
L(G;F)
is an injective linear mapping. 2.14. Identification: Suppose p: Then 'p determines a linear isomorphism
Chapter II. Linear mappings
It may be convenient not to distinguish between E and Im ço, but to regard them as the same vector space. This is called ident(flcation, and while in some sense it is sloppy mathematics, it leads to a great deal of economy of formulae and a much clearer presentation. Of course we shall only identify spaces whenever there is no possibility of confusion.
§ 4.
Direct sum of vector spaces
2.15. Definition. Let E and F be two vector spaces and consider the set Ex Fof all ordered pairs (x, y), xeE, yeF. it is easy to verify that the set E x F becomes a vector space under the operations (x1,y1) + (x2,y2) = (x1 + x2,y1 + Y2)
and = (2x,2y)
This vector space is called the (external) direct sum of E and F and is denoted by EEEF. If eA and (Y/,)p B are bases of E and F respectively form a basis of EEEF. In particular, if E 0) and (0, then the pairs and F are finite dimensional we have that dim (E
F) = dim E + dim F.
2.16. The canonical injections and projections. Consider the linear mappings
i2:F-*EEE)F defined by
i1x = (x,0)
i2y = (O,y)
and the linear mappings given by
y.
x
it follows immediately from the definitions that = 'E
ir10i2=O
°
'F
m2oi1—0
(2.18) (2.19)
§ 4. Direct sum of vector spaces
and
+
11
12
(2.20)
Jr2 =
The relations (2.18) imply that the mappings 1, 2) are injective are called and the mappings IrA = 1,2) are surjective. The mappings respectively the canonical injections and IrA the canonical projections associated with the external direct sum EEBF. Since i1 and i2 are injective we can identify Ewith Im i1 and Fwith Im i2. Then Eand F become subspaces of and E and F.
The reader will have noticed that we have used the same symbol to denote the external and the internal direct sums of two subspaces of a vector space. However, it will always be clear from the context whether the internal or the external direct sum is meant. (If we perform the identification, then the distinction vanishes). In the discussion of direct sums of families of subspaces (see sec. 2.17) we adopt different notations. If F= E we define an injective mapping A : by
Ax =(x,x). A is called the diagonal mapping. In terms of i1 and i2 the diagonal mapping can be written as
A =i1 +i2. Relations (2.18) and (2.19) imply that
0A =
ir1 0A
The following proposition shows that the direct sum of two vector spaces is characterized by its canonical injections and projections up to an isomorphism.
Proposition I: Let E, F, G be three vector spaces and suppose that a system of linear mappings
ço1:E-*G, is given subject to the conditions 1
°
=
'E
°
= 1F
and
+
=
Chapter II. Linear mappings
Then there exists a linear isomorphism =
toil
=
=
To
=
and 12
such that (2.21)
oil
are called (as before) canonical injections and projections. Proof Define linear mappings
The
and by
o:=(l/11z,t/12:),
zEG
and
t(x,y)=p1x+p2v,
XEE,yEF.
Then for every vector ZEG T0Z= and
Z=
Z+
for every vector (x, y)EEe3F
at(x,y) =
+
+
= (x,v).
These relations show that t and a are inverse isomorphisms. Formulae (2.21) are immediate consequences of the definition of t. Example: Let E be a real vector space. Then E can he made into a complex vector space as follows: fix) The complex vector space so obtained is called the coimiplexificatiomi of E
and is denoted by Eq. Every vector (x, V)EEq can be uniquely represented in the form (x, y) = (x, 0) + (0, v) = (x. 0) + i(v, 0).
Now identify the (real) subspace E under the inclusion map i1: Then the equation above reads (x, v) = x + iv
x,
E.
If E has finite dimension a. and if x1 is a basis of E, then the vectors x1 form a basis of the complex space Em as is easily verified. Thus dimm-Ec =
§ 4. Direct sum of vector spaces
59
2.17. Direct sum of an arbitrary family of vector spaces. Let be an arbitrary family of vector spaces. To define the direct sum of the family E2 consider all mappings (2.22)
such that i)
x (cx) are zero.
We denote
Then the mapping (2.22) can be written as
by
x:
—p x2.
The sum of two mappings x and y is defined by =
(x +
+
and the mapping 2x is given by =
Under these operations the set of all mappings (2.22) is made into a vector space. This vector space is called the (external) direct sum of the The zero vector of is and will be denoted by vector spaces the mapping x given by =
x
zero vector of Eu).
For every fixed QEA we define the canonical injection i
by x
(2.23) and (2.24) that
(2.25)
and EQ
lrQ x = x
xe
By 'abus de langage' we shall write (2.26) simply as EQ
=
(2.26)
Chapter II. Linear mappings
Proposition II: Suppose that a decomposition of a vector space E as a direct sum of a family of subspaces E is isomorphic to the external direct sum of the vector spaces Proof: Let Then a linear mapping ax =
where x =
Conversely, a linear mapping
E E2.
is given by 'C X =
X.
Relations (2.25) and (2.26) imply that
'Coat and
ao'C=z
and hence a is an isomorphism of E onto
and 'r is the inverse isomorph-
ism.
2.18. Directsumoflinearmappings. are linear mappings. Then a linear mapping defined by
:
is
x2).
x1,
('Pi
and'P2 E2—*F2
It follows immediately from the definition that
Im(p1
'P2) = 1mp1
1mp2
'P2) = ker'P1
ker'P2.
and
Now suppose E1, E2 are subspaces of E and F1, F2 are subspaces of F such that
and F=F1$F2. If
are linear maps then
(2.27)
is again a linear map, defined by
+x2)=cp1x1 +'P2X2 where x = x1 + x2 is the decomposition of any vector xe E determined by
(2.27). 'Pi $(P2 may be characterized as the unique linear map of E into F which extends 'Pi and 2.19. Projection operators. A linear transformation 'P : E—*E is called a projection operator in E, if If 'p is a projection operator in E, then (2.28) E = ker'p
§ 4. Direct sum of vector spaces
61
Moreover, 'P = 'Im
(2.29)
°ker
To prove (2.28) let xeE be an arbitrary vector. Writing
x=y+'Px (i.e.y=x—'Px) we obtain that 'P2 x = 0
'P Y = 'P X
whence yeker 'P. It follows that
E = ker'P + lm'P.
(2.30)
To show that the decomposition (2.30) is direct let :='Px be an arbitrary vector of ker 'P fl Im 'P. Then we have that 0 = 'P Z = 'P2 x
'P X = Z
and thus ker 'P fl Im 'P=0.
To prove (2.29) we observe that the subspaces Im 'P and ker 'P are stable under 'P (cf. sec. 2.8) and that the induced transformations are the identity and the zero mapping respectively. Conversely, if a direct decomposition E = E1 is
$ E2
given, then the linear mapping 'P
1E1
is clearly a projection operator in E. Proposition III: Let
(i = 1
. .
.r) be projection operators in E such that
1+1 and = 1.
Then
E= i= 1
Proof: Let xEE be arbitrary. Then the relation E i=1
(2.31)
Chapter II. Linear mappings
shows that
I
E=
(2.32)
To prove that the sum (2.32) is direct suppose that fl
Then
(some
I
j*i
yEE), so that (2.33)
On the other hand, we have that for some vectors YJEE, X
=
j*i
whence, in view of (2.31), (2.34)
j*i
Relations (2.33) and (2.34) yield x=O and hence the decomposition (2.32) is direct.
Suppose now that
E
is a decomposition of E as a direct sum of subspaces Let and is,: denote the canonical projections and injections, and consider the linear mappings E—÷E defined by =
Then the are projection operators satisfying (2.31) as follows from (2.25) and (2.26). Moreover, Im and so the decomposition of E determined by the agrees with the original decomposition.
Problems 1. Assume a decomposition E = E1 + E2. Consider the external direct sum
and define a linear mapping
by
ço(x1,x2)=x1+x2 Prove
that the kernel of 'p
is
X1EE1,X2EE2.
the subspace of E consisting of the pairs
§ 5. Dual vector spaces
63
— x) where XEE1 fl E2. Show that is a linear isomorphism if and only if the decomposition E= E1 + E2 is direct. 2. Given two vector spaces E and F, consider subspaces E1 c E, F1 F and the canonical projections
(x,
Define a mapping by
$F/F1 =
Show that p induces a linear isomorphism
3. Let E:=E1G3E2 and F=F1EI3F2 be decompositions of E and F as direct sums of subspaces. Show that the external direct sum, G, of E and F can be written as G = G1 G2 where G1 and G2 are subspaces of G and is the external direct sum of E, and F1(i— 1, 2).
4. Prove that from every projection operator ir in E an involution w is obtained by w 2ic — i and that every involution can be written in this form. 5. Let l...r) be projection operators in E such that
(i=1...r) where F is a fixed subspace of E. Let
a) If b)
+ 0 then Im
(i= 1.. .r) be scalars. Show that
=F
is a non-trivial projection operator in E if and only if
=
1.
6. Let E be a vector space with a countable basis. Construct a linear isomorphism between E and 7. Let X be any set and let C(X) be the free vector space generated by X C(Y). (cf. sec. 1.7). Show that if Yis a second set, then C(X U § 5. Dual vector spaces 2.20. Bilinear functions. Let E and F be vector spaces. Then a mapping Ex satisfying
and 1i(x,2y1 + ,uy2) = )Ai(x,y1) +
x1,x2eE,yeF
(2.35)
xeE,y1,y2eF
(2.36)
C hapter II. Li near mappings
is called a bilinear function in E x F. If (P is a bilinear function in E x F and E1 E, F1 F are subspaces, then (P induces a bilinear function in E1 x F1 defined by
cP1(x,y)=cP(x,y)
xEE1,yEF1
is called the restriction of (P to E1 x F1. in E1 x F1 may be extended (in Conversely, every bilinear function several ways) to a bilinear function in E x F. In fact, let Q:E—*E1,
be surjective linear mappings such that and a reduce to the identity in E1 and F1 respectively (cf. Cor. 11, Proposition I, sec. 1.15). Define (P by cP(x,y) = cP1(Qx,ay).
Then (P is a bilinear function in Ex Fand for x1EE1, y1eF1 we have that (P(x1, Yi)
X1, a Yi)
=
(x1, Yi)
Thus (P extends Now let
E and F
of subspaces. Then every
system of bilinear functions x
can be extended in precisely one way to a bilinear function (P in E x F. The function (P is given by (P(x,y) = and denote the canonical projections associated with the decompositions (2.37). 2.21. Nullspaces. A bilinear function (P in E x F determines two subspaces NE c E and NF F defined by where
NE={xI(P(x,y)=O} forevery yeF and
forevery xEE. It follows immediately from (2.35) and (2.36) that NE and NF are subspaces of E and F. They are called the nulispaces of (P. If NE = 0 and NF = 0 then the bilinear function (P is called non-degenerate.
§ 5. Dual
vector spaces
65
Given an arbitrary bilinear function consider the canonical projections 7rE.E-*EINE, 7rF.F÷FINF. Then P induces a non-degenerate bilinear function that — = ct'(x,y).
in E/NE x F/NF such
To show that b is well defined, suppose that x' e E and y' E F are two other vectors such that and JtFY=ICFY . Then x'—xENE andy'—yENF
and hence we can write x'=x+u, UENE and y'—y+v, VENF. It follows that cP(x',y') = P(x + u,y + v) = + + cP(u,y) + cP(u,v) = CP(x,y).
Clearly '15 is bilinear, it remains to be shown that In fact, assume that X, =0
is non-degenerate. (2.38)
for a fixed and every TrrY. Then P(x, y)=O for every yEF. It follows that XENE whence TrEx=O. Similarly, if (2.38) holds for a fixed and every ICEX, then Hence cii is non-degenerate. A non-degenerate bilinear function cli in E x F will often be denoted by Then we write cP(x,y)=<x,y> xEE,yEF.
Dual spaces. Suppose E*, E is a pair of vector spaces, and assume that a fixed non-degenerate bilinear function, <,>, in E* x E is defined. Then E and E* will be called dual with respect to the bilinear function x>, is called the scalar product of and x, The scalar and the bilinear function <,> is called a scalar product between E* and E. 2.22.
Examples.
1
Let E= E* = F and define a mapping
by
2,peF.
<2,p>=2ji
Clearly <,> is a non-degenerate bilinear function, and hence F can be regarded as a self-dual space.
2. Let E= E* = F" and consider the bilinear mapping <.> defined by = 1=1 Greub. Li near AJgcbra
Chapter II. Linear mappings
where
x=
...,
It is easy to verify that the bilinear mapping <.> is non-degenerate and is dual to itself.
hence
3. Let E be any vector space and E* = L (E) the space of linear functions in E. Define a bilinear mapping <.> by
=f(x),
JEL(E),XEE.
Sincef(x)=O for each XEE if and only iff=O, it follows that NL(E)=O. On the other hand, let aeE be a non-zero vector and E1 be the onedimensional subspace of E generated by a. Then a linear function g is defined in E1 by g(x)=)L where In view of sec. 1.15, g can be extended to a linear function f in E. Then
a> =
f (a) =
g
1 +0.
(a)
It follows that NE = 0 and hence the bilinear function <.> is non-degenerate.
This example is of particular importance because of the following
Proposition I: Let E*, E be a pair of vector spaces which are dual with respect to a scalar product Then an injective linear map & E*_*L(E) is defined by =
E E*, XE E.
x>
Proof? Fix a vector a*EE*. Then a linear function,
ja*k) = Since <,>
is
bilinear,
X>
XE E.
(2.39)
is defined in E by (2.40)
depends linearly on a*. Now define cP by setting (2.41)
To show that 1i is injective, assume that i(ci*)=O for some a*EE*. Then
X>=0 for every XEE. Since
is
non-degenerate. it follows
that a*=0. Note: It will be shown in sec. 2.33 that P is surjective (and hence a linear isomorphism) if E has finite dimension.
§ 5. Dual vector spaces
67
e E * and xe E are 2.23. Orthogonal complements. Two vectors called orthogonal if <xe, x> = 0. Now let E1 be a subspace of E. Then the of E*. vectors of E* which are orthogonal to E1 form a subspace is called the orthogonal complement of E1. In the same way every subspace
determines an orthogonal complement (Er)' E. The fact that the bilinear function <.> is non-degenerate can now be expressed by the relations
E'=O and (E*)±=O. It follows immediately from the definition that for every subspace E1
E
(2.42)
E1
Suppose next that E*, E are a pair of dual spaces and that F is a sub-
space of E. Then a scalar product is induced in the pair E*/F', F by VEF,
where is a representative of the class In fact, let be the restriction of the scalar product <.>to E* x F. Then the nullspaces of cli are given by
and NF=O. Now our result follows immediately from sec. 2.21.
More generally, suppose Fc E and H* E* are any subspaces. Then a scalar product in the pair H*/H* fl F', F/Fn (H*)', is determined by
= as
a similar argument will show.
2.24. Dual mappings. Suppose that E, E* and F, F* are two pairs of dual spaces and p:E—÷F, are called dual if 'p and
are linear mappings. The mappings
= exists at most one dual mapping.
To a given linear mapping
If
and
are dual to 'p we have that =
=
and
whence —
=
0
XEE,Y*EF.
Chapter II. Linear mappings
68
This implies, in view of the duality of E and E*, that
=
whence
an example of dual mappings consider the dual pairs E*, E and is a subspace of E (cf. sec. 2.23) and let it be the canonical projection of E* onto E*/EjL, As
E*/EjL, E1 where E1
E*. Then the canonical injection
i:E1
is dual to it. In fact, if xeE1, and y*EE* are arbitrary, we have
= <9*,x> =
=
and thus it
= i*.
2.25. Operations with dual mappings. Assume that E*, E and F*, F are two pairs of dual vector spaces. Assume further that p: E—*F and i/i:E-+F are linear mappings and that there exist dual mappings p*: and ,/,*:E*÷_F*. Then there are mappings dual to and 2p and these dual mappings are given by = (p* + 1/1*
(p +
(2.43)
and (2.44)
(2.43) follows from the relation + VJ*)y*,x> =
+ +
—
=
+
and (2.44) is proved in the same way. Now let G, G* be a third pair of F* +— G * be a pair of dual mappings. Then dual spaces and let x: F—* G, the dual mapping of x p exists, and is given by :
(xoco)* =
In fact, if z*EG* and xeE are arbitrary vectors we have that <x*z*,cox> = .
§ 5. Dual vector spaces
69
For the identity map we have clearly —1 —
\*
Now assume that p: E—+F has a left inverse 'Pi : F—+E, (2.45) and that the dual mappings
and
exist. Then we
obtain from (2.45) that = (1E)*
(2.46)
In view of sec. 2.11 the relations (2.45) and (2.46) are equivalent to p injective,
surjective
injective,
(p* surjective.
and
In particular, if p and
are inverse linear isomorphisms, then so are (p* and 'pt. 2.26. Kernel and image space. Let p : E—*F and (p*: be a pair of dual mappings. In this section we shall study the relations between the subspaces
kerpcE, ImqcF
and ker p*
F
Im (p* c E*.
First we establish the formulae
kerp* = (lmço)'
(2.47)
kerp =(Imp*)±.
(2.48)
In fact, for any two vectors y*eker p*, pxelm çü we have = <(p*y*,x> =
0
and hence the subspaces ker and Im 'p are orthogonal, ker Now let y*E(Im p)' be any vector. Then for every xeE <'p*
X> =
(p
(Im p)
X> = 0.
whence y*Eker 'p*. This completes the proof of It follows that (2.47). (2.48) is proved by the same argument.
Chapter II. Linear mappings
70
Now assume that 'p (2.47) implies that ker
is
surjective. Then Im (p=F and hence formula =0; i.e., 'p* is injective. If 'p is injective we ob-
tain from (2.48) that (Im p*)±=0. However, this does not imply that = E* and so we can not conclude that the dual of an injective mapIm ping is surjective (cf. problem 9). 2.27. Relations between the induced mappings. Again let p: E—÷F and be a pair of dual mappings. Then it follows from (2.48) and from the discussion in sec. 2.23 that a scalar product is induced in the pair Im 'p*, E/ker 'p, by
=
x>
Elm 'p*, xe E/ker
In particular, if 'p is injective, then the restriction of the scalar product in E*, E to Im 'p*, E is non-degenerate. The same argument as above shows that the vector spaces F*/ker (p* and Im 'p are dual with respect to the bilinear functions given by x> =
x Elm 'p.
Now consider the surjective linear mapping
'p and
the injective linear mapping E*
F*/ker 'p*
are dual. In fact, if induced by 'p*. The mappings 'p1 and and xEE are arbitrary vectors, we have that
= = <x*,'px> = In the same way it follows that the surjective mapping
induced by 'p* and the injective mapping
induced by 'p are dual. Finally, the induced isomorphisms
E/ker'p 41m'p
'p*
§ 5. Dual vector spaces
and
F*/ker (p* Tm (p* are dual as well. 2.28. The space of linear functions as a dual space. Let E be a vector space and L (E) be the space of linear functions in E. Then the spaces E, L(E) are dual with respect to the scalar product defined in sec. 2.22. For
these spaces we have three important results, which are not valid for arbitrary pairs of dual spaces. Proposition II: Let F, F* be arbitrary dual spaces and (p: E-÷F be a exists, and is given linear mapping. Then a dual mapping by
(2.49)
* ((p*y*)(x)
xeE
Proof: It is easy to verify that the correspondence by (2.49) determines a linear mapping. Moreover, the relation
defined
= ((p*y*)(x) shows that the form
is dual to (p.
If F* = L(F) as well, (2.49) can be written in feL(F).
(2.50)
Proposition III: Suppose p: E—+F is a linear mapping, and consider the dual mapping Then Tm
= (ker
(2.51)
Proof: From (2.42) and (2.48) we obtain that Tm
(p*
(Tm (p*)h1 = (ker
q)'.
(2.52)
On the other hand, suppose that ft (ker p)'. Then
kerf
kerq
and hence (cf. sec. 2.4) there exists a linear function g in F such that go(p
=f.
Now (2.50) yields = go(p
and sofelm (p*• Thus Im (p* (2.51).
f
(ker p)' which together with (2.52) proves
Chapter
72
Linear mappings
11.
is surjective. Corollary I: If p is injective, then Proof. If ker (p=O formula (2.51) yields Im(p* = (kerp)1 = (0)' = L(E)
and so (p* is surjective.
Corollary II: (ker (p)"=ker Proof. Proposition III together with the relation (2.48) yields
(ker (p)" = (Tm p*)l Proposition IV: If E1
ker
E is any subspace, then
= E1.
(2.53)
Proof Consider the canonical projection 7t:E—+E/E1. Then ker Now the result follows immediately from corollary II.
Corollary I: If E—÷F is a linear mapping and (p*: L(E)4—L(F) is the dual mapping, then = Imp. Proof It follows from (2.47) and (2.53) that
(ker p*)i =
(Tm
(p)'1 =
Tm (p.
Corollary II: The bilinear function
= a scalar product in the pair EjL, E/E1. 2.29. Dual exact sequences. As an application suppose the sequence
defines
4,
is exact at E. Then the dual sequence
is exact at L(E). In fact, it follows from (2.47) and (2.51) that ker (p* = (Im
In particular, if
p)' =
(ker v')' = Tm
§ 5. Dual vector spaces
73
is a short exact sequence, then the dual sequence
is again a short exact sequence. 2.30. Direct decompositions. Proposition V: Suppose
E=
E1
E2
(2.54)
is a decomposition of E as a direct sum of subspaces. Then
and the pairs E1L, E2 and E±, E1 are dual with respect to the induced scalar products. Moreover, the induced injections are surjective, and hence
L(E) =
Finally, (EjL)ll=EjL and (E±)11=E±. Let ir1 : E—3E1 and it2: E—+E2 be the canonical projections as-
sociated with the direct decomposition (2.54). LetfeL(E) be any linear function, and define functionsf1,f2 by
fl(x)=f(it2x) It
follows
and f2(x)=fOrlx).
1, 2) and
1=11 + 12. Consequently,
L (E) =
+
(2.55)
To show that the decomposition (2.55) is direct, assume that feEt n Then f(x)=O xeE1,xeE2
and hencef(x)=O for every xeE. Thus f=O, and so the decomposition (2.55) is direct. The rest of the proposition is trivial. Corollary: If E= E1 of r subspaces, then
Er is a decomposition of E as a direct sum
L(E)=FjLEE... where
F1= >EJ. j*i
Chapter II. Linear mappings
74
is again non-
Moreover, the restriction of the scalar product to E1, degenerate, and
Proposition V has the following converse: Proposition VI. Let E1 c E be any subspace, and let subspace dual to E1 such that
L (E) be a
= Then (2.56)
and
L(E) =
(2.57)
Proof: We have
(E1 + Er)' =
n
(Er)' =
n
=0
whence
E=O'=(E1
(2.58)
On the other hand, since E1 and E1 n
are dual, it follows that =0
which together with (2.58) proves (2.56). (2.57) follows from Proposition V and (2.56).
Problems 1. Given two pairs of dual spaces E*, E and F*, F prove that the spaces
and EG3F are dual with respect to the bilinear function <(x*, y*), (x, y)> = <x*, x> + •
2. Consider two subspaces E1 and E2 of E. Establish the relation (E1
n
E
consider the mapping ).:
fined by
Prove that is injective. Show that
de-
aEE, jeL(E). is surjective if and only if dim E <
i.
§ 5. Dual vector spaces
Suppose
4.
it
75
that
a
is
a projection operator in
that it Tm are dual pairs. it, ker that 5. Suppose E, E* is a pair of dual spaces such that every linear functionf: induces a dual mappingf* :E*4_F. Show that the natural
injection a
that that the natural injection E*_*L(E) is
E is space
not surjective. 7. Consider the vector space E of sequences
2,eF and the subspace F consisting of those sequences for which only finitely many 2, are different from zero (addition and scalar multiplication being defined as in the case of given by Show that the mapping Ex
defines a scalar product in E and F. Show further that the induced injection E—÷L(F) is surjective.
8. Let S be any set. Construct a scalar product between (S; F) and C(S) (cf. Example 3, sec. 1.2 and sec. 1.7) which determines a linear isomorphism (5: Hint: See problem 7. 9. Let E be any vector space of infinite dimension. Show that there is
a dual space E* and a second pair of dual spaces F, F* such that there exist dual mappings
p:E—*F, (p*:E*.E....F* where 'p is injective but
is not surjective. again a dual pair of spaces.
Prove that E, Tm 'p* Sup10. Let 'p E—* F be a linear mapping with restriction 'p 1: E1 is a dual mapping. Prove that 'p* can be restricted pose that 'p*: is
:
to the pair (Ft, Ei). Show that the induced mapping (p_*:EIE±
is dual to
F/Fr'
with respect to the induced scalar product.
Chapter II. Linear mappings
11. Show that if F is a vector space with a countable basis then there is no vector space E such that 12. Let E be an infinite dimensional vector space. Construct a linear automorphism of L(E) which is not the dual of an automorphism of E.
13. Let & E x
be a bilinear map such that the linear maps
q: and given by and are isomorphisms. Show that the canonical map 2 defined in problem 3 is given by 2= (i/i a (p. Conclude that E and F must have the same I
finite imension.
§ 6.
Finite dimensional vector spaces
2.31. The space L(E; F). Let E and F be vector spaces of dimension n and in respectively. Then the space L(E; F) has dimension fin,
dimL(E; F) =
(2.59)
..., m)be To prove (2.59) let ..., n)be a basis E—÷ F defined by a basis of F. Consider the linear mappings *)
Now let p:
=1,...,m
be any linear mapping, and define scalars xv
by
=
Then (p —
xA =
YQ —
Y!L
=
—
=
0
whence v, ji
It follows that the mappings
generate the space L(E; F). A similar argument shows that the mappings are linearly independent and hence they form a basis of L (E; F). This basis is called the basis induced by the bases ofEand F. Since the basis consists of nm vectors, formula (2.59) follows. *)
is the Kronecker symbol defined by
=
§ 6. Finite dimensional vector spaces
77
2.32. The space L(E). Now consider the case that F=I' and choose in F the basis consisting of the unit element. Then the basis of L (E) induced 1, ..., n) consists of n linear given by by the basis
f
of L (E) is called the dual of the basis
we have
dimL(E)
of E. In particular,
dimE.
form a basis of L (E) every linear function f in Since the functions E can be uniquely written in the form
f= where the scalars
are given by
p=1,...,n. This formula shows that the components off with respect to the basis f the basis 2.33. Dual spaces. We shall now prove the assertion quoted at the end of sec. 2.22.
Proposition I: Let E, E* be a pair of dual spaces and assume that E has finite dimension. Then the injection hi: defined by formula (2.39) sec. 2.22 is surjective and hence a linear isomorphism. In particular, E* has finite dimension and dim E* = dimE.
(2.61)
Proof: Since hi is injective and dim L(E)= dim E it follows that
dim E* dim E. Hence E* has finite dimension. In view of the symmetry between E and E* we also have that (jim E dim E*
whence (2.61). On the other hand, dim L(E)= dim E and hence p is surjective. Corollary I. Let E, E* be a pair of dual finite dimensional spaces. Then
the results of sec. 2.28, 2.29 and 2.30 hold. Proof: Each result needs to be verified independently, but the proofs can all be obtained by using the linear isomorphism E*4 L (E). The actual verifications are left to the reader.
Chapter II. Linear mappings
78
Corollary H: Let and be any two vector spaces dual to E. Then there exists a unique linear isomorphism such that =
Two bases and
(v = 1.. .n) of E and E* are called dual if
=
(2.62)
Given a basis (v = I .. ii) of E there exists precisely one dual basis of E*. it is clear that the vectors x are u.niquely determined by (2.62). To prove
the existence of the dual basis letfv be the basis of L(E) defined in sec. 2.32 and set
v=1...n
where P is the linear isomorphism of E* onto L(E). Then we have =
=
Given a pair of dual bases
(v = .. 1
= .11)
consider two vectors
x=
It follows from (2.62) that <x*,x> = Replacing
by
in this relation we obtain the formula =
which shows that the components of a vector XEE with respect to a basis
of E are the scalar products of x with the dual basis vectors. Proposition II: Let F be a subspace of E and consider the orthogonal complement F'. Then dimF + dimF' = dimE. (2.63)
Proof: Consider the factor space E*/FH In view of sec. 2.23, is dual to F which implies (2.63). Proposition III: Let E, E* be a pair of dual vector spaces and consider a bilinear function cP: E* x E—÷F. Then there exists precisely one linear transformation such that
= <x*,px>
x*EE*,xEE.
§ 6. Finite dimensional vector spaces
79
Let XEE be a fixed vector and consider the linear E* defined by =
in
In view of proposition I there is precisely one vector çoxeE such that
= The two above equations yield x> = cp(x*, x)
E
E*, xe E
and so a mapping (p : E—÷E is defined. The linearity of çø follows immediately from the bilinearity of and Suppose now that are two
linear transformations of F such that cli(x*,x) =
x>
and
cli(x*,x) =
(p2x>
Then we have that
<X, (pi — X> = 0 whence Proposition III establishes a canonical linear isomorphism between the
spaces B(E*, E) and L(E; F),
L(E; E). Here B(E*, F) is the space of bilinear functions &E* x dition and scalar multiplication defined by (tIi1 + tli2)(x*,x) =
and
(2 k)(x*, x) =
with ad-
+ cP2(x*,x) çji (x*, x).
2.34. The rank of a linear mapping. Let (p : E—÷F be a linear mapping of finite dimensional vector spaces. Then ker cp c E and Tm (p F have finite dimension as well. We define the rank of (p as the dimension of Tm (p
r((p) = dim Im (p. In view of the induced linear isomorphism Im(p
we have at once r((p) + dim ker(p = dimE.
(2.64)
(p is called regular if it is injective. (2.64) implies that (p is regular if and only if r ((p) = dim F.
Chapter 11. Linear mappings
In the special case dim E= dim F (and hence in particular in the case of a linear transformation) we have that is regular if and only if it is surjective. 2.35. Dual mappings. Let E*, E and F*, F be dual pairs and çø: be a linear mapping. Since E* is canonically isomorphic to the space L (E) there exists a dual mapping Hence we have the relations (cf. sec. 2.281
Im
= (ker
and (ker(p)L.
The first relation states that the equation = has
a solution for a given yEF if and only if y satisfies the condition
<x*,y>=O forevery
x*ekerp*.
The second relation implies that dual mappings have the same rank. In fact, from (2.63) we have that
dimlmp* = dim(kerp)' = dimE — dimkerço = dimlmp whence r(co*)
= r(p).
(2.65)
Problems (In problems 1—10 it will be assumed that all vector spaces have finite dimension).
1. Let E, E* be a pair of dual vector spaces, and let E1, E2 be subspaces of E. Prove that (E1 n
Hint: Use problem 2, § 5. 2. Given subspaces Uc E and V* c E* prove that
dim(U' n V*) + dim U = dim(U
n
+ dim
3. Let E, E* be a pair of non-trivial dual vector spaces and let 'p : be a linear mapping such that 'p = (z*) - 'p for every linear auto1
morphism t of E. Prove that 'p =0. Conclude that there exists no linear mapping which transforms every basis of E into its dual basis.
§ 6. Finite dimensional vector spaces
(v = 1. . .n) of E, E* show that the
4. Given a pair of dual bases
••,
bases (x*' + again dual. v2
...,
and (x1,
are
5. Let E, F, G be three vector spaces. Given two linear mappings prove that
ço:E—*F and
and
6. Let E be a vector space of dimension n and consider a system of n linear transformations such that
(i,j=1...n). a) Show that every
has rank 1 a second system with the same property, prove that there exists a linear automorphism t of E such that
b) If
=
t.
a
— 1
7. Given two linear mappings p:
r(q) -
and
: E—>F prove that
r(ço) +
+
Show that the dimensions of the spaces M' (ço), are given by
8. § 2
dimM'(p) dim
(dim F —
(p) in problem 3,
r(p))dimE
((p) = dim ker çø dim F.
9. Show that the mapping
defines a linear isomorphism,
cP:L(E;F)3 L(F*;E*). 10. Prove that c1'M'(ço) =
and = Ml(ço*) where
the notation is defined in problems 8 and 9. Hence obtain the
formula
11. Let p:
r(ço) = r(p*).
be a linear mapping (E, F possibly of infinite dimension). Prove that Im ço has finite dimension if and only if ker 'p has finite codimension (recall that the codimension of a subspace is the dimension 6
Greub, Lineur Algebra
Chapter II. Linear mappings
of the corresponding factor space), and that in this case
codimkerp = dimlmp. 12. Let E and F be vector spaces of finite dimension and consider a bilinear function P in Ex F. Prove that dim E — dim NE = dim F — dim NF
where NE and NF denote the null spaces of P. Conclude that if dim E=dim F. then NE=O if and only if
Chapter III
Matrices In this chapter all vector spaces will be defined over afixed, but arbitrarily chosen field F of characteristic 0.
§ 1. Matrices and systems of linear equations 3.1. Definition. A rectangular array A—_(
(3.1)
)
is called a matrix of n rows and m columns or, in of nm scalars an n x m-matrix. The scalars are called the entries or the elements of the matrix A. The rows (v—_1...n) and therefore are called the
can be considered as vectors of the space row-vectors of A. Similarly, the columns —
...
considered as vectors of the space
(it = 1 ... m)
are called the column-vectors of A.
Interchanging rows and columns we obtain from A the transposed matrix
A*=(
).
(3.2)
In the following, matrices will rarely be written down explicitly as in This notation has the (3.1) but rather be abbreviated in the form A = disadvantage of not identifying which index counts the rows and which the columns. It has to be mentioned in this connection that it would be very undesirable — as we shall see — to agree once and for all to always let
Chapter III. Matrices
the subscript count the rows, etc. If the above abbreviation is used, it will be stated explicitly which index indicates the rows. 3.2. The matrix of a linear mapping. Consider two linear spaces E and With the aid of F of dimensions ii and rn and a linear mapping p: (v 1. . n) and bases = 1. in) in E and in F respectively, every can be written as a linear combination of the vectors vector (1u:=l...rn), . .
.
(v
1... n).
(3.3)
where v In this way, the mapping p determines an n x rn-matrix counts the rows and ,u counts the columns. This matrix will be denoted by M(p, or simply by M(tp) if no ambiguity is possible. Conversely, every n x in-matrix determines a linear mapping p:E-+F by the equations (3.3). Thus, the operator M('p)
M: 'p
defines a one-to-one correspondence between all linear mappings ço:E—*F and all n x rn-matrices.
3.3. The matrix of the dual mapping. Let E* and F* be dual spaces of E and F, respectively, and p: E-+F, a pair of dual mappings. Consider two pairs of dual bases X*V, (v = 1. n) and (/2 1.. . in) of E*, E and F*, F, respectively. We shall show that the two corresponding matrices and M('p*) (relative to these bases) are transposed, i.e., that M('p*) = M((p)*. (3.4) :
. .
The matrices M('p) and M('p*) are defined by the representations 'p
=
and
=
Note here that the subscript v indicates in the first formula the rows of
the matrix and
and in the second the columns of the matrix in the relation
Substituting
=
(3.5)
=
(3.6)
we obtain Now (p
=
YK> =
(3.7)
§ 1. Matrices and systems of linear equations
and
=
(3.8)
The relations (3.6), (3.7) and (3.8) then yield */1_ — V• JL
V
— as stated before — that the subscript v indicates rows of and columns of (ce) we obtain the desired equation (3.4). 3.4. Rank of a matrix. Consider an n x ni-matrix A. Denote by r1 and by r2 the maximal number of linearly independent row-vectors and co-
Observing
lumn-vectors, respectively. It will be shown that r1 =r2. To prove this let E and F be two linear spaces of dimensions n and iii. Choose a basis x. (v 1.. .n) and y,2 (p = 1.. rn) in E and in F and define the linear mapping p: F by (/1X% = Besides
'p, consider the isomorphism f3:
F
F"'
defined by where
y= Then
j3 o p
is a linear mapping of E into F"'. From the definition of fi it into the v-th row-vector,
follows that f3 a p maps
=
/3
Consequently,
the rank of flap
is
equal to the maximal number r1 of
linearly independent row-vectors. Since /3 is a linear isomorphism, has the same rank as p and hence r1 is equal to the rank r of p. Replacing çø by we see that the maximal number r2 of linearly independent column-vectors is equal to the rank of ço*. But (p* has the same rank as ço and thus r1 = r2 = r. The number r is called the rank of the matrix A. 3.5. Systems of linear equations. Matrices play an important role in the discussion of systems of linear equations in afield. Such a system
=
(p = 1... in)
(3.9)
Chapter III. Matrices
of in equations with ii unknowns is called inhomogeneous if at least one is different from zero. Otherwise it is called homogeneous. From the results of Chapter II it is easy to obtain theorems about the existence and uniqueness of solutions of the system (3.9). Let E and F be two linear spaces of dimensions ii and in. Choose a basis (v = I .n) of .
E as well as a basis
(p =
1
. . .
in)
.
of F and define the linear mapping
F by
(p:
= Consider two vectors (3.10)
and
(3.11)
Then (3.12)
Comparing the representations (3.9) and (3. 12) we see that the system (3.9) is equivalent to the vector-equation X
= j.
Consequently, the system (3.9) has a solution if and only if the vector y
is contained in the image-space Im tp. Moreover, this solution is uniquely determined if and only if the kernel of ço consists only of the zero-vector. 3.6. The homogeneous system. Consider the homogeneous system =
0
(p
1... in).
(3.13)
is a From the foregoing discussion it is immediately clear that solution of this system if and only if the vector x defined by (3.10) is contained in the kernel ker p of the linear mapping p. In sec. 2.34 we have shown that the dimension of ker 'p equals n—r where r denotes the rank of 'p. Since the rank of 'p is equal to the rank of the matrix we therefore obtain the following theorem:
A homogeneous system of m equations with n unknowns whose coefficient-
matrix is of rank r has exactly n — r linearly independent solutions. In the special case that the number in of equations is less than the number n of unknowns we have ii— r n — in 1. Hence the theorem asserts that the system (3. 13) always has non-trivial solutions if ni is less than n.
§ I. Matrices and systems of linear equations
87
3.7. The alternative-theorem. Let us assume that the number of equations is equal to the number of unknowns,
=
= 1... n).
(3.14)
Besides (3.14) consider the so-called "corresponding" homogeneous system =0 (3.15) (ii = 1... n).
The mapping introduced in sec. 3.5 is now a linear mapping of the ndimensional space E into a space of the same dimension. Hence we may apply the result of sec. 2.34 and obtain the following alternative-theorem: If the homogeneous system possesses only the trivial solution (0.. .0), the inhomogeneous system has a solution
every choice of the right-
..
hand side. If the homogeneous system has non-trivial solutions, then the inhoinogeneous one is not so/cable for eterv choice of the ;7v(v = . ii). From the last statement of section 3.5 it follows immediately that in the first case the solution of (3.14) is uniquely determined while in the second case the system (3.14) has — if it is solvable at all — infinitely many solutions. 1
.
3.8. The main-theorem. We now proceed to the general case of an arbitrary system
=
(1u
= 1 ... m)
(3.16)
of m linear equations in n unknowns. As stated before, this system has a solution if and only if the vector
y= is
contained in the image-space Im ço. In sec. 2.35 it has been shown that
the space Im p is the orthogonal complement of the kernel of the dual mapping In other words, the system (3.16) is solvable if and only if the right-hand side (p=l...m) satisfies the conditions (3.17)
for all solutions
=I
.. ni)
of the system
(v=1...n). We formulate this result in the following
(3.18)
Chapter III. Matrices
Main-theorem: An inhoniogeneous system of n equations in in unknowns has a solution if and only if every solution 1. in) of the transposed homogeneous system (3.18) satisfies the orthogonality-relation (3.17). . .
Problems 1. Find the matrices corresponding to the following mappings:
a) px=O. b) çox=x. c) px=2x. d)
x=
where
(v =
1,
..., n) is a given basis and in n is a
given number and
2. Consider a system of two equations in n unknowns
Find the solutions of the corresponding transposed homogeneous system.
3. Prove the following statement: The general solution of the inhomogeneous system is equal to the sum of any particular solution of this system and the general solution of the corresponding homogeneous system. 4. Let and be two bases of E and A be the matrix of the basistransformation Define the automorphism c' of E by Prove that A is the matrix of as well with respect to the basis as with respect to the basis 5. Show that a necessary and sufficient condition for the n x n-matrix A= to have rank 1 is that there exist elements and ..., j31 •.., f3fl such that f32 = (v = 1,2, ...,n; = 1,2, ...,n). if A +0, show that the elements cc and 13P are uniquely determined up to = 1. constant factors ). and p respectively, where as 6. Given a basis a linear space E, define the mapping p : p
=
Find the matrix of the dual mapping relative to the dual basis. 7. Verify that the system of three equations:
+ + = 3, —11—4' = 4, + 3ij + 34' = 1
§ 2. Multiplication of matrices
89
has no solution. Find a solution of the transposed homogeneous system which is not orthogonal to the vector (3, 4, 1). Replace the number 1 on the right-hand side of the third equation in such a way that the resulting system is solvable. 8. Let an inhomogeneous system of linear equations be given,
(ii=1,...,in). augmented matrix of the system is defined as the in x (n+ 1)-matrix ..., çi"). Prove that obtained from the matrix by adding the column the above system has a solution if and only if the augmented matrix has the same rank as the matrix (cd). The
§ 2.
Multiplication of matrices
3.9. The linear space of the n x m matrices. Consider the space L(E; F) of all n x rn-matrices. of all linear mappings ço:E—÷F and the set Once bases have been chosen in E and in F there is a 1-1 correspondence between the mappings p: E—÷ F and the n x rn-matrices defined by (3.19)
This correspondence suggests defining a linear structure in the set MnXrn such that the mapping (3.19) becomes an isomorphism. We define the sum of two n x rn-matrices and
A= as
B
the n x rn-matrix
A+B=
+
and the product of a scalar 2 and a matrix A as the matrix 2A
is immediately apparent that with these operations the set is a linear space. The zero-vector in this linear space is the matrix which has only zero-entries. Furthermore, it follows from the above definitions that It
i.e., that the mapping (3.19) defines an isomorphism between L (E; F) and the space X
Chapter III. Matrices
3.10. Product of matrices. Assume that and
are linear mappings between three linear spaces E, F, G of dimensions ii, in and I, respectively. Then /i is a linear mapping of E into G. Select in) and a basis (v I .. ii), (p = .. .1) in each of the three spaces. Then the mappings and i/i determine two matrices and by the relations = 1
. . .
1
and
These two equations yield = Consequently, the matrix of the mapping
ço
relative to the bases x%, and
is given by
(3.20)
The n x 1-matrix (3.20) is called the product of the ii x rn-matrix A = and the rn x /-matrix B= and is denoted by A B. It follows immediately from this definition that
= M(tp)M(t/i).
(3.21)
Note that the matrix M p) of the product-mapping p is the product of the matrices M(ço) and in reversed order of the factors. It follows immediately from (3.21) and the formulas of sec. 2.16 that the matrix-multiplication has the following properties:
A(.)LB1 +pB2)=).AB1 +pAB2 (AB)C = A(BC) (AB)* = B*A*. 3.11. Automorphisms and regular matrices. An ii x n-matrix A is called regular if it has the maximal rank /1. Let 'p be an automorphism of the n-dimensional linear space E and A = M ('p) the corresponding /1 x nmatrix relative to a basis (v = .. n). By the result of section 3.4 the rank of 'p is equal to the rank of the matrix A. Consequently, the matrix A is regular. Conversely, every linear transformation p: E—* E having a regular matrix is an automorphism. 1
.
§ 2. Multiplication of matrices
To every regular matrix A
A' such that
there
exists an in verse matrix, i.e., a matrix
AA' =
=
.1,
where J denotes the unit matrix whose entries are In fact, let cp be the E automorphism of E such that M((p)=A and let be the inverse automorphism. Then = 1
whence
M(p)M(q,)' =
o(p)
= M(i)
J
and
M(ço')M(p)= These
M(t)= J.
equations show that the matrix
A' = is the inverse of the matrix A.
Problems 1. Verify the following properties: a) b)
(L4)*=2A*.
c) 2. A square-matrix is called upper (lower) triangular if all the elements below (above) the main diagonal are zero. Prove that sum and product of triangular matrices are again triangular.
3. Let p be linear transformation such that 'p2 = 'p. Show that there exists a basis in which 'p is represented by a matrix of the form: O...O
1 1
.
rn
O...O
1
o
0
n—rn 0
o n
Chapter III. Matrices
92
4. Denote by A13 the matrix having the entry I at the place (i,j) and zero elsewhere. Verify the formula =
Prove that the matrices form a basis of the space M"
X
Basis-transformation
§ 3.
3.12. Definition. Consider two bases and E. Then every vector (v = 1. ii) can be written as
l...n) of the space
. .
=
(3.22)
Similarly, (3.23)
The two n x n-matrices defined by (3.22) and (3.23) are inverse to each other. In fact, combining (3.22) and (3.23) we obtain — xi,— A
This is equivalent to
5:A = 0
— A
p
and hence it implies that
In a similar way the relations
are proved. Thus, any two bases of E are connected by a pair of inverse matrices. Conversely, given a basis (v = 1. n) and a regular n x n-matrix another basis can be obtained by = . .
To show that the vectors
are linearly independent, assume that
= 0. Then
=0
§ 3. Basis-transformation
and
93
hence, in view of the linear independence of the vectors
Multiplication with the inverse matrix
yields
(K=1...n). 3.13. Transformation of the dual basis. Let E* be a dual space of E, the dual of the basis (v I.. .n). Then the dual basis of and = where
is
(3.24)
a regular n x n-matrix. Relations (3.23) and (3.24) yield
;>.
x%) =
(3.25)
Now xi,> =
and
=
Substituting this in (3.25) we obtain I-'v
This shows that the matrix of the basis-transformation is the inverse of the matrix of the transformation The two basis-transformations and = (3.26) = are called contragradient to each other. The relations (3.26) permit the derivation of the transformation-law
for the components of a vector xeE under the basis-transformation Decomposing x relative to the bases
and
we obtain
and
From the two above equations we obtain in view of (3.26). =
=
(3.27)
Comparing (3.27) with the second equation (3.26) we see that the components of a vector are transformed exactly in the same way as the vectors of the dual basis.
Chapter III. Matrices
94
3.14. The transformation of the matrix of a linear mapping. In this section it will be investigated how the matrix of a linear mapping (p: E—÷ F is changed under a basis-transformation in E as well as in F. Let M(p; xi,, and M (p; be the ii x in-matrices of çø relative = = to the bases xv,, (v = .. in), respectively. Then and .1?, p = 1
.
1
(v=1...n).
and
Introducing the matrices A=
and
of the basis-transformations we then have the relations
-
(3.28)
B= and their inverse matrices,
and
=
=
=
=
(3.29) YK.
Equations (3.28) and (3.29) yield
and we obtain the following relation between the matrices =
and (n): (3.30)
Using capital letters for the matrices we can write the transformation formula (3.30) in the form = A M (p;
M ((p;
It shows that all possible matrices of the mapping p are obtained from a particular matrix by left-multiplication with a regular 11 x n-matrix and right-multiplication with a regular in x in-matrix.
Problems 1. Let f be a function defined in the set of all ii x n-matrices such that
f(TAT1)=f(A) for every regular matrix T. Define the function F in the space L (E; E) by
F (q) =
f (M (ço;
xv))
§ 4. Elementary transformations
95
where E is an n-dimensional linear space and (v = 1.. . n) is a basis of E. Prove that the function F does not depend on the choice of the basis is a linear transformation E—+E having the same 2. Assume that matrix relative to every basis (v = 1. n). Prove that p = 2i where 2 is a scalar. 3. Given the basis transformation . .
= X2
—
x2
—
x3
— X2
X3 = 2x2 + x3
find all the vectors which have the same components with respect to the bases x1, and
1,
§ 4.
2, 3).
Elementary transformations
3.15. Definition. Consider a linear mapping p: Then there exists a basis ..., n)ofE and a basis ..., n) ofFsuch that the corresponding matrix of 'p has the following normal-form:
r (3.31)
b
.
.
where r is the rank of 'p. In fact, let a basis of E such form a basis of the kernel. Then the vectors that the vectors ar+ bQ 'p aQ = 1, ..., r) are linearly independent and hence this system can be extended to a basis (b1, ..., bm) of F. It follows from the construction and that the matrix of 'p has the form (3.31). of the bases 1, ..., n) and 1, ..., m) be two arbitrary bases of Now let E and F. It will be shown that the corresponding matrix M('p; can be converted into the normal-form (3.31) by a number of elementary basis-transformations. These transformations are:
Chapter III. Matrices
(1.1.) Interchange of two vectors and x1(i+j). (1.2.) Interchange of two vectors Yk and Yi (k 1). (11.1.) Adding to a vector an arbitrary multiple of a vector (11.2.) Adding to a vector Yk an arbitrary multiple of a vector Yi (1+ k). it is easy to see that the four above transformations have the following effect on the matrix M((p): (1.1.) Interchange of the rows I andj. (1.2.) Interchange of the columns k and 1. (11.1.) Replacement of the row-vector by (11.2.) Replacement of the column-vector bk by It remains to be shown that every n x rn-matrix can be converted into the normal form (3.31) by a sequence of these elementary matrix-transformations and the operations be the given ii x rn-matrix. 3.16. Reduction to the normal-form. Let otherwise the It is no restriction to assume that at least one matrix is already in the normal-form. By the operations (1.1.) and (1.2.) this element can be moved to the place (1, 1). Then 0 and it is no restriction to assume that = 1. Now, by adding proper multiples of the first row to the other rows we can obtain a matrix whose first column consists of zeros except for Next, by adding certain multiples of the first column to the other columns this matrix can be converted into the form
o...o
1
0*
*
(3.32)
0* if all the elements
*
(v = 2.. .n, R = 2.. rn) are zero, (3.32) is the normal-
form. Otherwise there is an element This can be moved to the place (2,2) by the operations (1.1. and (1.2.). Hereby the first row and the first column are not changed. Dividing the second row by and applying the operations (11.1.) and (11.2.) we can obtain a matrix of the form 1
0
0
1
0 *
00*
*
In this way the original matrix is ultimately converted into the form (3.31.).
§ 4. Elementary transformations
97
3.17. The Gaussian elimination. The technique described in sec. 3.16 can be used to solve a system of linear equations by successive elimination. Let (3.33)
be a system of in linear equations in n unknowns. Before starting the elimination we perform the following reductions: If all coefficients in a certain row, say in the i-th row, are zero, consider the corresponding number on the right hand-side. If the i-th equation contains a contradiction and the system (3.33) has no solution. If the i-th equation is an identity and can be omitted. Hence, we can assume that at least one coefficient in every equation is different from zero. Rearranging the unknowns we can achieve that 40. Multiplying the first equation by — and adding it to the p-th equation we obtain a system of the form 1
+
= (3.34)
which is equivalent to the system (3.33).
Now apply the above reduction to the (rn—. 1) last equations of the system (3.34). If one of these equations contains a contradiction, the system (3.34) has no solutions. Then the equivalent system (3.33) does not have from the a solution either. Otherwise eliminate the next unknown, say reduced system.
Continue this process until either a contradiction arises at a certain step or until no equations are left after the reduction. In the first case, (3.33) does not have a solution. In the second case we finally obtain a triangular system 132+0 (3.35)
which is equivalent to the original system*).
*) If no equations are left after the reduction, then every n-tupie solution of (3.33). 7
Greub. Linear Algebra
...
is a
ChaI)ter I II. \4atrices
The system (3.35) can be solved in a step by step manner beginning
with (3.36)
1
—
Inserting (3.36) into the first (r— 1) equations we can reduce the system to a triangular one of r— equations. Continuing this way we finally obtain the solution of (3.33) in the form 1
(v=1...r)
JLr+ 1
In) are arbitrary parameters.
where the
Problems 1. Two n x ni-matrices C and C' are called equivalent if there exists a regular n x n-matrix A and a regular in x rn-matrix B such that C' = A CB. Prove that two matrices are equivalent if and only if they have the same rank. 2. Apply the Gauss elimination to the following systems: a) —
= 2.
+
b)
2,71+ 172+4173+ 3,71+4,72+ 2,7' + + 5,73 c)
+
2c'+c2
—
= 1,
= 3.
Chapter IV
Determinants In this chapter, except for the last paragraph, all vector spaces will be defined over afixed but arbitrarily chosen field F of characteristic 0.
§ 1. Determinant functions 4.1. Even and odd permutations. Let X be an arbitrary set and denote Let for each 1 by X" the set of ordered p-tuples (x1 Y
be a map from
to a second set, Y. Then every permutation
a new map
acP: X"-* Y
defined by
= It follows immediately from the definitions that (4.1)
and (4.2)
where i is the identity permutation. Now let X = Y= ZL and define cli by cP(x1
=
fl
—
•
x1 E ZL.
i<j
It is easily checked that for every ac/I
=
c,7
where C,7= ± 1. Formulae (4.1) and (4.2) imply that
= and El
= 1.
.
100
IV.
Thus t;
is
a homomorphism from
Determinants
to the multiplicative group — 1. + I }. = (respectively
A permutation a is called eten (respectively odd) if c(7
1
—I).
Since for a transposition i. r= — 1, the transpositions are odd permutations. 4.2. p-linear maps. Let E and F be vector spaces. A p-linear map from E to F is a map 1: E"—+F which is linear with respect to each argument; i.e.. cP(x1
x1,)
F
=)Mx1
A p-linear map from E to F is called a p-linear function in E. As an be linear functions in E and define 1i by example, let j1 P(x1
...
=
A p-linear map k: mutation a
E E.
is called skew symmetric, if for every per-
=.
that is,
= r7P(x1
Every p-linear map II', given by
XJ))
E"—*F determines a skew symmetric p-linear map, = cp. a
In fact, let 'r be an arbitrary permutation. Then formula (4.1) yields
=
a)
a
= W
and so
is skew symmetric.
Proposition I: Let 1i be a p-linear map from E to F. Then the following conditions are equivalent: (i) is skew symmetric. (ii) P(x1 whenever x1 for some pair i4j. (iii) k(x1 whenever the vectors x1 ,...,x1, are linearly dependent. is skew symmetric and that x=xj Assume that Proof:
§ 1. Determinant functions
101
Denote by -r the transposition interchanging i andj. Then, since x1 = xj. (rP)(x1
xv).
On the other hand, since ct is skew symmetric,
=
(-r1)(x1
—
These relations imply that
and so, since F has characteristic zero, cli(x1
Conversely, assume that 1i satisfies (ii). To show that 1i is skew symmetric, fix a pair i, j (i<j) and set W(x, y) = 'Ji(x1
where the vectors
4 1,/) are fixed. Then
W(x,x)=O
XEE.
It follows that W(x, v) +
x) =
+ i, x + v) —
y) = 0
x) —
whence x)
—
E.
x,
¶1'(x, y)
This relation shows that
icP= for any transposition. Since every permutation is a product of trans-
positions, it follows that
i.e..
is skew symmetric.
Assume that satisfies (ii) and let x1 dependent vectors. We may assume that xi,.
xp
Then, by (ii),
be linearly
-
xp1.
=0
Chapter IV. Determinants
102
and so P satisfies (iii). Obviously. (iii) implies (ii) and so the proof is corn plete. CoroIlar%': If dim E=n. then every skew symmetric p-linear map P from E to F is zero if p>n.
Proposition II: Assume that E is an n-dimensional vector space and let P be a skew symmetric n-linear map from E to a vector space F. Then P is completely determined by its value on a basis of E. In particular, if P vanishes on a basis, then = 0. a, of E and write Proof: In fact, choose a basis a1
x)=
(,.= 1 ...
n).
Then çJ5
(x1
.. .
v,,) =
=
1)(a,
"P
1)
=
1)
.
a,,).
Since the first factor does not depend on P, the proposition follows. 4.3. Determinant functions. A determinant function in an n-dimensional vector space E is a skew symmetric n-linear function from E to F. In every n-dimensional vector space E (n 1) there are determinant functions which are not identically zero. In fact, choose a basis, f of the space L(E) and define the n-linear function P by
=
P(x1. ....
...
E E.
is the dual basis in E,
Then. if a1
(4.3)
Now set 4
Then A is a skew symmetric. Moreover, relation (4.3) yields A(a1
and so A
0.
=
§ 1. Determinant functions
103
Proposition III: Let E be an n-dimensional vector space and fix a nonzero determinant function 4 in E. Then every skew symmetric n-linear map ço from E to a vector space F determines a unique vector b E F such that = zl(x1
(p(x1
b.
(4.4)
of E so that zl (a1 = Then the n-linear map i/i: given by
Proof: Choose a basis a1
b=
p(a1
a,1).
= 4(x1
.
1
and set (4.5)
b
agrees with on this basis.Thus, by Proposition II. ,/i = p, i.e., = 4 Clearly, the vector b is uniquely determined by relation (4.4).
.
b.
Corollary: Let zl be a non-zero determinant function in E. Then every determinant function is a scalar multiple of 4.
Proposition IV: Let 4 be a determinant function in E (dim E=n). Then, the following identity holds: XEE, (4.6)
If the vectors x1 are linearly dependent a simple calculation shows that the left hand side of the above equation is zero. On the other hand, by sec. 4.2, 4(x1 Thus we may assume x,, form a basis of E. Then, writing
that the vectors x1
x we
have x1
=
(—
1
4 (xi,, x1
=4(x1
x1,
(4.7)
xv). x.
Problem Let E*, E be a pair of dual spaces and 4+0 be a determinant function in E. Define the function 4* of n vectors in E* as follows: Ifthevectorsx*v(v = .n)arelinearlydependent,then4* (x* 1•• .x*'l)= 0. 1
. .
Chapter I V. Detcrtiiinants
104
Ifthe vectors
(v 1 where
=
.n)are linearly independent, then zi * (x*
1
1
n) is the dual basis. Prove that /1* is a deter-
I
minant function in E*. § 2.
The determinant of a linear transformation
4.4. Definition. Let p be a linear transformation of the n-dimensional linear space E. To define the determinant of (p choose a non-trivial determinant function z1. Then the function defined by /14,
=
(x1 ...
A
x1
...
obviously is again a determinant function. Hence, by the uniquenesstheorem of section 4.3, /14, =
LI,
is a scalar. This scalar does not depend on the choice of A. In fact, if A' is another non-trivial determinant function, then zI'=2A and where
consequently Thus, the scalar
A ,,
=
2
=
is uniquely determined by the transformation p. It is
called the determinant of (p and it will be denoted by det (p. So we have the
following equation of definition: /14,
where A is an arbitrary non-trivial determinant function. In a less condensed form this equation reads = det (p A (x1 ...
A (p X1 ... p
(4.8)
In particular, if (p = 2i, then /14,
=
and hence
det(2i) = It follows from the above equation that the determinant of the identitymap is 1 and the determinant of the zero-map is zero. 4.5. Properties of the determinant. A linear transformation is regular if and only if its determinant is different from zero. To prove this, select a basis (v = 1.. .n) of E. Then A (p e1 ...
p
= det (p A (e1 ... en).
(4.9)
§ 2. The determinant of a linear transformation
If p is regular, the vectors p (v =
1.
. .
105
are linearly independent; hence
n)
(4.10)
Relations (4.9) and (4.10) imply that
+ 0.
det
+ 0. Then it follows from (4.9) that
Conversely, assume that det
Hence the vectors p (v = 1. . n) are linearly independent and Consider two linear transformations and i,Ii of E. Then
is regular.
.
det
det
In particular, if is a linear automorphism and p1 is the inverse automorphism, we obtain
detq1 det(p = deti =
1.
4.6. The classical adjoint. Let E be an n-dimensional vector space and let zi +0 be a determinant function in E. Let çoeL(E; E). Then an n-linear map E)
is given by
v,)x =
px1
j=
E.
.
1
It is easy to check that Ji is skew symmetric. Thus, by Proposition 11,
there is a unique linear transformation, ad(p), of E such that cP(x1
= z1(x1
ad(p)
E;
E
E.
This equation shows that the element ad(p)EL(E; E) is independent of the choice of A and hence it is uniquely determined by 'p. It is called the classical adjoint of'p.
Chapter IV. 1)eterminaiits
106
Proposition V: The classical adjoint satisfies the relations
ad(ço)o(p=1 •detq and i
. det(p.
Proof: Replacing x by pX in (4.14) we obtain x,) x1 = 4(x1
x,
IP
,...,x,) ad
x).
j=1
Now observe that, in view of the definition of the determinant and
Proposition IV.
P1
=det(p j= 1
=detq)
x1EE, XEE.
x
.
Composing these two relations yields
4(x1 ,...,x,) ad (p((px) = det
.
zl(x1 ,...,x,) x .
and so the first relation of the proposition follows. The second relation is established by applying p to (4.12) and using the identity in Proposition IV, with x replaced by (i= ... a). 1
Corollary: If go is a linear transformation with det an inverse and the inverse is given by go1
then go has
det go
Thus a linear transformation of E is a linear isomorphism if and only if its determinant is non-zero. 4.7. Stable subspaces. Let go: E—*E be a linear transformation and assume that E is the direct sum of two stable subspaces,
E=
E1
$E2.
Then linear transformations and
go2:E2—*E2
§ 2. The determinant of a linear transformation
107
are induced by (p. It will be shown that
det(p = detp1detq2.
Define the transformations
and
E—÷E
by
mE1 i
Then (P
and so det(p =
Hence it is sufficient to prove that det
=
det(p1
and
detk//2 = dettp2.
0 be a determinant function in E and h1 ... the function /11, defined by
Let zl
...
be a
basis of E2. Then
p=dimE,
... hqh
is a non-trivial determinant function in E1. Hence
= detp1A1(x1
A1 (Pi x1 ...
On the other hand we obtain from (4.14) ... xi,, b1 ... A1(x1 ... xi,). A (x1
=
bq)
These relations yield det(p1
The second formula (4.13) is proved in the same way.
Problems 1. Consider the linear transformation p:
(v=1...n) where
(v =
1.
.
.n)
is a basis of E. Show that
(4.13)
defined by
(4.14)
I \'.
Deicriiii
2. Let be a linear transformation and assume that E1 is a and stable subspace. Consider the induced transformations Prove that
detp = 3. Let x:E-+F be a linear isomorphism and p be a linear transformation of E. Prove that = detp. 4. Let E be a vector space of dimension ii and consider the space L(E; E) of linear transformations. a) Assume that F is a function in L (E; F) satisfying
F can be written in the form
F(p)= f(detq) wheref:F—+F is a mapping such that
=f(2)f(p). b) Suppose that F satisfies the additional condition that Then, if E is a real vector space,
= detp or F(p) = and if E is a complex vector space F(ço) = detçc.
Hint for part a): Let (i== 1.. .n) be a basis for E and define the transformations and by
v+i v=t and
v=i
.
Show first that =I and that F(ço1)
is
independent of i.
i,j=1...n
§ 3. The determinant of a matrix
4. Let E be a vector space with a countable basis and assume that a function F is given in L (E; E) which satisfies the conditions of problem 3a). Prove that
peL(E;E).
Hint: Construct an injective mapping that
such
and a surjective mapping i/i
=0.
5. Let w be a linear transformation of E such that w2 = i. Show that where r is the rank of the map i — w. — 6. Let j be a linear transformation of E such that = — i. Show that then the dimension of E must be even. Prove that det j = 1. 7. Prove the following properties of the classical adjoint: det w = (
1
(i)
(ii) det (iii) If p has rank n—i, then Im ad((p)=ker cm (iv) If p has rank n—2, then ad(p)=0. (v) 8.
ad(ad p)=(det If n=2 show that
ad(p)=i . trp—p. § 3.
The determinant of a matrix
4.8. Definition. Let ço be a linear transformation of E and sponding matrix relative to a basis (v = 1. . n). Then .
=
'p
Substituting
in (4.8) we obtain A ('p
= det 'p A (e1 ...
... 'p
The left-hand side of this equation can be written as A ('p e1, ... 'p
= =
We thus obtain
A
ep,
r(1)
... c(n)
.A(e ...
en).
the corre-
Chapter IV. Determinants
1 1()
This formula shows how the determinant of is expressed in terms of the corresponding matrix. We now define the determinant of an ii x n-matrix A by
f(n)
detA =
(4.16)
Then equation (4.15) can be written as det(p =
(4.17)
Now let A and B be two n x n-matrices. Then det (A B) = det A det B.
(4.18)
In fact, let E be an n-dimensional vector space and define the linear transformations 'p and of E such that (with respect to a given basis)
M(q)=A and M ('p) M (i/i) = det M p) = det (i/i p) = det M ('p) det M (i/i) = det A det B.
= det 'p det
Formula (4.18) yields for two inverse matrices
detAdet(A1) = detJ =
1
(J unit-matrix)
showing that
det(A1) = (detA)'. Finally note that if an (n x ;i)-matrix A is of the form
A = det
det A2
(4.19)
as follows from sec. 4.7. 4.9. The determinant considered as a function of the rows. If the rows
of the matrix A are considered as vectors of the space = . .. the determinant det A appears as a function of the n vectors (v = n). To investigate this function define a linear transformation 'p of by 1
(v=1...n)
. . .
§ 3. The determinant of a matrix where the vectors
111
are the n-tuples
(v=1...n). Now let A be the deterThen A is the matrix of relative to the basis minant function in r which assumes the value one at the basis (v = 1.. .n),
A
A
A
det
A (a1 ... an).
A
(4.20)
This formula shows that the determinant of A considered as a function of the row-vectors has the following properties: 1. The determinant is linear with respect to every row-vector. 2. If two row-vectors are interchanged the determinant changes the sign.
3. The determinant does not change if to a row-vector a multiple of another row-vector is added. 4. The determinant is different from zero if and only if the row-vectors are linearly independent. An argument similar to the one above shows that
where the bV are the column-vectors of A. It follows that the properties 1—4 remain true if the determinant of A is considered as a function of the column-vectors.
Problems 1. Let A = (cd) be a matrix such that
= 0 if v
2. Prove that the determinant of the n x n-matrix is
= 1 — equal to (n— l)(— Hint. Consider the mapping p: E—*E defined by =
—
(v = 1... ii).
Chapter IV. Determinants define the matrix
3. Given an ii x n-matrix A
B = det A. prove that
4. Given ii complex numbers
det
=
where the numbers 13k are defined by
= cos
uk = Hiizt.
27tk ii
+
2mk fl
(k = 1... n).
Multiply the above matrix by the matrix
Dual determinant functions
§ 4.
4.10. Let E*, E be a pair of dual vector spaces and A* +0, A +0 be determinant functions in E* and E. It will be shown that
x*n)A(xi ...
=
(4.21)
where is a constant scalar. Consider the function Q of 2n vectors defined by Q(x*l ... = det(<x*i,xj>). x1 ...
Then it follows from the properties of the determinant of a matrix that Q is linear with respect to each argument. Moreover, Q is skew symmetric and with respect to the vectors x1 (i= I . .n). with respect to the vectors Hence the uniqueness theorem (sec. 4.3) implies that Q can be written as .
x*fl; x1 ...
= cP(x*' ... x*fl)A(x1 ...
(4.22)
§ 4. Dual determinant functions
depends only on the vectors X*i. Replacing the basis e of E we obtain
where
Q(x*l, ...
e1
...
=
...
in (4.21) by a
... en).
This relation shows that is linear with respect to every argument and skew symmetric. Applying the uniqueness theorem again we find that fJEF.
(4.23)
= f3A*(x*l ... x*fl)A(x1 ...
(4.24)
Combining (4.22) and (4.23) we obtain x1
...
Now let e*i, e.(i= 1...n) be a pair of dual bases. Then (4.24) yields 1
f3A*(e*' ...
...
(4.25)
and so we obtain the relation (4.21). Multiplying (4.24) by The determinant functions A* and A are called dual if the factor in (4.21) is equal to 1; i.e., 1
= det(<x*i,xj>).
(4.26)
To every determinant function A +0 in E there exists precisely one dual determinant function A* in E*. In fact, let be an arbitrary determinant function in E* and set where is the scalar in (4.21). Then A* and A are dual. To prove the uniqueness, assume that and are dual determinant functions to zi. Then we have that x*n)
—
...
...
=0
whence
4.11. The determinant of dual transformations. Let ço: E—3 E and (p*:E*4E* be two dual linear transformations. Then det
= det çø.
(4.27)
To prove this, let A*, A be a pair of dual determinant functions in E* and E. Then we have in view of (4.26) x*n)A(xi ...
= det(<x*i,xj>).
This relation yields ... 8
Greub. Linear Algebra
= det()
Chapter IV. Determinants
and =
...
Since
(i,j = ... n)
<(p* x*i, xJ> = <X*i, (p x1>
1
it follows that = A*(x*l ... x*n)A(cox1 ... (4.28)
But
A*(p*x*l,
and
q,*X*fl) = detco*zl*(x*l ...
= det
A((p X1 ... (p
A (x1 ...
and so we obtain from (4.28) that (det (p* — det co)zl* (x*' ... x*'l)A (x1 ...
=0
whence (4.27)
The above result implies that transposed n x n-matrices have the same determinant. In fact, let A be an n x n-matrix and let (p be a linear transformation of an n-dimensional vector space such that (with respect to a given basis) M(ço)=A. Then it follows that detA* = detM(cp)* = detM((p*) = = det (p* = det (p = det M ((p) = det A.
Problems 1. Show that the determinant-functions, A, 4* of § 1, problem 1 are dual. 2. Using the expansion formula (4.16) prove that,
detA* = detA. §
5. The
adjoint matrix
4.12. Definition. Let (p:E—*E(dim E=ii) be a linear transformation and let ad((p) be the adjoint transformation (cf. sec. 4.6). We shall express the matrix of ad ((p) in terms of the matrix of It is called the adjoint of the matrix of (p. Let a1
a,, be a basis of E such that 4(a1 ad(p)a1 =
I and write
adjoint matrix
§ 5. The
(v= I ...
Then, setting
a)
L15
and x=a1 in the identity (4.14) we obtain ...,
zi(a1.
= zl(a1
whence
=
(i,j= 1 ... ii).
a1,
This equation shows that = det
where
E—*E is the linear transformation given by =
(v
Since the matrix of
i)
(i,j = ...
a, =
1
a)
with respect to the basis a1
-'
a is
given by
+1
1
I
1 1
f—I
i
i±1
f-fl
•..
...
a
CL1-f1
+1•••
1
we have
= det is called the cofactor of Deilnition: The determinant of denoted by Thus we can write
and is
(i,j= la); i.e.. the adjoint matrix is the transpose of the matrix of cofactors. 4.13. Cramer's formula. In view of the result above we obtain from Proposition V. sec. 4.6, the relations =
. detA
(4.36)
and (4.37)
Chapter IV. Determinants
Setting k=i in (4.36) we obtain the expansion formula by cofactors.
(i= I
detA
and define a matrix
Now assume that detA
=
Then these equations yield
(4.38)
n). by setting
detA
is the inverse of the matrix (xi). showing that the matrix From (4.36) we obtain Cramers solution formula of a system of n linear equations in a unknowns whose determinant is non-zero. In fact, let
=
=
a
(4.39)
k=1
be such a system. Then we have, in view of (4.36).
whence
=
=
This formula expresses the (unique) solution of (4.39) in terms of the
cofactors of the matrix A and the determinant of A. Given an (a x ii)-matrix denote for each 4.14. The submatrices pair (Lj) (i= 1 .. a, j = I ... a) by SI the (a — 1) x (a — 1)—matrix obtained from A by deleting the i-th row and the j-th column. We shall show that .
cof
=(—
1)1
+
det
(i, I = 1 ... a).
(4.40)
In fact, by (i—I) interchanges of rows and (j— I) interchanges of columns we can transform 1
into the matrix (cf. sec. 4.12)
§ 5. The
Thus
adjoint matrix
= det
=(
117
—
On the other hand we have, in view of the expansion formula (4.38), with 1= 1
detBl =
and so (4.40) follows. 4.15. Expansion by cofactors. From the relations (4.35) and (4.30) we
obtain the expansion-formula of the determinant with respect to the 1th row detA = (1 = 1... ii). (4.41) By this formula the evaluation of the determinant of n rows is reduced to the evaluation of n determinants of n— 1 rows. In the same way the expansion-formula with respect to the Jth column is proved: + det A = ( det S/ (4.42) (j = 1 ... n).
4.16. Minors. Let A =
be a given ii x in-matrix. For every system
of indices and
the submatrix of A, consisting of the rows 1l'k and the is called a minor of order k of the matrix A. It will be shown that in a matrix of rank r there is always a minor of order r which is different from zero, whereas all minors of order be a minor of order k > r. Then the row-vectors k > r are zero. Let of A are linearly dependent. This implies that the rows of the a,1.. are also linearly dependent and thus the determinant must matrix be zero. It remains to be shown that there is a minor of order r which is different denote by
columns /1•Jk• The determinant of
from zero. Since A has rank r, there are r linearly independent rowvectors a, ..
a. The submatrix consisting of these row-vectors has again
the rank r. Therefore it must contain r linearly independent columnvectors h' ... 1* (cf. sec. 3.4). Consider the matrix Its columnvectors are linearly independent, whence
detA/'j"+O. If A is a square-matrix, the minors det
are called the principal minors of order k.
Chapter IV. Determinants
Problems 1. Prove the Laplace expansioii formula for the determinant of an 1) be a fixed integer. Then
(ii x n)-matrix: Let p (1 det A =
det
v1,) det A"
c (v1
where
= B'"
+
and
= 2.
(ii)
— 1)'
1
h, be two bases of a vector space E and a, and h1 1) be given. Show that the vectors can be reordered
Let a1
let p(l such that (i)
(v,—i) (
hr,, is a basis of E, is also a basis of E.
a1
h,,
3. Compute the inverse of the following matrices. 11
1
1
1
—1
1
1
—1 —1 1
—1 1
21 21 B= 2
4. Show that a)
xaa...a
a x a...a det
:
:
a...ax
= [x + (n —
1)
a] (x —
— 1
§ 5. The acijoint matrix
and that
r1
b)
...
1
1
22
det
... 2
1 1
—1
1
—1
Show
(n>2)
that
z11=x1; z12=x1x2+1. 6. Verify the following formula for a quasi-triangular
x11...x1 p
O....O
determinant:
xp+1p+1....xp+ln
o....o I
=
det
xnl 7.
xnn
det
xnp+1
Prove that the operation
properties: a) ad (A B)= ad B ad A. b) det ad A = (det c) ad ad A=(det
A =(det
xnn
_.)
1)2
(cf. sec.4.12) has the following
Chapter IV. Determinants
12()
§ 6.
The characteristic polynomial
4.17. Eigenvectors. Consider a linear transformation 'p of an n-dimensional linear space E. A vector a+O of E is called an eigenvector of 'p if 'p a =
2
a.
The scalar 2 is called the corresponding eigen value. A linear transformation (p need not have eigenvectors. As an example let E be a real linear space of two dimensions and define 'p by
(px1=x2 çox2=—x1 the vectors x1 and x2 form a basis of E. This mapping does not have eigenvectors. in fact, assume that where
a=
x1
+
is an eigenvector. Then pa=2a and hence These
equations yield
whence
+
=
and
4.18. The characteristic equation. Assume that a is an eigenvector of 'p and that 2 is the corresponding eigenvalue. Then
'pa=2a,
a+O.
This equation can be written as ('p — 2i)a = 0
(4.43)
showing that p—21 is not regular. This implies that det('p — 2i) = 0.
(4.44)
Hence, every eigenvalue of 'p satisfies the equation (4.44). Conversely, assume that 2 is a solution of the equation (4.44). Then 'p—2i is not regular. Consequently there is a vector a+O such that ('p — 2i)a = 0,
whence 'pa=2a. Thus, the eigenvalues of'p are the solutions of the equation (4.44). This equation is called the characteristic equation of the linear transformation 'p.
§ 6. The characteristic polynomial
121
4.19. The characteristic polynomial. To obtain a more explicit expression for the characteristic equation choose a determinant function A +0 in E. Then
=
A(px1 — Ax1 ... çox, —
=
1
det(ço
—
Ai)A(x1
... n).
(4.45)
Expanding the left hand-side we obtain a sum of
terms of the form
A(z1 ...
Denote by the sum of all terms in which p arguments are equal to and il—p arguments are equal to Collect in each term of Si,, the indices (v1 <
such that
and the indices
=—
=
—
Introducing the permutation a by
(i= in) we can write
= = =
A (z1 ...
... —
—
...
(—
xa(p+ 1)
Thus,
=
(4.46)
...
(—
where the sum is extended over all permutations a subject to the conditions
a(l)<...
=
(,—
(4.47)
where the sum on the right hand-side is taken over all permutations. Let be the function defined by =
...
...
(0
p n)
Chapter IV. Determinants
and -r be an arbitrary permutation of (1 .. ./1). Then
=
Xta(l)
A
=
A
=
Xrc(p + 1)
Xta(p), Xra(p + 1)
1)
A
Xra(fl))
1)
...
=
This equation shows that ments. This implies that =
is skew symmetric with respect to all argu(4.48)
—
(—
where ce,, is a scalar. Inserting (4.48) into (4.47) we obtain
= Hence, the left hand-side of (4.45) can be written as A((px1 — 2x1, ...
= A(x1 ...
—
(4.49)
Now equations (4.45) and (4.49) yield det (p —
2 i)
=
ce,,
—"
p=o
showing that the determinant of —2 i is a polynomial of degree n in 2. This polynomial is called the characteristic polynomial of the linear transformation p. The coefficients of the characteristic polynomial are determined by equation (4.48), and are called the characteristic coefficients. These relations yield for p = 0 and p = n
= (—
and ; = detq
respectively.
4.20. Existence of eigenvalues. Combining the results of sec. 4.18 and 4.19, we see that the eigenvalues of 'p are the roots of the characteristic polynomial
f(2) = This shows that a linear transformation of an n-dimensional linear space has at most n d!fferent eigen values.
§ 6. The characteristic polynomial
123
Assume that E is a complex linear space. Then, according to the fundamental theorem of algebra, the polynomialf has at least one zero. Consequently, every linear transformation of a complex linear space has at least one eigen value.
if E is a real linear space, this does not generally hold, as it has been shown in the beginning of this paragraph. Now assume that the dimension of E is odd. Then
lirnf(2)=+oo
and
and thus the
must have at least one zero. This proves that a linear transformation of an odd-dimensional real linear space has at least one eigen value. Observing that
f(O)=
=
detço
we see that a linear transformation of positive determinant has at least one positive eigenvalue and a linear transformation of negative determinant has at least one negative eigenvalue, provided that E has odd dimension. If the dimension of E is even we have the relations
lim f
=
urn f
and
= oo
A—' —03
and hence nothing can be said if det co>0. However,
if det p<0,
there
exists at least one positive and one negative eigenvalue. 4.21. The characteristic polynomial of the inverse mapping. It follows from (4.27) that the characteristic polynomial of the dual transformation coincides with the characteristic polynomial of 'p. Suppose now that where E1 and 122 are stable subspaces. Then the result of sec. 4.7 implies that the characteristic polynomial of 'p is the product of the characteristic polynomials of the induced transformations 'Pi : E1 and 'P2 Finally, let p: E—÷E be a regular linear transformation and consider the
inverse transformation p'. The characteristic polynomial of p' is defined by
F(2) = det('p1 Now, —
2i =
'p'
—
— 2'p) = — 2co_1
— )_1
Chapter IV. Determinants
124
whence
det((p'
—
2i) =
—
(—
).' i).
This equation shows that the characteristic polynomials of are related by F(2) = (— Expanding Fe.) as -
F (2) = we
and of
obtain the following relations between the coefficients of f and of F:
(v=0...n). 4.22. The characteristic polynomial of a matrix. Let e%(v = 1.. ii) be a basis of E and A = be the matrix of the linear transformation relative to this basis. Then M(p — 2t) =
—
2M(i) =
A
—
whence
det ('p — 2 i) = det M ('p — 2 i) = det (A — 2 J).
Thus, the characteristic polynomial of 'p can be written as
f
= det (A —
2
J).
(4.50)
The polynomial (4.50) is called the characteristic polynoiiiial of tile matrix A. The roots of the polynomialf are called the eigenvalues of the matrix A.
Problems 1. Compute the eigenvalues of the matrix
/1
0
\i
—1
3
(3 —2 —l 1
2. Show that the eigenvalues of the real matrix / ci
are real.
§ 6. The characteristic polynomial 3.
125
Prove that the characteristic polynomial of a projection
(see Chapter II, sec. 2.19) is given by —
= (— where n
dim E and p = dim E1.
4. Show that the coefficients of the characteristic polynomial of an involution satisfy the relations
(p=O...n). 5. Consider a direct decomposition Given linear transfor(i = 1,2) consider the linear transformation ço = mations E—÷ E. Prove that the characteristic polynomial of 'p is the product of the characteristic polynomials of and of 'pa.
6. Let ço:E—*E be a linear transformation and assume that E1 is E1 a stable subspace. Consider the induced transformations and Prove that :
X
Xi X
Xi and denote the characteristic polynomials of 'p, respectively. In particular show that where
and
=(
is the induced transformation of E/ker 'p and s denotes the dimension of ker 'p. 7. A linear transformation, p, of E is called nilpotent if ç0k=0 for some k. Prove that 'p is nilpotent if and only if the characteristic polynomial has the form where
x (2) = (—
Hint: Use problem 6. 8. Given two linear transformations 'p and cli of E show that det('p — Açli) is a polynomial in 2. 9. Let 'p and cl' be two linear transformations. Prove that 'pot/i and have the same characteristic polynomial. Hint: Consider first the case that is regular.
Chapter IV. Determinants
26
§
7. The trace
4.23. The trace of a linear transformation. In a similar way as the determinant, another scalar can be associated with a given linear transformation (p. Let 44z0 be a determinant function in E. Consider the sum
This sum obviously is again a determinant function and thus it can be written as (4.51)
is a scalar. This scalar which is uniquely determined by 'p is called the trace of 'p and will be denoted by tr 'p. It follows immediately that where
the trace depends linearly on p, tr(2ço +
= Atr'p +
Next we show that =
(4.52)
for any two linear transformations 'p and i/i. The trace of by the equation ...
A (x1 ...
Replacing the vectors
= tr
0p)A (x1 ...
l...n)
by
we
p
E
is defined
E.
obtain (4.53)
=
The left hand-side of this equation can be written as A
x1
...
o 'p
o
x1...
= det
A (x1 ... ('p
...
= and thus (4.53) implies that
=
(4.54)
If is regular, this equation may be divided by det cli yielding (4.52). If cl' is non-regular, consider the mapping t/i —). t where is different from all
§7. The trace
eigenvalues
of
Then
tr
1/I
127
—21 is regular, whence
-21)].
-1 i) q] = tr
In view of the linearity of the trace-operator this equation yields tr(110(p) — 2trp = — 2tr(p whence (4.52). Finally it will be shown that the coefficient of 2" in the characteristic
polynomial of p can be written as (4.55)
=(— Formula (4.48) yields for p = ...
= (—
(4.56)
A (x1 ...
the sum being taken over all permutations a subject to the restrictions This sum can be written as 1
(
A
x1 ...
...
A (x1 ...
=
x1,
1
We thus obtain from (4.56) =
(—
(4.57)
Comparing the relations (4.57) and (4.51) we find (4.55). = 1.. .n) be a basis of E. Then q 4.24. The trace of a matrix. Let determines an ii x n-matrix by the equations (4.58)
Inserting
l...n) in (4.51) we find = trcoA(e1
(4.59)
Equations (4.58) and (4.59) imply that
=
A(e1 ...
A(e1 ...
whence (4.60)
Observing that
=
çü e%>,
Chapter IV. Determinants
12g
where e*%' (v = 1 .. ii)
is the dual basis of
we can rewrite equation
(4.60) as tr çø =
(4.61)
<e*1, ço e>.
Formula (4.60) shows that the trace of a linear transformation is equal to the sum of all entries in the main-diagonal of the corresponding matrix. For any ii x n-matrix A this sum is called the trace of A and will be denoted by tr A, (4.62)
Now equation (4.60) can be written in the form
tr(p = trM(p).
4.25. The duality of L(E; F) and L(F; E). Now consider two linear spaces Eand Fand the spaces L(E; F) and L(F; E) of all linear mappings With the help of the trace a scalar product can be p:E—÷F and introduced in these spaces in the following way: q7EL(E; F),
=
E).
(4.63)
The function defined by (4.63) is obviously bilinear. Now assume that (4.64)
for a fixed mapping coeL(E; F) and all linear mappings /ieL(F; E). It has to be shown that this implies that ço=O. Assume that 'p+O. Then Extend the vector b1 =pa to there exists a vector aEE such that a basis (b1 .
.
.bm)
of F and define the linear mapping i/i: F—>E by
(p=2...in).
Then
=0
= b1,
= 2... in),
whence
=
=
= 1.
This is in contradiction with (4.64). Interchanging E and F we see that the relation
for a fixed mapping /ieL(F; E) and all mappings peL(E; F) implies that Hence, a scalar-product is defined in L(E; F) and L(F; E) by (4.63).
§7. The trace
129
Problems 1. Show that the characteristic polynomial of a linear transformation of a 2-dimensional linear space can be written as
f()) = )2 Verify that every such
satisfies (p2 —
— 2trço + detçD.
its characteristic equation,
(ptr(p + ldet(p = 0.
2. Given three linear transformations 'p, i/i,
of E show that
tr(yoç/ioço) + in general. 3. Show that the trace of a projection operator ir:E—+E1 II sec. 2.19) is equal to the dimension of Im it.
(see
Chapter
4. Consider two pairs of dual spaces E*, E and F*, F. Prove that the spaces L (E; F) and L (E*; F*) are dual with respect to the scalar-product defined by = F*). (pEL(E; F)
5. Letf be a linear function in the space L(E; E). Show thatf can be written as
f((p) = is a fixed linear transformation in E. Prove that is uniquely determined by f 6. Assume thatf is a linear function in the space L(E; E) such that where
Prove that
f(ço)=2tr(p where 2 is a scalar. 7. Let and be two linear transformations of E. Consider the sum
i*j
A (x1 ... (p Xi ... cli x1...
where A+O is a determinant function in E. This sum is again a determinant function and hence it can be written as i4j 9
A (x1
Linear Algebra
(p
...
cli
x1 ...
= B (p, cl') A (x1 ...
Chapter IV. Determinants
I 3()
By the above relation a bilinear function B is defined in the space L (E; E). Prove: a) B(p, p tr b) IB((p, (p)=(— where is the coefficient of 2P12 in the characteristic polynomial of çø. c)
=
—
8. Consider two ii x n-matrices A and B. Prove the relation tr(A B) = tr(BA)
a) by direct computation.
b) using the relation tr p=tr M(p). 9. If çø and are two linear transformations of a 2-dimensional linear space prove the relation +
=
+
+
—
10. Let A:L(E; E)—÷L(E; E) be a linear transformation such that
A
a 2-dimensional vector space and p be a linear transformation of E. Prove that ço satisfies the equation p2= —2i, 2>0 if and
only if
detço>0 and trp=0. 12. Let ço:E1—*E1 and
be linear transformations. Consider
=
Prove that tr ço=tr +tr P2• be a linear transformation and assume that there is a 13. Let into subspaces such that decomposition (1= l...r). Prove that tr q=0. be linear maps between finite dimen14. Let p: and /i: a sional vector spaces. Show that tr ((p /1) = )-th I 5. Show that the trace of ad ((p) (cf. sec. 4.6) is the negative (ii characteristic coefficient of 1
§ 8. Oriented vector spaces
§ 8.
131
Oriented vector spaces
In this paragraph E will be a real vector space of dimension n 1. 4.26. Orientation by a determinant function. Let A1 + 0 and A2 + 0 be two determinant functions in E. Then A2=2A1 where 2+0 is a real number. Hence we can introduce an equivalence relation in the set of all determinant functions A +0 as follows: if
2>0.
it is easy to verify that this is indeed an equivalence. Hence a decomposition of all determinant functions A +0 into two equivalence classes is induced. Each of these classes is called an orientation of E. If (A) is an orientation and A e (A) we shall say that A represents the given orientation. Since there are two equivalence classes of determinant functions the vec-
tor space E can be oriented in two different ways. A basis (v = n) of an oriented vector space is called positive if 1 . . .
where A is a representing determinant function. If (e1 .. is a positive basis and a is a permutation of the numbers (l...n) then the basis (eat!)... ea(fl)) is positive if and only if the permutation a is even. Suppose now that E* is a dual space of E and that an orientation is defined in E. Then the dual determinant function (cf. sec. 4.10) determines an orientation in E*. it is clear that this orientation depends only on the orientation of E. Hence, an orientation in E* is induced by the orientation of E. .
4.27. Orientation preserving linear mappings. Let E and F be two oriented vector spaces of the same dimension n and be a linear isomorphism. Given two representing determinant functions AE and AF defined by in E and F consider the function x1, ...,
= Clearly
is again a determinant function in E and hence we have that =
2+0 is a real number. The sign of 2 depends only on p and on the given orientations (and not on the choice of the representing determinant functions). The linear isomorphism çø is called orientation preserving if where
Chapter IV. Determinants
132
).>O. The above argument shows that, given a linear isomorphism and an orientation in E, then there exists precisely one orientation in F such that
preserves the orientation. This orientation will be called the orientation induced by ço. Now let be a linear automorphisni; i.e., F=E. Then we have AF=AF and hence it follows that = det(p.
This relation shows that a linear automorphism
preserves the
orientation if and only if det ço >0. As an example consider the mapping ço= —i. Since det(— i) = (— 1)'
it follows that ii is even.
preserves the orientation if and only if the dimension of
4.28. Factor spaces. Let E be an orientated vector space and F be an oriented subspace. Then an orientation is induced in the factor space E/F in the following way: Let A be a representing determinant function
in E and a1 .
.
be a positive basis of F. Then the function A (a1 ... ap,
depends only on the classes are equivalent mod F. Then
+
EE
1
in fact, assume for instance that
and
)p+1 = Xp+i +
and we obtain A (a1 ...
a
•..
A
=
A
(a1 ...
of (n—p) vectors in E1'F is well defined by
=
...
(4.65)
it is clear that 21 is linear with respect to every argument and skew symmetric. Hence A is a determinant function in ElF. It will now be shown that the orientation defined in E/F by A depends only on the orientations of E and F. Clearly, if A' is another representing determinant function in
§ 8. Oriented vector spaces
133
E we have that A'
2A, 2>0 and hence A' = 221. Now let another positive basis of F. Then we have that
>0
= whence A (a'1 ...
a,
.. .a,) be
=
1
A (a1 ...
1
It follows that the function A' obtained from the basis a'1 . . .a, is a positive multiple of the function A obtained from the basis a1... a direct decomposition
E=E1E13E2
(4.66)
and assume that orientations are defined in E1 and E2. Then an orientation is induced in E as follows: Let l...p) and l...q) be positive bases of E1 and E2 respectively. Then choose the orientation of E such that the basis a1 . b1 . . .bq is positive. To prove that this orientation depends only on the orientations of E1 and E2 let (i= I .. .p) and (1= 1... q) be two other positive bases of E1 and E2. Consider the linear transformations p:E1—+E1 and defined by .
(i=1...p) Then the transformation basis (a1..
b1
. .
(j=1...q).
and
carries the basis
bi...bq) into the
Since det ço >0 and det i/i >0 it follows from sec. 4.7
.bq).
that
>0
det(p
hi...hq) is again a positive basis of E. and hence Suppose now that in the direct decomposition (4.66) orientations are given in Eand E1. Then an orientation is induced in E2. In fact, consider the projection it:E—÷E2 defined by the decomposition (4.66). It induces an isomorphism
p:E/E1 4E2. In view of sec. 4.28 an orientation in E/E1 is determined by the orientations of E and E1. Hence an orientation is induced in E2 by p. To describe this orientation explicitly let A be a representing determinant function in E and e1
ep be a positive basis of E1. Then formula (4.65)
implies that the induced orientation in E2 is represented by the determinant function A2
...
=
A (e1
...
... yb),
(4.67)
Chapter IV. Determinants
134
Now let ..., be a positive basis of E7 with respect to the induced orientation. Then we have
and hence formula (4.67) implies that 4(e1 ... It follows that the basis e1 ...
of E is positive. In other words,
1
the orientation induced in E by E1 and 122 coincides with the original orientation. The space 122 in turn induces an orientation in E1. It will be shown that this orientation coincides with the original orientation of E1 if and only if p (n —p) is even. The induced orientation of E1 is represented by the determinant-function A1(x1 ...
=
...
...
(4.68)
where eA(2—p+ 1, ...n) is a positive basis of E2. Substituting (v
1.. .n) in equation (4.68) we find that
A1(e1 ...
=
But e)(i.=p+ I
...
...
= (— 1)
...
en).
(4.69)
n) is a positive basis of E2 whence
...
(4.70)
It follows from (4.69) and (4.70) that A1(e1 ...e")
c>
0
if p(n — p) is even if p(n—p)is odd.
(4.71)
is positive with respect to the original orienSince the basis of tation, relation (4.71) shows that the induced orientation coincides with the original orientation if and only if p(n—p) is even. 4.30. Example. Consider a 2-dimensional linear space 12. Given a basis (e1, e2) we choose the orientation of E in which the basis e1, e2 is positive. Then the determinant function A, defined by
zl(e1,e2) =
1
1,2) generrepresents this orientation. Now consider the subspace 1,2) with the orientation defined by Then E1 induces in ated by 122 the given orientation, but E2 induces in E1 the inverse orientation.
§ 8. Oriented vector spaces
135
In fact, defining the determinant-functions A1 and A1 (x)
A (e2,
x)
xe E1,
A2 (x) = A
and
A2 in E1 and in E2 by (e1,
x)
x e E2
we find that
4.31.
A2(e2) = A(e1, e2) =
1
Intersections. Let E1
and E2 be
and
A1 (e1) =
A(e2,
e1) = —
two subspaces of E
E = E1 + E2
1.
such
that (4.72)
and assume that orientations are given in E1, E2
and E. It
will be shown
that then an orientation is induced in the intersection E12=E1 n
E2.
Setting
dimE1 = p,
dimE2 = q,
dimE12 = r
we obtain from (4.72) and (1.32) that
r= p + q — n. Now consider the isomorphisms ço:E/E1 and Vi:E/E2
E1/E12.
Since orientations are induced in E/E1 and E/E2 these isomorphisms determine orientations in E2/E12 and in E1/E12 respectively. Now choose two positive bases +1• a,, and hr . bq in E1/E12 and E2/E12 respecand bJEE2 be vectors such that tively and let .
and
where it1 and
it2
denote the canonical projections and
ir2:E2—+E2/E12.
Now define the function A12 by A12 (z1 ... Zr) = A (Z1 ... Zr, ar+ 1
a,,, br+ 1 .. bq).
(4.73)
In a similar way as in sec. 4.30 it is shown that the orientation defined in depends only on the orientations of E1, and E (and not on E12 by the choice of the vectors and ba). Hence an orientation is induced in E12.
Chapter IV. Determinants
Interchanging E1 and E2 in (4.73) we obtain
(:i
•..
(:i
=A
r,
br+ 1
bq,
1
ar).
(4.74)
Hence it follows that =
(q-r)4
1)(P_r)
(n-q)4
= (_
(475)
Now consider the special case of a direct decomposition. Then p+q=n and E12=(0). The function /112 reduces to the scalar (4.76)
Moreover the number—2 depends
It follows from (4.76) that
only on the orientations of E1, E2 and E. It is called the intersection number
of the oriented subspaces E1 and E2. From (4.75) we obtain the relation =(
= 1.. ii) be two bases of E. Basis deformation. Let and is called deformable into the basis if there exist n Then the basis continuous mappings 4.32.
t t1
t
satisfying the conditions 1. (t0) = and (t1) = (t) (v = 2. The vectors 1
The
.
.11) are
linearly independent for every fixed t.
deformability of two bases is obviously an equivalence relation.
Hence, the set of all bases of E is decomposed into classes of deformable bases. We shall now prove that there are precisely two such classes. This is a consequence of the following Theorem: Two bases and (v = 1.. ./1) are deformable into each other if and only if the linear transformation p: E defined by 'p = has positive determinant.
Proof: Let 4+0 be an arbitrary determinant function. Then formula lii) are 4.17 together with the observation that the components continuous functions of shows that the mapping Ex x E—*R defined by A is continuous. into the is a deformation of the basis Now assume that basis Consider the real valued function (t) ...
§ 8. Oriented vector spaces
137
The continuity of the function 4 and the mappings
the function Ji
is
implies that
continuous. Furthermore,
ck(t)+0 the vectors (t) (v = I .n) are linearly independent. Thus the function cP assumes the same sign at t=t0 and at t=t1. But because
. .
= 4(pa1 ...
= A(b1
= det(pA(a1 ...
=
whence
detço >0 and so the first part of the theorem is proved. 4.33. Conversely, assume that the linear transformation a deformation assume first that the vector n-tuple (a1 ...
...
(4.77)
1). Then consider the de-
is linearly independent for every 1(1 composition = By the above assumption the vectors (a1..
are linearly independ-
ent, whence /3" + 0. Define the number c,, by
1+1 if if
L—1
It will be shown that the n mappings
Ix,(t)=a.(v=1...n—1) = define
(1 —
+
(0
a deformation
(a1... a determinant function in E. Then
4 (x1 (t) ... Since
(t)) = ((1
—
t) +
t) A (a1 ... an).
it follows that
(0t1)
Chapter IV. Determinants
138
whence
(0 t 1).
+0
(t) ...
zi
This implies the linear independence of the vectors
(t)(v =
1 . .
ii) for
every t.
In the same way a deformation
(a1...
(a1 ...
can be constructed where tain a deformation (a1 ...
—÷
1= ± I. Continuing this way we finally ob-
b1 ... c,1
= ±
1
(v
1 ... n).
To construct a deformation (b1 ...
(e1 b1 ...
consider the linear transformations
(v=1...n) and
(v=1...n). The product of these linear transformations is given by
(v=1...n). By hypothesis,
det(i/iop)>O
(4.78)
detp>O.
(4.79)
and by the result of sec. 4.32 Relations (4.78), and (4.79) imply that > 0.
det But whence
+1. Thus, the number of equal to — is even. Rearranging the vectors (v = 1.. n) we can achieve that 1
.
5—i
vl+i
(v=1...2p)
(v=2p+1...n).
§ 8. Oriented vector spaces
139
Then a deformation b1
...
e,,
-÷ (b1 ...
is defined by the mappings
+
=— =—
(v — —
1
—
(v=2p+1...n) 4.34. The case remains to be considered that not all the vector n-tuples (4.77) are linearly independent. Let A + 0 be a determinant function. The linear independence of the vectors (v = 1 . n) implies that . .
Since zl is a continuous function, there exists a spherical neighbourhood that Ua
(v= 1...n).
if XvEUa
Choose a vector a'1 e Uaj which is not contained in the (n — 1)-dimensional subspace generated by the vectors (b2. . Then the vectors (a'1, b2.. are linearly independent. Next, choose a vector a'2 E Ua2 which is not con-
tained in the (n— 1)-dimensional subspace generated by the vectors (a'1, b2. Then the vectors (a'1, a'2, b3. are linearly independent. Going on this way we finally obtain a system of n vectors (v = 1.. n) .
.
.
such that every n-tuple ...
(a'1
is
linearly independent. Since
Hence the vectors
(1= 1 ... ;i)
it follows that
(v = 1. . n) form a basis of E. The n mappings .
define a deformation (4.80)
In fact,
(t)(0 t
1) is contained in Uav whence A
(t) ...
(t)) + 0
(0
t
This implies the linear independence of the vectors
1).
(t)(v = 1.. .n).
140
Chapter IV. Determinants
By the result of sec. 4.33 there exists a deformation ...
... ba).
(4.81)
The two deformations (4.80) and (4.81) yield a deformation (a1 ...
... ba).
This completes the proof of the theorem in sec. 4.32. 4.35. Basis deformation in an oriented linear space. If an orientation is given in the linear space E, the theorem of sec. 4.32 can be formulated as and (v = I n) can be deformed into each other follows: Two bases if and only if they are both positive or both negative with respect to the given orientation. In fact, the linear transformation . .
p:
.
(v = I ... a)
—*
has positive determinant if and only if the bases and b%, (v = I .. are both positive or both negative. Thus the two classes of deformable bases consist of all positive bases and all negative bases. 4.36. Complex vector spaces. The existence of two orientations in a
real linear space is based upon the fact that every real number 2t0 is either positive or negative. Therefore it is not possible to distinguish two orientations of a complex linear space. In this context the question arises whether any two bases of a complex linear space can be deformed into each other. It will be shown that this is indeed always possible. Consider two bases and (v = a) of the complex linear space E. As in sec. 4.33 we can assume that the vector n-tuples 1
(a1...
. .
...
are linearly independent for every 1(1 1). It follows from the above assumption that the coefficient in the decomposition = is
different from zero. The complex number
Now choose a positive continuous function
r(0) =
1,
r(I) = r
can
be written as
1) such that (4.82)
§ 8. Oriented vector spaces
and a continuous function
1) such that
(t)(O t
(4.83)
Define mappings
(t),
(0
t 1)
(v =
=
by 1 ...
n — 1) )
and (t)
=t
Then the vectors (t) (v = fact, assume a relation
1 ..
(4.84)
1.
t
flV
+ r(t) .
n)
are linearly independent for every t. In
0. Then
+
r (t)
+
=
0
whence
(v==1...n—1) and = 0.
1, the last equation implies that )J' = 0. r (t) + 0 for 0 t (n— 1) equations reduce to in— 1). It follows from (4.84), (4.82) and (4.83) that
Since
Hence the
first
=
and
=
Thus the mappings (4.84) define a deformation (a1 ...
—÷
Continuing this way we obtain after 1...n). into the basis
(a1 n
...
ba).
steps a deformation of the basis
Problems 1. Let E be an oriented n-dimensional linear space and
(v = 1.. .11) be
the subspace generated by the vectors a positive basis; denote by is positive with respect Prove that the basis (x1 to
the orientation induced in
by the vector
l)i —
1
xL.
Chapter IV. Determinants
142
2. Let E be an oriented vector space of dimension 2 and let a1, a2 be two linearly independent vectors. Consider the 1-dimensional subspaces E1 and E2 generated by a1 and a2 and define orientations in E. such that the bases a are positive (i= 1,2). Show that the intersection number of E1 and E2 is + 1 if and only if the basis a1, a2 of E is positive.
3. Let E be a vector space of dimension 4 and assume that (v
= ... 1
4)
is a basis of E. Consider the following quadruples of vectors:
I. e1+e2,e1+e2+e3,e1+e2+e3+e4,e1—e2+e4 II. e1+2e3, e2+e4, e2—e1+e4, e2
III.
e2+e4, e3+e2, e2—e1
1V.
e1+e2—e3, e2—e4, e3+e2, e2—e1
V. e1—3e3, e2+e4, e2—e1—e4, e2. a) Verify that each quadruple is a basis of E and decide for each pair of bases if they determine the same orientation of E. b) If for any pair of bases, the two bases determine the same orientation, construct an explicit deformation. c) Consider E as a subspace of a 5-dimensional vector space E and assume that (v = 1, . .5) is a basis of E. Extend each of the bases above to a basis of which determines the same orientation as the basis (v= 1, ..., 5). Construct the corresponding deformations explicitly. 4. Let E be an oriented vector space and let E1, E2 be two oriented subspaces such that E== E1 + E2. Consider the intersection E1 fl E2 together with the induced orientation. Given a positive basis (c1, ..., Cr) of extend it to a positive basis (c1, ..., Cr, ar+ E1 fl a positive basis (C1, ..., Cr, br+ i, ..., bq) of E2. Prove that then (C1, ..., Cr, ar+ 1' ..., ap, br+ i, ..., bq) is a positive basis of E. .
5. Linear isotopices. Let E be an n-dimensional real vector space. will be called linearly Two linear automorphisms p: and i/i: (I the closed unit isotopic if there is a continuous map 1: I x and such that for each interval) such that x)=p(x), x) is a linear automorphism. tEl the map given by (i) Show that two automorphisms of E are linearly isotopic if and only if their determinants have the same sign. (ii) Let j: E—+E be a linear map such that = — Show that j is linearly isotopic to the identity map and conclude that detj= 1. 6. Complex structures. A complex structure in real vector space E is a linear transformation j: E—+E satisfying j2 = — 1.
§8. Oriented vector spaces
143
(i) Show that a complex structure exists in an n-dimensional vector space if and only if ii is even. (ii) Let j be a complex structure in E where dimE=2n. Let 4 be a determinant function. Show that for (v= 1 ... 11) either 4(x1
or 4(x1 ,...,x,1,jx1 The natural orientation of (E, J) is
defined to be the orientation re-
presented by a non-zero determinant function satisfying the first of these.
Conclude that the underlying real vector space of a complex space carries a natural orientation. (iii) Let be a vector space with complex structure and consider the complex structure (E, —j). Show that the natural orientations of and (E, —j) coincide if and only if n is even (dimE=2n).
Chapter V
Algebras In paragraphs one and two all vector spaces are defined over a fixed, but arbitrarily chosen field F of characteristic 0.
§ 1. Basic properties 5.1. Definition: An algebra, A, is a vector space together with a mapping A x such that the conditions (M1) and (M2) below both hold. The image of two vectors xeA, yeA, under this mapping is called the product of x and y and will be denoted by xy. The mapping A x A-+A is required to satisfy: (M1) (M2)
(2x1 + jix2)y = 2(x1 y) + ,u(x2y) + 11y2)
2(xy1) + ji(xy2).
As an immediate consequence of the definition we have that
0x = x0 0. Suppose B is a second algebra. Then a linear mapping p : a homomorphism (of algebras) if çø preserves products; i.e.,
p(xy)=pxpy.
is called (5.1)
A homomorphism that is injective (resp. surjective, bijective) is called a monomorphism (resp. epimorphism, isomorphism). If B=A, p is called an endomorphism. Note: To distinguish between mappings of vector spaces and mappings of algebras, we reserve the word linear mapping for a mapping between vector spaces satisfying (1.8), (1.9) and homomorphism for a linear mapping between algebras which satisfies (5.1). Let A be a given algebra and let U, V be two subsets of A. We denote by U V, the set
§ 1. Basic properties
145
Every vector aeA induces a linear mapping p(a):A—*A defined by
1u(a)x=ax
(5.2)
4u (a) is called the multiplication operator determined by a.
An algebra A is called associative if
x(yz)=(xy)z and commutative if
xy=yx
x,y,zEA
x,yeA.
From every algebra A we can obtain a second algebra (x y)OPP
by defining
=yx
AON' is called the algebra opposite to A. It is clear that if A is associative
then so is A°". If A is commutative we have A°"=A. If A is an associative algebra, a subset Sc: A is called a system of generators of A if each vector xeA is a linear combination of products of elements in 5, 1... x= e S, 1... Vp ... (v)
A unit element (or identity) in an algebra is an element e such that for every x
xe=ex=x.
(5.3)
if A has a unit element, then it is unique. In fact, if e and e' are unit elements, we obtain from (5.3) e = e e' = e'. Let A be an algebra with unit element eA and ço be an epimorphism of A onto a second algebra B. Then eB = eA is the unit element of B. In fact,
if yEB is arbitrary, there exists an element xeA such that y= çox. This gives
yeB =
=
=
= y.
In the same way it is shown that An algebra with unit element is called a division algebra, if to every element a 0 there is an element a' such that a a — = a — = c. 1
5.2. Examples: 1. Consider the space L(E; E) of all linear transformations of a vector space E. Define the product of two transformations by 10
= i/i o Greub Linear Algebra
Chapter V. Algebras
146
The relations (2.17) imply that the mapping (p, i)—*çlip satisfies (M1) and (M2) and hence L(E; E) is made into an algebra. L(E; E) together with this multiplication is called the algebra of linear transformations of E and is denoted by A (E; E). The identity transformation i acts as unit element in A (E; E). It follows from (2.14) that the algebra A (E; E) is associative.
However, it is not commutative if dim E 2. In fact, write E= (x1) and (x2) are the one-dimensional subspaces generated by two linearly independent vectors x1 and x2, and F is a complementary subspace. Define linear transformations 'p and by
'px1=O,
(px2=x1,
py=O,yeF
ç/ix2=O;
çliy=O,yeF.
and Then
= 'p0 = 0 while (pX2
=
çlix1
= x2
whence
Suppose now that A is an associative algebra and consider the linear mapping defined by
p(a)x=ax.
(5.4)
Then we have that
p(a b)x = a bx = p(a)p(b)x whence
p(ab) = p(a)p(b). This
relation shows that p is a homomorphism of A
into A (A; A).
M X be the vector space of (n x mi)-matrices for a given integer ii and define the product of two (mi x n)-matrices by formula Example 2: Let
(3.20). Then it follows from the results of sec. 3.10 that the space is made into an associative algebra under this multiplication with the unit matrix J as unit element. Now consider a vector space E of dimension n with a distinguished basis (v = 1. n). Then every linear transforE determines a matrix M ('p). The correspondence 'p —+ M(co) mation 'p . .
§ 1. Basic properties
determines a linear isomorphism of A (E; E) onto
147 X
In view of sec.
3.10 we have that
M is an isomorphism of the algebra A (E; E) onto the opposite algebra (M" X n)0PP. Example 3: Suppose F1 cF is a subfield. Then F is an algebra over F1. We show first that F is a vector space over F1. In fact, consider the mapping F1 x F—+F defined by
(2,x)-÷2x, It satisfies the relations
2eF1,xEF.
+ x =2x+ x 2(x + y) = Ax + 2y (24u)x = 2(1ux)
lx = x where 2,
x, yeF. Thus F is a vector space over F by (x, y) x y (field multiplication).
Then M1 and M2 follow from the distribution laws for field multiplication.
Hence F is an associative commutative algebra over F1 with 1 as unit element.
Example 4: Let cr be the vector space of functions of a real variable t which have derivatives up to order r. Defining the product by
(1 g) (t) = f (t) g (t) we obtain an associative and commutative algebra in which the function 1(t) = 1 acts as unit element. 5.3. Subalgebras and ideals. A subalgebra, A1, of an algebra A is a linear subspace which is closed under the multiplication in A; that is, if x and y are arbitrary elements of A1, then xyeA1. Thus A inherits the structure of an algebra from A. It is clear that a subalgebra of an associative (commutative) algebra is itself associative (commutative). Let S be a subset of A, and suppose that A is associative. Then the subspace B A generated (linearly) by elements of the form
is
SEES Si...Sr, clearly a subalgebra of A, called the subalgebra generated by S. It is
easily verified that
where the 10*
B= A containing S.
Chapter V. Algebras
A right (left) ideal in an algebra A is a subspace I such that for every xEI, and every yEA, xyEI(yxEI). A subspace that is both a right and left ideal is called a tivt'o-sided ideal, or simply an ideal in A. Clearly, every
right (left) ideal is a subalgebra. As an example of an ideal, consider the subspace A2 (linearly generated by the products xy). A2 is clearly an ideal and is called the derived algebra. The ideal I generated by a set S is the intersection of all ideals containing S. If A is associative, I is the subspace of A generated (linearly) by elements of the form
s,as,sa
sES,aEA.
In particular every single clement a generates an ideal principal ideal generated by a.
4
is
called the
Example 5: Suppose A is an algebra with unit element e, and let (p:F-÷A be the linear mapping defined by ço2 = Ae.
Considering F as an algebra over itself we have that =
e
=
e)(R e) =
then ).e=0 whence p is a homomorphism. Moreover, if )L=0. It follows that p is a monomorphism. Consequently we may identify F with its image under p. Then F becomes a subalgebra of A and scalar multiplication coincides with algebra multiplication. In fact, if). is any scalar, then = (2e).a = = Example
6: Given an element a of an associative algebra consider
the set, Na, of all elements xEA such that ax =0. If xENa then we have for every VEA
and so xyENa. This shows that Na is a right ideal in A. It is called the right annihilator of a. Similarly the left annihilator of a is defined. 5.4. Factor algebras. Let A be an algebra and B be an arbitrary subspace of A. Consider the canonical projection
It will be shown that A/B admits a multiplication such that ir is a homomorphism if and only if B is an ideal in A. Assume first that there exists such a multiplication in A/B. Then for
§ 1. Basic properties
149
every xeA, yeB, we have
ir(xy) =
irxiry =
it follows that and so B must be an ideal. Conversely, assume B is an ideal. Then define the multiplication in
A/B by
= ir(xy)
(5.5)
where x and y are any representatives of
and 7 respectively.
It has to be shown that the above product does not depend on the choice of x and y. Let x' and y' be two other elements such that it x' = and iry' =7. Then
x'—xeB and y'—yeB. Hence we can write
x'==x+b, It
beB and y'—y+c,
ceB.
follows that
x'y' — xy = by + xc + bceB and so
rr(x'y') = it(xy). The multiplication in A/B clearly satisfies (M1) and (M2) as follows from the linearity of it. Finally, rewriting (5.5) in the form
it (x y) = it x iry
we see that it is a homomorphism and that the multiplication in A/B is uniquely determined by the requirement that it be a homomorphism. The vector space A/B together with the multiplication (5.5) is called the
factor algebra of A with respect to the ideal B. It is clear that if A is associative (commutative) then so is A/B. If A has a unit element e then ë= ire is the unit element of the algebra A/B. 5.5. Homomorphisms. Suppose A and B are algebras and is
a homomorphism. Then the kernel of p is an ideal in A. In fact, if xeker ço and yEA
are
arbitrary we have that
p(xy) =
=
=
0
whence xyEker qi. In the same way it follows that yxEker tp. Next consider the subspace Im pcB. Since for every two elements x, yeA = qi(xy)elmq
it follows that Im 'p is a subalgebra of B.
Chapter V. Algebras
Now let
be the induced injective linear mapping. Then we have the commutative d iagrani
A/kerço
and since
is
a homomorphism, it follows that = = = =
'p
(x y) (x). 'p (y)
is a homomorphism and hence a monomorphism. In particular, the induced mapping This relation shows that
4 Imço is an isomorphism. Finally, assume that C is a third algebra, and let be a homomorphism. Then the composition ti0 p: A —+ C is again a homomorphism. In fact, we have 'ps. = = =
Let 'p:A—*B be any homomorphism of associative algebras and S be by a system of generators for A. Then 'p determines a set map (po:
'p0x=çox,
xeS. In fact, if
The homomorphism 'p is completely determined by
x=
...
E S,
(v)
is
an arbitrary element we have that
... 'poxv
= (v)
I
Vp
e I'
§ 1. Basic properties
151
be an arbitrary set map. Then Po can be Proposition I: Let can be extended to a homomorphism ço:A—+B if and only if ...
whenever
0
po
...
= 0. (5.6)
(v)
(v)
Proof: It is clear that the above condition is necessary. Conversely, assume that (5.6) is satisfied. Then define a mapping ço:A—÷B by
= (v)
...
(5.7)
(v)
To show that çü is, in fact, well defined we notice that if = ... •.. Ypq
(v)
(p)
then —
Ypq
= 0.
(ji)
(v)
In view of (5.6) ...
...
—
(v)
0
(p)
and so
...
It follows from (5.7) that
px=ip0x xeS p(2x + jiy) = 2px + and
'p (x y) = 'p
'p y
and hence 'p is a homomorphism. Now suppose that
be a linear map such
is a basis for A and let
= for each x, j3. Then 'p is a homomorphism, as follows from the relation 'p (x y) =
'p
ep)}
e2) (> p
2,fl
=
'p (ep)) =
'p p
'p
(x) 'p (y).
Chapter V. Algebras
152
5.6. Derivations. A linear mapping 0: A called a derivation if
A of an algebra into itself is
X,yEA.
(5.8)
and As an example let A be the algebra of Cr-functions f: define the mapping 0 by 0:f—+f' wheref' denotes the derivative off. Then the elementary rules of calculus imply that 0 is a derivation. If A has a unit element e it follows from (5.8) that Oe =
Oe
+ 0e
whence Oe=—O. A derivation is completely determined by its action on a
system of generators of A, as follows from an argument similar to that used to prove the same result for homomorphisms. Moreover, if O:A—*A
is a linear map such that
=
+
is a basis for A, then 0 is a derivation in A. For every derivation 0 we have the Leibniz formula
where
on(xy)
(5.9)
= In fact, for n = 1, (5.9) coincides with (5.8). Suppose now by induction that (5.9) holds for some n. Then +
1(x y) =
o on
(x y) or+
-r y +
= x.On+ly +
+
or x
-r+
=
= x.On+ly + n+ 1
and so the induction is closed.
Orx.On+l_ry +
(n+1) Orx.On_r+ly +
§ 1. Basic properties
153
The image of a derivation 0 in A is of course a subspace of A, but it is in general not a subalgebra. Similarly, the kernel is a subalgebra, but it is not, in general, an ideal. To see that ker 0 is a subalgebra, we notice that for any two elements x, yeker 0
0(xy) =
0
whence xy E ker 0.
it follows immediately from (5.8) that a linear combination of derivations 01:A—*A is again a derivation in A. But the product of two derivations 01, 02 satisfies
(0102)(xy) = 01(02x.y + x.02y) (5.10)
and so is, in general, not a derivation. However, the commutator [01,02] = 0102—0201 is again a derivation, as follows at once from (5.10). 5.7. ip-derivations. Let A and B be algebras and 'p : A B be a fixed homomorphism. Then a linear mapping 0: A B is called a 'p-derivation if
0(xy)=
x,yeA.
+
denotes In particular, all derivations in A are i-derivations where i : A the identity map. As an example of a 'p-derivation, let A be the algebra of Cm-functions f: R—* and let B= 11. Define the homomorphism cp to be the evaluation homomorphism : f -÷ (0) and the mapping 0 by
f
0:f Then it follows that
0(fg) = (1 g)'(O) = = 0
f' (0) g (0) + f (0) g' (0)
a 'p-derivation.
More generally, if °A is any derivation in A, then derivation. In fact, 0(xy) = çoOA(xy) + xOAv) = = 'p
+
'p x
0 y.
Similarly, if °B is a derivation in B, then °B° 'p
is
a 'p-derivation.
is
a ço-
Chapter V. Algebras
154
5.8. Antiderivations.
Recall that an involution in a linear space is a
linear transformation whose square is the identity. Similarly we define an involution w in an algebra A to be an endomorphisin of A whose square is the identity map. Clearly the identity map of A is an involution. If A has a unit element e it follows from sec. 5.1 that we=e. Now let w be a fixed involution in A. A linear transformation Q:A—*A will be called an antiderivation with respect to w if it satisfies the relation
Q(xj) =
+
wxQy.
(5.11)
In particular, a derivation is an antiderivation with respect to the involution i. As in the case of a derivation it is easy to show that an antiderivation is determined by its action on a system of generators for A and that ker Q is a subalgebra of A. Moreover, if A has a unit element e, then Qe=O. It also follows easily that any linear combination of antiderivations with respect to a fixed involution w is again an antiderivation with respect to w. Suppose next that Q1 and Q2 are antiderivations in A with respect to 0w1. Then w1 oW2 the involutions w1 and w2 and assume that w1 0w2 is again an involution. The relations
(Q122)(xy)= Q1(Q2xy + w2xQ2y)=
+
and
(Q2Q1)(xy)=
+ w1xQ1y)= Q2Q1xy + + w2Q1xQ2y + Q2w1xQ1y + w2w1xQ2Q1y
yield
(Q1Q2 ± Q2 ± Q2w1)xQ1 y + +(Q1w2 ± w2Q1)xQ2y + W1W2X.(Q1Q2 ± Q2Q1)y. Q2
(5.12)
Now consider the following special cases: 1. w1 Q2 = Q2 w1 and w2 Q1 = Q1 (this is trivially true if w1 = ± i and Q2 —Q2 is an antiderivation = ± i). Then the relation shows that with respect to the involution W1 w2. In particular, if Q is an antiderivation
with respect to w and 0 is a derivation such that 0)0=0W, then OQ—Q0 is again an antiderivation with respect to oi. 2. w1Q2=—Q2W1andw2Q1=—Q1W2.ThenQ1Q2+Q2Q1isanantiderivation with respect to the involution W1 0)2.
§ 1. Basic properties
155
Now let Q1 and Q2 be two antiderivations with respect to the same involution w such that
(i=1,2). Then it follows that Q1 Q2 + Q2 Q1 is a derivation. In particular, if Q is any antiderivation such that wQ = - Qw then Q2 is a derivation. Finally, let B be a second algebra, and let cp: A —÷ B be a homomorphism. Assume that WA is an involution in A. Then a p-antiderivation with respect to WA is a linear mapping Q:A-+B satisfying (5.13) If WB is
an involution in B such that WA
WB 'P
then equation (5.13) can be rewritten in the form
Q(xy) =
+
Problems 1. Let A be an arbitrary algebra and consider the set C(A) of elements aEA that commute with every element in A. Show that C(A) is a subspace
of A. If A is associative, prove that C(A) is a subalgebra of A. C(A) is called the centre of A. 2. If A is any algebra and 0 is a derivation in A, prove that C(A) and the derived algebra are stable under 0. 3. Construct an explicit example to prove that the sum of two endomorphisms is in general not an endomorphism. 4. Suppose 'p A —÷ B is a homomorphism of algebras and let ). + 0, 1 be
an arbitrarily chosen scalar. Prove that 2p is a homomorphism if and only if the derived algebra is contained in ker 'p. 5. Let C1 and C denote respectively the algebras of continuously differentiable and continuous functionsf: (cf. Example 4). Consider the linear mapping d: C' C
given by df=f' wheref' is the derivative off.
Chapter V. Algebras
a) Prove that this is an i-derivation where i: C1—*C denotes the canonical injection. b) Show that d is surjective and construct a right inverse for d.
c) Prove that d cannot be extended to a derivation in the algebra C. 6. Suppose A is an associative commutative algebra and 0 is a derivation in A. Prove that Ox" = px"' 0(x). 7. Suppose that 0 is a derivation in an associative commutative algebra A with identity e and assume that xeA is invertible; i.e.; there exists an element x ' such that
Prove that x" (p 1) is invertible and that
(x")' —(x')" Denoting the inverse of x" by
show that for every derivation 0
0(x") = — px"1 0(x). 8. Let L be an algebra in which the product of two elements x, y is denoted by [x, y]. Assume that [x, y] + [y, x] = z], x] + y], z] +
0
(skew symmetry)
x], y] = 0 (Jacobi identity)
Then L is called a Lie algebra. Let Ad (a) be the multiplication operator in the Lie algebra L. Prove that Ad (a) is a derivation.
9. Let A be an associative algebra with product xy. Show that the multiplication (x, y)—÷[x, y] where
[x,y]
xy — yx
makes A into a Lie algebra. 10. Let A be any algebra and consider the space D (A) of derivations in A. Define a multiplication in D(A) by setting [01,02] = a)
0102 —0201.
Prove that D (A) is a Lie algebra.
b) Assume that A is a Lie algebra itself and consider the mapping given by Show that 'p is a homomorphism of Lie algebras. Determine the kernel of p.
§ 1. Basic properties
11. If L is a Lie algebra and I is an ideal in A, prove that the algebra L/I is again a Lie algebra. 12. Let E be a finite dimensional vector space. Show that the mapping 1: A (E; E) —÷ A (E*; E*)OPP
is an isomorphism of algebras. given by 13. Let A be any algebra with identity and consider the multiplication
operator
ji: A
A (A; A).
Show that p is a monomorphism. If A = L (E; E) show that by a suitable restriction of p a monomorphism
(i= 1
E be an n-dimensional vector space. Show that each basis n) of L(E; E) such that n) of E determines a basis 1
(i) QijOlk = (ii)
i.
Conversely, given n2 linear transformations of E satisfying i) and ii), prove that they form a basis of L(E; E) and are induced by a basis of E. Show that two bases e1 and of E determine the same basis of L (E; E) if and only if e = A 2 eF. 15. Define an equivalence relation in the set of all linearly independent E), in the following way: n2-tuples (p1...pn2), ...
('P1 ...
if and only if there exists an element =
such that (v
= ... 1
,12)
Prove that 2EV
only if 2=1. 16. Prove that the bases of L(E; E) defined in problem 14 form an equivalence class under the equivalence relation of problem 15. Use this to show that every non-zero endomorph ism cP: A (E; E)—*A (E; E) is an inner automorphism; i.e., there exists a fixed linear automorphism of E such that 1
17. Let A be an associative algebra, and let L denote the corresponding
Chapter V. Algebras
158
is Lie algebra (cf. problem 9). Show that a linear mapping derivation in A only if it is a derivation in L. 18. Let E be a finite dimensional vector space and consider the mapping E)—*A(E; E) defined by
= — Prove that is a derivation. Conversely, prove that every derivation in A (E; E) is of this form. Hint. Use problem 14. § 2.
Ideals
5.9. The lattice of ideals. Let A be an algebra, and consider the set 1 of ideals in A. We order this set by inclusion; i.e., if and '2 are ideals if and only if in A, then we write '1 The relation is clearly a partial order in 1 (cf. sec. 0.6). Now let and '2 be ideals in A. Then it is easily cheeked that + and '1 n '2 are again ideals, and are in
fact the least upper bound and the greatest lower bound of '1 and '2 Hence, the relation induces in 5 the structure of a lattice. 5.10. Nilpotent ideals. Let A be an associative algebra. Then an element aEA will be called ni/potent if for some k, (5.14)
The least k for which (5.14) holds is called the degree of ni/potency of a. An ideal I will be called nilpotent if for some k,
,k0
(5.15)
The least k for which (5.15) holds is called the degree of ni/potency of I and will be denoted by deg I. 5.11.* Radicals. Let A be an associative commutative algebra. Then the nilpotent elements of A form an ideal. In fact, if x and y are nilpotent of degree p and q respectively we have that p+q
+
p+q
p
= i=O
and
(xy)" = x"y" = 0.
§ 2. Ideals
The ideal consisting of the nilpotent elements is called the radical of A and will be denoted by rad A. (The definition of radical can be generalized to the non-commutative case; the theory is then much more difficult and belongs to the theory of rings and algebras. The reader is referred to [14]).
It is clear that rad (rad A) = rad A.
The factor algebra A/rad A contains no non-zero nilpotent elements. To prove this assume that A is an element such that for some k. Then x"erad A and hence the definition of rad A yields / such that = (x")' = 0. It follows that xErad A whence by the formula
The above result can be expressed
rad(A/radA) = 0.
Now assume that the algebra A has dimension n. Then rad A is a nilpotent ideal, and (5.16) deg(radA) dim(radA) + 1 n + 1. For the proof, we choose a basis e1, ..., er of rad A. Then each is nilpotent. Let k = max (deg e1), and consider the ideal (rad An arbitrary element in this ideal is a sum of elements of the form where
k
so
...
=0. This shows that
=0 and so rad A is nilpotent. Now let s be the degree of nilpotency of rad A, and suppose that for some m<s, (rad A)tm = (rad A)m+
(5.17)
Then we obtain by induction that (radA)tm =
= (radA)m+2 =...= (radA)s = 0
which is a contradiction. Hence (5.17) is false and so in particular dim(rad A)tm> dim (radA)m+l,
m <s.
Chapter V. Algebras
It follows at once that s — cannot be greater than the dimension of rad A, which proves (5.16). As a corollary, we notice that for any nilpotent element xEA, its degree of nilpotency is less than or equal to ii+ I, 1
degx
n + 1.
5.12.* Simple algebras. An algebra A is called simple if it has no proper
non-trivial ideals and if A2 +0. As an example consider a field F as an algebra over a subfield F1. Let 1+0 be an ideal in F. If x is a non-zero element of I, then 1
and it follows that
F=
cJ
whence F = I. Since 12+0, F is simple. As a second example consider the algebra A (E; E) where E is a vector space of dimension n. Suppose I is a non-trivial ideal in A (E; E) and let p+O be an arbitrary element of I. Then there exists a vector aeE such
that pa+0. Now define the linear transformations
by
i,k=1...n where e (i= that
.n) is a basis of E. Choose linear transformations
such
i=1...n.
(E; E) be arbitrary and c4 let be the matrix of Let the basis e1. Then = = =
with respect to
whence 'I'
=
It follows that i/iel and so I_—A(E; E). Since, (clearly) A (E; E)2 +0, A (E; E) is a simple algebra. Theorem I: Let A be a simple commutative associative algebra. Then A is a division algebra. Proof: We show first that A has a unit element. Since A2+0, there is an element aEA such that Ia+0• Since A is simple, Thus there is an element eEA such that C!• e = a.
§2. Ideals
161
Next we show that e2 = e. In fact, equation (5.18) implies that a(e2 — e)
= (ae)e — ae = ae
—
ae =0
and so e2—e is contained in the annihilator of a, e2—eeN0. Since N0 is an ideal and Na*A it follows that Na=0 whence e2=e.
Now let xeA be any element. Since a=aeele we have Ie#0 and 50 IeA. Thus we can write x = er
for some ye A.
It follows that ex=e2v=ev=x and so e is the unit element of A. Thus every element xeA satisfies x=x. e; i.e., xel,. In particular, * 0 if .v * 0. Hence, if x + 0. = A and so there is an element x such
that xx"'=x'x=e: i.e., A is a division algebra.
5.13.* Totally reducible algebras. An algebra A is called totally recluclb/c if to every ideal I there is a complementary ideal I', A=
1$!'.
Every ideal I in a totally reducible algebra is itself a totally reducible algebra. In fact, let I' be a complementary ideal. Then
1.1' ci fl I' =
0.
Consequently, if J is an ideal in I, we have
J
an
ideal in A. Let J' be a complementary ideal in A, A
Intersecting with I and observing that id we obtain (cf. sec. 1.13) I It follows that us again totally reducible. An algebra, A, is called irreducible if it cannot be written as the direct
sum of two non-trivial ideals. 5.14.* Semisimple algebras. In this section A will denote an associative commutative algebra. A will be called semisimple if it is totally reducible and if for every non-zero, I, ideal j2 +0. 1
(reeb.
near AIgr±ra
Chapter V. Algebras
162
Proposition I: If A is totally reducible, then A is the direct sum of its radical and a semisimple ideal. The square of the radical is zero. Proof: Let B denote a complementary ideal for rad A,
A = rad A
B.
B contains no non-zero nilpotent eleIt follows from sec. (5.13) that B is totally reducible ments and so B2 and hence B is semisimple. To show that the square of rad A is zero, let k be the degree of nilan ideal in rad A, and potency of rad A, (rad A)k=0. Then (rad so there exists a complementary ideal J, Since
EEJ = radA.
Now we have the relations =
=
0
=0 n J=0.
jk-1 These relations yield (rad
0
A
and only if A is totally reducible and
rad A=0.
Problems 1. Suppose that
are ideals in an algebra A. Prove that
+ '2)/Il
'2/(11
'2).
Show that the algebra C' defined in Example 4, § 1, has no nilpotent elements +0. 111. Show that the oper3. Consider the set S of step functionsf: [0, ations 2.
(1 +g)(t)=f(t)+g(t) (Af)(t) =
(t)
(fg)(t) =f(t)g(t)
§ 3. Change of coefficient field of a vector space
163
make S into a commutative associative algebra with identity. (A function f: [0,1] —÷ is called a step function if there exists a decomposition of the
unit interval,
0=to
5. Show that the algebra S of problem 3 has ideals which are not principal. Let (a, b)c: [0,1] be any open interval, and letf be a step function such that f (t) = 0 if and only if a < t < b. Prove that the ideal gener-
ated by f is precisely the subset of functions g such that g(t)==0 for
a
transformations of E whose kernels have finite codimension form an ideal. Conclude that A (E; E) is not simple. Hint: See problem 11, chap. II, § 6 and problem 8, chap. I, § 4. § 3.
Change of coefficient field of a vector space
5.15. Vector space over a subfield. Let E be a vector space over a field F and let A be a subfield of F. The vector space structure of E involves a mapping
Fx
satisfying the conditions (11.1), (11.2) and (11.3) of sec. 1.1. The restriction of this mapping to A x E again satisfies these conditions, and so it deter-
mines on E the structure of a vector space over A. A subspace (factor space) of E considered as a A-vector space, will be called a A-subspace (A-factor space). Similarly we refer to F-subspaces and F-factor spaces. Clearly every F-subspace (factor space) is a A-subspace (A-factor space). Now let F be a second vector space over F and suppose that ço : is a F-linear mapping; i.e., + py) =
+
ppy x,yeE,2,peF.
Then 'p is a A-linear mapping ifEand Fare considered as A-vector spaces.
Chapter V. Algebras
As an example, consider the field F as a I-dimensional vector space over itself. Then (cf. sec. 5.2 Example 3) F is an algebra over A. 5.16. Dimensions. To distinguish between the dimension of E over F
and A we shall write dim1E and dim4E. Suppose now that F is finite dimensional over A. Assume further that the dimension of E over F is finite. It will be shown that dim4 E = dim1 E dim4 F.
(1= 1.. .n) be a basis of E over F and consider the F-subspace E generated by e. Then there is a F-isomorphism ço E.. But also a A-isomorphism and hence it follows that Let
dim4 E1 = dim4 F,
i= 1 ... n.
is
(5.21)
Since the A-vector space E is the direct sum of the A-vector spaces E, we obtain from (5.21) that
dim4E = ndim4F = As an example let E be a complex vector space of dimension 11. Then, since C =2, E, considered as a real vector space, has dimension 2n. If ; (v = .n) is a basis of the complex vector space E then the vectors (v = .. n) form a basis of E considered as a real vector space. 5.17. Algebras over subfields. Again let A be a subfield of F and let A be an algebra over F. Then A may be considered as a vector space over A, 1 . .
1
.
and it is clear that A, together with its A-vector space structure, is an algebra over A. We (in a way similar to the case of vector spaces) distinguish between A-subalgebras, A-homomorphisms and F-subalgebras, Fhomomorphisms. Clearly every F-subalgebra, (F-homomorphism) is a A-subalgebra, (A-homomorphism).
5.18. Extension fields as subalgebras of A4(E; E). Let E be a nontrivial vector space over F and A F be a subfield. Then E can be considered as a vector space over A. Denote by A4 (E: E) the algebra (over A) of A-linear transformations of E. Define a mapping by (5.22)
where Then
is
the ordinary scalar multiplication defined between F and E. =
=
§ 3. Change of coefficient field of a vector space
165
and
+ fix
+ 13)x =
+ /3)x =
= cP
(/3))
whence
+ /3) =
+ cP(f3)
and
Since A F, it follows that is a A-homomorphism. Moreover, is injective. In fact, implies that for every XEE whence o=O. Since cP is a monomorphism we may identify F with the A-subalgebra
Im
of AA (E; E).
Conversely, let E be a vector space over a field A and assume that F c: AA (E; E) is a field containing the identity. We may identify A with the subalgebra ofF consisting of elements of the form i, AeA, the identification map being given by Then we have A cF; i.e., A is a subfield ofF. Now define a mapping F x E—*E by çOEF,XEE.
(5.23)
Then we have the relations =
(x + y) = + x=
çø
ix=x
x+ x+
y
x,yEE;q9,I/JET,
and hence E is made into a vector space over F. The restriction of the mapping (5.23) to A gives the original structure of E as a vector space over A while the mapping P restricted to A reduces (E; E). to the canonical injection of A into 5.19. Linear transformations over extension fields. Let A F be a subfield and E be a vector space over F. Then we have shown that (E; E) (E; E). Now we shall prove the more precise
E) is the subalgebra of E) consisting of Proposition: those A-linear transformations which commute with every A-linear transformation of the form cXEF.
Chapter V. Algebras
166
Proof: Let
E). Then
and so
(5.24) Conversely, if (5.24) holds, then by inverting the above argument we ob-
tain that E is a vector space over A and F
(E; E) is a field
E) is contained in
such that lET'. Then a transformation
E) if and only if it commutes with every A-linear transformation
Problems I. Suppose A F is a subfield of F such that F has finite dimension over A. Suppose further that Prove A that A is a subfield of F. 2. Show that ifAcT is a subfield, and F has finite dimension over A, then there are no non-trivial derivations in the A-algebra F. 3. A complex number is called algebraic if it satisfies an equation of the form
;=
0
rational)
where not all the coefficients are zero. Prove that the algebraic numbers are a subfield, A, of C and that A has infinite dimension over the rationals.
Prove that there are no non-trivial derivations in A.
Chapter VI
Gradations and homology In this chapter all vector spaces are defined over a fixed, but arbitrarily chosen field F of characteristic 0.
§ 1. G-graded vector spaces 6.1. Definition. Let E be a vector space and G be an abelian group. Suppose that a direct decomposition (6.1) cxel
is given and that to every subspace an element k (tx) of G is assigned such that the mapping is injective. Then E is called a G-graded vector space. G is called the group of degrees for E. The vectors of are called homogeneous of degree k (ci) and we shall write
degx=k(cs), In particular, the zero vector is homogeneous of every degree. If the mapping is bijective we may use the group G as index set in the decomposition (6.1). Then formula (6.1) reads
E= keG
Ek
where Ek denotes the subspace of the homogeneous elements of degree k. If G = E will be called simply a graded vector space. Suppose that E is a vector space with direct decomposition
E=>JEk Then by setting
—1)
(ke7L).
we make Einto agraded space, and when-
ever we refer to the graded space E_—>Ek, we shall mean this particular k=O
gradation. A gradation of E such that Ek = 0, k — gradation.
1,
is called a positive
Chapter VI. Gradations and homology
Now let E be a G-graded space, E=>Ek,
and
consider a subspace
kEG
FcEsuchthat
F=
keG
Then a G-gradation is induced in F by assigning the degree k to the vec-
tors of Fn Ek. F together with its induced gradation is called a G-graded subspace of E. Suppose next that is a family of G-graded spaces indexed by a set I and let E be the direct sum of the EA. Then a G-gradation is induced in
Eby E=
where
Ek =
kEG
).eI
This follows from the relation Ad
kEG )et
AEI keG
keG
6.2. Linear mappings of G-graded spaces. Let E and F be two G-graded spaces and let E—3F be a linear map. The map p is called homogeneous if there exists a fixed element kEG such that
jeG
(6.2)
k is called the degree of the homogeneous mapping p. The kernel of a homogeneous mapping is a graded subspace of E. In fact, if
E and F induced by the gradations of E and F it follows from (6.2) that cJk+JO(P—(POQJ.
(6.3)
Relation (6.3) implies that ker 'p is stable under the projection operators and hence ker 'p is a G-graded subspace of E. Similarly, the image of 'p is a G-graded subspace of F. Now let E be a G-graded vector space, F be an arbitrary vector space (without gradation) and suppose that 'p:E—*Fis a linear map of Eonto F such that ker 'p is a graded subspace of E. Then there is a uniquely determined G-gradation in F such that 'p is homogeneous of degree zero. The G-gradation of F is given explicitly by jeG where
= 'p (Es).
(6.4)
§ 1. 6-graded vector spaces
169
To show that (6.4) defines a G-gradation in F, we notice first that since ço is onto,
F=
=
E=
To prove that the decomposition (6.4) is direct assume that where Since lows that ço
every can be written in the form = 0 whence
It fol-
Since ker p is a graded subspace of E we obtain
for eachj Thus the decomposition (6.4) is direct and hence it defines a G-gradation in F. Clearly, the mapping p is homogeneous of degree zero with respect to the induced gradation. Finally, it is clear that any G-gradation of F such that ço is homogeneous of degree zero must assign to the elements of the degree]. In view of the decomposition (6.4) it follows that this G-gradation is uniquely determined by the requirement that 'p be homogeneous of degree zero. This result implies in particular that there is a unique G-gradation determined in the factor space of E with respect to a G-graded subspace such that the canonical projection is homogeneous of degree zero. Such a factor space, together with its G-gradation, is called a G-graded factor whence
space of E.
Now let E= that
Ek and F= kEG
Fk be two G-graded spaces, and suppose keG
is a linear mapping homogeneous of degree 1. Denote by Pk the restriction of 'p to Ek, Ek —*
Fk+l.
Then clearly keG
It follows that 'p is injective (surjective, bijective) if and only if each c°k injective (surjective, bijective).
Chapter VI. Gradations and homology
6.3. Gradations with respect to several groups. Suppose that t: G
into another abelian group G'. Then a G-
gradation of E induces a G'-gradation of E by where
(6.5) t(2)=fl
/3
To prove this we note first that E= since
X
The directness of the decomposition (6.5) follows from the
fact that every space decomposition
is a sum of certain subspaces
and that the
is direct.
A Gp-gi'adation is a gradation with respect to the group
GEE... p
If G = we refer simply to a p-gradation of E. Given a G p-gradation in E consider the homomorphism
i:
G
given by
The induced (simple) G-gradation of E is given by (6.6)
j
The G-gradation (6.6) of E is called the (simple) G-gradation induced by the given G p-gradation. Finally, suppose E is a vector space, and assume that
E=
E=
jeG
keIi
Fk
(6.7)
define G and H-gradations in E. Then the gradations will be called coinpatible if E= n Fk. j,
k
if the two gradations given by (6.7) are compatible, they determine a in E by the assignment n Fk.
§ 1. G-graded vector spaces
Conversely, suppose a
171
in E is given
E= k
Then compatible G and H-gradations of E are defined by jeG
keH
and
E determined by these G and Hgradations is given by
jEG,kEH.
EJ,k=EfflFk
6.4. The Poincaré series. A gradation E== >.Ek of a vector space E is called almost finite if the dimension of every space Ek is finite. To every almost finite positive gradation we assign the formal series PE(t) = (t) is called the Poincaré series of the graded space E. If the dimension of E is finite, then (t) is a polynomial and
PE(l) = dimE. The direct sum of two almost finite positively graded spaces E and F is again an almost finite positively graded space, and its Poincaré series is given by = PE(t) + PF(t). Two almost finite positively graded spaces E and F are connected by a homogeneous linear isomorphism of degree 0 if and only if = In fact, suppose is such a homogeneous linear isomorphism of degree 0. Writing k=O
(cf. sec. 6.2) we obtain that each c°k is a linear isomorphism, Ek 4Fk.
Chapter VI. Gradations and homology
172
Hence
(k=O,1,...)
dimEk=dimFk
(6.8)
and so
= Conversely, assume that are linear isomorphisms
Then (6.8) must hold, and thus there (6.9)
(pk.Ek—*Fk.
Since
we
can construct the linear mapping
= k=O
E
F
which is clearly homogeneous of degree zero. Moreover, in view of sec. (6.2) it follows from (6.9) that ço is a linear isomorphism. 6.5. Dual G-graded spaces. Suppose E= > Ek and F= Fk are two GkE G graded vector spaces, and assume that k G ço:E x
is a bilinear function. Then we say that cv respects the G-gradations of E
and Fif (6.10)
for each pair of distinct degrees, k +j. Every bilinear function cv: E x F—÷F which respects G-gradations determines bilinear functions pk: Ek x (keG) by
(PIEkXFk=(Pk,
keG.
(6.11)
Conversely, if any bilinear functions (pk: Ek x are given, then a unique bilinear function p:Ex F-+F which respects G-gradations is determined by (6.10) and (6.11). In particular, it follows that ço is non-degenerate if and only if each is non-degenerate. Thus a scalar product which respects G-gradations determines a scalar product between each pair (Ek, Fk), and conversely if a scalar product is defined between each pair (Ek, Fk) then the given scalar product can be extended in a unique way to a G-gradation-respecting scalar product between E and F. E and F, together with a G-gradation-respecting scalar product, will be called dual G-graded spaces.
Now suppose that E and F are dual almost finite G-graded spaces.
§ 1. G-graded vector spaces
173
Then Ek and Fk are dual, and so
dimEk=dimFk In particular, if G
kEG.
and the gradations of E and F are positive, we have
=
Problems 1. Let çø : E—*F be an injective linear mapping. Assume that F is a Ggraded vector space and that Im ço is a G-graded subspace of F. Prove that there is a unique G-gradation in E so that p becomes homogeneous of degree zero. 2. Prove that every G-graded subspace of a G-graded vector space has a complementary G-graded subspace. 3. Let E, F be G-graded vector spaces and suppose that E1 E, F1 F are G-graded subspaces. Let p: E—+F be a linear mapping homogeneous of degree k. Assume that p can be restricted to E1, F1 to obtain a linear mapping p1 :E1—*F1 and an induced mapping
Prove that q1 and are homogeneous of degree k. 4. If cp, E, F are as in problem 3, prove that if has a left (right) inverse, then a left (right) homogeneous inverse of must exist. What are the possible degrees of such a homogeneous left (right) inverse mapping? 5. Let E1, E2, 123 be G-graded vector spaces. Suppose that p: E1 and i/i:E1—+E3 are linear mappings, homogeneous of degree k and 1 respectively. Assume that can be factored over 'p. Prove that cli can be factored over 'p with a homogeneous linear mapping x: and determine the degree of x. Hint: See problem 5, chap. II, § 1.
6. Let E, E* and F, F* be two pairs of dual G-graded vector spaces. Assume that and 'p is homogeneous of degree k, prove that 'p* homogeneous of degree k. and 7. Let E be an almost finite graded space. Suppose that are G-graded spaces each of which is dual to the G-graded space E. Construct
is
Chapter VI. Gradations and homology
174
a homogeneous linear isomorphism of degree zero
such that
<(py*x> =
xeE.
8. Let F, E* be a pair of almost finite dual G-graded spaces. Let F be a G-graded subspace of E. Prove that F' is a G-graded subspace of E*
and that (F')'=F. 9. Suppose E, E*, F are as in problem 8. Let F1 be a complementary G-graded subspace for F in E (cf. problem 2). Prove that
E* =F'f13F1' and that F, F and F1, F' are two pairs of dual G-graded spaces. 10. Suppose E, E* and F, F* are two pairs of almost finite dual G1L
graded vector spaces, and let p:E—*Fbe a linear mapping homogeneous of degree k. Prove that çQ* exists.
11. Suppose F, E* is a pair of almost finite dual G-graded vector spaces. Let be a basis of F consisting of the set union of bases for the in E* exists. homogeneous subspaces of E. Prove that a dual basis 12. Let F and F be two G-graded vector spaces and p: E—+ F be a homogeneous linear mapping of degree k. Assume further that a homomorphism w:G—*H is given. Prove that p is homogeneous of degree w(k) with erspect to the induced H-gradation. § 2.
G-graded algebras
6.6. G-graded algebras. Let A be an algebra and suppose that a Ggradation A =
is defined in the vector space A. Then A is called a kEG
G-graded algebra if for every two homogeneous elements x and y, xy is
homogeneous, and
deg(xy) = degx + degy. Suppose that A = keG
(6.12)
is a graded algebra with identity element e.
Then e is homogeneous of degree 0. In fact, writing
e=
ek
keG
ekeAk
§ 2. G-graded algebras
175
we obtain for each xeA that
x is homogeneous of degree 1 kEG
whence
xek—O for k+O and so
xe0=x.
(6.13)
Since (6.13) holds for each homogeneous vector x it follows that e0 is a right identity for A, whence e = e e0
= e0.
Thus eeA0 and so it is homogeneous of degree 0.
It is clear that every subalgebra of A that is simultaneously a G-graded subspace, is a G-graded algebra. Such subalgebras are called G-graded subalgebras.
Now suppose that 1c A is a G-graded ideal. Then the factor algebra A/I has a natural G-gradation as a linear space (cf. sec. 6.2) such that the canonical projection ir:A—A/I is homogeneous of degree zero. Hence if and 9 are any two homogeneous elements in A/I we have .9 =
and so
is
deg
= 7t (x y)
homogeneous. Moreover, = deg(x y) = deg x + deg y = deg
+ deg9.
Consequently, A/I is a G-graded algebra. More generally, if B is a second algebra without gradation, and p : A—÷B is an epimorphism whose kernel is a G-graded ideal in A, then the induced G-gradation (cf. sec. 6.2) makes B into a G-graded algebra. Now let A and B be G-graded algebras, and assume that p:A—+B is a
homogeneous homomorphism of degree k. Then ker 'p is a G-graded ideal in A and Im 'p is a G-graded subalgebra of B. G' is a homoSuppose next that A is a G-graded algebra, and r: morphism, G' being a second abelian group. Then it is easily checked that the induced G'-gradation of A makes A into a G'-graded algebra.
Chapter VI. Gradations and homology
176
The reader should also verify that if E is simultaneously a G- and an H-graded algebra such that the gradations are compatible, then the inalgebra. of A makes A into a duced A graded algebra A is called anticommutative if for every two homogeneous elements x and y = if x and y are two homogeneous elements in an associative anticommux y comtative graded algebra such that deg mute, and so we obtain the binomial formula n
yfl - i.
(x +
= an involution w is defined by
In every graded algebra A =
1)kx, wx = (6.14) XEAk. In fact, if XEAk and yeA1 are two homogeneous elements we have
w(xy) =
1)k+lxy = (_
1)1y
=
w preserves products. It follows immediately from (6.14) that = i and so w is an involution. w will be called the canonical involution of the graded algebra A. A homogeneous antiderivation with respect to the canonical involution (6.14) will simply be called an antiderivation in the graded algebra A. It satisfies the relation
Q(xy)=
+(— 1)kxQy,
xeAk,yeA.
If Q1 and Q2 are antiderivations of odd degree then Q1 Q2 + Q2 Q1 is a
derivation. If Q is an antiderivation of odd degree and 0 is a derivation then QO —OQ is an antiderivation (cf. sec. 5.8). Now assume that A is an associative anticommutative graded algebra
and let hEA be a fixed element of odd (even) degree. Then, if Q is a homogeneous antiderivation, p (h) Q is a homogeneous derivation (antiderivation) and if 0 is a homogeneous derivation, p(h)O is a homogeneous antiderivation (derivation) as is easily checked.
Problems 1. Let A be a G-graded algebra and suppose x is an invertible element homogeneous of degree k (cf. problem 7, chap. V, § 1). Prove that 1
§ 2. G-graded algebras
177
is homogeneous and calculate the degree. Conclude that if A is a positively graded algebra, then kz=O. 2. Suppose that A is a graded algebra without zero divisors. Prove that every invertible element is homogeneous of degree zero.
3. Let E, F be G-graded vector spaces. Show that the vector space LG(E; F) generated by the homogeneous linear mappings ço:E-+F is a subspace of L(E; F). Define a natural G-gradation in this subspace such that an element cOELG(E; F) is homogeneous if and only if it is a homogeneous linear mapping. 4. Prove that the G-graded space LG (E; E) (E is a G-graded vector space) is a subalgebra of A (E; E). Prove that the G-gradation makes LG (E; E) into a G-graded algebra (which is denoted by AG (E; E)). 5. Let E be a positively graded vector space. Show that an injective (surjective) linear mapping E) has degree Conclude that a homogeneous linear automorphism of E has degree zero. 6. Let A be a positively graded algebra. Show that the subset Ak of A consisting of the linear combinations of homogeneous elements of degree
k is an ideal. 7. Let E, E* be a pair of almost finite dual G-graded vector spaces. Construct an isomorphism of algebras: &AG(E;E)4 AG(E*;E*)0PP. Hint: See problem 12, chap. V, § 1. Show that there is a natural G-gradation in AG(E*; such that 1i is homogeneous of degree zero. 8. Consider the G-graded space LG (E; E) (E is a G-graded vector space). Assign a new gradation to LG (E; E) by setting
degp =
— degp
whenever PELG(E; E) is a homogeneous element. Show that with this new gradation LG (E; E) is again a G-graded space and AG (F; E) is a
G-graded algebra. To avoid confusion, we denote these objects by LG(E; E) and AG(E; E). Prove that the scalar product between LG (E;
E) and EG (E; E) defined
by
= makes these spaces into dual G-graded vector spaces. 12
Linear Algebra
Chapter VI. Gradations and homology
178
9. Let
be a graded algebra and consider the linear mapping
O:A—*A defined by
Ox = px
Show that 0 is a derivation. §
3•* Differential spaces and differential algebras
6.7. Differential spaces. A differential operator in a vector space E is a linear mapping E—5 E such that = 0. The vectors of ker = Z(E) are called boundaries. it are called cycles and the vectors of Im follows from 132=0 that B(E)cZ(E). The factor space
H(E) = Z(E)/B(E) is called the homology space of E with respect to the differential operator 13. A vector space E together with afixed differential operator 13E' is called a differential space. A linear mapping of a differential space (E, 13E) into a differential space (F, 13F) is called a homomorphism (of differential spaces) if (6.15)
CF0P_(P0GE
It follows from (6.15) that p maps Z(E) into Z(F) and B(E) into B(F). Hence a linear mapping p is an isomorphism of differential spaces and is the linear inverse iso1
morph ism, then by applying p - on the left and right of (6.15) we obtain 1
—1
°
= CEO çø
and so p1 is an isomorphism of differential spaces as well. If 1/1 is a homomorphism of(F, 13k) into a third differential space (G, we
have clearly
In particular, if ço is an isomorphism of E onto F and p isomorphism we have =I =
1
and
= Consequently,
= 1.
is an isomorphism of H(E) onto H(F).
is
the inverse
§ 3. Differential spaces and differential algebras
6.8. The exact triangle. An exact sequence of differential spaces is an exact sequence (6.16)
where (F, aF), (E, and (G, are differential spaces, and 'p, are homomorphisms. Suppose we are given an exact sequence of differential spaces then the sequence H(E) H(G) o is exact at H(E). In fact, clearly, = 0 and so Tm * c ker Conversely, let and choose an element yEZ(E) which repre-
sents /3. Then, since z1EG.
is surjective, there is an element y1 E E such that t/iy1 = z1. It follows that — CGZ1 = 0. — CEll) = = — 6G Since
Hence, by exactness at E,
for some XEF. Applying
we
obtain CE(PX = GEl
=0
whence
Since p is injective, this implies that i.e., XEZ(F). Thus x represents an element It follows from the definitions that (p*
= /3
and so
It should be observed that the induced homology sequence is not short exact. However, there is a linear map, y: H(G)—*H(F) which makes the triangle
H(F)-*H(E)
(6.17)
A
H(G)
exact. It is defined as follows: Let sentative of Choose VEE such that =
and let ZEZ(G) be a repreThen = GG
Z
=0
Chapter VI. Gradations and homology
and so there is an element XEF such that = Since
=
=
=
0
and since is injective, it follows that IFX=O and so x represents an element x of H(F). It is straightforward to check that is independent of all choices and so a linear map y: is defined by It is not difficult to verify that this linear map makes the triangle (6.17) exact at 11(G) and H(F). / is called the connecting homomorphism for the short exact sequence (6.16). 6.9. Dual differential spaces. Suppose (E, is a differential space and consider the dual space E* = L(E). Let a* he the dual map of Then for all xEE, X*EE* we have = <x*,0> =
=
0
whence 3*a*x*_o i.e., (o*)2 = 0.
Thus (E*,
is again a differential space. It is called the dual differential
space.
= Z (E*) are called cocycles (for E) and the vectors The vectors of ker of B(E*) are called coboundaries (for E). The factor space
H(E*) = Z(E*)/B(E*) is called the cohoinology space for E. it will now be shown that the scalar product between E and E* determines a scalar product between the homology and cohomology spaces. In view of sec. 2.26 and 2.28 we have the relations
Z(E*)=B(E)L,
Z(E)=B(E*)L
(6.18)
B(E*) = Z(E)-'-,
B(E) = Z(E*)--.
(6.19)
We can now construct a scalar product between H(E) and H(E*). Consider the restriction of the scalar product between E and E* to Z(E) x Z(E*), Z(E) x Then since, in view of (6.18) and (6.19),
z(E*)±
n
Z(E) = B(E)
n
Z(E) = B(E)
§ 3. Differential spaces and differential algebras
and n
181
B(E*) n z(E*) =
z(E*)
the equation
=
a scalar product between H(E) and H(E*) (cf. sec. 2.23). (E*, Finally, suppose (E, and (F, SF)' (F*, CF*) are two pairs of dual differential spaces. Let
defines
ço:E-*F be a homomorphism of differential spaces, with dual map (p*: Then dualizing (6.15) we obtain *
and so
induced
°
*_ F
* * E0(P
is a homomorphism of differential spaces. It is clear that the mappings
and
H(F*)
: H(E*)
are again dual with respect to the induced scalar products; i.e., I
*\,'# — —I
\*
6.10. G-graded differential spaces. Let E be a G-graded space, E= peG
and consider a differential operator in E that is homogeneous of some degree k. Then a gradation is induced in Z(E) and B(E) by
Z(E)=
Z,,(E)
and B(E)=
peG
and
where
peG
(cf. sec. 6.2).
Now consider the canonical projection
Since rr is an onto map and the kernel of is a graded subspace of Z (E), a G-gradation is induced in the homology space H(E) by
H(E)=
where
peG
Chapter VI. Gradations and homology
The Now consider the subspaces and factor space is called the p-ill homology space of the graded In differential space E. It is canonically isomorphic to the space fact, if then denotes the restriction of it to the spaces
is an onto map and the kernel of =
n
is given by
kent =
n
B(E) =
induces a linear isomorphism of if E is a graded space and dim is finite we write
Hence,
onto
=
dim
is called the p-th Betti number of the graded differential space (E,
If E is an almost finite positively graded space, then clearly, so is H(E). The Poincaré series for H(E) is given by P
D
H(E)
P=o
6.11. Dual G-graded differential spaces. Suppose (E= (E* = keG
E,
Ek, c5)
and
kEG is
a pair of dual G-graded differential spaces. Then if 0E
is homogeneous of degree 1, we have that
E1
E1 +
and hence
= <)j,GEXJ> = 0 unless
it follows that
fl
j+i—l
is homogeneous of degree —1. and so Now consider the induced G-gradations in the homology spaces
The induced scalar product is given by (6.22)
=
Since
and
§ 3. Differential spaces and differential algebras
183
are homogeneous of degree zero, it follows that the scalar product (6.22) respects the gradations. Hence H(E) and H(E*) are again dual G-graded vector spaces. In particular, if G = the p-th homology and cohomology spaces of E are dual. If has finite dimension we obtain that dim
=
dim
6.12. Differential algebras. Suppose that A is an algebra and that 13 is a differential operator in the vector space A. Assume further that an involution w of the algebra A is given such that 13w+w13=O, and that 13 is an antiderivation with respect to i.e., that (6.23)
Then (A, 13) is called a differential algebra.
It follows from (6.23) that the subspace Z(A) is a subalgebra of A. Further, the subspace B(A) is an ideal in the algebra Z(A). In fact, if and 13xeB(A) we have
yeZ(A)
13(xy) = 13xy
and
13(wy.x)= w2 y13x +
y13x
yeZ(A)
whence 13x .yeB(A) 13xeB(A). Hence, a multiplication is induced in the homology space H(A). The space H(A) together with this multiplication is called the homology algebra of the differential algebra (A, 13). The multiplication in H(A) is given by
irz1 nz2 =
z1,z2eZ(A)
m(z1 z2)
where ir:Z(A)—÷H(A) denotes the canonical projection. If A is associative (commutative) then so is H(A). Let (A, 8A) and (B, 0B) be differential algebras. Then a homomorphism A -+B is called a homomorphism of d(fferential algebras if 'P 13A =
13B
It follows easily that the induced mapping : is a homomorphism of homology algebras. Suppose now A is a graded algebra and that 13 and a) are both homogeneous, w of degree zero. The A is called a graded differential algebra. Consider the induced gradation in H(A). Since the canonical projection m:Z(A)—÷H(A) is a homogeneous map of degree zero it follows that H(A) is a graded algebra.
Chapter VI. Gradations and homology
If A is an anticommutative graded algebra, then so is H(A) as follows from the fact that rr is a homogeneous epimorphism of degree zero.
Problems 1. Let (E, 0k), (F, 02) be two differential spaces and define the differby ential operator 8 in 8= Prove that
2. Given a differential space (E, 0), consider a differential subspace; i.e., a subspace E1 that is stable under 0. Assume that Q:E—÷E1 is a linear mapping such that i) ii)
VEE1
iii) QX — XEB(E)
XEZ(E).
Prove that the induced mapping
H(E1) is a linear isomorphism. 3. Let (F, 0) be a differential space. A homotopy operator in E is a linear transformation h:E—*E such that
hO + Oh = i.
Show that a homotopy operator exists in E if and only if H(E)==O. 4. Let (E, be and (F, OF) be two differential spaces and let =1/1* if and only if homomorphisms of differential spaces. Prove that there exists a linear mapping such that liCE + CFh =
—
is called a honiotopy operator connecting çø and //. Show that problem 3 is a special case of problem 4. 5. Let 81, 02 be differential operators in Ewhich commute, 8102=8281. a) Prove that 01 02 is a differential operator in E. b) Let B1, B2, B be the boundaries with respect to 82 and 82. Prove that 02(B1) = 81(B2) = B. h
§ 3. Differential spaces and differential algebras
c) Let Z1, Z2, Z that
Z1 + Z2
be the cycles with respect to 02 and Z. Establish natural linear isomorphisms
Z/Z1 4B1 n
Z2
and
Z/Z2
185
Show
4B2 fl Z1.
d) Establish a natural linear isomorphism (B1 n
n
Z1)/02(Z1)
and then show that each of these spaces is linearly isomorphic to Z/(Z1 + Z2). induces a differential operator in Z2. Let P1 denote e) Show that the corresponding homology space. Assume now that Z=Z1 +Z2 and prove that P1 can be identified with a subspace of the homology space H1 =Z1/B1. State and prove a similar result for 02. f) Show that the results a) to e) remain true if 0102 02 be differential operators in E such that 0102= are differential operators in E. a) Prove that 01+02 and b) With the notation of problem 5, assume that
B=B1nB2 and Z=Z1+Z2. Prove that the homology space is linearly isomorphic to
of each of the differential operators in a)
Z1 n Z2/(Z1 (This
n
B2 + Z2 n B1).
is essentially the Künneth theorem of sec. 2.10
7.
formula. Let E =
be
volume II.)
a finite dimensional
graded
differential space and assume that 0 is homogeneous of degree — be a homomorphism of differential spaces, (1=0 in E0). Let p: homogeneous of degree zero. Denote the restrictions of p (respectively by ço1, (respectively Prove the (respectively to Lefschetz formula —
—
p=O
Conclude
=
p=O
that —
(EP)
p=O
and PH(E). (Euler-Poincaré formula). Express this formula in terms of The number given in (EP). is called the Euler-Poincaré characteristic
of E.
Chapter VII
Inner product spaces In this chapter all vector spaces are assumed to be real vector spaces
§ 1. The inner product 7.1. Definition. An inner product in a real vector space E is a bilinear function (,) having the following properties: 1. Symmetry: (x, y)=(y, x).
2. Positive definiteness: (x, x)O, and (x, x)=O only for the vector x==O.
A vector space in which an inner product is defined is called an inner product space. An inner product space of finite dimension is also called a Euclidean space. The norm xl of a vector xEE is defined as the positive square-root
A unit vector is a vector with the norm 1. The set of all unit vectors is called the unit-sphere. It follows from the bilinearity and symmetry of the inner product that x + y12 = 1x12 + 2(x,y)+ JyV
whence
(x,y) = 4(lx +
y12
-
This equation shows that the inner product can be expressed in terms of the norm. The restriction of the bilinear function (,) to a subspace E1 E has again properties 1 and 2 and hence every subspace of an inner product space is itself an inner product space. The bilinear function (,)is non-degenerate. In fact, assume that (a,y)=O
for a fixed vector aeE and every vector yeE. Setting y=a we obtain (a, a) =0 whence a =0. It follows that an inner product space is dual to itself.
7.2.
§ 1. The inner product
187
Examples. 1. In the real number-space
standard inner pro-
duct is defined by
(x,y) where
x =
and
...
...
y =
2. Let E be an n-dimensional real vector space and basis of E. Then an inner product can be defined by
(v =
1.
.
.n) be a
(x,y) = where
3.
Consider the space C of all continuous functions f in the interval 1 and define the inner product by
(f,g) = Jf(t)g(t)dt. 7.3. Orthogonality. Two vectors xeE and yeE are said to be orthogonal if (x, y)=O. The definiteness implies that only the zero-vector is orthogonal to itself. A system of p vectors +0 in which any two vectors are orthogonal, is linearly independent. In fact, the rex. and lation =0 yields x,1) =
0
=1
...
p)
whence
Two subspaces E1 E and E2 c E are called orthogonal, denoted as E1 ±E2, if any two vectors X1EE1 and x2eE2 are orthogonal.
7.4. The Schwarz-inequality. Let x and y be two arbitrary vectors of the inner product space E. Then the Schwarz-ine quality asserts that (x,y)2
1x121y12
(7.1)
and that equality holds if and only if the vectors are linearly dependent. To prove this consider the function Ix
+
Chapter VII. Inner product spaces
of the real variable 2. The definiteness of the inner product implies that
Expanding the norm we obtain )2
+ 22(x, y) + x12
0.
Hence the discriminant of the above quadratic expression must be negative or zero,
(x,r)2 < Now assume that equality holds in (7.1). Then the discriminant of the quadratic equation + 22(x,y) + lxi2 = 0
221yi2
is zero.*) Hence equation (7.2) has a real solution
(7.2)
It follows that
i2oy + XV = 0, whence 2oY + X = 0.
Thus, the vectors x and y are linearly dependent. 7.5. Angles. Given two vectors x + 0 and y 0, the Schwarz-inequality implies that (x,y) —
1
- lxi -1.
Consequently, there exists exactly one real number w (0
(x y)
cosw=—
w
m) such that (7.3)
.
lxi
The number w is called the angle between the vectors x and y. The sym-
metry of the inner product implies that the angle is symmetric with respect to x and y. If the vectors x and y are orthogonal, it follows that cos co =0, whence U) =
—
2
Now assume that the vectors x and y are linearly dependent, y=2x, Then
2
1+1
121
L—1
if 2>0 if 2<0
*) Without loss of generality we may assume that y
0.
§ 1. The inner product
and hence (0
if 2>0
(ic
if 2<0.
189
With the help of (7.3) the equation fx — y12
= ixi2 — 2(x,y) + iyi2
can be written in the form fx — y12 = 1x12 + 1y12 — 2fxi iylcosw.
This formula is known as the cosine-theorem. If the vectors x and y are
orthogonal, the cosine-theorem reduces to the Pythagorean theorem
ix- y12 = 7.6.
ixi2 + fyi2.
The triangle-inequality. It follows from the Schwarz-inequality
that lx
ixi2 + 2fxf fyI + fyi2
+ yi2 = ixi2 + 2(x,y) + fyi2
(lxi +
whence
x+yf fxi +iyi.
(7.4)
Relation (7.4) is called the triangle-inequality. To discuss the equalitysign we may exclude the trivial case y 0. It will be shown that equality holds in (7.4) if and only if
x—2y, 2>0. The equation
Ix+yi=ixi+iyi implies that lxi
2
+ 2(x,y)+
fyi2
= lxi 2 + 2fxifyf +
whence
(x, y) = lxi fyi.
(7.5)
Thus, the vectors x and y must be linearly dependent,
x=2y. Equations (7.5) and (7.6) yield 2=121, whence 20. Conversely, assume that x = 2y, where 2 0. Then fx
+ yf = (2 + 1)yI = (2 + 1)fyf = 2fyf + iyf = fxf + fyj.
(7.6)
Chapter VII. Inner product spaces
Given three vectors x, y, z, the triangle-inequality can be written in the form
x-yl Ix-zI +lz-yi.
(7.7)
As a generalization of (7.7), we prove the Ptolemy-inequality
ix-yllzl ly-zHxl +lz-xilyi.
(7.8)
Relation (7.8) is trivial if one of the three vectors is zero. Hence we
may assume that x+O, y+O and z+O. Define the vectors x', y' and z' by x
X—2, Y lxi
y
,
z Z—2. ,
2'
Izi
Then
lv'—y'l2=
k—12 xi2 in2'
1
lxl2
lxl2 lyi2
lyl2
Applying the inequality (7.7) to the vectors x', y' and z' lxi
=
we
obtain
Izi lxi'
Izi
whence (7.8).
7.7. The Riesz theorem. Let E be an inner product space of dimension n and consider the space L(E) of linear functions. Then the spaces L(E) and E are dual with respect to the bilinear function defined by
On the other hand, E is dual to itself with respect to the inner product. Hence Corollary II to Proposition I sec. 2.33 implies that there is a linear isomorphism a—*fa of E onto L(E) such that fa(Y) = (a,y). In
other words, every linear function f in E can be written in the form
f(y) and
= (a,y)
the vector aEE is uniquely determined byf(Riesz theorem).
Problems 1. For x =
1
(x,y) satisfies
show that the bilinear function
in
and y = —
the properties listed in sec. 7.1.
—
+
§ 2. Orthonormal bases
191
2. Consider the space S of all infinite sequences that
Show that
•••) such
converges and that the bilinear function (x,
is an inner product. 3. Consider three distinct vectors x40, y+O and z40. Prove that the equation lxi + iz - xi fyi ix izi = iY
-
-
holds if and only if the four points x, y, z, 0 are contained on a circle such
that the pairs x, y and z, 0 separate each other. 4. Consider two inner product spaces E1 and E2. Prove that an inner product is defined in the direct sum E1 EEE2 by x1,y1 eE1,
((x1,x2),(y1,y2)) = (x1,y1) + (x2,y2) 5.
x2,y2eE2.
Given a subspace E1 of a finite dimensional inner product space E,
consider the factor space E/E1. Prove that every equivalence class con-
tains exactly one vector which is orthogonal to E1. § 2.
Orthonormal bases
7.8. Definition. Let E be an n-dimensional inner product space and (v = .n) be a basis of E. Then the bilinear function (,) determines a symmetric matrix (v,p = 1... n). (7.9) 1 . .
The inner product of two vectors x= can
and
be written as
(x,y) =
if1(x
y=
x) =
(7.10)
and hence it appears as a bilinear form with the coefficient-matrix The basis (v = .ii) (v = .11) is called orthonornial, if the vectors are mutually orthogonal and have the norm 1, 1
1
. .
=
. .
(7.11)
Chapter VII. Inner product spaces
192
Then formula (7.10) reduces to
(x,y) and in the case y = x ixi2
The substitution
(7.12)
=
in (7.12) yields
=
(p
= 1... n).
(7.13)
Now assume that x+0, and denote by the angle between the vectors x and Formulas (7.3) and (7.13) imply that =
(p =
1
n).
(7.14)
lxi
If x is a unit-vector (7.14) reduces to cos
(p = I ... n).
=
(7.15)
These equations show that the components of a unit-vector x relative to an orthonormal basis are equal to the cosines of the angles between x and the basisvectors 7.9. The Schmidt-orthogonalization. In this section it will be shown that an orthonormal basis can be constructed in every inner product space of finite dimension. Let (v = ii) be an arbitrary basis of E. Starting out from this basis a new basis (v = I .. n) will be constructed whose vectors are mutually orthogonal. Let b1 = a1. Then put b2 = a2 + 2b1 1 . .
.
and determine the scalar A such that (h1, h2)=0. This yields
(a2,b1) + A(b1,b1) = 0. Since b1 40, this equation can be solved with respect to A. The vector b2 thus obtained is different from zero because otherwise a1 and a2 would be linearly dependent.
To obtain b3 set
b3=a3 -i-pb1 +-vb2
and determine the scalars p and v such that (b1,b3) =
0
and
(b2,b3) = 0.
§ 2. Orthonormal bases
193
This yields
b1) = 0
(a3, b1) +
and (a3, b2) + v(b2,b2)
0.
Since b1 + 0 and b2 + 0, these equations can be solved with respect to ji and v. The linear independence of the vectors a1, a2, a3 implies that b3 +0. Continuing this way we finally obtain a system of n vectors
such that
+ 0 (v = 1.. .n)
(v+ji).
It follows from the criterion in sec. 7.3, that the vectors are linearly independent and hence they form a basis of E. Consequently the vectors (v
=
= 1 ... n)
form an orthonormal basis. 7.10. Orthogonal transformations. Consider two orthogonal bases and (v = 1.. .n) of E. Denote by the matrix of the basis-transformation (7.16)
The relations and imply that (7.17)
This equation shows that the product of the matrix and the transposed matrix is equal to the unit-matrix. In other words, the transposed matrix coincides with the inverse matrix. A matrix of this kind is called orthogonal.
Hence, two orthonormal bases are related by an orthogonal matrix. Conversely, given an orthonormal basis (v 1. . n) and an orthogonal the basis defined by (7.16) is again orthonormal. n x n-matrix .
7.11. Orthogonal complement. Let E be an inner product space (of finite or infinite dimension) and E1 be a subspace of E. Denote by set of all vectors which are orthogonal to E1. Obviously,
E only.
of the zero-vector
is called the orthogonal complement of E1. If E has finite dimen-
sion, then we have that
dimE1 +dimEiL= dimE 13
the
Greub. Linear Algebra
Chapter VII. Inner product spaces
and hence E1
n E iL
=
0
implies that (7.18)
Select an orthonormal basis and a vector y= of
E1 consider
rn) of E1. Given a vector XEE
1
the difference z
=x
—
y.
Then (z,
= (x,
—
= (x,
(y,
if and only if
This equation shows that z is contained in (R
—
= 1... rn).
We thus obtain the decomposition
x=p+h
(7.19)
where
p is called the orthogonal projection of x onto E1.
Passing over to the norm in the decomposition (7.19) we obtain the relation ix12
= pt2 + hI2.
(7.20)
Formula (7.20) yields Bessel's-inequality lxi
showing that the norm of the projection never exceeds the norm of x. The
equality holds if and only if h=0, i.e. if and only if xeE1. The number ihi is called the distance of x from the subspace E1.
Problems 1. Starting from the basis a1 = (1,0,1) a2 = (2,1,
—
3)
a3 = (— 1,1,0)
construct an orthonormal basis by the Schmidtof the number-space orthogonalization process.
§ 3. Normed determinant functions
195
2. Let E be an inner product space and consider E as dual to itself. Prove that the orthonormal bases are precisely the bases which are dual to themselves.
3. Given an inner product space E and a subspace E, of finite dimension consider a decomposition
x=x1+x2 and the projection
x,eE,
x=p+h
Prove that 1X21
Ihi
that equality is assumed only if x, =p and x2 = h. 4. Let C be the space of all continuous functions in the interval 0 t 1 with the inner product defined as in sec. 7.2. If C' denotes the subspace of all continuously differentiable functions, show that (C1)' = 0. 5. Consider a subspace E1 of E. Assume an orthogonal decomposition and
E,=F1$G, F1±G,. Establish the relations
F,' =
I G1
and
IF1.
=
6. Let F3 be the space of all polynomials of degree inner product of two polynomials as follows: (P,Q)
2. Define the
= f P(t)Q(t)dt.
The vectors 1, t, t2 form a basis in F3. Orthogonalize and orthonormalize this basis. Generalize the result for the case of the space P of polynomials of degree § 3.
Normed determinant functions
7.12. Definition. Let E be an n-dimensional inner product space and A0+O be a determinant function in E. Since E is dual to itself we have in view of (4.21) z10 (x,, ...
where
...
is a real constant. Setting
= det (x1,
e E,
where
eE
is an orthonormal
Chapter VII. Inner product spaces
basis we obtain
= z10(e1 ...
and so the constant
(7.21)
is positive. Now define a determinant function A
by A
(7.22)
=±
Then we have
A (x1 ...
=
(Yi ...
(7.23)
y1).
A determinant function in an inner product space which satisfies (7.23) is called a normed determinant function. It follows from (7.22) that there are precisely two normed determinant functions A and —A in E. Now assume that an orientation is defined in E. Then one of the functions A and —A represents the orientation. Consequently, in an oriented inner product space there exists exactly one normed determinant function representing the given orientation.
7.13. Angles in an oriented plane. With the help of a normed determinant-function it is possible to attach a sign to the angle between two vectors of a 2-dimensional oriented inner product space. Consider the normed determinant function A which represents the given orientation. Then the identity (7.23) yields 1x12
(7.24)
1y12 — (x, y)2 = A (x, y)2.
Now assume that x+O andy+O. Dividing (7.24) by 1x121y12 we obtain the relation + 1x121y12
1x121y12
Consequently, there exists exactly one real number 0 mod 2m such that
cosO =
(x,y)
.
and
sin0 =
lxi
A(x,y) .
lxi
(7.25)
This number is called the oriented angle between x and y.
if the orientation is changed, A has to be replaced by —A, and hence 0 changes into —0. Furthermore it follows from (7.25) that 0 changes sign if the vectors x and y are interchanged and that 0(x,
—
y)
= 0(x, y) +
mod 2it.
§ 3. Normed determinant functions
197
1.. .p) in an inner 7.14. The Gram determinant. Given p vectors product space E, the Gram determinant G (x1 . x,,) is defined by . .
= det
G (x1 ...
It will be shown that
\ (xi,, x1) ... (xe,
G(x1 ...
(7.26)
).
(
0
(7.27)
and that equality holds if and only if the vectors (x1 . .x,) are linearly dependent. in the case p = 2 (7.27) reduces to the Schwarz-inequality. To prove (7.27), assume first that the vectors (v 1.. .p) are linearly .
dependent. Then the rows of the matrix (7.26) are also linearly dependent whence
if the vectors (v = .. .p) are linearly independent, they generate a p-dimensional subspace E1 of E. E1 is again an inner product space. Denote by A1 a normed determinant function in E1. Then it follows from (7.23) that G(x1 ... = A1(x1 ... 1
The linear independence of the vectors A1 (x1 .. . x,,) +0,
(v = .. .p) 1
implies that
whence
7.15. The volume of a parallelepiped. Let p linearly independent vectors be given in E. The set
(v=1...p)
(7.28)
is called the p-dimensional parallelepiped spanned by the vectors (v = 1.. .p). The volume V(a1 ..
of the parallelepiped is defined by (7.29)
where A1 is a normed determinant function in the subspace generated by the vectors (v = .p). In view of the identity (7.23) formula (7.29) can be written as 1 .
.
V(a1 ...
= det
(
a1) ... (ar,
).
(7.30)
Chapter VII. Inner product spaces
198
In the case p = 2 the above formula yields V(ai,a2)2=1a1121a212—(a1,a2)2=1a1121a212sin20,
(7.31)
where 0 denotes the angle between a1 and a2. Taking the square-root on
both sides of (7.31), we obtain the well-known formula for the area of a parallelogram: V(a1,a2) = 1a11 1a21 sin
p) and de-
Going back to the general case, select an integer i (1 i compose a1 in the form
a, =
v*i
+
=
where
(v + i).
0
(7.32)
Then (7.29) can be written as V(a1 ...
=
A1 (a1
...
...
Employing the identity (7.23) and observing that (hi,
= 0 (v +1) we
obtain *) (a1, a1) ... (a1, a1) ... (a
V(a1 ...
det
(7.33)
...
The determinant in this equation represents the square of the volume of the(p — 1)-dimensional parallelepiped generated by the vectors (a1 . .
a1..
We thus obtain the formula V(a1 ... a',) = V(a1
showing that the volume V(a1 .
(1 .
is
i
p)
the product of the volume
of the "base" and the corresponding height. 7.16. The cross product. Let E be an oriented 3-dimensional Euclidean space and A be the normed determinant function which represents the orientation. Given two vectors xeE and yEE consider the linear function f defined by (7.34) f (z) = A (x, y, z). V(a1 . . .á,. .
In view of the Riesz-theorem there exists precisely one vector uEE such that (7.35) f (z) = (u, z). *) The symbol at indicates that the vector at is deleted.
§ 3. Normed determinant functions
199
The vector u is called the cross product of x and y and is denoted by x x y. Relations (7.34) and (7.35) yield
(x xy,z)=A(x,y,z).
(7.36)
It follows from the linearity of 4 in x and y that the cross product is distributive (Ax1 + px2) x y = Ax1 x y + px2 x x x (AY1 + 11Y2) = AX X Yi + PX X
y
and hence it defines an algebra in E. The reader should observe that the
cross product depends on the orientation of E. If the orientation is reversed then the cross product changes its sign. From the skew symmetry of 4 we obtain that
x xy=—y xx. Setting
z=x
in (7.36) we obtain that
(x x y,x) = 0.
Similarly it follows that
(x xy,y)=O and so the cross product is orthogonal to both factors. It will now be shown that x x y + 0 if and only if x and y are linearly independent. In fact, if y—Ax, it follows immediately from the skew symmetry that x x y =0. Conversely, assume that the vectors x and y are linearly independent. Then choose a vector zEE such that the vectors x, y, z form a basis of E. It follows from (7.36) that (x
x y,z) =
zl(x,y,z) + 0
whence x x y +0.
Formula (7.36) yields for z=xxy
A(x,y,x x y) = Ix x
(7.37)
y12.
If x
and y are linearly independent it follows from (7.37) that 4 (x, y, x x y) >0 and so the basis x, y, x x y is positive with respect to the given orientation. Finally the identity
(x1 x x2,y1 x j'2) = (x1,y1)(x2,y2)
—
(x1,y2)(x2,y1)
will be proved. We may assume that the vectors x1,
x2
(7.38)
are linearly inde-
Chapter VII. Inner product spaces
200
pendent because otherwise both sides of (7.38) are zero. Multiplying the relations A(x1,x2,x3) = (x1 x x2,x3) and x A(y1,y2,i'3) = we obtain in view of (7.23) (x1 x x2, x3)(v1
13) =
Setting Y3 = x1 x x2 and expanding the determinant on the right hand side
by the last row we obtain that
(x1 x x2,x3)(y1 x
x x2) =
(x1 x x2, x3) [(x1, v1)(x2, v2) — (x1,
y2)(x2, v1)].
(7.39)
Since x1 and x2 are linearly independent we have that x1 x x2 + 0 and hence x3 can be chosen such that (x1 x x2, x3)+0. Hence formula (7.39) implies (7.38).
Formula (7.38) yields for x1=y1=x and x2=y2=y (7.40)
x
If 0(0 0 the form
m) denotes the angle between x and y we can rewrite (7.40) in
= xl yI sin 0
Ix x
x + 0, y + 0.
Now we establish the triple identity
xx (1'x z)=(x,z)y—(x,y)z. In fact, let UEE
be
(7.41)
arbitrary. Then formulae (7.36) and (7.38) yield
(xx ft x z),u) = A(x,y x z,u)= — 4(y x z,x,u) = — ft x z, x x u) = — (,x)(z, u) + (y, u)(z, x)
Since ueE is arbitrary, (7.41) follows. From (7.41) we obtain the Jacobi identity
xx(y xz)+vx(z x x)+:x(x xy)=0. Finally note that if e1, e2, e3 is a positive orthonormal basis of E we have the relations X e2
=
C2 X Cf3 = e1,
Cf3
X
= C2.
§ 3. Normed determinant functions
201
Problems 1. Given a vector a +0 determine the locus of all vectors x such that x—a is orthogonal to x+a. 2. Prove that the cross product defines a Lie-algebra in a 3-dimensional inner product space (cf. problem 8, Chap. V, § 1). 3. Let e be a given unit vector of an n-dimensional inner product space E and E1 be the orthogonal complement of e. Show that the distance of a vector xeE from the subspace E1 is given by
d= (x,e)J. 4. Prove that the area of the parallelogram generated by the vectors x1 and x2 is given by A = — a)(s — b)(s — c), where
a=1x11,
b=1x21, c=1x2—xiI, s=4(a+b+c).
5. Let a +0 and b be two given vectors of an oriented 3-space. Prove that the equation x x a = b has a solution if and only if (a, b) = 0. If this condition is satisfied and x0 is a particular solution, show that the general solution is x0+2a. 6. Consider an oriented inner product space of dimension 2. Given two positive orthonormal bases (e1, e2) and (e1, e2), prove that = e1 cos w — e2 sin co = e1 sin co + e2 cos co. where co is the oriented angle between e1 and ë1.
7. Let a1 and a2 be two linearly independent vectors of an oriented Euclidean 3-space and F be the plane generated by a1 and a2. Introduce an orientation in F such that the basis a1, a2 is positive. Prove that the angle between two vectors and
is determined by the equations —
cosO
=
lxi lyl
and sinO =
lxi lyl
x a21(— ic <0 pr).
Chapter VII. Inner product spaces
2U2
8. Given an orthonormal basis linear transformations
=x x Prove
9.
1, 2, 3) in the 3-space, define
by
(v = 1,2,3).
that
Let zl be a determinant function in the plane. Prove the identity
(x. x1)zl(x,, x3) + (x. x2)4(x3, x1) + (x, x3)zl(x1,
10. Let
x2)= 0
(1= 1. 2, 3) be unit vectors in an oriented plane and denote
by
the
e
formulae
xEE.
cosO13 = cose12 cosO23 — sin e12 sine23 sin e13
11. Let x, y, z
=
cose23 + cosO12
sine23.
be three vectors of a plane such that x and y are linearly
independent and that x+y+z=0.
a)
Prove that the ordered
pairs x, y; y, z and
z,
x represent
the same
orientation. Then show that
O(x,y)+
where
the angles refer
O(y,z) + O(z,x)=
to the above orientation.
b) Prove that O(y, — x) + O(z,
—
y) + O(x, — z) =
What is the geometric significance of the two above relations?
12. Given p vectors x1, ..., G(x1,
x,,
prove the inequality 1x112 x212...
Then derive Hadamard's inequality for a determinant /a11 ... a
§ 4.
Duality in an inner product space
7.18. The isomorphism t. Let E be an inner product space ofdi let E* be a vector space which is dual to E with respect to a scalar
ii and
§ 4. Duality in an inner product space
203
product <,). Since E* and E are both dual to E it follows from sec. 2.33
such that
that there is a linear isomorphism
<xx,y>_—(x,y) x,yEE.
(7.42)
With the aid of this isomorphism we can introduce a positive definite inner product in E* given by y*). (x*, y*) = (r (7.43) 1
1
Now introduce a scalar product in Ex E* by =
(7.44)
Then it follows from (7.42) and (7.44) that
= (x,y) = (y,x) = = <x,ty>. This relation shows that the dual mapping z*:E*÷_E coincides with z
and so z is dual to itself. e*v (v = 1. .n) be a pair of dual bases of E and E* and consider Let the matrices = (e*v, and (7.45) = .
It follows from the symmetry of the inner product that the matrices (7.45) are symmetric. On the other hand, the linear isomorphism determines an n x n-matrix by teA
Taking the inner product with
yields
=
= (eA,
=
(7.46)
A similar argument shows that — 1
=
e,2.
From (7.46) and (7.47) we obtain that
s'
pKçK
and hence the matrices (7.45) are inverse to each other.
(7.47)
Chapter VII. Inner product spaces
204
If
x=
(7.48)
is an arbitrary vector of E we can write (7.49)
The numbers are called the Co variant components of x with respect to the basis e1 ().= I .n). It follows from (7.48) that . .
=
=
= =
whence
=
(7.50)
We finally note that the covariant components of a vector XEE are its inner products with the basis vectors. In fact, from (7.48) and (7.50) we obtain that (x, e%,) =
=
=
If the basis e%,(v= l...n) is orthonormal we have that formulae (7.46) simplify to It follows that t
= and hence
every orthonormal basis of E into the dual basis. Moreover, the equations (7.50) reduce in the case of an orthonormal basis to
maps
— —
Problems 1. Let 1 ...n) be a basis of E consisting of unit vectors. Given a vector xeE write x = + h, where is the orthogonal projection of x onto the subspace defined by (x, e,) = 0. Show that
i=1...n where the are the covariant components of x with respect to the basis 2. Let E, E* be a dual pair of finite dimensional vector spaces and consider a linear isomorphism Find necessary and sufficient con-
§ 5. Normed vector spaces
205
ditions such that the bilinear function defined by
(x,y)=
x,yeE
be a positive definite inner product. § 5.
Normed vector spaces
7.19. Norm-functions. Let E be a real linear space of finite or infinite dimension. A norm-function in E is a real-valued function ii having the following properties: ii
0 for every x e E, and lix ii = 0 only if x = 0. N1: lxii N2: lix + iixil + iiyii. N3:
=
A linear space in which a norm-function is defined is called a normed linear space. The distance of two vectors x and y of a normed linear space is defined by = lix - yii. N1, N2 and N3 imply respectively
Q(x,y)>O (x, y)
Q(x,y)=
if x+y (x, z) + (z, y)
(triangle inequality)
Q(y,x).
is a metric in E and so it defines a topology in E, called the norm topology. It follows from N2 and N3 that the linear operations are continuous in this topology and so E becomes a topological vector space. 7.20. Examples. 1. Every inner product space is a normed linear space with the norm defined by Hence
iixii
2.
Let C be the linear space of all continuous functions fin the interval 1. Then a norm is defined in C by
= max Ot 1
f(t)l.
Conditions N1 and N3 are obviously satisfied. To prove N2 observe
that
1(t) + g(t)l
If (t)I + ig(t)i
ill ii +
whence
ui +
ii + iigii.
,
(0
t 1)
Chapter VII. inner product spaces
3. Consider an n-dimensional (real or complex) linear space E and let (v 1 .. .n) be a basis of E. Define the norm of a vector
= by 7.21. Bounded linear transformations. A linear transformation p: of a normed space is called bounded if there exists a number M such that
xEE.
(7.51)
It is easily verified that a linear transformation is bounded if and only if it is continuous. It follows from N2 and N3 that a linear combination of bounded transformations is again bounded. Hence, the set B(E; E) of all bounded linear transformations is a subspace of L (E; E). Let be a bounded linear transformation. Then the set = 1 is bounded. Its least upper bound will be denoted by II'pII
= sup
(7.52)
lixil = 1
It follows from (7.52) that
xeE. Now it will be shown that the function (p—* thus obtained is indeed a norm-function in B(E; E). Conditions N1 and N3 are obviously satisfied. To prove N2 let ço and be two bounded linear transformations. Then
xeE and consequently
The norm-function
has the following additional property: <
(7.53)
.
.
In fact, .
XEE
whence (7.53).
7.22. Normed spaces of finite dimension. Suppose now that E is a normed vector space of finite dimension. Then it will be shown that the norm topology of E coincides with the natural topology (cf. sec. 1 .22). Since the linear operations are continuous it has only to be shown that a linear function is continuous in the norm topology. Let (v = I, ..., 11) be a basis
§ 5. Normed vector spaces
207
of E. Then we have in view of N2 and N3 that = This relation implies that the function
is continuous in the natural
topology. Now consider the set Q c E defined by
in the naturaltopology and Q that there exists a positive constant 1)1 such that
for xeQ it follows
xeQ. Now N3 yields
xeE whence
v= 1,...,n.
(7.54)
Let f be a linear function in E. Then we have in view of (7.54) that
M
f(x)l = and sof is continuous. This completes the proof.
Since every linear transformation 'p of E is continuous (cf. sec. 1.22) it follows that 'p is bounded and hence B(E; E)=L(E; E). Thus L(E; E) becomes a normed space, the norm of a transformation 'p being given by kpM = max IIxH =1
Problems 1. Let E be a normed linear space and E1 be a subspace of E. Show that a norm-function is defined in the factor-space E/E1 by
= inf xex 1, 2...) of a normed linear 2. An infinite sequence of vectors space E is called convergent towards x if the following condition holds: To every positive number c there exists an integer N such that
if n>N.
Chapter VII. Inner product spaces
a) Prove that every convergent sequence satisfies the following Cauchycriterion: To every positive number a there exists an integer N such that — Xmh
n > N and in > N.
b) Prove that every Cauchy.sequence*) in a normed linear space of finite dimension is convergent.
c) Give an example showing that the assertion b) is not necessarily correct if the dimension of E is infinite. 3. A normed linear space is called complete if every Cauchy-sequence is convergent. Let E be a complete normed linear space and be a linear
transformation of E such that
<1. Prove that the series
convergent and that the linear transformation
v0
pV is
= has
the following properties:
a) b) 1—
§ 6.
The algebra of quaternions
7.23. Definition. Let E be an oriented Euclidean space of dimension 4. Choose a unit vector e, and let E1 denote the orthogonal complement of e. Let E1 have the orientation induced by the orientation of E and by e (cf. sec. 4.29). Observe that every vector XEE can be uniquely decomposed in the form
x=),e+x1 Now consider the bilinear map E x
X1EE1.
defined by
ex= x, xe= x =
— (x,
v) e + x x v
XEE
(7.55)
x.
(7.56)
where x denotes the cross product in the oriented 3-space E1. It is easily checked (by means of formula (7.41)) that this bilinear map makes E into an associative algebra. This algebra is called the algebra *) i.e. a sequence satisfying the Cauchy-criterion.
§ 6. The algebra of quaternions
209
of quaternions and is denoted by 0+ In view of (7.55), e is the unit element of 0-fl while (7.56) shows that
xy+yx=—2(x,y)e
x,yEE1
and so the algebra 0-fl is not commutative.
The elements of E are called quaternions, and the elements of E1 are
called pure quaternions. The conjugate of a quaternion e R, X1EE1) is defined by
=
C
— X1
It is easily verified that X,yEE and
XEE.
Note that xeE1 if and only if x= —x. Next, let XEO-fl be arbitrary and write
x
=
e
+ (x1, x1) e = (x, x) e =
e.
Similarly,
x=
e.
Thus we have the relations x=
=
x
e.
Now assume that x+O and define x' by 1
X
X.
=
Then the relations above yield
x x' =
x=e
(x + 0).
Thus every non-zero element in has a left and right inverse and is a division algebra. Finally note that the multiplication in satisfies the relations I-fl
so 0-0
0-fl
(x y, x z) = and
z)
(y. x, z. x) = (y,
x, y, ZE0-fl
z)
(7.57)
(7.58)
which are easily verified using (7.36) and (7.38). In particular, we have
= 14
Greub. Linear Algebra
.
yI
x, yE0+
Chapter VII. Inner product spaces
Proposition I: The 3-linear function in E1 given by = (x1 x2, x3)
x1,
X3EE1
is a normed determinant function in E1 and represents the orientation of E1.
Proof: First we show that 4 is skew symmetric. In fact, formulae (7.58) and (7.57) imply that 4(x1, x, x) =
(x1
.
x, x) =(x1, e)
=0
and zl(x, x2, x) = (x . x2, x) = (x2, e) x12 = 0.
Thus zl is skew symmetric. Next observe that 4(x1, x2. x3) = {4(x1, x2, x3) = —
4(x2, x1. x3)}
x x2, x3).
.
This relation shows that 4 is a normed determinant function in E1 and represents the orientation of E1. 7.24. Associative division algebras. Let A be an associative division algebra (cf. sec. 5.1) with unit element e. Observe that the real numbers, the complex numbers and the quaternions form associative division The dimensions of these algebras are respectively 1, 2 algebras over and 4. We shall show that these are the on/i finite dimensional associative division algebras over Let A be any such algebra with unit element e. Let aEA be arbitrary and consider the n + 1 powers
a'(v=0
n,a°=e)
n=dimA.
Since these elements are linearly dependent we have a non-trivial relation C!' = 0
This relation can be written in the form
f(a) = where f is the polynomial given by
f(t)
tv
0
(7.59)
§ 6. The algebra of quaternions
211
By the fundamental theorem of algebra, J is a product of irreducible polynomials of degree 1 and 2.