lacunary - Mathnotes

Real Numbers

Definition: Real Numbers (also: reals) Notation: R \@{real-numbers}

The real numbers R are a set of objects along with two binary operations +:R×RR and :R×RR that satisfy the 9 field axioms along with the Order axiom and the Completeness axiom. That is, the reals are an ordered, complete field.

Referenced by (64 direct, 301 transitive)

Transitive (depth 1):

Transitive (depth 2):

Transitive (depth 3):

Transitive (depth 4):

Transitive (depth 5):

Transitive (depth 6):

Transitive (depth 7):

We know that a field is a commutative division ring.

Definition: Natural Numbers (also: naturals) Notation: N \@{natural-numbers}

The natural numbers N={1,2,3,} are the counting numbers.

Referenced by (16 direct, 144 transitive)

Transitive (depth 1):

Transitive (depth 2):

Transitive (depth 3):

Transitive (depth 4):

Definition: Integers Notation: Z \@{integers}

The integers Z={,2,1,0,1,2,} are the natural numbers together with their negatives and zero.

Referenced by (24 direct, 112 transitive)

Transitive (depth 1):

Transitive (depth 2):

Transitive (depth 3):

The Order axiom states that there exists a subset of R+ of R such that for all a,bR+,a+bR+,abR+. and for all aR exactly one of the following is true: (i) aR+, (ii) aR+, or (iii) a=0.

A more familiar and equivalent way of stating this can be achieved by defining a<b to mean b+(a)R+, and a>b to mean a+(b)R+, for a,b,cR,

  • Exactly one of the following is true: a<b, a>b, or a=b.
  • If a<b and c>0, we have ac<bc.
  • If a<b and b<c then a<c (transitivity).

Note that rational numbers also satisfy the field axioms and the Order axiom. Complex numbers satisfy the field axioms but not the Order axiom because there is no total ordering that can be defined on complex numbers.

To give the Completeness axiom, we must first define what a least upper bound is.

Definition: Upper bound \@{upper-bound}

The number m is said to be an upper bound of a nonempty set A if xm for all xA.

Definition: Least upper bound (also: supremum) \@{least-upper-bound}

The number L is said to be the least upper bound of the set A if it's an upper bound of A and if Lm for all upper bounds m of A.

The least upper bound is also known as the supremum.

Referenced by (3 direct)
Note \@{note-7}

Neither an upper bound nor a least upper bound need to be in A.

Definition: Lower bound \@{lower-bound}

The number m is said to be a lower bound of a nonempty set A if xm for all xA.

Referenced by (1 direct)

Direct references:

Definition: Greatest lower bound (also: infimum) \@{greatest-lower-bound}

There is also a concept of a greatest lower bound, which is a lower bound that is greater than or equal to every other lower bound. The greatest lower bound is also known as the infimum.

Referenced by (1 direct)

Direct references:

The Completeness axiom states that every nonempty subset A of R that's bounded above has a least upper bound.

One consequence of the Completeness axiom is that the real numbers contain numbers that are not rational. For example, the subset of R that is the finite decimal approximations of 5 is,

{2,2.2,2.23,2.236,},

must have a supremum due to the Completeness axiom. That supremum is 5, but 5 is not rational, therefore, the reals contain non-rational numbers.

The absolute value of a real number is defined as follows:

|x|={xif x0xif x<0.

One fact that follow from this definition is that for a,bR, if a<b, then b<a<b. Proof: We have two cases to consider:

  • If a>=0, then a=a, so a<b. Since a is positive, b must also be positive, and therefore b must be negative, and so b<a<b.
  • If a<0, then a=a, so a<b. Since a is negative, a must be positive, so b must also be positive, and therefore a<b. Now, a<ba>bb<a, and therefore b<a<b.

Another fact is that the absolute value function is a norm, and thus satisfies the triangle inequality. For real a,b:

|a+b||a|+|b|

Definition: Archimedean \@{archimedean}

The Archimedean property is that given two positive numbers x and y, there is an integer n such that nx>y.

Referenced by (1 direct, 2 transitive)

Direct references:

Theorem \@{reals-are-archimedean}
Theorem \@{rationals-are-dense-in-reals}

The rationals are dense in the reals.

Proof \@{proof-of-rationals-are-dense-in-reals}

Let xR and ϵ>0. Pick nN such that 1/n<ϵ. Now, because the reals are Archimedean, for some mZ we have that m=nx. Then,

mnxm+1,mnxm+1n.

Now, if we let q=mn, we have

0xq<1n<ϵ,

so |xq|<ϵ. Therefore, every neighborhood of x contains some qQ, and so x is either a limit point of Q or else xQ, and so the rationals are therefore dense in the reals.

Corollary \@{rational-between-any-two-reals}

If x,yR, and x<y, then there exists a pQ such that x<p<y. That is, there is always a rational number between any two distinct real numbers.

Proof \@{proof-of-rational-between-any-two-reals}

Pick nN such that n(ya)>1. Because because the reals are Archimedean, there is some kZ such that nx<k<ny and x<n/k<y. Thus, q=n/kQ and r(x,y).