Continuity. Chapter 4
|
|
- Vanessa Fisher
- 7 years ago
- Views:
Transcription
1 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 D R with the property that for each x D there is exactly one y R with (x, y) in this subset. We write f(x) = y. Our high school notion of continuity might be that the function is continuous if it can be drawn without lifting our pencil - we will see if we can come up with definitions and theorems to corroborate this notion. Definition 4.. Suppose f : D R. (i) A function f is continuous at c D if and only if, for all ǫ > 0, there exists a δ > 0 such that for all x D, x c < δ implies f(x) f(c) < ǫ. (ii) A function f is called continuous if and only if it is continuous at each point in its domain D. With our topological notions this is equivalent to Definition 4.3. A function f is continuous at c D if and only if, for any neighborhood V of f(c), there exists a neighborhood U of c such that, if x U D, then f(x) V. Example 4.4. Suppose D = N, and suppose f(n) = n. Is f continuous? Proof. Yes. Indeed, let ǫ > 0 and n 0 D. Set δ = 1/. Then for all x N, x n 0 < δ implies f(x) f(n 0 ) = 0 < ǫ. So much for our no-pencil-lifting ideas. It turns out a function is always continuous at an isolated point of the domain (see Problem 4.6). Example 4.5. Let D = R and f(x) = x. Prove f is continuous at x = 1. 35
2 36 4. Continuity Proof. We need to show x 1 is arbitrarily small when x is close enough to one. Note x 1 = x + 1 x 1. Thus we need to control the size of x + 1 to make the difference small. Let us suppose arbitrarily that x 1 < 1. By the triangle inequality this implies x 1 < 1 or x <. Then x + 1 x + 1 < 3. Set δ = min{1, ǫ/3}. Then x 1 < δ implies x 1 = x + 1 x 1 < 3 x 1 < ǫ. We need to know when a function is not continuous at a point in its domain. Lemma 4.6. The function f is not continuous at c D if there exists an ǫ 0 > 0 such that for all δ > 0 there exists x 0 D with x 0 c < δ and f(x 0 ) f(c) ǫ 0. Proof. In logic notation continuity at a point is The negation of this is ( ǫ > 0)( δ > 0)( x D)( x c < δ f(x) f(c) < ǫ). ( ǫ 0 > 0)( δ > 0)( x 0 D)( x 0 c < δ and f(x 0 ) f(c) ǫ 0 ). Example 4.7. (Dirichlet function) Consider the function on the real line 1 x Q, f(x) = 0 x Q c. Show the Dirichlet function is not continuous anywhere. Proof. Set ǫ 0 = 1/, δ > 0, and let c R. By Theorem.17 (the density of rationals) and its corollaries there exists r Q and ξ Q c such that and δ + c < r < c + δ δ + c < ξ < c + δ. That is, r c < δ and ξ c < δ. Either f(c) = 0 or f(c) = 1, but f(r) = 1 and f(ξ) = 0. Thus there exists x 0 D (either r or ξ), such that x 0 c < δ and f(x 0 ) f(c) = 1 ǫ 0. Example 4.8. Consider the function on the real line given by x x Q f(x) = c, 1 x x Q. Show the function is continuous at x = 1/ and discontinuous everywhere else.
3 4.1. Continuity and Limits 37 Proof. To show the function is continuous at x = 1/ we need to show f(x) f( 1 ) is small when x is close enough to 1/. We compute f(x) f( 1 x ) = 1 x Q c, 1 x x Q. Thus f(x) f( 1 ) = x 1 for all x R. Let ǫ > 0. Set δ = ǫ, and the result follows. The proof the function is discontinuous everywhere else follows the previous example. In Example 4.0 we show the existence of a function which is continuous on the irrationals and discontinuous on the rationals Continuity and Limits In this section we establish a connection between continuity and limits. We first define the quantity lim f(x) = L. To make sense of the limit we need for the function f to be defined near c. This puts some restrictions on the domain. Example 4.9. Suppose D = N. What should mean? lim f(n) = L n 5 Definition Let f : D R with x 0 a cluster point of D (Definition 3.4). Then f has a limit L at x 0 if and only if, for all ǫ > 0, there exists δ > 0 such that for all x D, 0 < x x 0 < δ implies f(x) L < ǫ. We denote the limit lim f(x) = L. We recall a cluster point of D may not be in D. Hence, we require 0 < x x 0 sin x (so x 6= x 0 ). Thus, for example, lim makes sense. x 0 x The following theorem may seem familiar. Indeed, some elementary texts take (iii) as the definition of continuity. Theorem Let f : D R and let c be a cluster point of D with c D. The following are equivalent. (i) f is continuous at c. (ii) All sequences {x n } n N D, x n c as as n implies {f(x n )} n N converges to f(c). (iii) lim f(x) = f(c). Remark 4.1. Combining (i) and (ii), we see (ii) says lim n f(x n) = f( lim n x n). That is, the limit passes through continuous functions.
4 38 4. Continuity Remark To show (ii) implies (i) we will prove the contrapositive. Some of the negations here are involved. For reference we have (i) ( ǫ > 0)( δ > 0)( x D)( x c < δ f(x) f(c) < ǫ), (i) ( ǫ 0 > 0)( δ > 0)( x 0 D)( x 0 c < δ and f(x 0 ) f(c) ǫ 0 ). Moreover, not (ii) is ( {x n } n N D) x n c and ( ǫ 0 > 0)( N N)( n 0 N)( f(x n0 ) f(c) ǫ 0 ), and (iii) ( ǫ > 0)( δ > 0)( x D)(0 < x c < δ f(x) f(c) < ǫ). Proof. We show (i) implies (ii). Let {x n } n N be a sequence as stated. We have to show the sequence {f(x n )} n N converges. This requires us to find a N N so that f(x n ) f(c) < ǫ. To find such a N we return to the definition of continuity. Let ǫ > 0. There exists a δ > 0 such that x D, x c < δ implies f(x) f(c) < ǫ. Since the sequence {x n } n N converges to c, there exist N such that x n c < δ for n N. However, for such n, f(x n ) f(c) < ǫ as required. Next we show not (i) implies not (ii). Set δ = 1/n, n N in the negation of (i). Then ǫ 0 > 0 exists such that for each n N, there exists x n D such that x n c < 1/n and f(x n ) f(c) ǫ 0. This is not (ii). To see (i) and (iii) are equivalent we first notice the only difference between them is (iii) has 0 < x c < δ while (i) has x c < δ. Thus (i) implies (iii) is trivial. To get the converse note that c D. Thus, if x = c, f(x) f(c) = 0 < ǫ, and there is no harm in dropping the condition 0 < x c. That is, (iii) implies (i). Example Show the function f(x) = x is continuous on D = [0, ]. Proof. Homework Problem 3.1 shows that, for any sequence x n x, x n x as n. Thus by Theorem 4.11 f is continuous on its domain. Theorem (Algebra of Continuous Functions) Suppose f, g : D R are continuous functions at c D and with c a cluster point of D. Then at c the functions (1) αf, for α R, () f ± g, (3) f g, (4) f/g, if g 6= 0 on D, are continuous. Proof. Let {x n } D be any sequence converging to c. By the algebra of limits for sequences, Theorem 3.1, the functions in the list satisfy (ii) in Theorem Theorem 4.11 now provides the result. Remark Note that, if c D is not a cluster point of D, then f : D R is continuous at c. Thus, no loss of generality occurs in requiring c to be a cluster point of the domain. See Problem 4.6.
5 4.1. Continuity and Limits 39 Theorem (Composite Functions) Let f : A B and g : B R. Suppose f is continuous at c A with c a cluster point of A, and g continuous at f(c). Then the composite function g(f(x)) = g f(x) is continuous at c. Proof. Let {x n } A be any sequence converging to c. By assumption and Theorem 4.11, {f(x n )} n N converges to f(c) B. In particular, z n = f(x n ) B converges to f(c) B. Since g is continuous at f(c), the analysis in the first paragraph of the proof of Theorem 4.11 shows {g(z n )} n N converges to g(f(c)). That is, {g(f(x n ))} n N converges to g(f(c)) for all sequences x n A with x n c as n. Theorem 4.11 provides the result. Example Prove cos x is continuous on R. Proof. Homework Problem 4.10 shows sin x is continuous on the real numbers. Note that cos x = sin(x + π ). One easily checks that f = x + π/ is a continuous function. Theorem 4.17 gives the result. Example Prove tan x is continuous on [0, π/). Proof. Since sin x and cos x are continuous on the stated interval and cos x is non zero there, Theorem 4.15 applies and provides the result. Example 4.0. Consider the function defined on (0, 1) given by 0 x Q f(x) = c, x Q, x = m/n. 1 n Show the function is continuous on the irrationals and discontinuous on the rationals. Proof. Let r (0, 1) be rational and {ξ n } n N be a sequence of irrational numbers in (0, 1) converging to r. If f were continuous at r, then according to Remark 4.1, 0 = lim n f(ξ n) = f( lim n ξ n) = f(r) 6= 0. This is a contradiction and so f is not continuous on the rational numbers in (0, 1). To show f is continuous on the irrational numbers in (0, 1), let ξ (0, 1) be irrational. We must show f(x n ) f(ξ) as n for all sequences in (0, 1) converging to ξ. Since f(ξ) = 0 and f(x n ) = 0 if x n is irrational, we may suppose the x n are rational for n N. Thus, we suppose x n = p n /q n in reduced form and n N. Since f(x n ) = 1/q n for each n N, we need to show 1/q n 0 as n. Suppose to the contrary. Then an ǫ 0 > 0 exists so that for each N N there exists a n 0 > N so that 1/q n0 ǫ 0. This implies the existence of a subsequence (let N = k) {q nk } k N such that q nk 1/ǫ 0 for all k N. Since the q nk are bounded for k N, the set E = x nk = p n k q nk k N (0, 1) is finite. It follows any convergent sequence in E must eventually be constant (cf. Problem 3.13) and hence rational - this contradicts ξ being irrational.
6 40 4. Continuity 4.. More on limits The next theorem is quite similar to Theorem 4.11, and the proof is almost identical. Theorem 4.1. (Sequential Characterization of Limits) Let f : D R, and let c be a cluster point of D (not necessarily in D). The following two statements are equivalent. (i) lim f(x) = L, (ii) All sequences {x n } n N D, such that x n 6= c for n N, x n c as n, implies {f(x n )} n N converges to L. Proof. To show (i) implies (ii), let ǫ > 0. A δ exists so that f(x) L < ǫ for all x D and 0 < x c < δ. Choose N so that 0 < x n c < δ for all n N. Then f(x n ) L < ǫ. This is (ii). For the converse we prove the contrapositive - not (i) implies not (ii). For each n N, set δ = 1/n. Not (i) implies there exists x n D such that 0 < x n c < 1/n and f(x n ) L ǫ 0 for some fixed ǫ 0 > 0. This is not (ii). We can get much mileage from the last theorem. Example 4.. Show that the function f(x) = sin(1/x) on D = (0, ) has no limit at x = 0. Proof. We just need to find a sequence {x n } n N D with x n as n and with {f(x n } n N having no limit or different limits for different {x n } n N with the mentioned properties. Consider a n = π(4n + 1), b n = 1 nπ. Then f(a n ) = sin(π(4n + 1)/) = 1 and f(b n ) = sin nπ = 0 for all n N. Thus (ii) is not true in Theorem 4.1, and the limit does not exist. Theorem 4.3. (Algebra of Limits) Let f, g : D R and c be a cluster point of dd. Suppose lim f(x) = L 1, and lim g(x) = L. Then (a) For all α R, lim αf(x) = αl 1. (b) lim (f(x) + g(x)) = L 1 + L. (c) lim f(x)g(x) = L 1 L. (d) If g(x) 6= 0 on D and L 6= 0, then lim f(x) g(x) = L 1 L. Proof. Let {x n } n N D be any sequence converging to c. Then by the algebra of limits for sequences, Theorem 3.1, the above are true for sequences. Theorem 4.1 now provides the result.
7 4.3. Properties of Continuous Functions Properties of Continuous Functions We are now in a position to establish some global properties of continuous functions. The first result gives conditions for a function to have a minimum and maximum. Here are two functions which do not have a maximum. Example 4.4. f(x) = x on (0, 1). Example 4.5. f(x) = x 0 x < 1, 0 x = 1. Note the first function is continuous - so we expect some restriction on the domain for a maximum to exist. The second function is not continuous. Theorem 4.6. (Extreme-Value Theorem) Suppose I is a closed bounded interval and f : I R is continuous. Then x m, x M exists in I such that f(x m ) = min f, f(x M ) = max f. I I Remark 4.7. We note that f bounded means While f not bounded means ( M)( x I)( f(x) M). ( M)( x I)( f(x) > M). Proof. We first show the function is bounded. Suppose f is not bounded on I. For each n N let M = n in the negation. Then there exists a sequence {x n } n N I such that f(x n ) > n. Since the sequence is bounded the Bolzano-Weierstrass theorem applies and a convergent subsequence of {x n } n N exists - say {x nk } k N converging to x 0 as k. Exercise 3.10 shows that x 0 I. Since f is continuous (Remark 4.1) lim f(x n k ) = f( lim x n k ) = f(x 0 ). k k However, f(x nk ) n k k and {f(x nk )} k N does not converge - a contradiction and f is bounded. Consider the set E = {f(x) x I}. Note E is nonempty and bounded. By the Completeness Axiom E has a supremum. Set M = sup E. We need to find x M I such that f(x M ) = M. By the properties of supremum (Corollary 3.6) there exists a sequence {z n } such that M 1/n < f(z n ) M. The Bolzano- Weierstrass theorem applies again and a subsequence {z nk } k N exists converging to x M I (this defines x M ). By continuity and the squeeze theorem, Theorem 3.4, we have M = lim f(z n k ) = f( lim z n k ) = f(x M ). k k A similar argument shows the existence of x m I such that f(x m ) = inf E. We need a technical lemma before proceeding.
8 4 4. Continuity Lemma 4.8. (Sign Preserving Property) Let f : D R be continuous at x 0 D. Suppose f(x 0 ) > 0. Then δ > 0 exists so that f(x) > f(x 0 )/ for x D and x x 0 < δ. Proof. Set ǫ = f(x 0 )/ in the definition of continuity. Then a δ > 0 exists so that f(x 0) < f(x) f(x 0 ) < f(x 0), for all x D and x x 0 < δ. That is, for all x D T ( δ + x 0, δ + x 0 ). f(x 0 ) < f(x) The next theorem is consistent with the notion continuous functions can be drawn without lifting a pencil. Definition 4.9. A function, f : [a, b] R, is said to have the intermediate-value property if and only if, given any y 0 between f(a) and f(b), there exists a x 0 [a, b] with f(x 0 ) = y 0. Theorem (Bolzano Intermediate-Value Theorem) Let f : [a, b] R be continuous. Then f has the intermediate-value property. Before proceeding to the proof, let us drop the hypothesis and see what happens. Example Consider f(x) = x on D = [0, 1] [, 3]. If y 0 = 1.5, there is no x 0 D such that f(x 0 ) = y 0. Thus an interval is required. Example 4.3. Here f : [0, 1] R with 0 0 x < 1, f(x) = 1 x = 1. If y 0 = 1/, there is no x 0 [0, 1] such that f(x 0 ) = y 0. Thus continuity is required. Proof. Suppose f(a) < y 0 < f(b). Set E = {x a x b, f(x) y 0 }. The set E is nonempty any bounded since it is a subset of [a, b]. By the completeness axiom, E has a supremum, say x 0. Moreover, x 0 E (Exercise 3.18). We will show f(x 0 ) = y 0. We first show f(x 0 ) y 0. By the properties of supremums, Corollary 3.6, there exist a sequence {x n } n N E converging to x 0 as n. By continuity we have lim f(x n) = f( lim x n) = f(x 0 ). n n Moreover, since f(x n ) y 0 for all n N, it follows f(x 0 ) y 0. Now suppose f(x 0 ) < y 0. We need a contradiction. Set g(x) = y 0 f(x) on [a, b]. By our assumption, g(x 0 ) > 0. By the sign-preserving property, Lemma 4.8, g is positive on [a, b] T ( δ + x 0, δ + x 0 ) for some δ > 0. Since a < x 0 < b, there must exist x > x 0 with g(x) > 0. That is f(x) < y 0 for some x > x 0. This contradicts x 0 = sup E. Thus by trichotomy, f(x 0 ) = y 0.
9 4.4. Inverses 43 Corollary The continuous image of a closed interval is again a closed interval. Proof.. Let f : [a, b] R be continuous on [a, b]. By the Extreme-Value Theorem, 4.6, x m and x M in [a, b] exist so that f(x m ) f(x) f(x M ) for all x [a, b]. By the Intermediate-Value Theorem, 4.30, given any y [f(x m ), f(x M )], there exists x [a, b] such that f(x) = y. That is, f([a, b]) = [f(x m ), f(x M )] Inverses Its natural to ask when a continuous injective function has a continuous inverse. You might think it is automatic. It is not. Example Consider the function on D = [0, 1] [, 3) given by x 0 x 1, f(x) = 4 x x < 3. The function is continuous and injective, and therefore has an inverse. However, its inverse is discontinuous. 1.5 f(x) x 3.5 f -1 (x) x Figure 1. Top: graph of f(x). Bottom: graph of f 1 (x)
10 44 4. Continuity Theorem Suppose f : I R with I a closed bounded interval, f continuous on I, and f injective. Then f 1 is continuous. Proof. The inverse exists since f is injective. To show the inverse is continuous, we use the sequential characterization of continuity, Theorem Let {y n } n N be any sequence in the range of f (that is, in the domain of f 1 ) converging to y 0 F (I). The injectivity of f implies the existence of x n I such that f(x n ) = y n for all n N. Suppose we can show {x n } n N converges to some x 0 I. Continuity of f implies f(x n ) f(x 0 ) as n. That is, y 0 = f(x 0 ). In particular, this implies f 1 (y n ) f 1 (y 0 ) as n. Theorem 4.11 then implies f 1 is continuous on f 1 (I). To show the sequence {x n } n N converges we apply Homework Exercise we show all convergent subsequences have the same limit. Let {x nk } k N be any convergent subsequence to say z 0 I (we know z 0 I since I is closed and bounded). By continuity f(x nk ) f(z 0 ) as n. But f(x nk ) = y nk. Since {y n } n N is a convergent sequence, {y nk } k N converges to y 0. That is, f(z 0 ) = y 0. Set x 0 = f 1 (y 0 ). Then all convergent subsequences of {x n } n N converge to x 0. Therefore, {x n } n N converges to x 0. Corollary The functions sin x, cos x, and tan x defined on [ π, π ], [0, π], [ π 4, π 4 ] respectively, have continuous inverses. Proof. Homework Problem 4.10, Examples 4.18, and 4.19 show sin x, cos x, and tan x are continuous on the respective domains. They are seen to be injective there as well Uniform Continuity We will have occasion to require a stronger form of continuity. Definition A function f : D R is uniformly continuous on D if and only if, for all ǫ > 0, there exists a δ > 0 such that for all x, a D, x a < δ implies f(x) f(a) < ǫ. Note the difference with continuity - the δ works for all x, a D and only depends on ǫ. This means there is a minimum δ. See the figure below. Lemma A function f : D R is not uniformly continuous on D, if there exists a ǫ 0 > 0 and two sequences {x n } n N, {y n } n N D such that x n y n < 1/n and f(x n ) f(y n ) ǫ 0 for all n N. Proof. In logic notation uniform continuity is ( ǫ > 0)( δ > 0)( x 0, x D)( x x 0 < δ f(x) f(x 0 ) < ǫ). By the way continuity on D (but not necessarily uniform) is ( ǫ > 0)( x 0 D)( δ > 0)( x D)( x x 0 < δ f(x) f(x 0 ) < ǫ). Note the difference. The negation of uniform continuity is ( ǫ 0 > 0)( δ > 0)( x 0, x D)( x x 0 < δ and f(x) f(x 0 ) ǫ 0 ). Let δ = 1/n and the result follows.
11 4.5. Uniform Continuity y axis x axis Figure. Graph of f = 1/x. Note the dependence of the size of the δ neighborhood (on the x-axis) on the location of the ǫ neighborhood (on the y-axis). The δ neighborhood continually shrinks as the continuity point moves towards the origin. Example Show the function f(x) = 1/x on (0, ) is not uniformly continuous. Proof. Pick x n = 1/n and y n = 1/n. Then x n y n < 1/n and f(x n ) f(y n ) = n n n 1. Lemma 4.38 now applies. Example Show the function f(x) = 1/x on [1, ) is uniformly continuous. Proof. We first calculate f(x) f(y) = x y xy x y on [1, ). Thus we choose δ = ǫ in the definition of uniformly continuity and the result follows. Theorem Suppose I is a closed, bounded interval and f : I R is continuous on I. Then f is uniformly continuous on I. Proof. Suppose f is not uniformly continuous on I. Then two sequences {x n } n N, {y n } n N I exist and a ǫ 0 > 0 exists such that x n y n < 1/n and f(x n ) f(y n ) ǫ 0 for all n N. Since {x n } n N is bounded, the Bolzano-Weierstrass
12 46 4. Continuity theorem applies and convergent subsequence exist such that x nk x I as k. Consider the corresponding subsequence {y nk } k N (same indices). We claim {y nk } k N converges to x. Indeed, lim y n k = lim x nk +(y nk x nk ) = x+0 = x. k k Since the absolute function is continuous (Exercise 4.) and f is continuous, we have lim f(x n k ) f(y nk ) = f(x) f(x) ǫ 0 > 0. This is a contradiction. k
13 4.5. Uniform Continuity 47 It might be fun to find conditions on a function f so that it has properties physicists and engineers expect. Here is one possibility. Theorem 4.4. Suppose I is a closed, bounded interval and f : I R is continuous on I. Then f is uniformly continuous on I. f has a minimum and maximum. f enjoys the intermediate-value property. If f injective, f 1 is continuous. Here is a summary of our theorems so far. The Completeness Axiom Monotone-Convergence Theorem Nested-Cell Theorem Archimedean Principle Density of Q Bolzano-Weierstrass Theorem Uniformly Continuous Extreme-Value Thm Cauchy Theorem
14 48 4. Continuity 4.6. Homework Exercise 4.1. Prove that f(x) = x is continuous on R. Exercise 4.. Suppose f : R R is continuous and f(x) M for some M. Let {x n } n N be any sequence converging to x. Prove, by just applying appropriate theorems and the previous problem, that lim n f(x n) = f(x) M. Exercise 4.3. Prove that f(x) = 1/x is continuous on R, x 6= 0, by using the definition of continuity and by applying theorems. Exercise 4.4. Prove the following function is continuous at x = 0 x sin 1 f(x) = x x 6= 0, 0 x = 0. Exercise 4.5. Give an example of a function defined on the real numbers continuous only at the origin. Exercise 4.6. Suppose f : D R, c D and c is not a cluster point of D. Show f is continuous at c. Hint: examine Example 4.4 and recall Problem 3.0. Exercise 4.7. Give an example of a function f : [0, 1] R which is discontinuous exactly at one point and a function g : [0, 1] R discontinuous only on Q such that f g is continuous nowhere. Exercise 4.8. Give an example of a continuous function defined on (0, 1) and a Cauchy sequence {x n } n N (0, 1) such that {f(x n )} n N is not Cauchy. Exercise 4.9. Let f be a continuous function defined on the real numbers, and suppose f(x) = c for all x Q and for some c R. Prove that f(x) = c for all x R. Exercise Use the inequality sin(x) x for x R to show that the sine function is continuous at x = 0. Use this fact with the identity 1 1 sin(x) sin(u) = sin (x u) cos (x + u) to prove that the sine function is continuous at any point of R. Exercise Let c be a cluster point of a set D. Suppose f + g and fg have limits at c. Does it follow f and g have limits at c? Exercise 4.1. Let 1 x Q, f(x) = 1 x Q c. Show that f does not have a limit at any point. Exercise Suppose f : D R and c is a cluster point of D. If a < f(x) < b for all x D and f has a limit at c, show a lim f(x) b. Exercise Prove the following Squeeze Theorem. Let f, g, h : D R with f(x) g(x) h(x) and c be a cluster point of D. If both f and h have limits at c and converge to L, then g has a limit at c. Moreover, lim g(x) = L.
15 4.6. Homework 49 Exercise Make a definition for the meaning of lim f(x) = L lim + f(x) = L. Prove that lim f(x) = L if and only if lim f(x) = L and lim + f(x) = L. Exercise A function f : R R is called additive if f(x + y) = f(x) + f(y) for all x, y R. (a) Show f(n) = nf(1) for all n N. (b) Show f n m x = n mf(x) for all n, m N and x R. (c) Show f(x y) = f(x) f(y) for all x, y R. Then show f( x) = f(x) (f is odd) and f(0) = 0. (d) Show f(r) = rf(1) for all r Q. (e) If f is continuous at one point, f is continuous everywhere. (f) If f is continuous on R, f(x) = xf(1) for all x R. Exercise Give an example to show the continuous image of an open interval may not be an open interval. In contrast recall Corollary 4.33 which shows in continuous image of closed interval is a closed interval. Exercise Show that f(x) = x 4 3x + 1 has two roots in [0, ]. Exercise Find an interval of length one that contains a root of the equation xe x = 1. You may assume e x is a continuous function on R. Exercise 4.0. Show that an odd degree polynomial has at least one real root. Exercise 4.1. Let f : [0, 1] R be continuous with f(0) = f(1). Show c [0, 1/] exists so that f(c) = f c + 1. Exercise 4.. Suppose ϕ(x) is continuous on R, lim ϕ(x) = 7 and lim ϕ(x) = x x 6. Show for each 6 < y < 7, there exists x R with ϕ(x) = y. Exercise 4.3. Show the equation cos x = x has a solution in (0, π/). sin x = x has a solution in (0, π/)? Does Exercise 4.4. Let f : [a, b] R be continuous and injective. Show f is strictly monotone: for any x, y [a, b], x < y implies f(x) < f(y) or for any x, y [a, b], x < y implies f(x) > f(y). Exercise 4.5. Use the Intermediate-Value Theorem to show every positive number p > 1 has a unique n th root by considering the function f(x) = x n on the interval [0, p] (cf. Theorem.1). Exercise 4.6. (Brouwer Fixed Point Theorem) Let f : [a, b] [a, b] be continuous. Prove that f has a fixed point. That is, there exists at least one x [a, b] such that f(x) = x. Exercise 4.7. Let f be a continuous function from R to R. (a) Assume f is not bounded and odd (f( x) = f(x) for all x R). Show f is onto.
16 50 4. Continuity (b) Give an example of an unbounded f which is not onto. Show your answer is correct. Exercise 4.8. Show f(x) = x is not uniformly continuous on R. Exercise 4.9. Show f(x) = sin(1/x) is not uniformly continuous on (0, π). Exercise Show f(x) = mx + b is uniformly continuous on R. Exercise Show f(x) = 1/x is not uniformly continuous on (0, ). But is uniformly on [1, ). Exercise 4.3. Suppose f is continuous on [a, b] and uniformly continuous on D, where D is either [b, c] or [b, ). Show that f is uniformly continuous on [a, b] S D. Exercise Show f(x) = x is uniformly continuous on [0, ). Use Exercise 4.3 with D = [1, ) or show it directly. Exercise Let f and g be uniformly continuous on D. Show that f + g is uniformly continuous on D. Show by example that fg may not be uniformly continuous on D. Exercise Suppose D is bounded and f is uniformly continuous on D. Show that f is bounded on D.
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
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 informationFIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.
FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is
More informationx 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
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationThe Mean Value Theorem
The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More informationHomework # 3 Solutions
Homework # 3 Solutions February, 200 Solution (2.3.5). Noting that and ( + 3 x) x 8 = + 3 x) by Equation (2.3.) x 8 x 8 = + 3 8 by Equations (2.3.7) and (2.3.0) =3 x 8 6x2 + x 3 ) = 2 + 6x 2 + x 3 x 8
More informationMA651 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
More informationMA4001 Engineering Mathematics 1 Lecture 10 Limits and Continuity
MA4001 Engineering Mathematics 1 Lecture 10 Limits and Dr. Sarah Mitchell Autumn 2014 Infinite limits If f(x) grows arbitrarily large as x a we say that f(x) has an infinite limit. Example: f(x) = 1 x
More information36 CHAPTER 1. LIMITS AND CONTINUITY. Figure 1.17: At which points is f not continuous?
36 CHAPTER 1. LIMITS AND CONTINUITY 1.3 Continuity Before Calculus became clearly de ned, continuity meant that one could draw the graph of a function without having to lift the pen and pencil. While this
More informationMetric 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
More informationMetric 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
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationCHAPTER 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.,
More informationReal Roots of Univariate Polynomials with Real Coefficients
Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials
More information1. 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
More informationChapter 7. Continuity
Chapter 7 Continuity There are many processes and eects that depends on certain set of variables in such a way that a small change in these variables acts as small change in the process. Changes of this
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More informationLecture Notes on Analysis II MA131. Xue-Mei Li
Lecture Notes on Analysis II MA131 Xue-Mei Li March 8, 2013 The lecture notes are based on this and previous years lectures by myself and by the previous lecturers. I would like to thank David Mond, who
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
More informationContinuity. DEFINITION 1: A function f is continuous at a number a if. lim
Continuity DEFINITION : A function f is continuous at a number a if f(x) = f(a) REMARK: It follows from the definition that f is continuous at a if and only if. f(a) is defined. 2. f(x) and +f(x) exist.
More informationTHE 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,
More informationMOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu
Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing
More informationIntroduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
More informationNo: 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
More informationI. 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
More informationMathematical 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.............................
More informationLIMITS AND CONTINUITY
LIMITS AND CONTINUITY 1 The concept of it Eample 11 Let f() = 2 4 Eamine the behavior of f() as approaches 2 2 Solution Let us compute some values of f() for close to 2, as in the tables below We see from
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
More informationI. Pointwise convergence
MATH 40 - NOTES Sequences of functions Pointwise and Uniform Convergence Fall 2005 Previously, we have studied sequences of real numbers. Now we discuss the topic of sequences of real valued functions.
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationRolle s Theorem. q( x) = 1
Lecture 1 :The Mean Value Theorem We know that constant functions have derivative zero. Is it possible for a more complicated function to have derivative zero? In this section we will answer this question
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationMathematics for Econometrics, Fourth Edition
Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents
More informationSection 3.7. Rolle s Theorem and the Mean Value Theorem. Difference Equations to Differential Equations
Difference Equations to Differential Equations Section.7 Rolle s Theorem and the Mean Value Theorem The two theorems which are at the heart of this section draw connections between the instantaneous rate
More informationLimits and Continuity
Math 20C Multivariable Calculus Lecture Limits and Continuity Slide Review of Limit. Side limits and squeeze theorem. Continuous functions of 2,3 variables. Review: Limits Slide 2 Definition Given a function
More informationSo 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
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationGod 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
More informationMath 104: Introduction to Analysis
Math 104: Introduction to Analysis Evan Chen UC Berkeley Notes for the course MATH 104, instructed by Charles Pugh. 1 1 August 29, 2013 Hard: #22 in Chapter 1. Consider a pile of sand principle. You wish
More informationLecture Notes for Analysis II MA131. Xue-Mei Li with revisions by David Mond
Lecture Notes for Analysis II MA131 Xue-Mei Li with revisions by David Mond January 8, 2013 Contents 0.1 Introduction............................ 3 1 Continuity of Functions of One Real Variable 6 1.1
More information3. 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)
More informationON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
More informationFixed Point Theorems
Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationCHAPTER 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
More informationHOMEWORK 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
More informationn 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
More informationHow To Understand The Theory Of Hyperreals
Ultraproducts and Applications I Brent Cody Virginia Commonwealth University September 2, 2013 Outline Background of the Hyperreals Filters and Ultrafilters Construction of the Hyperreals The Transfer
More informationSeparation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
More informationMASSACHUSETTS 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
More information4.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
More informationit is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
More informationPUTNAM 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
More informationH/wk 13, Solutions to selected problems
H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.
More informationt := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).
1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction
More informationAn 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
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More information1 The Concept of a Mapping
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 1 The Concept of a Mapping The concept of a mapping (aka function) is important throughout mathematics. We have been dealing
More informationContinued 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
More information9 More on differentiation
Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationCONTINUED 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.
More informationMATH PROBLEMS, WITH SOLUTIONS
MATH PROBLEMS, WITH SOLUTIONS OVIDIU MUNTEANU These are free online notes that I wrote to assist students that wish to test their math skills with some problems that go beyond the usual curriculum. These
More informationCritical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima.
Lecture 0: Convexity and Optimization We say that if f is a once continuously differentiable function on an interval I, and x is a point in the interior of I that x is a critical point of f if f (x) =
More informationMath 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
More informationFactoring Polynomials
Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent
More informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationGeometric Transformations
Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted
More informationON FIBER DIAMETERS OF CONTINUOUS MAPS
ON FIBER DIAMETERS OF CONTINUOUS MAPS PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Abstract. We present a surprisingly short proof that for any continuous map f : R n R m, if n > m, then there
More informationThe Fourier Series of a Periodic Function
1 Chapter 1 he Fourier Series of a Periodic Function 1.1 Introduction Notation 1.1. We use the letter with a double meaning: a) [, 1) b) In the notations L p (), C(), C n () and C () we use the letter
More informationSPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM
SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM ALEX WRIGHT 1. Intoduction A fixed point of a function f from a set X into itself is a point x 0 satisfying f(x 0 ) = x 0. Theorems which establish the
More informationExercises and Problems in Calculus. John M. Erdman Portland State University. Version August 1, 2013
Exercises and Problems in Calculus John M. Erdman Portland State University Version August 1, 2013 c 2010 John M. Erdman E-mail address: erdman@pdx.edu Contents Preface ix Part 1. PRELIMINARY MATERIAL
More informationTwo Fundamental Theorems about the Definite Integral
Two Fundamental Theorems about the Definite Integral These lecture notes develop the theorem Stewart calls The Fundamental Theorem of Calculus in section 5.3. The approach I use is slightly different than
More informationFixed Point Theorems in Topology and Geometry
Fixed Point Theorems in Topology and Geometry A Senior Thesis Submitted to the Department of Mathematics In Partial Fulfillment of the Requirements for the Departmental Honors Baccalaureate By Morgan Schreffler
More informationTHE CONTRACTION MAPPING THEOREM
THE CONTRACTION MAPPING THEOREM KEITH CONRAD 1. Introduction Let f : X X be a mapping from a set X to itself. We call a point x X a fixed point of f if f(x) = x. For example, if [a, b] is a closed interval
More informationSolutions to Homework 10
Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x
More informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More information8 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
More information1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 005-06-15 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
More informationDiscrete 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
More informationRepresentation of functions as power series
Representation of functions as power series Dr. Philippe B. Laval Kennesaw State University November 9, 008 Abstract This document is a summary of the theory and techniques used to represent functions
More informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More informationMathematical 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,
More informationP NP for the Reals with various Analytic Functions
P NP for the Reals with various Analytic Functions Mihai Prunescu Abstract We show that non-deterministic machines in the sense of [BSS] defined over wide classes of real analytic structures are more powerful
More informationLinear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:
Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More informationReference: Introduction to Partial Differential Equations by G. Folland, 1995, Chap. 3.
5 Potential Theory Reference: Introduction to Partial Differential Equations by G. Folland, 995, Chap. 3. 5. Problems of Interest. In what follows, we consider Ω an open, bounded subset of R n with C 2
More informationProperties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationLecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence
More information