Hello(adsbygoogle = window.adsbygoogle || []).push({});

I have two non-empty sets A and B wich is bounded above by R.

Then I'm tasked with proving that

[tex]sup(A \cup B) = max(sup A, sup B) [/tex]

which supposedly means that [tex]sup(A \cup B) [/tex] is the largest of the two numbers sup A and sup B.

Can this then be written as [tex]sup(A) < sup(A \cup B) [/tex] and [tex]sup(B) < sup(A \cup B)[/tex] ???

Can this then be proven by showing that [tex]sup(A) < sup(A \cup B) [/tex] is true?

Or am I totally on the wrong path here??

/Bob

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Suprenum Question

Loading...

Similar Threads for Suprenum Question | Date |
---|---|

B What question should you ask? | Monday at 10:14 PM |

I Question about simplifying Sigma notation | Feb 11, 2018 |

I Shopping List Game: Probability Question | Dec 10, 2017 |

I A simple question about probability theory | Aug 2, 2017 |

**Physics Forums - The Fusion of Science and Community**