MHB Problem with idempotent matrices

  • Thread starter Thread starter Samme013
  • Start date Start date
  • Tags Tags
    Matrices
Samme013
Messages
15
Reaction score
0
OK so i can prove that the given inverse is actually the inverse but i can not prove that I+A is non singular without using the given inverse so how do i go about doing that?(I have done part a)
Thanks in advance.View attachment 3586
 

Attachments

  • E8PTbbG.png
    E8PTbbG.png
    3.9 KB · Views: 85
Physics news on Phys.org
I'm confused. Is there a reason you can't use the fact that $(I+A)(I-\tfrac12 A)=I$ in order to show that $I+A$ is invertible?
 
Ackbach said:
I'm confused. Is there a reason you can't use the fact that $(I+A)(I-\tfrac12 A)=I$ in order to show that $I+A$ is invertible?

I am not sure if i can use that fact and i can't really ask but it is kind of trivial if i can use it.Is it even possible to show it without using that?
 
Samme013 said:
I am not sure if i can use that fact and i can't really ask but it is kind of trivial if i can use it.Is it even possible to show it without using that?

It might be. You might be able to do something clever with determinants. Let me marshall the facts such as we know them:
\begin{align*}
&\text{Idempotent matrices have determinant equal to } 0 \text{ or } 1. \text{ Why?} \\
A^2&=A \\
(\det(A))^2&=\det(A) \\
(\det(A))^2-\det(A)&=0 \\
\det(A)(\det(A)-1)&=0 \\
\det(A)&\in\{0,1\} \\
\therefore \; \det(I-A)&\in\{0,1\}. \\
&\text{Idempotent matrices are either the identity matrix, or are singular.} \\
&\text{Why? Assume } A \text{ is non-singular. Then } \\
A^2&=A \\
A^{-1}AA&=A^{-1}A \\
IA&=I \\
A&=I.
\end{align*}
Now we could take two cases: 1. $A=I$. 2. $\det(A)=0$.

For the first case, $I+A=I+I=2I$, and the determinant is $2^n\not=0$, where $A$ is $n\times n$.

For the second case, we have $\det(A)=0$. What if you formed the product
$$(I+A)(I+A)=I^2+IA+AI+A^2=I+2A+A=I+3A.$$
Not sure where that leads you. You could also form
$$(I-A)(I+A)=I^2+IA-AI-A^2=I+A-A-A=I-A.$$
Just seeing here:
$$(I-A)(I-A)=I^2-IA-AI+A^2=I-A-A+A=I-A.$$
Evidently, $(I-A)(I-A)=(I-A)(I+A)$, but I don't see where you can go further. There's no guarantee that $I-A$ is invertible (indeed, unless $I-A=I$, it won't be!), so you can't cancel anything, and the determinants won't give you anything here, either.

I think that using the formula for the inverse the problem asks you to show is just fine. If you simply compute $(I+A)(I-\tfrac12 A)=I$, you have just shown that $I+A$ is invertible. The problem asks you to show those two things. It does not tell you in what order to do them.
 
Ackbach said:
It might be. You might be able to do something clever with determinants. Let me marshall the facts such as we know them:
\begin{align*}
&\text{Idempotent matrices have determinant equal to } 0 \text{ or } 1. \text{ Why?} \\
A^2&=A \\
(\det(A))^2&=\det(A) \\
(\det(A))^2-\det(A)&=0 \\
\det(A)(\det(A)-1)&=0 \\
\det(A)&\in\{0,1\} \\
\therefore \; \det(I-A)&\in\{0,1\}. \\
&\text{Idempotent matrices are either the identity matrix, or are singular.} \\
&\text{Why? Assume } A \text{ is non-singular. Then } \\
A^2&=A \\
A^{-1}AA&=A^{-1}A \\
IA&=I \\
A&=I.
\end{align*}
Now we could take two cases: 1. $A=I$. 2. $\det(A)=0$.

For the first case, $I+A=I+I=2I$, and the determinant is $2^n\not=0$, where $A$ is $n\times n$.

For the second case, we have $\det(A)=0$. What if you formed the product
$$(I+A)(I+A)=I^2+IA+AI+A^2=I+2A+A=I+3A.$$
Not sure where that leads you. You could also form
$$(I-A)(I+A)=I^2+IA-AI-A^2=I+A-A-A=I-A.$$
Just seeing here:
$$(I-A)(I-A)=I^2-IA-AI+A^2=I-A-A+A=I-A.$$
Evidently, $(I-A)(I-A)=(I-A)(I+A)$, but I don't see where you can go further. There's no guarantee that $I-A$ is invertible (indeed, unless $I-A=I$, it won't be!), so you can't cancel anything, and the determinants won't give you anything here, either.

I think that using the formula for the inverse the problem asks you to show is just fine. If you simply compute $(I+A)(I-\tfrac12 A)=I$, you have just shown that $I+A$ is invertible. The problem asks you to show those two things. It does not tell you in what order to do them.

The exercise is listed under a chapter which is before determinants are introduced( i have no clue what they are yet) so most likely it is not expected to come up wit that solution.I will definitely come back and take a look at this when i get to the next chapter though, thanks for helping !
 
Samme013 said:
The exercise is listed under a chapter which is before determinants are introduced( i have no clue what they are yet) so most likely it is not expected to come up wit that solution.I will definitely come back and take a look at this when i get to the next chapter though, thanks for helping !

You're very welcome!
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top