Can a Direct Proof Show That 1-A is its Own Inverse?

  • Thread starter Thread starter torquerotates
  • Start date Start date
  • Tags Tags
    Confused Logic
torquerotates
Messages
207
Reaction score
0
So my teacher said that when proving something, I can't start out with what I'm trying to prove. But what if it is an "if this than that proof"

For example,

If A(squared)=A, then I-A=(I-A)inverse

Well, I started using what I'm trying to prove by multiplying both sides by I-A

I get (I-A)squared=I
implies I-4A+4AA=I
implies I-4A+4A=I b/c A(squared)=A using the hypothesis
implies I+0=I
implies I=I both sides equal

The thing is that I have proven that if AA=A, then I-A=(I-A)inverse by using the hypothesis somewhere in the solution. Would this be a logical conclusion?
 
Physics news on Phys.org
No, everything that you have just written is complete nonsense. First of all, (I-A)^2 = I - 2A + A^2, so your proof that I=I is flawed anyway.

What you have tried to do is to take some statement and to use it to derive a true statement. However, I can easily derive a true statement from a false one. For instance, you have assumed that (I-A)^2 = I-4A+4A^2 and that A^2 = A. These two statements are not in general true (This is in fact only true if A = 0). Then you have used these statements to derive that I=I, which is true, but meaningless.
 
if every step in your proof is correct and reversable, then after geting to a true stTEMENT, just reverse field and reason bCKWrds to the desired statement.
 
here i would try proving the statement directly, i.e. ask whether indeed 1-A is its own inverse by squaring it and seeing if you get 1. along the way you get to replace A^2 by A.

i.e. (1-A)^2 = 1-2A + A^2 = 1-2A+A = 1-A. this does not seem to prove what you asked for.

this seems to prove that if you start from a projection operator and subtract it from 1, you get another projection operator.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
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