Approximation by weighted polynomials

Size: px
Start display at page:

Download "Approximation by weighted polynomials"

Transcription

1 Approximation by weighted polynomials David Benko Abstract It is proven that if xq (x) is increasing on (, + ) and w(x) = exp( Q) is the corresponding weight on [, + ), then every continuous function that vanishes outside the support of the extremal measure associated with w can be uniformly approximated by weighted polynomials of the form w n P n. This problem was raised by V. Totik, who proved a similar result (the Borwein-Saff conjecture) for convex Q. A general criterion is introduced, too, which guarantees that the support of the extremal measure is an interval. With this criterion we generalize the above approximation theorem as well as that one, where Q is supposed to be convex. Introduction In [6], V.Totik settled a basic conjecture in the theory of approximation by weighted polynomials of the form w n P n, where w = exp( Q) is a given weight function. This conjecture was the Borwein-Saff conjecture and it was stated for convex Q. In this paper the same theorem is stated and proved, but for more general Q. The criterion we use covers the case when a) Q is convex, and also the case when b) Q is defined on [, + ) and xq (x) is increasing. In logarithmic potential theory many theorems use either a) or b) as their assumption on Q, since both of them guarantee that the support S w is an interval. The criterion to be introduced is weaker than both a) and b), but still guarantees that the support S w is an interval. (Furthermore, we merely assume that Q is absolutely continuous and not necessarily differentiable.) Thus this criterion itself is a useful result of this paper. The reader can find the definition of the logarithmic capacity in [4], I.. We say that a property holds quasi-everywhere, if the set where it does not hold has capacity.

2 Let Σ R be a closed set. (We assume that Σ is regular with respect to the Dirichlet problem in C\Σ.) A weight function w on Σ is said to be admissible, if it satisfies the following three conditions: (i) w is upper semi-continuous, (ii) {x Σ : w(x) > } has positive capacity, (iii) if Σ is unbounded, then z w(z) as z, z Σ. Unless otherwise noted, we will always assume in the theorems that w is continuous. We define Q by w(x) =: exp( Q(x)), so Q : Σ (, ] is a lower semi-continuous function. This Q is called the external field. Let M(Σ) be the collection of all positive unit Borel measures with compact support in Σ. We define the logarithmic potential of µ M(Σ) as U µ (x) := log x t dµ(t), and the weighted evergy integral as I w (µ) := log( x y w(x)w(y))dµ(x)dµ(y). We will need the following basic theorem ([4], Theorem I..3): Theorem A Let w be an admissible (not necessarily continuous) weight on the closed set Σ and let V w := inf{i w (µ) : µ M(Σ)}. Then (a) V w is finite, (b) there exists a unique element µ w M(Σ) such that I w (µ w ) = V w, (c) setting F w := V w Qdµ w, the inequality U µw (x) + Q(x) F w holds quasi-everywhere on Σ, (d) the inequality U µw (x) + Q(x) F w () holds for all x S w := supp(µ w ). Remark According to our definition, every measure in M(Σ) has compact support, so the support S w is a compact set. The measure µ w is called the equilibrium or extremal measure associated with w.

3 Notation When we say that a property holds inside G - where G is a subset of R - we mean that the property is satisfied on every compact subset of G. We are considering uniform approximation of continuous functions on Σ by weighted polynomials of the form w n P n, where degp n n. Theorem B is a Stone-Weierstrass type theorem for this kind of approximation (see [], or see [4], Theorem VI..). Unless otherwise noted, we will always assume in the theorems that w is continuous. Theorem B There exists a closed set Z = Z(w) Σ, such that a continuous function f on Σ is the uniform limit of weighted polynomials w n P n, n =,,..., if and only if f vanishes on Z. Thus the problem of what functions can be approximated is equivalent to determining what points lie in Z(w). This latter problem is intimately related to the density of µ w. The support S w := supp(µ w ) plays a special role (see [5], or [], or see [4], Theorem VI..): Theorem C Z Σ\(intS w ). The Borwein-Saff conjecture was that Z = Σ\(intS w ), if Q is convex, i.e., a continuous function f can be approximated by weighted polynomials w n P n, if and only if f vanishes outside S w. This was proved by V.Totik ([6]), see Theorem G below. The idea of the proof was based on the following definition and theorems: Definition D We say that a non-negative function v has smooth integral on an interval [a, b], if for every < ɛ there is a < δ, such that if I, J [a, b] are two adjacent intervals of equal length smaller than δ, then v ( + ɛ) v. I Clearly, all positive continuous functions have smooth integral, but also log(/ t ) has smooth integral, on any interval [ a, a], where < a <. (We will prove it later.) Theorem E Let us suppose that [a, b] is a subset of the support S w, and the extremal measure has a density v on [a, b] that has a positive lower bound and smooth integral there. Then (a, b) Z(w) =. Theorem F Let us suppose that (a, b) is a subset of the support S w, and that Q is convex on (a, b). Then µ w has a density v in (a, b) which has a positive lower bound and smooth integral inside (a, b). 3 J

4 From these two theorems follows Theorem G Let us suppose that (a, b) is a subset of the support S w, and that Q is convex on (a, b). Then (a, b) Z(w) =. In particular, every function that vanishes outside (a, b) can be uniformly approximated by weighted polynomials of the form w n P n. Notice that Theorem G (as well as its generalization, Theorem 5 below) is a local result; it works for any part of the extremal support where Q is convex. V. Totik raised the question whether Theorem G is still valid if Σ = [, + ) and if we replace the convexity condition with the condition that xq (x) is increasing. Theorem 5 answers this question positively. Main results Definition We say that a function Q : D R (D R) is weak convex on an interval I = [(a, b)] D (a, b R) with basepoints A, B R, A < B, if the following properties hold: (i) I [A, B], (ii) Q is absolutely continuous inside (a, b) (so Q exists a.e. in I), (iii) if a I, then lim Q(x) Q(a), x a+ and if b I, then (iv) for some κ [a, b]: lim Q(x) Q(b), x b Q (x) on (a, κ) Q (x) on (κ, b) (v) (B x)q (x) is increasing on (a, κ), (vi) (x A)Q (x) is increasing on (κ, b). If B = +, we replace (v) by (v)* Q (x) is increasing on (a, κ), and if A =, we replace (vi) by (vi)* Q (x) is increasing on (κ, b). We will simply just say that Q is weak convex on an interval I (without mentioning the basepoints), if Q is weak convex on the interval I = [(a, b)] D (a, b R) with basepoints a and b. 4

5 Remark Since κ = a (or κ = b) is allowed, it is also possible that Q is everywhere positive (or negative) on I. Notation 3 Throughout the article (in the above definition as well as in the theorems) we agree on the following. Suppose that a function f(x) - which is usually defined by using Q (x) - is said to be increasing (or decreasing) on a set E, but it is defined on a set F E, where E\F has measure zero. Then by f(x) is increasing on E we mean that there exists a set G F so that E\G has measure zero and f(x) is increasing on G. In other words, we do not require that f(x) is increasing everywhere, where it is defined. Similarly, if we write that, say, Q (x) > on (κ, B], we will mean that there exists a set G (κ, B] so that (κ, B]\G has measure, Q (x) exists on G and Q (x) > on G. This agreement weakens the assumptions on the considered functions in the theorems, but the given proofs are correct for this modified increasing/decreasing definitions as well. Some immediate consequences of the above definition are: Proposition 4 Let I R be an interval. a) If I [A, B ] [A, B ] R and Q is weak convex on I with basepoints A and B, then Q is also weak convex on I with basepoints A and B. b) A function Q is convex on I if and only if Q is weak convex on I with basepoints and +. c) Hence every convex function on I ( [A, B ]) is also weak convex on I with basepoints A and B. In particular, every convex function on I is also weak convex on I. d) If Q is absolutely continuous inside (, + ) and xq (x) is increasing on (, + ), then Q is weak convex on (, + ). Thus weak convexity is a weaker condition than either the Q is convex, or the xq (x) is increasing conditions. So the following theorem, which is our main theorem, is a generalization of Theorem G to a larger class of functions. Theorem 5 Let us suppose that (a, b) is a subset of the support S w and that Q is weak convex on (a, b) with basepoints A, B satisfying S w [A, B]. Then (a, b) Z(w) =. In particular, every function that vanishes outside (a, b) can be uniformly approximated by weighted polynomials of the form w n P n. 5

6 Theorem 5 will follow from Theorem E, since we can generalize Theorem F as follows: Theorem 6 Let us suppose that (a, b) is a subset of the support S w, and that Q is weak convex on (a, b) with basepoints A, B satisfying S w [A, B]. Then µ w has a density v in (a, b) which has a positive lower bound and smooth integral inside (a, b). Because of Proposition 4, in Theorem 5 we should choose A and B as close to min S w and max S w (respectively) as possible to get the weakest assumption on Q. Thus if the values of min S w and max S w are known, the best choices are A := min S w and B := max S w. If however we have no information at all of the locations of min S w and max S w, we must choose A := and B := + to be sure that S w [A, B] is satisfied, and in this case Theorem 5 reduces to Theorem G: the assumption on Q is to be convex. Notice however that S w Σ is always true, so the following Corollary is a special case of Theorem 5. The advantage of this Corollary is that no information about min S w and max S w is needed to check whether the weak convexity assumption on a given Q is satisfied. Corollary 7 Let (a, b) S w. If Q is weak convex on (a, b) with basepoints min Σ and max Σ then (a, b) Z(w) =. In particular, when Σ is, say, lower bounded, and we write out the definition of weak convexity, we gain Corollary 8. Corollary 8 Let Σ = [A, + ) be a half line and let (a, b) S w. Suppose that Q is absolutely continuous inside (a, b). If for some κ [a, b] Q(x) is decreasing and convex on (a, κ), () (x A)Q (x) is non-negative and increasing on (κ, b), then (a, b) Z(w) =. Remark Corollary 8 implies that if Σ = [, + ), and xq (x) is increasing on (a, b) S w, (3) then (a, b) Z(w) =. (3) is an often used criterion in logarithmic potential theory (with the assumption that Q is differentiable). Notice that Corollary 6

