A note on the convex infimum convolution inequality
|
|
- Verity Montgomery
- 5 years ago
- Views:
Transcription
1 A note on the convex infimum convolution inequality Naomi Feldheim, Arnaud Marsiglietti, Piotr Nayar, Jing Wang Abstract We characterize the symmetric measures which satisfy the one dimensional convex infimum convolution inequality of Maurey. For these measures the tensorization argument yields the two level Talagrand s concentration inequalities for their products and convex sets in R n. 00 Mathematics Subject Classification. Primary 6D0; Secondary 8A35, 5A0, 60E5. Key words and phrases. Infimum convolution, Concentration of measure, Convex sets, Product measures, Poincaré inequality. Introduction In the past few decades a lot of attention has been devoted to study the concentration of measure phenomenon, especially the concentration properties of product measures on the Euclidean space R n. Through this note by x p we denote the l p norm on R n, namely x p = n i= x i p /p, and let us take Bp n = {x R n : x p }. We say that a Borel probability measure µ on R n satisfies concentration with a profile α µ t if for any set A R n with µa / we have µa + tb n α µ t, t 0, where B n is the Euclidean ball of radius, centred at the origin. Equivalently, for any -Lipschitz function f on R n we have µ{x : f Med µ f > t} α µ t, t > 0, where Med µ f is a median of f. Moreover, the median can be replaced with the mean, see [L, Proposition.8]. The usual way to reach concentration is via certain functional inequalities. For example, we say that µ satisfies Poincaré inequality sometimes also called the spectral gap inequality with constant C, if for any f : R n R which is, say, C smooth, we have Var µ f C f dµ. We assume that C is the best constant possible. This inequality implies the exponential concentration, namely, concentration with a profile α µ t = exp t/ C. The product exponential probability measure ν n, i.e., measure with density n exp x, satisfies with the constant 4 the one dimensional case goes back to [K]; for a one-line proof see Lemma. in [BL]. From this fact case n = one can deduce, using the transportation argument, that any one-dimensional log-concave measure, i.e. the measure with the density of the form e V, where V is convex, satisfies the Poincaré inequality with a universal constant C. In fact, there is a so-called Muckenhoupt condition that fully characterize measures satisfying the one dimensional Poincaré inequality, see [Mu] and [K]. Namely, let us assume, for simplicity, that our measure is symmetric. If the density of the absolutely continuous part of µ is equal to p then the optimal constant in satisfies + B C 4B, where B = sup x>0 { µ[x, x 0 py dy }.
2 In particular, the constant C is finite if B <. Suppose that µ,... µ satisfy Poincaré inequality with constant C. Then the same can be said about the product measure µ = µ... µ n, due to tensorization property of see Corollary 5.7 in [L], which follows immediately from the subadditivity of the variance. Thus, one can say that the Poincaré inequality is fully understood in the case of product measures. A much stronger functional inequality that gives concentration is the so-called log-sobolev inequality, Ent µ f C f dµ, where for a function g 0 we set Ent µ g = g ln g dµ g dµ ln g dµ. It implies the Gaussian concentration phenomenon, i.e., concentration with a profile α µ t = exp t /6C. As an example, the standard Gaussian measure γ n, i.e., the measure with density π n/ e x /, satisfies with the constant see [G]. As in, the log-sobolev inequality possess similar terrorization properties and there is a full description of measures µ satisfying on the real line, see [BG]. Namely, the optimal constant C in satisfies 75 B C 936B, where B = sup x>0 { µ[x, ln µ[x, x 0 } py dy. Another way to concentration leads through the so-called property τ see [M] and [LW]. A measure µ on R n is said to satisfy property τ with a nonnegative cost function ϕ if the inequality e f ϕ dµ e f dµ 3 holds for every bounded measurable function f on R n. Here f ϕ = inf y {fy + ϕx y} is the so-called infimum convolution. Property τ implies concentration, see Lemma 4 in [M]. Namely, for every measurable set A we have µ {x / A + {ϕ < t}} µa e t. In the seminal paper [M] Maurey showed that the exponential measure ν satisfies the infimum convolution inequality with a the cost function ϕt = min{ 36 t, t }. As a consequence 9 of tensorization see Lemma in [M] we get that ν n satisfies 3 with the cost function ϕx = n i= ϕx i. This leads to the so-called Talagrand s two level concentration, ν n A + 6 tb n + 9tB n ν n A e t, see Corollary in [M]. As we can see, this gives a stronger conclusion than the Poincaré inequality. It is a well known fact that the property τ with a cost function which is quadratic around 0, say ϕx = C x for x, implies the Poincaré inequality with the constant /4C, see Corrolary 3 in [M]. We shall sketch the argument in Section. The goal of this article is to investigate concentration properties of a wider class of measures, i.e., measures that may not even satisfy the Poincaré inequality. For example, in the case of purely atomic measures one can easily construct a non-constant function f with f dµ = 0. However, one can still hope to get concentration if one restricts himself to the class of convex sets. It turns out that to reach exponential concentration for convex sets, it suffices to prove that the measure µ satisfies the convex Poincaré inequality. Below we state the formal definition.
3 Definition. We say that a Borel probability measure µ on R satisfies the convex Poincaré inequality with a constant C p if for every convex function f : R R with f bounded we have Var µ f C p f dµ. 4 Here we adopt the standard convention that for a locally Lipschitz function f : R R the gradient f is defined by f fx + h fx x = lim sup. 5 h 0 h This definition applies in particular to convex f. If f is differentiable, 5 agrees with the usual derivative. We also need the following definition. Definition. Let h > 0 and λ [0,. Let Mh, λ be the class of symmetric measures on R, satisfying the condition µ[x + h, λµ[x, for x 0. Moreover, let M + h, λ be the class of measures supported on R +, satisfying the same condition. The inequality 4 has been investigated by Bobkov and Götze, see [BG, Theorem 4.]. In particular, the authors proved 4 in the class Mh, λ with a constant C p depending only on h and λ. This leads to the exponential concentration for -Lipschitz convex functions f as well as the exponential concentration for convex sets via the standard Herbst-like argument which actually goes back to [AS] see also, e.g., Theorem 3.3 in [L], by deriving the bound on the Laplace transform of f. It is worth mentioning that a much stronger condition µ[x + C/x, λµ[x,, x m, where m is a fixed positive number, has been considered. It implies log-sobolev inequalities for log-convex functions and the Gaussian concentration of measure for convex sets. We refer to the nice study [A] for the details. In [M] the author showed that every measure supported on a subset of R with diameter satisfies the convex property τ, i.e. the inequality 3 for convex functions f, with the cost function 4 x see Theorem 3 therein. The aim of this note is to extend both this result and the convex Poincaré inequality of Bobkov and Götze. We introduce the following definition. Definition 3. Define ϕ 0 x = R { x x x x >. We say that a Borel probability measure µ on R satisfies convex exponential property τ with constant C τ if for any convex function f : R R with inf f > we have e f ϕ dµ e f dµ 6 with ϕx = ϕ 0 x/c τ. We are ready to state our main result. Theorem. The following conditions are equivalent a µ Mh, λ, 3
4 b There exists C p > 0 such that µ satisfies the convex Poincaré inequality with constant C p, c There exists C τ > 0 such that µ satisfies the convex exponential property τ with constant C τ. Moreover, a implies c with the constant C τ = 7h/ λ, c implies b with the constant C p = C τ and b implies a with h = 8C p and λ = /. This generalizes Maurey s theorem due to the fact that any symmetric measure supported on the interval [, ] belongs to M, 0. It is well known that the convex property τ tensorizes, namely, if µ,..., µ n have convex property τ with cost functions ϕ,... ϕ n then the product measure µ = µ... µ n has convex property τ with ϕx = n i= ϕ ix i, see [M, Lemma 5]. Therefore Theorem implies the following Corollary. Corollary. Let µ,..., µ n Mh, λ and let us take µ = µ... µ n. Define the cost function ϕx = n i= ϕ 0x i /C τ, where C τ = 7h/ λ. Then for any coordinate-wise convex function f in particular, for any convex function we have e f ϕ dµ e f dµ. 7 As a consequence, one can deduce the two-level concentration for convex sets and convex functions in R n. Corollary. Let µ,..., µ n Mh, λ. Let C τ = 7h/ λ. Take µ = µ... µ n. Then for any convex set A with µa > 0 we have µ A + tc τ B n + tc τ B n e t µa. Corollary 3. Let µ,..., µ n Mh, λ. Let C τ = 7h/ λ. Take µ = µ... µ n. Then for any convex function f : R n R with we have and fx fy a x y, fx fy b x y, x, y R n, µ {f > Med µ f + C τ t} exp 8 { } tb min, t, t 0, 8 a µ {f < Med µ f C τ t} exp 8 { } tb min, t, t 0. 9 a Let us mention that very recently Adamczak and Strzelecki established related results in the context of modified log-sobolev inequalities, see [ASt]. For simplicity we state their result in the case of symmetric measures. For λ [0,, β [0, ] and h, m > 0 the authors defined the class of measures M β AS h, λ, m satisfying the condition µ[x + h/xβ, λµ[x, for x m. Note that M 0 AS h, λ, 0 = Mh, λ. They proved that products µ = µ... µ n of such measures satisfy the inequality Ent µ e f C AS e f f f 4 β+ β β+ β dµ. 0
5 for any smooth convex function f : R R. As a consequence, for any convex set A in R n with µa / we have µ A + t B n + t +β Cτ B+β n e C AS t, t 0. Here the constants C AS, C AS depend only on the parameters β, m, h and λ. They also established inequality similar to 8, namely for a convex function f with fx fy a x y, fx fy +β b x y +β, x, y R n, one gets µ {f > Med µ f + t} exp 36 min { t +β t, b +β C β a C AS AS }, t 0. However, the authors were not able to get 9. In fact one can show that for β = 0 our Theorem is stronger than 0. In particular, the inequality 0 is equivalent to e f ϕ dµ e f dµ, see [AS], which easily follows from 7. The rest of this article is organized as follows. In the next section we prove Theorem. In Section 3 we deduce Corollaries and 3. Proof of Theorem We need the following lemma, which is essentially included in Theorem 4. of [BG]. For reader s convenience we provide a straightforward proof of this fact. Lemma. Let µ M + h, λ and let g : R [0, be non-decreasing with g0 = 0. Then g dµ λ gx gx h dµx. Proof. We first prove that λ gx dµx gx h dµx for any non-decreasing g : R [0, such that g0 = 0. Both sides of this inequality are linear in g. Therefore, it is enough to consider only functions of the form gx = [a, x for a 0, since g can be expressed as a mixture of these functions. For gx = [a, x the above inequality reduces to λµ[a, µ[a + h,, which is clearly true due to our assumption on µ. The above is equivalent to λ gx dµx gx gx h dµx. 5
6 Now, let us use with g instead of g. Then, g dµ gx gx h dµx λ = gx gx hgx + gx h dµx λ λ λ / gx gx h dµx / gx gx h dµx / gx + gx h dµx / gx dµx We arrive at Our assertion follows. / g dµ λ gx gx h dµx /. In the rest of this note, we take f : R R to be convex. Let x 0 be a point where f attains its minimal value. Note that this point may not be unique. However, one can check that what follows does not depend on the choice of x 0. Moreover, if f is increasing decreasing we adopt the notation x 0 = x 0 =. Let us define a discrete version of gradient of f, fx fx h x > x 0 + h Dfx = fx fx 0 x [x 0 h, x 0 + h]. fx fx + h x < x 0 h Lemma. Let f : R R be a convex function with f0 = 0 and let µ Mh, λ. Then e f/ e f/ 8 dµ e fx Dfx dµx. λ Proof. Step. We first assume that f is non-negative and non-decreasing. It follows that fx = 0 for x 0. Correspondingly, the function g = e f/ e f/ is non-negative, non-decreasing and g0 = 0. Moreover, let µ + be the normalized restriction of µ to R +. Note that µ + M + h, λ. From Lemma we get e f/ e f/ dµ = Observe that = g dµ + gx gx h dµ + x λ gx gx h dµx. 4 λ gx gx h = e fx e fx e fx h + e fx h = e fx e fx h + e fx fx h e fx e fx h e fx fx fx h, 6
7 where the last inequality follows from the mean value theorem. We arrive at e f/ e f/ dµ e fx Dfx dµx. λ Step. Now let f be non-decreasing but not necessarily non-negative. From convexity of f and the fact that f0 = 0 we get f x fx for x 0. This implies the inequality e f x e f x e fx e fx, x 0. From the symmetry of µ one gets e f/ e f/ e dµ f/ e f/ dµ +. Let f = f [0,. From Step one gets e f/ e f/ dµ + = e f/ e f/ dµ 8 λ 8 λ e fx D fx dµx e fx Dfx dµx. Step 3. The conclusion of Step is also true in the case of non-increasing functions with f0 = 0. This is due to the invariance of our assertion under the symmetry x x, which is an easy consequence of the symmetry of µ and the fact that for F x = f x we have DF x = Df x. Step 4. Let us now eliminate of the assumption of monotonicity of f. Suppose that f is not monotone. Then f has a not necessarily unique minimum attained at some point x 0 R. Due to the remark of Step 3 we can assume that x 0 0. Since f0 = 0, we have fx 0 < 0. Take y 0 = inf{y R : fy = 0}. Clearly y 0 x 0. We define { { fx x x0 0 x y0 f x =, f fx 0 x < x x =. 0 fx x < y 0 Note that f is non-decreasing and f is non-increasing. Moreover, f 0 = f 0 = 0. Therefore, from the previous steps applied for f and f we get + + e fx0/ e fx0/ µ, x 0 ]+ e f/ e f/ 8 dµ e fx Dfx dµx x 0 λ x 0 and y0 e f/ e f/ 8 y0 dµ e fx Dfx dµx. 3 λ Moreover, since fx fx 0 on [y 0, x 0 ], we have x0 e f/ e f/ dµ e fx 0 / e fx0/ µ[y 0, x 0 ] e fx0/ e fx0/ µ, x 0 ]. 4 y 0 Combining, 3 and 4, we arrive at e f/ e f/ dµ 8 λ e fx Dfx dµx. 7
8 The following lemma provides an estimate on the infimum convolution. Lemma 3. Let C, h > 0. Define ϕ x = C ϕ 0 x/h. Assume that a convex function f satisfies f /C h. Then f ϕ x fx C Dfx. Proof. Let us consider the case when x x 0 +h. We take θ [0, ] and write y = θx h+ θx. Note that x y = hθ. By the convexity of f we have f ϕ x fy + ϕ x y θfx h + θfx + ϕ hθ = θfx h + θfx + C θ. Let us now take θ = C fx fx h. Note that 0 f /C h yields θ [0, ]. We get f ϕ x fx θfx fx h + C θ = fx C fx fx h. The case x x 0 h follows by similar computation one has to take y = θx + h + θx. Also, in the case x [x 0 h, x 0 + h] it is enough to take y = θx 0 + θx and use the fact that x y = θx x 0 hθ. Proof of Theorem. We begin by showing that a implies c. We do this in three steps. Step. We first show that it is enough to consider only the case when f satisfies f /C τ. Since inf f >, then either there exists a point y 0 such that f y 0 /C τ, or f attains its minimum at some point y 0 for example if fx = x /C τ, only the second case is valid. Let us fix this point y 0. Moreover, let us define y = sup{y y 0 : f y /C τ } and y + = inf{y y 0 : f y /C τ } if f < /C τ then we adopt the notation y + = and, similarly, y = if f > /C τ. Let us consider a function g with g = f on [y, y + ] and with the derivative satisfying g = sgnf min{ f, /C τ } when f 0 and g = max{f, /C τ } when f < 0. Clearly g f and gx = fx for y x y +. We now observe that f ϕ = g ϕ. To see this recall that f ϕx = inf y fy + ϕx y. The function ψ x y = fy + ϕx y satisfies ψ xy = f y ϕ x y f y /C τ. Thus, for y y + we have ψ xy 0 and therefore ψ x is non-decreasing for y y +. Similarly, ψ x is non-increasing for y y. This means that inf y fy + ϕx y is attained at some point y = yx [y, y + ]. Thus, f ϕx = fyx + ϕx yx = gyx + ϕx yx = g ϕx. The last equality follows from the fact that the minimum of y gy + ϕx y is achieved at the same point y = yx. Therefore, since f ϕ = g ϕ and g f, we have e f ϕ dµ e f dµ e g ϕ dµ e g dµ and g /C τ. Step. The inequality 6 stays invariant when we add a constant to the function f. Thus, we may and will assume that f0 = 0. Note that from the elementary inequality 4ab a + b we have 4 e f ϕ dµ e e f dµ f ϕ + e f dµ. 8
9 Thus, it is enough to show that e f ϕ + e f dµ. Step 3. Assume f /C τ. Take C = 7/ λ, C τ = C h and ϕx = ϕ 0 x/c τ. By the convexity of ϕ 0 we get ϕx C ϕ 0 x/h, since C >. Thus, by Lemma 3 we get f ϕ fx C Dfx. By the mean value theorem Dfx /h /C τ. Therefore, C Dfx C h C τ = /C. Let αc = C exp C. The convexity of the exponential function yields e s αc s, s [0, /C ]. Therefore, e f ϕ + e f dµ e fx C Dfx + e fx dµx e fx C αc Dfx + e fx dµx. Therefore, since e f + e f = e f/ e f/, we are to prove that e f/ e f/ C dµ αc e fx Dfx dµx. From Lemma this inequality is true whenever C αc 8 λ. It suffices to observe that C αc = C e C C + = C C + C C + 8 = 8 λ. We now sketch the proof of the fact that c implies b. Due to the standard approximation argument one can assume that f is a convex C smooth function with bounded first and second derivative note that in the definition of the convex Poincaré inequality we assumed that f is bounded. Consider the function f ε = εf. The infimum of ψ x y = ϕy + εfx y is attained at the point y satisfying the equation ψ xy = ϕ y εf x y = 0. Note that ψ x is strictly increasing on the interval [ C τ, C τ ]. If ε is sufficiently small, it follows that the above equation has a unique solution y x and that y x [ C τ, C τ ]. Thus, y x = C τ εf x y x. This implies y x = εc τ f x + oε. We get f ϕx = ϕy x + εfx y x = y Cτ x + εfx εcτ f x + oε = ε C τ f x + εfx ε C τ f x + oε = εfx ε C τ f x + oε. Therefore, from the infimum convolution inequality we get e εfx ε Cτ f x +oε dµx e εf dµ. Testing 6 with fx = x /C τ one gets that e ϕ dµ < and therefore e x /Cτ dµ <. Also, there exists a constant c > 0 such that fx c + x, x R. As a consequence, after some 9
10 additional technical steps, one can consider the Taylor expansion of the above quantities in ε = 0. This gives + εf ε Cτ f + ε f + oε dµ εf + ε f + oε dµ. Comparing the terms in front of ε leads to f dµ f dµ C τ f dµ. This is exactly the Poincaré inequality with constant C τ. We show that b implies a. Suppose that a symmetric Borel probability measure µ on R satisfies the convex Poincaré inequality with a constant C p. Consider the function f u x = max{x u, 0}, u 0. We have f ux dµx = µ[u,. R Since f u y = 0 for y 0 and µ, 0] /, one gets Var µ f u = f u x f u y dµxdµy 0 f u x f u y dµxdµy R R R f u x dµx [ 4 R 4 f u x dµx C p µ u + 8C p,. u+ 8C p These two observations, together with Poincaré inequality, yield that µ M 8C p, /. 3 Concentration properties We show that the convex property τ implies concentration for convex sets. Proposition. Suppose that a Borel probability measure µ on R n satisfies the convex property τ with a non-negative cost function ϕ, restricted to the family of convex functions. Let B ϕ t = {x R n : ϕx t}. Then for any convex set A we have µa + B ϕ t e t µa. The proof of this proposition is similar to the proof of Proposition.4 in [LW]. We recall the argument. Proof. Let f = 0 on A and f = outside of A. Note that f is convex to avoid working with functions having values + one can consider a family of convex functions f n = n dista, x and take n. Suppose that f ϕx t. Then there exists y R n such that fy+ϕx y t. Thus, y A and x y B ϕ t. Therefore x A + B ϕ t. It follows that x / A + B ϕ t implies f ϕx > t. Applying the infimum convolution inequality we get e t µa + B ϕ t µa e f ϕ dµ e f dµ. Our assertion follows. 0
11 We are ready to derive the two-level concentration for convex sets. Proof of Corollary. The argument is similar to [M, Corollary ]. Due to Corollary, µ = µ... µ n satisfies property τ with the cost function ϕx = n i= ϕ 0x i /C τ. Suppose that ϕx t. Define y, z R n in the following way. Take y i = x i if x i C τ and y i = 0 otherwise. Take z i = x i if x i > C τ and z i = 0 otherwise. Then x = y + z. Moreover, n ϕy i /C τ + i= n ϕz i /C τ = i= n ϕx i /C τ t. In particular y C τ t and t n i= ϕz i/c τ z /C τ, since z i z i for z i. This gives x tc τ B n + tc τ B n. Our assertion follows from Proposition. Finally, we prove concentration for convex Lipschitz functions. Proof of Corollary 3. The proof of 8 is similar to the proof of Propositon 4.8 in [L]. Let us define a convex set A = {f Med µ f} and observe that µa /. Moreover, A + C τ tb n + tb n {f Med µ f + C τ a t + bt}. Applying Corollary we get { µ f > Med µ f + C τ a } t + bt e t, t 0. Take s = C τ a t + bt and r = s/c τ. Suppose that r r. Then b a a t + tb = r a r/b + r = a r 8b + b r 4b a r 8b + b r 8b. By the monotonicity of x a x + xb, x 0 it follows that min{ r, r } = r 8 b a 8b if r r, then b a a t + tb = r r + br a = a Therefore, 8 min{ r b, r a } = r 8a t. Thus, i= r r + b 8a 4a a µ {f > Med µ f + rc τ } e t exp 8 { rb min, r a r r + b 8a 8a. }, t 0. t. Moreover, For the proof of 9 we follow [T]. Define a convex set B = {f < Med µ f C τ a t + bt} with t 0. It follows that and thus Corollary yields A + C τ tb n + tb n {f < Med µ f} µ A + C τ tb n + tb n e t µb. Therefore µb e t. To finish the proof we proceed as above.
12 Acknowledgements We would like to thank Rados law Adamczak for his useful comments regarding concentration estimates for Lipschitz functions. This research was supported in part by the Institute for Mathematics and its Applications with funds provided by the National Science Foundation. References [A] R. Adamczak, Logarithmic Sobolev inequalities and concentration of measure for convex functions and polynomial chaoses. Bull. Pol. Acad. Sci. Math , no., 38. [AS] S. Aida, D. Stroock, Moment estimates derived from Poincaré and logarithmic Sobolev inequalities. Math. Res. Lett. 994, no., [ASt] R. Adamczak, M. Strzelecki, Modified logarithmic Sobolev inequalities for convex functions, preprint to be submitted on arxiv [BG] S. Bobkov, F. Götze, Discrete isoperimetric and Poincaré-type inequalities. Probab. Theory Related Fields 4 999, no., [BG] S. G. Bobkov, F. Götze, Exponential integrability and transportation cost related to logarithmic Sobolev inequalities. J. Funct. Anal , no., 8. [BL] S. Bobkov, M. Ledoux, Poincaré s inequalities and Talagrand s concentration phenomenon for the exponential distribution. Probab. Theory Related Fields , no. 3, [GRST] N. Gozlan, C. Roberto, P.M. Samson, and P. Tetali, Kantorovich duality for general transport costs and applications, preprint 04, arxiv: [G] L. Gross, Leonard Logarithmic Sobolev inequalities. Amer. J. Math , no. 4, [K] Ch. Klaassen, On an inequality of Chernoff. Ann. Probab , no. 3, [LW] R. Lata la, J. O. Wojtaszczyk, On the infimum convolution inequality, Studia Math , [L] M. Ledoux, The concentration of measure phenomenon. Mathematical Surveys and Monographs, 89. American Mathematical Society, Providence, RI, 00. [M] B. Maurey, Some deviation inequalities, Geom. Funct. Anal. 99, [Mu] B. Muckenhoupt, Hardy s inequality with weights. Studia Math , [T] M. Talagrand, An isoperimetric theorem on the cube and the Kintchine-Kahane inequalities. Proc. Amer. Math. Soc , no. 3,
ON THE CONVEX INFIMUM CONVOLUTION INEQUALITY WITH OPTIMAL COST FUNCTION
ON THE CONVEX INFIMUM CONVOLUTION INEQUALITY WITH OPTIMAL COST FUNCTION MARTA STRZELECKA, MICHA L STRZELECKI, AND TOMASZ TKOCZ Abstract. We show that every symmetric random variable with log-concave tails
More informationConcentration Properties of Restricted Measures with Applications to Non-Lipschitz Functions
Concentration Properties of Restricted Measures with Applications to Non-Lipschitz Functions S G Bobkov, P Nayar, and P Tetali April 4, 6 Mathematics Subject Classification Primary 6Gxx Keywords and phrases
More informationSpectral Gap and Concentration for Some Spherically Symmetric Probability Measures
Spectral Gap and Concentration for Some Spherically Symmetric Probability Measures S.G. Bobkov School of Mathematics, University of Minnesota, 127 Vincent Hall, 26 Church St. S.E., Minneapolis, MN 55455,
More informationConvex inequalities, isoperimetry and spectral gap III
Convex inequalities, isoperimetry and spectral gap III Jesús Bastero (Universidad de Zaragoza) CIDAMA Antequera, September 11, 2014 Part III. K-L-S spectral gap conjecture KLS estimate, through Milman's
More informationWeak and strong moments of l r -norms of log-concave vectors
Weak and strong moments of l r -norms of log-concave vectors Rafał Latała based on the joint work with Marta Strzelecka) University of Warsaw Minneapolis, April 14 2015 Log-concave measures/vectors A measure
More informationLARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS. S. G. Bobkov and F. L. Nazarov. September 25, 2011
LARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS S. G. Bobkov and F. L. Nazarov September 25, 20 Abstract We study large deviations of linear functionals on an isotropic
More informationOn the convex infimum convolution inequality with optimal cost function
ALEA, Lat. Am. J. Probab. Math. Stat. 14, 903 915 2017 On the convex infimum convolution inequality with optimal cost function Marta Strzelecka, Micha l Strzelecki and Tomasz Tkocz Institute of Mathematics,
More informationKLS-TYPE ISOPERIMETRIC BOUNDS FOR LOG-CONCAVE PROBABILITY MEASURES. December, 2014
KLS-TYPE ISOPERIMETRIC BOUNDS FOR LOG-CONCAVE PROBABILITY MEASURES Sergey G. Bobkov and Dario Cordero-Erausquin December, 04 Abstract The paper considers geometric lower bounds on the isoperimetric constant
More informationDiscrete Ricci curvature: Open problems
Discrete Ricci curvature: Open problems Yann Ollivier, May 2008 Abstract This document lists some open problems related to the notion of discrete Ricci curvature defined in [Oll09, Oll07]. Do not hesitate
More informationProbability and Measure
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability
More informationContents 1. Introduction 1 2. Main results 3 3. Proof of the main inequalities 7 4. Application to random dynamical systems 11 References 16
WEIGHTED CSISZÁR-KULLBACK-PINSKER INEQUALITIES AND APPLICATIONS TO TRANSPORTATION INEQUALITIES FRANÇOIS BOLLEY AND CÉDRIC VILLANI Abstract. We strengthen the usual Csiszár-Kullback-Pinsker inequality by
More informationOn a Class of Multidimensional Optimal Transportation Problems
Journal of Convex Analysis Volume 10 (2003), No. 2, 517 529 On a Class of Multidimensional Optimal Transportation Problems G. Carlier Université Bordeaux 1, MAB, UMR CNRS 5466, France and Université Bordeaux
More informationMATH 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 informationFrom the Brunn-Minkowski inequality to a class of Poincaré type inequalities
arxiv:math/0703584v1 [math.fa] 20 Mar 2007 From the Brunn-Minkowski inequality to a class of Poincaré type inequalities Andrea Colesanti Abstract We present an argument which leads from the Brunn-Minkowski
More informationGAUSSIAN MEASURE OF SECTIONS OF DILATES AND TRANSLATIONS OF CONVEX BODIES. 2π) n
GAUSSIAN MEASURE OF SECTIONS OF DILATES AND TRANSLATIONS OF CONVEX BODIES. A. ZVAVITCH Abstract. In this paper we give a solution for the Gaussian version of the Busemann-Petty problem with additional
More information1 Cheeger differentiation
1 Cheeger differentiation after J. Cheeger [1] and S. Keith [3] A summary written by John Mackay Abstract We construct a measurable differentiable structure on any metric measure space that is doubling
More informationFunctional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...
Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................
More informationNONHOMOGENEOUS ELLIPTIC EQUATIONS INVOLVING CRITICAL SOBOLEV EXPONENT AND WEIGHT
Electronic Journal of Differential Equations, Vol. 016 (016), No. 08, pp. 1 1. ISSN: 107-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu NONHOMOGENEOUS ELLIPTIC
More informationStepanov s Theorem in Wiener spaces
Stepanov s Theorem in Wiener spaces Luigi Ambrosio Classe di Scienze Scuola Normale Superiore Piazza Cavalieri 7 56100 Pisa, Italy e-mail: l.ambrosio@sns.it Estibalitz Durand-Cartagena Departamento de
More informationOn John type ellipsoids
On John type ellipsoids B. Klartag Tel Aviv University Abstract Given an arbitrary convex symmetric body K R n, we construct a natural and non-trivial continuous map u K which associates ellipsoids to
More information3 (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 informationConcentration inequalities: basics and some new challenges
Concentration inequalities: basics and some new challenges M. Ledoux University of Toulouse, France & Institut Universitaire de France Measure concentration geometric functional analysis, probability theory,
More informationSobolev Spaces. Chapter 10
Chapter 1 Sobolev Spaces We now define spaces H 1,p (R n ), known as Sobolev spaces. For u to belong to H 1,p (R n ), we require that u L p (R n ) and that u have weak derivatives of first order in L p
More informationEC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1
EC9A0: Pre-sessional Advanced Mathematics Course Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1 1 Infimum and Supremum Definition 1. Fix a set Y R. A number α R is an upper bound of Y if
More informationOn the Brunn-Minkowski inequality for general measures with applications to new isoperimetric-type inequalities
On the Brunn-Minkowski inequality for general measures with applications to new isoperimetric-type inequalities Galyna Livshyts, Arnaud Marsiglietti, Piotr Nayar, Artem Zvavitch June 8, 2015 Abstract In
More informationConcentration inequalities for non-lipschitz functions
Concentration inequalities for non-lipschitz functions University of Warsaw Berkeley, October 1, 2013 joint work with Radosław Adamczak (University of Warsaw) Gaussian concentration (Sudakov-Tsirelson,
More informationStability results for Logarithmic Sobolev inequality
Stability results for Logarithmic Sobolev inequality Daesung Kim (joint work with Emanuel Indrei) Department of Mathematics Purdue University September 20, 2017 Daesung Kim (Purdue) Stability for LSI Probability
More informationESTIMATES FOR THE MONGE-AMPERE EQUATION
GLOBAL W 2,p ESTIMATES FOR THE MONGE-AMPERE EQUATION O. SAVIN Abstract. We use a localization property of boundary sections for solutions to the Monge-Ampere equation obtain global W 2,p estimates under
More informationIntegration 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 informationCOMPARISON THEOREMS FOR THE SPECTRAL GAP OF DIFFUSIONS PROCESSES AND SCHRÖDINGER OPERATORS ON AN INTERVAL. Ross G. Pinsky
COMPARISON THEOREMS FOR THE SPECTRAL GAP OF DIFFUSIONS PROCESSES AND SCHRÖDINGER OPERATORS ON AN INTERVAL Ross G. Pinsky Department of Mathematics Technion-Israel Institute of Technology Haifa, 32000 Israel
More informationOn isotropicity with respect to a measure
On isotropicity with respect to a measure Liran Rotem Abstract A body is said to be isoptropic with respect to a measure µ if the function θ x, θ dµ(x) is constant on the unit sphere. In this note, we
More informationRecall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm
Chapter 13 Radon Measures Recall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm (13.1) f = sup x X f(x). We want to identify
More informationPROPERTY OF HALF{SPACES. July 25, Abstract
A CHARACTERIZATION OF GAUSSIAN MEASURES VIA THE ISOPERIMETRIC PROPERTY OF HALF{SPACES S. G. Bobkov y and C. Houdre z July 25, 1995 Abstract If the half{spaces of the form fx 2 R n : x 1 cg are extremal
More informationAnother Riesz Representation Theorem
Another Riesz Representation Theorem In these notes we prove (one version of) a theorem known as the Riesz Representation Theorem. Some people also call it the Riesz Markov Theorem. It expresses positive
More informationThe optimal partial transport problem
The optimal partial transport problem Alessio Figalli Abstract Given two densities f and g, we consider the problem of transporting a fraction m [0, min{ f L 1, g L 1}] of the mass of f onto g minimizing
More informationarxiv: v1 [math.oc] 21 Mar 2015
Convex KKM maps, monotone operators and Minty variational inequalities arxiv:1503.06363v1 [math.oc] 21 Mar 2015 Marc Lassonde Université des Antilles, 97159 Pointe à Pitre, France E-mail: marc.lassonde@univ-ag.fr
More information2 (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 informationMODIFIED LOG-SOBOLEV INEQUALITIES AND ISOPERIMETRY
MODIFIED LOG-SOBOLEV INEQUALITIES AND ISOPERIMETRY ALEXANDER V. KOLESNIKOV Abstract. We find sufficient conditions for a probability measure µ to satisfy an inequality of the type f f f F dµ C f c dµ +
More information3. Convex functions. basic properties and examples. operations that preserve convexity. the conjugate function. quasiconvex functions
3. Convex functions Convex Optimization Boyd & Vandenberghe basic properties and examples operations that preserve convexity the conjugate function quasiconvex functions log-concave and log-convex functions
More informationHOMEOMORPHISMS OF BOUNDED VARIATION
HOMEOMORPHISMS OF BOUNDED VARIATION STANISLAV HENCL, PEKKA KOSKELA AND JANI ONNINEN Abstract. We show that the inverse of a planar homeomorphism of bounded variation is also of bounded variation. In higher
More informationPACKING-DIMENSION PROFILES AND FRACTIONAL BROWNIAN MOTION
PACKING-DIMENSION PROFILES AND FRACTIONAL BROWNIAN MOTION DAVAR KHOSHNEVISAN AND YIMIN XIAO Abstract. In order to compute the packing dimension of orthogonal projections Falconer and Howroyd 997) introduced
More informationConcentration inequalities and the entropy method
Concentration inequalities and the entropy method Gábor Lugosi ICREA and Pompeu Fabra University Barcelona what is concentration? We are interested in bounding random fluctuations of functions of many
More informationConstrained Optimization and Lagrangian Duality
CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may
More informationEntropy and Ergodic Theory Lecture 15: A first look at concentration
Entropy and Ergodic Theory Lecture 15: A first look at concentration 1 Introduction to concentration Let X 1, X 2,... be i.i.d. R-valued RVs with common distribution µ, and suppose for simplicity that
More informationPhenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 2012
Phenomena in high dimensions in geometric analysis, random matrices, and computational geometry Roscoff, France, June 25-29, 202 BOUNDS AND ASYMPTOTICS FOR FISHER INFORMATION IN THE CENTRAL LIMIT THEOREM
More informationKLS-type isoperimetric bounds for log-concave probability measures
Annali di Matematica DOI 0.007/s03-05-0483- KLS-type isoperimetric bounds for log-concave probability measures Sergey G. Bobkov Dario Cordero-Erausquin Received: 8 April 04 / Accepted: 4 January 05 Fondazione
More informationMass transportation methods in functional inequalities and a new family of sharp constrained Sobolev inequalities
Mass transportation methods in functional inequalities and a new family of sharp constrained Sobolev inequalities Robin Neumayer Abstract In recent decades, developments in the theory of mass transportation
More informationExpansion and Isoperimetric Constants for Product Graphs
Expansion and Isoperimetric Constants for Product Graphs C. Houdré and T. Stoyanov May 4, 2004 Abstract Vertex and edge isoperimetric constants of graphs are studied. Using a functional-analytic approach,
More informationLogarithmic Sobolev Inequalities
Logarithmic Sobolev Inequalities M. Ledoux Institut de Mathématiques de Toulouse, France logarithmic Sobolev inequalities what they are, some history analytic, geometric, optimal transportation proofs
More informationHeat Flows, Geometric and Functional Inequalities
Heat Flows, Geometric and Functional Inequalities M. Ledoux Institut de Mathématiques de Toulouse, France heat flow and semigroup interpolations Duhamel formula (19th century) pde, probability, dynamics
More informationN. GOZLAN, C. ROBERTO, P-M. SAMSON
FROM DIMENSION FREE CONCENTRATION TO THE POINCARÉ INEQUALITY N. GOZLAN, C. ROBERTO, P-M. SAMSON Abstract. We prove that a probability measure on an abstract metric space satisfies a non trivial dimension
More informationON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE. Sangho Kum and Gue Myung Lee. 1. Introduction
J. Korean Math. Soc. 38 (2001), No. 3, pp. 683 695 ON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE Sangho Kum and Gue Myung Lee Abstract. In this paper we are concerned with theoretical properties
More informationRichard F. Bass Krzysztof Burdzy University of Washington
ON DOMAIN MONOTONICITY OF THE NEUMANN HEAT KERNEL Richard F. Bass Krzysztof Burdzy University of Washington Abstract. Some examples are given of convex domains for which domain monotonicity of the Neumann
More informationOn the Brunn-Minkowski inequality for general measures with applications to new isoperimetric type-inequalities
On the Brunn-Minkowski inequality for general measures with applications to new isoperimetric type-inequalities Galyna Livshyts, Arnaud Marsiglietti, Piotr Nayar, Artem Zvavitch April 24, 215 Abstract
More informationSOME PROPERTIES ON THE CLOSED SUBSETS IN BANACH SPACES
ARCHIVUM MATHEMATICUM (BRNO) Tomus 42 (2006), 167 174 SOME PROPERTIES ON THE CLOSED SUBSETS IN BANACH SPACES ABDELHAKIM MAADEN AND ABDELKADER STOUTI Abstract. It is shown that under natural assumptions,
More informationAPPLICATIONS OF DIFFERENTIABILITY IN R n.
APPLICATIONS OF DIFFERENTIABILITY IN R n. MATANIA BEN-ARTZI April 2015 Functions here are defined on a subset T R n and take values in R m, where m can be smaller, equal or greater than n. The (open) ball
More informationMASS TRANSPORT AND VARIANTS OF THE LOGARITHMIC SOBOLEV INEQUALITY
ASS TRANSPORT AND VARIANTS OF THE LOGARITHIC SOBOLEV INEQUALITY FRANCK BARTHE, ALEXANDER V. KOLESNIKOV Abstract. We develop the optimal transportation approach to modified log-sobolev inequalities and
More informationAN ASYMPTOTIC MEAN VALUE CHARACTERIZATION FOR p-harmonic FUNCTIONS. To the memory of our friend and colleague Fuensanta Andreu
AN ASYMPTOTIC MEAN VALUE CHARACTERIZATION FOR p-harmonic FUNCTIONS JUAN J. MANFREDI, MIKKO PARVIAINEN, AND JULIO D. ROSSI Abstract. We characterize p-harmonic functions in terms of an asymptotic mean value
More informationSYMMETRY RESULTS FOR PERTURBED PROBLEMS AND RELATED QUESTIONS. Massimo Grosi Filomena Pacella S. L. Yadava. 1. Introduction
Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 21, 2003, 211 226 SYMMETRY RESULTS FOR PERTURBED PROBLEMS AND RELATED QUESTIONS Massimo Grosi Filomena Pacella S.
More informationTHE INVERSE FUNCTION THEOREM
THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)
More information6.2 Fubini s Theorem. (µ ν)(c) = f C (x) dµ(x). (6.2) Proof. Note that (X Y, A B, µ ν) must be σ-finite as well, so that.
6.2 Fubini s Theorem Theorem 6.2.1. (Fubini s theorem - first form) Let (, A, µ) and (, B, ν) be complete σ-finite measure spaces. Let C = A B. Then for each µ ν- measurable set C C the section x C is
More informationHigh-dimensional distributions with convexity properties
High-dimensional distributions with convexity properties Bo az Klartag Tel-Aviv University A conference in honor of Charles Fefferman, Princeton, May 2009 High-Dimensional Distributions We are concerned
More informationFunctional inequalities for heavy tailed distributions and application to isoperimetry
E l e c t r o n i c J o u r n a l o f P r o b a b i l i t y Vol. 5 (200), Paper no. 3, pages 346 385. Journal URL http://www.math.washington.edu/~ejpecp/ Functional inequalities for heavy tailed distributions
More informationBOUNDS ON THE DEFICIT IN THE LOGARITHMIC SOBOLEV INEQUALITY
BOUNDS ON THE DEFICIT IN THE LOGARITHMIC SOBOLEV INEQUALITY S. G. BOBKOV, N. GOZLAN, C. ROBERTO AND P.-M. SAMSON Abstract. The deficit in the logarithmic Sobolev inequality for the Gaussian measure is
More informationFunctions of several variables of finite variation and their differentiability
ANNALES POLONICI MATHEMATICI LX.1 (1994) Functions of several variables of finite variation and their differentiability by Dariusz Idczak ( Lódź) Abstract. Some differentiability properties of functions
More informationAPPROXIMATE ISOMETRIES ON FINITE-DIMENSIONAL NORMED SPACES
APPROXIMATE ISOMETRIES ON FINITE-DIMENSIONAL NORMED SPACES S. J. DILWORTH Abstract. Every ε-isometry u between real normed spaces of the same finite dimension which maps the origin to the origin may by
More informationFKN Theorem on the biased cube
FKN Theorem on the biased cube Piotr Nayar Abstract In this note we consider Boolean functions defined on the discrete cube { γ, γ 1 } n equipped with a product probability measure µ n, where µ = βδ γ
More informationA REMARK ON MINIMAL NODAL SOLUTIONS OF AN ELLIPTIC PROBLEM IN A BALL. Olaf Torné. 1. Introduction
Topological Methods in Nonlinear Analysis Journal of the Juliusz Schauder Center Volume 24, 2004, 199 207 A REMARK ON MINIMAL NODAL SOLUTIONS OF AN ELLIPTIC PROBLEM IN A BALL Olaf Torné (Submitted by Michel
More informationCharacterization of Self-Polar Convex Functions
Characterization of Self-Polar Convex Functions Liran Rotem School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv 69978, Israel Abstract In a work by Artstein-Avidan and Milman the concept of
More informationIntegral Jensen inequality
Integral Jensen inequality Let us consider a convex set R d, and a convex function f : (, + ]. For any x,..., x n and λ,..., λ n with n λ i =, we have () f( n λ ix i ) n λ if(x i ). For a R d, let δ a
More informationRandom Bernstein-Markov factors
Random Bernstein-Markov factors Igor Pritsker and Koushik Ramachandran October 20, 208 Abstract For a polynomial P n of degree n, Bernstein s inequality states that P n n P n for all L p norms on the unit
More informationStein s method, logarithmic Sobolev and transport inequalities
Stein s method, logarithmic Sobolev and transport inequalities M. Ledoux University of Toulouse, France and Institut Universitaire de France Stein s method, logarithmic Sobolev and transport inequalities
More informationEntropy and Ergodic Theory Lecture 17: Transportation and concentration
Entropy and Ergodic Theory Lecture 17: Transportation and concentration 1 Concentration in terms of metric spaces In this course, a metric probability or m.p. space is a triple px, d, µq in which px, dq
More informationA NEW PROOF OF THE ATOMIC DECOMPOSITION OF HARDY SPACES
A NEW PROOF OF THE ATOMIC DECOMPOSITION OF HARDY SPACES S. DEKEL, G. KERKYACHARIAN, G. KYRIAZIS, AND P. PETRUSHEV Abstract. A new proof is given of the atomic decomposition of Hardy spaces H p, 0 < p 1,
More informationOn the isotropic constant of marginals
On the isotropic constant of marginals Grigoris Paouris Abstract Let p < and n. We write µ B,p,n for the probability measure in R n with density B n p, where Bp n := {x R n : x p b p,n} and Bp n =. Let
More informationON CONCENTRATION FUNCTIONS OF RANDOM VARIABLES. Sergey G. Bobkov and Gennadiy P. Chistyakov. June 2, 2013
ON CONCENTRATION FUNCTIONS OF RANDOM VARIABLES Sergey G. Bobkov and Gennadiy P. Chistyakov June, 3 Abstract The concentration functions are considered for sums of independent random variables. Two sided
More informationMath The Laplacian. 1 Green s Identities, Fundamental Solution
Math. 209 The Laplacian Green s Identities, Fundamental Solution Let be a bounded open set in R n, n 2, with smooth boundary. The fact that the boundary is smooth means that at each point x the external
More informationLocal semiconvexity of Kantorovich potentials on non-compact manifolds
Local semiconvexity of Kantorovich potentials on non-compact manifolds Alessio Figalli, Nicola Gigli Abstract We prove that any Kantorovich potential for the cost function c = d / on a Riemannian manifold
More informationAN ASYMPTOTIC MEAN VALUE CHARACTERIZATION FOR p-harmonic FUNCTIONS
AN ASYMPTOTIC MEAN VALUE CHARACTERIZATION FOR p-harmonic FUNCTIONS JUAN J. MANFREDI, MIKKO PARVIAINEN, AND JULIO D. ROSSI Abstract. We characterize p-harmonic functions in terms of an asymptotic mean value
More informationPoincaré Inequalities and Moment Maps
Tel-Aviv University Analysis Seminar at the Technion, Haifa, March 2012 Poincaré-type inequalities Poincaré-type inequalities (in this lecture): Bounds for the variance of a function in terms of the gradient.
More informationInvariances in spectral estimates. Paris-Est Marne-la-Vallée, January 2011
Invariances in spectral estimates Franck Barthe Dario Cordero-Erausquin Paris-Est Marne-la-Vallée, January 2011 Notation Notation Given a probability measure ν on some Euclidean space, the Poincaré constant
More informationON A MAXIMAL OPERATOR IN REARRANGEMENT INVARIANT BANACH FUNCTION SPACES ON METRIC SPACES
Vasile Alecsandri University of Bacău Faculty of Sciences Scientific Studies and Research Series Mathematics and Informatics Vol. 27207), No., 49-60 ON A MAXIMAL OPRATOR IN RARRANGMNT INVARIANT BANACH
More informationMAJORIZING MEASURES WITHOUT MEASURES. By Michel Talagrand URA 754 AU CNRS
The Annals of Probability 2001, Vol. 29, No. 1, 411 417 MAJORIZING MEASURES WITHOUT MEASURES By Michel Talagrand URA 754 AU CNRS We give a reformulation of majorizing measures that does not involve measures,
More informationEXISTENCE RESULTS FOR QUASILINEAR HEMIVARIATIONAL INEQUALITIES AT RESONANCE. Leszek Gasiński
DISCRETE AND CONTINUOUS Website: www.aimsciences.org DYNAMICAL SYSTEMS SUPPLEMENT 2007 pp. 409 418 EXISTENCE RESULTS FOR QUASILINEAR HEMIVARIATIONAL INEQUALITIES AT RESONANCE Leszek Gasiński Jagiellonian
More informationA COUNTEREXAMPLE TO AN ENDPOINT BILINEAR STRICHARTZ INEQUALITY TERENCE TAO. t L x (R R2 ) f L 2 x (R2 )
Electronic Journal of Differential Equations, Vol. 2006(2006), No. 5, pp. 6. ISSN: 072-669. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu (login: ftp) A COUNTEREXAMPLE
More information18.409: Topics in TCS: Embeddings of Finite Metric Spaces. Lecture 6
Massachusetts Institute of Technology Lecturer: Michel X. Goemans 8.409: Topics in TCS: Embeddings of Finite Metric Spaces September 7, 006 Scribe: Benjamin Rossman Lecture 6 Today we loo at dimension
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 informationON APPROXIMATE DIFFERENTIABILITY OF THE MAXIMAL FUNCTION
ON APPROXIMATE DIFFERENTIABILITY OF THE MAXIMAL FUNCTION PIOTR HAJ LASZ, JAN MALÝ Dedicated to Professor Bogdan Bojarski Abstract. We prove that if f L 1 R n ) is approximately differentiable a.e., then
More informationBrunn-Minkowski inequality for the 1-Riesz capacity and level set convexity for the 1/2-Laplacian
Brunn-Minkowski inequality for the 1-Riesz capacity and level set convexity for the 1/2-Laplacian M. Novaga, B. Ruffini January 13, 2014 Abstract We prove that that the 1-Riesz capacity satisfies a Brunn-Minkowski
More informationAN INEQUALITY FOR TAIL PROBABILITIES OF MARTINGALES WITH BOUNDED DIFFERENCES
Lithuanian Mathematical Journal, Vol. 4, No. 3, 00 AN INEQUALITY FOR TAIL PROBABILITIES OF MARTINGALES WITH BOUNDED DIFFERENCES V. Bentkus Vilnius Institute of Mathematics and Informatics, Akademijos 4,
More informationA fixed point theorem for weakly Zamfirescu mappings
A fixed point theorem for weakly Zamfirescu mappings David Ariza-Ruiz Dept. Análisis Matemático, Fac. Matemáticas, Universidad de Sevilla, Apdo. 1160, 41080-Sevilla, Spain Antonio Jiménez-Melado Dept.
More informationRENORMINGS OF L p (L q )
RENORMINGS OF L p (L q ) by arxiv:math/9804002v1 [math.fa] 1 Apr 1998 R. Deville, R. Gonzalo and J. A. Jaramillo (*) Laboratoire de Mathématiques, Université Bordeaux I, 351, cours de la Libération, 33400
More informationPCA sets and convexity
F U N D A M E N T A MATHEMATICAE 163 (2000) PCA sets and convexity by Robert K a u f m a n (Urbana, IL) Abstract. Three sets occurring in functional analysis are shown to be of class PCA (also called Σ
More informationSobolev spaces. May 18
Sobolev spaces May 18 2015 1 Weak derivatives The purpose of these notes is to give a very basic introduction to Sobolev spaces. More extensive treatments can e.g. be found in the classical references
More informationNECESSARY CONDITIONS FOR WEIGHTED POINTWISE HARDY INEQUALITIES
NECESSARY CONDITIONS FOR WEIGHTED POINTWISE HARDY INEQUALITIES JUHA LEHRBÄCK Abstract. We establish necessary conditions for domains Ω R n which admit the pointwise (p, β)-hardy inequality u(x) Cd Ω(x)
More informationCharacterizing Robust Solution Sets of Convex Programs under Data Uncertainty
Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty V. Jeyakumar, G. M. Lee and G. Li Communicated by Sándor Zoltán Németh Abstract This paper deals with convex optimization problems
More informationON BOUNDEDNESS OF MAXIMAL FUNCTIONS IN SOBOLEV SPACES
Annales Academiæ Scientiarum Fennicæ Mathematica Volumen 29, 2004, 167 176 ON BOUNDEDNESS OF MAXIMAL FUNCTIONS IN SOBOLEV SPACES Piotr Haj lasz and Jani Onninen Warsaw University, Institute of Mathematics
More informationPacking-Dimension Profiles and Fractional Brownian Motion
Under consideration for publication in Math. Proc. Camb. Phil. Soc. 1 Packing-Dimension Profiles and Fractional Brownian Motion By DAVAR KHOSHNEVISAN Department of Mathematics, 155 S. 1400 E., JWB 233,
More informationChapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries
Chapter 1 Measure Spaces 1.1 Algebras and σ algebras of sets 1.1.1 Notation and preliminaries We shall denote by X a nonempty set, by P(X) the set of all parts (i.e., subsets) of X, and by the empty set.
More informationChapter 2 Convex Analysis
Chapter 2 Convex Analysis The theory of nonsmooth analysis is based on convex analysis. Thus, we start this chapter by giving basic concepts and results of convexity (for further readings see also [202,
More information