Solution of the 8 th Homework
|
|
- Rebecca Kelly
- 5 years ago
- Views:
Transcription
1 Solution of the 8 th Homework Sangchul Lee December 8, Preinary 1.1 A simple remark on continuity The following is a very simple and trivial observation. But still this saves a lot of words in actual proofs. Lemma 1.1. Let f : X R be a function, and let x 0 X. Then the followings are equivalent: (i) f is continuous at x 0. I.e, x x0 ;x X f (x) = f (x 0 ). (ii) x x0 ; f (x) = f (x 0 ). Proof. This follows by just a few seconds of meditation. To be slightly precise, this follows because f (x 0 ) f (x 0 ) < ε for any ε > (optional) Weierstrass-Carathéodory formulation of differentiability Proposition 1.2. Let X R, let x 0 X be a it point of X, and let f : X R be a function. Then the followings are equivalent: (i) f is differentiable at x 0. (ii) There exists a function φ f : X R which is continuous at x 0 and satisfies Moreover, if these hold, then φ f (x 0 ) = f (x 0 ). f (x) = f (x 0 ) + φ f (x)( ) (1.1) It is loosely read as differentiability at x 0 holds if and only if the graph of a function is well approximated by a line (with finite slope) near x 0. What is good for this formulation is that various differentiation rules follows almost for free. Proof. (i) = (ii) : Define φ f : X R by Now, by the differentiability of f at x 0, we have φ f (x) = f (x) f (x 0 ) x x 0, x x 0 f (x 0 ), x = x 0. φ f (x) = = f (x 0 ) = φ f (x 0 ). This proves that φ f is continuous at x 0. Moreover, (1.1) holds for all x X by definition of φ f. ((1.1) is clearly true when x x 0. When x = x 0, both sides of (1.1) are zero.) Therefore (ii) follows. 1
2 (ii) = (i) : For x X \ {x 0 }, solving (1.1) in terms of φ f (x) gives φ f (x) = f (x) f (x 0). Taking it as x x 0, by the continuity of φ f at x 0, Therefore f is differentiable at x 0 and f (x 0 ) = φ f (x 0 ). = φ f (x) = φ f (x 0 ). 2 Solutions Exercise 1. Let X be a subset of R and let f : X R be a function. Then the following two statements are equivalent. (i) f is uniformly continuous on X. (ii) For any two equivalent sequences (a n ) n=m, (b n ) n=m, the sequences ( f (a n )) n=m, ( f (b n )) n=m are also equivalent sequences. Solution. (i) = (ii) : Let (a n ) n=m, (b n ) n=m be sequences in X which are equivalent. Then for any ε > 0, By the uniform convergence of f, there exists δ > 0 such that whenever x, y X and x y < δ we have f (x) f (y) < ε. By the equivalence, there exists N N such that whenever n N we have a n b n < δ. Combining two statements, it follows that whenever n N we have f (a n ) f (b n ) < ε. This proves that ( f (a n )) n=m, ( f (b n )) n=m are also equivalent sequences. (ii) = (i) : We prove contrapositive. Let us assume that f is not uniformly continuous. By negating Definition 3.31, There exists ε > 0 such that for any δ > 0 there exists x, y X such that x y < δ but f (x) f (y) ε. Now for each choice δ = n 1 (with n {1,2, }) pick such two elements a n, b n X (that is, a n b n < δ = n 1 but f (a n ) f (b n ) ε). Then (a n ) n=1, (b n) n=1 are equivalent but ( f (a n)) n=m, ( f (b n )) n=m cannot be equivalent. This proves the contrapositive as desired. Exercise 2. Give an example of a continuous function f : R (0, ) such that, for any real number 0 < ε < 1, there exists x R such that f (x) = ε. Remark. In view of the Maximum Principle, a continuous function f : R (0, ) must attain positive minimum on any finite closed interval [a, b] R. Consequently, if ε > 0 is small, any solution of f (x) = ε have large size. This in particular suggests that any continuous function f : R (0, ) satisfying x f (x) = 0 serves an example. 1 st Solution. Let f (x) = 2 x. Then clearly f is a continuous function with range (0, ). Moreover, for any 0 < ε < 1 we have f (log 2 ε) = ε. Therefore f satisfies all the desired properties. If you raise an objection by claiming that we have never learned both exponential function and logarithm in this course, here is another solution: 2 nd Solution. Let f : R (0, ) by f (x) = x. 2
3 Since f is defined by applying arithmetic operations on continuous functions such that denominator never vanishes, f defines a continuous function on R. Also, whenever 0 < ε < 1 we have ε 1 1 > 0 and hence f (ε 1 1 1) = 1 + (ε 1 1) = ε. Therefore f satisfies all the desired property. Exercise 3. Let X be a subset of R and let f : X R be a uniformly continuous function. Let x 0 be an adherent point of X. Then x x0 f (x) exists (and so it is a real number.) Solution. We divide the proof into two steps. Each step contains some important ideas which deserve their own right. Step 1. We prove the following lemma: Lemma. Let X be a subset of R and let f : X R be a uniformly continuous function. Then for every Cauchy sequence (a n ) n=m in X, the sequence ( f (a n )) n=m is also a Cauchy sequence. Proof of Lemma. Let ε > 0. Then There exists δ > 0 such that whenever x, y X and x y < δ we have f (x) f (y) < ε. There exists N m such that whenever j, k N we have a j a k < δ. Combining two statements, we have f (a j ) f (a k ) < ε whenever j, k N. This proves that ( f (a n )) n=m as desired. Remark. Before moving to the next step, we remark that this Lemma does not characterize uniform continuity. Indeed, f (x) = x 2 is not uniformly continuous, yet still mapping Cauchy sequences to Cauchy sequences. In fact, it is equivalent to the condition that f : X R is uniformly continuous on any bounded subsets of X. Step 2. To prove the original problem, we utilize Proposition Indeed, let (a n ) n=0 and (b n) n=0 be any sequences in X that converge to x 0. Since ( f (a n )) n=0 and ( f (b n)) n=0 are Cauchy sequences by the Lemma above, they are also convergent. Let L = f (b n ). n Note that (a n ) n=0 and (b n) n=0 are equivalent, since we have n (a n b n ) = x 0 x 0 = 0. Then by Proposition 3.37 (Exercise 8.1), ( f (a n )) n=0 and ( f (b n)) n=0 are also equivalent. Thus f (a n) = ( f (a n ) f (b n )) + f (b n ) = 0 + L = L. n n n Therefore by Proposition 2.16, f converges to L at x 0. Exercise 4. Let X be a subset of R, and let f : X R be a uniformly continuous function. Assume that E is a bounded subset of X. Then f (E) is also bounded. 1 st Solution. We first present a proof by contradiction. Assume that f (E) is unbounded. Then for each n N, there exists a n E such that f (a n ) n. But since E is bounded, (a n ) n=0 is also bounded. Thus by the Bolzano-Weierstrass Theorem, there exists a subsequence (a j(n)) n=0 of (a n ) n=0 which is convergent. Let x 0 = n a j(n) denotes the it. Then by Lemma 2.13, x 0 is an adherent point of X. Thus by Corollary 3.40 (Exercise 8.3), we know that n f (a j(n) ) exists. But since f (a j(n) ) j(n) n, by choosing a sufficiently large n we get a contradiction. (Just pick n to be larger than a bound of ( f (a j(n) )) n=0.) 3
4 2 nd Solution. We present a direct proof. To make proof simple, we introduce some notations: Pick an arbitrary ε > 0. Then by the uniform continuity of f, we can choose δ > 0 such that whenever x, y X and x y < δ we have f (x) f (y) < ε. Let K Z be defined by K = {k Z : E [kδ, (k + 1)δ) }. Since E is bounded, K is a finite set. (Indeed, choose a bound M > 0 of E, and choose N N such that N δ > M. Then K { N,, N}.) Now we are ready. For each k K, pick an element x k E [kδ, (k + 1)δ). Since K is finite, L := ε + max{ f (x k ) : k K} is a well-defined positive real number. Moreover, for any x E, there exists k K such that x E [kδ, (k + 1)δ). Then x x k < δ and hence f (x) f (x k ) < ε. This shows that This proves that f (E) is also bounded. f (x) f (x) f (x k ) + f (x k ) ε + max{ f (x k ) : k K} = L. Exercise 5. Let X be a subset of R, let x 0 be a it point of X, and let f : X R be a function. If f is differentiable at x 0, then f is also continuous at x 0. Solution. We have ( ) = ( = ( ) f (x) f (x0 ) ( ) ) ( Therefore, by adding f (x 0 ) to both sides, it follows that f is continuous at x 0. ) ( ) = f (x 0 ) 0 = 0. Exercise 6. Let X be a subset of R, let x 0 be a it point of X, let f : X R be a function, and let L be a real number. Then the following two statements are equivalent. (i) f is differentiable at x 0 on X with derivative L. (ii) For every ε > 0, there exists a δ = δ(ε) > 0 such that, if x X satisfies < δ, then f (x) [ f (x 0 ) + L( )] ε. Solution. The proof is almost a tautology. Nevertheless we spell out every detail. (i) = (ii) : By definition, for every ε > 0, there exists δ = δ(ε) > 0 such that, if x X \ {x 0 } satisfies < δ, then L < ε. Now multiply both sides by. Then we have Since this continues to hold when x = x 0, we get (ii). f (x) [ f (x 0 ) + L( )] ε. (ii) = (i) : For every ε > 0, pick δ = δ(ε/2) > 0 as in (ii). Then whenever x X \ {x 0 } and < δ, we have f (x) [ f (x 0 ) + L( )] 1 2 ε. 4
5 Now divide both sides by. (This is possible because is positive.) Then we get L 1 x x 2 ε < ε. 0 This yields x x0 ;( )/( ) = L, which is equivalent to (i). Exercise 7. Let X be a subset of R, let x 0 be a it point of X, and let f : X R and g : X R be functions. (i) If f is constant, so that there exists c R such that f (x) = c, then f is differentiable at x 0 and f (x 0 ) = 0. (ii) If f is the identity function, so that f (x) = x, then f is differentiable at x 0 and f (x 0 ) = 1. (iii) If f, g are differentiable at x 0, then f + g is differentiable at x 0, and ( f + g) (x 0 ) = f (x 0 ) + g (x 0 ). (Sum Rule) (iv) If f, g are differentiable at x 0, then f g is differentiable at x 0, and ( f g) (x 0 ) = f (x 0 )g(x 0 ) + g (x 0 ) f (x 0 ). (Product Rule) (v) If f is differentiable at x 0, and if c R, then c f is differentiable at x 0, and (c f ) (x 0 ) = c f (x 0 ). (vi) If f, g are differentiable at x 0, then f g is differentiable at x 0, and ( f g) (x 0 ) = f (x 0 ) g (x 0 ). (vii) If g is differentiable at x 0, and if g(x) 0 for all x X, then 1/g is differentiable at x 0, and (1/g) (x 0 ) = g (x 0 )/(g(x 0 )) 2. (viii) If f, g are differentiable at x 0, and if g(x) 0 for all x X, then f /g is differentiable at x 0, and ( f /g) (x 0 ) = g(x 0) f (x 0 ) f (x 0 )g (x 0 ) (g(x 0 )) 2. (Quotient Rule) 1 st Solution. (i) Notice that = 0, x X \ {x 0 }. Taking it as x x 0 for x X \ {x 0 }, it follows that f is differentiable at x 0 and f (x 0 ) = 0. (ii) Notice that = 1, x X \ {x 0 }. Taking it as x x 0 for x X \ {x 0 }, it follows that f is differentiable at x 0 and f (x 0 ) = 1. (iii) Notice that [ f (x) + g(x)] [ f (x 0 ) + g(x 0 )] = f (x) f (x 0) + g(x) g(x 0), x X \ {x 0 }. Taking it as x x 0 for x X \ {x 0 }, we know from both the assumption and the Limit Laws that the right-hand side converges to f (x 0 ) + g (x 0 ). This proves the Sum Rule. (iv) Notice that f (x)g(x) f (x 0 )g(x 0 ) = f (x) f (x 0) g(x 0 ) + g(x) g(x 0) f (x), x X \ {x 0 }. Taking it as x x 0 for x X \ {x 0 }, we know from both the assumption and the Limit Laws that the right-hand side converges to f (x 0 )g(x 0 ) + g (x 0 ) f (x 0 ). This proves the Product Rule. (v) This follows by (i) and (iv). (vi) This follows by (iii) and (v), with the choice c = 1. (vii) Notice that [1/g(x)] [1/g(x 0 )] = g(x) g(x 0) 1 g(x)g(x 0 ), x X \ {x 0}. 5
6 Taking it as x x 0 for x X \ {x 0 }, we know from both the assumption and the Limit Laws that the right-hand side converges to g (x 0 )/g(x 0 ) 2. This proves (vii). (viii) This follows from (iv) and (vii). 2 nd Solution. We utilize the Weierstrass-Carathéodory formulation, Proposition 1.2. (i) Notice that (1.1) is satisfied with φ f (x) = 0. Therefore f is differentiable at x 0 with f (x 0 ) = φ f (x 0 ) = 0. (ii) Notice that (1.1) is satisfied with φ f (x) = 1. Therefore f is differentiable at x 0 with f (x 0 ) = φ f (x 0 ) = 1. (iii) Let φ f and φ g be as in (1.1) for f and g, respectively. Then f (x) + g(x) = [ f (x 0 ) + φ f (x)( )] + [g(x 0 ) + φ g (x)( )] = [ f (x 0 ) + g(x 0 )] + [φ f (x) + φ g (x)]( ), and hence φ(x) = φ f (x) + φ g (x) satisfies Proposition 1.2. This shows that f + g is differentiable at x 0 and ( f + g) (x 0 ) = φ(x 0 ) = φ f (x 0 ) + φ g (x 0 ) = f (x 0 ) + g (x 0 ). (iv) Let φ f and φ g be as in (1.1) for f and g, respectively. Then and hence f (x)g(x) = [ f (x 0 ) + φ f (x)( )][g(x 0 ) + φ g (x)( )] = f (x 0 )g(x 0 ) + [φ f (x)g(x 0 ) + φ g (x) f (x 0 ) + φ f (x)φ g (x)( )]( ), φ(x) = φ f (x)g(x 0 ) + φ g (x) f (x 0 ) + φ f (x)φ g (x)( ) satisfies Proposition 1.2. This shows that f g is differentiable at x 0 and (v) This follows by (i) and (iv). ( f g) (x 0 ) = φ(x 0 ) = φ f (x 0 )g(x 0 ) + φ g (x 0 ) f (x 0 ) + 0 = f (x 0 )g(x 0 ) + g (x 0 ) f (x 0 ). (vi) This follows by (iii) and (v), with the choice c = 1. (vii) Let φ g be as in (1.1) for g. Then ( 1 g(x) = 1 g(x 0 ) 1 g(x 0 ) 1 ) 1 = g(x) g(x 0 ) φ g (x) g(x)g(x 0 ) (), and hence φ(x) = φ g (x)/g(x)g(x 0 ) satisfies Proposition 1.2. This shows that 1/g is differentiable at x 0 and (1/g) (x 0 ) = φ(x 0 ) = φ g (x 0 ) g(x 0 ) 2 = g (x 0 ) g(x 0 ) 2. (viii) This follows from (iv) and (vii). Exercise 8. Let X, Y be subsets of R, let x 0 X be a it point of X, and let y 0 Y be a it point of Y. Let f : X Y be a function such that f (x 0 ) = y 0 and such that f is differentiable at x 0. Let g : Y R be a function that is differentiable at y 0. Then the function g f : X R is differentiable at x 0, and (g f ) (x 0 ) = g (y 0 ) f (x 0 ). Remark. This would have followed easily it it were true that g( f (x)) g( f (x 0 )) = g( f (x)) g( f (x 0)). Unfortunately, this is not always true as may vanish infinitely many times near x 0. We need to circumvent this technical issue. 6
7 1 st Solution. Let (a n ) n=0 be any sequence in X \ {x 0} which converges to x 0. Then we deduce from Exercise 8.5 that ( f (a n )) n=0 converges to f (x 0). Now we divide into two cases: Case 1) Assume that f (x 0 ) 0. Then for the choice ε = 1 2 f (x 0 ) > 0, there exists δ > 0 such that, whenever x X and < δ we have Then it follows from the reverse triangle inequality that f (x 0 )( ) ε. f (x 0 )( ) f (x 0 )( ) f (x 0 ) ε = ε since f (x 0 ) = 2ε. In particular, since 0, this implies that > 0 whenever < δ. Next, we pick N sufficiently large so that a n x 0 < δ whenever n N. Since a n X \ {x 0 }, it follows that f (a n ) f (x 0 ) > 0. Then our intuitive idea works and we have ( ) g( f (a n )) g( f (x 0 )) g( f (an )) g( f (x 0 )) f (a n ) f (x 0 ) = n a n x 0 n f (a n ) f (x 0 ) a n x 0 ( = n = g (y 0 ) f (x 0 ). g( f (a n )) g( f (x 0 )) f (a n ) f (x 0 ) ) ( n f (a n ) f (x 0 ) a n x 0 Case 2) Now assume that f (x 0 ) = 0. For ε = 42, pick δ > 0 such that, if y Y and y y 0 < δ then Then by the triangle inequality, we have g(y) g(y 0 ) g (y 0 )(y y 0 ) 42 y y 0. g(y) g(y 0 ) g (y 0 ) y y 0 + g(y) g(y 0 ) g (y 0 )(y y 0 ) ( g (y 0 ) + 42) y y 0. Also, choose N sufficiently large so that whenever n N, we have f (a n ) f (x 0 ) < δ. Then by noting that g( f (a n )) g( f (x 0 )) ( g (y 0 ) + 42) f (a n ) f (x 0 ), a n x 0 a n x 0 it follows from the squeezing theorem, together with n [ f (a n ) f (x 0 )]/(a n x 0 ) = f (x 0 ) = 0, we have g( f (a n )) g( f (x 0 )) = 0 = g (y 0 ) f (x 0 ). n a n x 0 Therefore, in any cases the Chain Rule follows. 2 nd Solution. Let φ f : X R and φ g : Y R, respectively, be as in the Weierstrass-Carathéodory formulation (Proposition 1.2) for f and g, respectively. Then g( f (x)) = g( f (x 0 )) + φ g ( f (x))[ ] = g( f (x 0 )) + φ g ( f (x))φ f (x)( ). Thus the function φ(x) = φ g ( f (x))φ f (x) is continuous at x 0 and satisfies (1.1). Thus it satisfies Proposition 1.2. This shows that g f is differentiable at x 0 and (g f ) (x 0 ) = φ(x 0 ) = φ g ( f (x 0 ))φ f (x 0 ) = g (y 0 ) f (x 0 ) ) Exercise 9. Let a < b be real numbers, and let f : (a, b) R be a function. If x 0 (a, b), if f is differentiable at x 0, and if f attains a local maximum or minimum at x 0, then f (x 0 ) = 0. Solution. We first consider local maximum case. Since x 0 is a local maximum point of f, there exists a sufficiently small 7
8 δ > 0 such that f attains a minimum on (x 0 δ, x 0 + δ) (a, b). Thenwe have 0, x 0 δ < x < x 0 0, x 0 < x < x 0 + δ. Thus taking right-it and left-it, we find that f (x 0 ) = 0 and f (x 0 ) = 0. + x x0 This proves that f (x 0 ) = 0. Local minimum case can be tackled in the same way. Exercise 10. Let a < b be real numbers, and let f : [a, b] R be a continuous function which is differentiable on (a, b). Assume that f (a) = f (b). Then there exists x (a, b) such that f (x) = 0. Solution. Utilizing the Maximum Principle, pick two points x 0, x 1 [a, b] such that f attains a global maximum at x 0 and a global minimum at x 1. If f (x 0 ) = f (x 1 ), then f must reduce to a constant function and hence the claim follows from Exercise 8.7.(i). (In this case, you can pick any point x (a, b).) In view of the previous observation, we may ssume f (x 0 ) f (x 1 ). This implies that either f (x 0 ) f (a) or f (x 1 ) f (a). In either cases, there exists a global extremum x of f, which is neither a nor b. Thus x is also a global extremum of f (a,b). Then x is a local extremum of f (a,b) and by the previous exercise, we have f (x) = 0. Exercise 11. Let X be a subset of R, let x 0 be a it point of X, and let f : X R be a function. If f is monotone increasing and if f is differentiable at x 0, then f (x 0 ) 0. If f is monotone decreasing and if f is differentiable at x 0, then f (x 0 ) 0. Solution. We first assume that f is monotone. If x X \ {x 0 }, then by dividing the cases based on whether x > x 0 or x < x 0, we find that 0 always holds. Now assume further that f is differentiable at x 0. Taking x x 0 in X \ {x 0 }, the inequality is preserved and hence we have f (x 0 ) = 0. For the monotone-decreasing case, this argument works exactly in the same way (but with inequalities reversed) to yield the corresponding proof. Exercise 12. Let a < b be real numbers, and let f : [a, b] R be a differentiable function. If f (x) > 0 for all x [a, b], then f is strictly monotone increasing. If f (x) < 0 for all x [a, b], then f is strictly monotone decreasing. If f (x) = 0 for all x [a, b], then f is a constant function. Solution. All these statements follows from the Mean Value Theorem in a direct manner. For example, assume first that f (x) > 0 for all x [a, b]. Then for any x < y in [a, b], the Mean Value Theorem says that there exists c [x, y] such that f (y) f (x) = f (c) > 0, y x 8
9 where the second inequality follows form the assumption. Multiplying y x to both sides, we get f (y) f (x) > 0, which implies that f is strictly increasing. The other two assertions are also proved in a similar manner. 9
Solution of the 7 th Homework
Solution of the 7 th Homework Sangchul Lee December 3, 2014 1 Preliminary In this section we deal with some facts that are relevant to our problems but can be coped with only previous materials. 1.1 Maximum
More informationProof. We indicate by α, β (finite or not) the end-points of I and call
C.6 Continuous functions Pag. 111 Proof of Corollary 4.25 Corollary 4.25 Let f be continuous on the interval I and suppose it admits non-zero its (finite or infinite) that are different in sign for x tending
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 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 informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationMATH 131A: REAL ANALYSIS (BIG IDEAS)
MATH 131A: REAL ANALYSIS (BIG IDEAS) Theorem 1 (The Triangle Inequality). For all x, y R we have x + y x + y. Proposition 2 (The Archimedean property). For each x R there exists an n N such that n > x.
More informationPrinciples of Real Analysis I Fall VII. Sequences of Functions
21-355 Principles of Real Analysis I Fall 2004 VII. Sequences of Functions In Section II, we studied sequences of real numbers. It is very useful to consider extensions of this concept. More generally,
More informationMATH 1A, Complete Lecture Notes. Fedor Duzhin
MATH 1A, Complete Lecture Notes Fedor Duzhin 2007 Contents I Limit 6 1 Sets and Functions 7 1.1 Sets................................. 7 1.2 Functions.............................. 8 1.3 How to define a
More informationFunctional Analysis HW #3
Functional Analysis HW #3 Sangchul Lee October 26, 2015 1 Solutions Exercise 2.1. Let D = { f C([0, 1]) : f C([0, 1])} and define f d = f + f. Show that D is a Banach algebra and that the Gelfand transform
More informationx y More precisely, this equation means that given any ε > 0, there exists some δ > 0 such that
Chapter 2 Limits and continuity 21 The definition of a it Definition 21 (ε-δ definition) Let f be a function and y R a fixed number Take x to be a point which approaches y without being equal to y If there
More information,... We would like to compare this with the sequence y n = 1 n
Example 2.0 Let (x n ) n= be the sequence given by x n = 2, i.e. n 2, 4, 8, 6,.... We would like to compare this with the sequence = n (which we know converges to zero). We claim that 2 n n, n N. Proof.
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 informationFunctional Analysis HW #1
Functional Analysis HW #1 Sangchul Lee October 9, 2015 1 Solutions Solution of #1.1. Suppose that X
More informationMATH 409 Advanced Calculus I Lecture 12: Uniform continuity. Exponential functions.
MATH 409 Advanced Calculus I Lecture 12: Uniform continuity. Exponential functions. Uniform continuity Definition. A function f : E R defined on a set E R is called uniformly continuous on E if for every
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 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 informationMATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions.
MATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions. Continuity Definition. Given a set E R, a function f : E R, and a point c E, the function f is continuous at c if
More informationMath 104: Homework 7 solutions
Math 04: Homework 7 solutions. (a) The derivative of f () = is f () = 2 which is unbounded as 0. Since f () is continuous on [0, ], it is uniformly continous on this interval by Theorem 9.2. Hence for
More informationAssignment-10. (Due 11/21) Solution: Any continuous function on a compact set is uniformly continuous.
Assignment-1 (Due 11/21) 1. Consider the sequence of functions f n (x) = x n on [, 1]. (a) Show that each function f n is uniformly continuous on [, 1]. Solution: Any continuous function on a compact set
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 informationHOMEWORK ASSIGNMENT 6
HOMEWORK ASSIGNMENT 6 DUE 15 MARCH, 2016 1) Suppose f, g : A R are uniformly continuous on A. Show that f + g is uniformly continuous on A. Solution First we note: In order to show that f + g is uniformly
More informationMATH 301 INTRO TO ANALYSIS FALL 2016
MATH 301 INTRO TO ANALYSIS FALL 016 Homework 04 Professional Problem Consider the recursive sequence defined by x 1 = 3 and +1 = 1 4 for n 1. (a) Prove that ( ) converges. (Hint: show that ( ) is decreasing
More informationAnalysis II - few selective results
Analysis II - few selective results Michael Ruzhansky December 15, 2008 1 Analysis on the real line 1.1 Chapter: Functions continuous on a closed interval 1.1.1 Intermediate Value Theorem (IVT) Theorem
More informationWe have been going places in the car of calculus for years, but this analysis course is about how the car actually works.
Analysis I We have been going places in the car of calculus for years, but this analysis course is about how the car actually works. Copier s Message These notes may contain errors. In fact, they almost
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationM17 MAT25-21 HOMEWORK 6
M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
More informationModule 7 : Applications of Integration - I. Lecture 20 : Definition of the power function and logarithmic function with positive base [Section 20.
Module 7 : Applications of Integration - I Lecture 20 : Definition of the power function and logarithmic function with positive base [Section 201] Objectives In this section you will learn the following
More informationALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ.
ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ. ANDREW SALCH 1. Hilbert s Nullstellensatz. The last lecture left off with the claim that, if J k[x 1,..., x n ] is an ideal, then
More informationA LITTLE REAL ANALYSIS AND TOPOLOGY
A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set
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 informationThus f is continuous at x 0. Matthew Straughn Math 402 Homework 6
Matthew Straughn Math 402 Homework 6 Homework 6 (p. 452) 14.3.3, 14.3.4, 14.3.5, 14.3.8 (p. 455) 14.4.3* (p. 458) 14.5.3 (p. 460) 14.6.1 (p. 472) 14.7.2* Lemma 1. If (f (n) ) converges uniformly to some
More informationLimits and Continuity
Chapter Limits and Continuity. Limits of Sequences.. The Concept of Limit and Its Properties A sequence { } is an ordered infinite list x,x,...,,... The n-th term of the sequence is, and n is the index
More informationDefinitions & Theorems
Definitions & Theorems Math 147, Fall 2009 December 19, 2010 Contents 1 Logic 2 1.1 Sets.................................................. 2 1.2 The Peano axioms..........................................
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 informationWe are now going to go back to the concept of sequences, and look at some properties of sequences in R
4 Lecture 4 4. Real Sequences We are now going to go back to the concept of sequences, and look at some properties of sequences in R Definition 3 A real sequence is increasing if + for all, and strictly
More informationMath 312 Spring08 Day 13
HW 3: Due Monday May 19 th. 11. 1 # 2, 3, 6, 10 11. 2 # 1, 3, 6 Math 312 Spring08 Day 13 11.1 Continuous Functions and Mappings. 1. Definition. Let A be a subset of R n i. A mapping F: A R n is said to
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 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 information6.2 Deeper Properties of Continuous Functions
6.2. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 69 6.2 Deeper Properties of Continuous Functions 6.2. Intermediate Value Theorem and Consequences When one studies a function, one is usually interested in
More informationMath LM (24543) Lectures 02
Math 32300 LM (24543) Lectures 02 Ethan Akin Office: NAC 6/287 Phone: 650-5136 Email: ethanakin@earthlink.net Spring, 2018 Contents Continuity, Ross Chapter 3 Uniform Continuity and Compactness Connectedness
More informationLecture 4 Lebesgue spaces and inequalities
Lecture 4: Lebesgue spaces and inequalities 1 of 10 Course: Theory of Probability I Term: Fall 2013 Instructor: Gordan Zitkovic Lecture 4 Lebesgue spaces and inequalities Lebesgue spaces We have seen how
More informationFunctions. Chapter Continuous Functions
Chapter 3 Functions 3.1 Continuous Functions A function f is determined by the domain of f: dom(f) R, the set on which f is defined, and the rule specifying the value f(x) of f at each x dom(f). If f is
More informationEcon Slides from Lecture 1
Econ 205 Sobel Econ 205 - Slides from Lecture 1 Joel Sobel August 23, 2010 Warning I can t start without assuming that something is common knowledge. You can find basic definitions of Sets and Set Operations
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 informationSolution. 1 Solution of Homework 7. Sangchul Lee. March 22, Problem 1.1
Solution Sangchul Lee March, 018 1 Solution of Homework 7 Problem 1.1 For a given k N, Consider two sequences (a n ) and (b n,k ) in R. Suppose that a n b n,k for all n,k N Show that limsup a n B k :=
More informationCONSEQUENCES OF POWER SERIES REPRESENTATION
CONSEQUENCES OF POWER SERIES REPRESENTATION 1. The Uniqueness Theorem Theorem 1.1 (Uniqueness). Let Ω C be a region, and consider two analytic functions f, g : Ω C. Suppose that S is a subset of Ω that
More informationSets, Functions and Metric Spaces
Chapter 14 Sets, Functions and Metric Spaces 14.1 Functions and sets 14.1.1 The function concept Definition 14.1 Let us consider two sets A and B whose elements may be any objects whatsoever. Suppose that
More informationMATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE
MATH 101, FALL 2018: SUPPLEMENTARY NOTES ON THE REAL LINE SEBASTIEN VASEY These notes describe the material for November 26, 2018 (while similar content is in Abbott s book, the presentation here is different).
More informationSequences of Real Numbers
Chapter 8 Sequences of Real Numbers In this chapter, we assume the existence of the ordered field of real numbers, though we do not yet discuss or use the completeness of the real numbers. In the next
More information4. We accept without proofs that the following functions are differentiable: (e x ) = e x, sin x = cos x, cos x = sin x, log (x) = 1 sin x
4 We accept without proofs that the following functions are differentiable: (e x ) = e x, sin x = cos x, cos x = sin x, log (x) = 1 sin x x, x > 0 Since tan x = cos x, from the quotient rule, tan x = sin
More informationAPPLICATIONS OF DIFFERENTIABILITY IN R n.
APPLICATIONS OF DIFFERENTIABILITY IN R n. MATANIA BEN-ARTZI April 2015 Functions here are defined on a subset T R n and take values in R m, where m can be smaller, equal or greater than n. The (open) ball
More informationIowa State University. Instructor: Alex Roitershtein Summer Homework #5. Solutions
Math 50 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 205 Homework #5 Solutions. Let α and c be real numbers, c > 0, and f is defined
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More informationA lower bound for X is an element z F such that
Math 316, Intro to Analysis Completeness. Definition 1 (Upper bounds). Let F be an ordered field. For a subset X F an upper bound for X is an element y F such that A lower bound for X is an element z F
More informationMath 421, Homework #6 Solutions. (1) Let E R n Show that = (E c ) o, i.e. the complement of the closure is the interior of the complement.
Math 421, Homework #6 Solutions (1) Let E R n Show that (Ē) c = (E c ) o, i.e. the complement of the closure is the interior of the complement. 1 Proof. Before giving the proof we recall characterizations
More informationCOT 2104 Homework Assignment 1 (Answers)
1) Classify true or false COT 2104 Homework Assignment 1 (Answers) a) 4 2 + 2 and 7 < 50. False because one of the two statements is false. b) 4 = 2 + 2 7 < 50. True because both statements are true. c)
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationStatic Problem Set 2 Solutions
Static Problem Set Solutions Jonathan Kreamer July, 0 Question (i) Let g, h be two concave functions. Is f = g + h a concave function? Prove it. Yes. Proof: Consider any two points x, x and α [0, ]. Let
More informationChapter 2. Metric Spaces. 2.1 Metric Spaces
Chapter 2 Metric Spaces ddddddddddddddddddddddddd ddddddd dd ddd A metric space is a mathematical object in which the distance between two points is meaningful. Metric spaces constitute an important class
More informationmeans is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.
1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for
More 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 informationFUNCTIONS OF A REAL VARIABLE
FUNCTIONS OF A REAL VARIABLE TSOGTGEREL GANTUMUR Abstract. We review some of the important concepts of single variable calculus. The discussions are centred around building and establishing the main properties
More information5.5 Deeper Properties of Continuous Functions
5.5. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 195 5.5 Deeper Properties of Continuous Functions 5.5.1 Intermediate Value Theorem and Consequences When one studies a function, one is usually interested
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 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 informationExam 2 extra practice problems
Exam 2 extra practice problems (1) If (X, d) is connected and f : X R is a continuous function such that f(x) = 1 for all x X, show that f must be constant. Solution: Since f(x) = 1 for every x X, either
More informationNotes on Integrable Functions and the Riesz Representation Theorem Math 8445, Winter 06, Professor J. Segert. f(x) = f + (x) + f (x).
References: Notes on Integrable Functions and the Riesz Representation Theorem Math 8445, Winter 06, Professor J. Segert Evans, Partial Differential Equations, Appendix 3 Reed and Simon, Functional Analysis,
More information(a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff
Chapter 4: Functional Limits and Continuity Definition. Let S R and f : S R. (a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff ε > 0, δ
More informationA lower bound for X is an element z F such that
Math 316, Intro to Analysis Completeness. Definition 1 (Upper bounds). Let F be an ordered field. For a subset X F an upper bound for X is an element y F such that A lower bound for X is an element z F
More informationNotes on uniform convergence
Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean
More informationMost Continuous Functions are Nowhere Differentiable
Most Continuous Functions are Nowhere Differentiable Spring 2004 The Space of Continuous Functions Let K = [0, 1] and let C(K) be the set of all continuous functions f : K R. Definition 1 For f C(K) we
More information1 Lecture 25: Extreme values
1 Lecture 25: Extreme values 1.1 Outline Absolute maximum and minimum. Existence on closed, bounded intervals. Local extrema, critical points, Fermat s theorem Extreme values on a closed interval Rolle
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 informationSpring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures
36-752 Spring 2014 Advanced Probability Overview Lecture Notes Set 1: Course Overview, σ-fields, and Measures Instructor: Jing Lei Associated reading: Sec 1.1-1.4 of Ash and Doléans-Dade; Sec 1.1 and A.1
More informationFrom now on, we will represent a metric space with (X, d). Here are some examples: i=1 (x i y i ) p ) 1 p, p 1.
Chapter 1 Metric spaces 1.1 Metric and convergence We will begin with some basic concepts. Definition 1.1. (Metric space) Metric space is a set X, with a metric satisfying: 1. d(x, y) 0, d(x, y) = 0 x
More information2.3 Some Properties of Continuous Functions
2.3 Some Properties of Continuous Functions In this section we look at some properties, some quite deep, shared by all continuous functions. They are known as the following: 1. Preservation of sign property
More informationL p Spaces and Convexity
L p Spaces and Convexity These notes largely follow the treatments in Royden, Real Analysis, and Rudin, Real & Complex Analysis. 1. Convex functions Let I R be an interval. For I open, we say a function
More informationCalculus (Real Analysis I)
Calculus (Real Analysis I) (MAT122β) Department of Mathematics University of Ruhuna A.W.L. Pubudu Thilan Department of Mathematics University of Ruhuna Calculus (Real Analysis I)(MAT122β) 1/172 Chapter
More informationMA651 Topology. Lecture 9. Compactness 2.
MA651 Topology. Lecture 9. Compactness 2. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology
More informationEXTINGUISHING THE DISTINGUISHED LOGARITHM PROBLEMS. University of California Irvine, University of California Irvine, and Auburn University
EXTINGUISHING THE DISTINGUISHED LOGARITHM PROBLEMS By Mark Finkelstein, Howard G. Tucker, and Jerry Alan Veeh University of California Irvine, University of California Irvine, and Auburn University July
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 informationOptimization and Optimal Control in Banach Spaces
Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex non-smooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
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 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 informationMath 430/530: Advanced Calculus I Chapter 1: Sequences
Math 430/530: Advanced Calculus I Chapter 1: Sequences Fall 2018 Sequences A sequence is just a list of real numbers a 1, a 2,... with a definite order. We write a = (a n ) n=1 for a sequence a with n
More informationImmerse Metric Space Homework
Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps
More informationMath 117: Honours Calculus I Fall, 2002 List of Theorems. a n k b k. k. Theorem 2.1 (Convergent Bounded) A convergent sequence is bounded.
Math 117: Honours Calculus I Fall, 2002 List of Theorems Theorem 1.1 (Binomial Theorem) For all n N, (a + b) n = n k=0 ( ) n a n k b k. k Theorem 2.1 (Convergent Bounded) A convergent sequence is bounded.
More informationA CONTINUOUS AND NOWHERE DIFFERENTIABLE FUNCTION, FOR MATH 320
A CONTINUOUS AND NOWHERE DIFFERENTIABLE FUNCTION, FOR MATH 320 This note is a demonstration of some of the details in Abbott s construction of a nowhere differentiable continuous function. The discovery
More informationPartial differential equation for temperature u(x, t) in a heat conducting insulated rod along the x-axis is given by the Heat equation:
Chapter 7 Heat Equation Partial differential equation for temperature u(x, t) in a heat conducting insulated rod along the x-axis is given by the Heat equation: u t = ku x x, x, t > (7.1) Here k is a constant
More informationChapter 3 Continuous Functions
Continuity is a very important concept in analysis. The tool that we shall use to study continuity will be sequences. There are important results concerning the subsets of the real numbers and the continuity
More informationa n b n ) n N is convergent with b n is convergent.
32 Series Let s n be the n-th partial sum of n N and let t n be the n-th partial sum of n N. For k n we then have n n s n s k = a i a i = t n t k. i=k+1 i=k+1 Since t n n N is convergent by assumption,
More informationChapter 2 Metric Spaces
Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics
More information2. Prime and Maximal Ideals
18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let
More informationCHAPTER 6. Limits of Functions. 1. Basic Definitions
CHAPTER 6 Limits of Functions 1. Basic Definitions DEFINITION 6.1. Let D Ω R, x 0 be a limit point of D and f : D! R. The limit of f (x) at x 0 is L, if for each " > 0 there is a ± > 0 such that when x
More informationWe saw in the previous lectures that continuity and differentiability help to understand some aspects of a
Module 3 : Differentiation and Mean Value Theorems Lecture 9 : Roll's theorem and Mean Value Theorem Objectives In this section you will learn the following : Roll's theorem Mean Value Theorem Applications
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More information2 Sequences, Continuity, and Limits
2 Sequences, Continuity, and Limits In this chapter, we introduce the fundamental notions of continuity and limit of a real-valued function of two variables. As in ACICARA, the definitions as well as proofs
More information