06.06.2013 Views

Theory of Statistics - George Mason University

Theory of Statistics - George Mason University

Theory of Statistics - George Mason University

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

638 0 Statistical Mathematics<br />

Ordering the Reals<br />

The field <strong>of</strong> real numbers IR is complete and Archimedean ordered; in fact,<br />

the reals can be defined as a (any) complete Archimedean ordered field. The<br />

ordering properties correspond to our intuitive understanding <strong>of</strong> ordering.<br />

The more useful ordering <strong>of</strong> the reals is the linear ordering that results<br />

from the usual inequality relation. On the other hand, IR d cannot be linearly<br />

ordered in an intuitive or universally useful way. An ordering <strong>of</strong> x, y ∈ IR d<br />

based on notions <strong>of</strong> x < y or x ≤ y are rarely useful in statistical applications<br />

(see Section 0.0.1.4 on page 614). Most useful orderings are based on relations<br />

between x and y, but their usefulness depends on the application. (See<br />

Gentle (2009), pages 538 to 549, for some discussion <strong>of</strong> this.)<br />

In order to simplify the following discussion, we will focus on subsets <strong>of</strong><br />

IR. Because the reals are not a well-ordered set using the usual inequality<br />

relation, we find it convenient to define limiting maxima and minima based<br />

on that relation.<br />

For X ⊆ IR, the supremum <strong>of</strong> X or least upper bound <strong>of</strong> X, is the number<br />

defined by<br />

and<br />

x ∗ = sup(X), (0.0.36)<br />

∀x ∈ X, x ≤ x ∗<br />

∀ɛ > 0, ∃x ∈ X ∋ x > x ∗ − ɛ.<br />

The infimum <strong>of</strong> X, that is, the greatest lower bound <strong>of</strong> X, is written as<br />

and is defined similarly, with the inequalities reversed.<br />

Examples:<br />

x∗ = inf(X) (0.0.37)<br />

• Let A = {x}. Then sup(A) = inf(A) = x.<br />

• Let A = {x | x = 1/i, i ∈ ZZ+}. Then sup(A) = 1 and inf(A) = 0. Notice<br />

that inf(A) /∈ A.<br />

• Let A = {x | i, i ∈ ZZ+}. Then sup(A) = ∞ and inf(A) = 1. Alternatively,<br />

we may say that sup(A) does not exist. In any event, sup(A) /∈ A.<br />

An important fundamental property <strong>of</strong> the reals is that every bounded<br />

set <strong>of</strong> reals has a supremum that is a real number. This property is <strong>of</strong>ten<br />

called Dedekind completeness. In the usual axiomatic development <strong>of</strong> the reals,<br />

Dedekind completeness is an axiom.<br />

The maximum <strong>of</strong> a well-ordered set is the largest element <strong>of</strong> the set, if it<br />

exists; likewise, the minimum <strong>of</strong> a well-ordered set is the smallest element <strong>of</strong><br />

the set, if it exists. The maximum and/or the minimum may not exist if the<br />

set has an infinite number <strong>of</strong> elements. This can happen in two ways: one, the<br />

set may have no bound; and another, the bound may not be in the set.<br />

<strong>Theory</strong> <strong>of</strong> <strong>Statistics</strong> c○2000–2013 James E. Gentle

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!