Ask a New Question

Prove: let alpha be a lower bound of a subset E of an ordered set S. If alpha exist in E, then alpha= infE(greatest lower bound of E).

PF: Already have alpha is a lower bound of E. Let lambda be a different lower bound of E. If alpha precedes lambda, the lambda will not be a lower bound because alpha exist in E. So, lambda precedes alpha. Hence alpha=infE.

Ask a New Question or answer this question.

Similar Questions

1. Prove that there is no upper bound for the set E=(2,4,6,8,....)2. Prove that there is no lower bound for the set I of
1. 1 answer
For sets A, B, C is a subset of U, prove or disprove (with a counter-example) the following: If A is a subset of B, B is not a
1. 1 answer
What is difference between taking the lower bound and lower limit from Chebyshev's Theorem?If P(|Y- mean|) <= 1 - (1/r^2) Do we
1. 0 answers
Write cos(-83degrees) as a function of a positive angleProve that tan^2(alpha)-1+cos^2(alpha)=tan^2(alpha)sin^2(alpha)
1. 1 answer

more similar questions