LECTURE 9 LIMITS AND CONTINUITY FOR FUNCTIONS OF SEVERAL VARIABLES

Similar documents
MA 102 (Multivariable Calculus)

Metric Spaces and Topology

MATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University

Chapter 2 Metric Spaces

Some Background Material

Functional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...

Metric Spaces Lecture 17

2 Sequences, Continuity, and Limits

Math 117: Topology of the Real Numbers

Econ Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n

Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011

March 25, 2010 CHAPTER 2: LIMITS AND CONTINUITY OF FUNCTIONS IN EUCLIDEAN SPACE

g 2 (x) (1/3)M 1 = (1/3)(2/3)M.

Introduction to Proofs

M311 Functions of Several Variables. CHAPTER 1. Continuity CHAPTER 2. The Bolzano Weierstrass Theorem and Compact Sets CHAPTER 3.

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAS3706 Topology. Revision Lectures, May I do not answer enquiries as to what material will be in the exam.

MA651 Topology. Lecture 10. Metric Spaces.

Topological properties of Z p and Q p and Euclidean models

Analysis-3 lecture schemes

A Primer on Lipschitz Functions by Robert Dr. Bob Gardner Revised and Corrected, Fall 2013

Chapter II. Metric Spaces and the Topology of C

Chapter 2. Metric Spaces. 2.1 Metric Spaces

Selçuk Demir WS 2017 Functional Analysis Homework Sheet

MATH 23b, SPRING 2005 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Midterm (part 1) Solutions March 21, 2005

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Lecture Notes DRE 7007 Mathematics, PhD

COMPLETION OF A METRIC SPACE

Part III. 10 Topological Space Basics. Topological Spaces

Lecture 9 Metric spaces. The contraction fixed point theorem. The implicit function theorem. The existence of solutions to differenti. equations.

Course 212: Academic Year Section 1: Metric Spaces

Continuity. Chapter 4

Continuity. Chapter 4

REVIEW OF ESSENTIAL MATH 346 TOPICS

Lecture 3. Econ August 12

McGill University Math 354: Honors Analysis 3

NOTES FOR MAT 570, REAL ANALYSIS I, FALL Contents

From 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.

Functional Analysis Exercise Class

Theorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers

MATH 409 Advanced Calculus I Lecture 12: Uniform continuity. Exponential functions.

P-adic Functions - Part 1

Multivariable Calculus

Notions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy

Metric Spaces. DEF. If (X; d) is a metric space and E is a nonempty subset, then (E; d) is also a metric space, called a subspace of X:

Part A. Metric and Topological Spaces

Exercises to Applied Functional Analysis

Aperiodic Substitution Tilings

Hilbert Spaces. Contents

Characterisation of Accumulation Points. Convergence in Metric Spaces. Characterisation of Closed Sets. Characterisation of Closed Sets

Introduction to Real Analysis Alternative Chapter 1

Introduction to Functional Analysis

Analysis III Theorems, Propositions & Lemmas... Oh My!

Solutions to Tutorial 7 (Week 8)

A LITTLE REAL ANALYSIS AND TOPOLOGY

Metric spaces and metrizability

Optimization Theory. A Concise Introduction. Jiongmin Yong

Convex Analysis and Economic Theory Winter 2018

(x, y) = d(x, y) = x y.

9 Sequences of Functions

1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3

MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:

Notes on uniform convergence

Sets, Functions and Metric Spaces

1 Directional Derivatives and Differentiability

01. Review of metric spaces and point-set topology. 1. Euclidean spaces

1. Continuous Functions between Euclidean spaces

Economics 204 Summer/Fall 2017 Lecture 7 Tuesday July 25, 2017

Existence and Uniqueness

Lecture 2: A crash course in Real Analysis

