Proving Invertibility of Skew-Symmetric n × n Matrices for Odd Integers

In summary: Oh yeah. I think it would've been better if I had it as det(A)=det(A^t)=det(-A) or in separate lines like you said.
  • #1
pyroknife
613
4
An n × n matrix is skew-symmetric provided
A^T = −A. Show that if A is skew-symmetric and
n is an odd positive integer, then A is not
invertible.


When you do this proof, is it necessary to prove that the determinant of A transpose = determinant of -A?
 
Physics news on Phys.org
  • #2
pyroknife said:
An n × n matrix is skew-symmetric provided
A^T = −A. Show that if A is skew-symmetric and
n is an odd positive integer, then A is not
invertible.


When you do this proof, is it necessary to prove that the determinant of A transpose = determinant of -A?

Why would you need to prove that? You are given that A^T=(-A), so it's pretty obvious that det(A^T)=det(-A). For a general matrix, what's the relation between det(A) and det(A^T)??
 
  • #3
pyroknife said:
An n × n matrix is skew-symmetric provided
A^T = −A. Show that if A is skew-symmetric and
n is an odd positive integer, then A is not
invertible.


When you do this proof, is it necessary to prove that the determinant of A transpose = determinant of -A?

No, if [itex]A=B[/itex], then clearly [itex]\det(A)=\det(B)[/itex] (if you do any operation on [itex]A[/itex], then the result must be the same as doing that operation on [itex]B[/itex], otherwise the two are not equal.
 
  • #4
Dick said:
Why would you need to prove that? You are given that A^T=(-A), so it's pretty obvious that det(A^T)=det(-A). For a general matrix, what's the relation between det(A) and det(A^T)??


The same. I saw someone (http://answers.yahoo.com/question/index?qid=20090317163121AAkzR4p) do it on yahoo answers in a really complicated way and he proved that those 2 are equal so it got me confused. Like you said you're given one matrix EQUAL to another so I don't understand why that user proved it.
 
  • #5
Generally, it takes me a little longer to do a proof than it would for me to do a calculation (application of proof/theory). I'm not sure if this is the same with everyone. Usually I can end up figuring it out, but sometimes I'm not thinking in the right direction which can end up taking a long time. Do you guys know of any sites that have problems where I can get some practice with matrix proofs?
 
  • #6
pyroknife said:
Generally, it takes me a little longer to do a proof than it would for me to do a calculation (application of proof/theory). I'm not sure if this is the same with everyone. Usually I can end up figuring it out, but sometimes I'm not thinking in the right direction which can end up taking a long time.


Do you guys know of any sites that have problems where I can get some practice with matrix proofs?

Why don't you start with this one? It's pretty easy. Answer my first question and then tell me what the relation is between det(-A) and det(A).
 
  • #7
Dick said:
Why don't you start with this one? It's pretty easy. Answer my first question and then tell me what the relation is between det(-A) and det(A).


I said it was the same in my other post.

det(-A) = (-1)^n * det(A)
using the concept where A is an nxn matrix and a is a constant. Det (-aA) = -a^n * det(A)

This is how I attempted to do this problem:

det(A^T)=det(-A)=det(A)
since n is odd det(-A) = -det(A)
-det(A)=det(A)
0 is the the only # where the negative of itself is itself.


That last part is seemingly easy, but it took me a while to think in that direction.
 
  • #8
pyroknife said:
I said it was the same in my other post.

det(-A) = (-1)^n * det(A)
using the concept where A is an nxn matrix and a is a constant. Det (-aA) = -a^n * det(A)

This is how I attempted to do this problem:

det(A^T)=det(-A)=det(A)
since n is odd det(-A) = -det(A)
-det(A)=det(A)
0 is the the only # where the negative of itself is itself.That last part is seemingly easy, but it took me a while to think in that direction.

Ah, ok. That's what "The same" meant. You've got the proof in your head just fine. Your statement has a funny looking det(-A)=det(A) statement. I assume that's a typo. Actually I see what you mean by that. You mean det(A^T)=det(A) (because it's true for any matrix) and det(A^T)=det(-A) (because the matrix is skew). Putting all of that in one line without giving reasons is confusing and bad style.
 
Last edited:
  • #9
Dick said:
Ah, ok. That's what "The same" meant. You've got the proof in your head just fine. Your statement has a funny looking det(-A)=det(A) statement. I assume that's a typo. Actually I see what you mean by that. You mean det(A^T)=det(A) (because it's true for any matrix) and det(A^T)=det(-A) (because the matrix is skew). Putting all of that in one line without giving reasons is confusing and bad style.

Oh yeah. I think it would've been better if I had it as det(A)=det(A^t)=det(-A) or in separate lines like you said.

Do you know of any sites where I can get more practice with proofs?
 
  • #10
pyroknife said:
Oh yeah. I think it would've been better if I had it as det(A)=det(A^t)=det(-A) or in separate lines like you said.

Do you know of any sites where I can get more practice with proofs?

Not giving reasons for statements is pretty bad. Putting a bunch of equalities in the same line that have different reasons for being true is asking trouble. You are asking whoever is reading the proof to guess what you are thinking. Don't do it. Make it as clear on paper as it is in your head. Sorry, don't know any practice proof sites.
 

FAQ: Proving Invertibility of Skew-Symmetric n × n Matrices for Odd Integers

What is a "Matrix Proof"?

A "Matrix Proof" is a type of mathematical proof that uses matrices to demonstrate the validity of a statement or problem. It involves manipulating matrices through various operations to arrive at a solution or conclusion.

How is a "Matrix Proof" different from other types of proofs?

A "Matrix Proof" differs from other types of proofs because it uses matrices as the main tool for solving mathematical problems. This requires a strong understanding of matrix operations and properties.

What are some common applications of "Matrix Proof"?

"Matrix Proof" is commonly used in fields such as linear algebra, computer graphics, and physics. It can be applied to solve problems related to systems of linear equations, transformations, and eigenvalues.

What are the key steps in a "Matrix Proof"?

The key steps in a "Matrix Proof" include identifying the problem or statement to be proven, setting up the necessary matrices, performing operations on the matrices, and arriving at a solution or conclusion that proves the original statement.

How can I improve my skills in "Matrix Proof"?

To improve your skills in "Matrix Proof", it is important to have a strong foundation in linear algebra and matrix operations. Practice solving problems and familiarize yourself with different matrix properties and theorems. Additionally, seeking guidance from a teacher or mentor can also help in improving your skills.

Back
Top