I'm trying to solve this question. What's the first hint in the proof you would give me.…
- User
I'm trying to solve this question. What's the first hint in the proof you would give me. Do not solve the whole question. Suppose we have a vector space , in which we have chosen a basis , giving rise to a dual basis for . As discussed in the lecture notes, this means that we can write any vector as [ \mathbf{v} = [\mathbf{e}_1 \dots \mathbf{e}_n] \begin{bmatrix} v^1 \ \vdots \ v^n \end{bmatrix}, ] and vice versa any (dual) vector as [ \alpha = [b_1 \dots b_n] \begin{bmatrix} \alpha^1 \ \vdots \ \alpha^n \end{bmatrix}. ]
Here and are matrices whose entries are scalars (real numbers), and and are matrices of vectors (with entries in respectively and ).
We now want to think about what happens if we change the basis for . Suppose we have another basis for , with corresponding dual basis for . With respect to these bases, we have and
This gives rise to a change-of-basis matrix (an -matrix with real coefficients) such that [ \begin{bmatrix} \tilde{v}^1 \ \vdots \ \tilde{v}^n \end{bmatrix} = A \begin{bmatrix} v^1 \ \vdots \ v^n \end{bmatrix}. ]
In this set-up, how are [ [\tilde{\mathbf{e}}_1 \dots \tilde{\mathbf{e}}_n] \quad \text{and} \quad [\mathbf{e}_1 \dots \mathbf{e}_n], ] [ \begin{bmatrix} \tilde{\alpha}^1 \ \vdots \ \tilde{\alpha}^n \end{bmatrix} \quad \text{and} \quad \begin{bmatrix} \alpha^1 \ \vdots \ \alpha^n \end{bmatrix}, ] and [ [\tilde{b}_1 \dots \tilde{b}_n] \quad \text{and} \quad [b_1 \dots b_n] ] related to each other?
- Assistant
To begin solving this problem, consider how the change of basis affects the basis vectors themselves. Since any vector (\mathbf{v}) can be expressed in terms of both the old basis ([\mathbf{e}_1 \dots \mathbf{e}_n]) and the new basis ([\tilde{\mathbf{e}}_1 \dots \tilde{\mathbf{e}}_n]), think about how these bases are related through the change-of-basis matrix (A). Specifically, try expressing the original basis vectors in terms of the new basis vectors using the matrix (A) or its inverse.