UniMaths
Free chapterTry everything here: cards, proofs and practice. Sign up free to save your progress and unlock all 7 chapters.Sign up free
ANA1 · 1

The real numbers

7 concepts · 23 questions

ℝ as a complete ordered field: absolute value and neighbourhoods, suprema and infima with the ε-characterisation, the Archimedean property, density of ℚ, and the nested interval property.

Definition 1.1ℝ is a complete ordered field

The real numbers R\mathbb{R} satisfy three groups of axioms, and everything in analysis is deduced from them:

  • Field axioms: ++ and ×\times are associative and commutative, ×\times distributes over ++, there are 0≠10\ne1, negatives −x-x, and inverses x−1x^{-1} for x≠0x\ne0.
  • Order axioms: for any x,yx, y exactly one of x<yx < y, x=yx = y, x>yx > y holds; << is transitive; x<y⇒x+z<y+zx < y\Rightarrow x + z < y + z; and x,y>0⇒xy>0x, y > 0\Rightarrow xy > 0.
  • Completeness: every non-empty subset of R\mathbb{R} that is bounded above has a least upper bound (its supremum; see Prop. 1.3). Q\mathbb{Q} satisfies the first two groups but not completeness: {q∈Q:q2<2}\{q\in\mathbb{Q}: q^2 < 2\} has no supremum in Q\mathbb{Q}.

R\mathbb{R} = ordered field + completeness.

Completeness is the analysis axiom: it gives limits of monotone sequences, the IVT, the existence of 2\sqrt2.

Q\mathbb{Q} has "holes" where suprema should be.

Definition 1.2Absolute value and ε-neighbourhoods

The absolute value is ∣x∣=x|x| = x if x≥0x\ge0 and ∣x∣=−x|x| = -x if x<0x < 0; ∣x−a∣|x - a| is the distance from xx to aa, and ∣x−a∣<ε  ⟺  a−ε<x<a+ε|x - a| < \varepsilon\iff a - \varepsilon < x < a + \varepsilon. The interval (a−ε,a+ε)(a - \varepsilon, a + \varepsilon) is the ε\varepsilon-neighbourhood of aa. The working tools: ∣xy∣=∣x∣∣y∣|xy| = |x||y|; the triangle inequality ∣x+y∣≤∣x∣+∣y∣|x + y|\le|x| + |y| (check the cases x+y≥0x + y\ge0 and x+y<0x + y < 0); its reverse form ∣∣x∣−∣y∣∣≤∣x−y∣\big||x| - |y|\big|\le|x - y|. Key fact: if ∣x−y∣<ε|x - y| < \varepsilon for every ε>0\varepsilon > 0 then x=yx = y.

"∣x−a∣<ε|x - a| < \varepsilon" = "xx is within ε\varepsilon of aa".

To show x=yx = y: show ∣x−y∣<ε|x - y| < \varepsilon for every ε>0\varepsilon > 0.

Triangle inequality is used in nearly every proof: ∣x−z∣≤∣x−y∣+∣y−z∣|x - z|\le|x - y| + |y - z|.

Proposition 1.3Suprema and the ε-characterisation

For S≠∅S\ne\emptyset bounded above, u=sup⁡Su = \sup S iff (i) s≤us\le u for all s∈Ss\in S, and (ii) for every ε>0\varepsilon > 0 there is s∈Ss\in S with s>u−εs > u - \varepsilon. Hence there is a sequence sn∈Ss_n\in S with sn→sup⁡Ss_n\to\sup S. Similarly for inf⁡\inf, and inf⁡S=−sup⁡(−S)\inf S = -\sup(-S). Order properties: if S⊆TS\subseteq T then sup⁡S≤sup⁡T\sup S\le\sup T; if s≤ts\le t for all s∈S,t∈Ts\in S, t\in T then sup⁡S≤inf⁡T\sup S\le\inf T.

u=sup⁡Su = \sup S: upper bound, and every u−εu - \varepsilon is beaten by some element. There's always a sequence in SS converging to sup⁡S\sup S.

Comparisons: bigger set ⇒ bigger sup; "every s≤s\le every tt" ⇒ sup⁡S≤inf⁡T\sup S\le\inf T.

Proof

Theorem 1.4The Archimedean property

For every x∈Rx\in\mathbb{R} there is n∈Nn\in\mathbb{N} with n>xn > x. Equivalently, for every ε>0\varepsilon > 0 there is NN with 1N<ε\frac1N < \varepsilon, and then 1n<ε\frac1n < \varepsilon for all n≥Nn\ge N. This is the fact behind 1n→0\frac1n\to0, and behind every "choose N>1/εN > 1/\varepsilon" in an ε\varepsilon–NN proof.

There's always an integer bigger than xx. So 1n\frac1n gets below any ε>0\varepsilon > 0.

In proofs: "choose N>1/εN > 1/\varepsilon" is the Archimedean property at work.

Proof

Theorem 1.5Density of ℚ and of the irrationals

Between any two real numbers a<ba < b there is a rational and an irrational number. Consequently every real number is a limit of a sequence of rationals and of a sequence of irrationals, and every interval of positive length contains infinitely many of each.

Every interval contains rationals and irrationals.

So every real is a limit of rationals (e.g. decimal truncations) and of irrationals.

Use: functions like Dirichlet's (11 on Q\mathbb{Q}, 00 off it) are discontinuous everywhere.

Proof

Theorem 1.6The nested interval property

If In=[an,bn]I_n = [a_n, b_n] are closed bounded intervals with I1⊇I2⊇⋯I_1\supseteq I_2\supseteq\cdots, then ⋂nIn≠∅\bigcap_nI_n\ne\emptyset. If also bn−an→0b_n - a_n\to0, the intersection is a single point. Both "closed" and "bounded" matter: ⋂(0,1n)=∅\bigcap(0, \frac1n) = \emptyset and ⋂[n,∞)=∅\bigcap[n, \infty) = \emptyset.

Nested closed bounded intervals have a common point. Shrinking to length 00 ⇒ exactly one common point.

Open or unbounded intervals can fail: ⋂(0,1n)=∅\bigcap(0, \frac1n) = \emptyset.

Used for: bisection proofs (IVT, Bolzano–Weierstrass), uncountability of R\mathbb{R}.

Proof

Check 1.7Check: proving a sup or inf

To show u=sup⁡Su = \sup S: (1) prove s≤us\le u for every s∈Ss\in S; (2) given any ε>0\varepsilon > 0, produce an explicit s∈Ss\in S with s>u−εs > u - \varepsilon, usually by choosing nn large via the Archimedean property. Say whether u∈Su\in S (then it's a maximum). Common slips: proving only (1); forgetting SS might attain its sup at a small nn; using a limit you haven't justified.

Two steps: upper bound, then beat u−εu - \varepsilon with an explicit element.

Choose nn from ε\varepsilon using the Archimedean property.

Don't forget step 2. Many upper bounds aren't the least.