Supremum, Infimum (Is my proof correct?)

  • Thread starter Thread starter Incand
  • Start date Start date
  • Tags Tags
    Proof Supremum
Click For Summary
SUMMARY

The proof demonstrates that for a nonempty set of real numbers ##A## bounded below, the relationship between the infimum of ##A## and the supremum of its negation ##-A## is established as ##\inf A = -\sup(-A)##. The proof begins by defining the supremum and infimum, then shows that if ##\gamma > -\alpha##, where ##\alpha = \sup(-A)##, it leads to a contradiction, confirming the equality. Additionally, the discussion highlights the necessity of proving that ##-A## is bounded above, which is essential for establishing the supremum.

PREREQUISITES
  • Understanding of supremum and infimum definitions in ordered sets.
  • Familiarity with the properties of bounded sets in real analysis.
  • Knowledge of proof techniques, particularly proof by contradiction.
  • Basic algebraic manipulation involving inequalities.
NEXT STEPS
  • Study the properties of ordered sets and their bounds in real analysis.
  • Learn about proof techniques, especially proof by contradiction and direct proof methods.
  • Explore examples of supremum and infimum in various contexts, such as sequences and functions.
  • Investigate the implications of boundedness in real analysis, particularly in relation to completeness.
USEFUL FOR

Students of real analysis, mathematicians focusing on set theory, and anyone interested in understanding the foundational concepts of limits and bounds in mathematical proofs.

Incand
Messages
334
Reaction score
47

Homework Statement


Let ##A## be a nonempty set of real numbers which is bounded below. Let ##-A## be the set of all numbers ##-x##, where ##x \in A##. Prove that
##\inf A = -\sup(-A)##.

Homework Equations


Definition:
Suppose ##S## is an ordered set, ##E\subset S##, and ##E## is bounded above. Suppose there exists an ##\alpha \in S## with the following properties:
(i) ##\alpha## is an upper bound of ##E##.
(ii) If ##\gamma < \alpha## then ##\gamma## is not an upper bound of ##E##.
Then ##\alpha## is called the supremum of ##E## and we write ##\alpha = \sup E##.
(Equivalently for infimum)

The Attempt at a Solution


From the definition of supremum ##\exists \alpha > y, \forall y \in -A## or equivalently ##\exists \alpha > -x, \forall x \in A##.
Then ##-\alpha < x, \forall x \in A##, hence ##-\alpha = -\sup(-A)## is a lower bound of ##A##.

It's left to show that if ##\gamma > -\alpha## then ##\gamma## is not an lower bound of ##A##.
Suppose ##\gamma## is a lower bound of ##A## with ##\gamma > -\alpha##. Then ##\gamma < x \forall x\in A## or equivalently ##-\gamma > -x \forall x \in A##. But this means that ##\gamma## is an upper bound of ##-A## and since ##\sup(-A) = \alpha## we have that ##-\gamma \ge \alpha## or equivalently ##\gamma \le -\alpha## a contradiction! Hence ##\inf A = -\sup(-A)##.

Is the above correct? Anything I could do to improve it? I'm quite new to proofs so I'm not sure if I'm doing this right.
 
Physics news on Phys.org
Incand said:

Homework Statement


Let ##A## be a nonempty set of real numbers which is bounded below. Let ##-A## be the set of all numbers ##-x##, where ##x \in A##. Prove that
##\inf A = -\sup(-A)##.

Homework Equations


Definition:
Suppose ##S## is an ordered set, ##E\subset S##, and ##E## is bounded above. Suppose there exists an ##\alpha \in S## with the following properties:
(i) ##\alpha## is an upper bound of ##E##.
(ii) If ##\gamma < \alpha## then ##\gamma## is not an upper bound of ##E##.
Then ##\alpha## is called the supremum of ##E## and we write ##\alpha = \sup E##.
(Equivalently for infimum)

The Attempt at a Solution


From the definition of supremum ##\exists \alpha > y, \forall y \in -A## or equivalently ##\exists \alpha > -x, \forall x \in A##.
Then ##-\alpha < x, \forall x \in A##, hence ##-\alpha = -\sup(-A)## is a lower bound of ##A##.

It's left to show that if ##\gamma > -\alpha## then ##\gamma## is not an lower bound of ##A##.
Suppose ##\gamma## is a lower bound of ##A## with ##\gamma > -\alpha##. Then ##\gamma < x \forall x\in A## or equivalently ##-\gamma > -x \forall x \in A##. But this means that ##\gamma## is an upper bound of ##-A## and since ##\sup(-A) = \alpha## we have that ##-\gamma \ge \alpha## or equivalently ##\gamma \le -\alpha## a contradiction! Hence ##\inf A = -\sup(-A)##.

Is the above correct? Anything I could do to improve it? I'm quite new to proofs so I'm not sure if I'm doing this right.
Maybe I'm nitpicking, but it seems that you set ##\alpha=-\sup(-A)##, and then prove that ##-\alpha=\inf A##.
Shouldn't it be the other way around? You are given that ##A## is bounded below, meaning ##\inf A## exists. Set ##\alpha=\inf A## and prove that ##\alpha = -\sup(-A)##.
Or, you could do it as you did, but then first prove that if ##A## has a lower bound, ##-A## has an upper bound.
 
  • Like
Likes   Reactions: Incand
Good point! I'm going to go with trying to prove that ##-A## have an upper bound. It seemed easier to start on the more complicated side.
##A## is bounded below, that is ##\exists \xi \in \mathbf R## such that ##\xi < x, \forall x\in A##. But this means that ##-\xi > -x, \forall x\in A## that is ##-\xi > y, \forall y \in -A##, hence ##-A## is bounded above since ##-\xi \in \mathbf R##.

If I put that in before the start of my earlier proof, would that do it?

Edit: I'm also using the proposition that
If ##x<0## and ##y<z## then ##xy>xz##
And others, but I guess I don't have to write thing like this out for every step.
 
  • Like
Likes   Reactions: Samy_A
Looks fine.
 
  • Like
Likes   Reactions: Incand

Similar threads

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