(convex combination!). Use convexity of f and multiply by the common denominator to get. Interchanging the role of x and y, we obtain that f is ( 2M ε

Contents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3

Existence and uniqueness of solutions for nonlinear ODEs

7 Convergence in R d and in Metric Spaces

Introduction to Dynamical Systems

METRIC SPACES KEITH CONRAD

MA651 Topology. Lecture 9. Compactness 2.

Discussion Paper Series

Appendix B Convex analysis

Contents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping.

Supplementary Notes for W. Rudin: Principles of Mathematical Analysis

Continuity of convex functions in normed spaces

1.4 The Jacobian of a map

FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets

Analysis Comprehensive Exam Questions Fall F(x) = 1 x. f(t)dt. t 1 2. tf 2 (t)dt. and g(t, x) = 2 t. 2 t

Inverse Function Theorem

7 Complete metric spaces and function spaces

After taking the square and expanding, we get x + y 2 = (x + y) (x + y) = x 2 + 2x y + y 2, inequality in analysis, we obtain.

Berge s Maximum Theorem

Lipschitz continuity properties

Math General Topology Fall 2012 Homework 1 Solutions

Chapter 7. Metric Spaces December 5, Metric spaces

arxiv: v2 [math.mg] 14 Apr 2014

2.4 The Extreme Value Theorem and Some of its Consequences

Introduction to Real Analysis

Applied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books.

AM 106/206: Applied Algebra Madhu Sudan 1. Lecture Notes 12

Chapter 10. Multivariable integral Riemann integral over rectangles Rectangles and partitions

Based on the Appendix to B. Hasselblatt and A. Katok, A First Course in Dynamics, Cambridge University press,

Transcription:

LECTURE 9 LIMITS AND CONTINUITY FOR FUNCTIONS OF SEVERAL VARIABLES We suppose that the reader is familiar with the concept of limit and continuity for real functions of one variable. We would like to extend these notions to functions of several variables (with values in an Euclidean space), or more generally, to functions between metric spaces. 1. Limits of functions Definition. Let (X, d) and (Y, d ) be two metric spaces, A X a nonempty set, a function f A Y and x 0 A (i.e., x 0 is a limit point for A). We say that an element l Y is the limit of f in x 0 if V V d (l), U V d (x 0 ), x V {x 0 } f (x) V, where V d (x 0 ) and V d (l) are the families of neighbourhoods of x 0, respectively l. In this case, we write lim f (x) = l or f (x) l. As in the case of limits of sequence, one can show that the limit of a function in a point, if existent, is unique. We say that the function f has a limit in the point x 0 if there exists l Y such that lim f (x) = l. Instead of the families of neighbourhoods in the above definition one can use systems of neighbourhoods, in particular the systems of neighbourhoods composed by the balls centered in x 0, respectively l. In this regard, we have the following characterization of the limit of a function: Proposition 1.1. Let (X, d) and (Y, d ) be two metric spaces, A X a nonempty set and a function f A Y. For x 0 A and l Y, the following statements are equivalent: (i) lim f (x) = l; (ii) if U (x 0 ) and U (l) are systems of neighbourhoods for x 0, respectively l, then V U (l), U U (x 0 ), x V {x 0 } f (x) V ; (iii) ε > 0, δ > 0, x B d (x 0 ;δ) {x 0 } d (f (x),l) < ε, where B d (x 0 ;δ) is the open ball centered in x 0 of radius δ. Relation (iii) can be written ε > 0, δ > 0 0 < d(x,x 0 ) < δ d (f (x),l) < ε. In the particular case that X and Y are normed spaces, we have: Proposition 1.2. Let (X, ) and (Y, ) be two normed spaces, A X a nonempty set and a function f A Y. An element l Y is the limit of f in some point x 0 A if and only if ε > 0, δ > 0 0 < x x 0 < δ (f (x) l < ε. With the help of convergent sequences we can give an important characterization for the limit of a function. Theorem 1.3. Let (X, d) and (Y, d ) be two metric spaces, A X a nonempty set and a function f A Y. An element l Y is the limit of f in some point x 0 A if and only if for every sequence (x n ) n A {x 0 } such that lim x n = x 0, we n have lim f (x n) = l. n Remarks. 1. When someone wants to prove that lim f (x) /= l, it is enough to give an example of some sequence (x n ) n A {x 0 } converging to x 0 such that f (x n ) does not converge to l. 2. If, moreover, somebody wants to show that lim f (x) does not exist, it is sufficient to point out two sequences (x n ) n and (x n ) n in A {x 0 } such that lim f (x n) = l and lim f n n (x n) = l, where l,l Y with l l. Example. Let the function f 2 {(0, 0)} be defined by xy f (x,y) = x 2 + y 2, (x,y) 2 {(0, 0)}. 1

Then (0, 0) A, where A = 2 {(0, 0)}. If we take the sequence, (x n,y n ) n 2 {(0, 0)}, x n = 1 n, y n = 1 n, n, we have (x n,y n ) n (0, 0) and f (x n,y n ) = 1 n 1 2 2. On the other hand, if we take the sequence, (x n,y n) n 2 {(0, 0)}, x n = 1 n, y n = 1 n, n, we have (x 2 n,y n ) n (0, 0) and f (x n,y n ) = 1 n 3 1 n 2 + 1 n 4 = n n n 2 0. + 1 The conclusion is that the function f does not possess a limit in the point (0, 0). As in the case of limits of sequence, the following series of criteria applies in the case of limits of functions. Proposition 1.4. Let (X, d) and (Y, d ) be two metric spaces, A X a nonempty set, the functions f A Y, д A + and x 0 A, l Y. If (i) d (f (x),l) д(x), x A; (ii) lim д(x) = 0, then lim f (x) = l. Theorem 1.5 (Cauchy-Bolzano). Let (X, d) be a metric space, (Y, d ) a complete metric space, A X a nonempty set, x 0 A and a function f X Y. Then f has a limit in the point x 0 if and only if ε > 0, δ > 0, x,x B(x 0,δ) {x 0 } d (f (x), f (x )) < ε. Theorem 1.6. Let (X, d) be a metric space, (Y, ) a normed space, A X a nonempty set, x 0 A and a function f X Y. i) If there exists lim f (x) = l, then lim f (x) = l. ii) If lim f (x) = 0, then lim f (x) = 0 Y. iii) If there exists lim f (x) > 0, then there exists δ > 0 such that f (x) 0 Y, x B(x 0 ;δ) {x 0 }. For functions having values in a normed space, the addition and the scalar multiplication are closed to the operation of taking limits. More precisely, we have: Theorem 1.7. Let (X, d) be a metric space, (Y, ) a normed space, A X a nonempty set and x 0 A. i) If f,д X Y are functions such that lim f (x) = l 1 Y and lim д(x) = l 2 Y exist, then we have lim (α f + βд)(x) = αl 1 + βl 2. ii) If f X Y and φ X are functions such that lim f (x) = l Y and lim φ(x) = α exist, then we have lim φ(x)f (x) = αl. In the case of Euclidean spaces, one can compute the limits of functions on components: Theorem 1.8. Let A n be a nonempty set, f A m and x 0 A. Then there exists lim f (x) = l m if and only if x x0 for every k {1,...,m} there exists the limit lim f k (x) = l k, where f k, 1 k m are the m components of the function x x0 f. Moreover, in this case, l = (l 1,...,l m ). The next result shows us how we can compute limits for composed functions: Theorem 1.9 (substitution principle). Let (X, d), (Y, d ) and (Z, d ) be three metric spaces, A X, B Y non-empty sets, the functions f A B, д B Z and x 0 A, y 0 B. If (i) lim f (x) = y 0 ; (ii) lim д(y) = l Z; y y 0 (iii) V V (x 0 ), x V {x 0 } f (x) y 0, then lim y y 0 д(f (x)) = l. 2

