Matrices and linear transformations. Where did I go wrong?

Click For Summary
SUMMARY

The forum discussion centers on the understanding of matrices and linear transformations, specifically addressing an exam with questions on linear transformations, eigenvalues, and diagonalizability. Key points include the identification of linear transformations, the calculation of eigenvalues and eigenspaces for the matrix A = \begin{pmatrix}1&-2&8\\0&-1&0\\0&0&-1\end{pmatrix}, and the conditions for diagonalizability. The participant's answers reveal misconceptions about injective transformations and the requirements for diagonalizability, particularly regarding the number of independent eigenvectors.

PREREQUISITES
  • Understanding of linear transformations and their properties.
  • Knowledge of eigenvalues and eigenspaces in linear algebra.
  • Familiarity with diagonalization of matrices and conditions for diagonalizability.
  • Basic proficiency in matrix operations and determinants.
NEXT STEPS
  • Study the properties of linear transformations in depth.
  • Learn how to calculate eigenvalues and eigenspaces for various matrices.
  • Investigate the conditions under which a matrix is diagonalizable.
  • Explore the concept of geometric multiplicity and its relation to eigenvalues.
USEFUL FOR

Students of linear algebra, educators teaching matrix theory, and anyone preparing for exams involving matrices and linear transformations.

davidge
Messages
553
Reaction score
21
Hi everyone. Excuse me for my poor English skills. I did an exam today and my exam result was 13 of 40. I don't understand why it was my result, because while doing the exam I though I was doing it well, then the result was a surprise for me. I will write down the questions and after write my answers.

1. (a) Let \pi_1: \mathbb{R} ^{2} \longrightarrow \mathbb{R} such that \pi_1 (x,y) = x. Show that \pi_1 is a linear transformation. Calculate the kernel of \pi_1. What is the dimension of its image? Explain your reason.

(b) Give an example of a linear transformation T: \mathbb{R} ^{2} \longrightarrow \mathbb{R} which is not surjective.

(c) There can be a injective linear transformation T: \mathbb{R} ^{2} \longrightarrow \mathbb{R}? Explain your reason.

2. Consider the matrix

A = \begin{pmatrix}1&-2&8\\0&-1&0\\0&0&-1\end{pmatrix}

(a) Calculate the eigenvalues and eigenspaces of A.

(b) Is A a diagonalizable matrix? Explain.

(c) Calculate tr(A^{2017}).

3. Are the matrices below diagonalizable? If not, explain your reason, if yes, diagonalize it.

(a) \begin{pmatrix}1&1\\0&1\end{pmatrix}.

(b) \begin{pmatrix}1&1\\1&1\end{pmatrix}.

My answers:

1. (a) Linearity (addition):
π1(x1, y1) = x1, π1(x2, y2) = x2
π1(x1, y1) + π1(x2, y2) = x1 + x2 = π1(x1 + x2, y1 + y2).

Linearity (scalar multiplication):
π1(αx1, y1) + π1(αx2, y2) =
α(x1 + x2) = π1(α(x1 + x2), y1 + y2).

Ker(π1) = {0, y}, Im(π1) = ℝ2; dimension 2.

(b) T: ℝ2 → ℝ
(x, y) \mapsto T(x, y) = \sqrt x.

(c) Yes. This condition will be satisfied if each element of ℝ2 is mapped into each element of ℝ, e.g. (x, y) \mapsto x.

2.
(a) 1; -1. I found these values by setting the determinant of the matrix equal to zero.
Eigenvectors of A are for λ= 1: t(1,0,0), for λ = -1: (-4α + β, β, α), with α, β, t ∈ ℝ.
So A has two independent eigenvectors and the eigenspace is ℝ2.

(b) No. We need three independent eigenvectors to form the square matrix S in SAS-1 = D, and A has only two independent eigenvectors.

(c) A² = I, A³ = A, A4 = I, ... Since 2017 is a odd number, A2017 = A, and tr(A2017) = (1 x -1 x -1) = 1.

3.
(a) The matrix has only one eigenvalue and is not diagonalizable.

(b)
 
Last edited:
Physics news on Phys.org
davidge said:
Hi everyone. Excuse me for my poor English skills. I did an exam today and my exam result was 13 of 40. I don't understand why it was my result, because while doing the exam I though I was doing it well, then the result was a surprise for me. I will write down the questions and after write my answers.

...

3. Are the matrices below diagonalizable? If not, explain your reason, if yes, diagonalize it.

(a) \begin{pmatrix}1&1\\0&1\end{pmatrix}.

(b) \begin{pmatrix}1&1\\1&1\end{pmatrix}.

My answers:

...

3.
(a) The matrix has only one eigenvalue and is not diagonalizable.

(b)

I'm thinking that breaking this into chunks would be good. For whatever reason I'm thinking it'd make sense to work backward.

3b) is certainly diagonalizable. The simplest reason is that it is symmetric, and in Reals, ALL symmetric matrices are diagonalizable. (You could also notice the trace is 2, yet it is rank 1, hence you have eigs = 2 and 0...)

3a) You're right that the only unique eigenvalue = 1. This is a pre-requisite, but by no means is sufficient, for a matrix to be defective. What they'd like to hear is probably the how many linearly independent eigenvectors are associated with this eigenvalue... (you'll hear terms like geometric multiplicity here)
 
As mentioned above, this is too much for one post. To take question 1:

b) ##\sqrt{x}## is not linear.

c) The example you gave is not 1-1, which is what injective means.
 

Similar threads

  • · Replies 52 ·
2
Replies
52
Views
4K
  • · Replies 23 ·
Replies
23
Views
2K
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K