Proof of x^2 = y^2 and the Importance of a(0) in Calculus

  • Thread starter kripkrip420
  • Start date
  • Tags
    Proof
In summary, the equation holds that if x^{2}=y^{2}, then either x=y or x=-y. The proof for this is relatively simple, but it uses the assumption that a(0)=0. I propose a proof that a(0)=0 for all real a, using the properties listed in the book. All I need is a confirmation that my proof is without flaw. Thank you.
  • #1
kripkrip420
54
0

Homework Statement



I am using Spivak's Calculus and just finished the third exercise in part 1.
It was a very easy exercise but it seems that Spivak makes some assumptions.
The problem is as stated:

If x[itex]^{2}[/itex]=y[itex]^{2}[/itex], then either x=y or x=-y. Prove it.

The proof was relatively simple (by factoring out (x-y)(x+y) from x[itex]^{2}[/itex]
-y[itex]^{2}[/itex] and showing that either (x+y)=0 or (x-y)=0 or both). What I had problems with was that it was assumed that a(0)=0. So, I will now propose a proof that a(0)=0 for all real a using the properties listed in the book. All I need is a confirmation that my proof haw no flaw. Thank you.

Homework Equations


The Attempt at a Solution



Introduce (a*0).

(a*0)+(a*0)=0+(a*0).

By the distributive law

a(0+0)=(a*0)+0

By the existence of the additive identity

a*0=(a*0)+0.

Subtracting (a*0) from both sides yields

(a*0)-(a*0)=0

And by the existence of additive identity

0=0

Which is true. Is this valid?
 
Last edited:
Physics news on Phys.org
  • #2
kripkrip420 said:

Homework Statement



I am using Spivak's Calculus and just finished the third exercise in part 1.
It was a very easy exercise but it seems that Spivak makes some assumptions.
The problem is as stated:

If x[itex]^{2}[/itex]=y[itex]^{2}[/itex], then either x=y or x=-y. Prove it.

The proof was relatively simple (by factoring out (x-y)(x+y) from x[itex]^{2}[/itex]
-y[itex]^{2}[/itex] and showing that either (x+y)=0 or (x-y)=0 or both). What I had problems with was that it was assumed that a(0)=0. So, I will now propose a proof that a(0)=0 for all real a using the properties listed in the book. All I need is a confirmation that my proof haw no flaw. Thank you.

Homework Equations


The Attempt at a Solution



Introduce (a*0).

(a*0)+(a*0)=0+(a*0).
"Introduce (a*0)" in what??.

By the distributive law

a(0+0)=(a*0)
That's not the distributive law- that's the fact that 0+ 0= 0. And from that it follows that a(0)+ a(0)= a(0)

By the existence of the additive identity

a=a*0
That is certainly NOT true! And I don't see any point in talking about the "existence of the additive identity" when you have already been using "0" which is defined as the additive identity.

And we have proven our proposition.

Is this valid?
No, it is not. Instead, from the distributive law a(0+ 0)= a(0)+ a(0). And since 0 is additive identity, x+ 0= x for any x. In particular 0+ 0= 0 so the left side is just a(0). Once you have a(0)= a(0)+ a(0) use the fact that a(0) has an additive inverse.
 
Last edited by a moderator:
  • #3
Please reread the edited proof. I made an error when I first posted.
 
  • #4
Same errors I noted before. You seem to have payed no attention to my first post.
 
  • #5
The easiest way to do it would probably be just to give it some modus tollens imo

I'm not quite sure what you're trying to do by playing about with 0 here...
 
  • #6
Okay. I will redo it here and explain myself better. In Spivak's book, he lists 12 properties of the real numbers. I will use those properties to prove that for any real a

(a*0)=0.

Begin with the assumption that the above statement is false.

Since (a*0) is in R, then by the closure under addition property, (a*0)+(a*0) must be in R. Therefore, we can add (a*0) to both sides of the above equation and we shall have

(a*0)+(a*0)=0+(a*0). (1)

Now, the left side of the equation can be factored out by the distributive law to yield

(a(0+0))=(a*0)+(a*0).

Thus, (1) becomes:

(a(0+0))=0+(a*0). (2)

But, 0+0=0 and the left side becomes

(a(0+0))=(a(0)).

Thus, for (2), we have:

(a(0))=0+(a(0)). (3)

But, by property 3 in Spivak's book, for every real k, there exists it's additive inverse denoted -k such that

k+(-k)=0.

