Analysis

From Privateer

Contents

Analysis

Logical Foundation

p q means "p implies q"

p q means "p implies q, and q implies p"

Quantifiers

: Universal quantifier; "for all". : Existence quantifier; "there exists".

The negation of is ; " ¬ = ". Similarly the negation of is ; " ¬ = ".

Negation Example:
x , p ( x ) means "for all x , the condition p ( x ) is true."
¬ ( x , p ( x ) ) = x , ¬ p ( x ) , which means "there exists an x such that p ( x ) is false."

Proof Types

Direct Proof: a series of logical statements that directly transform p into q.

Indirect Proof (proof by contradiction): Assume that the conclusion of a logical statement is false, then proceed with logical statements until a contradiction is found.

Example direct proof

Statement to prove: ε > 0 , δ > 0 such that 1 - δ < x < 1 + δ 5 - ε < 2 x + 3 < 5 + ε

In plain english, this means "for all epsilon greater than zero, there exists a delta that is greater than zero, such that the inequality x is less than 1 + delta and greater than 1 - delta, implies that 2 x + 3 less than 5 + epsilon and greater than 5 - epsilon."

Algebraic Sketch

Isolate the x , and find δ
5 - ε < 2 x + 3 < 5 + ε
2 - ε < 2 x < 2 + ε
2 - ε 2 < x < 2 + ε 2
1 - ε 2 < x < 1 + ε 2
δ = ε 2

Proof

let ε > 0

consider δ = ε 2 > 0

Since ε > 0

Assume 1 - δ < x < 1 + δ

1 - ε 2 < x < 1 + ε 2 , since δ = ε 2

and 2 - ε 2 < x < 1 + 2 + ε 2

and 2 - ε < 2 x < 2 + ε

So 5 - ε < 2 x + 3 < 5 + ε


Example indirect proof

Theorem to prove: let x be a real number.
if x > 0 , then 1 x > 0 .

In this statement, p is " x > 0 ," and q is " 1 x > 0 ."

By way of contradiction, assume p and ¬ q , that is: if x > 0 , then 1 x 0 .

Field Axioms

Additive

if a < b , then a + α < b + α

Multiplicative

if a < b , and c > 0 , then a c < b c ; if a < b , and c < 0 , then b c < a c .

Ordering

Trichotomy

Transitive