Theorem 17.1
Theorem 17.1. If x is a real number, there exists an increasing rational sequence {rn} with limit x.
Proof. By Theorem 7.8, ∃r1∈Q such that x−1<r1<x. In the same manner, choose r2∈Q such that max{x−12,r1}<r2<x. In general, having chosen a rational number rn<x, choose rn+1∈Q such that max{x−1n+1,rn}<rn+1<x. Since rn<rn+1, {rn} is increasing.
Note that x−1n<rn<x. By Theorem 12.1, Corollary 12.4, Theorem 14,3, and limn→∞1n=0, limn→∞(x−1n)=x=limn→∞x⟹limn→∞rn=x.◼
Remark
Remark. If a≥1 and x is a real number, we choose an increasing rational sequence {rn} such that limn→∞rn=x.
Since rn≤rn+1, arn≤arn+1. Then the sequence {arn} is increasing.
Let R={rn|n∈P}. By Theorem 16.2, R is bounded. Then ∃l=supR by A13.
Let ε>0. Note that l−ε is not an upper bound for R. Then ∃N∈P such that l−ε<rn,∀n≥N. ({rn} is increasing.) Since {rn} converges to x, ∃N′∈P such that |rn−x|<ε,∀n≥N′. Then l−ε<rn<x+ε≤l+ε,∀n≥max{N,N′}⟹|rn−l|<ε,∀n≥max{N,N′}⟹limn→∞rn=l. By Theorem 10.3, x=l. Thus rn≤x,∀n∈P.
Let r∈Q such that r>x. Then rn≤x<r,∀n∈P⟹arn<ar. Thus {arn} is bounded, and by Theorem 16.2, {arn} is convergent.
위 remark에 의해서 수열 {arn}은 항상 수렴한다고 말할 수 있으므로, 이와 같이 real exponent를 정의할 수 있다.
Definition 17.2
Definition 17.2. Let a≥1, and let x be a real number. We define ax=limn→∞arn where {rn} is an increasing rational sequence with limit x. If 0<a<1 and x is a real number, we define ax=(11/a)x=(1a)−x.
Lemma 17.3
Lemma 17.3. Let a≥1, and let x be a real number. Let {rn} and {sn} be increasing rational sequences such that limn→∞rn=x=limn→∞sn. Then limn→∞arn=limn→∞asn.
Proof. Define Rn=rn−1n,Sn=sn−1n,∀n∈P. Since rn≤x,sn≤x and Rn<rn,Sn<sn for all n∈P, we have Rn<x and Sn<x for all n∈P. Furthermore, {Rn} and {Sn} is increasing.
Note that limn→∞aRn=limn→∞arn−1n=limn→∞arn⋅a−1n=limn→∞arnlimn→∞a1n=limn→∞arn by Theorem 12.9 and Theorem 16.4. Similarly, we have limn→∞aSn=limn→∞asn.
Since R1<x, we can choose m1∈P such that R1<Sm1. (If not, then Sn≤R1,∀n∈P, which means that {Sn} is bounded above by R1. By the remark, x≤R1⨂.) In the same manner, we can choose n2∈P such that Sm1<Rn2 because Sm1<x. Continuing in this way, we can choose an increasing sequence R1=Rn1<Sm1<Rn2<Sm2<⋯<x. Define the sequence {bk} by b2k−1=Rnk and b2k=Smk for all k∈P. Since {bk} is bounded by |x|, {bk} is convergent by Theorem 16.2. Then we have limn→∞arn=limn→∞aRn=limk→∞aRnk=limk→∞ab2k−1=limk→∞abk=limk→∞ab2k=limk→∞aSmk=limn→∞aSn=limn→∞asn.◼
Theorem 17.4
Theorem 17.4. Let a and b be positive numbers. Then
(i) ax+y=axay for x,y∈R
(ii) (ax)y=axy for x,y∈R
(iii) (ab)x=axbx for x∈R
(iv) a−x=1ax for x∈R
(v) (ab)x=axbx for x∈R
(vi) If a>1 and x<y, then ax<ay.
(vii) If 0<a<1 and x<y, then ax>ay.
(viii) If x>0 and a<b, then ax<bx.
(ix) If x<0 and a<b, then ax>bx.
Proof. Let {rn} and {sn} be the sequences to be convergent to x and y, respectively.
(i) If a≥1, then limn→∞arn=ax and limn→∞asn=ay. Note that limn→∞(rn+sn)=x+y by Theorem 12.2. Thus we have limn→∞ax+y=limn→∞arn+sn=limn→∞arn⋅asn=limn→∞arnlimn→∞asn=axay by Theorem 12.6.
If 0<a<1, then ax+y=(1a)−(x+y)=(1a)−x−y=(1a)−x(1a)−y=axay. ◼