Therefore, by adding the negative of (a*0) to both sides of equation (3), we get

(a(0))+(-(a(0)))=0+(a(0))+(-(a(0))). (4)

Again, by Spivak's third stated property, we have:

(a(0))+(-(a(0))=0 and equation (4) becomes

0=0+0. (5)

But it is clear from Spivak's second property that

0+0=0

and equation (5) becomes

0=0.

But, this is obviously true, and since valid manipulation was made to our initial equation

(a*0)=0,

then our initial assumption was false and, therefore,

(a*0)=0 must be true.

I really hope this clarifies things.
 
  • #7
kripkrip420 said:
Okay. I will redo it here and explain myself better. In Spivak's book, he lists 12 properties of the real numbers. I will use those properties to prove that for any real a

(a*0)=0.

Begin with the assumption that the above statement is false.

Since (a*0) is in R, then by the closure under addition property, (a*0)+(a*0) must be in R. Therefore, we can add (a*0) to both sides of the above equation

Why are you allowed to use the above equation?? You just said you assumed the equation is false.
 
  • #8
Hello micromass. I did the proof through contradiction. If we begin with the assumption that the equation is false and manipulate the equation so that everything we do is justifiable, we should end up with a result that varifies the assumption. However, what I got (after showing after steps of manipulation) is that 0=0. Now, since this is obviously true, the INITIAL assumption that the equation was false is in its own right false. Therefore, the equation must be true. I believe that I had actually done this problem in Apostol's calculus book. As far as I cam recall, this was an adequate proof.
 
  • #9
Yes, I get what you were trying to do.

But if you assume the equation is false, then you cannot use that in your proof. You can only use things in a proof that you know are true or that you assumed are true.
 
  • #10
It's like this:

I want to prove that 2+2=5.
Assume by contradiction that 2+2=5 is not true.

So take 2+2=5. Multiply both sides with 0, then we get 0*(2+2)=0*5. We get that 0=0.

This is true, so 2+2=5 must be true.


This is essentially what you did, but it is of course not valid.
 
  • #11
micromass said:
It's like this:

I want to prove that 2+2=5.
Assume by contradiction that 2+2=5 is not true.

So take 2+2=5. Multiply both sides with 0, then we get 0*(2+2)=0*5. We get that 0=0.

This is true, so 2+2=5 must be true.


This is essentially what you did, but it is of course not valid.

I understand what you mean. But I notice that it also does not change the outcome if I change the assumption from false to true. I must have made an error somewhere else because I made a similar proof a while back and had it verified by another forum. I will post another proof once I get back from grocery shopping. Thank you for your help.
 

1. What is the purpose of verifying a simple proof?

The purpose of verifying a simple proof is to ensure that the argument or solution presented is correct and follows logical reasoning. It helps to identify any errors or gaps in the proof and to strengthen the validity of the conclusion.

2. How do you verify a simple proof?

To verify a simple proof, one must carefully examine each step of the proof and check if it follows the rules of logic and mathematics. This involves checking the validity of each statement, the logical connections between them, and the correctness of any calculations or reasoning used.

3. What are the common methods used for verifying a simple proof?

The most common methods used for verifying a simple proof include direct proof, proof by contradiction, and proof by mathematical induction. Additionally, proof by exhaustion and proof by counterexample can also be used in certain cases.

4. What are some common mistakes to look out for when verifying a simple proof?

Some common mistakes to look out for when verifying a simple proof include logical fallacies, incorrect use of mathematical principles or symbols, and incorrect assumptions. It is also important to check for any steps that are missing or do not follow logically from the previous ones.

5. Can a simple proof be verified by using a computer program?

Yes, a simple proof can be verified by using a computer program, as long as the program is designed to follow the rules of logic and mathematics. However, it is still important for a human to review and verify the proof to ensure its correctness and validity.

Similar threads

  • Calculus and Beyond Homework Help
Replies
2
Views
539
  • Calculus and Beyond Homework Help
Replies
13
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
173
  • Calculus and Beyond Homework Help
Replies
11
Views
830
  • Calculus and Beyond Homework Help
Replies
7
Views
643
  • Calculus and Beyond Homework Help
Replies
4
Views
518
  • Calculus and Beyond Homework Help
Replies
18
Views
1K
  • Calculus and Beyond Homework Help
Replies
20
Views
385
  • Calculus and Beyond Homework Help
Replies
2
Views
459
  • Calculus and Beyond Homework Help
Replies
2
Views
480
Back
Top