2.9 KiB
Chapter 2
Section 2.1 - The Algebraic and Order Properties of Real Numbers
Proposition. 2.1.1: \mathbb{R} is a field, with zero element 0 and identity 1.
Definition. The rational numbers \mathbb{Q} is the field of fractions of the natural numbers \mathbb{N}.
Theorem. 2.1.4: There does not exist a rational number r such that r^2 = 2.
Definition. An ordered field is a field F together with subset F^+ such that
F+is closed under addition and multiplication- If
a \in F, then exclusivelya \in F^+,a = 0, or-a \in F^+.
Theorem. In any ordered field F, the following hold
1 \in F^+\mathbb{N} \subset F^+- If
a \in F^+, then\frac{1}{a} \in F^+
Definition The order relation a > b and b < a is defined by a - b \in F^+.
Theorem. If a, b, c \in F, then
- One of
a > b,a = b, ora < bhold (trichotomy) - If
a > bandb > c, thena > c(transitivity) - If
a > b, then-a < -b - If
a > bandc > 0, thenac > bc - If
a > bandc < 0, thenac < bc - If
a > b > 0, then\frac{1}{b} > \frac{1}{a} > 0
Definition. Let S be a nonempty subset of ordered field F. Then, S is bounded above if there exists some u \in F such that s \leq u for all s \in S. Then, said element u is an upper bound of S.
Definition. Let S be a nonempty subset of ordered field F. Then, S is bounded below if there exists some u \in F such that s \geq u for all s \in S. Then, said element u is a lower bound of S.
Definition. Let S be a nonempty subset of ordered field F. Then, S is bounded if it is bounded both above and below.
Definition. Given field F and nonempty subset S \subset F, an element u \in F is a supremum or least upper bound of S if u is an upper bound of S, and given any other upper bound v, then u < v
Definition. Given field F and nonempty subset S \subset F, an element u \in F is an infimum or greatest lower bound of S if u is a lower bound of S, and given any other lower bound v, then u > v
Definition. Given an ordered field F, the field has the supremum/infimum property if given any nonempty subset S, if S is bounded above/below, S has a supremum/infimum.
Section 2.2 - Absolute Value and the Real Line
Definition. Absolute value is defined as normal (piecewise). Multiline function in LaTeX are hard.
Theorem. Given any a, b \in \mathbb{R}, we know that
|a| > 0fora \neq 0|ab| = |a||b||a + b| \leq |a| + |b|
Collary. Givem a, b \in \mathbb{R}, then \abs{\abs{a} - \abs{b}} \leq \abs{a - b}.
Remark. Every field has at least one absolute value function.
Theorem. In an ordered field F, for any r > 0, we know that
\abs x = rif and only ifx = rorx = -r\abs x < rif and only if-r < x < r\abs x > rif eitherx > rorx < -r