Proof that T is bounded below with ##inf T = 2M##

  • Thread starter Thread starter member 731016
  • Start date Start date
  • Tags Tags
    Bounded Proof
Click For Summary
SUMMARY

The discussion centers on proving that the infimum of the set T, defined as T = {2x: x ∈ S}, is equal to 2M, where M is a lower bound for the set S. The first proposed proof incorrectly assumes S is finite, which invalidates the argument. The second proof attempts to establish that 2M is a lower bound for T but lacks clarity in its progression. The consensus is that 2M is indeed a lower bound for T, and further exploration is needed to solidify the proof.

PREREQUISITES
  • Understanding of infimum and supremum in real analysis
  • Familiarity with set notation and operations
  • Knowledge of bounds and their properties
  • Basic principles of mathematical proofs
NEXT STEPS
  • Study the properties of infimum and supremum in real analysis
  • Learn about the implications of finite vs. infinite sets on bounds
  • Explore examples of proving lower bounds for transformed sets
  • Investigate the role of ε-δ definitions in establishing limits and bounds
USEFUL FOR

Mathematics students, particularly those studying real analysis, educators teaching proof techniques, and anyone interested in understanding the properties of infimum and set transformations.

member 731016
Homework Statement
I have found two alternative proofs to the solutions of the problem below so I am wondering whether my proofs are valid.
Relevant Equations
##inf T = 2M##
1710206094952.png

1710206112678.png

My first solution is

Let
##S = \{x_1, x_2, x_3, ..., x_n\}##
##T = \{2x_1, 2x_2, 2x_3, ... 2x_n\}##
##T = 2S##

Therefore, ##inf T = inf 2S = 2inf S = 2M##

May someone please know whether this counts as a proof?

My second solution is,

##x ≥ M##
##2x ≥ 2M##
##y ≥ 2M## (Letting y = 2M)

Let ##inf T = N##
Therefore by using definition of infimum,
##N ≥ K## where ##K## is a lower bound
Let ##K = \frac{x}{n}## where ##n > 1##
Suppose ##N = 2M##
##N ≥ K##
##N ≥ \frac{x}{n}##
##2M ≥ \frac{x}{n}##

However, I am unsure where to go from here.

Any help greatly appreciated - Chiral.
 
Physics news on Phys.org
The first proof is invalid, because it is not given that S is finite (or countable).

Your aim is to show that 2M = 2\inf S is the infimum of T = \{ 2x: x \in S\}. Do it directly: is 2M a lower bound for T? If b > 2M, is b a lower bound for T?
 
  • Love
Likes   Reactions: member 731016
Your goal is to show that for all ##t\in T##, ##2M\leq t##.
 
  • Love
Likes   Reactions: member 731016
ChiralSuperfields said:
Homework Statement: I have found two alternative proofs to the solutions of the problem below so I am wondering whether my proofs are valid.
Relevant Equations: ##inf T = 2M##

View attachment 341650
View attachment 341651
My first solution is

Let
##S = \{x_1, x_2, x_3, ..., x_n\}##
##T = \{2x_1, 2x_2, 2x_3, ... 2x_n\}##
##T = 2S##

Therefore, ##inf T = inf 2S = 2inf S = 2M##

May someone please know whether this counts as a proof?

My second solution is,

##x ≥ M##
##2x ≥ 2M##
##y ≥ 2M## (Letting y = 2M)

Let ##inf T = N##
Therefore by using definition of infimum,
##N ≥ K## where ##K## is a lower bound
Let ##K = \frac{x}{n}## where ##n > 1##
Suppose ##N = 2M##
##N ≥ K##
##N ≥ \frac{x}{n}##
##2M ≥ \frac{x}{n}##

However, I am unsure where to go from here.

Any help greatly appreciated - Chiral.
For one, whether ##2x >x## will depend on the sign of ##x##. ##8>4##, but not so for ##-2, -1##.
 
  • Love
Likes   Reactions: member 731016
The first argument does not count since that's what you have to prove in the first place. Why can you pull the ##2## in front of the infimum?

Either way ##2M## is clearly a lower bound for ##T## and by assumption we can find ## x\in S ## satisfying ##x<M+\frac{\varepsilon}{2}##, hence ##T\ni 2x < 2M+\varepsilon ##.
 
  • Love
Likes   Reactions: member 731016

Similar threads

  • · Replies 24 ·
Replies
24
Views
4K
Replies
8
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
8
Views
2K
Replies
2
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 43 ·
2
Replies
43
Views
4K
Replies
4
Views
2K
Replies
3
Views
2K
Replies
3
Views
2K