A commun mistake when computing limits of functions of several variables is to iterate the limit. Let us exemplify that mistake by considering the function f 2 {(0, 0)} defined by Then, fixing some y, we have f (x,y) = Letting now y 0, we obtain the iterated limit x 2 y 2 x 2 y 2 + (x y) 2, (x,y) 2 {(0, 0)}. lim f (x,y) = 0. x 0 lim lim f (x,y) = 0. y 0 x 0 By symmetry we get the other iterated limit lim lim f (x,y) = 0. x 0 y 0 However, f does not have a limit in (0, 0), since f ( 1 n, 1 n ) = 1 n 1 and f ( 1 n On the other hand, a function f might have a limit in some point, but not iterated limits. For that, let A = {(x,y) 2 xy 0} and f A defined by f (x,y) = (x + y) sin 1 x sin 1 y., 0) = 0 n 0. Then f (x,y) д(x,y) = x + y. Since lim д(x,y) = 0, we get, by Proposition 1.4 that lim f (x,y) = 0. (x,y) (0,0) (x,y) (0,0) On the other hand, if we try to compute the limit lim f (x,y) for some y, we obtain that lim x sin 1 x 0 x 0 x = 0 (because x sin 1 x x, x ), but x sin 1 x does not have a limit in 0. Therefore, since f (x,y) = (x sin 1 x ) sin 1 y + (sin 1 x ) (y sin 1 y ), f (x,y) does not have a limit as x 0 if sin 1 1 y 0, i.e. y kπ, k. It is clear now that the problem of existence of the iterated limit lim lim f (x,y) has a negative answer. y 0 x 0 The above considerations can be easily extended to the case of more than two variables. Let us now see what happens if we demand that taking limits to be done over a predefined direction (in a linear space). Definition. Let A n be a nonempty set, f A m and x 0 n. a) We say that the function f has a limit in x 0 along the direction u n if 0 {t 0 x 0 + tu A} (i.e., there exists a sequence t n 0 such that x 0 +t n u A, n ) and there exists the limit of the function (0, + ) t f (x 0 +tu) in t = 0, i.e. there exists the limit (to be defined later) l u = lim t 0 f (x 0 + tu). b) We say that the function f has a (k th -) partial limit in x 0 if f has a limit in x 0 along the direction e k, for k {1,...,n}, where e k = (0,..., 0, 1, 0,..., 0). k The existence of a global limit implies the existence of directional limits. More precisely, we have: Proposition 1.10. Let A n be a nonempty set, f A m and x 0 A such that there exists lim x x0 f (x) = l m. If u n {0 n } is such that 0 {t 0 x 0 + tu A}, then there exists the limit of f in x 0 along the direction u and is equal to l. The converse of this result is not true; in fact, even if the limits along all the directions exist and are equal, a global limit might not exist, as the following example shows: Example. Let f 2 be defined by xy 2 f (x,y) = x 2 +y, (x,y) (0, 0); 4 0, (x,y) = (0, 0). Let (u,v) be a direction in 2 {(0, 0). Then, for t > 0, f ((0, 0) + t(u,v)) = f (tu,tv) = t 3 uv 2 t 2 (u 2 + t 2 v 4 ) = tuv 2 u 2 + t 2 v 4. 3

Hence lim f ((0, 0) + t(u,v)) = 0, i.e. the limit of f in (0, 0) along the direction (u,v) exists and is equal to 0. Of course, t 0 this takes place even if (u,v) = (0, 0). However, f does not have a global limit in (0, 0) because f ( 1 n, 1 2 n ) = 1 n 2 1 2 0. When f is a function of one variable, the only possible non-null directions (up to a multiplicative positive scalar) are 1 and 1. In this case, we will speak about left and right limits. Definition. Let A be a nonempty set. a) We say that x 0 is a left-limit point (right-limit point) of A if x is a limit point for the set A (,x 0 ) (A (x 0, + )). b) If f A m is a function and x 0 is a left-limit point (right-limit point), we say that f has a left-limit (rightlimit) in x 0 if there exists the limit of f in x 0 along the direction 1 (1). In this case, we will denote this limit lim f (x), f (x 0 0) or f (x0 ) ( lim f (x), f (x 0 + 0) or f (x 0 + )). x x 0 x x 0 In the case n = 1, the converse of Proposition 1.10 does hold: Proposition 1.11. Let A n be a nonempty set, f A m and x 0 be both a left-limit and a right-limit point of A. Then the limit lim f (x) exists if and only if both limits lim f (x) and lim f (x) exist and are equal. In this case, x x 0 x x 0 lim f (x) = lim f (x) = lim f (x). x x 0 x x 0 At the end of this section we recall some of the most usual limits of functions: lim t 0 (1 + t) 1/t = e; lim t ± (1 + 1 t )t = e; log lim a (1 + t) = 1 ln a (a > 0, a 1); ln(1 + t) a t 1 lim = lna (a > 0); e t 1 (1 + t) r 1 lim = r (r ); sint tgt arcsint arctgt lim = 1. 2. Continuous functions Definition. Let (X, d) and (Y, d ) be two metric spaces, A X a nonempty set and a function f A Y. a) We say that f is continuous in a point x 0 A if V V d (f (x 0 )), U V d (x 0 ), x V f (x) V. b) We say that f is discontinuous in a point x 0 A if f is not continuous in x 0 ; in this case, we also say that x 0 is a discontinuity point of f. c) We say that f is continuous if f is continuous in x 0, for every x 0 A. We see that the notion of continuity of a function is very close to that of the limit of a function. In fact, f is continuous in x 0 A if and only if either x 0 is a limit point for A and lim f (x) = f (x 0 ) or x 0 is an isolated point. As in the case of limits of functions, one can characterize the continuity with systems of neighbourhoods or in the ε-δ language. We present only the latter. Proposition 2.1. Let (X, d) and (Y, d ) be two metric spaces, A X a nonempty set, a function f A Y and x 0 A. Then f is continuous in x 0 if and only if ε > 0, δ > 0 d(x,x 0 ) < δ d (f (x), f (x 0 )) < ε. The continuity in some point can be characterized with sequences, too. Theorem 2.2. Let (X, d) and (Y, d ) be two metric spaces, A X a nonempty set, a function f A Y and x 0 A. Then f is continuous in x 0 if and only if for every sequence (x n ) n A such that lim x n = x 0, we have lim f (x n) = f (x 0 ). n n 4

