# 1. R In this and the next section we are going to study the properties of sequences of real numbers.

Save this PDF as:

Size: px
Start display at page:

Download "1. R In this and the next section we are going to study the properties of sequences of real numbers."

## Transcription

1 +a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real numbers is a function with domain N and range R. We will first construct real numbers using sequences of rational numbers (functions with domain N and range Q). Notation. Often when denoting a sequence, we write n not as an argument but as a subscript. That is if f: N R is a real sequence, we usually denote it as f n instead of f(n) Construction of Real Numbers. We present the main ingredients of construction of real numbers, without providing all the proofs. The important thing here is to understand 1. Why do we need to construct R. 2. What are the obstacles we need to overcome during this construction Why. Everyone knows: Integers Z are needed because one cannot subtract within natural numbers N; Rationals Q are needed because one cannot divide within integers Z; Complex numbers C are needed because one cannot solve algebraic equations within real numbers R. One may say that we need R because we would like to solve equations like x 2 2=0. But if we don t know anything about R or C, can we really tell that x 2 2 = 0 and x = 0 are different types of equations? Not likely. 1.1 Fact. Note that if we start from Q and add to it all possible roots of algebraic equations 1.2, as well as linear combinations of these numbers, we still won t get C. To see why, we can either follow the hard way, like proving directly e is transcendental not root to any algebraic equations; Or follow the easy way, like reading the section about countable/uncountable sets in any analysis book. What really makes R necessary is that we would like to take limit. To see this, we first need an example showing that, indeed, the limit of a sequence of numbers in Q may not be in Q. Lemma 1.3. There is a sequence of rational numbers converging to the irrational number 2. Proof. (Problematic proof!) As in the first lecture we have already shown that 2 is not rational, we only need a sequence of rational numbers converging to 2. Let p1 =1, p 2 = 1.4, p 3 = Each p n+1 is determined as follows: Let p n = 1.41 a n 1. Then p n+1 = 1.41 a n 1 a n = n 1 10 (n 1) +a n 10 n with a n 2 such that p n+1 < 2 while (1.41 a n 1 (a n + 1)) 2 > Pythagoras will try to argue with certain triangles, but we modern people do not need the help of triangles to understand the meaning of equations... Furthermore, what about equations like x 4 1 = 0? It definitely looks more like x 2 1 = 0 than x 2 + 1=0 but would still require us to consider complex numbers Polynomial (with rational coefficient) = 0.

2 The above argument is problematic in fact the statement of the lemma itself is already problematic. The problem is that we already assumed the existence of the irrational number 2. Even worse, we also assumed that this number enjoys all the addition/subtraction/multiplication, or even limit... properties of the good rational numbers! But if we cannot assume a priori the existence of the limit, how do we know that the sequence should have a limit? This makes necessary the notion of Cauchy sequences. Definition 1.4. (Cauchy sequence) A sequence of numbers a 1,,a n, (denoted {a n }) is called a Cauchy sequence if the following holds: Think: ε > 0 N N such that m, n > N, a m a n < ε. (1.1) Why is ε > 0 N N such that n > N, a n+1 a n < ε not enough? Example 1.5. Show that {a n }, a n = 3 for all n is a Cauchy sequence. {a n }, a n = as defined in Lemma 1.3 is a Cauchy sequence. Proof. We give detailed proof of the second claim here. By definition, we need to show that, given any ε>0, we can find N >0, such that whenever n,m>n, a n a m <ε. The key is to find N based on the size of ε. Given any ε > 0. We can always find a number M such that ε > 10 M. Now take N = M + 1. For any n,m>n, we know from the construction of the sequence that a n,a m share the first N digits, in other words a n a m 10 (N 1) = 10 M < ε. (1.2) Thus the proof ends. Example 1.6. Show that a n = 1 1 is Cauchy. n n+1 Proof. Given any ε >0. Take N such that N 2 > 2/ε. Then for every n, m > N, we have The proof ends. 1 a n a m a n + a m = n (n+1) + 1 m (m + 1) < 2 < ε. (1.3) N2 So we have shown that a n = form a Cauchy sequence. To see that it cannot have a limit a Q, we prove by contradiction, showing that if the limit is in Q, then its square must be 2. By construction of a n, we know that a n 2 <2 while ( a n + 10 (n 1))2 >2. This means 2 a n 2 = 2 a n 2 < ( a n + 10 (n 1))2 a n 2 =2 10 (n 1) a n (n 1) < 10 (n 2). (1.4) Here the last step follows from the observation that a n 2 < 2 implies a n < 2. Thus we have a n 2 2. On the other hand, by assumption a n a, we have a 2 a n 2 = a a n a +a n < 4 a a n 0. (1.5) Putting everything together we have a 2 =2. Contradiction Construction of R.

