Is the signature of this matrix zero?
Join the discussion
Registration is free. Start your own thread to ask a follow-up.
8 replies · 4K views
Physics news on Phys.org
Discussion
Science Advisor
Homework Helper
- 6,999
- 299
My "engineer's intuition" says it is true, if you think about finding the extrema of x*Mx subject to the constraints Nx = 0, using Lagrange multipliers. The situations where this runs into trouble are when the constraints are not all independent, but that is excluded because N is non-singular.
Basically, each eigenvalue of M is turned into a pair of eigenvalues of the augmented matrix, one positive and one negative.
But my brain isn't working well enough to turn that idea into a proof right now - sorry!
Basically, each eigenvalue of M is turned into a pair of eigenvalues of the augmented matrix, one positive and one negative.
But my brain isn't working well enough to turn that idea into a proof right now - sorry!
Vargo
- 350
- 1
I think a topological argument works here.
If you continuously deform such a matrix (within the constraints you mentioned), then the signature cannot change without an eigenvalue crossing 0. But that cannot happen without the determinant being zero. But such a matrix cannot have zero determinant because its rows are independent. In other words, the signature cannot change under a continuous deformation that maintains the given constraints on M and N.
Every symmetric matrix can be continuously deformed to 0 (by scaling it down to 0). And GL(n) only has two connected components, so each non-singular matrix can be deformed to I or I' (which is I with one entry flipped to -1). So it suffices to check M=0, N=I, and M=0,N=I'.
If you continuously deform such a matrix (within the constraints you mentioned), then the signature cannot change without an eigenvalue crossing 0. But that cannot happen without the determinant being zero. But such a matrix cannot have zero determinant because its rows are independent. In other words, the signature cannot change under a continuous deformation that maintains the given constraints on M and N.
Every symmetric matrix can be continuously deformed to 0 (by scaling it down to 0). And GL(n) only has two connected components, so each non-singular matrix can be deformed to I or I' (which is I with one entry flipped to -1). So it suffices to check M=0, N=I, and M=0,N=I'.
Science Advisor
Homework Helper
MHB
- 16,335
- 258
Pick for instance M=(0) and N=(1).
Determinant=-1
Trace=0
Eigenvalues are +1 and -1.
Determinant=-1
Trace=0
Eigenvalues are +1 and -1.
Science Advisor
- 3,394
- 767
Vargo said:I think a topological argument works here.
If you continuously deform such a matrix (within the constraints you mentioned), then the signature cannot change without an eigenvalue crossing 0. But that cannot happen without the determinant being zero. But such a matrix cannot have zero determinant because its rows are independent. In other words, the signature cannot change under a continuous deformation that maintains the given constraints on M and N.
Every symmetric matrix can be continuously deformed to 0 (by scaling it down to 0). And GL(n) only has two connected components, so each non-singular matrix can be deformed to I or I' (which is I with one entry flipped to -1). So it suffices to check M=0, N=I, and M=0,N=I'.
Very cool argument. It took me a while to get it.
I am going to try to generalize this to the matrix
M T 0
T* M N
0 N 0
where the conclusion now - I think - would be that the signature is this matrix is the signature of M. Can I just shrink T to zero?
Last edited:
Science Advisor
- 3,394
- 767
AlephZero said:My "engineer's intuition" says it is true, if you think about finding the extrema of x*Mx subject to the constraints Nx = 0, using Lagrange multipliers. The situations where this runs into trouble are when the constraints are not all independent, but that is excluded because N is non-singular.
Basically, each eigenvalue of M is turned into a pair of eigenvalues of the augmented matrix, one positive and one negative.
But my brain isn't working well enough to turn that idea into a proof right now - sorry!
This is the approach I have tried - more or less. I get a system of quadratic equations.
Science Advisor
- 3,394
- 767
lavinia said:I am going to try to generalize this to the matrix
M T 0
T* M N
0 N 0
where the conclusion now - I think - would be that the signature is this matrix is the signature of M. Can I just shrink T to zero?
If T is shrunk towards zero the the matrix becomes singular only if M is singular so your proof goes through.
Vargo
- 350
- 1
lavinia said:I am going to try to generalize this to the matrix
M T 0
T* M N
0 N 0
where the conclusion now - I think - would be that the signature is this matrix is the signature of M. Can I just shrink T to zero?
Lets see... The determinant of this matrix will equal [itex](-1)^n(\det M) (\det N)^2[/itex], where n is the block size. If M is non-singular, the determinant is never zero, so no signature changes could happen by shrinking T down to zero.
If M is singular, the conclusion still sounds plausible, but I'm not sure whether the same proof could be adapted.
Similar threads
Graduate Why are diagonal elements of the imaginary part of a Hermitian matrix zero?
- EngWiPy
- · Replies 4 ·
- Linear and Abstract Algebra
- Replies
- 4
M has the unit matrix at the upper left side and zero everywhere else
- mathmari
- · Replies 8 ·
- Linear and Abstract Algebra
- Replies
- 8
5.3 Show that a square matrix with a zero row is not invertible.
- karush
- · Replies 3 ·
- Linear and Abstract Algebra
- Replies
- 3
Graduate Is a Matrix Zero if Its Inner Product with All Vector Combinations Equals Zero?
- bernoli123
- · Replies 2 ·
- Linear and Abstract Algebra
- Replies
- 2
Undergrad Why is the determinant of this matrix zero?
- encomes
- · Replies 4 ·
- Linear and Abstract Algebra
- Replies
- 4
Zero-Trace Symmetric Matrix is Orthogonally Similar to A Zero-Diagonal Matrix.
- caffeinemachine
- · Replies 5 ·
- Linear and Abstract Algebra
- Replies
- 5
Graduate Structure of modulo-integer matrix group GL(r,Z(n))?
- lpetrich
- · Replies 17 ·
- Linear and Abstract Algebra
- Replies
- 17
Creating Linearly Dependent Square Matrix from Cam Mechanism Equation
- Barbudania
- · Replies 2 ·
- Linear and Abstract Algebra
- Replies
- 2
Undergrad What Is a Matrix Signature and How Is It Determined?
- lukaszh
- · Replies 2 ·
- Linear and Abstract Algebra
- Replies
- 2
Graduate Induced Metric for Riemann Hypersurface in Euclidean Signature
- craigthone
- · Replies 1 ·
- Special and General Relativity
- Replies
- 1