It turns out that the global continuity (i.e., in all points) of a function can be characterized in terms of open or closed sets. Theorem 2.3. Let (X, d) and (Y, d ) be two metric spaces and a function f X Y. Then the following statements are equivalents: (i) f is continuous; (ii) for every open set D Y, the set f 1 [D] is open (with respect to d); (iii) for every closed set F Y, the set f 1 [F] is closed; (iv) for every subset A Y, we have f 1 [A] f 1 [A]. Definition. Let (X, d) and (Y, d ) be two metric spaces, A X a nonempty set, x 0 A and a function f A Y. If lim f (x) = l Y, then the function f A {x 0 } Y defined by f (x) = { f (x), x A {x 0}; l, x = x 0 is continuous in x 0 and is called the extension by continuity of f in x 0. Definition. Let (X, d) and (Y, d ) be two metric spaces. a) We say that a bijective function f X Y is a homeomorphism if f and f 1 are both continuous. b) We say that (X, d) and (Y, d ) are homeomorphic if there exists a homeomorphism between them. Remark. If f is an isometry between (X, d) and (Y, d ), then f is continuous. If, moreover, f is bijective, then f is a homeomorphism. Let us introduce some stronger notions of continuity. Definition. Let (X, d) and (Y, d ) be two metric spaces and f X Y a function. a) The function f is called uniformly continuous if ε > 0, δ > 0, x,y X d(x,y) < δ d (f (x), f (y)) < ε. b) The function f is called Lipschitz-continuous if there exists a constant c 1 > 0, called the Lipschitz constant of f, such that d (f (x), f (y)) c 1 d(x,y), x,y X. c) The function f is called Hölder-continuous of order α (0, 1] if there exists a constant c α > 0 such that d (f (x), f (y)) c α [d(x,y)] α, x,y X. Remarks. 1. An uniformly continuous function is continuous. 2. A Lipschitz-continuous is a Hölder-continuous function of order 1 (and vice versa). 3. Any Hölder-continuous function is uniformly continuous (for ε > 0, it is enough to set δ = ( ε c α ) 1/α ). Theorem 2.4. Let (X, d), (Y, d ) and (Z, d ) be three metric spaces, A X, B Y non-empty sets and the functions f A B, д B Z. i) If f is continuous in some point x 0 A and д is continuous in y 0 = f (x 0 ), then д f is continuous in x 0. ii) If f and д are continuous, then д f is continuous. Theorem 2.5. Let (X, d) be a metric space, (Y, ) a normed space, A X a nonempty set and x 0 A. i) If the functions f,д X Y are continuous in x 0, then α f + βд is continuous in x 0. ii) If the functions f X Y and φ X are continuous in x 0, then φ f is continuous in x 0. In general, if f is a continuous function between metric spaces, D is an open set and F is a closed set, then f [D] is not necessarely open set, nor f [F] is a closed set. However, there is a property which is preserved by continuity, and that is compactness. Definition. Let (X, d) be a metric space. We say that a subset K X is compact if every sequence (x n ) n K contains a convergent subsequence. By Bolzano-Weierstrass theorem, the compact subsets of are the closed, bounded subsets. Theorem 2.6. Let (X, d), (Y, d ) be metric spaces, K X a non-empty compact subset and f K Y a continuous function. Then f [K] is compact. 5

