How Can a New Basis Change the Matrix Representation of a Linear Transformation?

In summary: Matrices A and B are similar if and only if there exists a non-singular matrix P and a diagonal matrix D such that A = PDP^-1. This relation has a very close connection to eigenvalues and eigenvectors.In summary, the equivalence relation between matrices that you are studying is a left associate relation. Studying different equivalence relations on matrices is a worthwhile exercise.
  • #1
P3X-018
144
0
I've given the linear transformation [itex] L: \mathbb{R}^4 \rightarrow \mathbb{R}^3 [/itex], where

[tex] L(\mathbf x) = A\mathbf x [/tex]

and

[tex] A = \left[ \begin{array}{cccc} 1&1&-4&-1 \\ -2&3&1&0 \\ 0&1&-2&2 \end{array} \right][/tex]

The first question of the problem is that, by using the standard basis [itex] E [/itex] for [itex] \mathbb{R}^4 [/itex], I have to determine a new basis [itex] F = [\mathbf{b}_1, \mathbf{b}_2, \mathbf{b}_3] [/itex] for [itex] \mathbb{R}^3 [/itex] such that the matrix representing [itex] L [/itex] in [itex] E [/itex] and [itex] F [/itex] is the reduced row echelon form of the matrix [itex] A [/itex], which I
determined to be

[tex] U = \left[ \begin{array}{cccc} 1&0&0&-11 \\ 0&1&0&-6 \\ 0&0&1&-4 \end{array} \right] [/tex]

I determined the basis by using, that if [itex] B = (\mathbf{b}_1, \mathbf{b}_2, \mathbf{b}_3) [/itex], then

[tex] U = B^{-1}\left( L(\mathbf{e}_1), L(\mathbf{e}_2), L(\mathbf{e}_3), L(\mathbf{e}_4) \right) = B^{-1}A [/tex]

So [itex] B^{-1} [/itex] must be "the product" of elementary operations performed on A, which can easily be found by

[tex] \left(A|I\right) \rightarrow \left(U|B^{-1}\right) [/tex]

Since [itex] B^{-1}\left(A|I\right) = \left(B^{-1}A|B^{-1}\right) = \left(U|B^{-1}\right) [/itex]. I found B as

[tex] B =\left[ \begin{array}{ccc} 1&1&-4 \\ -2&3&1 \\ 0&1&-2 \end{array} \right][/tex]

The next question is to explain why it is possible for an arbitrary [itex] m\times n [/itex] matrix A, to determine a new basis F for [itex] \mathbb{R}^m [/itex] (where [itex] L: \mathbb{R}^n \rightarrow \mathbb{R}^m [/itex]), but still keep the standard basis for [itex] \mathbb{R}^n [/itex], so that the linear transformation corrosponding to A i the new basis is represented by the reduced row echelon form of A. Like in the last problem.

I'm sorry if the question is purely expressed, but that's how it's expressed in the problem.
The way I see it is that if we have the linear transformation L given by [itex] L(\mathbf{x}) = A\mathbf{x} [/itex], then by using the reduced row echelon form of A, let's call it U, the transformation can be expressed in new basis as

[tex] [L(\mathbf{x})]_F = U[\mathbf{x}]_E [/tex]

But where E will be the standard basis.

I don't know exactly how to explain this. It doesn't look like it would be a sufficient explanation to use the steps in the 1. question. A hint to how I can explain it would really help.
 
Last edited:
Physics news on Phys.org
  • #2
Regarding your question about an "explanation", you might think of this problem in terms of equivalence relations on matrices. Here's some starting material.

1) Left Associate: (your case) Matrices A and B (both mxn) are left associate iff there exists a non-singular (mxm) Q such that B = (Q^-1)A. Multiplication by (Q^-1) corresponds to performing a sequence of elementary row operations. If A represents a linear transformation
T: U -> V relative to basis A in U and basis B in V, then matrix B represents T relative to A and a new basis in V. There is an accompanying theorem. It's really all you need in the way of explanation.

Here are some other equivalence relations you might explore.

2) Right Associate: You can imagine how this one is defined.

3) Equivalent: To be more consistent with the above naming convenvtion, some call it Associate, (e.g., E.Nering). Note that associate is definitely not a standard term for this relation, and I suspect left and right in 1) and 2) aren't either.

4) Similar: Perhaps the most interesting of the four.
 
  • #3


One way to explain this is by considering the concept of change of basis. When we have a linear transformation from one vector space to another, the choice of basis for each vector space can affect how the transformation is represented. In this case, we have a linear transformation from \mathbb{R}^4 to \mathbb{R}^3 , and the standard basis for each of these spaces is defined as the set of unit vectors along each coordinate axis.

However, we can choose a different basis for \mathbb{R}^3 that is not aligned with the coordinate axes, but still spans the same space. This new basis, represented by the matrix B, will have a different set of unit vectors and will result in a different representation of the linear transformation L. By using the reduced row echelon form of A, we are essentially finding a new basis for \mathbb{R}^3 that is more convenient for representing the transformation L.

Furthermore, we can keep the standard basis for \mathbb{R}^4 because the transformation L is still being applied to vectors in this space. The new basis F only affects how the transformation is represented in \mathbb{R}^3 , but it does not change the input space for L. This is why we can determine a new basis for \mathbb{R}^3 while keeping the standard basis for \mathbb{R}^4 .
 

FAQ: How Can a New Basis Change the Matrix Representation of a Linear Transformation?

What is a matrix representation?

A matrix representation is a way of organizing data or representing a mathematical concept using a matrix, which is a rectangular array of numbers or symbols arranged in rows and columns.

How is a matrix representation used in science?

Matrix representations are used in various scientific disciplines, such as physics, engineering, and computer science, to model and solve complex systems and equations. They are particularly useful in linear algebra, where they can represent linear transformations and systems of linear equations.

What are the advantages of using a matrix representation?

One advantage of using a matrix representation is that it can simplify complex problems and make them easier to solve. Additionally, matrix representations allow for more efficient and organized data storage and manipulation, making them useful for large datasets.

What are the different types of matrix representations?

There are several types of matrix representations, including row and column vectors, square matrices, diagonal matrices, and triangular matrices. Each type has its own unique properties and uses in various applications.

How do you create a matrix representation?

To create a matrix representation, you can use mathematical software or a programming language that supports matrix operations. You can also manually create a matrix by defining its dimensions (number of rows and columns) and filling in the elements with the desired values.

Similar threads

Replies
19
Views
2K
Replies
7
Views
2K
Replies
34
Views
2K
Replies
1
Views
1K
Replies
52
Views
3K
Replies
4
Views
2K
Back
Top