Question about proof from a guy with a highschool education

Click For Summary
The discussion focuses on understanding mathematical proofs, particularly how to present them correctly. A user seeks to prove that if A + B = C, then A - B = C - 2B, and receives feedback on the importance of justifying each step and clearly stating axioms and lemmas. Participants emphasize that proofs should start from accepted assumptions and proceed logically, avoiding assumptions that are not proven. The conversation also touches on the common lack of proof-writing skills among high school and undergraduate students, highlighting the need for practice and guidance. Overall, the thread serves as a resource for beginners to improve their understanding of mathematical proofs.
  • #511
micromass said:
No, that answer is incorrect. How did you find it??

Instead of just giving your answer, I really would appreciate it if you would also give a formal proof of why the answer is correct. For example, what Fredrik did in post 504.

I would like to be sure I'm reading the notation correctly at least.

Is it (a) × [all numbers between 0 and 1 , including both of them] ?
 
Mathematics news on Phys.org
  • #512
reenmachine said:
I would like to be sure I'm reading the notation correctly at least.

Is it (a) × [all numbers between 0 and 1 , including both of them] ?

Yes, it's

\{a\}\times \{x\in \mathbb{R}~\vert~ 0\leq x\leq 1\}
 
  • #513
Fredrik said:
The ##\times## in post #511 is a cartesian product.

I'm a little bit confused about how you can multiply a number with something like [0,1].I don't think I've ever encountered such a thing.
 
  • #514
micromass said:
Yes, it's

\{a\}\times \{x\in \mathbb{R}~\vert~ 0\leq x\leq 1\}

hmmm ok , let me think about it some more.
 
  • #515
reenmachine said:
I'm a little bit confused about how you can multiply a number with something like [0,1].I don't think I've ever encountered such a thing.

We don't multiply a number with [0,1]. We take the cartesian product of the set ##\{a\}## (this is not a number, but a set containing the number) and the set [0,1].
 
  • #516
micromass said:
No, that answer is incorrect. How did you find it??

Instead of just giving your answer, I really would appreciate it if you would also give a formal proof of why the answer is correct. For example, what Fredrik did in post 504.

Okay ,my thought process was that since 1 is included , then all real numbers could be multiplied by 1 and it would give me all real numbers.Since it's the union of all these multiplications , I figured in the end it would be all real numbers present in the set.The other multiplication like (3) × 0,6 for exemple would just give me 1,8 , which is the same as (1,8) × 1.So they are all guaranteed to be there.
 
  • #517
reenmachine said:
Okay ,my thought process was that since 1 is included , then all real numbers could be multiplied by 1 and it would give me all real numbers.Since it's the union of all these multiplications , I figured in the end it would be all real numbers present in the set.

But ##\times## isn't multiplication. It's the cartesian product.
 
  • #518
So the cartesian product would look like : ##( x \in R , 0 ≤ x ≤ 1)## ? (an ordered pair)
 
  • #519
reenmachine said:
So the cartesian product would look like : ##( x \in R , 0 ≤ x ≤ 1)## ? (an ordered pair)

The cartesian product of which sets would like like that? I don't understand the question.
 
  • #520
How about that? ##\{(x,y) \in R : x \in R \ \ , 0 ≤ y ≤ 1 \}##
 
  • #521
reenmachine said:
How about that? ##\{(x,y) \in R : x \in R \ \ , 0 ≤ y ≤ 1 \}##

Is this supposed to be an answer to the question in 511?

In that case, can you please provide a formal proof of this. Like Fredrik did in 504.
 
  • #522
micromass said:
Is this supposed to be an answer to the question in 511?

In that case, can you please provide a formal proof of this. Like Fredrik did in 504.

Yes , it's suppose to :smile:

Okay I will try to prove it.
 
  • #523
(x,y) is an element of the union of all cartesian products of ##\{a\} × [0,1]## with ##a## being an element of the set ##R##.

union: (x,y) is an element of at least one cartesian product of ##\{a\} × [0,1]## with ##a## being an element of the set ##R##.

##R## is the set of all real numbers.