7 8 assumes much less about Q, firstly Q does not have to be a differentiable just absolutely continuous, secondly on the interval (a, κ) (where Q (x) ), () is a weaker assumption than (3). Remark One might ask whether we really need the S w [A, B] assumption in Theorem 5. To see that we do, consider the following example. Let v(t) := acχ [,.] + ( a)c t t t (, ) [,.] =: Σ, where χ [,.] is the characteristic function of the interval [,.], a (, ), and < c is chosen so that v =. If we set Q(x) := log x t v(t)dt x Σ, then by Theorem I.3.3 ([4]), the extremal measure µ w associated with w = exp( Q) has density v(t). We can see easily, that if a is close to, then on [ /, /] < Q (x) and ( + x)q (x) is increasing, however v(t) t as t, so by [] (or [4], Theorem VI..8), Z(w). Now let us see some other theorems to demonstrate why the weak convexity is an appropriate generalization of both the Q is convex, and the xq (x) is increasing conditions. The following theorems are generalizations of some classical results (see [4], sections IV. and IV.3). We will also need them to prove Theorem 5. Theorem 9 Let w = exp( Q) be an admissible (not necessarily continuous) weight on R and suppose that Q is weak convex on the interval I with basepoints A, B R satisfying S w [A, B]. Then S w I is an interval. Remark A weight defined on Σ and the same weight defined on R which is zero on R\Σ gives us the same equilibrium measure. Hence this theorem is as general as if R were replaced by Σ. (We avoided Σ in the formulation, because here we do not suppose that Σ is regular with respect to the Dirichlet problem in C\Σ.) Theorem Let w = exp( Q) be an admissible (not necessarily continuous) weight on R and suppose that Q is weak convex on the interval [A, B] satisfying S w [A, B]. Then the support is a finite interval (by Theorem 9), say, S w = [a, b] and the endpoints a, b satisfy the following conditions: 7

8 (i) If b < B, then π b a x a b x Q (x)dx =, (ii) if a > A, then π b a b x x a Q (x)dx =, (iii) if b = B, then B x a π a B x Q (x)dx, (iv) if a = A, then π b A b x x A Q (x)dx. In the next theorem we give an integral representation for the density of the equilibrium measure µ w. We emphasize that such integral representation was known only in the case when xq (x) is increasing so far (see Theorem IV.3.. ([4])), not even in the case when Q is convex. Now Theorem can also be applied to any convex Q which has bounded derivative, since every convex function is also weak convex. In the proof we will define v(t) almost everywhere, namely on a subset of [, ] with full measure on which Q (t) exists and on which Q satisfies the conditions of weak convexity. (See also Notation 3.) Note also that dµ w (t) = v(t)dt holds only for a.e. t [, ] and not necessarily for all t for which we define v(t). Theorem Let w = exp( Q) be an admissible weight on R such that min S w =, max S w =. Suppose that Q is weak convex on [, ] and that Q is bounded on [, ]. Let κ [, ] be a number such that Q (x) x (, κ) Q (x) x (κ, ). 8

9 Then S w = [, ] (by Theorem 9) and the density of µ w is dµ w (t) = v(t)dt a.e. t [, ], where for a.e. t (, κ) v(t) := and for a.e. t (κ, ): v(t) := + t π t + π t t π t + π t ( s)q (s) ( t)q (t) (s t) s ds+ [ + π ] ( s)q (s) ds. s ( + s)q (s) ( + t)q (t) (s t) s ds+ [ π ] ( + s)q (s) ds. s Examples The following external fields are weak convex on the whole Σ. (We just list external fields which are weak convex, but not convex.).) Q(x) := βx α, α, β > on Σ := [, + ). (Now w(x) = exp( βx α ).).) Q(x) := β ln(x + α), α, β > on Σ := [, ). (Now w(x) = /(x + α) β.) 3.) Q(x) := if x [, ] and Q(x) := ln x if x on Σ := [, ). 4.) Q(x) := β ln( + x ) (so w(x) = /( + x ) β ) on Σ := [, ]. More generally, if α, α, β, β, γ (, ) and { (α w(x) := if x [, γ] x) β (x+α if x (γ, ] ) β is continuous on [, ], then the corresponding Q(x) = ln w(x) external field is weak convex on [, ]. 5.) Q(x) := /( ln x) α, α > on Σ := [, ]. By Theorem 9, in these examples the support of the extremal measure associated with w is a finite interval: [a, b]. So by Theorem 5 (and Theorem C), a continuous function f can be uniformly approximated by weighted polynomials of the form w n P n if and only if f vanishes outside the support [a, b]. In some cases with the help of Theorem we can get the actual values of a and b. 9

10 Finally here is an example to demonstrate the local usage of Theorem 5. 6.) Consider Q(x) := sin x on Σ := [, ]. It is not a weak convex function on [, ], however sin x is weak convex on [,.86] with basepoints and. Thus by Theorem 9, J := S w [,.86] is a closed interval. So by Theorem 5, any continuous function which vanishes outside J can be uniformly approximated by weighted polynomials of the form w n P n, where w(x) = exp( sin x). Notice that it is no longer an if and only if statement, secondly we have to make sure that J is not an empty set, since in this case the statement is meaningless. PROOFS First we give a sufficient condition for interchanging differentiation and integration in a parametric integral, which we will need later. This problem is discussed in many calculus books, but here we do not assume that the integrand F (x, t) is a differentiable function of x (when t is fixed), we merely assume absolute continuity. Our belief is that this more general problem should be discussed in books dealing with absolutely continuous functions, in the section where they discuss other classical problems like integration by substitution and integration by parts for absolutely continuous functions. The condition and the proof we give matches the simplicity and usefulness of these other two classical theorems. Definition Let f be an integrable function. We say that a point x R is a weak-lebesgue point of f, if lim x x x x x x f(t)dt = f(x ). We say that a point x R is a Lebesgue point of f, if lim x x x x x x f(t) f(x ) dt =. Clearly every Lebesgue point is also a weak Lebesgue point. It is known that for an integrable function almost every point is a Lebesgue point, therefore almost every point is a weak Lebesgue point.

11 Lemma 3 Let F : [, ] [, ] R be a function so that x F (x, t ) is absolutely continuous for a.e. t [, ]. Thus for a.e. t [, ], F (x, t ) := x F (x, t ) exists for a.e. x [, ]. Suppose further that F (x, t) is measureable on the product space [, ] [, ]. Let V (t ) := F (x, t ) dx (a.e. t [, ]) be the total variation of F (x, t ) and φ(x) := F (x, t)dt (a.e x [, ]). If V (t)dt < and x [, ] is a weak Lebesgue point of φ, then [ ] d dx F (x, t)dt (x ) = F (x, t)dt. Proof. Using the absolute continuity assumption and the Fubini theorem we get x x (F (x, t) F (x, t))dt = = x x x x x x φ(x)dx. (We could reverse the order of integration since But x is a weak Lebesgue point of φ, so lim x x x x which proves the statement. x x φ(x)dx = φ(x ) = x x F (x, t)dxdt F (x, t) dxdt < +.) F (x, t)dt (4) Corollary 4 If x F (x, t ) is absolutely continuous for a.e. t [, ] and F (x, t) L ([, ] [, ]), then [ d ] F (x, t)dt (x ) = F (x, t)dt dx holds for a.e. x [, ]. Proof. φ(x) dx F (x, t) dtdx <, so φ L [, ]. Thus almost every point of [, ] is a weak Lebesgue point of φ and the statement follows by applying Lemma 3.

