Problem Set - Orders on Z, Q, R and C

Problem Set - Orders on ℤ, ℚ, ℝ, and ℂ

Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au

and

Department of Mathematics
University of Wisconsin, Madison
Madison, WI 53706 USA
ram@math.wisc.edu

Last updates: 7 December 2009

Orders on ℤ, ℚ, ℝ, and ℂ

Define the order ≥ on ℤ>0 .

Define the order ≥ on ℤ≥0 .

Define the order ≥ on ℤ .

Define the order ≥ on ℚ .

Show that ab ≤ cd if and only if abd2 ≤ cdb2 .

Define the order ≥ on ℝ .

Show that there is no order ≥ on ℂ such that ℂ is a totally ordered field.

Show that if x,y,z∈ ℝ and x≤y and y≤z then x≤z.

Show that if x,y∈ ℝ and x≤y and y≤x then x=y.

Show that if x,y,z∈ ℝ and x≤y then x+z≤ y+z.

Show that if x,y∈ ℝ and x≥0 and y≥0 then xy≥0.

Show that if x∈ ℝ-{0} then x2>0 .

Show that if x,y∈ ℝ and 0<x<y then y-1< x-1 .

(The Archimedean property of ℝ ) Show that if x,y∈ ℝ and x∈ ℝ>0 then there exists n∈ ℤ≥0 such that nx>y.

Show that the Archimedean property is equivalent to ℤ>0 is an unbounded subset of ℝ .

( ℚ is dense ℝ ) Show that if x,y∈ ℝ and x<y then there exists p∈ ℚ such that x<p<y.

( ℝ-ℚ is dense ℝ ) Show that if x,y∈ ℝ and x<y then there exists p∈ ℝ-ℚ such that x<p<y.

If x,y∈ ℝ and x<y show that there exist infinitely many rational numbers between x and y as well as infinitely many irrational numbers.

Let x∈ ℝ>0 and n∈ ℤ>0 . Then there exists a unique y∈ ℝ>0 such that yn=x .

Find the minimal N∈ ℤ>0 such that n< 2n for all n≥N .

Find the minimal N∈ ℤ>0 such that n!> 2n for all n≥N .

Find the minimal N∈ ℤ>0 such that 2n > 2n3 for all n≥N .

For each of the following subsets of ℝ find the maximum, the minimum, an upper bound, a lower bound, the supremum, and the infimum:
(a)   A={ p∈ℚ | p2 <2 } ,
(b)   B={ p∈ℚ | p2 >2 } ,
(c)   E1={ r∈ℚ | r <0 } ,
(d)   E2={ r∈ℚ | r ≤0 } ,
(e)   E={ 1n | n∈ ℤ>0 } ,
(f)   [0,1) ,
(g)   ℤ>0 ,
(h)   { x∈ℚ | x≤0  or  (x>0  and  x2>2 )} ,
(i)   ℤ ,
(j)   [ 2,2] ,
(k)   ( 2,2) ,
(l)   { x∈ℝ | x= (-1)n n,   n∈ ℤ>0 } ,
(m)   { 1 (|n|+1) 2 | n∈ ℤ } ,
(n)   { n+1n | n∈ ℤ>0 } ,
(o)   { 2-m - 3n | m,n∈ ℤ≥0 } ,
(p)   { x∈ℝ | x3 -4x <0 } ,
(q)   { 1+x2 | x∈ℝ } ,

Let S be a nonempty subset of ℝ . Show that x=supS if and only if
(a)   x is an upper bound of S , and
(b)   for every ε∈ ℝ>0 there exists y∈ S such that x-ε < y≤x .

State and prove a characterization of infS analogous to the characterization of supS in the previous problem.

Let c∈ℝ and let S be a subset of ℝ . Show that if S is bounded then c+S ={c+s  |  s∈ℝ } is bounded.

Let c∈ℝ and let S be a subset of ℝ . Show that if S is bounded then cS ={cs  |  s∈ℝ } is bounded.

Let c∈ℝ and let S be a subset of ℝ . Show that sup(c+S) = c+supS .

Let c∈ ℝ ≥0 and let S be a subset of ℝ . Show that sup(cS) = csupS .

Let c∈ℝ and let S be a subset of ℝ . Show that inf(c+S) = c+infS .

Let c∈ ℝ ≤0 and let S be a subset of ℝ . Show that inf(cS) = cinfS .

References [PLACEHOLDER]

[BG] A. Braverman and D. Gaitsgory, Crystals via the affine Grassmanian, Duke Math. J. 107 no. 3, (2001), 561-575; arXiv:math/9909077v2, MR1828302 (2002e:20083)