Since it's ##\{a\} × [0,1]## , the first componant of every ordered pair of this set will be an element of ##R## and the second will be a number between 0 and 1 (with 0 and 1 included because of the [] ).Since all numbers between 0 and 1 are real numbers , then the second componant will also be an element of ##R##.

This means that ##(x,y) \in R## , and since ##x \in R## and ##0 ≤ y ≤ 1## , this set will be the set ##\{ (x,y) \in R : x \in R \ , 0 ≤ y ≤ 1\}##.
 
  • #524
reenmachine said:
(x,y) is an element of the union of all cartesian products of ##\{a\} × [0,1]## with ##a## being an element of the set ##R##.

union: (x,y) is an element of at least one cartesian product of ##\{a\} × [0,1]## with ##a## being an element of the set ##R##.

##R## is the set of all real numbers.

Since it's ##\{a\} × [0,1]## , the first componant of every ordered pair of this set will be an element of ##R## and the second will be a number between 0 and 1 (with 0 and 1 included because of the [] ).Since all numbers between 0 and 1 are real numbers , then the second componant will also be an element of ##R##.

This means that ##\{(x,y) \in R\ : ...\}## , and since ##x \in R## and ##0 ≤ y ≤ 1## , this set will be the set ##\{ (x,y) \in R : x \in R \ , 0 ≤ y ≤ 1\}##.

That only proves

\bigcup_{a\in \mathbb{R}} \{a\}\times [0,1]\subseteq \mathbb{R}\times [0,1]

You need ot prove the other inclusion too.
 
  • #525
micromass said:
That only proves

\bigcup_{a\in \mathbb{R}} \{a\}\times [0,1]\subseteq \mathbb{R}\times [0,1]

You need ot prove the other inclusion too.

How could the first be a subset of the second? It should be the opposite no?

edit:forget it , they are the same aren't they?
 
  • #526
Let assume x is an element of ##\bigcup_{a\in \mathbb{R}} \{a\}## and that y is an element of [0,1].

This implies that ##(x,y) \in \bigcup_{a\in \mathbb{R}} \{a\}## × ##[0,1]##.

Now let assume ##(x,y) \in \bigcup_{a\in \mathbb{R}} \{a\}## × ##[0,1]## , this implies that ##x \in R## and that ##0 ≤ y ≤ 1##.Therefore it proves that this is the set ##\{ (x,y) \in \bigcup_{a\in \mathbb{R}} \{a\} × [0,1]: x \in R \ , 0 ≤ y ≤ 1\}##.
 
Last edited:
  • #527
I think it's almost time to start doing things a more normal way. I don't mind if you keep using the thread this way for the rest of the day (and night), but after that, I would like you to start using the homework forums for questions about textbook problems*.

You can keep using this thread for questions about definitions and theorems in the Book of Proof. When you start with calculus, you should start another thread to discuss concepts from your calculus book.


*) Note that we have specific guidelines about how to ask for homework help.
 
  • #528
Is what I'm missing the fact that the ordered pair will always be [R , 0] , [R , 0,002] , ... , [R , 1]. With R truly meaning all numbers in R?

This would mean : Now let assume ##(x,y) \in \bigcup_{a\in \mathbb{R}} \{a\}## × ##[0,1]## , this implies that ##x = R## and that ##0 ≤ y ≤ 1##.Therefore it proves that this is the set ##\{ (x,y) \in \bigcup_{a\in \mathbb{R}} \{a\}× [0,1] : x = R \ , 0 ≤ y ≤ 1\}##.

(The union of all elements of R = R.Which is why the x=R was implied)
 
Last edited:
  • #529
Fredrik said:
I think it's almost time to start doing things a more normal way. I don't mind if you keep using the thread this way for the rest of the day (and night), but after that, I would like you to start using the homework forums for questions about textbook problems*.

You can keep using this thread for questions about definitions and theorems in the Book of Proof. When you start with calculus, you should start another thread to discuss concepts from your calculus book.*) Note that we have specific guidelines about how to ask for homework help.

No problem.I think the thread has been more about questions and definitions than exercises anyway.I only tried exercises here and there to verify if I understood.

It wasn't my intention to make you guys correct a bunch of exercises for me.
 
  • #530
