Week 3 Flashcards
Supremum
When M is the least upper bound for A, we call M the supremum of A and write M=sup(A)
Infimum
When m is the greatest lower bound for A we call m the infimum of A and write m=inf(A)
Let A ⊆ R and M ∈ R. Define M to be a least upper bound for A if and only if the following two conditions are satisfied:
a) M is an upper bound for A; and
b) for all upper bounds M’ for A, we have M ≤ M’
Let A ⊆ R and let M ∈ R be an upper bound for A. Then M
is a least upper bound for A if and only if
∀ε > 0, ∃a ∈ A s.t. a > M − ε
Let A ⊆ R and m ∈ R. Define m to be a greatest lower
bound for A if and only if:
a) m is an lower bound for A; and
b) for all lower bounds m′
for A, we have m′ ≤ m
Theorem of uniqeness of least upper bounds and greatest lower bounds
Let A ⊆ R. Then A has at most one least upper bound and
at most one greatest lower bound
Given a lower bound m for A, m is
a greatest lower bound for A if and only if
∀ε > 0, ∃a ∈ A s.t. a < m + ε
The completeness axiom
Every non-empty subset of R
which is bounded above has a supremum.
Theorem for necessary existence of infimum
Every non-empty subset of R which is bounded below has
an infimum.
Theorem of ordered field and completeness axiom
There exists an ordered field R satisfying the completeness
axiom, which contains Q as a subfield. Any two such ordered fields are
isomorphic.
Archimedes axiom
The natural numbers N ⊆ R are not bounded above. In particular, given any x ∈ R, there exists n ∈ N such that n > x.