Math 2.0

Linear and multilinear algebra; matrix theory Proof

Proof that finite-dimensional spaces are isomorphic iff they have equal dimension

Builds on Linear isomorphismA linear map is injective iff its kernel is trivialA linear map is determined by its values on a basisBijective iff it has a two-sided inverseBasisLinear independenceSpanning setDimensionDimension theorem for vector spaces

Proof

We show that an isomorphism sends a basis to a basis, and that a bijection between bases extends to an isomorphism.

  1. Suppose VV and WW are isomorphic, and let T ⁣:V→WT \colon V \to W be a linear isomorphism. Let n=dim⁡Vn = \dim V, the dimension, and let (b1,…,bn)(b_1, \dots, b_n) be a basis of VV.
  2. The family (T(b1),…,T(bn))(T(b_1), \dots, T(b_n)) is linearly independent. Suppose ∑iaiT(bi)=0\sum_i a_i T(b_i) = 0 with ai∈Fa_i \in F. Then T(∑iaibi)=0T\left(\sum_i a_i b_i\right) = 0 by linearity.
  3. TT is injective, so its kernel is {0}\{0\} by the kernel criterion. Hence ∑iaibi=0\sum_i a_i b_i = 0, and all ai=0a_i = 0 because (bi)(b_i) is linearly independent.
  4. The family (T(b1),…,T(bn))(T(b_1), \dots, T(b_n)) spans WW. Let w∈Ww \in W. Since TT is surjective, w=T(v)w = T(v) for some v=∑iaibiv = \sum_i a_i b_i, and then w=∑iaiT(bi)w = \sum_i a_i T(b_i).
  5. So (T(b1),…,T(bn))(T(b_1), \dots, T(b_n)) is a basis of WW with nn vectors. By the dimension theorem, dim⁡W=n=dim⁡V\dim W = n = \dim V.
  6. Conversely, suppose dim⁡V=dim⁡W=n\dim V = \dim W = n. Let (b1,…,bn)(b_1, \dots, b_n) be a basis of VV and (c1,…,cn)(c_1, \dots, c_n) a basis of WW.
  7. By the extension of values on a basis, there is a linear map S ⁣:V→WS \colon V \to W with S(bi)=ciS(b_i) = c_i for all ii. There is also a linear map R ⁣:W→VR \colon W \to V with R(ci)=biR(c_i) = b_i for all ii.
  8. The composite R∘S ⁣:V→VR \circ S \colon V \to V is linear, since R(S(u+av))=R(S(u))+aR(S(v))R(S(u + av)) = R(S(u)) + a R(S(v)) for u,v∈Vu, v \in V and a∈Fa \in F. It sends each bib_i to R(ci)=biR(c_i) = b_i.
  9. The identity map of VV also sends each bib_i to bib_i. By the uniqueness part of the same result, R∘S=idVR \circ S = \mathrm{id}_V.
  10. In the same way, S∘R ⁣:W→WS \circ R \colon W \to W fixes each cic_i, so S∘R=idWS \circ R = \mathrm{id}_W.
  11. By the two-sided inverse criterion, SS is bijective. So SS is a linear isomorphism, and VV and WW are isomorphic.

Idea

An isomorphism carries a basis to a basis, so it preserves the number of basis vectors. Conversely, if two spaces have bases of the same size, matching the basis vectors one to one defines a linear map in each direction. The two maps undo each other.

Reading path

To understand this page from the ground up, read these 46 pages in order. The foundations come first. The path takes the proofs Proof that a function is bijective iff it has a two-sided inverse, Proof that a linear map is injective iff its kernel is trivial, Proof that a linear map is determined by its values on a basis.

  1. Basis concept
  2. Dimension concept
  3. Element definition
  4. Kernel of a linear map concept
  5. Linear combination concept
  6. Linear independence concept
  7. Linear isomorphism concept
  8. Linear map concept
  9. Proposition concept
  10. Spanning set concept
  11. Vector space definition
  12. Set definition
  13. Proof that a linear map is determined by its values on a basis proof
  14. Proof that a linear map is injective iff its kernel is trivial proof
  15. Implication definition
  16. Predicate definition
  17. Linear combination definition
  18. Linear map definition
  19. Linear subspace definition
  20. Ordered pair definition
  21. Existential quantifier definition
  22. Universal quantifier definition
  23. Linear independence definition
  24. Kernel of a linear map definition
  25. Linear span definition
  26. Cartesian product definition
  27. Uniqueness quantifier definition
  28. Subset definition
  29. A linear map is injective iff its kernel is trivial statement
  30. Spanning set definition
  31. Binary relation definition
  32. Basis definition
  33. Function definition
  34. Dimension theorem for vector spaces statement
  35. A linear map is determined by its values on a basis statement
  36. Codomain definition
  37. Function composition definition
  38. Identity function definition
  39. Injective function definition
  40. Surjective function definition
  41. Left inverse definition
  42. Right inverse definition
  43. Bijective function definition
  44. Proof that a function is bijective iff it has a two-sided inverse proof
  45. Bijective iff it has a two-sided inverse statement
  46. Proof that finite-dimensional spaces are isomorphic iff they have equal dimension proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://dec41.user.srcf.net/notes/IB_M/linear_algebra_thm_proof.pdf, Sections 2.1 and 2.2
About this page
TagY9JFGK2BX8
URIm2://Y9JFGK2BX8
Kindproof
WritingW0 stub
MSC15A03
ProvesFinite-dimensional spaces are isomorphic iff they have equal dimension
UsesLinear isomorphism, A linear map is injective iff its kernel is trivial, A linear map is determined by its values on a basis, Bijective iff it has a two-sided inverse, Basis, Linear independence, Spanning set, Dimension, Dimension theorem for vector spaces
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.