reenmachine said:
Let assume x is an element of ##\bigcup_{a\in \mathbb{R}} \{a\}## and that y is an element of [0,1].
Since that union is equal to ##\mathbb R##, this is the same thing as assuming that ##(x,y)\in\mathbb R\times[0,1]##.

reenmachine said:
This implies that ##(x,y) \in \bigcup_{a\in \mathbb{R}} \{a\}## × ##[0,1]##.
I would interpret the notation on the right here as
$$\bigcup_{a\in \mathbb{R}} \left(\{a\}\times [0,1]\right),$$ not as
$$\left(\bigcup_{a\in \mathbb{R}} \{a\}\right)\times [0,1].$$ The notation is kind of ambiguous though. I don't know if one of these interpretations are "standard". I'm also not sure how you're interpreting it.

You haven't proved that (x,y) is an element of the latter of these two sets, because that statement is your starting assumption.

And you haven't proved that (x,y) is an element of the former of the two sets either, but it's not hard to add a statement that takes care of that.

So let's be really clear here. Let's say that we want to prove that $$\bigcup_{a\in \mathbb{R}} \left(\{a\}\times [0,1]\right)=\mathbb R\times[0,1].$$ The parentheses make this problem unambiguous. This is how I would start:

Let ##z\in \bigcup_{a\in \mathbb{R}} \left(\{a\}\times [0,1]\right)## be arbitrary. Let x be an arbitrary real number such that ##z\in\{x\}\times [0,1]##. Let y be an arbitrary element of [0,1] such that ##z=(x,y)##. Since ##x\in R## and ##y\in[0,1]##, this equality implies that ##z\in\mathbb R\times [0,1]##. Edit: You know what, I'm going to rewrite this in an even clearer way. See below in a few minutes.

Can you do the other one, starting like this:

Let ##z\in\mathbb R## be arbitrary.



Edit: Here's the maximal clarity version of the proof above:

Let ##z\in \bigcup_{a\in \mathbb{R}} \left(\{a\}\times [0,1]\right)## be arbitrary. The definition of this notation implies that there's a ##b\in\mathbb R## such that ##z\in\{b\}\times[0,1]##. Let ##x## be such a real number. We have ##z\in\{x\}\times[0,1]##. The definition of this notation implies that there's a ##c\in[0,1]## such that ##z=(x,c)##. Let ##y## be such an element of [0,1]. We have ##z\in (x,y)##. Since ##x\in\mathbb R## and ##y\in[0,1]##, this implies that ##z\in\mathbb R\times[0,1]##.
 
Last edited:
  • #531
Just saw your edit lol Saved by the bell.
 
  • #532
Let ##z \in R × [0,1]## be arbitrary.This implies that there's an arbitrary element ##x \in R## and an arbitrary element ##y \in [0,1]##.The notation of the set implies that ##(x,y) = z##.Since ##y \in [0,1]## and ##x \in R## , that the union of all elements of ##R = R## , this implies that ##z \in \bigcup_{a \in R}\{a\} × [0,1]##.
 
  • #533
I'm done with the edit. My proof at the end is more detailed than the proofs you will find in textbooks. For example, I said "there's a real number b such that..." and then followed up with "let x be such a real number". Textbooks always smash these two statements into one. I think most of the authors choose to emphasize only the "there exists" part by saying "there's a real number x such that..." The problem with this is that when they refer to "x" in the next sentence, it's not really clear that they're referring to an x with the property just discussed, because the x in the "there exists" statement was a dummy variable.

So this way of presenting the proof is an abuse of language, but people use it anyway because it's a pain to have to think of a second variable to use and then make both statements.

What I did in my first version of the proof was to emphasize the assignment of a value to a new variable x instead of the "there exists" part. I often do that by saying something like "let x be a real number such that...". From a strictly logical perspective, this is better because now when the next sentence refers to x, there's no question of what x. But it may still be more difficult to understand, since it's now up to the reader to understand that the previous statement implies the existence of a real number with the necessary property.

So one thing I could have done is to add a comment after my "let x..." statement. For example: (The definition of "union" implies that such an x exists).
 
  • #534
reenmachine said:
This implies that there's an arbitrary element ##x \in R## and an arbitrary element ##y \in [0,1]##.The notation of the set implies that ##(x,y) = z##.