3 Naïvely, we want to simply consider the set of all Cauchy sequences, and call this set R. However there is a problem here. It is easy to realize that seemingly different Cauchy sequences may converge to the same number. For example consider {x n = 1/n} and {y n = 0}. To fix this, we introduce the following (Of course, the tricky issue here is to tell that two Cauchy sequences converge to the same number without acknowledging the existence of this number!) Definition 1.7. (Equivalence of Cauchy sequences) Two Cauchy sequences {a n }, {b n } are equivalent if their mix-up {c n }, defined as { ak n = 2k c n = (1.6) b k n = 2k 1 is still a Cauchy sequence. We denote this relation as {a n } {b n }. The following lemma makes proving equivalence easier. Lemma 1.8. {a n } {b n } if and only if ε N N such that n >N, a n b n < ε. (1.7) Proof. Recall that if and only if means, which means {a n } {b n } ε N N such that n >N, a n b n < ε. (1.8) and ε N > 0 such that n N, a n b n <ε {a n } {b n }. (1.9) Let {c n } be defined as { ak n = 2k c n = b k n = 2k 1 (1.10). Consider any ε>0. Since {a n } {b n }, there is N 1 N such that c n c m <ε for any n,m>n 1. Taking N N satisfying N > N 1 /2+1. Then for any n > N, we have a n = c 2n, b n = c 2n 1 therefore as 2n, 2 n 1>N 1. a n b n = c 2n c 2n 1 < ε (1.11). Consider any ε > 0. Let N 1 N be such that n > N 1, a n b n < ε. Let N 2 N be such that n, m >N 2, a n a m <ε. Let N 3 N be such that n, m >N 3, b n b m <ε. Note that such N 2,N 3 exists because {a n }, {b n } are Cauchy sequences. Now let N =2max {N 1, N 2, N 3 }+1. For any n, m > N, we have a k a l n = 2k, m =2l b c n c m = k b l n = 2k + 1, m =2l+1. (1.12) a k b l n = 2k, m =2l+1 b k a l n = 2k + 1, m =2l As N = 2 max {N 1, N 2, N 3 } + 1, k, l > max {N 1, N 2, N 3 } in every case. Therefore c n c m < ε. The proof ends. Lemma 1.9. ( is indeed an equivalence relation) Let {a n }, {b n }, {c n } be Cauchy sequences. We have {a n } {a n };

4 If {a n } {b n } then {b n } {a n }; If {a n } {b n } and {b n } {c n }, then {a n } {c n }. Proof. We only prove the last claim here. The first two are trivial. Thanks to Lemma 1.8, to show that {a n } {c n } we only need to show for any ε>0, there is N N such that for all n > N, a n c n <ε. Consider any ε > 0. Since {a n } {b n } and {b n } {c n }, there is N 1 N such that for all n > N 1, a n b n < ε/2, and there is N 2 N such that for all n > N 2, b n c n < ε/2. Now take N = max {N 1, N 2 }. We have for any n >N, a n c n a n b n + b n c n <ε/2+ε/2=ε. (1.13) The proof ends. Now we are ready to define R: We put all equivalent Cauchy sequences together and treat it as one object an equivalence class of Cauchy sequences, and call the collection of such equivalence classes R. Definition (Real numbers) The real numbers R is the set of all equivalence classes of Cauchy sequences. Example For example, any rational number {q} is the equivalence class of Cauchy sequences equivalent to the particular Cauchy sequence {a n = q}. 2 is the class of all Cauchy sequences equivalent to {1, 1.4, 1.41, } Is this R the R we want?. Put another way, can we naturally do addition, subtraction, multiplication, division, and taking limit in this newly constructed set R? The answer is yes but the justification is too technical/long to be included here. Instead we simply state the results without proofs. Lemma (Arithmetics in R are well-defined) Let {a n }, {b n } be Cauchy sequences. Then so are {a n ± b n }, {a n b n }, and {a n /b n } if {b n } does not converge to 0. Furthermore, if {ã n }, { b n} are another two sequences that are equivalent to {a n }, {b n }, that is {a n } {ã n }, {b n } { b n}, then {a n ± b n } { ã n ± b n} ; {an b n } { ã n b n} ; {an /b n } { ã n /b n}. (1.14) Theorem R constructed as in the last section satisfies: 1. it is an ordered field; It has the least upper bound property: For any subset E R, if there is an upper bound, that is a R such that a x for every x E, then there is a least upper bound a min R. In other words, the set A = {a R: a is an upper bound for E } has a minimum element. We will see soon that the least upper bound property guarantees that a Cauchy sequence in R converges and indeed has a limit again in R We do not go into details here, it suffices to say that one can naturally do all the arithmetics and comparison (<,>) in an ordererd field That is R is complete.

5 1.2. Limits. From now on we take the existence of R and all its properties for granted. In particular, we assume that the least upper bound property holds Definition. Definition A sequence of real numbers {x n } is said to converge to a real number a R if and only if ε > 0 N N such that n > N, x n a < ε. (1.15) We denote this convergence by x n a, or lim n x n = a. Think: Suppose we have proved ε > 0 N N such that n > 5N, x n a < 20 ε, (1.16) can we conclude x n a? What if we proved m N N N such that n > N 2, x n a < 1 m, (1.17) can we conclude x n a? Remark Definitions and theorems in analysis are unique in the sense that you can make many harmless changes. However it is not possible to tell whether a change is harmless or not without enough understanding. Example Show that k=1 1 k (k + 1) = n ( 1 k 1 k +1 k=1 { x n = } n 1 k=1 converges to 1 as n ր. k (k +1) Proof. We need to show that for any ε >0, there is N N such that for all n > N, To do this we first try to simplify n ) = n 1 k=1 1 k (k + 1) < ε. 1 n 1 n +1 = 1 1 n + 1. (1.18) Now we know how to choose N. Given any ε>0, choose N such that ε >1/N. Then for all n >N, we have n 1 k (k + 1) 1 = 1 n + 1 < 1 < ε. (1.19) N Thus ends the proof. k=1 Example (Nonexistence of limit) Show that {( 1) n } has no limit. Proof. (Proof by contradiction) Assume the contrary, that is ( 1) n a for some a. Then for any ε > 0, there is N N such that for all n >N, ( 1) n a < ε. We take ε =1. There is N N such that for all n > N, ( 1) n a <1. Since this holds for all n >N, in particular it holds for all odd n > N, thus 1 a < 1. On the other hand it also holds for all even n > N, which leads to 1 a < 1. Combining the two together we get But on the other hand we have Therefore 2 < 2. Contradiction! 1 a + 1 a <2. (1.20) 1 a + 1 a = 1 + a + 1 a 1 +a+1 a = 2 = 2. (1.21) Remark Note that if we do not use proof by contradiction, things may get a bit complicated, as we need to show that a R ε 0 >0 N N n > N, ( 1) n a ε 0. (1.22)

6 Example Show that {log n} has no limit. Proof. Again we prove by contradiction. Assume the contrary: that is logn a for some a R. Then there is N N such that for all n > N, log n a < 1. In particular, for all n > N we must have log n < a + 1. Now take N N such that N > exp( a +1) and take an n 0 N such that n 0 > max {N,N }. Then we have log n 0 > log N > a +1. Contradiction Properties of limits. Lemma A sequence can have at most one limit. Proof. We prove by contradiction. Assume x n a and x n b with a b. Without loss of generality we assume b > a. Take ε= b a. There is N 2 1 N such that x n a <ε for all n>n 1 ; There is N 2 N such that x n b <ε. Now take N = max {N 1, N 2 }. Now take any n >N, we have n >N 1, n > N 2 and therefore which combined to give Contradiction! x n a < ε, x n b < ε (1.23) b a= b a b x n + x n a = x n b + x n a < 2ε=b a. (1.24) Proposition (Manipulation of limits) Let x n a, y n b. Then a) x n ± y n a ±b; b) x n y n a b; c) If b 0, then x n /y n a/b. Proof. We only give detailed proof for b). Other cases are left as exercises. To show x n y n a b, all we need is for any given ε>0, find N N such that for all n>n, x n y n a b <ε. First assume that a, b 0. Let N 1 N be such that y n b < b. Now for any given ε > 0, let N 2 be such that x n a < ε, and 4 b N 3 be such that y n b < ε. 2 a Take N = max {N 1, N 2, N 3 }. For any n > N, we have x n y n a b = (x n a) y n + a(y n b) (x n a) y n + a y n b < ε 4 b 2 b + a ε 2 a = ε. When either a or b is (or both are) 0, all we need to show is x n y n 0. The method is the same and the argument is simpler so omitted. Theorem (Comparison of limits) Suppose {x n } and {y n } are convergent sequences. If there is N 0 N such that x n y n for all n N 0, then lim n x n lim n y n. (1.25) Proof. Let x a, y b. We prove by contradiction. Assume a > b. Set ε = a b 2. Then there is N 1 N such that x n a <ε for all n>n 1, while N 2 N such that y n b <ε for all n>n 2. Take n>max {N 1,N 2 }. Then we have x n a x n a > a ε = a +b 2 ; (1.26) y n b + y n b < b+ε= a +b 2. (1.27)