12 Proof of Theorem 9. Since S w is bounded, if any of A and B is infinite we can replace them by a finite value so that S w [A, B] still holds (see also Proposition 4). So we can assume that A and B are finite. Suppose indirectly that there exist a, b S w I, a < b: (a, b) S w =. Let µ := µ w denote the equilibrium measure associated with w and U(x) := U µ (x) := R ln x t dµ(t) be the logarithmic potential function of µ. Clearly U(x) is absolutely continuous on every closed subset of (a, b), and because of the Lebesgue monotone convergence theorem, U(x) is continuous on [a, b]. (Indeed, we may assume that B A, so ln(/ x t ) > x, t [A, B]. We split the above integral to two integrals, one with measure µ (,a] and the other with measure µ [b,+ ). Since U(a) and U(b) are finite from (), we can apply Lebesgue s theorem to the two integrals.) So U(x) is absolutely continuous on [a, b]. Since R x t dµ(t) is continuous in (a, b), by Lemma (3), U (x) = x t dµ(t) x (a, b). Notice that both (B x) are strictly increasing functions of x x t x t (a, b) for any fixed t (A, a] [b, B) and they are increasing functions if t = A or t = B. We know that µ({a}) = µ({b}) = (because µ has finite logarithmic energy) and since S w [A, B] we get that both (B x)u (x) and (x A)U (x) are strictly increasing on (a, b). Let R(x) := U(x) + Q(x) and let κ [A, B] be the number from the definition of weak convexity, that is and (x A) Q (x) x (A, κ) I, Q (x) x (κ, B) I. (5) Let E := (B κ)/(κ A) if κ A and E := otherwise. Consider the function { (B x)[u f(x) := (x) + Q (x)] if x (A, κ) (a, b) E(x A)[U (x) + Q (x)] if x (κ, B) (a, b). Since U is continuous on (a, b), from (5) it follows that f is a strictly increasing function on the whole (a, b). Therefore we cannot find numbers x, x I, x < x for which both < R (x ) and > R (x ) hold.

13 From Theorem A we have R(x) := U(x) + Q(x) F w x (a, b) and R(a), R(b) F w. It is impossible that R(x) = F w for all y (a, b), because then f(x) would not be strictly increasing. So there is a y (a, b) : F w < R(y). If we also use the limit condition of weak convexity (Definition ), we get y < R(y) F w R(y) R(a) R(y) lim R(x) = lim R (t)dt x a+ x a+ x which implies the existence of x (a, y) : < R (x ). Similarly > F w R(y) R(b) R(y) lim R(x) R(y) = lim x b x b so there is an x (y, b) : > R (x ). This is a contradiction. x y R (t)dt, Proof of Theorem. As in the proof of Theorem 9, we can assume again that A and B are finite. We shall only prove i) and iii), the other two follow by the symmetry of the statement. If K R is a compact set, we define F (K) := log cap(k) Qdω K where ω K is the equilibrium measure of K. This is called the F-functional for w and from Theorem IV..5. [4], we know that F (S w ) = F ([a, b]) = max F ([α, β]) (6) α,β where the maximum is taken over all nondegenerate intervals [α, β] [A, B]. Now from example I.3.5 in [4] we have cap[α, β] = β α, dω [α,β] = 4 dx π (x α)(β x) x [α, β], and so F ([α, β]) = log β α 4 π β α Q(x) (x α)(β x) dx. 3

14 On making the change of variable x = β + a we can rewrite F ([a, β]) as F ([a, β]) = log β a 4 F ([a, β]) = β β a π + β a π π Q ( β + a cos θ, θ π, ( β + a Q + β a ) cos θ dθ. Using () and the lower semi-continuity of Q it follows that Q is bounded on [a, b]. Thus from the Lebesgue dominated convergence theorem β F ([a, β]) is a continuous function on [a, b]. Interchanging differentiation and integration, we get π ) cos θ (+cos θ)dθ + β a To verify the differentiation, we will show that π ( β + a h(β) := Q + β a ) cos θ (+cos θ)dθ = β β a a β (a, B). (7) x a β x Q (x)dx is a continuous real function of β on (a, B) and π ( β β + a Q + β a ) cos θ ( + cos θ) dθ (8) is bounded inside (a, B). (See Lemma 3). We will also see that lim β B h(β) exists and equal to h(b) (infinity value is allowed). Thus from the Lagrange mean value theorem we can conclude that (7) holds on (a, B] in the case when b = B. Now if b < B, we gain (i) immediately from (7), since by (6) F ([a, β]) has to be zero at β = b. On the other hand if b = B, β we gain (iii) by the same logic, since by (6) the left derivative has to be F ([a, β]) β β=b. The boundedness of (8) can be proved similarly as the finiteness of h(β) on (a, B) (see below). Thus it remained to prove that h(β) is continuous on (a, B] in the extended sense. Let κ be a number so that Q (x) x [A, κ) Q (x) x (κ, B]. 4

15 First we show that h(β) is a finite valued function on (a, B). So let β (a, B). Notice that because of our monotonicity assumptions, Q is bounded inside (A, B). So h(β) is clearly finite if A < a. If however a = A, we have to distinguish two cases: - If A < κ, then κ A Q (x)dx = lim ɛ + κ A+ɛ since Q is bounded on [a, b]. - If A = κ, then h(β) = β β a A Q (x)dx = lim ɛ +(Q(κ) Q(A + ɛ)) >, (x A)Q (x) (x A)(β x) dx < +, since (x A)Q (x) is a (nonnegative) increasing function. These show that h(β) is finite in both cases. We are done, if we can show that for any u [A, B) and for any f L [A, B] nonnegative decreasing function, β u f(x) x a (B x) β x dx is a continuous function of β on (u, B], while if g L [A, B] is any nonnegative increasing function, then β u g(x) x a (x A) dx (9) β x is continuous on (u, B] and continuous on [u, B], if A < u. Indeed, if a < β κ, then we use β x a β f(x) x a a β x Q (x)dx = a (B x) β x dx, where f(x) := (B x)q (x) is decreasing on [A, κ), while if a < κ β B or κ a < β B, we use β x a κ x a β g(x) x a a β x Q (x)dx = a β x Q (x)dx + κ (x A) β x dx 5

16 or β a x a β β x Q (x)dx = a g(x) x a (x A) β x dx respectively, where g(x) := (x A)Q (x) is increasing on (κ, B]. And here κ x a β x Q (x)dx a is clearly a continuous function of β on [κ, B] by the Lebesgue monotone convergence theorem. Consider β f(x) x a h (β) := u (B x) β x dx = β u π f( β+u + β u cos θ)( + cos θ) dθ. (B ( β+u + β u cos θ)) If β β (u, B), the integrands at the right hand side have an integrable majorant (Cf( β +u + β u cos θ), where u < β < β ), so by the Lebesgue dominated convergence theorem lim h (β) = β u π lim β β f( β+u + β u cos θ)( + cos θ) dθ. β β (B ( β +u + β u cos θ)) But f is continuous almost everywhere and arccos x is an absolutely continuous function, thus for almost every θ [, π] we have lim β β f( β+u + β u cos θ) = f( β +u + β u cos θ). This means that h (β) is continuous at β. Now let β := B and we will prove that h (β) is continuous at B from the left in the extended sense (i.e., h (B) = + is allowed). We may suppose right away that h (B) < +, since if h (B) = +, then lim β B h (β) = + is clear. Let < D be any (big) number and ɛ := ɛ(β) := B β. Consider Now β Dɛ u h (β) = β B (β Dɛ) β Dɛ β (β Dɛ) u u f(x) x a (B x) β x dx = β Dɛ u f(x) x a D + B dx (B x).5 D u 6 β +. () β Dɛ f(x) x a (B x) ().5 dx.

17 We will show that the second term in (), β β Dɛ is going to, as β B. Since < D was arbitrary, this together with () imply that β Now β Dɛ f(x) x a (B x) f(β Dɛ) dx C β x B β lim sup h (β) h (B). () β B β β Dɛ dx C D β x f(β Dɛ) B (β Dɛ) (3) where C D depends on D, but not on β. As β B, ɛ = ɛ(β), so to prove that the right hand side of (3) is goint to, we have to show that This latter limit follows from h (B) = lim β B B u f(β) B β =. f(x) x a dx < +. (B x).5 Indeed, with a simplified notation, we claim that f(ɛ) lim = (4) ɛ + ɛ follows from f(x) d x/x.5 dx < (where f is any nonnegative increasing function and d is arbitrary). Notice that for any small < ɛ, ɛ f(x) d x dx C f( ɛ), x.5 ɛ ɛ so if we choose any ɛ > ɛ > ɛ 3 >... > with the constraint that [ɛ, ɛ ], [ɛ, ɛ ],... are disjoint intervals, then > f(x) d x dx x.5 i= ɛi ɛ i f(x) d x dx C x.5 i= f(ɛ i ) ɛi, which implies that lim(f(ɛ i )/ ɛ i ) =. From this fact (4) follows easily. 7

18 So () is proved. To get we just have to look at β u f(x) x a (B x) β x dx β u lim inf β B h (β) h (B) f(x) x a B f(x) x a dx (B x).5 u (B x) dx as β.5 B. Therefore the continuity of h (β) at B is established. The continuity of (9) on (u, B] follows with the same argument. Finally, if A < u, then g(x) and x A are bounded in a neighborhood of u, so (9) tends to as β tends to u from the left, hence (9) is continuous on [u, B]. The proof of Theorem is now complete. Definition 5 Let f L [a, b]. For x (a, b) the Cauchy principal value integral is defined as b ( f(s) x ɛ f(s) b ) P V := lim a s x ɛ a s x ds + f(s) x+ɛ s x ds if this limit exists. If x (a, b), the P V integral is simply an ordinary Lebesgue integral (which clearly exists if x [a, b]): P V b a f(s) ds := s x b a f(s) s x ds. A well known theorem states that for almost every x in [, ] the above principal value integral exists and finite. Proof of Theorem. Lemma 6 Let w = exp( Q) be an admissible weight on R so that S w = [, ]. Suppose that Q is absolutely continuous on [, ] and that Q (which exists a.e. in [, ]) is bounded in [, ]. Let v(t) := π t P V s Q (s) ds + s t π, t [, ]. (5) t If v(t) a.e. t [, ], then dµ w (t) = v(t)dt a.e. t [, ]. 8

