Solve Supremum Problem: X, Y and Z Sets

  • Thread starter e(ho0n3
  • Start date
  • Tags
    Supremum
In summary, the problem involves showing that the supremum of the set Z is less than or equal to the sum of the supremums of the sets X and Y, and that equality holds when one of the sequences converges. The solution involves considering the set X+Y and showing that Z is a subset of it, but this approach encounters a problem with the element x not belonging to X. The definitions of sup X, sup Y, and sup Z are equivalent to the limits superior of the sequences a_n, b_n, and a_n+b_n respectively.
  • #1
e(ho0n3
1,357
0
Homework Statement
Let [itex]a_1,a_2,\ldots[/itex] and [itex]b_1,b_2,\ldots[/itex] be bounded sequences of real numbers. Define the sets X, Y and Z as follows:

[tex]\begin{align*}
X &=\{x \in \mathbb{R} : a_n > x \text{ for infinitely many } n \} \\
Y &=\{y \in \mathbb{R} : b_n > y \text{ for infinitely many } n \} \\
Z &=\{z \in \mathbb{R} : a_n + b_n > z \text{ for infinitely many } n\}
\end{align*}[/tex]

Show that [itex]\sup Z \le \sup X + \sup Y[/itex] 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 [itex]b_n > z - a_n[/itex] for infinitely many n. Since these [itex]a_n[/itex] are bounded, they have a least upper bound x. Hence [itex]b_n > z - a_n \ge z - x[/itex]. 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
  • #2
By the way, sup X, sup Y, and sup Z are the definitions of [itex]\displaystyle \limsup_{n \to \infty}a_n[/itex], [itex]\displaystyle \limsup_{n \to \infty}b_n[/itex], and [itex]\displaystyle \limsup_{n \to \infty} (a_n+b_n)[/itex], respectively.
 

What is a supremum?

A supremum, also known as a least upper bound, is the smallest number that is greater than or equal to all the numbers in a set. In other words, it is the smallest upper limit of a set.

What is the supremum problem?

The supremum problem is a mathematical problem that involves finding the supremum of a set. It is often used in optimization or calculus to find the maximum or minimum value of a function or set.

What are X, Y, and Z sets in the supremum problem?

X, Y, and Z sets are simply different sets of numbers that are being analyzed in the supremum problem. These sets can be any type of set, such as real numbers, integers, or complex numbers. The goal is to find the supremum of each set.

How is the supremum calculated?

The supremum of a set is calculated by first finding the upper bound of the set, which is the smallest number that is greater than or equal to all the numbers in the set. Then, the supremum is found by taking the least upper bound and subtracting a small amount from it until it is no longer an upper bound. The result is the supremum.

Why is the supremum problem important?

The supremum problem is important because it is used in many areas of mathematics and science. It is also a fundamental concept in calculus and optimization. Additionally, the supremum can provide valuable information about a set, such as its maximum value or its convergence properties.

Similar threads

  • Calculus and Beyond Homework Help
Replies
2
Views
274
  • Calculus and Beyond Homework Help
Replies
1
Views
460
  • Calculus and Beyond Homework Help
Replies
9
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
521
  • Calculus and Beyond Homework Help
Replies
1
Views
259
  • Calculus and Beyond Homework Help
Replies
13
Views
1K
  • Calculus and Beyond Homework Help
Replies
7
Views
709
  • Calculus and Beyond Homework Help
Replies
3
Views
693
  • Calculus and Beyond Homework Help
Replies
5
Views
1K
  • Calculus and Beyond Homework Help
Replies
4
Views
884
Back
Top