Prove that if A and B are two sups for set S that A = B
Prove that if A and B are two sups for set S that A = B.
There are two equivalent definitions of sup(S).
Definition 1: M = sup(S) iff
a. For all sεS, M ≥ s
b. If for all sεS, K ≥ s, then K≥M
Definition 2: M = sup(S) iff
a. For all sεS, M ≥ s
b. If K K
First let’s prove the definitions are equivalent.
Suppose N = sup(S) in the sense of definition 1 and let K B. Then there exists sεS, s > K. But this contradicts B is an upper bound for S. Similarly if B > A, we get a contradiction. Therefore A=B.
................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related download
- curriculum vitae kenyon college
- prove that if a and b are two sups for set s that a b
- chapter 5 evaluating evidence and making a decision u s
- a few proofs that any open interval x y contains
- general education
- analysis of trained neural networks
- math 325 linear algebra
- statement proof analysis paragraph format
- real analysis hanover college