Existence of the limit at infinity for a function that is integrable on the half line
|
|
- Angel Howard
- 5 years ago
- Views:
Transcription
1 Rose-Hulman Undergraduate Mathematics Journal Volume 14 Issue 1 Article 1 Existence of the limit at infinity for a function that is integrable on the half line James Patrick Dix San Marcos High School, Texas, james.p.dix@gmail.com Follow this and additional works at: Recommended Citation Dix, James Patrick (13) "Existence of the limit at infinity for a function that is integrable on the half line," Rose-Hulman Undergraduate Mathematics Journal: Vol. 14 : Iss. 1, Article 1. Available at:
2 Rose- Hulman Undergraduate Mathematics Journal Existence of the limit at infinity for a function that is integrable on the half line James Patrick Dix a Volume 14, No. 1, Spring 13 Sponsored by Rose-Hulman Institute of Technology Department of Mathematics Terre Haute, IN mathjournal@rose-hulman.edu a San Marcos High School, San Marcos, TX 78666, USA. james.p.dix@gmail.com
3 Rose-Hulman Undergraduate Mathematics Journal Volume 14, No. 1, Spring 13 Existence of the limit at infinity for a function that is integrable on the half line James Patrick Dix Abstract. It is well known that for a function that is integrable on [, ), its limit at infinity may not exist. First we illustrated this statement with an example. Then, we present conditions that guarantee the existence of the limit in the following two cases: When the integrable function is non-negative, if the first, second, third, or fourth, derivative is bounded in a neighborhood of each local maximum of f, then the limit exists. Without the non-negative constraint, if an integrable function has a bounded derivative on the entire interval [, ), then the limit exists. Acknowledgements: I would like to thank the anonymous referee for his/her valuable comments that helped me improve this article. Also I want to thank my teachers at the San Marcos High School and at the Honors Math Camp at Texas State University for providing me with the knowledge and discipline to approach these problems. In addition, I want to thank my family their support and encouragement.
4 Page RHIT Undergrad. Math. J., Vol. 14, No. 1 1 Introduction As a motivation for this article, we consider the rate of consumption of a non-renewable resource of which only a finite amount is available. Let f be consumption rate. Then the amount consumed of the resource from time zero to time t is represented by t f(s) ds. Since only a finite amount of the resource is available, we have the condition f(t) dt = A (A ± ), (1.1) which is the main assumption in this work. Does the consumption rate approach a constant (maybe zero) as t approaches infinity? Under what conditions does this limit exist? Another motivation for our research is considering a continuous probability distribution function defined on the interval [, ), and with finite mean. What is the long time behavior of the probability distribution function? The discrete version of (1.1) corresponds to a convergent series n= a n < ; in which case the terms a n must approach zero as n approaches infinity. However, assumption (1.1) does not guarantee the existence of lim f(t), as shown in the following example. 1 area=1/1 area=1/ area=1/3 Figure 1: The integral is finite, but lim f(t) does not exist Example 1.1. Let f(t) be the function plotted in Figure 1. Note that f(s) ds = k=1 1/k < [, Theorem 9.11]. Therefore, condition (1.1) is satisfied. However, the function f(t) oscillates without approaching any number as t approaches infinity; thus lim f(t) does not exist. Recall that a function has limit at infinity if and only if its limit superior and its limit inferior are equal [1, Theorem 6.3d]. These two limits are defined as follows: lim sup f(t) = lim sup{u(s) : s t}, lim inf f(t) = lim inf{u(s) : s t}. In this example, lim sup f(t) = 1 and lim inf f(t) =. Thus lim f(t) does not exist. We did not find any references for the existence of this limit; so made our goal to find conditions for the existence of lim f(t). Our main tools are standard calculus results. A trivial way to guarantee the existence of lim f(t) is by assuming that f is monotone. In this case f is of a constant sign on an interval [t, ). If f is positive, then for satisfying
5 RHIT Undergrad. Math. J., Vol. 14, No. 1 Page 3 (1.1), f must be non-increasing and lim f(t) =. If f is negative, then for satisfying (1.1), f must be non-decreasing and lim f(t) =. If f is identically zero, its limit is zero. Furthermore, monotonicity of f is implied by a higher-order derivative being of constant sign on an infinite interval. Assume that the nth derivative is of constant sign on an interval [t n, ). Then the (n 1)th derivative is monotone and of constant sign on some interval [t n 1, ). Then we show that the (n )th derivative is monotone and of constant sign on some interval [t n, ). By repeating this process, show that f is monotone on some interval [t, ). However, we want to find conditions weaker than the ones above. The existence of the limit of f is established for the following two cases: When f is non-negative, if the first, second, third, or forth derivative is bounded, by the same constant on neighborhoods of all points of relative maximum of f, then lim f(t) exists; see Theorems.3,.4,.5, and.7. When f is allowed to have negative values, if any derivative is bounded on [, ), then lim f(t) exists; see Theorem.9 and Corollary.11. To address probability distribution functions whose mean is finite, we present Corollary.1. Results The following lemmas will be used in proving our main results. Lemma.1. Let f be continuous on [, ), and lim inf f(t) lim sup f(t). Then there exists a constant α, satisfying lim inf f(t) < α < lim sup f(t), such that for every β >, we can define a sequence of relative maxima {f(t k )} such that f(t k ) > α, t k+1 > t k + β for k = 1,,.... Proof. Since the limit superior and the limit inferior are real numbers, not equal to each other, there exists a constant α such that lim inf f(t) < α < lim sup f(t). From the definition of limit superior, there exists a sequence of values of f(t) approaching the limit superior, and another sequence of values of f(t) approaching the limit inferior. Recursively, we define the infinite sequences {v j } and {w j } such that v 1 < w 1 < v < w < +, with f(v k ) > α and f(w k ) < α. Since f is continuous on each closed interval [w k, w k+1 ], by the extreme value theorem [, Theorem 3.1], f assumes its maximum at some value t k (w k, w k+1 ) and f(t k ) f(v k ) > α. Note that lim k t k =. Then we define a subsequence, also denoted by {t k }, such that t k+1 > t k + β k.
6 Page 4 RHIT Undergrad. Math. J., Vol. 14, No. 1 This completes the proof. Lemma.. Let f(t) be a continuous function for t, that has a local maximum at value t >. Then the following items hold: (1) If f (t ) is defined, then f (t ) = ; () If f (t ) is defined and f is continuous on an interval [t k, t k + λ) or (t k λ, t k ], with λ >, then f (t ) ; (3) If f (t ) is defined, then there is no information on the sign of f (t ); it can be positive, negative, or zero. Proof. Statement (1) follows from [, Theorem 3.]. Statement () is proven by contradiction. Suppose that f (t ) >. Then by continuity, f is positive on an interval containing t k ; therefore, f is concave up on this interval, which contradicts f(t k ) being a local maximum. Statement (3) is illustrated with examples: f 1 (t) = 1 3 t3 3 t + t has a local maximum at t = 1 and f (1) =. f (t) = 1 3 t3 + 3 t t has a local maximum at t = and f () =. f (t) = (t 1) has a local maximum at t = 1 and f () =. Theorem.3. Assume that f(t) is a continuous and non-negative function satisfying (1.1). Also assume that there exist positive constants M and λ such that at each local maximum f(t k ), f is continuous on [t k, t k + λ] and differentiable on (t k, t k + λ) satisfying f (t) M on (t k, t k + λ). Then lim f(t) exists. Proof. By contradiction assume that lim f(t) does not exist and show the integral in (1.1) approaches +. Since f, by Lemma.1, there exists α > and a sequence of local maxima {f(t k )} satisfying f(t k ) > α, t k+1 > t k + β, with β = min{λ, α/m}. At each t k, we draw a right triangle with vertices at (t k, ), (t k, α) and (t k, t k + β); see Figure. α t k t area=αβ/ k+1 Figure : Sequence of local maxima with triangles below Note that the definition of β does not allow the triangles to overlap, and each triangle has area αβ/. If the graph of f(t) stays above the hypotenuse of each triangle, then f(t) dt k=1 αβ =
7 RHIT Undergrad. Math. J., Vol. 14, No. 1 Page 5 which will complete the proof. Next we prove that the graph of f(t) stays above the hypotenuse. Note that each hypotenuse has slope with absolute value greater than of equal to M. Since f(t k ) > α, if there is a point t, in the base of the triangle, such that f(t) is below or on the hypotenuse, by the Mean Value Theorem there is a point s between t k and t, where f (s) > M. This contradicts the assumption that f (s) M; therefore f(t) stays above the hypothenuse. This completes the proof. Theorem.4. Assume that f(t) is a continuous and non-negative function satisfying (1.1). Also assume that there exist positive constants M and λ such that at each local maximum f(t k ), the functions f and f are continuous on [t k, t k +λ], and f is differentiable on (t k, t k + λ) satisfying f (t) M on (t k, t k + λ). Then lim f(t) exists. Proof. By contradiction assume that lim f(t) does not exist and show the integral in (1.1) approaches +. Since f(t), by Lemma.1, there exists α > and a sequence of local maxima {f(t k )} satisfying f(t k ) > α, t k+1 > t k + β, with β = min{λ, α/m}. α t k t area=αβ/3 k+1 Figure 3: Sequence of local maxima with parabolas Below each local maximum (t k, f(t k )), we draw the right branch of the parabola g(t) = α α(t t k ) /β, with vertex at (t k, α); see Figure 3. By integrating g(t), from t k to t k + β, we obtain that the area of the right lobe of the parabola has value αβ/3. The definition of β assures that the right lobes of the parabolas do not overlap. If the graph of f(t) stays above the parabola, then αβ f(t) dt =, 3 which will complete the proof. Next we prove that the graph of f(t) stays above the right lobe the parabola. Recall that f(t k ) > α, f (t k ) = (because f(t k ) is a local maximum), and f (t) M. By the Taylor theorem for f(t) at the point t k with t k < t < t k + λ, there is a point c, t k < c < t, such that k=1 f(t) = f(t k ) + f (t k )(t t k ) + f (c) (t t k) > α + M (t t k) α α(t t k) β = g(t), which is the parabola defined above. This completes the proof.
8 Page 6 RHIT Undergrad. Math. J., Vol. 14, No. 1 Theorem.5. Assume that f(t) is a continuous and non-negative function satisfying (1.1). Also assume that there exist positive constants M and λ such that at each local maximum f(t k ), the functions f, f and f are continuous on [t k, t k + λ], and f is differentiable on (t k, t k + λ) satisfying f (t) M on (t k, t k + λ). Then lim f(t) exists. Proof. By contradiction assume that lim f(t) does not exist and show that the integral in (1.1) approaches +. Since f(t), by Lemma.1, there exists α > and a sequence of local maxima {f(t k )} satisfying f(t k ) > α, t k+1 > t k + λ. Note that by Lemma., f (t k ) = and f (t k ). We consider the only two possible cases for the sequence {f (t k )} k=1. Case 1: The sequence {f (t k )} k=1 is bounded below by a constant γ. Then for t k < c < t k + λ, and using the bound M, we have f (c) = f (t k ) + c t k f (s) ds γ + M(c tk ) γ + λm. By the Taylor theorem for f at t k with t k < t < t k + λ, there is value c with t k < c < t such that f(t) = f(t k ) + f (t k )(t t k ) + f (c) (t t k) > α + (γ + λm) (t t k). When we restrict t to satisfy t t k < λ and (γ + λm)(t t k ) / α/, we have that f(t) > α/ on infinitely many disjoint intervals of the form [t k, t k + min{λ, α/(γ + M)}]. Then it follows that f(t) =. This completes the proof for case 1. Case : The sequence {f (t k )} k=1 is unbounded below. Then there are infinitely many k s such that f (t k ) < λm. Let [t k, t k ] be the largest interval containing t k such that f (t) on this interval. Claim: t k t k λ. On the contrary suppose that t k t k < λ, then f (t) M on [t k, t k ]. Recall that f (t k ) < λm 3 and f (t k ) =. An application of the mean value theorem yields a value c (t k, t k ) such that f (c) > M. This contradiction proves the claim. From this claim, the graph of f is concave down on the interval [t k, t k ]. Then the line that connects (t k, f(t k )) and (t k + λ, f(t k + λ)) lies under the graph of f, so the area under the graph of f and under the straight line satisfy tk +λ f(t) dt f(t k) + f(t k + λ) t k λ > + α λ. The second inequality holds because f(t k + λ) and f(t k ) > α.
9 RHIT Undergrad. Math. J., Vol. 14, No. 1 Page 7 Since t k + λ < t k+1, there are infinitely many disjoint intervals, of length λ, where the above estimate holds. It follows that f(t) =. This proves case and completes the proof. Remark.6. The assumptions for Theorems.3.5 are stated on right intervals [t k, t k + λ]. However, we can reach the same conclusion using left intervals [t k λ, t k ], or a combination of these two types of intervals. In the next theorem, we do not have this choice because the third derivative is required to be bounded on both sides of t k. Theorem.7. Assume that f(t) is a continuous and non-negative function satisfying (1.1). Also assume that there exist positive constants M and λ such that at each local maximum f(t k ), the functions f, f, f and f are continuous on [t k λ, t k +λ], and f is differentiable on (t k λ, t k + λ) satisfying f (4) (t) M on (t k λ, t k + λ). Then lim f(t) exists. Proof. By contradiction assume that lim f(t) does not exist and show that the integral in (1.1) approaches +. By Lemma.1, there exists α > and a sequence of local maxima {f(t k )} satisfying f(t k ) > α, t k+1 > t k + λ. By Lemma., for all k: f (t k ) = and f (t k ). Let [t k, t k ] be the largest interval containing t k such that f (t) on this interval. We consider the two possible cases for the lengths of these intervals. Case 1: lim k t k t k =. From the definition of limit, there exists an index k such that t k t k < λ for all k k ; thus [t k, t k ] [t k λ, t k + λ]. Claim: lim k f (t k ) =. Note that f (t k ) = f (t k ) = and f is continuous on [t k, t k ]. By the extreme value theorem, f attains its minimum at some point c k (t k, t k ). Then f (c k ) f (t k ). Using that f (c k ) = and the bound M, for t [t k λ, t k + λ], we have f (t) = f (c k ) + t Thus the graph of f intersects the t-axis at t k By the fundamental theorem of calculus, f (t k ) f (c k ) = t k c k c k f (4) (s) ds M t c k λm. f (t) dt and at t k, and has slope bounded by λm. t k c k f (t) dt λm(t k c k ), and similarly, Therefore, f (c k ) f (t k) λm(c k t k). λm(t k c k ) f (t k ) f (c k ) λm(t k c k ), λm(c k t k) f (c k ) f (t k) λm(c k t k).
10 Page 8 RHIT Undergrad. Math. J., Vol. 14, No. 1 Since f (t k ) = f (t k ) =, it follows that f (c k ) λm(t k t k ). Then the inequality f (c k ) f (t k ) implies lim k f (t k ) =, which proves the claim. From this claim, for each β >, there exists an index k such that f (t k ) β for all k k. By the Taylor theorem, for f at t k with t k λ < t < t k + λ, we have f(t) = f(t k ) + f (t k )(t t k ) + f (t k ) (t t k) > α + β t t k λm t t k f (c) (t t k) 3 6 By restricting t to satisfy t t k < λ, β t t k / α/3 and λm t t k 3 /6 α/3, we have that f(t) > α/3 on infinitely many intervals, each one of length min{λ, α/(3β), 3 3α/(λM)}. Since these intervals are disjoint, it follows that f(t) =. This completes the proof for case 1. Case : There exists a positive constant γ such that t k t k γ for infinitely many k s. Then the graph of f is concave down on [t k, t k ]. Since f(t) and f(t k) > α, the area under the graph can be estimated as tk t k f(t) dt + t k t k f(t) dt f(t k ) + f(t k) (t k t k) + f(t > + α (t k t k) αγ. k ) + f(t k) (t k t k ) Since intervals [t k, t k ] cover a set of intervals whose lengths add up to infinity, f(t) =. This proves case. It also completes the proof. Remark.8. The above methods for proving Theorems.3.7 does not seem to work when only the fifth derivative is bounded. However, we are unable to find an example where the fifth derivative is bounded, f(t), and lim f(t) does not exist. Next we consider a function which may have positive and negative values, however we need to assume differentiability on the entire interval [, ). Theorem.9. Assume that f(t) is a differentiable function satisfying (1.1), and that there exists a positive constant M such that f (t) M on for all t. Then lim f(t) =. Proof. To prove that lim f(t) =, we show that lim sup f(t) =. By contradiction, assume that lim sup f(t) = α for some positive constant α. Then there exists a sequence f(t k ) approaching either α or α, and {t k } as k. First assume that lim k f(t k ) = α. As in Lemma.1, we select a subsequence such that t k+1 t k +(α/(3m)) and f(t k ) α/3, k = 1,,....
11 RHIT Undergrad. Math. J., Vol. 14, No. 1 Page 9 The mean value theorem and the assumption f (s) M guarantee the existence of an interval I 1 with center t 1 and radius α/(3m) where f(t) α/3. Similarly, at t, we obtain an interval I with center t and radius α/(3m) where f(t) α/3. The same process yields a sequence of non-overlapping intervals I 1, I, I 3,..., each one of length α/(3m). Let I k = [a k, b k ]; then a k and b k approach infinity as k approaches infinity. Since f(t) α/3 on [a k, b k ], we have bk f(t) dt bk = f(t) dt α a k a k 9M. However, from (1.1), for α /(9M) > there exists a value T such that a k, b k T implies bk f(t) dt ak f(t) dt = bk a k f(t) dt < α 9M. This contradiction implies α =. Now assume that lim k f(t k ) = α Note that lim k ( f(t k )) = α, and that the function f satisfies (1.1) with A instead of A. Using the first part of this proof, for f, we conclude that α =. This completes the proof. Theorem.1. Assume that f(t) satisfies (1.1), and has continuous derivatives on [, ). If the k-th derivative satisfies sup t f (k) (t) =, then sup t f (p) (t) = for all p k. Proof. On the contrary suppose that for some integer n, sup t f (n) (t) =, and that for all t there exists a constant M such that f (n+1) (t) M. Then for the value α = M ( n + n ) there exists a t 1 such that f (n) (t 1 ) α + 1. Using that the absolute value of the slope of f (n) is bounded by M, by the mean value theorem, there exists an interval I n, with center t 1 with radius α/m such that f (n) (t) 1 for all t I n. On I n, the function f (n 1) is strictly monotonic because the absolute value of its derivative is greater than or equal to 1. Let Ĩ n = {t I n : f (n 1) (t) < 1}. This set can be empty, or an interval of length at most, because the absolute value of the slope of f (n 1) is at least 1. If the set I n \ Ĩn consists of a single subinterval of I n, we let I n 1 = I n \ Ĩn. (In set notation A \ B consists of all the elements that are in A but not in B). If the set I n \ Ĩn consists of two subintervals, we let I n 1 be larger of the two subintervals. In both cases I n 1 I n, and I n 1 is an interval of length at least 1 ( α M ). On I n 1, the function f (n ) is strictly monotonic and the absolute value of its slope is greater than or equal to 1. Let Ĩn 1 = {t I n 1 : f (n ) (t) < 1}. Repeating the above process, we define an interval I n I n 1 whose length is at least 1 ( 1 ( α M ) ).
12 Page 1 RHIT Undergrad. Math. J., Vol. 14, No. 1 Repeating this process, n times, we obtain a interval I whose length is at least, such that f(t) 1 for all t I. Let [a 1, b 1 ] = I. Since f (n) is continuous and unbounded on [, ), for the same α defined above, there exists a t t 1 + (α/m) such that f (n) (t ) α + 1. As above we obtain an interval [a, b ] of length at least, such that f(t) 1 for all t [a, b ]. Repeating the above process we obtain a sequence of non-overlapping intervals [a k, b k ], each one of length at least. Since f(t) 1 and is continuous on [a k, b k ], we have bk f(t) dt = bk f(t) dt. a k a k However, from (1.1), for the positive number there exists a value T such that a k, b k T implies bk ak f(t) dt f(t) dt bk = f(t) dt <. a k This contradiction implies that f (n+1) can not be bounded. The proof is complete. As a consequence of Theorems.9 and.1, we have the following result for functions that may have negative values. Corollary.11. Assume that f(t) satisfies (1.1), and has continuous derivatives. If the k-th derivative satisfies sup t f (n) (t) <, then sup t f (n) (t) < for all k n. Furthermore, lim f(t) =. We conclude this section by considering a continuous probability distribution function defined on the interval [, ), and having finite mean. Corollary.1. Assume that the probability distribution function g is defined on the interval [, ) and its mean satisfies tg(t) dt = µ <. If for any pair of derivatives g (n), g (n+1), we have sup t g (n) (t) + tg (n+1) (t) <, then lim tg(t) =. Proof. By setting f(t) = tg(t) in Corollary.11, it follows that if for some n, sup t g (n) (t)+ tg (n+1) (t) <. Then lim tg(t) =. References [1] Watson Fulks; Advanced calculus: An introduction to analysis, John Wiley, New York - London, 1961.
13 RHIT Undergrad. Math. J., Vol. 14, No. 1 Page 11 [] Ron Larson, Robert P. Holster, Bruce H. Edwards; Calculus with analytic geometry, Houghton Mifflin Co., Boston - New York, 6. [3] Maurice D. Weir, Joel Hass, Frank R. Giordano; Thomas Calculus, eleventh edition, Pearson, Boston San Francisco, 5.
Rose-Hulman Undergraduate Mathematics Journal
Rose-Hulman Undergraduate Mathematics Journal Volume 17 Issue 1 Article 5 Reversing A Doodle Bryan A. Curtis Metropolitan State University of Denver Follow this and additional works at: http://scholar.rose-hulman.edu/rhumj
More informationComputing the Autocorrelation Function for the Autoregressive Process
Rose-Hulman Undergraduate Mathematics Journal Volume 18 Issue 1 Article 1 Computing the Autocorrelation Function for the Autoregressive Process Omar Talib Modern College of Business and Science, Muscat,
More informationPascal's Triangle in Difference Tables and an Alternate Approach to Exponential Functions
Rose-Hulman Undergraduate Mathematics Journal Volume 18 Issue 2 Article 4 Pascal's Triangle in Difference Tables and an Alternate Approach to Exponential Functions Dalton Heilig The University of Montana
More informationOn the Long-Repetition-Free 2-Colorability of Trees
Rose-Hulman Undergraduate Mathematics Journal Volume 18 Issue 1 Article 15 On the Long-Repetition-Free 2-Colorability of Trees Joseph Antonides The Ohio State University Claire Kiers University of North
More informationPrime Labeling of Small Trees with Gaussian Integers
Rose-Hulman Undergraduate Mathematics Journal Volume 17 Issue 1 Article 6 Prime Labeling of Small Trees with Gaussian Integers Hunter Lehmann Seattle University Andrew Park Seattle University Follow this
More informationThe Multiplicative Structure of the Group of Units of Zp[x]/ where f(x) is Reducible
Rose-Hulman Undergraduate Mathematics Journal Volume 16 Issue 1 Article 5 The Multiplicative Structure of the Group of Units of Zp[x]/ where f(x) is Reducible Erika Gerhold Salisbury University Jennifer
More informationBounds on the Number of Irreducible Semigroups of Fixed Frobenius Number
Rose-Hulman Undergraduate Mathematics Journal Volume 18 Issue 1 Article 4 Bounds on the Number of Irreducible Semigroups of Fixed Frobenius Number Clarisse Bonnand University of California, Riverside Reid
More informationPerfect Zero-Divisor Graphs of Z_n
Rose-Hulman Undergraduate Mathematics Journal Volume 17 Issue 2 Article 6 Perfect Zero-Divisor Graphs of Z_n Bennett Smith Illinois College Follow this and additional works at: http://scholar.rose-hulman.edu/rhumj
More informationThe KMO Method for Solving Non-homogenous, mth Order Differential Equations
Rose-Hulman Undergraduate Mathematics Journal Volume 15 Issue 1 Article 8 The KMO Method for Solving Non-homogenous, mth Order Differential Equations David Krohn University of Notre Dame Daniel Mariño-Johnson
More informationMinimal Number of Steps in the Euclidean Algorithm and its Application to Rational Tangles
Rose-Hulman Undergraduate Mathematics Journal Volume 16 Issue 1 Article 3 Minimal Number of Steps in the Euclidean Algorithm and its Application to Rational Tangles M. Syafiq Johar University of Oxford
More informationThe Cayley-Hamilton Theorem via the Z- Transform
Rose-Hulman Undergraduate Mathematics Journal Volume 13 Issue 2 Article 4 The Cayley-Hamilton Theorem via the Z- Transform Casey Tsai Louisiana State University, ctsai3@tigers.lsu.edu Follow this and additional
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 informationThe Three-Variable Bracket Polynomial for Reduced, Alternating Links
Rose-Hulman Undergraduate Mathematics Journal Volume 14 Issue 2 Article 7 The Three-Variable Bracket Polynomial for Reduced, Alternating Links Kelsey Lafferty Wheaton College, Wheaton, IL, kelsey.lafferty@my.wheaton.edu
More informationProof of Euler's φ (Phi) Function Formula
Rose-Hulman Undergraduate Mathematics Journal Volume 14 Issue 2 Article 6 Proof of Euler's φ (Phi Function Formula Shashank Chorge Mumbai University, chorgeshashank@yahoo.co.in Juan Vargas UNC Charlotte,
More informationComplex Symmetry of Truncated Composition Operators
Rose-Hulman Undergraduate Mathematics Journal Volume Issue Article 3 Complex Symmetry of Truncated Composition Operators Ruth Jansen Taylor University Rebecca K. Rousseau Taylor University Follow this
More informationOn Orders of Elliptic Curves over Finite Fields
Rose-Hulman Undergraduate Mathematics Journal Volume 19 Issue 1 Article 2 On Orders of Elliptic Curves over Finite Fields Yujin H. Kim Columbia University, yujin.kim@columbia.edu Jackson Bahr Eric Neyman
More information5.5 Deeper Properties of Continuous Functions
200 CHAPTER 5. LIMIT AND CONTINUITY OF A FUNCTION 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 informationThe Secret Santa Problem Continues
Rose-Hulman Undergraduate Mathematics Journal Volume 8 Issue Article 8 The Secret Santa Problem Continues Daniel Crane Taylor University Tanner Dye Taylor University Follow this and additional works at:
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 informationAn Examination of Richard Dedekind s Continuity and Irrational Numbers
Rose-Hulman Undergraduate Mathematics Journal Volume 17 Issue 1 Article 9 An Examination of Richard Dedekind s Continuity and Irrational Numbers Chase Crosby University of Missouri Kansas City Follow this
More informationPoints of Ninth Order on Cubic Curves
Rose-Hulman Undergraduate Mathematics Journal Volume 15 Issue 1 Article 1 Points of Ninth Order on Cubic Curves Leah Balay-Wilson Smith College Taylor Brysiewicz Northern Illinois University, tbrysiewicz@yahoo.com
More informationA Mathematical Analysis of The Generalized Oval Track Puzzle
Rose-Hulman Undergraduate Mathematics Journal Volume 12 Issue 1 Article 5 A Mathematical Analysis of The Generalized Oval Track Puzzle Samuel Kaufmann Carnegie Mellon University, sakaufma@andrew.cmu.edu
More informationConditions for Robust Principal Component Analysis
Rose-Hulman Undergraduate Mathematics Journal Volume 12 Issue 2 Article 9 Conditions for Robust Principal Component Analysis Michael Hornstein Stanford University, mdhornstein@gmail.com Follow this and
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 informationTotal Linking Numbers of Torus Links and Klein Links
Rose- Hulman Undergraduate Mathematics Journal Total Linking Numbers of Torus Links and Klein Links Michael A Bush a Katelyn R French b Joseph R H Smith c Volume, Sponsored by Rose-Hulman Institute of
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 informationProblem set 1, Real Analysis I, Spring, 2015.
Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n
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 informationON THE NUMBER OF 2-PLAYER, 3- STRATEGY, STRICTLY ORDINAL, NORMAL FORM GAMES
ROSE- H ULMAN UNDERGRADUATE MATHEMATICS JOURNAL ON THE NUMBER OF 2-PLAYER, 3- STRATEGY, STRICTLY ORDINAL, NORMAL FORM GAMES Austin Williams a VOLUME 13, NO 1, SPRING 2012 Sponsored by Rose-Hulman Institute
More informationf(s)ds, i.e. to write down the general solution in
1. First order ODEs. Simplest examples. Existence and uniqueness theorem Example 1.1. Consider the equation (1.1) x (t) = 1 This is an equation because there is an unknown: the function x(t). This is a
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 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 informationAn Appreciation of Euler's Formula
Rose-Hulman Undergraduate Mathematics Journal Volume 18 Issue 1 Article 17 An Appreciation of Euler's Formula Caleb Larson North Dakota State University Follow this and additional works at: http://scholar.rose-hulman.edu/rhumj
More informationImportant Properties of R
Chapter 2 Important Properties of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference
More informationa i,1 a i,j a i,m be vectors with positive entries. The linear programming problem associated to A, b and c is to find all vectors sa b
LINEAR PROGRAMMING PROBLEMS MATH 210 NOTES 1. Statement of linear programming problems Suppose n, m 1 are integers and that A = a 1,1... a 1,m a i,1 a i,j a i,m a n,1... a n,m is an n m matrix of positive
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 informationScott Sentences in Uncountable Structures
Rose-Hulman Undergraduate Mathematics Journal Volume 18 Issue 1 Article 14 Scott Sentences in Uncountable Structures Brian Tyrrell Trinity College Dublin Follow this and additional works at: http://scholar.rose-hulman.edu/rhumj
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 informationLie Matrix Groups: The Flip Transpose Group
Rose-Hulman Undergraduate Mathematics Journal Volume 16 Issue 1 Article 6 Lie Matrix Groups: The Flip Transpose Group Madeline Christman California Lutheran University Follow this and additional works
More informationAP Calculus Testbank (Chapter 9) (Mr. Surowski)
AP Calculus Testbank (Chapter 9) (Mr. Surowski) Part I. Multiple-Choice Questions n 1 1. The series will converge, provided that n 1+p + n + 1 (A) p > 1 (B) p > 2 (C) p >.5 (D) p 0 2. The series
More informationOn equivalent characterizations of convexity of functions
International Journal of Mathematical Education in Science and Technology, Vol. 44, No. 3, 2013, 410 417 (author s reprint) On equivalent characterizations of convexity of functions Eleftherios Gkioulekas
More informationSequences and Series of Functions
Chapter 13 Sequences and Series of Functions These notes are based on the notes A Teacher s Guide to Calculus by Dr. Louis Talman. The treatment of power series that we find in most of today s elementary
More informationAnalysis III. Exam 1
Analysis III Math 414 Spring 27 Professor Ben Richert Exam 1 Solutions Problem 1 Let X be the set of all continuous real valued functions on [, 1], and let ρ : X X R be the function ρ(f, g) = sup f g (1)
More informationLinearization and Stability Analysis of Nonlinear Problems
Rose-Hulman Undergraduate Mathematics Journal Volume 16 Issue 2 Article 5 Linearization and Stability Analysis of Nonlinear Problems Robert Morgan Wayne State University Follow this and additional works
More informationClassification of Four-Component Rotationally Symmetric Rose Links
Rose-Hulman Undergraduate Mathematics Journal Volume 18 Issue 1 Article 8 Classification of Four-Component Rotationally Symmetric Rose Links Julia Creager Birmingham-Southern College Nirja Patel Birmingham-Southern
More informationAppendix A. Sequences and series. A.1 Sequences. Definition A.1 A sequence is a function N R.
Appendix A Sequences and series This course has for prerequisite a course (or two) of calculus. The purpose of this appendix is to review basic definitions and facts concerning sequences and series, which
More informationThe Structure of the Tutte-Grothendieck Ring of Ribbon Graphs
Rose-Hulman Undergraduate Mathematics Journal Volume 13 Issue 2 Article 2 The Structure of the Tutte-Grothendieck Ring of Ribbon Graphs Daniel C. Thompson MIT, dthomp@math.mit.edu Follow this and additional
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 informationAn Overview of Complex Hadamard Cubes
Rose- Hulman Undergraduate Mathematics Journal An Overview of Complex Hadamard Cubes Ben Lantz a Michael Zowada b Volume 3, No. 2, Fall 202 Sponsored by Rose-Hulman Institute of Technology Department of
More information(x k ) sequence in F, lim x k = x x F. If F : R n R is a function, level sets and sublevel sets of F are any sets of the form (respectively);
STABILITY OF EQUILIBRIA AND LIAPUNOV FUNCTIONS. By topological properties in general we mean qualitative geometric properties (of subsets of R n or of functions in R n ), that is, those that don t depend
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 informationAP Calculus BC Syllabus
AP Calculus BC Syllabus Course Overview and Philosophy This course is designed to be the equivalent of a college-level course in single variable calculus. The primary textbook is Calculus, 7 th edition,
More informationf : R 2 R (x, y) x 2 + y 2
Chapter 2 Vector Functions 2.1 Vector-Valued Functions 2.1.1 Definitions Until now, the functions we studied took a real number as input and gave another real number as output. Hence, when defining a function,
More informationFundamental Inequalities, Convergence and the Optional Stopping Theorem for Continuous-Time Martingales
Fundamental Inequalities, Convergence and the Optional Stopping Theorem for Continuous-Time Martingales Prakash Balachandran Department of Mathematics Duke University April 2, 2008 1 Review of Discrete-Time
More informationStochastic Dynamic Programming: The One Sector Growth Model
Stochastic Dynamic Programming: The One Sector Growth Model Esteban Rossi-Hansberg Princeton University March 26, 2012 Esteban Rossi-Hansberg () Stochastic Dynamic Programming March 26, 2012 1 / 31 References
More information1 Continuation of solutions
Math 175 Honors ODE I Spring 13 Notes 4 1 Continuation of solutions Theorem 1 in the previous notes states that a solution to y = f (t; y) (1) y () = () exists on a closed interval [ h; h] ; under certain
More informationC.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series
C.7 Numerical series Pag. 147 Proof of the converging criteria for series Theorem 5.29 (Comparison test) Let and be positive-term series such that 0, for any k 0. i) If the series converges, then also
More 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 informationIntroduction. Chapter 1. Contents. EECS 600 Function Space Methods in System Theory Lecture Notes J. Fessler 1.1
Chapter 1 Introduction Contents Motivation........................................................ 1.2 Applications (of optimization).............................................. 1.2 Main principles.....................................................
More informationThe longest branch of the tree of irreducible numerical semigroups with odd Frobenius number
The Minnesota Journal of Undergraduate Mathematics The longest branch of the tree of irreducible numerical semigroups with odd Frobenius number Taryn M. Laird and José E. Martinez Department of Mathematics
More informationv( x) u( y) dy for any r > 0, B r ( x) Ω, or equivalently u( w) ds for any r > 0, B r ( x) Ω, or ( not really) equivalently if v exists, v 0.
Sep. 26 The Perron Method In this lecture we show that one can show existence of solutions using maximum principle alone.. The Perron method. Recall in the last lecture we have shown the existence of solutions
More informationSome Background Math Notes on Limsups, Sets, and Convexity
EE599 STOCHASTIC NETWORK OPTIMIZATION, MICHAEL J. NEELY, FALL 2008 1 Some Background Math Notes on Limsups, Sets, and Convexity I. LIMITS Let f(t) be a real valued function of time. Suppose f(t) converges
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 informationNumerical Sequences and Series
Numerical Sequences and Series Written by Men-Gen Tsai email: b89902089@ntu.edu.tw. Prove that the convergence of {s n } implies convergence of { s n }. Is the converse true? Solution: Since {s n } is
More informationMath 421, Homework #7 Solutions. We can then us the triangle inequality to find for k N that (x k + y k ) (L + M) = (x k L) + (y k M) x k L + y k M
Math 421, Homework #7 Solutions (1) Let {x k } and {y k } be convergent sequences in R n, and assume that lim k x k = L and that lim k y k = M. Prove directly from definition 9.1 (i.e. don t use Theorem
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 informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
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 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 informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
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 informationSynchronization, Chaos, and the Dynamics of Coupled Oscillators. Supplemental 1. Winter Zachary Adams Undergraduate in Mathematics and Biology
Synchronization, Chaos, and the Dynamics of Coupled Oscillators Supplemental 1 Winter 2017 Zachary Adams Undergraduate in Mathematics and Biology Outline: The shift map is discussed, and a rigorous proof
More informationAnna D Aloise May 2, 2017 INTD 302: Final Project. Demonstrate an Understanding of the Fundamental Concepts of Calculus
Anna D Aloise May 2, 2017 INTD 302: Final Project Demonstrate an Understanding of the Fundamental Concepts of Calculus Analyzing the concept of limit numerically, algebraically, graphically, and in writing.
More informationarxiv: v2 [math.pr] 12 May 2013
arxiv:1304.3284v2 [math.pr] 12 May 2013 Existence and uniqueness of Arrow-Debreu equilibria with consumptions in L 0 + Dmitry Kramkov Carnegie Mellon University and University of Oxford, Department of
More informationMath 117: Topology of the Real Numbers
Math 117: Topology of the Real Numbers John Douglas Moore November 10, 2008 The goal of these notes is to highlight the most important topics presented in Chapter 3 of the text [1] and to provide a few
More informationInfinite Continued Fractions
Infinite Continued Fractions 8-5-200 The value of an infinite continued fraction [a 0 ; a, a 2, ] is lim c k, where c k is the k-th convergent k If [a 0 ; a, a 2, ] is an infinite continued fraction with
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. Determine whether the following statements are true or false. Justify your answer (i.e., prove the claim, derive a contradiction or give a counter-example). (a) (10
More information( f ^ M _ M 0 )dµ (5.1)
47 5. LEBESGUE INTEGRAL: GENERAL CASE Although the Lebesgue integral defined in the previous chapter is in many ways much better behaved than the Riemann integral, it shares its restriction to bounded
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 informationX. Numerical Methods
X. Numerical Methods. Taylor Approximation Suppose that f is a function defined in a neighborhood of a point c, and suppose that f has derivatives of all orders near c. In section 5 of chapter 9 we introduced
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 informationTest Codes : MIA (Objective Type) and MIB (Short Answer Type) 2007
Test Codes : MIA (Objective Type) and MIB (Short Answer Type) 007 Questions will be set on the following and related topics. Algebra: Sets, operations on sets. Prime numbers, factorisation of integers
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationMATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5
MATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5.. The Arzela-Ascoli Theorem.. The Riemann mapping theorem Let X be a metric space, and let F be a family of continuous complex-valued functions on X. We have
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 informationFractals And The Weierstrass-Mandelbrot Function
Rose-Hulman Undergraduate Mathematics Journal Volume 13 Issue Article 7 Fractals And The Weierstrass-Mandelbrot Function Anthony Zaleski ew Jersey Institute of Technology, az8@njit.edu Follow this and
More informationMATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets
MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 2: Countability and Cantor Sets Countable and Uncountable Sets The concept of countability will be important in this course
More informationInfinite Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Infinite Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Background Consider the repeating decimal form of 2/3. 2 3 = 0.666666 = 0.6 + 0.06 + 0.006 + 0.0006 + = 6(0.1)
More informationAP Calculus BC. Course: AP Calculus BC
AP Calculus BC Course: AP Calculus BC Course Overview: This course is taught over a school year (2 semesters). During the first semester on a 90 minute mod, students cover everything in the Calculus AP
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Background We have seen that some power series converge. When they do, we can think of them as
More informationMATH 409 Advanced Calculus I Lecture 16: Mean value theorem. Taylor s formula.
MATH 409 Advanced Calculus I Lecture 16: Mean value theorem. Taylor s formula. Points of local extremum Let f : E R be a function defined on a set E R. Definition. We say that f attains a local maximum
More informationDefinition 2.1. A metric (or distance function) defined on a non-empty set X is a function d: X X R that satisfies: For all x, y, and z in X :
MATH 337 Metric Spaces Dr. Neal, WKU Let X be a non-empty set. The elements of X shall be called points. We shall define the general means of determining the distance between two points. Throughout we
More informationPERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS. A. M. Blokh. Department of Mathematics, Wesleyan University Middletown, CT , USA
PERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS A. M. Blokh Department of Mathematics, Wesleyan University Middletown, CT 06459-0128, USA August 1991, revised May 1992 Abstract. Let X be a compact tree,
More informationMATH CALCULUS I 4.1: Area and Distance
MATH 12002 - CALCULUS I 4.1: Area and Distance Professor Donald L. White Department of Mathematical Sciences Kent State University D.L. White (Kent State University) 1 / 8 The Area and Distance Problems
More informationNon-Constant Stable Solutions to Reaction- Diffusion Equations in Star-Shaped Domains
Rose-Hulman Undergraduate Mathematics Journal Volume 6 Issue Article 4 Non-Constant Stable Solutions to Reaction- iffusion Equations in Star-Shaped omains Greg rugan University of Texas at Austin, g_drugan@mail.utexas.edu
More informationMATH1131/1141 Calculus Test S1 v5a
MATH3/4 Calculus Test 008 S v5a March 9, 07 These solutions were written and typed up by Johann Blanco and Brendan Trinh and edited by Henderson Koh, Vishaal Nathan, Aaron Hassan and Dominic Palanca. Please
More informationSyllabus for AP Calculus BC
Syllabus for AP Calculus BC Underlying Focus: The emphasis in AP Calculus is on an intuitive understanding of all concepts and the interplay between the geometric and analytic information and on the use
More informationFirst-Return Integrals
First-Return ntegrals Marianna Csörnyei, Udayan B. Darji, Michael J. Evans, Paul D. Humke Abstract Properties of first-return integrals of real functions defined on the unit interval are explored. n particular,
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More informationRational Approximation by Continued Fractions
Rational Approximation by Continued Fractions The convergents of a continued fraction expansion of x give the best rational approximations to x. Specifically, the only way a fraction can approximate x
More information