368 APPENDIX A. CLASSIFICATION OF REAL NUMBERS

=

(K + c

m

∑i=1

eβ i

)n

∑j=0

f ( j) (0)−

(K

n

∑j=0

f ( j) (0)+ cm

∑i=1

n

∑j=0

f ( j) (β i)

)(1.11)

Here K ∑nj=0 f ( j) (0) is added and subtracted. From Lemma A.3.3,

vp(m+1)up +m1 (p) p+m2 (p) p = Kn

∑j=0

f ( j) (0)+ cm

∑i=1

n

∑j=0

f ( j) (β i)

Thus, if p is very large,

cm

∑i=1

I (β i) = small = Kvp(m+1)up +M (p) p+

(K + c

m

∑i=1

eβ i

)n

∑j=0

f ( j) (0)

Let p be prime and larger than max(K,v,u). If K + c∑mi=1 eβ i = 0, the above is impossible

because it would requiresmall = Kvp(m+1)up +M (p) p

Now the right side is a nonzero integer because p cannot divide Kvp(m+1)up so the rightside cannot equal something small.

Note that this shows π is irrational. If π = k/m where k,m are integers, then both iπand −iπ are roots of the polynomial with integer coefficients, m2x2 + k2 which wouldrequire, from what was just shown that 0 ̸= 2+ eiπ + e−iπ which is not the case since thesum on the right equals 0.

The following corollary follows from this. It is like the above lemma except it involvesseveral polynomials. First is a lemma.

Lemma A.3.5 Let vk,uk,mk be integers for k = 1,2...,m,uk,vk nonzero. Then for eachk there exists αk an integer such that α

mk+2k vmk+1

k uk is U for some non zero integer.

Proof: Let U ≡(

∏mj=1 v

m j+1j u j

)∏

mj=1(m j+2)

2

≡ αmk+2k vmk+1

k uk where αk is an integerchosen to make this so.

Corollary A.3.6 Let K and ci for i = 1, · · · ,n be nonzero integers. For each k between1 and n let {β (k)i}

mki=1 be the roots of a polynomial with integer coefficients,

Qk (x)≡ vkxmk + · · ·+uk

where vk,uk ̸= 0. Then

K + c1

(m1

∑j=1

eβ (1) j

)+ c2

(m2

∑j=1

eβ (2) j

)+ · · ·+ cn

(mn

∑j=1

eβ (n) j

)̸= 0. (∗)

Proof: Let Kk be nonzero integers which add to K. It is certainly possible to obtain thissince the Kk are allowed to change sign. They only need to be nonzero. Also let αk be as inthe above lemma such that α

mk+2k vmk+1

k uk = U some integer. Thus, replacing each Qk (x)with αkvkxmk + · · ·+αkuk, it follows that for each large prime p,(αkv)p(mk+1) (αku)p =(

αmk+2k vmk+1

)p=U p. From now on, use the new Qk (x).

368 APPENDIX A. CLASSIFICATION OF REAL NUMBERS- [ered ) ¥ 10) o MOET Wid 0) (1.11)i=l i=1 j=0Here K Yo f (J) (0) is added and subtracted. From Lemma A.3.3,f (B;)MsMsvrimDuP +m) (p)p+m(p)p=KY f) (0) +ej= ‘)ill_aIThus, if p is very large,c)1(B;) = small = Kv?" y? + M(p) p+ (ered) y f (0)! =i=l i=lLet p be prime and larger than max (K,v,u). If K+cy", ePi — 0, the above is impossiblebecause it would requiresmall = Kv?" v? + M (p) pNow the right side is a nonzero integer because p cannot divide KyP\™+DyP so the rightside cannot equal something small. §jNote that this shows 7 is irrational. If 2 = k/m where k,m are integers, then both izand —iz are roots of the polynomial with integer coefficients, m2x* +k? which wouldrequire, from what was just shown that 0 4 2+ e’* +e” which is not the case since thesum on the right equals 0.The following corollary follows from this. It is like the above lemma except it involvesseveral polynomials. First is a lemma.Lemma A.3.5 Let vy, uz,m, be integers for k = 1,2...,m,uz,vy% nonzero. Then for each. ; 2 1, .k there exists , an integer such that ont vet ux is U for some non zero integer.2a] T1_, (mj+2Proof: Let U = ( mye u) Feil?)chosen to make this so. §j2 1m+ ver=O, ux Where QO, is an integerCorollary A.3.6 Let K and c; for i=1,--+ ,n be nonzero integers. For each k between1 and n let {B (k);}2"*, be the roots of a polynomial with integer coefficients,Ox (x) = vyx'™ +--+ + ugwhere vx, uz #0. ThenmM, m2 mnK+c, (% #0) +¢2 (i #0) +--+, (i #0) #0. (*)A Pij=! j=!Proof: Let K;, be nonzero integers which add to K. It is certainly possible to obtain thissince the K; are allowed to change sign. They only need to be nonzero. Also let @, be as inthe above lemma such that oon? tat} u; =U some integer. Thus, replacing each Q; (x)with ovpx" + +--+ Aux, it follows that for each large prime p, (arv)POm™r) (Qu)? =2 P(oi vnc) = U?. From now on, use the new Q, (x).