A couple simple linear algebra questions.

Click For Summary

Homework Help Overview

The discussion revolves around linear algebra concepts, specifically focusing on properties of invertible matrices and eigenvalues of square matrices. The original poster presents two statements regarding these topics and seeks validation of their reasoning.

Discussion Character

  • Exploratory, Conceptual clarification

Approaches and Questions Raised

  • The original poster attempts to confirm their understanding of matrix invertibility and the definition of distinct eigenvalues. They provide reasoning based on determinants and characteristic polynomials. Other participants affirm their interpretations and clarify the meaning of distinct eigenvalues.

Discussion Status

The discussion is ongoing, with participants providing supportive feedback and clarifications. There is an exploration of the implications of eigenvalue counts and definitions, with some participants questioning assumptions about eigenvalues in relation to matrix dimensions.

Contextual Notes

Participants discuss the implications of eigenvalue multiplicity and the conditions under which matrices are considered, particularly emphasizing the relevance of square matrices and the minimum eigenvalue count based on algebraic multiplicity.

charlies1902
Messages
162
Reaction score
0
I think I know the answer to these questions, but I just want to make sure.

1) If A is invertible then A+A is invertible. True/False
True.

Because det(A)≠0, det(A+A)=det(2A)=2^n * det(A)≠0

Is this correct.

2) A 3x3 matrix can have 2 distinct eigenvalues. True/False
True, although I was kind of confused with what "distinct" means.
The characteristic polynomial can look something like this: (λ-1)^2 * (λ+2)
Distinct just refers to the # of "different" eigenvalues right? And doesn't include them again if they're repeated?
 
Physics news on Phys.org
Yup, you first one looks good. As does your second one.

Distinct does indeed refer to the amount of DIFFERENT eigenvalues a matrix has in this case.

In general, if you have an nxn matrix, it CAN have as many as n distinct eigenvalues.
 
Zondrina said:
In general, if you have an nxn matrix, it CAN have as many as n distinct eigenvalues.

so basically 0≤λ≤n?
 
charlies1902 said:
so basically 0≤λ≤n?

What does this statement mean? What is λ?

I think what you're intending is to say that there are going to be greater than or equal to zero eigenvalues for a nxn matrix, this is incorrect to assume. Is a matrix really a matrix if n = 0? Even the statement makes me cringe.

Really, we're only concerned with the eigenvalues of matrices for n ≥ 2 and only square matrices are considered.

So supposing that A is an nxn matrix. The fewest eigenvalues it can have is 1 and that's only if the algebraic multiplicity of the eigenvalue equals n. Otherwise it can have up to n eigenvalues. I hope that clears that up for you :).
 

Similar threads

  • · Replies 25 ·
Replies
25
Views
4K
Replies
4
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 19 ·
Replies
19
Views
4K
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K