Chapter 2. Real Numbers. 1. Rational Numbers
|
|
- Sophia Ramsey
- 5 years ago
- Views:
Transcription
1 Chapter 2. Real Numbers 1. Rational Numbers A commutative ring is called a field if its nonzero elements form a group under multiplication. Let (F, +, ) be a filed with 0 as its additive identity element and 1 as its multiplicative identity element. We always assume that 1 0. For b F, its additive inverse is denoted by b. The subtraction in F is defined as follows: a b := a + ( b), a, b F. For b F \ {0}, its multiplicative inverse is denoted by b 1. The division in F is defined as follows: a/b := a b := ab 1, a F, b F \ {0}. For n IN 0 and a F, na is defined recursively: na := 0 for n = 0 and (n + 1)a := na + a. Recall that ( Z, +, ) is a commutative ring with 1 as its (multiplicative) identity element. But any integer m Z \ {0, 1, 1} has no multiplicative inverse in Z. Thus, it is desirable to extend the ring ( Z, +, ) to a field. Let us introduce a relation in the set Z IN. For two elements (m, n) and (p, q) in Z IN, we define (m, n) (p, q) if mq = np. We claim that it is an equivalence relation. Clearly, this relation is reflexive and symmetric. Suppose (m, n) (p, q) and (p, q) (r, s). Then mq = np and ps = rq. Hence, mqs = nps = nrq. Since q 0, it follows that ms = nr, that is, (m, n) (r, s). This shows that the relation is transitive. For (m, n) Z IN, we use m n or m/n to denote the equivalence class of (m, n): m := {(r, s) Z IN : rn = sm}. n Then m/n = m /n if and only if mn = nm. Let Q be the set of equivalence classes. An element of Q is called a rational number. The addition in Q is defined by the rule m n + p q mq + np :=. nq The addition is well defined. Indeed, if m/n = m /n and p/q = p /q, then mn = m n and pq = p q. It follows that (mq + np)(n q ) = (m q + n p )(nq). It is easily seen that the addition is associative and commutative. Moreover, 0/1 is the identity element for addition. Each element m/n Q has an addictive inverse: m n + m n = m n + m n =
2 Thus, ( Q, +) is an abelian group. The multiplication in Q is defined by the rule m n p q := mp nq. If m/n = m /n and p/q = p /q, then mn = m n and pq = p q. It follows that (mp)(n q ) = (m p )(nq). So the multiplication is well defined. It is easily seen that the multiplication is associative and commutative. Moreover, the multiplication is distributive with respect to addition: m ( p n q + r ) = m s n p q + m n Clearly, 1/1 is the identity element for multiplication. If m/n 0/1 and p/q 0/1, then (m/n)(p/q) 0/1. Furthermore, if m/n Q and m > 0, then n/m is its multiplicative inverse; if m/n Q and m < 0, then ( n)/( m) is its multiplicative inverse. We conclude that ( Q, +, ) is a field. Let ϕ be the mapping from Z to Q given by ϕ(m) = m/1, m Z. Then ϕ is injective. We have ϕ(m + n) = ϕ(m) + ϕ(n) and ϕ(mn) = ϕ(m)ϕ(n) for all m, n Z. Thus, the ring ( Z, +, ) is embedded into the field ( Q, +, ) via the mapping ϕ. We identify ϕ( Z) with Z and write m for m/1. In particular, 0 = 0/1 is the additive identity element, and 1 = 1/1 is the multiplicative identity element. For two elements m/n and p/q in Q, we write m/n p/q if mq np. is a linear ordering in Q. r s. Then Indeed, it is obvious that is reflexive and antisymmetric. Suppose m/n p/q and p/q r/s, where q, s IN. Then mq np and ps qr; hence mqs nps nqr. Since mqs nqr and q > 0, we obtain ms nr, i.e., m/n r/s. This shows that is transitive. Moreover, either mq np or np mq. So is a linear ordering. Furthermore, if a, b Q and a b, then a + c b + c for all c Q, and ac bc for all c 0. A field (F, +, ) with a linear ordering is called an ordered field if the following two conditions are satisfied for all x, y, z F : (a) x y implies x + z y + z; (b) if z 0, then x y implies xz yz. Thus, ( Q, +, ) with its natural ordering is an ordered field. Let F be an ordered field. An element a of F is said to be positive if a > 0, and it is said to be non-negative if a 0. Suppose x, y F. Then x < y implies x + z < y + z for all z F and xz < yz for all z > 0. Moreover, if x 0, then x 2 = x x > 0. Indeed, this is true if x > 0. If x < 0, then 0 = ( x)+x < ( x)+0 = x, and hence x 2 = ( x)( x) > 0. In particular, 1 = 1 2 > 0. 2
3 An ordered field F is said to be archimedean if for every pair of positive elements x and y in F, there is a positive integer k such that kx > y. The ordered field Q is an archimedean field. Indeed, if x and y are two positive elements in Q, then x = m/n and y = p/q for some m, n, p, q IN. There exists a positive integer k such that kmq > np. Consequently, kx = km/n > p/q = y. Although the rational numbers form a rich algebraic system, they are inadequate for the purpose of analysis because they are, in a sense, incomplete. For example, there is no rational number r such that r 2 = 2. In order to prove this statement, it suffices to show that m 2 2n 2 for any pair of positive integers m and n. Write m = 2 j p and n = 2 k q, where j, k IN 0 and p and q are odd numbers. Then we have m 2 = 2 2j p 2 and 2n 2 = 2 2k+1 q 2. Note that p 2 and q 2 are odd numbers. Moreover, 2j 2k + 1, since one is an even number and the other is an odd number. There are two possibilities: 2j > 2k + 1 or 2j < 2k + 1. If 2j > 2k + 1, then 2 2j 2k 1 p 2 is an even number and q 2 is an odd number. Hence, 2 2j 2k 1 p 2 q 2. It follows that m 2 = 2 2j p 2 2 2k+1 q 2 = 2n 2. If 2j < 2k + 1, then p 2 2 2k+1 2j q 2, and thereby m 2 2n 2. Let A be the set {r Q : r 2 2}. Then A has no least upper bound in Q. 2. Real Numbers The absolute value of a rational number r is defined by r := { r if r 0, r if r < 0. For r, s Q, we have rs = r s and r + s r + s. A sequence (r n ) n=1,2,... of rational numbers is said to converge to a rational number r if, for every rational number ε > 0, there exists a positive integer N(ε) such that r n r < ε for all n N(ε). In this case, we say that r is the limit of the sequence and write lim r n = r. If a sequence of rational numbers converges, then it has a unique limit. convergent sequence is bounded. Also, a A sequence (r n ) n=1,2,... of rational numbers is called fundamental if, for every rational number ε > 0, there exists a positive integer N(ε) such that r m r n < ε whenever m, n N(ε). A sequence of rational numbers that converges (to a rational number) is fundamental. Also, a fundamental sequence of rational numbers is bounded. 3
4 Two fundamental sequences (r n ) n=1,2... and (s n ) n=1,2... are said to be equivalent if lim (r n s n ) = 0. We write (r n ) n=1,2... (s n ) n=1,2... when (r n ) n=1,2... and (s n ) n=1,2... are equivalent. It is easy to verify that this is indeed an equivalence relation. An equivalence class of a fixed fundamental sequence of rational numbers is called a real number. Thus, a real number is represented by a fundamental sequence (r n ) n=1,2... of rational numbers. Such a representation is not unique. If (s n ) n=1,2... is another representation for the same real number, then we must have lim (r n s n ) = 0. Let IR denote the set of real numbers. We define addition and multiplication on IR as follows. Suppose x and y are real numbers represented by fundamental sequences (r n ) n=1,2,... and (s n ) n=1,2,... of rational numbers, respectively. Then x + y is defined to be the real number represented by (r n + s n ) n=1,2,... and xy is the real number represented by (r n s n ) n=1,2,.... If (r n ) n=1,2... (r n) n=1,2... and (s n ) n=1,2... (s n) n=1,2..., then lim (r n r n) = 0 and lim (s n s n) = 0. It follows that [ lim (rn + s n ) (r n + s n) ] = 0 and lim (r ns n r ns n) = 0. Therefore, the addition and multiplication are well defined. Evidently, the addition and multiplication are associative and commutative. For r Q, let ϕ(r) be the real number represented by the sequence (r n ) n=1,2..., where r n = r for all n IN. Then we have ϕ(r + s) = ϕ(r) + ϕ(s) and ϕ(rs) = ϕ(r)ϕ(s) for r, s Q. Clearly, ϕ is an injective mapping from Q to IR. We identify ϕ(r) with r. Thus, Q is embedded into IR via the mapping ϕ. It is easily seen that 0 is the identity for addition. Suppose x is a real number represented by a fundamental sequence (r n ) n=1,2,... of rational numbers. Let x be the real number represented by ( r n ) n=1,2,.... Then ( x) + x = 0. This shows that (IR, +) is an abelian group. For three real numbers x, y, z IR, we have (x + y)z = xz + yz. In other words, the multiplication is distributive with respect to addition. Thus, (IR, +, ) is a commutative ring with 1 as its (multiplicative) identity. Suppose x IR \ {0} and x is represented by a fundamental sequence (r n ) n=1,2,... of rational numbers. Then there exists a rational number ε > 0 and a positive integer N such that r n ε for all n N. Indeed, if this is not true, then there exists a sequence (n k ) k=1,2,... of positive integers such that n k < n k+1 and r nk < 1/k for all k IN. It follows that lim k r nk = 0 and thereby x = 0. Thus, r n ε for all n N. We define x 1 to be the real number represented by the sequence (s n ) n=1,2,..., where s n = 1 for n < N and s n = rn 1 for n N. Clearly, (s n ) n=1,2,... is a fundamental sequence. We have x 1 x = 1. This shows that (IR, +, ) is a field. 4
5 A sequence (r n ) n=1,2,... of rational numbers is said to be eventually non-negative (nonpositive) if there exists a positive integer N such that x n 0 (x n 0) for all n N. A real number z is said to be non-negative and written z 0, if z is represented by a fundamental sequence of rational numbers that is eventually non-negative. For two real numbers x and y, we write x y if y x 0. The relation is a linear ordering. Indeed, this relation is reflexive, since x x for all x IR. Let x, y, z IR. If x y and y z, then y x 0 and z y 0. It follows that z x = (z y) + (y x) 0. Hence, is transitive. Moreover, if x y and y x, then both y x and x y are non-negative. Consequently, y x and x y are represented by fundamental sequences (r n ) n=1,2... and (s n ) n=1,2,... of rational numbers respectively such that both sequences are eventually non-negative. In particular, (r n ) n=1,2... and ( s n ) n=1,2,... are equivalent. It follows that lim (r n + s n ) = lim (r n ( s n )) = 0. There exists a positive integer N such that 0 r n r n + s n for all n N. Hence, lim r n = 0. This shows x y = 0, i.e., x = y. Thus, the relation is antisymmetric. It remains to prove that any two real numbers x and y are comparable. Suppose that y x is represented by a fundamental sequence (r n ) n=1,2... of rational numbers. If the sequence is eventually non-negative, then x y; if the sequence is eventually non-positive, then y x. If the sequence is neither eventually non-negative nor eventually non-positive, then both the sets {n IN : r n 0} and {n IN : r n 0} are infinite. Since (r n ) n=1,2... is fundamental, for every rational number ε > 0, there exists a positive integer N such that r m ε < r n < r m + ε for all m, n > N. But there exist m 1, m 2 > N such that r m1 0 and r m2 0. Therefore, ε r m1 ε < r n < r m2 + ε ε. Thus, ε < r n < ε for all n > N. It follows that y x = 0 and x = y. We have proved that the relation is a linear ordering. Theorem 2.1. The field (IR, +, ) with the ordering is an Archimedean ordered field. Proof. Let x, y, z IR. If x y, then (y + z) (x + z) = y x 0; hence x + z y + z. If, in addition, z 0, then yz xz = (y x)z 0. Hence, xz yz for all z 0. This shows that (IR, +, ) with the ordering is an ordered field. Suppose x > 0 and y > 0. Then u := x/y > 0. The real number u is represented by a fundamental sequence (r n ) n=1,2,... of rational numbers. By what has been proved before, there exists a rational number ε > 0 and a positive integer N such that r n ε for all n N. Since u > 0, the set {n IN : r n < 0} is finite. Hence, the sequence (r n ε) n=1,2,... is eventually non-negative. This shows u ε. For the rational number ε > 0, there exists a positive integer k such that kε > 1. Consequently, ku kε > 1. It follows that kx > y. Therefore, (IR, +, ) with the ordering is an Archimedean ordered field. As a corollary of the above theorem, there exists a rational number between any 5
6 two distinct real numbers. Let x and y be two real numbers such that x < y. By the Archimedean property, there exists a positive integer k such that k(y x) > 2. It follows that y x > 2/k. Let m be the least integer such that m kx. Then x m/k < (m+1)/k. On the other hand, (m 1)/k < x implies (m + 1)/k < x + 2/k < y. Thus, r := (m + 1)/k is a rational number such that x < r < y. Theorem 2.2. Every nonempty subset of IR bounded above has the least upper bound. Proof. Suppose that X is a nonempty subset of IR bounded above. Let B := {b Q : b x for all x X} and A := Q \ B. Then both A and B are nonempty. Moreover, a < b whenever a A and b B. We define two sequences (a n ) n=1,2,... and (b n ) n=1,2,... recursively as follows. Choose a 1 A and b 1 B. Suppose n IN. If (a n + b n )/2 A, set a n+1 := (a n + b n )/2 and b n+1 := b n ; if (a n + b n )/2 B, set a n+1 := a n and b n+1 := (a n + b n )/2. Then a n A, b n B, and b n+1 a n+1 = (b n a n )/2. By induction on n, we obtain b n a n = (b 1 a 1 )/2 n 1 for all n IN. Consequently, lim (b n a n ) = 0. Moreover, we have a n+1 a n (b n a n )/2. It follows that a n+1 a n (b 1 a 1 )/2 n. Hence, for n, k IN we have k 1 a n+k a n a n+j+1 a n+j j=0 k 1 j=0 b 1 a 1 2 n+j < b 1 a 1 2 n 1. For every rational number ε > 0, there exists some N IN such that (b 1 a 1 )/2 N 1 < ε. Hence, for n > N and k 1 we obtain a n+k a n < ε. This shows that (a n ) n=1,2,... is a fundamental sequence. For the same reason, (b n ) n=1,2,... is also a fundamental sequence. These two sequences are equivalent. Let u be the (unique) real number represented by these two sequences of rational numbers. We claim that u is the least upper bound of X. To justify our claim, it suffices to prove the following two statements: (1) u x for all x X; (2) if y is an upper bound for X, then u y. Suppose that (1) is not true. Then u < x for some x X. There exists a rational number r such that u < r < x. We have r b n for all n IN. Hence, (b n r) n=1,2,... is a non-negative sequence of rational numbers. Consequently, u r 0, i.e., u r. This contradiction verifies statement (1). Suppose that (2) is not true. Then u > y for some upper bound y for X. There exists a rational number s such that y < s < u. We have a n s for all n IN. Hence, (s a n ) n=1,2,... is a non-negative sequence of rational numbers. Consequently, s u 0, i.e., u s. This contradiction verifies statement (2). In light of (1) and (2), we conclude that u is the least upper bound of X. 6
7 For a pair of real numbers a and b, we define (a, b) := {x IR : a < x < b}, [a, b) := {x IR : a x < b}, [a, b] := {x IR : a x b}, (a, b] := {x IR : a < x b}. The set (a, b) is clled an open interval, the set [a, b] is called a closed interval, and the sets [a, b) and (a, b] are called half-open (or half-closed) intervals. We introduce two symbols and. The ordering in IR can be extended to IR := IR {, } by defining < a < for all a IR. Then we have (, ) = IR and (a, ) = {x IR : x > a}, (, b) = {x IR : x < b}, [a, ] = {x IR : x a}, (, b] = {x IR : x b}. 3. Limits of Sequences The absolute value of a real number x is defined by x := { x if x 0, x if x < 0. For x, y IR, we have xy = x y and x + y x + y. A sequence (x n ) n=1,2,... of real numbers is said to converge to a real number x if for every real number ε > 0 there exists a positive integer N(ε) such that x n x < ε for all n > N(ε). The real number x is called the limit of the sequence and we write lim x n = x. If a sequence does not converge to a real number, it is said to diverge. A sequence (x n ) n=1,2,... of real numbers is said to diverge to, and we write lim x n = provided that for every M IR there exists a positive integer N such that x n > M for all n > N. Similarly, A sequence (x n ) n=1,2,... of real numbers is said to diverge to, and we write lim x n = provided that for every M IR there exists a positive integer N such that x n < M for all n > N. 7
8 If a sequence converges, its limit is unique. bounded. Moreover, a convergent sequence is Suppose that (x n ) n=1,2,... and (y n ) n=1,2,... are convergent sequences of real numbers with lim x n = x and lim y n = x. Then (1) lim (x n + y n ) = x + y; (2) lim (ax n ) = ax for all a IR; (3) lim (x n y n ) = xy; (4) lim (x n /y n ) = x/y, provided y n 0 for all n IN and y 0; (5) If x n y n for all n IN, then x y; (6) If x = y and x n z n y n for all n IN, then lim z n = x. A sequence (x n ) n=1,2,... of real numbers is said to be increasing if x n x n+1 for all n IN, and decreasing if x n+1 x n for all n IN. A monotone sequence is either increasing or decreasing. Theorem 3.1. Every monotone bounded sequence of real numbers is convergent. Proof. Let (x n ) n=1,2,... be a bounded and increasing sequence of real numbers. By Theorem 2.2, the set {x n : n IN} has a least upper bound. Let x := sup{x n : n IN}. We claim that lim x n = x. For ε > 0, x ε is not an upper bound for the set {x n : n IN}, because x is the least upper bound. Hence, there exists a positive integer N such that x ε < x N. Since the sequence (x n ) n=1,2,... is increasing, we have This shows lim x n = x. x n x = x x n x x N < ε for all n > N. The proof for the decreasing case is similar. Let (x n ) n=1,2,... be a bounded sequence of real numbers. For k = 1, 2,..., let s k := sup{x n : n k} and t k := inf{x n : n k}. Then (s k ) k=1,2,... is a decreasing sequence and (t k ) k=1,2,... is an increasing sequence. We define Clearly, s k t k for all k IN; hence, lim sup x n := lim s k and lim inf x n := lim t k. k k lim sup x n lim inf x n. 8
9 For example, the sequence (( 1) n ) n=1,2,... is bounded. For k = 1, 2,..., we have Consequently, s k = sup{( 1) n : n k} = 1 and t k = inf{( 1) n : n k} = 1. lim sup ( 1) n = 1 and lim inf ( 1)n = 1. Theorem 3.2. Let (x n ) n=1,2,... be a bounded sequence of real numbers. Then the sequence converges to a real number x if and only if lim inf x n = lim sup x n = x. Proof. For k = 1, 2,..., let t k := inf{x n : n k} and s k := sup{x n : n k}. Suppose lim x n = x. Then for every real number ε > 0 there exists a positive integer N(ε) such that x n x < ε for n > N(ε), that is, x ε < x n < x + ε for all n > N(ε). It follows that x ε t k s k x + ε for all k > N(ε). Hence, lim k t k = lim k s k = x. Conversely, suppose lim inf x n = lim sup x n = x. Then we have lim t k = lim s k = x. k k Consequently, for every ε > 0, there exists a positive integer N(ε) such that x ε < t k s k < x + ε for all k > N(ε). It follows that x ε < x n < x + ε for all n > N(ε), because t k x n s k for n k. Therefore, lim x n = x. A sequence (x n ) n=1,2,... of real numbers is said to be a Cauchy sequence (or a fundamental sequence) if for every ε > 0 there exists a positive integer N(ε) such that x n x m < ε whenever m, n > N(ε). Clearly, a Cauchy sequence is bounded. Moreover, a convergent sequence is a Cauchy sequence. 9
10 Theorem 3.3. Every Cauchy sequence of real numbers converges. Proof. Let (x n ) n=1,2,... be a Cauchy sequence of real numbers. It is bounded. Let s k := sup{x n : n k} and t k := inf{x n : n k}, k = 1, 2,.... For ε > 0, there exists a positive integer N(ε) such that x n x m < ε whenever m, n > N(ε). Moreover, for k > N(ε), there exist m k and n k such that s k < x m + ε and t k > x n ε. Hence, 0 s k t k < (x m x n ) + 2ε < 3ε for k > N(ε). This shows that lim k (s k t k ) = 0. Consequently, lim inf x n = lim t k = lim s k = lim sup x n. k k By Theorem 3.2, the sequence (x n ) n=1,2,... converges. 4. Infinite Series Given a sequence (a n ) n=1,2,... of real numbers, we define the sequence (s n ) n=1,2,... recursively by s 1 := a 1 and s n+1 := s n + a n+1, n IN. Then s n is called the nth partial sum of the sequence (a n ) n=1,2,... and we write n s n = a k = a a n, k=1 n IN. We also refer to the sequence (s n ) n=1,2,... of partial sums as the infinite series n=1 a n. If (s n ) n=1,2,... converges to a real number s, we say that the series n=1 a n converges and we write a n = s. n=1 The real number s is called the sum of the infinite series n=1 a n. If the sequence (s n ) n=1,2,... diverges, then we say that the series n=1 a n diverges. If lim s n =, we 10
11 say that the series n=1 a n diverges to and write n=1 a n =. If lim s n =, we say that the series n=1 a n diverges to and write n=1 a n =. It is easily seen that a n = s n s n 1 for n 2. If the series n=1 a n converges, then (s n ) n=1,2,... converges to a real number s. It follows that lim a n = lim (s n s n 1 ) = s s = 0. Thus, if a sequence (a n ) n=1,2,... diverges or lim a n 0, then the series n=1 a n diverges. If a, r IR and a n = ar n 1 for n IN, then the series a n = ar n 1 n=1 n=1 is called a geometric series. The case a = 0 is trivial. Suppose a 0. If r 1, then the sequence (ar n 1 ) n=1,2,... diverges or converges to a nonzero real number. Hence, the geometric series n=1 arn 1 diverges for r 1. Suppose r < 1. Then s n = n k=1 ar k 1 = a(1 + r + + r n 1 ) = a(1 rn ), n IN. 1 r For r < 1 we have lim r n = 0. Consequently, lim s n = a 1 r. Therefore, for r < 1, the geometric series n=1 arn 1 converges and its sum is a/(1 r). Theorem 4.1. Let (a n ) n=1,2,... be a sequence of real numbers with a n 0 for all n IN. Then the series n=1 a n converges if and only if the sequence (s n ) n=1,2,... of partial sums is bounded. Proof. We have s n = a a n. Since a n 0 for all n IN, s n+1 s n for all n IN. Thus, (s n ) n=1,2,... is an increasing sequence. If this sequence is bounded, then it converges, by Theorem 3.1. Hence, the series n=1 a n converges if (s n ) n=1,2,... is bounded. If (s n ) n=1,2,... is unbounded, then the sequence diverges. Consequently, the series n=1 a n diverges. Theorem 4.2. Let (a n ) n=1,2,... and (b n ) n=1,2,... be two sequences of real numbers such that 0 a n b n for all n IN. If the series n=1 b n converges, then the series n=1 a n converges. Proof. For n IN, let s n := a a n and t n := b b n. Since 0 a n b n for all n IN, we have s n t n for all n IN. If the series n=1 b n converges, then the sequence 11
12 (t n ) n=1,2,... is bounded. Consequently, the sequence (s n ) n=1,2,... is bounded. Therefore, the series n=1 a n converges, by Theorem 4.1. Let us investigate convergence or divergence of the p-series n=1 1 n p, where p is a real number. For n IN, let a n := 1/n p and s n := a a n. Suppose p > 1. For n IN have s 2 n 1 = n k=1 2 k 1 m=2 k 1 1 m p n 2 k 1 (2 k 1 ) p = n k=1 k=1 (2 1 p ) k 1 < p. This shows that the sequence (s n ) n=1,2,... is bounded. Hence, the p-series converges for p > 1. For p = 1 and n IN we have s 2 n = 1 + n 2 k k=1 m=2 k n m 1 + k=1 2 k 1 2 k = 1 + n 2. This shows that the sequence (s n ) n=1,2,... is unbounded. Hence, the harmonic series n=1 1/n diverges. For p 1, we have 1/n 1/np for all n IN. By Theorem 4.2, the p-series diverges for p 1. For a real number a, let a + := max{a, 0} and a := max{ a, 0}. We call a + the positive part of a and a the negative part of a, respectively. Evidently, a = a + + a and a = a + a. Theorem 4.3. Let (a n ) n=1,2,... be a sequence of real numbers. If the series n=1 a n converges, then the series n=1 a n converges. Proof. We observe that 0 a + n a n and 0 a n a n for all n IN. If the series n=1 a n converges, then both n=1 a+ n and n=1 a n converge, by Theorem 4.2. But a n = a + n a n for all n IN. We conclude that the series n=1 a n converges. If n=1 a n converges, then we say that the series n=1 a n converges absolutely. If n=1 a n converges, but n=1 a n diverges, then we say that n=1 a n converges conditionally. For example, the alternating harmonic series converges conditionally. ( 1) n n=1 12 n
13 Theorem 4.4. The set IR of real numbers is uncountable. Proof. We use {0, 1} IN to denote the set of all mappings from IN to {0, 1}. For u {0, 1} IN, we define ϕ(u) to be the ternary series n=1 u(n) 3 n. Since 0 u(n)/3 n 1/3 n for all n IN, the above series converges. Let us show that ϕ is an injective mapping. Suppose that u, v {0, 1} IN and u v. Let k be the least integer such that u(k) v(k). Without loss of any generality we may assume that u(k) = 0 and v(k) = 1. Then ϕ(v) ϕ(u) 1 3 k n=k n > 0. This shows that ϕ is an injective mapping from {0, 1} IN to IR. If IR were countable, then there would exist an injective mapping ψ from IR to IN. Consequently, ψ ϕ would be an injective mapping from {0, 1} IN to IN. But {0, 1} IN is uncountable. Hence, there is no injective mapping from {0, 1} IN to IN. This contradiction demonstrates that IR is uncountable. 13
MATH 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 informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationAdvanced Calculus: MATH 410 Real Numbers Professor David Levermore 5 December 2010
Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 5 December 2010 1. Real Number System 1.1. Introduction. Numbers are at the heart of mathematics. By now you must be fairly familiar with
More informationAdvanced Calculus: MATH 410 Real Numbers Professor David Levermore 1 November 2017
Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 1 November 2017 1. Real Number System 1.1. Introduction. Numbers are at the heart of mathematics. By now you must be fairly familiar with
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
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 informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationCopyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.
.1 Limits of Sequences. CHAPTER.1.0. a) True. If converges, then there is an M > 0 such that M. Choose by Archimedes an N N such that N > M/ε. Then n N implies /n M/n M/N < ε. b) False. = n does not converge,
More informationC.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series
C.7 Numerical series Pag. 147 Proof of the converging criteria for series Theorem 5.29 (Comparison test) Let and be positive-term series such that 0, for any k 0. i) If the series converges, then also
More informationMAS221 Analysis Semester Chapter 2 problems
MAS221 Analysis Semester 1 2018-19 Chapter 2 problems 20. Consider the sequence (a n ), with general term a n = 1 + 3. Can you n guess the limit l of this sequence? (a) Verify that your guess is plausible
More informationEconomics 204 Summer/Fall 2011 Lecture 2 Tuesday July 26, 2011 N Now, on the main diagonal, change all the 0s to 1s and vice versa:
Economics 04 Summer/Fall 011 Lecture Tuesday July 6, 011 Section 1.4. Cardinality (cont.) Theorem 1 (Cantor) N, the set of all subsets of N, is not countable. Proof: Suppose N is countable. Then there
More informationPrinciple of Mathematical Induction
Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)
More informationHomework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.
2..2(a) lim a n = 0. Homework 4, 5, 6 Solutions Proof. Let ɛ > 0. Then for n n = 2+ 2ɛ we have 2n 3 4+ ɛ 3 > ɛ > 0, so 0 < 2n 3 < ɛ, and thus a n 0 = 2n 3 < ɛ. 2..2(g) lim ( n + n) = 0. Proof. Let ɛ >
More informationCopyright c 2007 Jason Underdown Some rights reserved. statement. sentential connectives. negation. conjunction. disjunction
Copyright & License Copyright c 2007 Jason Underdown Some rights reserved. statement sentential connectives negation conjunction disjunction implication or conditional antecedant & consequent hypothesis
More informationAnalysis II: Basic knowledge of real analysis: Part IV, Series
.... Analysis II: Basic knowledge of real analysis: Part IV, Series Kenichi Maruno Department of Mathematics, The University of Texas - Pan American March 1, 2011 K.Maruno (UT-Pan American) Analysis II
More informationExistence of a Limit on a Dense Set, and. Construction of Continuous Functions on Special Sets
Existence of a Limit on a Dense Set, and Construction of Continuous Functions on Special Sets REU 2012 Recap: Definitions Definition Given a real-valued function f, the limit of f exists at a point c R
More informationEcon Lecture 2. Outline
Econ 204 2010 Lecture 2 Outline 1. Cardinality (cont.) 2. Algebraic Structures: Fields and Vector Spaces 3. Axioms for R 4. Sup, Inf, and the Supremum Property 5. Intermediate Value Theorem 1 Cardinality
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationEcon Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n
Econ 204 2011 Lecture 3 Outline 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n 1 Metric Spaces and Metrics Generalize distance and length notions
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationSuppose R is an ordered ring with positive elements P.
1. The real numbers. 1.1. Ordered rings. Definition 1.1. By an ordered commutative ring with unity we mean an ordered sextuple (R, +, 0,, 1, P ) such that (R, +, 0,, 1) is a commutative ring with unity
More informationMidterm Review Math 311, Spring 2016
Midterm Review Math 3, Spring 206 Material Review Preliminaries and Chapter Chapter 2. Set theory (DeMorgan s laws, infinite collections of sets, nested sets, cardinality) 2. Functions (image, preimage,
More information1. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x.
Advanced Calculus I, Dr. Block, Chapter 2 notes. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x. 2. Definition. A sequence is a real-valued function
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationNumerical Sequences and Series
Numerical Sequences and Series Written by Men-Gen Tsai email: b89902089@ntu.edu.tw. Prove that the convergence of {s n } implies convergence of { s n }. Is the converse true? Solution: Since {s n } is
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 informationPrinciples of Real Analysis I Fall I. The Real Number System
21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous
More informationChapter 5. Measurable Functions
Chapter 5. Measurable Functions 1. Measurable Functions Let X be a nonempty set, and let S be a σ-algebra of subsets of X. Then (X, S) is a measurable space. A subset E of X is said to be measurable if
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationDoubly Indexed Infinite Series
The Islamic University of Gaza Deanery of Higher studies Faculty of Science Department of Mathematics Doubly Indexed Infinite Series Presented By Ahed Khaleel Abu ALees Supervisor Professor Eissa D. Habil
More information2.1 Convergence of Sequences
Chapter 2 Sequences 2. Convergence of Sequences A sequence is a function f : N R. We write f) = a, f2) = a 2, and in general fn) = a n. We usually identify the sequence with the range of f, which is written
More informationSummary Slides for MATH 342 June 25, 2018
Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationNUMBERS. Michael E. Taylor
NUMBERS Michael E. Taylor Contents 1. Peano arithmetic 2. The integers 3. Prime factorization and the fundamental theorem of arithmetic 4. The rational numbers 5. Sequences 6. The real numbers 7. Irrational
More informationMath 117: Topology of the Real Numbers
Math 117: Topology of the Real Numbers John Douglas Moore November 10, 2008 The goal of these notes is to highlight the most important topics presented in Chapter 3 of the text [1] and to provide a few
More information1 The Real Number System
1 The Real Number System The rational numbers are beautiful, but are not big enough for various purposes, and the set R of real numbers was constructed in the late nineteenth century, as a kind of an envelope
More informationMIDTERM REVIEW FOR MATH The limit
MIDTERM REVIEW FOR MATH 500 SHUANGLIN SHAO. The limit Define lim n a n = A: For any ε > 0, there exists N N such that for any n N, a n A < ε. The key in this definition is to realize that the choice of
More informationTheorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers
Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower
More informationMATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem.
MATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The Bolzano-Weierstrass theorem. Limit of a sequence Definition. Sequence {x n } of real numbers is said to converge to a real number a if for
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationLogical Connectives and Quantifiers
Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationHandout #6 INTRODUCTION TO ALGEBRAIC STRUCTURES: Prof. Moseley AN ALGEBRAIC FIELD
Handout #6 INTRODUCTION TO ALGEBRAIC STRUCTURES: Prof. Moseley Chap. 2 AN ALGEBRAIC FIELD To introduce the notion of an abstract algebraic structure we consider (algebraic) fields. (These should not to
More informationOutline. We will now investigate the structure of this important set.
The Reals Outline As we have seen, the set of real numbers, R, has cardinality c. This doesn't tell us very much about the reals, since there are many sets with this cardinality and cardinality doesn't
More informationMETRIC HEIGHTS ON AN ABELIAN GROUP
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 44, Number 6, 2014 METRIC HEIGHTS ON AN ABELIAN GROUP CHARLES L. SAMUELS ABSTRACT. Suppose mα) denotes the Mahler measure of the non-zero algebraic number α.
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 informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
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 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 informationEconomics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011
Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Section 2.6 (cont.) Properties of Real Functions Here we first study properties of functions from R to R, making use of the additional structure
More information1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.
1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty. Let E be a subset of R. We say that E is bounded above if there exists a real number U such that x U for
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationreview To find the coefficient of all the terms in 15ab + 60bc 17ca: Coefficient of ab = 15 Coefficient of bc = 60 Coefficient of ca = -17
1. Revision Recall basic terms of algebraic expressions like Variable, Constant, Term, Coefficient, Polynomial etc. The coefficients of the terms in 4x 2 5xy + 6y 2 are Coefficient of 4x 2 is 4 Coefficient
More informationTHE REAL NUMBERS Chapter #4
FOUNDATIONS OF ANALYSIS FALL 2008 TRUE/FALSE QUESTIONS THE REAL NUMBERS Chapter #4 (1) Every element in a field has a multiplicative inverse. (2) In a field the additive inverse of 1 is 0. (3) In a field
More informationSolution. 1 Solutions of Homework 1. 2 Homework 2. Sangchul Lee. February 19, Problem 1.2
Solution Sangchul Lee February 19, 2018 1 Solutions of Homework 1 Problem 1.2 Let A and B be nonempty subsets of R + :: {x R : x > 0} which are bounded above. Let us define C = {xy : x A and y B} Show
More informationSequences. Limits of Sequences. Definition. A real-valued sequence s is any function s : N R.
Sequences Limits of Sequences. Definition. A real-valued sequence s is any function s : N R. Usually, instead of using the notation s(n), we write s n for the value of this function calculated at n. We
More information4 Powers of an Element; Cyclic Groups
4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)
More informationPrime and irreducible elements of the ring of integers modulo n
Prime and irreducible elements of the ring of integers modulo n M. H. Jafari and A. R. Madadi Department of Pure Mathematics, Faculty of Mathematical Sciences University of Tabriz, Tabriz, Iran Abstract
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 informationChapter 4. Measure Theory. 1. Measure Spaces
Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if
More informationand this makes M into an R-module by (1.2). 2
1. Modules Definition 1.1. Let R be a commutative ring. A module over R is set M together with a binary operation, denoted +, which makes M into an abelian group, with 0 as the identity element, together
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 informationIntroduction to Mathematical Analysis I. Second Edition. Beatriz Lafferriere Gerardo Lafferriere Nguyen Mau Nam
Introduction to Mathematical Analysis I Second Edition Beatriz Lafferriere Gerardo Lafferriere Nguyen Mau Nam Introduction to Mathematical Analysis I Second Edition Beatriz Lafferriere Gerardo Lafferriere
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 informationChapter 1 Preliminaries
Chapter 1 Preliminaries 1.1 Conventions and Notations Throughout the book we use the following notations for standard sets of numbers: N the set {1, 2,...} of natural numbers Z the set of integers Q the
More informationPart 2 Continuous functions and their properties
Part 2 Continuous functions and their properties 2.1 Definition Definition A function f is continuous at a R if, and only if, that is lim f (x) = f (a), x a ε > 0, δ > 0, x, x a < δ f (x) f (a) < ε. Notice
More informationThe real number system
Chapter 1 The real number system 1.1 The field of rational numbers We consider the set N 0 = {1, 2, } consisting of all natural numbers equipped with the usual addition and multiplication. We introduce
More informationSolutions Manual for Homework Sets Math 401. Dr Vignon S. Oussa
1 Solutions Manual for Homework Sets Math 401 Dr Vignon S. Oussa Solutions Homework Set 0 Math 401 Fall 2015 1. (Direct Proof) Assume that x and y are odd integers. Then there exist integers u and v such
More informationSets, Structures, Numbers
Chapter 1 Sets, Structures, Numbers Abstract In this chapter we shall introduce most of the background needed to develop the foundations of mathematical analysis. We start with sets and algebraic structures.
More informationLocal Fields. Chapter Absolute Values and Discrete Valuations Definitions and Comments
Chapter 9 Local Fields The definition of global field varies in the literature, but all definitions include our primary source of examples, number fields. The other fields that are of interest in algebraic
More information3.1 Basic properties of real numbers - continuation Inmum and supremum of a set of real numbers
Chapter 3 Real numbers The notion of real number was introduced in section 1.3 where the axiomatic denition of the set of all real numbers was done and some basic properties of the set of all real numbers
More informationMA103 Introduction to Abstract Mathematics Second part, Analysis and Algebra
206/7 MA03 Introduction to Abstract Mathematics Second part, Analysis and Algebra Amol Sasane Revised by Jozef Skokan, Konrad Swanepoel, and Graham Brightwell Copyright c London School of Economics 206
More informationLecture Notes in Real Analysis Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay
Lecture Notes in Real Analysis 2010 Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay August 6, 2010 Lectures 1-3 (I-week) Lecture 1 Why real numbers? Example 1 Gaps in the
More informationSequences and Summations
COMP 182 Algorithmic Thinking Sequences and Summations Luay Nakhleh Computer Science Rice University Chapter 2, Section 4 Reading Material Sequences A sequence is a function from a subset of the set of
More informationAnalysis Qualifying Exam
Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,
More informationMATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets
MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 2: Countability and Cantor Sets Countable and Uncountable Sets The concept of countability will be important in this course
More informationSeries. Definition. a 1 + a 2 + a 3 + is called an infinite series or just series. Denoted by. n=1
Definition a 1 + a 2 + a 3 + is called an infinite series or just series. Denoted by a n, or a n. Chapter 11: Sequences and, Section 11.2 24 / 40 Given a series a n. The partial sum is the sum of the first
More information(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define
Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that
More informationStructure of R. Chapter Algebraic and Order Properties of R
Chapter Structure of R We will re-assemble calculus by first making assumptions about the real numbers. All subsequent results will be rigorously derived from these assumptions. Most of the assumptions
More informationIntroduction to Real Analysis
Christopher Heil Introduction to Real Analysis Chapter 0 Online Expanded Chapter on Notation and Preliminaries Last Updated: January 9, 2018 c 2018 by Christopher Heil Chapter 0 Notation and Preliminaries:
More information+ ε /2N) be the k th interval. k=1. k=1. k=1. k=1
Trevor, Angel, and Michael Measure Zero, the Cantor Set, and the Cantor Function Measure Zero : Definition : Let X be a subset of R, the real number line, X has measure zero if and only if ε > 0 a set
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationRings and Fields Theorems
Rings and Fields Theorems Rajesh Kumar PMATH 334 Intro to Rings and Fields Fall 2009 October 25, 2009 12 Rings and Fields 12.1 Definition Groups and Abelian Groups Let R be a non-empty set. Let + and (multiplication)
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationScalar multiplication and addition of sequences 9
8 Sequences 1.2.7. Proposition. Every subsequence of a convergent sequence (a n ) n N converges to lim n a n. Proof. If (a nk ) k N is a subsequence of (a n ) n N, then n k k for every k. Hence if ε >
More informationFundamentals of Pure Mathematics - Problem Sheet
Fundamentals of Pure Mathematics - Problem Sheet ( ) = Straightforward but illustrates a basic idea (*) = Harder Note: R, Z denote the real numbers, integers, etc. assumed to be real numbers. In questions
More informationMoreover this binary operation satisfies the following properties
Contents 1 Algebraic structures 1 1.1 Group........................................... 1 1.1.1 Definitions and examples............................. 1 1.1.2 Subgroup.....................................
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationMATH NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS
MATH. 4433. NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS TOMASZ PRZEBINDA. Final project, due 0:00 am, /0/208 via e-mail.. State the Fundamental Theorem of Algebra. Recall that a subset K
More informationChapter One. The Real Number System
Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and
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 informationSolutions. Chapter A. A.1 Solutions to Chapter 1. Solutions to Exercises 1.1
Chapter A Solutions A. Solutions to Chapter Solutions to Exercises... Suppose that f : A B is invertible. This means there is a g : B A with g(f(a)) a for all a and f(g(b)) b for all b B. If f(a) f(a ),
More informationPart IA. Numbers and Sets. Year
Part IA Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2017 19 Paper 4, Section I 1D (a) Show that for all positive integers z and n, either z 2n 0 (mod 3) or
More information(4.2) Equivalence Relations. 151 Math Exercises. Malek Zein AL-Abidin. King Saud University College of Science Department of Mathematics
King Saud University College of Science Department of Mathematics 151 Math Exercises (4.2) Equivalence Relations Malek Zein AL-Abidin 1440 ه 2018 Equivalence Relations DEFINITION 1 A relation on a set
More informationPRINCIPLES OF ANALYSIS - LECTURE NOTES
PRINCIPLES OF ANALYSIS - LECTURE NOTES PETER A. PERRY 1. Constructions of Z, Q, R Beginning with the natural numbers N t1, 2, 3,...u we can use set theory to construct, successively, Z, Q, and R. We ll
More informationCHAPTER 3. Sequences. 1. Basic Properties
CHAPTER 3 Sequences We begin our study of analysis with sequences. There are several reasons for starting here. First, sequences are the simplest way to introduce limits, the central idea of calculus.
More information