Math 2.0

Linear and multilinear algebra; matrix theory Proof

Proof that a linear map is determined by its values on a basis

Builds on BasisLinear mapLinear combination

Proof

We first prove uniqueness, then build the map from the coordinates of each vector.

  1. Since (bi)i∈I(b_i)_{i \in I} is a basis, each v∈Vv \in V is a linear combination v=∑i∈Iaibiv = \sum_{i \in I} a_i b_i in exactly one way. Here ai∈Fa_i \in F, and ai=0a_i = 0 for all but finitely many ii.
  2. Let S,T ⁣:V→WS, T \colon V \to W be linear maps with S(bi)=T(bi)S(b_i) = T(b_i) for all i∈Ii \in I. Let v∈Vv \in V be written as in step 1.
  3. The sum in step 1 has finitely many nonzero terms. Linearity, applied once for each term, gives S(v)=∑i∈IaiS(bi)S(v) = \sum_{i \in I} a_i S(b_i) and T(v)=∑i∈IaiT(bi)T(v) = \sum_{i \in I} a_i T(b_i).
  4. The right sides of step 3 are equal term by term. So S(v)=T(v)S(v) = T(v) for all v∈Vv \in V, and S=TS = T.
  5. Now let (wi)i∈I(w_i)_{i \in I} be a family of vectors of WW. For v=∑i∈Iaibiv = \sum_{i \in I} a_i b_i as in step 1, define T(v)=∑i∈IaiwiT(v) = \sum_{i \in I} a_i w_i.
  6. This is a finite sum, since only finitely many aia_i are nonzero. The coefficients aia_i are unique, so T(v)T(v) is well defined.
  7. TT is additive. Let v=∑iaibiv = \sum_i a_i b_i and v′=∑iai′biv' = \sum_i a'_i b_i. Then v+v′=∑i(ai+ai′)biv + v' = \sum_i (a_i + a'_i) b_i, and by uniqueness these are the coefficients of v+v′v + v'.
  8. Hence T(v+v′)=∑i(ai+ai′)wi=T(v)+T(v′)T(v + v') = \sum_i (a_i + a'_i) w_i = T(v) + T(v').
  9. TT is homogeneous. For c∈Fc \in F, cv=∑i(cai)bicv = \sum_i (c a_i) b_i, and by uniqueness these are the coefficients of cvcv. Hence T(cv)=∑icaiwi=c T(v)T(cv) = \sum_i c a_i w_i = c\, T(v).
  10. So TT is linear. For j∈Ij \in I, the vector bjb_j has coefficient 11 at jj and 00 elsewhere, by uniqueness. Hence T(bj)=wjT(b_j) = w_j.
  11. If T′T' is another linear map with T′(bj)=wjT'(b_j) = w_j for all j∈Ij \in I, then T′T' and TT agree on the basis. By step 4, T′=TT' = T.
  12. So there is exactly one linear map T ⁣:V→WT \colon V \to W with T(bi)=wiT(b_i) = w_i for all i∈Ii \in I.

Idea

Every vector is a unique combination of basis vectors, and a linear map must respect combinations. So the images of the basis vectors fix the map. Conversely, any choice of images defines a map by sending each combination to the same combination of the chosen images.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Basis concept
  2. Linear combination concept
  3. Linear map concept
  4. Proof that a linear map is determined by its values on a basis proof

Where this leads

20 pages build on this one.

Further reading

  1. Web https://dec41.user.srcf.net/notes/IB_M/linear_algebra_thm_proof.pdf, Section 2.2
About this page
TagPETNSVJEFW
URIm2://PETNSVJEFW
Kindproof
WritingW0 stub
MSC15A04
ProvesA linear map is determined by its values on a basis
UsesBasis, Linear map, Linear combination
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.