7 But this combined with x n y n gives a + b < a+b, contradiction. 2 2 Example (Important!) Show by an counterexample that the following is false: Suppose {x n }, {y n } are convergent sequences. If there is N 0 N such that x n < y n for all n N 0, then lim n x n < lim n y n. The simplest example is x n = 1/n, y n = 1/n. Theorem (Squeeze Theorem) Let x n a and y n a. Let {w n } be a sequence. Assume that there is N 0 N such that for all n N 0, then a) w n converges. b) w n a. x n w n y n, (1.28) Remark Of course proving w n a suffices. However we would like to emphasize that, the significance of this theorem is that the relation (1.28) forces w n to converge. Proof. For any given ε > 0, let N 1 N be such that x n a < ε for all n > N 1 ; Let N 2 N be such that y n a < ε for all n >N 2. Now let N = max {N 1, N 2 }. For all n > N, we have w n a max { x n a, y n a }<ε. (1.29) Thus ends the proof. Corollary Let {w n } be a sequence. If there is another sequence x n 0 such that w n x n, then w n 0. In particular, if w n 0, then w n 0. The proof is left as exercise. Example Find lim n 2 n sin (n 8 ). We simply apply the above corollary: 2 n 0, therefore the limit is also 0. 2 n sin (n 8 ) 2 n (1.30) Relation to Cauchy sequences. In general, to prove convergence for {x n } with formulas for x n given, we need to do two things: 1. Guess the limit a. 2. Prove that indeed x n a using either definition or properties (see Section below) or both. On the other hand, there are many situations where we do not have explicit formulas for x n and cannot guess what the limit is. The following is the most useful result in those situations. Theorem (Relation to Cauchy sequences) Let {x n } be a sequence. Then {x n } converges to some real number a R if and only if it is a Cauchy sequence. Proof. It s if and only if, so we need to show the only if : x n a for some a R {x n } is Cauchy (1.31)

