[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math


View post   

File: 82 KB, 728x546, aid1164749-v4-728px-Find-the-Determinant-of-a-3X3-Matrix-Step-1-Version-4.jpg [View same] [iqdb] [saucenao] [google]
11301272 No.11301272 [Reply] [Original]

Are all matrices 3x3 with 3 different eigenvalue diagonalisable?

>> No.11301279

iirc yes. if it has fewer distinct eigenvalues then they need to have combined multiplicity equal to the dimension

>> No.11301281

>>11301272
Yes, and having 3 linearly independent eigenvectors yields the same result.

>> No.11301284

>>11301279
>>11301281
thanks

>> No.11301287

>>11301279
cont.

and i remember finding it weird that some books emphasize this point. afaik there's nothing special about matrices with n *distinct* eigenvalues other than that you can conveniently say that they must have n linearly independent eigenvectors. it might still have n linearly independent eigenvectors with some sharing the same eigenvalues.

>> No.11301294

>>11301272
>>11300734 /sqt/

>> No.11301318

>>11301272
>>11301279
Not if one of those distinct eigenvalues is zero.

>> No.11301328

>>11301318

can't you still diagonalize it? you can pick out vectors from the null space to fill out your basis, right?

>> No.11301337

>>11301272
Why do americans learn Linear Algebra with matrices instead of linear transformations or quadratic forms?

>> No.11301340

>>11301328
Oof, my bad. You're right. As long as there's only one.

>> No.11301367

>>11301337
I live in Poland.

>> No.11301372

>>11301337
We do learn linear algebra with linear transformations (and we represent them with matrices upon choosing a basis like everyone else)
Engineering/computational linear algebra classes probably use matrices mostly because that's the form they interact with.
In my linear algebra course the first things we talked about were fields, vector spaces, and linear transformations, then we did bases and matrix representations.

>> No.11301447

>>11301272
All matrices with three unique nonzero eigenvalues are diagonalizable. If any of your eigenvalues are zero, it is not guaranteed even if all three are unique.

>> No.11301486

>>11301447
All 3x3 matrices with "..."* Sorry

>> No.11301493

>>11301340
>>11301447

wouldn't it work in any instance where your null space is big enough to fill out the rest of the basis? if you have a k-dimensional nullspace and j independent eigenvectors, then can you diagonalize it as long as j+k=n?

>> No.11301506

>>11301493
cont.

for example, if you have a rank-1, NxN matrix with one eigenvector. you pick that eigenvector as the first element of your basis P, and the fill the rest with a basis of the null space. every element along the diagonal is zero except the one corresponding to the direction that your transformation preserves.

>> No.11301513

>>11301506
Of course, but that doesnt always happen. Eg
0 1
0 0

>> No.11301520

>>11301513

but that's a rank-1 matrix with no eigenvalues. you can pick a vector from its null space, but you don't have an eigenvector to complete the change of basis.

>> No.11301526

All n×n matrices with n distinct eigenvalues are eigenvalue diagonalisable. The eigenspace of every eigenvalue is always >=1, and <= to the algebraic multiplicity, which for n distinct eigenvalues is always 1. Therefore you have n linearly independent eigenvectors giving you a basis for decomposition.

>> No.11301717

>>11301447
Give counter example

>> No.11301738

>>11301717
I mean, really any rotation matrix will work. There's an entire class of "defective" square matrices which are not diagonalizable over the reals.

>> No.11301802

>>11301738
I mean give example of 3x3 matrix with three distinct eigenvalues, one of them zero, which is not diagonalizable

>> No.11303168

>>11301447
Wrong. Liar. Enough of your nonsense.

>>11301802
You can't because >>11301526

>> No.11303204

/sci/ is consistently, without exception totally and utterly incompetent at understanding the inuition and mechanics of linear algebra, the single most elegant contribution of mathematics to the sciences since the advent of mathematical analysis with Newton, Lagrange, Laplace. These threads are an abomination, everyone who posts these idiotic answers should be sterilized, banned from the internet, barred from ever holding a job performing intellectual labor. Disgusting ignorance.

>> No.11303255

>>11303204
Yes, but this is also true for the vast majority of students at universities.

>> No.11303499

>>11301279

The dimension of the eigenspace MUST be equal to the multiplicity of the associated eigenvalue for a matrix to be diagonalisable.

>> No.11303809

>>11303204
am i wrong here?
>>11301279
>>11301493

it has been a while since i've thought of it, and as i am neither a math major or mathematician, i don't get to refresh my memory often.

iirc an eigen-decomposition is just changing your basis to the eigenvectors.

since the ith column of a matrix of a linear transformation is the transformed ith basis vector of the domain expressed in terms of the basis of the range, it just ends up having the eigenvalues along the diagonal.

>> No.11303955

Can anyone give me some real life examples of the use of eiganvalues.

>> No.11303966

>>11303204
this but unironically

>> No.11303987
File: 747 KB, 1280x1280, tumblr_70af6ab408008821a8a56c8d51530330_c5a5f29b_1280.png [View same] [iqdb] [saucenao] [google]
11303987

>>11303955
the eigenvalues of the stress tensor are the principle stresses in a material (the maximum stresses that occur at a location)

>> No.11304695

>>11301272
>Are all matrices 3x3 with 3 different eigenvalue diagonalisable?
ALL square matrices with the same number of different eigenvalues as the length of a square are diagonalisable.

>> No.11304701

>>11304695
sorry, meant side instead of square

>> No.11304706

Why there seems to be a misconception that a 0 eigenvalue doesn't imply diagonalizability?

>> No.11304765

>>11303955
literally any physical system involves solving a system of differential equations, which reduces to diagonalizing a matrix.

>> No.11304774

>>11304706
the matrix
[math] begin{pmatrix} 0 & 1 & 0 \\
0 & 0 & 0 \\
0 & 0 & 1 \end{pmatrix} [/math]
has distinct eigenvalues of 0 and 1, and is not diagonalizable. it just doesn't have 3 of them.

>> No.11304776

>>11303955
Find a formula for fibonacci numbers
if A=(0 1
1 1 )
A(F_n
F_n+1)= (F_n+1
F_n+2)
Finding the eigenvalues of A will give you the general formula for F_n with the golden ratio

>> No.11304781

>>11304774
[math] \begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 1 \end{pmatrix} [/math]
sigh, fucking backslash

>> No.11304920

>>11304774
That's because the eigenvalues are not distinct. It's completely irrelevant if one of them is zero or not.

>> No.11306579

>>11303204
Waiting for your insight