Re:Proof that 1 = 0 using a common logical fallacy
by archgoon on Wednesday March 17, 2010 @07:37PM
(#1199980)
x(-y)=x(-y+y-y)=x(-y)+xy+x(-y)
Cancellation yields 0=xy+x(-y)
Therefore -(xy)=x(-y)
Re:Proof that 1 = 0 using a common logical fallacy
by warwick on Wednesday March 17, 2010 @07:14PM
(#1199934)
Thank you. That's beautiful.
Re:Proof that 1 = 0 using a common logical fallacy
by python123 on Wednesday March 17, 2010 @07:28PM
(#1199958)
0 is additive identity. 0+y=y for all integers y. 0 is an integer, so 0+0=0. 0+0 is closed under addition, so (0+0) is an integer, so x(0+0) = x0 for all integers x. By distributive law, x0 + x0 = x0. By closure under multiplication, x0 is an integer. By additive inverses, there exists an integer (-x0), such that x0 + (-x0) = 0. Because (-x0) is an integer, x0 + x0 + (-x0) = x0+(-x0). By associative property of addition and the transitive property of equality, x0 + 0 = 0. By the additive identity, x*0 = 0.
Re:Proof that 1 = 0 using a common logical fallacy
by lmkg on Wednesday March 17, 2010 @07:52PM
(#1200017)
Excellent walk-through, thank you. You also removed one of my uses of additive inverses, which gets us closer to not needing the negative integers. I have two ideas for getting rid of the last use of them in your last step, but I'm sure they're kosher.
1) From the equation x0 + x0 = x0, you don't need inverses, just cancellation. I believe that cancellation is a strictly weaker property.
2) From the equation x0 + x0 = x0, note that x0 is the additive identity. Inverses are unique, thus x0 = 0.
Unfortunately, I'm not familiar enough with Peano arithmetic to know if proving either of these statements requires the statement we're trying to prove, that x*0 = 0. I'm more familiar with algebra, where inverses exist axiomatically. But at least we've weakened the hypotheses!
Re:Proof that 1 = 0 using a common logical fallacy
by jules on Wednesday March 17, 2010 @08:35PM
(#1200127)
To prove something about multiplication you first need to provide a definition of multiplication. So what is you definition of multiplication? The usual definition is:
a*0 = 0
a*S(b) = a*b+a
Cancellation follows from injectivity of S by induction.
Re:Proof that 1 = 0 using a common logical fallacy
by python123 on Wednesday March 17, 2010 @08:56PM
(#1200167)
No, you can't say x0 is the additive identity because 0 is the only additive identity. That would be equivalent to x0=0. Your way is fine if you just use what archgoon wrote to complete it.
Re:Proof that 1 = 0 using a common logical fallacy
by greenlblue on Wednesday March 17, 2010 @07:37PM
(#1199979)
This is exactly the proof in the case of vector spaces.
Here's the field proof I'm pulling out of memeory:
This relies on the existence of additive inverses for the first step, distribution in the second step, and the fact that x(-y) = -(xy) in the third step. That third property can be derived from sufficiently-specific ring axioms, but I forget how specific they have to be. It might be true in any ring by virtue of distribution but I forget the proof.So to answer your question, yes there are... but it depends on the context. In some situations it may need to be axiomatic. A recursively-defined system like Peano may need to take it axiomatically as a base case.