8 and the if : {x n } is Cauchyx n a for some a R. (1.32) Only if. Given any ε>0, we need to find N N such that for all n,m>n, x n x m <ε. We proceed as follows. For the given ε >0, since x n a, there is N N such that for all n > N. Now for any n, m > N, we have x n a < ε/2 (1.33) which combined to give x n a < ε/2, x m a < ε/2 (1.34) x n x m = (x n a)+(a x m ) x n a + a x m = x n a + x m a < ε. (1.35) If. For this part we need to use the least upper bound property of R. Intuitively, {x n } is Cauchy means they cluster around something, but to show that something is a real number, we need the property that R has no holes. Let the set A={a R: N N, such that a<x n for all n>n }. We first show that A has an upper bound. Since {x n } is Cauchy, there is N 1 N such that x n x m <1 for all n,m>n 1. In particular we have for all n > N 1. Now take x n < x N (1.36) b = max {x 1 +1, x 2 + 1,, x N1 + 1, x N } (1.37) we have b > x n for all n N and clearly b > a for every a A. Using the same method one can show that A is not empty. Thanks to the least upper bound property, we have b min R such that b min a for every a A while for every b < b min there is a A with a >b. We prove the x n b min. Given any ε > 0. We know that there is a A such that a > b min ε. Therefore there is N 1 N such that b min ε < x n for all n > N 1 ; Now we show the existence of N 2 N such that b min + ε > x n for all n > N 2. We prove by contradiction. Assume that for every N N, there is n > N such that x n b min + ε. Since {x n } is a Cauchy sequence, there is N 3 N such that for all n, m > N 3, x n x m < ε/2. For this N 3 we can find l > N 3 with x l b min + ε. Consequently, for all n >N 3, we have x n x l x n x l >b min + ε/2. (1.38) But this means b min + ε/2 A, contradicting b min a for every a A. Finally take N = max {N 1, N 2 }. For every n > N, we have b min ε < x n < b min + ε x n b min < ε. (1.39) Therefore x n b min and the proof for if ends. The above theorem is most useful when the sequence is given iteratively. Example Let x 0 >2. Define x n iteratively by Prove that x n 2. x n+1 = x n x n x n. (1.40) Proof. The idea is to show that it is Cauchy. Once this is done, we can take limits of both sides to reach (denote the limit by a): a = a a2 2 2a a2 = 2 a = ± 2. (1.41)

9 From this we see that we need to prove the following: First show that x n > 0. We use mathematical induction. Let P(n) denote the statement x n > 0. Mathematical induction consists of two steps: 1. P(0) is true. 1.5 We have x 0 > 2 >0. 2. If P(m) is true then P(m + 1) is true. We have Therefore if x m > 0, x m+1 > 0. x m+1 = x m x m 2 2 = x m (1.42) 2 x m 2 x m Since a ratio is involved, we need to show x n 0 and a 0. We do this through showing x 2 n 2 for all n N. This can be done directly as follows: ( x 2 n 2= x n 1 x ) 2 n ( ) 2 xn ( ) 2 xn = 2 = 0. (1.43) 2 x n 1 2x n 1 2x n 1 x n is Cauchy. The basic idea is to show that x n x n+1 M r n for some 0 < r < 1 and some M > 0 (Why this is enough is left as exercise). Taking difference of we have x n+1 = x n x n 2 2 2x n = x n and x n = x n 1 x 2 n 1 2 = x n 1 x n 2 x n x n 1 (1.44) [ ] 1 x n+1 x n = 2 1 (x n x n 1 ). (1.45) x n x n 1 Therefore x n+1 x n = x n x n 1 x n x n 1. (1.46) As x n > 2 we have xn x n 1 2 so x n x. This leads to n 1 2 x n+1 x n 1 2 x n x n 1 1 ( ) n x n 1 x n 2 x 1 x 0. (1.47) 2 Since x n is Cauchy, there is a R such that x n a. By (1.41) we have a=± 2. Since xn >0, we conclude a= 2 (using Comparison Theorem 1.22). Remark The above is a very effective way to compute Understanding convergence. In this section we understand what convergence means. Or more precisely, we understand what happens when a sequence is not convergent. Turns out, there are only two situations where a sequence does not converge: 1. The sequence is unbounded. 2. The sequence is oscillating and the amplitude does not tend to 0. Definition (Boundedness) A sequence {x n } is said to be bounded above if there is a number M R such that x n M for all n, bounded below if there is a number M R such that x n M for all n, bounded if there is a number M R such that x n M for all n Because we start from x 0.

