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 xy and yz then xz.

Show that if x,y and xy and yx then x=y.

Show that if x,y,z and xy then x+z y+z.

Show that if x,y and x0 and y0 then xy0.

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 nN .

Find the minimal N >0 such that n!> 2n for all nN .

Find the minimal N >0 such that 2n > 2n3 for all nN .

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 | x0 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-ε < yx .

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)