19 Proof. Let w (x) = exp( Q (x)) be and admissible weight on R such that Q is absolutely continuous on [, ] and Q is bounded on [, ]. Consider the expression g(t) := t P V π t + π t( t) ( π sq (s) (s t) s( s) ds+ ) s s Q (s)ds. Exactly as in the proof of Theorem IV.3.. ([4]), if we set f(x) = Q (x )/ and apply Theorem IV.3.. ([4]), we get that g = and ln x t g(t)dt = Q (x) + C with some constant C for all x (, ). (Theorem IV.3.. ([4]) is originated from [3]. Note that in the formulation of this theorem there is a missing hypothesis: f should be absolutely continuous on [, ].) If we transfer this statement from [, ] to [, ] by a linear transformation, we get the following: Let v(t) := t π t P V ( + s)q (s) (s t) s ds+ ( + π ) ( + s)q (s) ds t (, ), t π s then v =, and ln x t v(t)dt = Q(x) + C x (, ) (6) with some constant C. We assumed that v(t) almost everywhere and therefore by Theorem I.3.3. ([4]), dµ w (t) = v(t)dt a.e. t [, ] as we stated. (Because of (6) and the boundedness of Q on [, ], the finite logarithmic energy condition of I.3.3 is satisfied.) To get (5) we just have to combine the two integrals above in the representation of v(t). Now we can prove Theorem as follows. 9

20 Let r [, ] be arbitrary. We will find another form of the function v in Lemma 6. We will make use of the identity (see [4], formula IV.(3.)) so = +P V P V (s t) ds = t (, ). (7) s [ r ( s )Q (s) v(t) = π P V t (s t) s ds+ ] ( s )Q (s) P V r (s t) s ds + π t [ r [( + t)( s) + (s t)( s)]q (s) π P V t (s t) ds s r [( t)( + s) (s t)( + s)]q (s) (s t) s ds v(t) = + t π t P V + t π t P V [ + π t + r π t r r Let κ [, ] be a number so that ] + ( s)q (s) (s t) s ds+ ( + s)q (s) (s t) s ds+ ( s)q (s) ds s Q (x) x (, κ) Q (x) x (κ, ). r π t, ] ( + s)q (s) ds. (8) s Let t (, κ) be a value for which Q (t) exists. Setting r := and using (7), we get v(t) = + t π t P V + π t [ + π ( s)q (s) ( t)q (t) (s t) s ds+ ] ( s)q (s) ds. s

21 By Theorem the second term is non-negative. From the assumptions of Theorem, clearly ( s)q (s) ( t)q (t) s t is nonnegative, when s (, κ), and it is also nonnegative, when s (κ, ). (For the latter, consider the sign of Q.) Thus on the set {t (, κ) : Q (t) exists} we have v(t) and v(t) has the form as given in Theorem. If in (8) we set r :=, we can see the same way that on the set {t (κ, ) : Q (t) exists} we have v(t) and v(t) has the form as given in Theorem. So v(t) a.e. t [, ], and dµ w (t) = v(t)dt follows from the previous lemma. Proof of Theorem 6. Since w is absolutely continuous inside (a, b) and dw(x)/dx = w(x)q (x) is in every L p, < p < inside (a, b) (because Q is bounded inside (a, b)), it follows from Theorem IV.. ([4]) that µ Q is absolutely continuous and its derivative is in every L p inside (a, b). We shall denote the density dµ Q (t)/dt by v(t). Now we prove the first part of Theorem 6, that is: Lemma 7 If (a, b) S w and Q is weak convex on (a, b) with basepoints min S w and max S w, then v has a positive lower bound inside (a, b). Proof. The same argument works as in the proof of Theorem F (see [6]), since now Theorem 9 is at our disposal. For any positive λ, clearly λq is also weak convex on (a, b) with basepoints min S w and max S w, so by Theorem 9, S w λ (a, b) is an interval with endpoints a λ, b λ. We show that if < λ is sufficiently close to, then a λ is sufficiently close to a and b λ is sufficiently close to b. It is enough to prove that in any neighborhood of any point x of (a, b) there is a point x lying in some (a λ, b λ ), < λ. Indeed, then this property and the decreasing character of the support S, namely S w r S w r for r > r (see [4], Theorem IV.4.) imply our claim.

22 Now we use the following characterization of points in the support S w : x S w if and only if for every neighborhood B of x, there is an n and a polynomial P n of degree at most n such that w n P n attains its maximum in Σ at some point of B Σ and nowhere outside B (see [4], Corollary IV..4). By continuity then the same is true of w λn P n for some < λ sufficiently close to. But w λn P n Σ = w λn P n Sw. (C\Σ is a regular domain, so for λ any continuous w we have w n P n Σ = w n P n Sw, see [4], Corollary III..6.) Therefore B S w λ and so in B there is an x lying in (a λ, b λ ) as we claimed above. Thus, if [a, b ] is any subinterval of (a, b), there is a λ > such that [a, b ] is in the support of µ w λ. Now we invoke the inequality ([4], Theorem IV.4.9): µ w ( Sw λ λ µ w + ) ω λ Sw Sw λ λ, where ω Sw denotes the equilibrium measure of the set S w (which is nothing else than the equilibrium measure corresponding to the identically zero field on S w ). Since [a, b ] is part of S w λ and the equilibrium measure ω Sw has a positive and continuous density in (a, b ), it follows that the density of µ w has a positive lower bound inside (a, b ). Here [a, b ] (a, b) was arbitrary, so the proof of the lemma is complete. It remained to prove the second part of Theorem 6. To do this, first we need the concept of the balayage measure. Let ν be a measure on the real line and K be an interval. There is a unique measure ν supported on K such that the total mass of ν equals the total mass of ν and for some constant d we have U ν (x) = U ν (x) + d for every x K. ν is called the balayage of ν onto K. Actually, the balayage process moves (sweeps) only the part of ν lying outside K, i.e., ν = ν K + ν R\K. (9) For the second measure on the right there is a closed form (see [4], formula II.4.47), which shows that by taking balayage onto K, we add to the portion of ν lying in K a measure with a continuous density. The relevance of the balayage to extremal fields is explained by the following: if K S w is a closed interval and w is the restriction of w onto K (i.e., the weight w is considered on K), then the equilibrium measure

23 µ w associated with w is the balayage of µ w onto K. (See [4], Theorem IV..6(e)). Now we will make some elementary observations regarding functions with smooth intergral. We leave the proofs of the first two propositions to the reader. We say that a family of functions has uniformly smooth integrals, if the δ in the definition of a function with smooth integral is independent of the function in the family. (See also Definition D.) Proposition 8 Non-negative linear combination of finitely many functions with smooth integrals is again with smooth integral. More generally, if ν is a finite positive Borel measure on B R and {v s (x) : s B} is a family of functions with uniformly smooth integral on [a, b] for which s v s (x) is a measureable function for a.e. x [a, b], then v(x) := v s (x)dν(s) has also smooth integral on [a, b]. The proof of the next simple statement can be found in [6]. B Proposition 9 If v has smooth integral, v is continuous, and v v has a positive lower bound, then v v has also smooth integral. Proposition The function log(/ x ) has smooth integral on any interval [ a, a], where < a <. Proof. Let R b,τ := b b τ b+τ b ln x dx ln x dx where a b τ < b + τ a. We have to show that for any < ɛ there is a < δ such that R b,τ ɛ whenever τ δ. By symmetry we can suppose that b Suppose first that b τ. Obviously R b,τ τ τ 3τ ln x dx τ ln x dx = τ( ln ) 3τ( ln(3τ)) τ( ln(τ)) τ ln τ = + ln(6/6) ln τ 3

24 which tends to as τ. Therefore from now on we can suppose that τ b. Again R b,τ. Let us suppose indirectly that for some < ɛ there are positive sequences b n and τ n such that [b n τ n, b n + τ n ] [τ n, a], τ n, and + ɛ R bn,τn. Since τ n /b n is bounded, we may select a converging subsequence from it, so we can assume that τ n /b n ρ, where ρ [, ]. By direct calculation R bn,τn = τ n b n ln b n + (b n τ n ) ln(b n τ n ) τ n + b n ln b n (b n + τ n ) ln(b n + τ n ) = τ n( ln b n ) + (b n τ n ) ln( τn b n ) τ n ( ln b n ) (b n + τ n ) ln( + τn b n ) = + bn τn bn τn τn τn ln( ) ln( bn bn ) ln b n τn τn. () ln(+ ) ln(+ bn bn ) ln b n If < ρ, then b n necessarily, thus ln b n and the limit of () is. If however ρ =, then we use the elementary limits lim γ ln( γ) = γ bn and lim γ ln( + γ) =. Thus lim( + γ τ n ln( τn b n ) ln( τn b n )) = and lim( bn τ n ln( + τn b n ) ln( + τn b n )) = (as n ), which imply that the limit of () is again. This contradiction proves the lemma. After these preparations we start proving the second part of Theorem 6, that is: Theorem If (a, b) S w and Q is weak convex on (a, b) with basepoints min S w and max S w, then v has a smooth integral inside (a, b). Proof. Let us restrict w to [a, b]. Based on what we said about the balayage and smooth integral, it is enough to prove that the equilibrium measure associated with this restricted weight function has a density v which has smooth integral inside (a, b). Indeed, by (9), v = v v, where v is continuous and v has a positive lower bound inside (a, b), so if v has smooth integral inside (a, b), so does v. Therefore from now on we will assume that w is defined on [a, b], i.e., Σ = [a, b]. We will continue to use v for the density of the equilibrium measure associated with this restricted w. Furthermore, because of the balayage 4