10 Lemma (Relation between boundedness) {x n } is bounded if and only if it is bounded above and below. Proof. If. If {x n } is bounded above and below, then there are M 1, M 2 R such that M 1 x n M 2 for all n N. Now take M = max { M 1, M 2 }. We have for all n N. M M 1 M 1 x n M 2 M 2 M (1.48) Only if. If {x n } is bounded, then there is M R such that M x n M. Thus {x n } is bounded both above and below. Lemma If x n a, then x n is bounded. That is every convergent sequence is bounded. Proof. Take ε=1. Since x n a, there is N N such that for all n>n, we have x n a <ε. Thus for all n > N, we have Now set We have x n M for all n N. Thus ends the proof. x n a + x n a < a + 1. (1.49) M = max { x 1,, x N, a + 1}. (1.50) Note. Spot the mistake in the following proof: Take ε = a. Since x n a,... (the remaining the same as that in the above proof) Definition (Subsequence) A subsequence of a sequence {x n } n N {x nk } k N, where each n k N with n 1 <n 2 < n 3 <. is a sequence of the form It is clear that a subsequence of a subsequence is a subsequence of the original sequence. Lemma If x n a, then every of its subsequences also converge to a. Proof. Let {x nk } be one subsequence. Given any ε > 0, let N N be such that for all n > N, x n a < ε. Now let K N be such that for all k > K, n k > N. With such K we see that for all k > K, we have x nk a < ε. (1.51) Thus ends the proof. On the other hand, we have the following: Lemma Let {x n } be a sequence. If all its subsequences converge to the same a R, then x n a. Proof. Assume {x n } does not converge to a. All we need to do is to find one subsequence which does not converge to a 1.6. As {x n } does not converge to a, we have ε 0 > 0 N N n > N, x n a > ε 0. (1.52) Now first take N =1. There is n 1 > 1 such that x n1 a > ε 0. Next take N = n 1. There is n 2 >N =n 1 such that x n2 a > ε 0. Next take N =n 2 and do the same and so on. This way we obtain a subsequence {x nk } satisfying x nk a > ε 0 for all k N. This subsequence does not converge to a. We need one more result to fully understand convergence of sequences Whether it converges to something else or does not converge at all does not matter here.

11 1.3. Bolzano-Weierstrass The theorem and its consequences. We first state the theorem and discuss its significance. The proof is postponed to Section Theorem (Bolzano-Weierstrass) Let {x n } be bounded a sequence of real numbers. Then there is a converging subsequence. Remark The theorem not only tell us something about simple cases, such as ( 1) n for which we can easily get a convergent subsequence, it also tell us sequences like {sin n} also has convergent subsequence(s). 1.7 Theorem (Classification of sequences) Let {x n } be a sequence of real numbers. Then one of the following is true: a) x n converges; b) {x n } is not bounded. c) There are two convergent subsequences with different limits. Remark a) and b),c) are clearly mutually exclusive. On the other hand both b) c) may be true for 1 n = 4k + 1 n n = 4k + 2 a single sequence. For example let a n = for k N. 1 n = 4k + 3 n n = 4k + 4 Proof. It is clear that a) and b) are mutually exclusive. The only thing left to show is that if {x n } is bounded and does not converge, then it has two converging subsequences with different limits. Since {x n } is bounded, by the Bolzano-Weierstrass theorem there is a converging subsequence. We denote its limit by a. Since x n a, by definition there must be ε 0 > 0 such that for every N N there is n > N with x n a > ε 0. From this we can get a subsequence satisfying x nk a > ε 0 as follows: i. Take N =1. There is x n1 a > ε 0 ; ii. Take N =n 1. Find x n2 a > ε 0 ; iii. Take N =n 2,... Now apply the Bolzano-Weierstrass theorem to this subsequence. We see that there is a converging subsequence (to this subsequence), called { } x nkl (l = 1, 2, 3, ). Let x nkl a as l. We show that a a. Assume the contrary. Then x nkl a. By definition there is N N such that xnkl a < ε0 for all l > N. But this contradicts the fact that x nkl are chosen from x nk which satisfies x nk a > ε 0 for all k N Monotone sequences. To prove the Bolzano-Weierstrass theorem, we first study monotone sequences. Definition A sequence {x n } is increasing if x n+1 x n for all n (strictly increasing of x n+1 > x n for all n N); A sequence is decreasing if x n+1 x n for all n (strictly decreasing if x n+1 <x n for all n N); A sequence is monotone if it is either increasing or decreasing. Convergence results when monotonicity meets boundedness In fact, for every 1 a 1, there is a subsequence of {sinn} convergent to a.

