Proof that given the info below, sup S <= inf T

  • Thread starter thedoctor818
  • Start date
  • Tags
    Proof
In summary: But that contradicts sup S being the least upper bound of S.In summary, the problem asks to prove that the supremum of a nonempty subset S is less than or equal to the infimum of another nonempty subset T, given the conditions that all elements in S are less than or equal to all elements in T. A proof by contradiction can be used to show this statement.
  • #1
thedoctor818
1
0

Homework Statement


Let S and T be nonempty subsets of [tex]\mathbb{R} \backepsilon s \leq t \forall s \in S \wedge t \in T.[/tex] A) Observe that S is bounded above and that T is bounded below. B) Prove that [tex]sup S = inf T.[/tex]


Homework Equations





The Attempt at a Solution


Let [tex] s_0 = sup S. \text{ Then } s \leq s_o \forall s \in S \wedge s \leq t \forall s \in S \Rightarrow s_0 \leq t. [/tex]
Let [tex] t_0 = inf S. \text{ Then } t_0 \leq t \forall t \in T \wedge s \leq t \forall t \in T \Rightarrow s \leq t_0. [/tex]
 
Physics news on Phys.org
  • #2
I am probbably missing something, but it doesn't seem that it is even true. COnsider
S=(0,1) and T=(2,3). Then for all s in S s=<t for all t in T, but clearly supS=/=infT. Are you sure the problem is not asking you to show : supS=<infT? If this is what the problem is asking, then try a proof by contradiction. Namely, assume that infT<supS, and derive a contradiction.
 
Last edited:
  • #3
Yes. The title says "sup S[itex]\le[/itex] inf T" but in your post you say "sup S< sup T" which does not follow from your hypotheses. They might be equal. If sup S> sup T, then let [itex]\delta[/itex]= Sup S- sup T. There must be some member of S closer to S than that and so must be some member of S larger than sup T.
 

FAQ: Proof that given the info below, sup S <= inf T

What is the meaning of "sup" and "inf" in this context?

In this context, "sup" refers to the supremum or the least upper bound of a set, while "inf" refers to the infimum or the greatest lower bound of a set.

How do you prove that sup S is less than or equal to inf T?

This can be proven by showing that any element in the set T is greater than or equal to any element in the set S. This can be done by using the definitions of supremum and infimum, and properties of sets and real numbers.

Can you provide an example to illustrate this proof?

Sure, for example, let S be the set {1, 2, 3} and T be the set {2, 4, 6}. In this case, the supremum of S is 3 and the infimum of T is 2. We can see that 3 is less than or equal to 2, satisfying the given statement.

Is this statement always true for any sets S and T?

No, this statement is not always true. It depends on the specific sets S and T and their elements. It is possible for sup S to be greater than inf T in some cases.

How is this proof applicable in real-world scenarios?

This proof is applicable in various fields such as mathematics, physics, and economics, where the concepts of supremum and infimum are used to analyze and compare sets of data or values. For example, in economics, this proof can be used to show the relationship between demand and supply in a market.

Back
Top