1.
P ROOF TECHNIQUES FOR EQUALITY
Proposition 1.1. Let A, B ∈ R, then the following are equivalent.
(1) A = B
(2) A ≤ B and B ≤ A
(3) ∀ > 0, A ≤ B + and B ≤ A +
Remark 1.2. Prove the statement ∀ ∈ E, P ().
Proof. Let ∈ E.
Then, ...by some arguments....
...
Thus, we have P ()
Remark 1.3. Prove the statement ∃ ∈ E, P ().
Proof. (Before you write down, use a scratch paper to find which might work to have P (), say = m.) Let = m.
Then, ...using the argument in the scratch paper....
...
Thus, we have P () for = m.
Some examples.
Example 1.4. How to show a ≤ b.
Proof. (Need to show that a ≤ b, which is equivalent a ≤ b + ∀ > 0.)
Let > 0. Then, by.... some arguments...
...
Thus, a ≤ b + .
Example 1.5. How to show sup E = a.
Proof. Let > 0. Then, by.... some arguments...
...
Thus, sup E < a + . Thus, sup E ≤ a.
Let > 0. Then, by.... some arguments...
...
Thus, sup E > a − . Thus, sup E ≥ a.
1
2
2. P ROOF TECHNIQUE FOR ∀, ∃ STATEMENT
Let T (a, b, c, ...) be a statement given a, b, c, ....
For an example:Let S, P (), Q(, M ), R(, M, n) be the following statements.
S= {∀ > 0, ∃M > 0 such that |xn − x| < for all(or if) n > M . },
P ()= {∃M > 0 such that |xn − x| < for all n > M . },
Q(, M )= {|xn − x| < for all n > M . },
R(, M, n)= {|xn − x| < . }.
Example 2.1. Then, we have
S ⇐⇒ ∀ > 0, P ()
⇐⇒ ∀ > 0, ∃M > 0 such that Q(, M )
⇐⇒ ∀ > 0, ∃M > 0 such that R(, M, n) ∀n > M.
Example 2.2. What is “Not S” in the above example?
NOT S
⇐⇒ NOT {∀ > 0, P ()}
⇐⇒ There exist > 0 such that NOT P ()}
⇐⇒ There exist > 0 such that NOT {∃M > 0 such that Q(, M )}
⇐⇒ There exist > 0 such that ∀M > 0 NOT {Q(, M )}
⇐⇒ There exist > 0 such that ∀M > 0, ∃n > M with(or such that) NOT {R(, M, n)}
⇐⇒ There exist > 0 such that ∀M > 0, ∃n > M with |xn − x| ≥ .
3
Example 2.3. Prove the statement S above.
Proof. Let > 0.
(Use a scratch paper to find M > 0 for which Q(, M ) holds, say M = M0 .)
Let M = M0 . (We need to show R(, M0 , n)∀n > M .)
Let n > M , then ... using argument in the scratch paper....
....
Thus, we have R(, M0 , n) : |xn − x| < if n > M0 .
√ √
Example 2.4. Show lim xn = x if lim xn = x > 0.
√ √ |xn −x|
Proof. (This is a scratch paper part: as in the book. | xn − x| < √
x
and want this to be less than if n > M where M > 0 a number
|xn −x| √
we need to choose. Thus, it is enough to find M > 0 such that √
x
< (which is equivalent to |xn − x| < x) for all n > M . We will
choose such M using the fact that xn → x.)
√
Let > 0. Since xn → x and x > 0, there is M > 0 such that
√
|xn − x| < x ∀n > M.
I.e.,
|xn − x|
√ < ∀n > M.
x
Now,
√ √ |xn − x| |x − x|
| xn − x| = √ √ ≤ n√ .
| xn + x| x
Thus, if n > M , then
√ √ |xn − x|
| xn − x| ≤ √ < .
x