12 Lemma Let {x n } be monotone increasing (decreasing) and bounded above (below). Then x n a for some a R. Proof. Since {x n } is bounded above. There is M R such that x n M for all n N. We now show that x n is Cauchy through proof by contradiction. Assume x n is not Cauchy, then there is ε 0 > 0 such that for every N N, there are n, m >N with x n x m > ε 0. Now take N = 1. We find n 2 > n 1 > 1 with x n2 x n1 > ε 0. Next take N = n 2, we have n 4 > n 3 > n 2 with x n4 x n3 > ε 0. Doing this repeatedly, we obtain a (still increasing) subsequence x nk such that x n2k x n2k 1 > ε 0. Since this subsequence is still increasing, x n2k (x n2k x n2k 1 )+(x n2k 2 x n2k 3 )+ + (x n2 x n1 )+x n1 > kε 0 + x n1. (1.53) Taking k > (M x n1 )/ε 0 we reach x n2k >M. Contradiction. Remark An alternative proof is as follows: Let A={a R:a<x n for some n N}. We can show that A has an upper bound and is nonempty. Applying the least upper bound property of R, there is b min R such that b min a for all a A, and for every b<b min, there is a A satisfying a>b. Then prove x n b min. This approach is left as exercise Proof of Bolzano-Weierstrass. All we need to do is to find a monotone subsequence from {x n }. Proof. (of Bolzano-Weierstrass) Consider the following subsequences of {x n }: x m,x m+1,x m+2, are only two cases:. There For every such sequence, there is a smallest element: x n1 = x 1, x nk : =min {x nk 1 +1, x nk 1 +2, }. (1.54) In this case we know that {x nk } is a subsequence of {x n } and it is increasing and bounded above. Applying Lemma 1.42 to this subsequence we see that it converges to some a R. There is one m, such that there is no smallest element in {x nm+1, x nm+2, }. Set x n1 = x nm+1. Set n 2 to be the smallest number that x n2 < x n1, that is x i x n1 for all n 1 i < n 2. This can be done because there is no smallest number. Set n 3 to be the smallest number that x n3 < x n2, and so on. This way we obtained a decreasing subsequence which is bounded below. Applying Lemma 1.42 to this subsequence we see that it converges to some a R.

13 1.4. Infinity Limits. We have seen that a sequence has to be in exactly one of the following three situations: 1. It converges to a real number; 2. It oscillates with non-vanishing amplitude; 3. It is unbounded. In this section we take a closer look at the third situation. Example Consider the following two sequences x n = n; y n = n sin (n ). (1.55) Both are unbounded. However they are different: {x n } has a very predictable behavior as n while {y n } does not. Definition A sequence {x n } is said to diverge to +, denoted x n +, if for any M R there is N N such that for all n >N, x n > M. Or in formal logic M R N N such that n > N, x n > M. (1.56) Similarly, a sequence {x n } is said to diverge to, denoted x n, if Note. Often the + in + is omitted. M R N N such that n > N, x n < M. (1.57) Definition R together with ± is called extended real numbers. That is extended real numbers is the set R {, }. Most results involving finite limits can be readily extended to include the cases ±, as long as these rules are followed: x+ =, x =, x R (1.58) x =, x ( )=, x > 0 (1.59) x =, x ( )=, x < 0 (1.60) + =, = (1.61) = ( ) ( )= ( )=( ) ( ) = (1.62) and the following are not involved: or 0 (+ ) or 0 ( ). Proposition (Extension of Proposition 1.21) Let x n a, y n b where a,b are extended real numbers. Then a) x n ± y n a ±b; b) x n y n a b; c) If b 0, then x n /y n a/b. Proof. We only prove the product case and leave other cases as exercises. When both a, b R, the proof has been done in Proposition Here we need to study the two new cases: a, b = ± and a R, b = ± or a = ±, b R. Case 1. We only prove for a = b =. (The other three sub-cases can be proved similarly.) As =, we need to show that for every M R, there is N N such that for all n>n, x n y n >M. For every given M R, since x n, there is N 1 N such that for all n > N 1, x n > M ; Similarly there is N 2 N such that for all n >N 2, y n > M. Now take N = max {N1, N 2 }. For any n > N, we have x n y n > M M = M M. Case 2. We only prove for a >0, b= (The other seven sub-cases can be proved similarly). We need to show that for every M R, there is N N such that for all n > N, x n y n > M.

