Suprema proof: quick check please

  • Thread starter tylerc1991
  • Start date
  • Tags
    Proof
In summary, we proved that if X and Y are bounded above, then the set Z = {x + y: x ∈ X, y ∈ Y} is also bounded above, and the least upper bound of Z is less than or equal to the sum of the least upper bounds of X and Y. This is shown by defining e_x, e_y, and e_z as elements of X, Y, and Z respectively, and using the definition of a least upper bound to show that x_{sup} + y_{sup} is an upper bound for Z.
  • #1
tylerc1991
166
0

Homework Statement



Assume that [itex] X \subseteq \mathbb{R} [/itex] and [itex] Y \subseteq \mathbb{R} [/itex] are each bounded above. Then the set
[itex] Z = \{ x + y : x \in X, y \in Y \} [/itex]
is bounded above, and
[itex] \text{sup}(Z) \leq \text{sup}(X) + \text{sup}(Y). \quad \quad [/itex]

The Attempt at a Solution



Let [itex] X \subseteq \mathbb{R} [/itex] and [itex] Y \subseteq \mathbb{R} [/itex] be bounded above, and define the set [itex] Z [/itex] as
[itex] Z = \{ x + y : x \in X, y \in Y \}. [/itex]
Let [itex] e_x [/itex] represent an element of [itex] X [/itex], [itex] e_y [/itex] represent an element of [itex] Y [/itex], and [itex] e_z [/itex] represent an element of [itex] Z [/itex].
For any [itex] e_z [/itex], there exists some [itex] e_x [/itex] and [itex] e_y [/itex] such that
[itex] e_z = e_x + e_y. \quad \quad (1) [/itex]
Since [itex] X [/itex] and [itex] Y [/itex] are bounded above, there exists a least upper bound for [itex] X [/itex] and [itex] Y [/itex], which can be represented as [itex] x_{sup} = \text{sup}(X) \text{ and } y_{sup} = \text{sup}(Y) [/itex].
By the definition of the least upper bound, for all [itex] e_x \in X, \, x_{sup} \geq e_x [/itex].
Similarly, for all [itex] e_y \in Y, \, y_{sup} \geq e_y [/itex].
From equation (1), this means that
[itex] e_z = e_x + e_y \leq x_{sup} + y_{sup} \quad \quad (2) [/itex]
for all [itex] e_x [/itex] and [itex] e_y [/itex].
From equation (2), we see that [itex] x_{sup} + y_{sup} [/itex] is an upper bound for [itex] Z [/itex].
By definition, this proves that [itex] Z [/itex] is bounded above.
Since [itex] Z [/itex] is bounded above, note that [itex] Z [/itex] has a least upper bound which can be represented as [itex] z_{sup} = \text{sup}(Z) [/itex].
By the definition of a least upper bound, [itex] z_{sup} \leq x_{sup} + y_{sup} [/itex], or
[itex] \text{sup}(Z) \leq \text{sup}(X) + \text{sup}(Y).[/itex] Q.E.D.

It wanted to be sure that this is 100% good to go before I have to turn this in. Thank you very very much for anyone that takes a look!
 
Physics news on Phys.org
  • #2
Looks good to me. Wait for more comments
 
  • #3
tylerc1991 said:

Homework Statement



Assume that [itex] X \subseteq \mathbb{R} [/itex] and [itex] Y \subseteq \mathbb{R} [/itex] are each bounded above. Then the set
[itex] Z = \{ x + y : x \in X, y \in Y \} [/itex]
is bounded above, and
[itex] \text{sup}(Z) \leq \text{sup}(X) + \text{sup}(Y). \quad \quad [/itex]

The Attempt at a Solution



Let [itex] X \subseteq \mathbb{R} [/itex] and [itex] Y \subseteq \mathbb{R} [/itex] be bounded above, and define the set [itex] Z [/itex] as
[itex] Z = \{ x + y : x \in X, y \in Y \}. [/itex]
Let [itex] e_x [/itex] represent an element of [itex] X [/itex], [itex] e_y [/itex] represent an element of [itex] Y [/itex], and [itex] e_z [/itex] represent an element of [itex] Z [/itex].
For any [itex] e_z [/itex], there exists some [itex] e_x [/itex] and [itex] e_y [/itex] such that
[itex] e_z = e_x + e_y. \quad \quad (1) [/itex]
Since [itex] X [/itex] and [itex] Y [/itex] are bounded above, there exists a least upper bound for [itex] X [/itex] and [itex] Y [/itex], which can be represented as [itex] x_{sup} = \text{sup}(X) \text{ and } y_{sup} = \text{sup}(Y) [/itex].
By the definition of the least upper bound, for all [itex] e_x \in X, \, x_{sup} \geq e_x [/itex].
Similarly, for all [itex] e_y \in Y, \, y_{sup} \geq e_y [/itex].
From equation (1), this means that
[itex] e_z = e_x + e_y \leq x_{sup} + y_{sup} \quad \quad (2) [/itex]
for all [itex] e_x [/itex] and [itex] e_y [/itex].
From equation (2), we see that [itex] x_{sup} + y_{sup} [/itex] is an upper bound for [itex] Z [/itex].
By definition, this proves that [itex] Z [/itex] is bounded above.
Since [itex] Z [/itex] is bounded above, note that [itex] Z [/itex] has a least upper bound which can be represented as [itex] z_{sup} = \text{sup}(Z) [/itex].
By the definition of a least upper bound, [itex] z_{sup} \leq x_{sup} + y_{sup} [/itex], or
[itex] \text{sup}(Z) \leq \text{sup}(X) + \text{sup}(Y).[/itex] Q.E.D.

It wanted to be sure that this is 100% good to go before I have to turn this in. Thank you very very much for anyone that takes a look!

Very nicely done! The proof is good, but it's also written down superbly!
This would exactly be the kind of proof that I would like to receive as an assignment!
 
  • #4
micromass said:
Very nicely done! The proof is good, but it's also written down superbly!
This would exactly be the kind of proof that I would like to receive as an assignment!

Thank you very much for the encouraging feedback! My only small concern was the way I brought in the fact that e_z = e_x + e_y for some e_x and e_y. Intuitively, this is pretty obvious, but the course requires near perfect style as well as great logic.
 
  • #5
tylerc1991 said:
Thank you very much for the encouraging feedback! My only small concern was the way I brought in the fact that e_z = e_x + e_y for some e_x and e_y. Intuitively, this is pretty obvious, but the course requires near perfect style as well as great logic.

I wouldn't worry about that, it's pretty obvious.

Maybe you will want to explain (2) some more. It's also obvious, but your professor might complain there...
 

FAQ: Suprema proof: quick check please

What is Suprema proof?

Suprema proof is a method used in scientific experiments to quickly check the accuracy and validity of a hypothesis or result.

How does Suprema proof work?

Suprema proof involves conducting a simplified version of the original experiment or using a different method to obtain similar results. This allows for a quick comparison and confirmation of the original findings.

When is Suprema proof used?

Suprema proof is typically used in cases where a quick check of results is needed, such as in time-sensitive experiments or when a large number of data points need to be verified.

What are the benefits of using Suprema proof?

Suprema proof can save time and resources by providing a quick way to validate results. It can also help to identify potential errors or flaws in the original experiment.

Are there any limitations to Suprema proof?

Suprema proof is not a substitute for a comprehensive, in-depth analysis of results. It should be used as a preliminary check and not relied upon as the sole method of validation.

Back
Top