23.07.2012 Views

Linear Algebra

Linear Algebra

Linear Algebra

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Section I. Isomorphisms 169<br />

(d) Suppose that U and W are subspaces of a vector space V such that V =<br />

U ⊕ W . Show that the map f : U × W → V given by<br />

f<br />

(�u, �w) ↦−→ �u + �w<br />

is an isomorphism. Thus if the internal direct sum is defined then the internal<br />

and external direct sums are isomorphic.<br />

3.I.2 Dimension Characterizes Isomorphism<br />

In the prior subsection, after stating the definition of an isomorphism, we<br />

gave some results supporting the intuition that such a map describes spaces<br />

as “the same”. Here we will formalize this intuition. While two spaces that<br />

are isomorphic are not equal, we think of them as almost equal—as equivalent.<br />

In this subsection we shall show that the relationship ‘is isomorphic to’ is an<br />

equivalence relation. ∗<br />

2.1 Theorem Isomorphism is an equivalence relation between vector spaces.<br />

Proof. We must prove that this relation has the three properties of being symmetric,<br />

reflexive, and transitive. For each of the three we will use item (2) of<br />

Lemma 1.9 and show that the map preserves structure by showing that the it<br />

preserves linear combinations of two members of the domain.<br />

To check reflexivity, that any space is isomorphic to itself, consider the identity<br />

map. It is clearly one-to-one and onto. The calculation showing that it<br />

preserves linear combinations is easy.<br />

id(c1 · �v1 + c2 · �v2) =c1�v1 + c2�v2 = c1 · id(�v1)+c2 · id(�v2)<br />

To check symmetry, that if V is isomorphic to W via some map f : V → W<br />

then there is an isomorphism going the other way, consider the inverse map<br />

f −1 : W → V . As stated in the appendix, the inverse of the correspondence<br />

f is also a correspondence, so we need only check that the inverse preserves<br />

linear combinations. Assume that �w1 = f(�v1), i.e., that f −1 ( �w1) =�v1, and also<br />

assume that �w2 = f(�v2).<br />

f −1 (c1 · �w1 + c2 · �w2) =f −1� c1 · f(�v1)+c2 · f(�v2) �<br />

= f −1 ( f � c1�v1 + c2�v2) �<br />

= c1�v1 + c2�v2<br />

= c1 · f −1 ( �w1)+c2 · f −1 ( �w2)<br />

Finally, to check transitivity, that if V is isomorphic to W via some map f<br />

and if W is isomorphic to U via some map g then also V is isomorphic to U,<br />

consider the composition map g ◦ f : V → U. As stated in the appendix, the<br />

∗ More information on equivalence relations is in the appendix.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!