Loading [MathJax]/jax/output/HTML-CSS/jax.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

2.6.E: Problems on Roots, Powers, and Irrationals (Exercises)

( \newcommand{\kernel}{\mathrm{null}\,}\)

Exercise 2.6.E.1

Let nN in E1; let p>0 and a>0 be elements of an ordered field F.
Prove that
(i) if pn>a, then (xF)p>x>0 and xn>a;
(ii) if pn<a, then (xF)x>p and xn<a.
[Hint: For (i), put
x=pd, with 0<d<p.
Use the Bernoulli inequality (Problem 5 (ii) in §§5-6) to find d such that
xn=(pd)n>a,
i.e.,
(1dp)n>apn.
Solving for d, show that this holds if
0<d<pnanpn1<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.]

Exercise 2.6.E.2

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={xF|x1,xn>a}.
Show that A is bounded below (by 1 ) and A (e.g., a+1Awhy?).
By completeness, put p= inf A.
Then show that pn=a (i.e., p is the required na).
Indeed, if pn>a, then Problem 1 would yield an xA 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.]

Exercise 2.6.E.3

Prove Note 1.
[Hint: Suppose first that a is not divisible by any square of a prime, i.e.,
a=p1p2pm,
where the pk are distinct primes. (We assume it known that each aN 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=pb.]

Exercise 2.6.E.4

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 r0.
[Hint: Assume the opposite and find a contradiction.]

Exercise 2.6.E.5

5. Prove the density of irrationals in a complete field F: If a<b(a,bF), there is an irrational xF with
a<x<b
(hence infinitely many such irrationals x). See also Chapter 1, §9, Problem 4.
[Hint: By Theorem 3 of §10,
(rR)a2<r<b2,r0.(Why?)
Put x=r/2; see Problem 4].

Exercise 2.6.E.6

Prove that the rational subfield R of any ordered field is Archimedean.
[Hint: If
x=km and y=pq(k,m,p,qN),
then nx>y for n=mp+1].

Exercise 2.6.E.7

Verify the formulas in (1) for powers with positive rational exponents r,s.

Exercise 2.6.E.8

Prove that
(i) ar+s=aras and
(ii) ars=ar/as for r,sE1 and aF(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,yR,0<xr,0<ys}={az|zR,0<zr+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),
arsas=ar
so
ars=aras.
For the cases r<0 or s<0, or 0<a<1, use the above results and Definition 2(ii)(iii).]

Exercise 2.6.E.9

From Definition 2 prove that if r>0(rE1), then
a>1ar>1
for aF(a>0).

Exercise 2.6.E.10

Prove for r,sE1 that
(i) r<sar<as if a>1;
(ii) r<sar>as if 0<a<1.
[Hints: (i) By Problems 8 and 9,
as=ar+(sr)=arasr>ar
since asr>1 if a>1 and sr>0.
(ii) For the case 0<a<1, use Definition 2(ii).]

Exercise 2.6.E.11

Prove that
(ab)r=arbr and (ab)r=arbr
for rE1 and positive a,bF.
[Hint: Proceed as in Problem 8.]

Exercise 2.6.E.12

Given a,b>0 in F and rE1, prove that
(i) a>bar>br if r>0, and
(ii) a>bar<br if r<0.
[Hint:
a>bab>1(ab)r>1
if r>0 by Problems 9 and 11].

Exercise 2.6.E.13

Prove that
(ar)s=ars
for r,sE1 and aF(a>0).
[Hint: First let r,s>0 and a>1. To show that
(ar)s=ars=supAa,rs=sup{axy|x,yR,0<xyrs},
use Problem 13 in §§8-9. Thus prove that
(i) (x,yR|0<xyrs)axy(ar)s, which is easy, and
(ii) (d>1)(x,yR|0<xyrs)(ar)s<daxy.
Fix any d>1 and put b=ar. Then
(ar)s=bs=supAbs=sup{by|yR,0<ys}.
Fix that y. Now
ar=supAar=sup{ax|xR,0<xr};
so
(xR|0<xr)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)].


2.6.E: Problems on Roots, Powers, and Irrationals (Exercises) is shared under a CC BY 1.0 license and was authored, remixed, and/or curated by LibreTexts.

Support Center

How can we help?