Suprema proof: quick check please

  • Thread starter Thread starter tylerc1991
  • Start date Start date
  • Tags Tags
    Proof
Click For Summary

Homework Help Overview

The discussion revolves around a proof concerning the supremum of the set Z, defined as the sum of elements from two bounded sets X and Y in the real numbers. The original poster seeks validation for their proof that establishes Z is bounded above and that the supremum of Z is less than or equal to the sum of the suprema of X and Y.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • The original poster presents a detailed proof and seeks confirmation of its correctness. Some participants express approval of the proof's structure and clarity. There are concerns raised about the presentation of certain elements, particularly the intuitive nature of the relationship e_z = e_x + e_y and the need for precise style in mathematical writing.

Discussion Status

The discussion is ongoing, with participants providing positive feedback on the proof while also suggesting areas for improvement in clarity and style. There is no explicit consensus, but the feedback indicates a productive exchange regarding the proof's presentation.

Contextual Notes

The course emphasizes high standards in both logical reasoning and stylistic presentation, which influences the participants' feedback and concerns.

tylerc1991
Messages
158
Reaction score
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
Looks good to me. Wait for more comments
 
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!
 
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.
 
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...
 

Similar threads

Replies
7
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
2
Views
1K
Replies
4
Views
2K
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
4K