2.6.E: Problems on Roots, Powers, and Irrationals (Exercises)
( \newcommand{\kernel}{\mathrm{null}\,}\)
Let n∈N in E1; let p>0 and a>0 be elements of an ordered field F.
Prove that
(i) if pn>a, then (∃x∈F)p>x>0 and xn>a;
(ii) if pn<a, then (∃x∈F)x>p and xn<a.
[Hint: For (i), put
x=p−d, with 0<d<p.
Use the Bernoulli inequality (Problem 5 (ii) in §§5-6) to find d such that
xn=(p−d)n>a,
i.e.,
(1−dp)n>apn.
Solving for d, show that this holds if
0<d<pn−anpn−1<p. (Why does such a d exist? )
For (ii), if pn<a, then
1pn>1a.
Use (i) with a and p replaced by 1/a and 1/p.]
Prove Theorem 1 assuming that
(i) a>1;
(ii) 0<a<1 (the cases a=0 and a=1 are trivial).
[ Hints: ( i) Let
A={x∈F|x≥1,xn>a}.
Show that A is bounded below (by 1 ) and A≠∅ (e.g., a+1∈A−why?).
By completeness, put p= inf A.
Then show that pn=a (i.e., p is the required n√a).
Indeed, if pn>a, then Problem 1 would yield an x∈A with
x<p=infA. (Contradiction!)
Similarly, use Problem 1 to exclude pn<a.
To prove uniqueness, use Problem 4(ii) of §§5-6.
Case (ii) reduces to (i) by considering 1/a instead of a.]
Prove Note 1.
[Hint: Suppose first that a is not divisible by any square of a prime, i.e.,
a=p1p2⋯pm,
where the pk are distinct primes. (We assume it known that each a∈N is the product of [possibly repeating] primes.) Then proceed as in the proof of Theorem 2, replacing "even" by "divisible by pk."
The general case, a=p2b, reduces to the previous case since √a=p√b.]
Prove that if r is rational and q is not, then r±q is irrational; so also are rq,q/r, and r/q if r≠0.
[Hint: Assume the opposite and find a contradiction.]
⇒5. Prove the density of irrationals in a complete field F: If a<b(a,b∈F), there is an irrational x∈F with
a<x<b
(hence infinitely many such irrationals x). See also Chapter 1, §9, Problem 4.
[Hint: By Theorem 3 of §10,
(∃r∈R)a√2<r<b√2,r≠0.(Why?)
Put x=r/√2; see Problem 4].
Prove that the rational subfield R of any ordered field is Archimedean.
[Hint: If
x=km and y=pq(k,m,p,q∈N),
then nx>y for n=mp+1].
Verify the formulas in (1) for powers with positive rational exponents r,s.
Prove that
(i) ar+s=aras and
(ii) ar−s=ar/as for r,s∈E1 and a∈F(a>0).
[Hints: For (i), if r,s>0 and a>1, use Problem 9 in §§8-9 to get
Verify that
AarAas={axay|x,y∈R,0<x≤r,0<y≤s}={az|z∈R,0<z≤r+s}=Aa,r+s
Hence deduce that
aras=sup(Aa,r+s)=ar+s
by Definition 2.
For (ii), if r>s>0 and a>1, then by (i),
ar−sas=ar
so
ar−s=aras.
For the cases r<0 or s<0, or 0<a<1, use the above results and Definition 2(ii)(iii).]
From Definition 2 prove that if r>0(r∈E1), then
a>1⟺ar>1
for a∈F(a>0).
Prove for r,s∈E1 that
(i) r<s⇔ar<as if a>1;
(ii) r<s⇔ar>as if 0<a<1.
[Hints: (i) By Problems 8 and 9,
as=ar+(s−r)=aras−r>ar
since as−r>1 if a>1 and s−r>0.
(ii) For the case 0<a<1, use Definition 2(ii).]
Prove that
(a⋅b)r=arbr and (ab)r=arbr
for r∈E1 and positive a,b∈F.
[Hint: Proceed as in Problem 8.]
Given a,b>0 in F and r∈E1, prove that
(i) a>b⇔ar>br if r>0, and
(ii) a>b⇔ar<br if r<0.
[Hint:
a>b⟺ab>1⟺(ab)r>1
if r>0 by Problems 9 and 11].
Prove that
(ar)s=ars
for r,s∈E1 and a∈F(a>0).
[Hint: First let r,s>0 and a>1. To show that
(ar)s=ars=supAa,rs=sup{axy|x,y∈R,0<xy≤rs},
use Problem 13 in §§8-9. Thus prove that
(i) (∀x,y∈R|0<xy≤rs)axy≤(ar)s, which is easy, and
(ii) (∀d>1)(∃x,y∈R|0<xy≤rs)(ar)s<daxy.
Fix any d>1 and put b=ar. Then
(ar)s=bs=supAbs=sup{by|y∈R,0<y≤s}.
Fix that y. Now
ar=supAar=sup{ax|x∈R,0<x≤r};
so
(∃x∈R|0<x≤r)ar<d12yax.(Why?)
Combining all and using the formulas in (1) for rationals x,y, obtain
(ar)s<d12(ar)y<d12(d12yax)y=daxy,
thus proving (ii)].