Linear Algebra Proof: Invertible Idempotent Matrix Must be Identity Matrix

AI Thread Summary
An invertible idempotent matrix A must be the identity matrix I_n, as shown through a contradiction. Assuming A is not equal to I_n leads to the conclusion that A must equal I, which contradicts the initial assumption. The proof relies on the properties of idempotent matrices, where A^2 = A, and the fact that A is invertible. The discussion also touches on a separate proof regarding the product of two idempotent matrices, A and B, being idempotent if they commute, but this claim is challenged. Ultimately, the consensus is that the initial proof about A being the identity matrix is correct.
Dosmascerveza
Messages
23
Reaction score
0

Homework Statement


If A is an invertible idempotent matrix, then A must be the Identity matrix I_n.

Homework Equations


A^2==A ; A^2==AA; A^(-1); I==A^(-1)

The Attempt at a Solution



Suppose A is an nxn matrix =/= I_n.

s.t. A^(2)==A

so A^(2)==A ==> AA==A

==> A^(-1)AA==A^(-1)A ==> A==I==> A^(-1)A==A^(-1)I==>I==A^(-1)I==A^(-1)==A

which yeilds a contradiction because we supposed our A =/= I_n.

Therefore A==I_nIs this correct please help me understand where I have failed...
 
Physics news on Phys.org
Dosmascerveza said:
Suppose A is an nxn matrix =/= I_n.

s.t. A^(2)==A

so A^(2)==A ==> AA==A
==> A^(-1)AA==A^(-1)A
==> A==I
You should have stopped right here. You should have also stated that A is invertible.
==> A^(-1)A==A^(-1)I
==> I==A^(-1)I==A^(-1)==A
This is wrong. You don't know that the inverse of A is equal to A.
 
Okay so if i stated A an invertible nxn matrix =/= I_n

s.t A^(2)==A(idempotent)... truncating the last bit of foolishness. I was correct?
 
another proof...
problem statement.
prove if A and B are idempotent and AB==BA then AB is idempotent.

AB==BA ==> A^(-1), B^(-1) exist

Since A and B are idempotent invertible matrices, from previously proven theorem, we know A=I and B=I. and since II==I ==> AB==I Therefore AB==BA and AB is Idempotent,
 
Dosmascerveza said:
AB==BA ==> A^(-1), B^(-1) exist
This isn't true.
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...
Essentially I just have this problem that I'm stuck on, on a sheet about complex numbers: Show that, for ##|r|<1,## $$1+r\cos(x)+r^2\cos(2x)+r^3\cos(3x)...=\frac{1-r\cos(x)}{1-2r\cos(x)+r^2}$$ My first thought was to express it as a geometric series, where the real part of the sum of the series would be the series you see above: $$1+re^{ix}+r^2e^{2ix}+r^3e^{3ix}...$$ The sum of this series is just: $$\frac{(re^{ix})^n-1}{re^{ix} - 1}$$ I'm having some trouble trying to figure out what to...

Similar threads

Back
Top