Abstract. 2. We construct several transcendental numbers.
|
|
- Melina Gregory
- 5 years ago
- Views:
Transcription
1 Abstract. We prove Liouville s Theorem for the order of approximation by rationals of real algebraic numbers. 2. We construct several transcendental numbers. 3. We define Poissonian Behaviour, and study the spacings between the ordered fractional parts of {n k α}. Lecture by Steven Miller; notes for the first two by Steven Miller and Florin Spinu; notes for the third by Steven Miller.
2 Contents Liouville s Theorem Constructing Transcendentals 2. Review of Approximating by Rationals Liouville s Theorem Constructing Transcendental umbers m 0 m! [0!, 0 2!,... ] Buffon s eedle and π Poissonian Behavior and {n k α} 0 2. Equidistribution Point Masses and Induced Probability Measures eighbor Spacings Poissonian Behavior earest eighbor Spacings k th eighbor Spacings Induced Probability Measures on-poissonian Behavior Preliminaries Proof of Theorem Measure of α Q with on-poissonian Behavior along a sequence n
3 Chapter Liouville s Theorem Constructing Transcendentals. Review of Approximating by Rationals Definition.. Approximated by rationals to order n). A real number x is approximated by rationals to order n if there exist a constant kx) possibly depending on x) such that there are infinitely many rational p with q x p q < kx) q..) n Recall that Dirichlet s Box Principle gaves us: x p q <.2) q 2 for infintely many fractions p. This was proved by choosing a large parameter q Q, and considering the Q + fractionary parts {qx} [0, ) for q {0,..., Q}. The box principle ensures us that there must be two different q s, say: 0 q < q 2 Q.3) such that both {q x} and {q 2 x} belong to the same interval [ a, a+ ), for some Q Q 0 a Q. ote that there are exactly Q such intervals partitioning [0, ), and Q + fractionary parts! ow, the length of such an interval is so we get Q 2
4 {q 2 x} {q x} < Q..4) There exist integers p and p 2 such that {q x} = q x p, {q 2 x} = q 2 x p..5) Letting p = p 2 p we find q 2 q )x p Q.6) Let q = q 2 q, so q Q, and the previous equation can be rewriten as x p q < qq.7) q 2 ow, letting Q, we get an infinite collection of rational fractions p q satisfying the above equation. If this collection contains only finitely many distinct fractions, then one of these fractions, say p 0 q 0, would occur for infintely many choices Q k of Q, thus giving us: x p 0 < 0,.8) qq k q 0 as k. This implies that x = p 0 q 0 Q. So, unles x is a rational number, we can find infinitely many distinct rational numbers p satisfying Equation.7. q This means that any real, irrational number can be approximated to order n = 2 by rational numbers..2 Liouville s Theorem Theorem.2. Liouville s Theorem). Let x be a real algebraic number of degree n. Then x is approximated by rationals to order at most n. Proof. Let fx) = a n X n + a X + a 0.9) be the polynomial with integer coefficients of smallest degree minimal polynomial) such that x satisfies 3
5 fx) = 0..0) ote that deg x = deg f and the condition of minimality implies that fx) is irreducible over Z. Further, a well known result from algebra states that a polynomial irreducible over Z is also irreducible over Q. In particular, as fx) is irreducible over Q, fx) does not have any rational roots. If it did, then fx) would be divisible by a linear polynomial X a ). Let b GX) = fx). Clear denominators multiply throughout by b), and let gx) = X a b bgx). Then deg g = deg f, and gx) = 0. This contradicts the minimality of f we choose f to be a polynomial of smallest degree such that fx) = 0). Therefore, f is non-zero at every rational. Let M = sup z x < f z)..) Let now p x be a rational such that q p q <. The Mean Value Theorem gives us that ) p f fx) q = f c) x p ) M q x p q.2) where c is some real number between x and p q ; c x < for p q moderately close to x. ow we use the fact that fx) does not have any rational roots: 0 f ) ) n p p = a n + + a 0 = a np n + a p n q + a 0.3) q q The numerator of the last term is a nonzero integer, hence it has absolute value at least. Since we also know that fx) = 0 it follows that ) p f fx) q = f ) p = a np n + a p n q + a 0 q q..4) n Combining the equations.2 and.4, we get: q M n x p q Mq n x p q.5) 4
6 whenever x p <. This last equation shows us that x can be approximated q by rationals to order at most n. For assume it was otherwise, namely that x can be approximated to order n + ɛ. Then we would have an infinite sequence of distinct rational numbers { p i q i } i and a constant kx) depending only on x such that x p i < kx)..6) q i +ɛ i Since the numbers p i q i converge to x we can assume that they already are in the interval x, x + ). Hence they also satisfy Equation.5: M x p i..7) i Combining the last two equations we get x p i < kx),.8) hence M i q i q i +ɛ i q ɛ i < M.9) and this is clearly impossible for arbitrarily large q since ɛ > 0 and q i. Exercise.2.2. Justify the fact that if { p i q i } i is a rational approximation to order n of x, then q i. Remark.2.3. So far we have seen that the order to which an algebraic number can be approximated by rationals is bounded by its degree. Hence if a real, irrational number α / Q can be approximated by rationals to an arbitrary large order, then α must be transcendental! This provides us with a recipe for constructing transcendental numbers..3 Constructing Transcendental umbers.3. m 0 m! The following construction of transcendental numbers is due to Liouville. 5
7 Theorem.3.. The number is transcendental. x = m= 0 m!.20) Proof. The series defining x is convergent, since it is dominated by the geometric series. In fact, the series converges very rapidly and it is this high rate of 0 m convergence that will yield x is transcendental. Fix large, and let n >. Write p n = n m= 0 m!.2) with p n, > 0 and p n, ) =. Then { pn } n is a monotone increasing sequence converging to x. In particular, all these rational numbers are distinct. ot also that must divide 0 n!, which implies Using this, we get 0 n!..22) 0 < x p n = m>n 2 < < 0 m! = = 0 n+)! 2 qn n+ 2 q n + ) 0 n+)! 0 + n n+2)n+3) 2 0 n! ) n+..23) This gives an approximation by rationals of order of x. Since can be chosen arbitrarily large, this implies that x can be approximated by rationals to arbitrary order. We can conclude, in view of our precious remark.2.3 that x is transcendental..3.2 [0!, 0 2!,... ] Theorem.3.2. The number 6
8 is transcendental. Proof. Let pn y = [0!, 0 2!,... ].24) be the continued fraction of [0! 0 n! ]. Then y p n = < = + a n+ + ) =..25) a n+ 0 n+)! Since q k = a n q k + 2, it implies that q k > q k Also, q k+ = a k+ + q k, so we get q k+ = a k+ + q k < a k ) q k q k Hence writing this inequality for k =,, n we obtain q 2 q 3 = q < a + )a 2 + ) a n + ) q q 2 Combining equations.25 and.27 we get: y p n < < = + a ) + a n )a a n < 2 n a a n = 2 n 0!+ +n! < 0 2n! = a 2 n.27) = = a n+ n ) n a 2 n /2 n a n+ 2 < q 2 n ) n 2..28) In this way we get, just as in the previous theorem, an approximation of y by rationals to arbitrary order. This proves that y is transcendental. 7
9 .3.3 Buffon s eedle and π Consider a collection of infinitely long parallel lines in the plane, where the spacing between any two adjacent lines is d. Let the lines be located at x = 0, ±d, ±2d,.... Consider a rod of length l, where for convenience we assume l < d. If we were to randomly throw the rod on the plane, what is the probability it hits a line? This question was first asked by Buffon in 733. Because of the vertical symmetry, we may assume the center of the rod lies on the line x = 0, as shifting the rod without rotating it) up or down will not alter the number of intersections. By the horizontal symmetry, we may assume d x < 2 d. We posit that all values of x are equally likely. As x is continuous distributed, 2 we may add in x = d without changing the probability. The probability density 2 function of x is dx. d Let θ be the angle the rod makes with the x-axis. As each angle is equally likely, the probability density function of θ is dθ 2π. We assume that x and θ are chosen independently. Thus, the probability density for x, θ) is dxdθ d 2π. The projection of the rod making an angle of θ with the x-axis) along the x-axis is l cos θ. If x l cos θ, then the rod hits exactly one vertical line exactly once; if x > l cos θ, the rod does not hit a vertical line. ote that if l > d, a rod could hit multiple lines, making the arguments more involved. Thus, the probability a rod hits a line is Exercise.3.3. Show p = = 2π l cos θ θ=0 2π θ=0 x= l cos θ l cos θ d dxdθ d 2π dθ 2π = 2l πd..29) 2π cos θ dθ = 2 2π 0 π..30) Let A be the random variable which is the number of intersections of a rod of length l thrown against parallel vertical lines separated by d > l units. Then 8
10 A = { with probability 2l πd..3) 0 with probability 2l πd If we were to throw rods independently, since the expected value of a sum is the sum of the expected values Lemma??), we expect to observe 2l.32) πd intersections. Turning this around, let us throw rods, and let I be the number of observed intersections of the rods with the vertical lines. Then I 2l π πd I 2l d..33) The above is an experimental formula for π! 9
11 Chapter 2 Poissonian Behavior and {n k α} 2. Equidistribution We say a sequence of number x n [0, ) is equidistributed if #{n : n and x n [a, b]} lim = b a 2.) for any subinterval [a, b] of [0, ]. Recall Weyl s Result, Theorem??: If α Q, then the fractional parts {nα} are equidistributed. Equivalently, nα mod is equidistributed. Similarly, one can show that for any integer k, {n k α} is equidistributed. See Robert Lipshitz s paper for more details. 2.2 Point Masses and Induced Probability Measures Recall from physics the concept of a unit point mass located at x = a. Such a point mass has no length or, in higher dimensions, width or height), but finite mass. As mass is the integral of the density over space, a finite mass in zero volume or zero length on the line) implies an infinite density. We can make this more precise by the notion of an Approximation to the Identity. See also Theorem??. Definition 2.2. Approximation to the Identity). A sequence of functions g n x) is an approximation to the identity at the origin) if. g n x) 0. 0
12 2. g n x)dx =. 3. Given ɛ, δ > 0 there exists > 0 such that for all n >, x >δ g nx)dx < ɛ. We represent the limit of any such family of g n x)s by δx). If fx) is a nice function say near the origin its Taylor Series converges) then fx)δx)dx = lim fx)g n x) = f0). 2.2) n Exercise Prove Equation 2.2. Thus, in the limit the functions g n are acting like point masses. We can consider the probability densities g n x)dx and δx)dx. For g n x)dx, as n, almost all the probability is concentrated in a narrower and narrower band about the origin; δx)dx is the limit with all the mass at one point. It is a discrete as opposed to continuous) probability measure. ote that δx a) acts like a point mass; however, instead of having its mass concentrated at the origin, it is now concentrated at a. Exercise Let g n x) = { n if x 2n 0 otherwise Prove g n x) is an approximation to the identity at the origin. Exercise Let g n x) = c 2.3) n + x. 2.4) n 2 2 Find c such that the above is an approximation to the identity at the origin. Given point masses located at x, x 2,..., x, we can form a probability measure µ x)dx = δx x n )dx. 2.5) n= ote µ x)dx =, and if fx) is a nice function, fx)µ x)dx = fx n ). 2.6) n=
13 Exercise Prove Equation 2.6 for nice fx). ote the right hand side of Equation 2.6 looks like a Riemann sum. Or it would look like a Riemann sum if the x n s were equidistributed. In general the x n s will not be equidistributed, but assume for any interval [a, b] that as, the fraction of x n s n ) in [a, b] goes to b px)dx for some nice function a px): #{n : n and x n [a, b]} lim b a px)dx. 2.7) In this case, if fx) is nice say twice differentiable, with first derivative uniformly bounded), then fx)µ x)dx = fx n ) n= k= k )#{n : n and x n f [ k, k+ ] } fx)px)dx. 2.8) Definition Convergence to px)). If the sequence of points x n satisfies Equation 2.7 for some nice function px), we say the probability measures µ x)dx converge to px)dx. 2.3 eighbor Spacings We now consider finer questions. Let α n be a collection of points in [0, ). We order them by size: 0 α σ) α σ2) α σ), 2.9) where σ is a permutation of 23. ote the ordering depends crucially on. Let β j = α σj). We consider how the differences β j+ β j are distributed. We will use a slightly different definition of distance, however. 2
14 Recall [0, ) is equivalent to the unit circle under the map x e 2πix. Thus, the numbers.999 and.00 are actually very close; however, if we used the standard definition of distance, then =.998, which is quite large. Wrapping [0, ) on itself identifying 0 and ), we see that.999 and.00 are separated by.002. Definition 2.3. mod distance). Let x, y [0, ). We define the mod distance from x to y, x y, by { } x y = min x y, x y. 2.0) Exercise Show that the mod distance between any two numbers in [0, ) is at most 2. In looking at spacings between the β j s, we have pairs of neighbors: β 2, β ), β 3, β 2 ),..., β, β ). 2.) These pairs give rise to spacings β j+ β j [0, ). We can also consider the pair β, β ). This gives rise to the spacing β β [, 0); however, as we are studying this sequence mod, this is equivalent to β β + [0, ). Henceforth, whenever we perform any arithmetic operation, we always mean mod ; thus, our answers always live in [0, ) Definition eighbor Spacings). Given a sequence of numbers α n in [0, ), fix an and arrange the numbers α n n ) in increasing order. Label the new sequence β j ; note the ordering will depend on. Let β j = β j and β +j = β j.. The nearest neighbor spacings are the numbers β j+ β j, j = to. 2. The k th -neighbor spacings are the numbers β j+k β j, j = to. Remember to take the differences β j+k β j mod. Exercise Let α = 2, and let α n = {nα} or {n 2 α}. Calculate the nearest neighbor and the next-nearest neighbor spacings in each case for = 0. Definition wrapped unit interval). We call [0, ), when all arithmetic operations are done mod, the wrapped unit interval. 3
15 2.4 Poissonian Behavior Let α Q. Fix a positive integer k, and let α n = {n k α}. As, look at the ordered α n s, denoted by β n. How are the nearest neighbor spacings of β n distributed? How does this depend on k? On α? On? Before discussing this problem, we consider a simpler case. Fix, and consider independent random variables x n. Each random variable is chosen from the uniform distribution on [0, ); thus, the probability that x n [a, b) is b a. Let y n be the x n s arranged in increasing order. How do the neighbor spacings behave? First, we need to decide what is the correct scale to use for our investigations. As we have objects on the wrapped unit interval, we have nearest neighbor spacings. Thus, we expect the average spacing to be. Definition 2.4. Unfolding). Let z n = y n. The numbers z n = y n have unit mean spacing. Thus, while we expect the average spacing between adjacent y n s to be units, we expect the average spacing between adjacent z ns to be unit. So, the probability of observing a spacing as large as 2 between adjacent y ns becomes negligible as. What we should ask is what is the probability of observing a nearest neighbor spacing of adjacent y n s that is half the average spacing. In terms of the z n s, this will correspond to a spacing between adjacent z n s of 2 a unit earest eighbor Spacings By symmetry, on the wrapped unit interval the expected nearest neighbor spacing is independent of j. Explicitly, we expect β j+ β j to have the same distribution as β i+ β i. What is the probability that, when we order the x n s in increasing order, the next x n after x is located between t t+ t and? Let the x ns in increasing order be labeled y y 2 y, y n = x σn). As we are choosing the x n s independently, there are ) choices of subscript n such that x n is nearest to x. This can also be seen by symmetry, as each x n is equally likely to be the first to the right of x where, of course,.00 is just a little to the right of.999), and we have choices left for x n. [ The probability that x n t, t+ t ] is t. 4
16 For the remaining 2 of the x n s, each must be further than t+ t from x n. Thus, they must all lie in an interval or possibly two intervals if we wrap around) ) 2. of length t+ t. The probability that they all lie in this region is t+ t Thus, if x = y l, we want to calculate the probability that y l+ y l [ t, t+ t Prob ]. This is y l+ y l [ t, t + t ] ) = For enormous and t small, Thus Prob = ) t t + t ) 2 ) t + t ) 2 t. 2.2) ) t + t ) 2 e t+ t) e t. 2.3) y l+ y l [ t, t + t ] ) e t t. 2.4) Remark The above argument is infinitesimally wrong. Once we ve located y l+, the remaining x n s do not need to be more than t+ t units to the right of x = y l ; they only need to be further to the right than y l+. As the incremental gain in probabilities for the locations of the remaining x n s is of order t, these contributions will not influence the large, small t limits. Thus, we ignore these effects. To rigorously derive the limiting behavior of the nearest neighbor spacings using the above arguments, one would integrate over x m ranging from t t+ t to, and the remaining events x n would be in the a segment of length x m. As ) x m t + t ) t, 2.5) this will lead to corrections of higher order in t, hence negligible. We can rigorously avoid this by instead considering the following: 5
17 t. Calculate the probability that all the other x n s are at least right of x. This is units to the p t = t ) e t. 2.6) 2. Calculate the probability that all the other x n s are at least t+ t right of x. This is p t+ t = t + t units to the ) e t+ t). 2.7) 3. The probability that no x n s are within t units to the right of x but at least one x n is between t t+ t and units to the right is p t+ t p t : p t p t+ t e t e t+ t) = e t e t ) ) = e t + t + O t) 2 [ Definition Unfolding Spacings). If y l+ y l e t t. 2.8) t, t+ t ], then y l+ y l ) [t, t + t]. The new spacings z l+ z l have unit mean spacing. Thus, while we expect the average spacing between adjacent y n s to be units, we expect the average spacing between adjacent z n s to be unit k th eighbor Spacings Similarly, one can easily analyze the distribution of the k th neighbor spacings when each x n is chosen independently from the uniform distribution on [0, ). Again, consider x = y l. ow we want to calculate the probability that y l+k is between t t+ t and units to the right of y l. Therefore, we need exactly k of the x n s to lie between 0 and t units to the right of x, exactly one x n which will be y l+k ) to lie between t t+ t and units to the right of x, and the remaining x n s to lie at least t+ t units to the right of y l+k. 6
18 Remark We face the same problem discussed in Remark 2.4.2; a similar argument will show that ignoring these affects will not alter the limiting behavior. Therefore, we will make these simplifications. There are k ) ways to choose the xn s that are at most t units to the right of x ; there is then ) ) k ) ways to choose the xn between t t+ t and units to the right of x. Thus, = = [ t Prob y l+k y l, t + t ] ) = ) t ) ) k ) k ) t k t + t ) k+) ) k 2)) ) k ) t k t + t k k )! tk k )! e t t. ) k+) t 2.9) Again, one way to avoid the complications is to integrate over x m ranging from t t+ t to. Or, similar to before, we can proceed more rigorously as follows: t. Calculate the probability that exactly k of the other x n s are at most units to the right of x, and the remaining k ) of the x n s are at least t units to the right of x. As there are k ) ways to choose k of the x n s to be at most t units to the right of x, this probability is p t = ) t ) k t ) ) k ) k k k )! t k e t k tk k! e t. 2.20) 7
19 t 2. Calculate the probability that exactly k of the other x n s are at most units to the right of x, and the remaining ) k ) of the x n s are at least t+ t units to the right of x. Similar to the above, this gives p t = ) t ) k t + t k k k )! t k e t+ t) k ) ) k ) tk k )! e t+ t). 2.2) 3. The probability that exactly k of the x n s are within t units to the right of x and at least one x n is between t t+ t and units to the right is p t+ t p t : p t p t+ t tk k )! e t tk k )! e t+ t) tk k )! e t t. 2.22) ote that when k =, we recover the nearest neighbor spacings. 2.5 Induced Probability Measures We have proven the following: Theorem Consider independent random variables x n chosen from the uniform distribution on the wrapped unit interval [0, ). For fixed, arrange the x n s in increase order, labeled y y 2 y. Form the induced probability measure µ, from the nearest neighbor spacings. Then as we have µ, t)dt = n= Equivalently, using z n = y n : ) δ t y n y n ) dt e t dt. 2.23) µ, t)dt = n= ) δ t z n z n ) dt e t dt. 2.24) 8
20 More generally, form the probability measure from the k th nearest neighbor spacings. Then as we have µ,k t)dt = n= δ t y n y n k ) )dt tk k )! e t dt. 2.25) Equivalently, using z n = y n : µ,k t)dt = n= δ t z n z n k ) )dt tk k )! e t dt. 2.26) Definition Poissonian Behavior). We say a sequence of points x n has Poissonian Behavior if in the limit as the induced probability measures µ,k t)dt converge to tk k )! e t dt. Exercise Let α Q, and define α n = {n m α} for some positive integer m. Show the sequence of points α n does not have Poissonian Behavior. Exercise Let α Q, and define α n = {nα}. Show the sequence of points α n does not have Poissonian Behavior. Hint: for each, show the nearest neighbor spacings take on at most three distinct values the three values depend on ). As only three values are ever assumed for a fixed, µ, t)dt cannot converge to e t dt. 2.6 on-poissonian Behavior Conjecture With probability one with respect to Lebesgue Measure, see Definition??), if α Q, if α n = {n 2 α} then the sequence of points α n is Poissonian. There are constructions which show certain irrationals give rise to non-poissonian behavior. Theorem Let α Q such that α pn < a n q 3 holds infinitely often, with n a n 0. Then there exist integers j such that µ j,t) does not converge to e t dt. 9
21 As a n 0, eventually a n < for all n large. Let 0 n =, where pn is a good rational approximation to α: α p n a n <. 2.27) Remember that all subtractions are performed on the wrapped unit interval. Thus, =.002. We look at α k = {k 2 α}, k n =. Let the β k s be the α k s arranged in increasing order, and let the γ k s be the numbers {k 2 pn } arranged in increasing order: q 3 n 2.6. Preliminaries β β 2 β γ γ 2 γ. 2.28) Lemma If β l = α k = {k 2 α}, then γ l = {k 2 pn }. Thus, the same permutation orders both the α k s and the γ k s. Proof. Multiplying both sides of Equation 2.27 by k 2 q 2 n yields k 2 α k 2 p n < k 2 a n q 2 n a n < ) Thus, k 2 α and k 2 pn differ by at most 2. Therefore { } { k 2 α k 2 p } n <. 2.30) 2 As the numbers {m 2 pn } all have denominators of size at most, we see that {k 2 pn } is the closest of the {m 2 pn } to {k 2 α}. This implies that if β l = {k 2 α}, then γ l = {k 2 pn }, completing the proof. Exercise Prove the ordering is as claimed. Hint: about each β l = {k 2 α}, the closest number of the form {c 2 pn } is {k 2 pn }. 20
22 2.6.2 Proof of Theorem Exercise Assume a b, c d < 0. Show a b) c d) < a b + c d. 2.3) Proof of Theorem 2.6.2: We have shown Thus, as n = : β l γ l < a n. 2.32) n β l γ l ) < a n, 2.33) and the same result holds with l replaced by l. By Exercise 2.6.5, n β l γ l ) n β l γ l ) < 2a n. 2.34) Rearranging gives n β l β l ) n γ l γ l ) < 2a n. 2.35) As a n 0, this implies the difference between n β l β l ) and n γ l γ l ) goes to zero. The above distance calculations were done mod. The actual differences will differ by an integer. Thus, and µ α n,t)dt = n ) δ t n β l β l ) n l= 2.36) pn µ qn t)dt = n, n n l= ) δ t n γ l γ l ) 2.37) are extremely close to one another; each point mass from the difference between adjacent β l s is either within a n units of a point mass from the difference between adjacent γ l s, or is within a n units of a point mass an integer number of units from a point mass from the difference between adjacent γ l s. Further, a n 0. 2
23 ote, however, that if γ l = {k 2 pn }, then n γ l = { k 2 p n }. 2.38) pn Thus, the induced probability measure µ qn t)dt formed from the γ n, ls is supported on the integers! Thus, it is impossible for µ qn t)dt to converge to n, e t dt. As µ α n, t)dt, modulo some possible integer shifts, is arbitrarily close to pn µ qn t)dt, the sequence n, {k2 α} is not Poissonian along the subsequence of s given by n, where n =, is a denominator in a good rational approximation to α Measure of α Q with on-poissonian Behavior along a sequence n What is the Lebesgue) measure of α Q such that there are infinitely many n with α p n a n <, a n ) If the above holds, then for any constant kα), for n large large depends on both α and kα)) we have n pn α p n kα) <. 2.40) q 2+ɛ By Theorem??, this set has Lebesgue) measure or size 0. Thus, almost no irrational numbers satisfy the conditions of Theorem 2.6.2, where almost no is relative to the Lebesgue) measure. Exercise In a topological sense, how many algebraic numbers satisfy the conditions of Theorem 2.6.2? How many transcendental numbers satisfy the conditions? Exercise Let α satisfy the conditions of Theorem Consider the sequence n, where n =, the denominator of a good approximation to α. We know the induced probability measures µ qn t)dt and n, µα n, t)dt do not converge to e t dt. Do these measures converge to anything? pn 22
24 Remark In The Distribution of Spacings Between the Fractional Parts of {n 2 α} Z. Rudnick, P. Sarnak, A. Zaharescu), it is shown that for most α satisfying the conditions of Theorem 2.6.2, there is a sequence j along which µ α n, t)dt does converge to e t dt. 23
Follow links Class Use and other Permissions. For more information, send to:
COPYRIGHT OTICE: Steven J. Miller and Ramin Takloo-Bighash: An Invitation to Modern umber Theory is published by Princeton University Press and copyrighted, 2006, by Princeton University Press. All rights
More informationVarious Tendencies of Non-Poissonian Distributions Along Subsequences of Certain Transcendental Numbers
Various Tendencies of Non-Poissonian Distributions Along Subsequences of Certain Transcendental Numbers Nathan Miller 1 Mathematics Department Princeton University Princeton, NJ 08544 February 2, 2003
More informationNotes on Equidistribution
otes on Equidistribution Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. Introduction For a real number a we write {a} for
More informationNORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY
ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion
More informationSequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.
Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence
More informationMath 115 Spring 11 Written Homework 10 Solutions
Math 5 Spring Written Homework 0 Solutions. For following its, state what indeterminate form the its are in and evaluate the its. (a) 3x 4x 4 x x 8 Solution: This is in indeterminate form 0. Algebraically,
More informationmeans is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.
1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. (a) (10 points) State the formal definition of a Cauchy sequence of real numbers. A sequence, {a n } n N, of real numbers, is Cauchy if and only if for every ɛ > 0,
More informationMathematics 324 Riemann Zeta Function August 5, 2005
Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define
More informationHyperreal Calculus MAT2000 Project in Mathematics. Arne Tobias Malkenes Ødegaard Supervisor: Nikolai Bjørnestøl Hansen
Hyperreal Calculus MAT2000 Project in Mathematics Arne Tobias Malkenes Ødegaard Supervisor: Nikolai Bjørnestøl Hansen Abstract This project deals with doing calculus not by using epsilons and deltas, but
More informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationCONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS
CONTINUED FRACTIONS, PELL S EQUATION, AND TRANSCENDENTAL NUMBERS JEREMY BOOHER Continued fractions usually get short-changed at PROMYS, but they are interesting in their own right and useful in other areas
More informationAdvanced Mathematics Unit 2 Limits and Continuity
Advanced Mathematics 3208 Unit 2 Limits and Continuity NEED TO KNOW Expanding Expanding Expand the following: A) (a + b) 2 B) (a + b) 3 C) (a + b)4 Pascals Triangle: D) (x + 2) 4 E) (2x -3) 5 Random Factoring
More informationAdvanced Mathematics Unit 2 Limits and Continuity
Advanced Mathematics 3208 Unit 2 Limits and Continuity NEED TO KNOW Expanding Expanding Expand the following: A) (a + b) 2 B) (a + b) 3 C) (a + b)4 Pascals Triangle: D) (x + 2) 4 E) (2x -3) 5 Random Factoring
More informationQuick Tour of the Topology of R. Steven Hurder, Dave Marker, & John Wood 1
Quick Tour of the Topology of R Steven Hurder, Dave Marker, & John Wood 1 1 Department of Mathematics, University of Illinois at Chicago April 17, 2003 Preface i Chapter 1. The Topology of R 1 1. Open
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 4.3.5, 4.3.7, 4.3.8, 4.3.9,
More informationPade Approximations and the Transcendence
Pade Approximations and the Transcendence of π Ernie Croot March 9, 27 1 Introduction Lindemann proved the following theorem, which implies that π is transcendental: Theorem 1 Suppose that α 1,..., α k
More informationImmerse Metric Space Homework
Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationConstructions with ruler and compass.
Constructions with ruler and compass. Semyon Alesker. 1 Introduction. Let us assume that we have a ruler and a compass. Let us also assume that we have a segment of length one. Using these tools we can
More informationMATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS. Contents 1. Polynomial Functions 1 2. Rational Functions 6
MATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS PETE L. CLARK Contents 1. Polynomial Functions 1 2. Rational Functions 6 1. Polynomial Functions Using the basic operations of addition, subtraction,
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. Determine whether the following statements are true or false. Justify your answer (i.e., prove the claim, derive a contradiction or give a counter-example). (a) (10
More informationLimits and Continuity
Chapter Limits and Continuity. Limits of Sequences.. The Concept of Limit and Its Properties A sequence { } is an ordered infinite list x,x,...,,... The n-th term of the sequence is, and n is the index
More informationMT804 Analysis Homework II
MT804 Analysis Homework II Eudoxus October 6, 2008 p. 135 4.5.1, 4.5.2 p. 136 4.5.3 part a only) p. 140 4.6.1 Exercise 4.5.1 Use the Intermediate Value Theorem to prove that every polynomial of with real
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationFourier Series. 1. Review of Linear Algebra
Fourier Series In this section we give a short introduction to Fourier Analysis. If you are interested in Fourier analysis and would like to know more detail, I highly recommend the following book: Fourier
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationMathematical Methods for Physics and Engineering
Mathematical Methods for Physics and Engineering Lecture notes for PDEs Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 The integration theory
More information8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)
8. Limit Laws 8.1. Basic Limit Laws. If f and g are two functions and we know the it of each of them at a given point a, then we can easily compute the it at a of their sum, difference, product, constant
More informationGALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2)
GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2) KEITH CONRAD We will describe a procedure for figuring out the Galois groups of separable irreducible polynomials in degrees 3 and 4 over
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More informationElementary Analysis Math 140D Fall 2007
Elementary Analysis Math 140D Fall 2007 Bernard Russo Contents 1 Friday September 28, 2007 1 1.1 Course information............................ 1 1.2 Outline of the course........................... 1
More information13. Examples of measure-preserving tranformations: rotations of a torus, the doubling map
3. Examples of measure-preserving tranformations: rotations of a torus, the doubling map 3. Rotations of a torus, the doubling map In this lecture we give two methods by which one can show that a given
More informationReal Analysis - Notes and After Notes Fall 2008
Real Analysis - Notes and After Notes Fall 2008 October 29, 2008 1 Introduction into proof August 20, 2008 First we will go through some simple proofs to learn how one writes a rigorous proof. Let start
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationModular Arithmetic Instructor: Marizza Bailey Name:
Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find
More informationMADHAVA MATHEMATICS COMPETITION, December 2015 Solutions and Scheme of Marking
MADHAVA MATHEMATICS COMPETITION, December 05 Solutions and Scheme of Marking NB: Part I carries 0 marks, Part II carries 30 marks and Part III carries 50 marks Part I NB Each question in Part I carries
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationAn idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim
An idea how to solve some of the problems 5.2-2. (a) Does not converge: By multiplying across we get Hence 2k 2k 2 /2 k 2k2 k 2 /2 k 2 /2 2k 2k 2 /2 k. As the series diverges the same must hold for the
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationMath 61CM - Solutions to homework 6
Math 61CM - Solutions to homework 6 Cédric De Groote November 5 th, 2018 Problem 1: (i) Give an example of a metric space X such that not all Cauchy sequences in X are convergent. (ii) Let X be a metric
More informationMathematical Reasoning & Proofs
Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationLecture Notes Introduction to Ergodic Theory
Lecture Notes Introduction to Ergodic Theory Tiago Pereira Department of Mathematics Imperial College London Our course consists of five introductory lectures on probabilistic aspects of dynamical systems,
More informationThe Lebesgue Integral
The Lebesgue Integral Brent Nelson In these notes we give an introduction to the Lebesgue integral, assuming only a knowledge of metric spaces and the iemann integral. For more details see [1, Chapters
More informationCHAPTER 3 Further properties of splines and B-splines
CHAPTER 3 Further properties of splines and B-splines In Chapter 2 we established some of the most elementary properties of B-splines. In this chapter our focus is on the question What kind of functions
More informationThe Weil bounds. 1 The Statement
The Weil bounds Topics in Finite Fields Fall 013) Rutgers University Swastik Kopparty Last modified: Thursday 16 th February, 017 1 The Statement As we suggested earlier, the original form of the Weil
More informationMathematics 228(Q1), Assignment 2 Solutions
Mathematics 228(Q1), Assignment 2 Solutions Exercise 1.(10 marks) A natural number n > 1 is said to be square free if d N with d 2 n implies d = 1. Show that n is square free if and only if n = p 1 p k
More informationIntroduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION
Introduction to Proofs in Analysis updated December 5, 2016 By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Purpose. These notes intend to introduce four main notions from
More information2. Introduction to commutative rings (continued)
2. Introduction to commutative rings (continued) 2.1. New examples of commutative rings. Recall that in the first lecture we defined the notions of commutative rings and field and gave some examples of
More informationMath 1B, lecture 15: Taylor Series
Math B, lecture 5: Taylor Series Nathan Pflueger October 0 Introduction Taylor s theorem shows, in many cases, that the error associated with a Taylor approximation will eventually approach 0 as the degree
More informationLimits at Infinity. Horizontal Asymptotes. Definition (Limits at Infinity) Horizontal Asymptotes
Limits at Infinity If a function f has a domain that is unbounded, that is, one of the endpoints of its domain is ±, we can determine the long term behavior of the function using a it at infinity. Definition
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
More information8.5 Taylor Polynomials and Taylor Series
8.5. TAYLOR POLYNOMIALS AND TAYLOR SERIES 50 8.5 Taylor Polynomials and Taylor Series Motivating Questions In this section, we strive to understand the ideas generated by the following important questions:
More informationScott Taylor 1. EQUIVALENCE RELATIONS. Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that:
Equivalence MA Relations 274 and Partitions Scott Taylor 1. EQUIVALENCE RELATIONS Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that: (1) is reflexive. That is, (2) is
More informationMath 473: Practice Problems for Test 1, Fall 2011, SOLUTIONS
Math 473: Practice Problems for Test 1, Fall 011, SOLUTIONS Show your work: 1. (a) Compute the Taylor polynomials P n (x) for f(x) = sin x and x 0 = 0. Solution: Compute f(x) = sin x, f (x) = cos x, f
More informationBernoulli Polynomials
Chapter 4 Bernoulli Polynomials 4. Bernoulli Numbers The generating function for the Bernoulli numbers is x e x = n= B n n! xn. (4.) That is, we are to expand the left-hand side of this equation in powers
More information1. Introduction to commutative rings and fields
1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative
More informationAn Invitation to Modern Number Theory. Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD
An Invitation to Modern Number Theory Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Foreword Preface Notation xi xiii xix PART 1. BASIC NUMBER THEORY
More informationLECTURE 3. RATIONAL NUMBERS: AN EXAMPLE OF MATHEMATICAL CONSTRUCT
ANALYSIS FOR HIGH SCHOOL TEACHERS LECTURE 3. RATIONAL NUMBERS: AN EXAMPLE OF MATHEMATICAL CONSTRUCT ROTHSCHILD CAESARIA COURSE, 2011/2 1. Rational numbers: how to define them? Rational numbers were discovered
More informationSolutions to Assignment 1
Solutions to Assignment 1 Question 1. [Exercises 1.1, # 6] Use the division algorithm to prove that every odd integer is either of the form 4k + 1 or of the form 4k + 3 for some integer k. For each positive
More informationDISTRIBUTION OF EIGENVALUES OF REAL SYMMETRIC PALINDROMIC TOEPLITZ MATRICES AND CIRCULANT MATRICES
DISTRIBUTION OF EIGENVALUES OF REAL SYMMETRIC PALINDROMIC TOEPLITZ MATRICES AND CIRCULANT MATRICES ADAM MASSEY, STEVEN J. MILLER, AND JOHN SINSHEIMER Abstract. Consider the ensemble of real symmetric Toeplitz
More informationMATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST
MATH 115, SUMMER 2012 LECTURE 4 THURSDAY, JUNE 21ST JAMES MCIVOR Today we enter Chapter 2, which is the heart of this subject. Before starting, recall that last time we saw the integers have unique factorization
More informationLIMITS AT INFINITY MR. VELAZQUEZ AP CALCULUS
LIMITS AT INFINITY MR. VELAZQUEZ AP CALCULUS RECALL: VERTICAL ASYMPTOTES Remember that for a rational function, vertical asymptotes occur at values of x = a which have infinite its (either positive or
More informationMATH 301 INTRO TO ANALYSIS FALL 2016
MATH 301 INTRO TO ANALYSIS FALL 016 Homework 04 Professional Problem Consider the recursive sequence defined by x 1 = 3 and +1 = 1 4 for n 1. (a) Prove that ( ) converges. (Hint: show that ( ) is decreasing
More informationRoth s Theorem on Arithmetic Progressions
September 25, 2014 The Theorema of Szemerédi and Roth For Λ N the (upper asymptotic) density of Λ is the number σ(λ) := lim sup N Λ [1, N] N [0, 1] The Theorema of Szemerédi and Roth For Λ N the (upper
More information1 Definition of the Riemann integral
MAT337H1, Introduction to Real Analysis: notes on Riemann integration 1 Definition of the Riemann integral Definition 1.1. Let [a, b] R be a closed interval. A partition P of [a, b] is a finite set of
More informationIntegration on Measure Spaces
Chapter 3 Integration on Measure Spaces In this chapter we introduce the general notion of a measure on a space X, define the class of measurable functions, and define the integral, first on a class of
More informationMeasure and Integration: Solutions of CW2
Measure and Integration: s of CW2 Fall 206 [G. Holzegel] December 9, 206 Problem of Sheet 5 a) Left (f n ) and (g n ) be sequences of integrable functions with f n (x) f (x) and g n (x) g (x) for almost
More informationMeasure Theory and Lebesgue Integration. Joshua H. Lifton
Measure Theory and Lebesgue Integration Joshua H. Lifton Originally published 31 March 1999 Revised 5 September 2004 bstract This paper originally came out of my 1999 Swarthmore College Mathematics Senior
More informationMathematics 1 Lecture Notes Chapter 1 Algebra Review
Mathematics 1 Lecture Notes Chapter 1 Algebra Review c Trinity College 1 A note to the students from the lecturer: This course will be moving rather quickly, and it will be in your own best interests to
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More informationMath 341 Summer 2016 Midterm Exam 2 Solutions. 1. Complete the definitions of the following words or phrases:
Math 34 Summer 06 Midterm Exam Solutions. Complete the definitions of the following words or phrases: (a) A sequence (a n ) is called a Cauchy sequence if and only if for every ɛ > 0, there exists and
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationx = π m (a 0 + a 1 π + a 2 π ) where a i R, a 0 = 0, m Z.
ALGEBRAIC NUMBER THEORY LECTURE 7 NOTES Material covered: Local fields, Hensel s lemma. Remark. The non-archimedean topology: Recall that if K is a field with a valuation, then it also is a metric space
More informationchapter 12 MORE MATRIX ALGEBRA 12.1 Systems of Linear Equations GOALS
chapter MORE MATRIX ALGEBRA GOALS In Chapter we studied matrix operations and the algebra of sets and logic. We also made note of the strong resemblance of matrix algebra to elementary algebra. The reader
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More information1. Introduction to commutative rings and fields
1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative
More information18. Cyclotomic polynomials II
18. Cyclotomic polynomials II 18.1 Cyclotomic polynomials over Z 18.2 Worked examples Now that we have Gauss lemma in hand we can look at cyclotomic polynomials again, not as polynomials with coefficients
More informationCALCULUS JIA-MING (FRANK) LIOU
CALCULUS JIA-MING (FRANK) LIOU Abstract. Contents. Power Series.. Polynomials and Formal Power Series.2. Radius of Convergence 2.3. Derivative and Antiderivative of Power Series 4.4. Power Series Expansion
More information1.1.1 Algebraic Operations
1.1.1 Algebraic Operations We need to learn how our basic algebraic operations interact. When confronted with many operations, we follow the order of operations: Parentheses Exponentials Multiplication
More informationζ (s) = s 1 s {u} [u] ζ (s) = s 0 u 1+sdu, {u} Note how the integral runs from 0 and not 1.
Problem Sheet 3. From Theorem 3. we have ζ (s) = + s s {u} u+sdu, (45) valid for Res > 0. i) Deduce that for Res >. [u] ζ (s) = s u +sdu ote the integral contains [u] in place of {u}. ii) Deduce that for
More informationContents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3
Analysis Math Notes Study Guide Real Analysis Contents Ordered Fields 2 Ordered sets and fields 2 Construction of the Reals 1: Dedekind Cuts 2 Metric Spaces 3 Metric Spaces 3 Definitions 4 Separability
More informationWeek 2: Sequences and Series
QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime
More information1.5 Approximate Identities
38 1 The Fourier Transform on L 1 (R) which are dense subspaces of L p (R). On these domains, P : D P L p (R) and M : D M L p (R). Show, however, that P and M are unbounded even when restricted to these
More informationLebesgue measure and integration
Chapter 4 Lebesgue measure and integration If you look back at what you have learned in your earlier mathematics courses, you will definitely recall a lot about area and volume from the simple formulas
More informationHMMT February 2018 February 10, 2018
HMMT February 018 February 10, 018 Algebra and Number Theory 1. For some real number c, the graphs of the equation y = x 0 + x + 18 and the line y = x + c intersect at exactly one point. What is c? 18
More informationProblem 1A. Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1. (Hint: 1. Solution: The volume is 1. Problem 2A.
Problem 1A Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1 (Hint: 1 1 (something)dz) Solution: The volume is 1 1 4xydz where x = y = 1 z 2 This integral has value 16/3 Problem 2A Let f(x)
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationChapter 11 - Sequences and Series
Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a
More informationLecture 4: Completion of a Metric Space
15 Lecture 4: Completion of a Metric Space Closure vs. Completeness. Recall the statement of Lemma??(b): A subspace M of a metric space X is closed if and only if every convergent sequence {x n } X satisfying
More informationLEGENDRE POLYNOMIALS AND APPLICATIONS. We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.
LEGENDRE POLYNOMIALS AND APPLICATIONS We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.. Legendre equation: series solutions The Legendre equation is
More informationChapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
More information