I Matrices and linear transformations. Where did I go wrong?

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.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top