Solve Supremum Problem: X, Y and Z Sets

  • Thread starter Thread starter e(ho0n3
  • Start date Start date
  • Tags Tags
    Supremum
Click For Summary
SUMMARY

The discussion centers on the supremum problem involving bounded sequences of real numbers defined by sets X, Y, and Z. It establishes that the supremum of set Z is less than or equal to the sum of the suprema of sets X and Y, specifically stating that sup Z ≤ sup X + sup Y. The equality condition is highlighted, noting that it holds if at least one of the sequences converges. The attempt to prove this involves showing that Z is a subset of the sum set X+Y, but challenges arise due to the bounded nature of the sequences.

PREREQUISITES
  • Understanding of bounded sequences in real analysis
  • Familiarity with the concept of supremum and least upper bounds
  • Knowledge of set theory and subset relations
  • Proficiency in limits and limsup definitions
NEXT STEPS
  • Study the properties of bounded sequences in real analysis
  • Learn about the concept of limsup and its applications
  • Explore the relationship between suprema and subsets in set theory
  • Investigate convergence criteria for sequences and their implications on supremum
USEFUL FOR

Mathematicians, students of real analysis, and anyone studying properties of sequences and their limits will benefit from this discussion.

e(ho0n3
Messages
1,349
Reaction score
0
Homework Statement
Let a_1,a_2,\ldots and b_1,b_2,\ldots be bounded sequences of real numbers. Define the sets X, Y and Z as follows:

\begin{align*}<br /> X &amp;=\{x \in \mathbb{R} : a_n &gt; x \text{ for infinitely many } n \} \\<br /> Y &amp;=\{y \in \mathbb{R} : b_n &gt; y \text{ for infinitely many } n \} \\<br /> Z &amp;=\{z \in \mathbb{R} : a_n + b_n &gt; z \text{ for infinitely many } n\}<br /> \end{align*}

Show that \sup Z \le \sup X + \sup Y and that equality holds if one of the sequences converges.

The attempt at a solution
Let X+Y = {x + y : x in X and y in Y}. I know that sup (X+Y) = sup X + sup Y. If I can show that Z is a subset of X+Y, then sup Z ≤ sup (X+Y) and the inequality follows.

To this end, let z belong to Z. Then b_n &gt; z - a_n for infinitely many n. Since these a_n are bounded, they have a least upper bound x. Hence b_n &gt; z - a_n \ge z - x. Let y = z-x and notice that y belongs to Y. Unfortunately, x does not belong to X and there seems to be no fix to this problem.

What else can I do?
 
Physics news on Phys.org
By the way, sup X, sup Y, and sup Z are the definitions of \displaystyle \limsup_{n \to \infty}a_n, \displaystyle \limsup_{n \to \infty}b_n, and \displaystyle \limsup_{n \to \infty} (a_n+b_n), respectively.
 

Similar threads

Replies
8
Views
2K
Replies
2
Views
1K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
1
Views
1K
Replies
3
Views
2K
Replies
7
Views
2K
Replies
14
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K