logo

Three Axioms of Analysis: The Axiom of Completeness 📂Analysis

Three Axioms of Analysis: The Axiom of Completeness

Axioms1

A set ERE \subset \mathbb{R} is not empty and if EE is bounded above, then a supremum sup(E)<\sup(E) < \infty exists.

Explanation

The axioms of fields and orders might seem like complicating the known, but the completeness axiom does not seem so at a glance. Definitions for the terminology used here appear to be necessary first.

Definitions

For every element aa of EE if aMa \le M is satisfied, then EE is called bounded above. All such MM satisfying these conditions are called the upper bounds of EE. sup(E)\sup(E) is the smallest upper bound of EE, for all upper bounds MM of EE, satisfying sup(E)M\sup (E) \le M. This is called the supremum or least upper bound of EE.

Conversely, for the case with the opposite inequality,

For every element aa of EE if ama \ge m is satisfied, then EE is called bounded below. All such mm satisfying these conditions are called the lower bounds of EE. inf(E)\inf(E) is the largest lower bound of EE, for all lower bounds mm of EE, satisfying inf(E)m\inf (E) \ge m. This is called the infimum or greatest lower bound of EE.


Definitions might suddenly overflow and confuse, but essentially, it doesn’t challenge our concept. It merely defines when a set has limits and what those limits are called.

Switching back to the completeness axiom, it feels like repeating the introduced definitions. The difference is simple. Definitions only talk about when to call something if it exists, not whether it really exists. The completeness axiom discusses this ’existence'.

However, it might prompt the question: should this really be an axiom? Is it such a fundamental fact that it needs to be axiomatized, cannot it be proven? At first glance, it seems these upper bounds definitely exist by definition, but that’s not the case.

Counterexample

If EE is bounded above, then there would be upper bounds MM satisfying the condition, and among these upper bounds MM, there exists the smallest value as the supremum sup(E)\sup(E). But, think reversely, sup(E)\sup(E) is the largest value among M-M, i.e., the supremum. The claim that the smallest value exists itself bases on the existence of a supremum. Thus, inevitably leading to a circular argument.


Whether it’s an upper or lower bound, magnitude large or small, the direction of the argument roundabouts. Ultimately, we cannot ascertain the existence of these bounds. Hence, there was no choice but to introduce a new axiom, the completeness axiom.

Theorem

If a subset EE of the set of integers Z\mathbb{Z} has a supremum, then sup(E)E\sup(E) \in E


Without the completeness axiom, we wouldn’t even trust such an obvious fact because its assumption is doubtful.

Complete?

The term complete, a mild version of completeness完備, when generalized in a metric space beyond the real number space R\mathbb{R} includes spaces that contain converging points of Cauchy sequences as complete spaces. However, in everyday context, the English word Complete is not typically used in the sense of being fully equipped (完備), instead, it is often used with ‘completion’ or ‘conclusion,’ denoting the end of something ongoing. This, as mentioned, since it guarantees the existence of a convergence point (within that space), the term complete is suitable.

Of course, capturing a Cauchy sequence is different from capturing ERE \subset \mathbb{R}, though explanations such as R\mathbb{R} having separability are too early right now. It’s okay to think you’ll learn about such later and move on.


  1. William R. Wade, An Introduction to Analysis (4th Edition, 2010), p16-18 ↩︎