Eigenvalue - geometric multiplicity proof

Click For Summary
SUMMARY

The discussion focuses on proving that the matrix A, defined as a symmetric and Hermitian matrix with elements a and 1, has an eigenvalue with geometric multiplicity n-1. The eigenvalue can be expressed in terms of a, specifically by deriving the characteristic polynomial. Participants suggest starting with smaller matrices (1x1, 2x2, and 3x3) to identify patterns in eigenvalues and eigenvectors, which is essential for the proof.

PREREQUISITES
  • Understanding of eigenvalues and eigenvectors
  • Familiarity with symmetric and Hermitian matrices
  • Knowledge of characteristic polynomials
  • Basic linear algebra concepts
NEXT STEPS
  • Derive the characteristic polynomial for matrix A
  • Explore properties of symmetric matrices in relation to eigenvalues
  • Investigate geometric multiplicity and its implications
  • Practice with smaller matrices to identify eigenvalue patterns
USEFUL FOR

Students and professionals in mathematics, particularly those studying linear algebra, eigenvalue problems, and matrix theory.

flashdrive
Messages
1
Reaction score
0

Homework Statement



Given matrix A:

a 1 1 ... 1
1 a 1 ... 1
1 1 a ... 1
.. . .. ... 1
1 1 1 ... a

Show there is an eigenvalue of A whose geometric multiplicity is n-1. Express its value in terms of a.

Homework Equations



general eigenvalue/vector equations

The Attempt at a Solution



My problem is I'm not sure how to start it off.
I can state A is square, symmetric and hermitian so I know it has to do with one or more of those. I tried going through using a determinant but it didn't seem to work nicely, I have a feeling that it might have to do with a property of symmetric matrices but am not sure how to go about the proof (or which property)
 
Physics news on Phys.org
Well, first, what is the eigenvalue in question? To do that, of course, you will need to find the characteristic polynomial. I recommend starting with "1 by 1", "2 by 2", and "3 by 3" matrices to see if you can find a pattern. Do the same thing to find the eigenvectors corresponding to that eigenvalue.
 

Similar threads

  • · Replies 8 ·
Replies
8
Views
2K
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
2
Views
2K
Replies
9
Views
2K
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
11
Views
4K
Replies
8
Views
3K