An immediate consequence is the following result: Theorem 2.7 (Weierstrass). Let (X, d) be a metric space, K X a non-empty compact subset and f K a continuous function. Then the function f is bounded and there exist x 0,x 1 K such that f (x 0 ) = min f (x) and f (x 1) = max f (x). x K x K Theorem 2.8 (Cantor). Let (X, d), (Y, d ) be metric spaces, K X a non-empty compact subset and f K Y a continuous function. Then f is uniformly continuous. Let us now analyze continuity of functions between Euclidean spaces. Theorem 2.9. Let A n be a nonempty set, f A m and x 0 = (x1 0,...,x0 m) A. Then f is continuous in x 0 if and only if f k is continuous in xk 0 for every k {1,...,m}. Proposition 2.10. If T n m is a linear mapping, then T is continuous. Definition. Let A be a nonempty set and f A m. a) We say that f is left-continuous (right-continuous) in x 0 A if f A (,x0 ] (f A [x 0,+ ) ) is continuous in x 0. b) We say that f is left-continuous (right-continuous) if f is left-continuous (right-continuous) in every x 0 A. Proposition 2.11. Let A n be a nonempty set, f A m and x 0 A. Then f is continuous in x 0 if and only if f is both left-continuous and right-continuous in x 0. Selective bibliography [1] C. Canuto, A. Tabacco, Mathematical Analysis II (2nd ed. ), Springer International Publishing, Switzerland, 2015. [2] C. Drăguşin, O. Olteanu, M. Gavrilă, Analiză matematică, Editura Matrix Rom, Bucureşti, 2006. [3] S. R. Ghorpade, B. V. Limaye, A Course in Multivariable Calculus and Analysis, Undergraduate Texts in Mathematics, Springer Science, 2010. [4] R. Heath-Brown, Analysis II. Continuity and Differentiability, Hilary Term, 2016. [5] R. Luca-Tudorache, Analiză matematică. Calcul diferenţial, Editura Tehnopress, Iaşi, 2005. [6] E. Popescu, Analiză matematică. Calcul diferenţial, Editura Matrix Rom, Bucureşti, 2006. [7] M. Postolache, Analiză matematică (teorie şi aplicaţii), Editura "Fair Partners", Bucureşti, 2011. [8] V. Postolică, Eficienţă prin matematică aplicată. Analiză matematică, Editura Matrix Rom, Bucureşti, 2006. [9] A. Precupanu, Bazele analizei matematice, Editura Polirom, Iaşi, 1998. [10] W. F. Trench, Introduction to Real Analysis, Trinity University, 2009. 6