25 process, the new support S w is the interval [a, b] (so v is defined on [a, b]). As a result of this, we will be able to apply Theorem to get a formula for v. (We remark that the hypothesis of Theorem is still satisfied, since Q is weak convex on (a, b) by Proposition 4.) Now we will prove three lemmas: Lemma Let f L [c, d] be a function and suppose that f(s) is Lipschitz continuous on [c, c+d] with Lipschitz constant L. Let v (t) := d f(s)ds (t < c s t c). Then for every t (c min(exp ), c) v (t) ln(c t) f(c) 4 (d c), e ( + d c )(L + f(c) ) + f L [c,d] ln(c t). Proof. Let t (c min(exp 4, ), c). Then c t < (d c) e e τ := ln(c t). and we can define Because of the Lipschitz continuity of f, f(s) f(c) L(s c) for all s [c, (c + d)/]. If we divide by s t and integrate, we get c+τ c+τ s t f(s)ds s t f(c)ds c+τ L s c c+τ ds Lτ s t s t ds. c c (Note that from t (c min(exp 4, ), c) it follows that c+τ (c+d)/.) (d c) e This means that d v (t) f(s)ds (ln(c + τ t) ln(c t))f(c) s t c+τ Lτ(ln(c + τ t) ln(c t)), and here d f c+τ L/τ. By the triangle inequality we get ( ) v (t) ln(c t) f(c) Lτ ln(c + τ t) ln(c + τ t) + + f(c) +τ f L. ln(c t) ln(c t) Notice that if ln(c + τ t), then ( ln((c t) + τ) ln + d c ) 5 c d c c

