Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 2015-07-28 03:25:07

mrpace
Member
Registered: 2012-08-16
Posts: 88

Proof to do with supremums.

For any real number c and any set S ∈ R, we define c + S to be the set {c + x : x ∈ S}.
Prove:
If a set S ⊆ R, and c is any real number, the c + S has a supremum and
sup(c + S) = c + sup S.

Any help is much appreciated, thanks.

Offline

#2 2015-08-27 19:18:57

Nehushtan
Member
Registered: 2013-03-09
Posts: 957

Re: Proof to do with supremums.

Last edited by Nehushtan (2015-08-27 19:19:35)


240 books currently added on Goodreads

Offline

Board footer

Powered by FluxBB