14 Since x n a > 0, there is N 1 N such that for all n > N 1, x n > a/2. On the other hand, as y n, there is N 2 N such that for all n > N 2, y n > 2 M /a. Now take N = max {N 1, N 2 }, for every n > N we have x n y n > (a/2)(2 M /a)= M M. Example The reason why or 0 (+ ) or 0 ( ) should not be involved is that in those cases the results depend on how is approached and consequently differ case by case. For example, 1/n 2 0, n, n 3 but (1/n 2 ) n 0 while (1/n 2 ) n 3. So 0 cannot be defined. As an exercise, examples should be constructed for other cases. Theorem (Extension of Comparison Theorem 1.22) Let x n a, y n b with a, b extended real numbers. If there is N 0 N such that x n y n for all n N 0, then lim x n lim y n. (1.63) n n Proof. Here we only need to deal with three cases: a =, a R, a = +. a =. As b for every extended real number b, the proof ends. a R. If b R, the conclusion follows from Theorem If b =, the conclusion holds. We only need to show that b = cannot happen. Assume the contrary. As x n a R, there is N 1 N such that for all n >N 1, x n > a 1. On the other hand, as y n, there is N 2 N such that for all n > N 2, y n < a 1. Take N = max {N 1, N 2, N 0 }. For every n > N, we have y n < a 1 < x n while at the same time by assumptions in the theorem, x n y n. Contradiction. a=. We need to show that b= or b R would lead to contradiction. The proof is very similar to that of the previous case and is left as exercise. Theorem (Extension of Squeeze Theorem 1.24) Let x n a and y n a where a is an extended real number. Let {w n } be a sequence. Assume that there is N 0 N such that for all n N 0, then w n a. x n w n y n. (1.64) Proof. We only need to prove the following two cases: a = and a =. a=. For any M R, there is N 1 N such that x n >M for all n>n 1. Now take N = max {N 0,N 1 }. Then we have for all n >N, w n x n > M. Therefore w n. a=. For any M R there is N 1 N such that y n <M for all n>n 1. Now take N = max {N 0,N 1 }. Then we have for all n >N, w n y n <M. Therefore w n. Theorem (Extension of Subsequence Lemmas 1.35, 1.36) Let {x n } be a sequence. a) If x n a, then every subsequence a; b) If every subsequence converges to the same a, then x n a. Proof. Since a R has already been settled in Lemmas 1.35, 1.36, we only need to deal with a= ±. We only prove for a= here. The case a = can be proved similarly and is left as exercise. a) For any given M R, there is N N such that for all n > N, x n > M. Let {x nk } be an arbitrary subsequence. Since n 1 <n 2 <n 3 < there is K N such that for all k >K, n k >N, and consequently x nk > M for all k >K. b) We prove by contradiction. Assume that all of its subsequences but x n. Then there is M 0 R such that for every N N there is n>n such that x n M 0. Take N =1, we obtain x n1 M 0. Now take N =n 1, we obtain n 2 >n 1 with x n2 M 0. Doing this again and again we obtain a subsequence x nk with x nk M 0. There are two cases: There is M R such that x nk M for all k. In this case we can apply Bolzano-Weierstrass to obtain a convergent subsequence x nkl. As M x nkl M 0, the comparison theorem 1.22 leads to x nkl b for some M b M 0.

15 For every M R there is k N such that x nk < M. Take M = 1. We have x nk1 < 1. Now take M = x nk1 1, we have x nk2 < x nk1 1 < 2. Continue doing this we have a subsequence x nkl satisfying x nkl < l. Thus x nkl. Think: There is no way to extend Relation to Cauchy sequence theorem 1.28 here. Putting all the things we understood so far together, we reach Theorem (Extension of Classification Theorem 1.39) Let {x n } be a sequence. Then either x n a for some extended real number a, or 1 2 there are two subsequences x nk b 1, x nk b 2 for extended real numbers b 1 b 2.

### x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### Undergraduate 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

### CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

### MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

### PART I. THE REAL NUMBERS

PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS

### CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

### CHAPTER 3 Numbers and Numeral Systems

CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,

### We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

### Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Taylor Polynomials and Taylor Series Math 126

Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will

### n k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...

6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence

### 2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

### APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

### The Foundations: Logic and Proofs. Chapter 1, Part III: Proofs

The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments

### God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

### THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

### Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

### Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

### The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

### Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 11

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According

### Vieta s Formulas and the Identity Theorem

Vieta s Formulas and the Identity Theorem This worksheet will work through the material from our class on 3/21/2013 with some examples that should help you with the homework The topic of our discussion

### Real Numbers and Monotone Sequences

Real Numbers and Monotone Sequences. Introduction. Real numbers. Mathematical analysis depends on the properties of the set R of real numbers, so we should begin by saying something about it. There are

### (x + a) n = x n + a Z n [x]. Proof. If n is prime then the map

