Proofs from Matrix representations All proofs from Matrix representations.
[ PROOF ] Write
v = c 1 v 1 + ⋯ + c n v n . v=c_1v_1+\cdots+c_nv_n. v = c 1 v 1 + ⋯ + c n v n . Then
[ v ] B V = ( c 1 ⋮ c n ) . [v]_{B_V}=
\begin{pmatrix}
c_1\\
\vdots\\
c_n
\end{pmatrix}. [ v ] B V = c 1 ⋮ c n . Preservation of finite linear combinations gives
[ T ( v ) ] B W = c 1 [ T ( v 1 ) ] B W + ⋯ + c n [ T ( v n ) ] B W = c 1 a 1 + ⋯ + c n a n = A [ v ] B V . \begin{aligned}
[T(v)]_{B_W}
&=c_1[T(v_1)]_{B_W}+\cdots+c_n[T(v_n)]_{B_W}\\
&=c_1a_1+\cdots+c_na_n\\
&=A[v]_{B_V}.
\end{aligned} [ T ( v ) ] B W = c 1 [ T ( v 1 ) ] B W + ⋯ + c n [ T ( v n ) ] B W = c 1 a 1 + ⋯ + c n a n = A [ v ] B V . This proves the coordinate identity. If another matrix has the same identity, apply it to each v j v_j v j . Since [ v j ] B V [v_j]_{B_V} [ v j ] B V is the j j j th standard coordinate vector, its j j j th column must be [ T ( v j ) ] B W = a j [T(v_j)]_{B_W}=a_j [ T ( v j ) ] B W = a j . Every column is therefore forced, so A A A is unique.
[RIGHT CLICK] [ASK AI]
This page builds on Linear transformations , Rank-nullity , Coordinates and bases (Vector spaces), Kernel, image and rank , Basis and dimension (Vector spaces) and 1 more.
It leads to Seen Questions , Eigenvalues and eigenvectors (Eigenvalues), Diagonalisation (Eigenvalues), Seen Questions (Eigenvalues), Linear ODE systems (Eigenvalues) and 1 more.
Part of the thread Coordinates and linear structure , in 5 places.
A basis turns vectors and maps into columns and matrices; a good basis makes the calculation simple.
Matrix representations Builds on Linear transformations and 5 more.