26 because as we mentioned, τ (d c)/. If however ln(c + τ t) <, then ln(c + τ t) = ln((c t) + τ) ln(τ) τ. Therefore in all cases Lτ ( + ) (d c)/ + ln(c t) v (t) ln(c t) f(c) ( /τ (d c)/ + ln(c t) ln(c t) ) f(c) + τ f L. Since from t c e we have τ τ, the statement follows immediately. Lemma 3 Let < α < β < and let a(t), b(t), f(t), g(t) be positive continuous functions on (, ) so that f(t), g(t) L [, ]. Suppose also that f(s) is Lipschitz continuous on [α, β+ ] and g(s) is Lipschitz continuous on [ α, β]. Define { a(t) f(s)ds t (, c) φ c (t) := c s t t (c, ) { t (, c) ψ c (t) := b(t) c g(s)ds t (c, ) t s and ρ c (t) := φ c (t) + ψ c (t), F := {ρ c (t) : c [α, β]}. If a(c)f(c) = b(c)g(c) for all c [α, β], then the family of function F has uniformly smooth integral on [α, β]. Proof. In this proof let us agree on the following (unusual) notation: we say that a function (of t, c, I and J) is o() if it is uniformly tending to on its specified domain as ɛ. This domain can depend on ɛ. For example since a(t) is a continuous function, we may write: a(t) = a(c)+o() for t [c, c+ɛ] as ɛ. 6

27 Let I := [u ɛ, u] and J := [u, u + ɛ] be two adjacent intervals of [α, β] with < ɛ. Define ν c (I, J) := ρ c(t)dt I ρ J c(t)dt. To be able to use Lemma, we suppose that ɛ < min(, exp 4 ). 4 ( β) Now δ := ɛ ɛ >. Let us fix an arbitrary c [α, β] and let d := max(c δ, α) and e := min(c + δ, β). CASE : Suppose that (I J) [α, d]. The function h(t) := s t f(s)ds is increasing on (, c), therefore h(u ɛ) a(t)dt and from which I c I φ c (t)dt h(u) a(t)dt I h(u) a(t)dt φ c (t)dt h(u + ɛ) a(t)dt J J J ν c (I, J) I a(t)dt J a(t)dt and ν c (J, I) But a(t) has smooth integral on [α, β]. Also ( h(u + ɛ) + ɛ c (u + ɛ) h(u + ɛ) a(t)dt J h(u ɛ) a(t)dt. I ) h(u ɛ), which can be gained by integrating the following inequality with respect to s from c to : ( ) s (u + ɛ) f(s) ɛ + c (u + ɛ) s (u ɛ) f(s). But c (u + ɛ) δ, so h(u + ɛ)/h(u ɛ) + ɛ/( ɛ ɛ) = + o(). Thus we have proved that ν c (I, J) = + o() and ν c (J, I) = + o() as ɛ, where (I J) [α, d]. 7

28 CASE : Suppose that (I J) [e, β]. Exactly as in case, we can see that ν c (I, J) = +o() and ν c (J, I) = +o() as ɛ, where (I J) [e, β]. CASE 3: Now suppose that (I J) (d, e). Let d := max(c ɛ, α) and e := min(c + ɛ, β). Because of our assumption, I J [d, e ]. Let first t (d, c) be arbitrary and define the function h(t) as in case. From Lemma, we have φ c (t) a(t) ln(c t) f(c) ( + c )(L + f(c)) + f L [c,] ln(c t) () where L is the Lipschitz constant of f on the interval [c, c+ ]. But c [α, β], so L sup f(y) f(x) x, y [α, β+ ] y x x y is a finite global upper bound for the possible Lipschitz constants. Also, f(c) f [α,β] and f L [c,] f L [,]. Therefore the numerator of () is bounded by a global constant (which depends on the function f(s) only). Since now t (d, c), c t ɛ, so / ln(c t) = + o() as ɛ. From these, we can conclude that φ c (t) a(t) ln(c t) f(c) = o() t (d, c) as ɛ. () We also know that a(t) is a continuous function, so a(t) = a(c) + o() for t (d, c) as ɛ. (3) a(t) and f(t) are bounded on [α, β] and so from () and (3) we can see that φ c (t) = (a(c)f(c) + o()) ln c t for t (d, c) as ɛ. Now if t (c, e ), the same argument shows that ψ c (t) = (a(c)f(c) + o()) ln t c for t (c, e ) as ɛ. (Here we used the assumption, that b(c)g(c) = a(c)f(c).) 8

29 Putting these together, we have ρ c (t) = (a(c)f(c) + o()) ln c t for t (d, e ) as ɛ. Since the functions a(c) and f(c) have a positive lower bound on [α, β], we get ν c (J, I) = a(c)f(c) + o() a(c)f(c) + o() J ln c t dt I ln c t = ( + o()) dt J ln c t dt I ln c t dt. By Proposition, log(/ x ) has smooth integral on any interval [ a, a], < a <. Thus the second factor is + o() as ɛ, so and similarly ν c (J, I) = + o() where I, J (d, e ) as ɛ, ν c (I, J) = + o() where I, J (d, e ) as ɛ. Case and case and case 3 together proves that the family of functions F has uniformly smooth integral on [α, β]. Lemma 4 Let H be a monotone increasing function on (, ) which is absolutely continuous inside (, ) and for which H(s)/ s L [, ]. Define v c (x) := P V c (s x) s ds c [, ], x (, ) (which is a principal value integral, if x < c.) Then we can integrate by parts as follows: P V H(s) (s x) s ds = v s (x)dh(s) a.e. x [, ] (4) 9

30 Proof. In fact (4) is true whenever H (x) exists at x. Since the derivative of H exists almost everywhere, this will prove the lemma. Because of (7) we can define v c (x) with regular integrals, too: v c (x) = { c c (s x) s ds (s x) s ds if c < x if x < c P V H(s) (s x) s ds = [ x ɛ H(s) = lim ɛ + (s x) s ds + x+ɛ ] H(s) (s x) s ds Here x ɛ = x ɛ + a and = b + where the second terms tend a x+ɛ x+ɛ b to as a +, b. Integrating by parts, we get x ɛ a H(s) (s x) s ds + b x+ɛ = v x ɛ (x)h(x ɛ) + v a (x)h(a) + v b (x)h(b) + v x+ɛ (x)h(x + ɛ) + H(s) (s x) s ds x ɛ a b x+ɛ v s (x)dh(s) v s (x)dh(s). We will show that lim a + v a (x)h(a) =, lim b v b (x)h(b) =, and if H (x) exists at x, then lim ɛ +[v x+ɛ (x)h(x + ɛ) v x ɛ (x)h(x ɛ)] =. From these the statement of the lemma follows. We have v x+ɛ (x)h(x + ɛ) v x ɛ (x)h(x ɛ) = = [v x+ɛ (x) v x ɛ (x)]h(x + ɛ) v x ɛ (x)[h(x ɛ) H(x + ɛ)]. Here lim ɛ +[v x+ɛ (x) v x ɛ (x)] = P V (s x) ds =, H(x + ɛ) is s bounded as ɛ + and H(x ɛ) H(x + ɛ) lim ɛ + ɛ We can also see, that lim ɛ + ɛv x ɛ (x) =, since v x ɛ (x) = x ɛ (x s) s ds C 3 H (x). x ɛ x s ds C ln ɛ + C.

31 It has remained to prove that lim a + v a (x)h(a) = (the proof of lim b v b (x)h(b) = is the same). First notice that v a (x) behaves like C ( + a) as a +. Therefore we are done, if we can prove the following: If h is a monotone function for which h(s)/ s L [, ], then lim s + sh(s) =. Indeed, if this limit is not zero, then there exist a < δ and a decreasing sequence s n : δ/ s n h(s n ). We can suppose that h(s) is decreasing in (, ρ) for some ρ. (The increasing case is obvious.) We can also suppose that s < ρ. Now δ h(s) s ds (s n s n+ ) δ s n = δ ( s n+ s n ). But this infinite sum is infinity, since s n+ /s n =. This contradicts h(s)/ s L [, ]. At last we are in the position to finish the proof of Theorem 6. We already have proven the first part of the theorem (see Lemma 7). It remains to show that the density of the equilibrium measure has smooth integral inside (a, b). We have seen that it is enough to give a proof when the support is an interval, that is: If S w = [a, b] and Q is weak convex on (a, b), then the density v has smooth integral inside (a, b). (Although by the balayage process we achieved that Σ = [a, b], in this statement Σ doesn t have to be [a, b]. All we need is S w to be an interval. We also remark that although the proof will be short, everything we proved so far is used in the proof.) Proof. We can suppose that a =, b =. Let [α, β] (, ) be an arbitrary interval. Let κ [, ] be a number for which Q (x) x (, κ), Let us define F (s, t) := Q (x) x (κ, ). { +t π t ( s)q (s) if s (, κ) t π t ( + s)q (s) if s (κ, ) 3

32 If in (8) we choose r := κ, we get v(x ) = P V F (s, x ) (s x ) s ds E ( x ) x (, ) where E R is some constant, so by Lemma 4: v(x ) = v s (x )df (s, x ) where the variable of the integration is s, and E ( x ) v s (x ) := P V s (t x ) t dt. Therefore v(t) = + t π t κ v s (t)d[( s)q (s)] + t π t κ v s (t)d[( + s)q (s)] E t (, ). (5) t Setting f(s) := g(s) := / s and a(t) := b(t) := +t 3, we gain that the family of functions { t + t } π t v c(t) : c [, ] π t in Lemma has uniformly smooth integral on [α, β]. So by Proposition 8, the first term of (5) has smooth integral on [α, β]. Similarly the second term of (5) has also smooth integral on [α, β]. Since v(t) has a positive lower bound on [α, β], no matter what the sign of E is, v(t) has a smooth integral on [α, β] by Proposition 8 and Proposition 9. This completes the proof of Theorem 6 References [] A. B. J. Kuijlaars, A note on weighted polynomial approximation with varying weights, J. Approx. Theory, 87 (996), no., 5. 3

33 [] A. B. J. Kuijlaars, The role of the endpoint in weighted polynomial approximation with varying weights, Constr. Approx., (996), no., [3] D. S. Lubinsky and E. B. Saff: Strong asymptotics for extremal polynomials associated with weights on R, Lecture Notes in Mathematics, 35. Springer-Verlag, New York, 988. [4] E. B. Saff, V. Totik, Logarithmic potentials with external fields. Appendix B by T. Bloom. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], 36. Springer-Verlag, Berlin, 997 [5] V. Totik, Weighted approximation with varying weights, Lecture Notes in Mathematics, 569. Springer-Verlag, Berlin, 994. [6] V. Totik, Weighted polynomial approximation for convex external fields, Constr. Approx. 6 (), no., 6-8. David Benko Department of Mathematics Texas A&M University College Station Texas USA benko@math.tamu.edu 33

3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure? MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable

More information

THEOREMS, ETC., FOR MATH 515

THEOREMS, ETC., FOR MATH 515 THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every

More information

An introduction to Mathematical Theory of Control

An introduction to Mathematical Theory of Control An introduction to Mathematical Theory of Control Vasile Staicu University of Aveiro UNICA, May 2018 Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May 2018

More information

Chapter 6. Integration. 1. Integrals of Nonnegative Functions. a j µ(e j ) (ca j )µ(e j ) = c X. and ψ =

Chapter 6. Integration. 1. Integrals of Nonnegative Functions. a j µ(e j ) (ca j )µ(e j ) = c X. and ψ = Chapter 6. Integration 1. Integrals of Nonnegative Functions Let (, S, µ) be a measure space. We denote by L + the set of all measurable functions from to [0, ]. Let φ be a simple function in L +. Suppose

More information

ON THE SUPPORT OF THE EQUILIBRIUM MEASURE FOR ARCS OF THE UNIT CIRCLE AND FOR REAL INTERVALS

ON THE SUPPORT OF THE EQUILIBRIUM MEASURE FOR ARCS OF THE UNIT CIRCLE AND FOR REAL INTERVALS ON THE SUPPORT OF THE EQUILIBRIUM MEASURE FOR ARCS OF THE UNIT CIRCLE AND FOR REAL INTERVALS D. BENKO, S. B. DAMELIN, AND P. D. DRAGNEV Dedicated to Ed Saff on the occasion of his 60th birthday Abstract.

More information

MATH 131A: REAL ANALYSIS (BIG IDEAS)

MATH 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 information

+ 2x sin x. f(b i ) f(a i ) < ɛ. i=1. i=1

+ 2x sin x. f(b i ) f(a i ) < ɛ. i=1. i=1 Appendix To understand weak derivatives and distributional derivatives in the simplest context of functions of a single variable, we describe without proof some results from real analysis (see [7] and

More information

Laplace s Equation. Chapter Mean Value Formulas

Laplace s Equation. Chapter Mean Value Formulas Chapter 1 Laplace s Equation Let be an open set in R n. A function u C 2 () is called harmonic in if it satisfies Laplace s equation n (1.1) u := D ii u = 0 in. i=1 A function u C 2 () is called subharmonic

More information

2 Statement of the problem and assumptions

2 Statement of the problem and assumptions Mathematical Notes, 25, vol. 78, no. 4, pp. 466 48. Existence Theorem for Optimal Control Problems on an Infinite Time Interval A.V. Dmitruk and N.V. Kuz kina We consider an optimal control problem on

More information

Economics 204 Fall 2011 Problem Set 2 Suggested Solutions

Economics 204 Fall 2011 Problem Set 2 Suggested Solutions Economics 24 Fall 211 Problem Set 2 Suggested Solutions 1. Determine whether the following sets are open, closed, both or neither under the topology induced by the usual metric. (Hint: think about limit

More information

The Hilbert Transform and Fine Continuity

The Hilbert Transform and Fine Continuity Irish Math. Soc. Bulletin 58 (2006), 8 9 8 The Hilbert Transform and Fine Continuity J. B. TWOMEY Abstract. It is shown that the Hilbert transform of a function having bounded variation in a finite interval

More information

A List of Problems in Real Analysis

A List of Problems in Real Analysis A List of Problems in Real Analysis W.Yessen & T.Ma December 3, 218 This document was first created by Will Yessen, who was a graduate student at UCI. Timmy Ma, who was also a graduate student at UCI,

More information

Mathematical Methods for Physics and Engineering

Mathematical Methods for Physics and Engineering Mathematical Methods for Physics and Engineering Lecture notes for PDEs Sergei V. Shabanov Department of Mathematics, University of Florida, Gainesville, FL 32611 USA CHAPTER 1 The integration theory

More information

Examples of Dual Spaces from Measure Theory

Examples of Dual Spaces from Measure Theory Chapter 9 Examples of Dual Spaces from Measure Theory We have seen that L (, A, µ) is a Banach space for any measure space (, A, µ). We will extend that concept in the following section to identify an

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Analysis 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 information

( f ^ M _ M 0 )dµ (5.1)

( 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 information

REAL AND COMPLEX ANALYSIS

REAL AND COMPLEX ANALYSIS REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any

More information

Immerse Metric Space Homework

Immerse 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 information

Review of Multi-Calculus (Study Guide for Spivak s CHAPTER ONE TO THREE)

Review of Multi-Calculus (Study Guide for Spivak s CHAPTER ONE TO THREE) Review of Multi-Calculus (Study Guide for Spivak s CHPTER ONE TO THREE) This material is for June 9 to 16 (Monday to Monday) Chapter I: Functions on R n Dot product and norm for vectors in R n : Let X

More information

2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure? MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is

More information

ANALYSIS QUALIFYING EXAM FALL 2017: SOLUTIONS. 1 cos(nx) lim. n 2 x 2. g n (x) = 1 cos(nx) n 2 x 2. x 2.

ANALYSIS QUALIFYING EXAM FALL 2017: SOLUTIONS. 1 cos(nx) lim. n 2 x 2. g n (x) = 1 cos(nx) n 2 x 2. x 2. ANALYSIS QUALIFYING EXAM FALL 27: SOLUTIONS Problem. Determine, with justification, the it cos(nx) n 2 x 2 dx. Solution. For an integer n >, define g n : (, ) R by Also define g : (, ) R by g(x) = g n

More information

X n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2)

X n D X lim n F n (x) = F (x) for all x C F. lim n F n(u) = F (u) for all u C F. (2) 14:17 11/16/2 TOPIC. Convergence in distribution and related notions. This section studies the notion of the so-called convergence in distribution of real random variables. This is the kind of convergence

More information

Measure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond

Measure Theory on Topological Spaces. Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond Measure Theory on Topological Spaces Course: Prof. Tony Dorlas 2010 Typset: Cathal Ormond May 22, 2011 Contents 1 Introduction 2 1.1 The Riemann Integral........................................ 2 1.2 Measurable..............................................

More information

3 Integration and Expectation

3 Integration and Expectation 3 Integration and Expectation 3.1 Construction of the Lebesgue Integral Let (, F, µ) be a measure space (not necessarily a probability space). Our objective will be to define the Lebesgue integral R fdµ

More information

Convex Optimization Notes

Convex Optimization Notes Convex Optimization Notes Jonathan Siegel January 2017 1 Convex Analysis This section is devoted to the study of convex functions f : B R {+ } and convex sets U B, for B a Banach space. The case of B =

More information

Continuity. Chapter 4

Continuity. 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 information

Harmonic Functions and Brownian motion

Harmonic Functions and Brownian motion Harmonic Functions and Brownian motion Steven P. Lalley April 25, 211 1 Dynkin s Formula Denote by W t = (W 1 t, W 2 t,..., W d t ) a standard d dimensional Wiener process on (Ω, F, P ), and let F = (F

More information

n [ F (b j ) F (a j ) ], n j=1(a j, b j ] E (4.1)

n [ F (b j ) F (a j ) ], n j=1(a j, b j ] E (4.1) 1.4. CONSTRUCTION OF LEBESGUE-STIELTJES MEASURES In this section we shall put to use the Carathéodory-Hahn theory, in order to construct measures with certain desirable properties first on the real line

More information

Continuity. Chapter 4

Continuity. 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 information

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

g 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 information

MATH MEASURE THEORY AND FOURIER ANALYSIS. Contents

MATH MEASURE THEORY AND FOURIER ANALYSIS. Contents MATH 3969 - MEASURE THEORY AND FOURIER ANALYSIS ANDREW TULLOCH Contents 1. Measure Theory 2 1.1. Properties of Measures 3 1.2. Constructing σ-algebras and measures 3 1.3. Properties of the Lebesgue measure

More information

consists of two disjoint copies of X n, each scaled down by 1,

consists of two disjoint copies of X n, each scaled down by 1, Homework 4 Solutions, Real Analysis I, Fall, 200. (4) Let be a topological space and M be a σ-algebra on which contains all Borel sets. Let m, µ be two positive measures on M. Assume there is a constant

More information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real 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 information

1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),

1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989), Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer

More information

Fourier Series. 1. Review of Linear Algebra

Fourier Series. 1. Review of Linear Algebra Fourier Series In this section we give a short introduction to Fourier Analysis. If you are interested in Fourier analysis and would like to know more detail, I highly recommend the following book: Fourier

More information

Non-linear wave equations. Hans Ringström. Department of Mathematics, KTH, Stockholm, Sweden

Non-linear wave equations. Hans Ringström. Department of Mathematics, KTH, Stockholm, Sweden Non-linear wave equations Hans Ringström Department of Mathematics, KTH, 144 Stockholm, Sweden Contents Chapter 1. Introduction 5 Chapter 2. Local existence and uniqueness for ODE:s 9 1. Background material

More information

Analysis Comprehensive Exam Questions Fall 2008

Analysis Comprehensive Exam Questions Fall 2008 Analysis Comprehensive xam Questions Fall 28. (a) Let R be measurable with finite Lebesgue measure. Suppose that {f n } n N is a bounded sequence in L 2 () and there exists a function f such that f n (x)

More information

L p Spaces and Convexity

L 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 information

II - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define

II - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define 1 Measures 1.1 Jordan content in R N II - REAL ANALYSIS Let I be an interval in R. Then its 1-content is defined as c 1 (I) := b a if I is bounded with endpoints a, b. If I is unbounded, we define c 1

More information

Integration on Measure Spaces

Integration on Measure Spaces Chapter 3 Integration on Measure Spaces In this chapter we introduce the general notion of a measure on a space X, define the class of measurable functions, and define the integral, first on a class of

More information

THEOREMS, ETC., FOR MATH 516

THEOREMS, ETC., FOR MATH 516 THEOREMS, ETC., FOR MATH 516 Results labeled Theorem Ea.b.c (or Proposition Ea.b.c, etc.) refer to Theorem c from section a.b of Evans book (Partial Differential Equations). Proposition 1 (=Proposition

More information

Lebesgue measure and integration

Lebesgue measure and integration Chapter 4 Lebesgue measure and integration If you look back at what you have learned in your earlier mathematics courses, you will definitely recall a lot about area and volume from the simple formulas

More information

Riemann integral and volume are generalized to unbounded functions and sets. is an admissible set, and its volume is a Riemann integral, 1l E,

Riemann integral and volume are generalized to unbounded functions and sets. is an admissible set, and its volume is a Riemann integral, 1l E, Tel Aviv University, 26 Analysis-III 9 9 Improper integral 9a Introduction....................... 9 9b Positive integrands................... 9c Special functions gamma and beta......... 4 9d Change of

More information

(U) =, if 0 U, 1 U, (U) = X, if 0 U, and 1 U. (U) = E, if 0 U, but 1 U. (U) = X \ E if 0 U, but 1 U. n=1 A n, then A M.

(U) =, if 0 U, 1 U, (U) = X, if 0 U, and 1 U. (U) = E, if 0 U, but 1 U. (U) = X \ E if 0 U, but 1 U. n=1 A n, then A M. 1. Abstract Integration The main reference for this section is Rudin s Real and Complex Analysis. The purpose of developing an abstract theory of integration is to emphasize the difference between the

More information

Measure and integration

Measure and integration Chapter 5 Measure and integration In calculus you have learned how to calculate the size of different kinds of sets: the length of a curve, the area of a region or a surface, the volume or mass of a solid.

More information

If Y and Y 0 satisfy (1-2), then Y = Y 0 a.s.

If Y and Y 0 satisfy (1-2), then Y = Y 0 a.s. 20 6. CONDITIONAL EXPECTATION Having discussed at length the limit theory for sums of independent random variables we will now move on to deal with dependent random variables. An important tool in this

More information

Spring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures

Spring 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 information

Real Analysis Problems

Real Analysis Problems Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.

More information

Moment Inequalities for Equilibrium Measures in the Plane

Moment Inequalities for Equilibrium Measures in the Plane Pure and Applied Mathematics Quarterly Volume 7, Number 1 (Special Issue: In honor of Frederick W. Gehring) 47 82, 2011 Moment Inequalities for Equilibrium Measures in the Plane A. Baernstein II, R. S.

More information

INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES

INTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES INTRODUCTION TO REAL ANALYSIS II MATH 433 BLECHER NOTES. As in earlier classnotes. As in earlier classnotes (Fourier series) 3. Fourier series (continued) (NOTE: UNDERGRADS IN THE CLASS ARE NOT RESPONSIBLE

More information

Journal of Mathematical Analysis and Applications. Non-symmetric fast decreasing polynomials and applications

Journal of Mathematical Analysis and Applications. Non-symmetric fast decreasing polynomials and applications J. Math. Anal. Appl. 394 (22) 378 39 Contents lists available at SciVerse ScienceDirect Journal of Mathematical Analysis and Applications journal homepage: www.elsevier.com/locate/jmaa Non-symmetric fast

More information

van Rooij, Schikhof: A Second Course on Real Functions

van Rooij, Schikhof: A Second Course on Real Functions vanrooijschikhof.tex April 25, 2018 van Rooij, Schikhof: A Second Course on Real Functions Notes from [vrs]. Introduction A monotone function is Riemann integrable. A continuous function is Riemann integrable.

More information

FACULTY OF SCIENCE FINAL EXAMINATION MATHEMATICS MATH 355. Analysis 4. Examiner: Professor S. W. Drury Date: Wednesday, April 18, 2007 INSTRUCTIONS

FACULTY OF SCIENCE FINAL EXAMINATION MATHEMATICS MATH 355. Analysis 4. Examiner: Professor S. W. Drury Date: Wednesday, April 18, 2007 INSTRUCTIONS FACULTY OF SCIENCE FINAL EXAMINATION MATHEMATICS MATH 355 Analysis 4 Examiner: Professor S. W. Drury Date: Wednesday, April 18, 27 Associate Examiner: Professor K. N. GowriSankaran Time: 2: pm. 5: pm.

More information

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

Notions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.

More information

Existence and Uniqueness

Existence and Uniqueness Chapter 3 Existence and Uniqueness An intellect which at a certain moment would know all forces that set nature in motion, and all positions of all items of which nature is composed, if this intellect

More information

We 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

We 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 information

Math212a1413 The Lebesgue integral.

Math212a1413 The Lebesgue integral. Math212a1413 The Lebesgue integral. October 28, 2014 Simple functions. In what follows, (X, F, m) is a space with a σ-field of sets, and m a measure on F. The purpose of today s lecture is to develop the

More information

Part 2 Continuous functions and their properties

Part 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 information

Simultaneous Gaussian quadrature for Angelesco systems

Simultaneous Gaussian quadrature for Angelesco systems for Angelesco systems 1 KU Leuven, Belgium SANUM March 22, 2016 1 Joint work with Doron Lubinsky Introduced by C.F. Borges in 1994 Introduced by C.F. Borges in 1994 (goes back to Angelesco 1918). Introduced

More information

REAL ANALYSIS I Spring 2016 Product Measures

REAL ANALYSIS I Spring 2016 Product Measures REAL ANALSIS I Spring 216 Product Measures We assume that (, M, µ), (, N, ν) are σ- finite measure spaces. We want to provide the Cartesian product with a measure space structure in which all sets of the

More information

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.

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

MATHS 730 FC Lecture Notes March 5, Introduction

MATHS 730 FC Lecture Notes March 5, Introduction 1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists

More information

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

Applied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books. Applied Analysis APPM 44: Final exam 1:3pm 4:pm, Dec. 14, 29. Closed books. Problem 1: 2p Set I = [, 1]. Prove that there is a continuous function u on I such that 1 ux 1 x sin ut 2 dt = cosx, x I. Define

More information

212a1214Daniell s integration theory.

212a1214Daniell s integration theory. 212a1214 Daniell s integration theory. October 30, 2014 Daniell s idea was to take the axiomatic properties of the integral as the starting point and develop integration for broader and broader classes

More information

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x

More information

1 Measurable Functions

1 Measurable Functions 36-752 Advanced Probability Overview Spring 2018 2. Measurable Functions, Random Variables, and Integration Instructor: Alessandro Rinaldo Associated reading: Sec 1.5 of Ash and Doléans-Dade; Sec 1.3 and

More information

Measurable functions are approximately nice, even if look terrible.

Measurable functions are approximately nice, even if look terrible. Tel Aviv University, 2015 Functions of real variables 74 7 Approximation 7a A terrible integrable function........... 74 7b Approximation of sets................ 76 7c Approximation of functions............

More information

here, this space is in fact infinite-dimensional, so t σ ess. Exercise Let T B(H) be a self-adjoint operator on an infinitedimensional

here, this space is in fact infinite-dimensional, so t σ ess. Exercise Let T B(H) be a self-adjoint operator on an infinitedimensional 15. Perturbations by compact operators In this chapter, we study the stability (or lack thereof) of various spectral properties under small perturbations. Here s the type of situation we have in mind:

More information

Definitions & Theorems

Definitions & Theorems Definitions & Theorems Math 147, Fall 2009 December 19, 2010 Contents 1 Logic 2 1.1 Sets.................................................. 2 1.2 The Peano axioms..........................................

More information

LECTURE 15: COMPLETENESS AND CONVEXITY

LECTURE 15: COMPLETENESS AND CONVEXITY LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other

More information

Analysis III. Exam 1

Analysis 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 information

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

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9 MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

More information

L p Functions. Given a measure space (X, µ) and a real number p [1, ), recall that the L p -norm of a measurable function f : X R is defined by

L p Functions. Given a measure space (X, µ) and a real number p [1, ), recall that the L p -norm of a measurable function f : X R is defined by L p Functions Given a measure space (, µ) and a real number p [, ), recall that the L p -norm of a measurable function f : R is defined by f p = ( ) /p f p dµ Note that the L p -norm of a function f may

More information

The Heine-Borel and Arzela-Ascoli Theorems

The Heine-Borel and Arzela-Ascoli Theorems The Heine-Borel and Arzela-Ascoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine- Borel theorem and the Arzela-Ascoli theorem. We prove them

More information

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

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................

More information

Lebesgue-Radon-Nikodym Theorem

Lebesgue-Radon-Nikodym Theorem Lebesgue-Radon-Nikodym Theorem Matt Rosenzweig 1 Lebesgue-Radon-Nikodym Theorem In what follows, (, A) will denote a measurable space. We begin with a review of signed measures. 1.1 Signed Measures Definition

More information

Reflected Brownian Motion

Reflected Brownian Motion Chapter 6 Reflected Brownian Motion Often we encounter Diffusions in regions with boundary. If the process can reach the boundary from the interior in finite time with positive probability we need to decide

More information

Implicit Functions, Curves and Surfaces

Implicit Functions, Curves and Surfaces Chapter 11 Implicit Functions, Curves and Surfaces 11.1 Implicit Function Theorem Motivation. In many problems, objects or quantities of interest can only be described indirectly or implicitly. It is then

More information

Notes on uniform convergence

Notes 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 information

Analysis IV : Assignment 3 Solutions John Toth, Winter ,...). In particular for every fixed m N the sequence (u (n)

Analysis IV : Assignment 3 Solutions John Toth, Winter ,...). In particular for every fixed m N the sequence (u (n) Analysis IV : Assignment 3 Solutions John Toth, Winter 203 Exercise (l 2 (Z), 2 ) is a complete and separable Hilbert space. Proof Let {u (n) } n N be a Cauchy sequence. Say u (n) = (..., u 2, (n) u (n),

More information

FUNDAMENTALS OF REAL ANALYSIS by. IV.1. Differentiation of Monotonic Functions

FUNDAMENTALS OF REAL ANALYSIS by. IV.1. Differentiation of Monotonic Functions FUNDAMNTALS OF RAL ANALYSIS by Doğan Çömez IV. DIFFRNTIATION AND SIGND MASURS IV.1. Differentiation of Monotonic Functions Question: Can we calculate f easily? More eplicitly, can we hope for a result

More information

The small ball property in Banach spaces (quantitative results)

The small ball property in Banach spaces (quantitative results) The small ball property in Banach spaces (quantitative results) Ehrhard Behrends Abstract A metric space (M, d) is said to have the small ball property (sbp) if for every ε 0 > 0 there exists a sequence

More information

CHAPTER I THE RIESZ REPRESENTATION THEOREM

CHAPTER I THE RIESZ REPRESENTATION THEOREM CHAPTER I THE RIESZ REPRESENTATION THEOREM We begin our study by identifying certain special kinds of linear functionals on certain special vector spaces of functions. We describe these linear functionals

More information

MATH 202B - Problem Set 5

MATH 202B - Problem Set 5 MATH 202B - Problem Set 5 Walid Krichene (23265217) March 6, 2013 (5.1) Show that there exists a continuous function F : [0, 1] R which is monotonic on no interval of positive length. proof We know there

More information

are harmonic functions so by superposition

are harmonic functions so by superposition J. Rauch Applied Complex Analysis The Dirichlet Problem Abstract. We solve, by simple formula, the Dirichlet Problem in a half space with step function boundary data. Uniqueness is proved by complex variable

More information

Rudin Real and Complex Analysis - Harmonic Functions

Rudin Real and Complex Analysis - Harmonic Functions Rudin Real and Complex Analysis - Harmonic Functions Aaron Lou December 2018 1 Notes 1.1 The Cauchy-Riemann Equations 11.1: The Operators and Suppose f is a complex function defined in a plane open set

More information

An introduction to some aspects of functional analysis

An introduction to some aspects of functional analysis An introduction to some aspects of functional analysis Stephen Semmes Rice University Abstract These informal notes deal with some very basic objects in functional analysis, including norms and seminorms

More information

u xx + u yy = 0. (5.1)

u xx + u yy = 0. (5.1) Chapter 5 Laplace Equation The following equation is called Laplace equation in two independent variables x, y: The non-homogeneous problem u xx + u yy =. (5.1) u xx + u yy = F, (5.) where F is a function

More information

I. ANALYSIS; PROBABILITY

I. ANALYSIS; PROBABILITY ma414l1.tex Lecture 1. 12.1.2012 I. NLYSIS; PROBBILITY 1. Lebesgue Measure and Integral We recall Lebesgue measure (M411 Probability and Measure) λ: defined on intervals (a, b] by λ((a, b]) := b a (so

More information

Functional Analysis I

Functional Analysis I Functional Analysis I Course Notes by Stefan Richter Transcribed and Annotated by Gregory Zitelli Polar Decomposition Definition. An operator W B(H) is called a partial isometry if W x = X for all x (ker

More information

Some Background Material

Some Background Material Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important

More information

Houston Journal of Mathematics. c 2015 University of Houston Volume 41, No. 4, 2015

Houston Journal of Mathematics. c 2015 University of Houston Volume 41, No. 4, 2015 Houston Journal of Mathematics c 25 University of Houston Volume 4, No. 4, 25 AN INCREASING FUNCTION WITH INFINITELY CHANGING CONVEXITY TONG TANG, YIFEI PAN, AND MEI WANG Communicated by Min Ru Abstract.

More information

Analysis Qualifying Exam

Analysis Qualifying Exam Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,

More information

CHAPTER 6. Differentiation

CHAPTER 6. Differentiation CHPTER 6 Differentiation The generalization from elementary calculus of differentiation in measure theory is less obvious than that of integration, and the methods of treating it are somewhat involved.

More information

VISCOSITY SOLUTIONS. We follow Han and Lin, Elliptic Partial Differential Equations, 5.

VISCOSITY SOLUTIONS. We follow Han and Lin, Elliptic Partial Differential Equations, 5. VISCOSITY SOLUTIONS PETER HINTZ We follow Han and Lin, Elliptic Partial Differential Equations, 5. 1. Motivation Throughout, we will assume that Ω R n is a bounded and connected domain and that a ij C(Ω)

More information

CHAPTER 6. Limits of Functions. 1. Basic Definitions

CHAPTER 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 information

Notes on the Lebesgue Integral by Francis J. Narcowich November, 2013

Notes on the Lebesgue Integral by Francis J. Narcowich November, 2013 Notes on the Lebesgue Integral by Francis J. Narcowich November, 203 Introduction In the definition of the Riemann integral of a function f(x), the x-axis is partitioned and the integral is defined in

More information

Solutions Final Exam May. 14, 2014

Solutions 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

Riesz Representation Theorems

Riesz Representation Theorems Chapter 6 Riesz Representation Theorems 6.1 Dual Spaces Definition 6.1.1. Let V and W be vector spaces over R. We let L(V, W ) = {T : V W T is linear}. The space L(V, R) is denoted by V and elements of

More information

MORE ON CONTINUOUS FUNCTIONS AND SETS

MORE ON CONTINUOUS FUNCTIONS AND SETS Chapter 6 MORE ON CONTINUOUS FUNCTIONS AND SETS This chapter can be considered enrichment material containing also several more advanced topics and may be skipped in its entirety. You can proceed directly

More information