22. A quick primality test Prime numbers are one of the most basic objects in mathematics and one of the most basic questions is to decide which numbers are prime (a clearly related problem is to find

### Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

### MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

### Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

### Metric Spaces. Chapter 7. 7.1. Metrics

Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

### Some Notes on Taylor Polynomials and Taylor Series

Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

### Basic Proof Techniques

Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### Mathematical Methods of Engineering Analysis

Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................

### 13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

### 1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

### x a x 2 (1 + x 2 ) n.

Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number

### So let us begin our quest to find the holy grail of real analysis.

1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

### HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

### P (A) = lim P (A) = N(A)/N,

1.1 Probability, Relative Frequency and Classical Definition. Probability is the study of random or non-deterministic experiments. Suppose an experiment can be repeated any number of times, so that we

### 6.3 Conditional Probability and Independence

222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

### 0.8 Rational Expressions and Equations

96 Prerequisites 0.8 Rational Expressions and Equations We now turn our attention to rational expressions - that is, algebraic fractions - and equations which contain them. The reader is encouraged to

### FIXED POINT ITERATION

FIXED POINT ITERATION We begin with a computational example. solving the two equations Consider E1: x =1+.5sinx E2: x =3+2sinx Graphs of these two equations are shown on accompanying graphs, with the solutions

### CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

CONTINUED FRACTIONS AND FACTORING Niels Lauritzen ii NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS, DENMARK EMAIL: niels@imf.au.dk URL: http://home.imf.au.dk/niels/ Contents

### No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

### Section 3 Sequences and Limits, Continued.

Section 3 Sequences and Limits, Continued. Lemma 3.6 Let {a n } n N be a convergent sequence for which a n 0 for all n N and it α 0. Then there exists N N such that for all n N. α a n 3 α In particular

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### MATH 2300 review problems for Exam 3 ANSWERS

MATH 300 review problems for Exam 3 ANSWERS. Check whether the following series converge or diverge. In each case, justify your answer by either computing the sum or by by showing which convergence test

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

### The last three chapters introduced three major proof techniques: direct,

CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements

### U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### Open and Closed Sets

Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.

### Lectures 5-6: Taylor Series

Math 1d Instructor: Padraic Bartlett Lectures 5-: Taylor Series Weeks 5- Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,

### CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

### Answer Key for California State Standards: Algebra I

Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.

### PRIME FACTORS OF CONSECUTIVE INTEGERS

PRIME FACTORS OF CONSECUTIVE INTEGERS MARK BAUER AND MICHAEL A. BENNETT Abstract. This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in

### Indiana State Core Curriculum Standards updated 2009 Algebra I

Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and

### Zeros of a Polynomial Function

Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### Math212a1010 Lebesgue measure.

Math212a1010 Lebesgue measure. October 19, 2010 Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous theses in the history of mathematics.

### a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### Sequences and Series

Sequences and Series Consider the following sum: 2 + 4 + 8 + 6 + + 2 i + The dots at the end indicate that the sum goes on forever. Does this make sense? Can we assign a numerical value to an infinite

### Solving Linear Systems, Continued and The Inverse of a Matrix

, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing

### Metric Spaces Joseph Muscat 2003 (Last revised May 2009)

1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of

### Set theory as a foundation for mathematics

Set theory as a foundation for mathematics Waffle Mathcamp 2011 In school we are taught about numbers, but we never learn what numbers really are. We learn rules of arithmetic, but we never learn why these

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

### Worksheet on induction Calculus I Fall 2006 First, let us explain the use of for summation. The notation

Worksheet on induction MA113 Calculus I Fall 2006 First, let us explain the use of for summation. The notation f(k) means to evaluate the function f(k) at k = 1, 2,..., n and add up the results. In other

### THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

### An example of a computable

An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

### Equations, Inequalities, Solving. and Problem AN APPLICATION

Equations, Inequalities, and Problem Solving. Solving Equations. Using the Principles Together AN APPLICATION To cater a party, Curtis Barbeque charges a \$0 setup fee plus \$ per person. The cost of Hotel

### MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish

### MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

### Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March

### 11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

### Day 2: Logic and Proof

Day 2: Logic and Proof George E. Hrabovsky MAST Introduction This is the second installment of the series. Here I intend to present the ideas and methods of proof. Logic and proof To begin with, I will

### This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but

### 1. The algebra of exponents 1.1. Natural Number Powers. It is easy to say what is meant by a n a (raised to) to the (power) n if n N.

CHAPTER 3: EXPONENTS AND POWER FUNCTIONS 1. The algebra of exponents 1.1. Natural Number Powers. It is easy to say what is meant by a n a (raised to) to the (power) n if n N. For example: In general, if

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### Lecture 6. Inverse of Matrix

Lecture 6 Inverse of Matrix Recall that any linear system can be written as a matrix equation In one dimension case, ie, A is 1 1, then can be easily solved as A x b Ax b x b A 1 A b A 1 b provided that

### 4.5 Linear Dependence and Linear Independence

4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then

### Taylor Series and Asymptotic Expansions

Taylor Series and Asymptotic Epansions The importance of power series as a convenient representation, as an approimation tool, as a tool for solving differential equations and so on, is pretty obvious.

### CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

### Algebraic and Transcendental Numbers

Pondicherry University July 2000 Algebraic and Transcendental Numbers Stéphane Fischler This text is meant to be an introduction to algebraic and transcendental numbers. For a detailed (though elementary)

### MATH 22. THE FUNDAMENTAL THEOREM of ARITHMETIC. Lecture R: 10/30/2003

MATH 22 Lecture R: 10/30/2003 THE FUNDAMENTAL THEOREM of ARITHMETIC You must remember this, A kiss is still a kiss, A sigh is just a sigh; The fundamental things apply, As time goes by. Herman Hupfeld

### PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

### Set theory as a foundation for mathematics

V I I I : Set theory as a foundation for mathematics This material is basically supplementary, and it was not covered in the course. In the first section we discuss the basic axioms of set theory and the

### LEARNING OBJECTIVES FOR THIS CHAPTER

CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What