swissgirl
  • swissgirl
Show that any non-empty finite set S ⊂ ℝ contains both its supremum and infimum. (Hint: use induction)
HippoCampus Calculus & Advanced Math
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
swissgirl
  • swissgirl
@abb0t
swissgirl
  • swissgirl
To be honest I really didnt study the chapter fully yet I was just looking for a tutor so hopefully I wont be lost lol
abb0t
  • abb0t
\[S \subseteq R\] such that |S| = n Proceed by induction on n. If n = 1, then S = {a} for some \[a \in R\]. Then, sup S = a. Assume that all subsets of R of order k contain their respective suprema. Let S be a subset of R in order of k+1. Label the elements of S as: \[\left\{ a_1, a_2...a_{k+1} \right\}\] Let \[T = \left\{ a_1, a_2...a_k \right\} \] By the inductive assumption: \[\sup T= a_{i_o}\] for some \[1 \le i_o \le k\] and \[\sup(S-T) = a_{k+1}\] Thus clamining case 1: \[a_{i_o} \le a_{k+1}\] since \[a_{i_o} = \sup T\] and \[a_{i_o} \le a_{k+1}\], you know that for all \[1 \le i_o \le k, a_i \le a_{i_o} \le a_{k+1}\] thus \[\sup S = a_{k+1}\] Case 2: \[a_{i_o} \ge a_{k+1}\] since \[a_{i_o} = \sup T\] and \[a_{i_o} \ge a_{k+1} \] you know that for all \[1 \le i \le k+1, a_i \le a_{i_o}\] thus \[\sup S = a_{i_o}\] Thus, S contains its supremum

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

swissgirl
  • swissgirl
Give me time to read it. Thanks :)
swissgirl
  • swissgirl
Wow this is great :)
swissgirl
  • swissgirl
I didnt follow case 2 though
swissgirl
  • swissgirl
Ummm Also werent we supposed to prove that it contains its supremum and infimum
swissgirl
  • swissgirl
Like I followed what u did but i am just confused why we needed to show case 2
abb0t
  • abb0t
Well supremem is the upper bound, and infimum is the lower bound. I just used the definitions.
swissgirl
  • swissgirl
No like how did u show S contains the infimum
abb0t
  • abb0t
Case 2.
abb0t
  • abb0t
I showed4 supremum.
swissgirl
  • swissgirl
Ohhhhhh ok I thought i was going senile
abb0t
  • abb0t
:) nah don't say that.
swissgirl
  • swissgirl
lol Thankssssssss. THIS WAS AWESOME. U R REALLY CLEARRRRRRRR

Looking for something else?

Not the answer you are looking for? Search for more explanations.