Suppose A and B are each bounded above. Define the set A+Bas follows A+B = {a +b: a E A, bE B} We claim that sup(A + B) < sup A+ sup B To prove this, we first let m = supA and n = supB. The existence of the supremums is guaranteed by axiom 5.2.4. We need to show that m + nis an upper bound for the set A + B. If this is true, then the least upper bound of A + B (which we know is sup(A+ B)) must be no larger than m + n. Now for any a E A, we know a < m, and for any b e B, we know b < n,hence a + b

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Topic Video
Question
**Suppose A and B are each bounded above. Define the set A + B as follows:**

\[ A + B = \{a + b: a \in A, \, b \in B\} \]

We claim that
\[ \sup(A + B) \leq \sup A + \sup B \]

To prove this, we first let \( m = \sup A \) and \( n = \sup B \). The existence of the supremums is guaranteed by axiom 5.2.4. We need to show that \( m + n \) is an upper bound for the set \( A + B \). If this is true, then the least upper bound of \( A + B \) (which we know is \( \sup(A + B) \)) must be no larger than \( m + n \). Now for any \( a \in A \), we know \( a \leq m \), and for any \( b \in B \), we know \( b \leq n \), hence \( a + b \leq m + n \) for any \( a + b \in A + B \). This shows that \( m + n \) is an upper bound for \( A + B \) and hence \( \sup(A + B) \leq m + n = \sup A + \sup B \).

*Using the notation above, show \(\inf(A + B) \geq \inf A + \inf B\).*

*Provide examples of sets A and B where strict inequality \(\sup(A + B) < \sup A + \sup B\) holds.*
Transcribed Image Text:**Suppose A and B are each bounded above. Define the set A + B as follows:** \[ A + B = \{a + b: a \in A, \, b \in B\} \] We claim that \[ \sup(A + B) \leq \sup A + \sup B \] To prove this, we first let \( m = \sup A \) and \( n = \sup B \). The existence of the supremums is guaranteed by axiom 5.2.4. We need to show that \( m + n \) is an upper bound for the set \( A + B \). If this is true, then the least upper bound of \( A + B \) (which we know is \( \sup(A + B) \)) must be no larger than \( m + n \). Now for any \( a \in A \), we know \( a \leq m \), and for any \( b \in B \), we know \( b \leq n \), hence \( a + b \leq m + n \) for any \( a + b \in A + B \). This shows that \( m + n \) is an upper bound for \( A + B \) and hence \( \sup(A + B) \leq m + n = \sup A + \sup B \). *Using the notation above, show \(\inf(A + B) \geq \inf A + \inf B\).* *Provide examples of sets A and B where strict inequality \(\sup(A + B) < \sup A + \sup B\) holds.*
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Sequence
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,