Well, ##x## and ##y## aren't arbitrary anymore. They are completely determined by ##z##. So ##z=(x,y)## for a unique ##x## and ##y##.
 
  • #535
micromass said:
Well, ##x## and ##y## aren't arbitrary anymore. They are completely determined by ##z##. So ##z=(x,y)## for a unique ##x## and ##y##.

I'm not sure I understand , what am I suppose to say then? Just leave the word ''arbitrary'' out?

Should I say , R × [0,1] implies that z = (x,y)?
 
  • #536
reenmachine said:
I'm not sure I understand , what am I suppose to say then? Just leave the word ''arbitrary'' out?

Yeah, you shouldn't say that ##x## and ##y## are arbitrary, since they are completely determined. Only ##z## is arbitrary.
 
  • #537
micromass said:
Yeah, you shouldn't say that ##x## and ##y## are arbitrary, since they are completely determined. Only ##z## is arbitrary.

Corrected version:

Let ##z \in R × [0,1]## be arbitrary.This implies that there's an element ##x \in R## and an element ##y \in [0,1]##.The notation of the set implies that ##z = (x,y)##.Since ##y \in [0,1]## and ##x \in R## , that the union of all elements of ##R = R## , this implies that ##z \in \bigcup_{a \in R}\{a\} × [0,1]##.
 
Last edited:
  • #538
Fredrik said:
I'm done with the edit. My proof at the end is more detailed than the proofs you will find in textbooks. For example, I said "there's a real number b such that..." and then followed up with "let x be such a real number". Textbooks always smash these two statements into one. I think most of the authors choose to emphasize only the "there exists" part by saying "there's a real number x such that..." The problem with this is that when they refer to "x" in the next sentence, it's not really clear that they're referring to an x with the property just discussed, because the x in the "there exists" statement was a dummy variable.

So this way of presenting the proof is an abuse of language, but people use it anyway because it's a pain to have to think of a second variable to use and then make both statements.

What I did in my first version of the proof was to emphasize the assignment of a value to a new variable x instead of the "there exists" part. I often do that by saying something like "let x be a real number such that...". From a strictly logical perspective, this is better because now when the next sentence refers to x, there's no question of what x. But it may still be more difficult to understand, since it's now up to the reader to understand that the previous statement implies the existence of a real number with the necessary property.

So one thing I could have done is to add a comment after my "let x..." statement. For example: (The definition of "union" implies that such an x exists).

Hmmm I see , I was wondering why you were doing that.I do ''get it'' , but it's harder to do than it looks when you read it and approve :smile:

thanks man!
 
  • #539
Fredrik said:
I would interpret the notation on the right here as
$$\bigcup_{a\in \mathbb{R}} \left(\{a\}\times [0,1]\right),$$ not as
$$\left(\bigcup_{a\in \mathbb{R}} \{a\}\right)\times [0,1].$$ The notation is kind of ambiguous though. I don't know if one of these interpretations are "standard". I'm also not sure how you're interpreting it.

To be honest at the beginning I was wondering which one it was.

In the second one , does it mean that each ordered pair would look like [all real numbers , 1]?
 
  • #540
I had started typing this when my brother interrupted me with a phone call. I see that you are already working on these issues with micromass, but I might as well post it since I had finished this post before I saw that.

reenmachine said:
Let ##z \in R × [0,1]## be arbitrary.
So far so good. :smile:

reenmachine said:
This implies that there's an arbitrary element ##x \in R## and an arbitrary element ##y \in [0,1]##.
Either say "this implies that there's an ##x\in\mathbb R## such that..." or "let x be an arbitrary real number such that...". Don't say "implies that there's an arbitrary ##x\in\mathbb R##..."

More importantly, what you're saying here is just that ℝ and [0,1] are non-empty sets. They are, but, we didn't need to use the statement ##z \in\mathbb R × [0,1]## to see that.

reenmachine said:
The notation of the set implies that ##(x,y) = z##.
You said that x,y,z were all arbitrary, so this doesn't follow from what you said.
 

Similar threads

  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 12 ·
Replies
12
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
7
Views
2K
  • · Replies 105 ·
4
Replies
105
Views
8K
Replies
21
Views
3K
Replies
11
Views
2K