A glimpse into convex geometry. A glimpse into convex geometry
|
|
- Evangeline Garrison
- 5 years ago
- Views:
Transcription
1 A glimpse into convex geometry 5 \ þ ÏŒÆ
2 Two basis reference: 1. Keith Ball, An elementary introduction to modern convex geometry 2. Chuanming Zong, What is known about unit cubes Convex geometry lies at the intersection of geometry, linear algebra, functional analysis, probability, etc.
3 Definition A subset K R n is called convex if tx + (1 t)y K, ( x, y K and 0 t 1). Convex body: compact convex subset with nonempty interior. It is called symmetric, if x K implies x K.
4 Definition A subset K R n is called convex if tx + (1 t)y K, ( x, y K and 0 t 1). Convex body: compact convex subset with nonempty interior. It is called symmetric, if x K implies x K.
5 Definition A subset K R n is called convex if tx + (1 t)y K, ( x, y K and 0 t 1). Convex body: compact convex subset with nonempty interior. It is called symmetric, if x K implies x K.
6 Basis facts about convex bodies Supporting hyperplane: each boundary point of a convex body admits a supporting hyperplane (not necessarily unique).
7 Basis facts about convex bodies Separation of disjoint convex bodies by hyperplane.
8 Hahn-Banach theorem Above two statements sound intuitively true, but an instructive proof invokes the famous Hahn-Banach theorem. Theorem If g : V R is a sublinear function, and f : U R is a linear functional on a subspace U of V, with f g, then there exists a linear extension f of f such that f = f on U; f g on V.
9 A function g : V R is sublinear if Positive homogeneity: f (λx) = λf (x), λ > 0; Subadditivity: f (x + y) f (x) + f (y). A convex body K containing origin defines a sublinear function (Minkowski functional): g(x) := inf{λ > 0 : x λk}. A symmetric convex body defines a norm on the underlying vector space, i.e., it is sublinear (triangle inequality) and λx = λ x.
10 A function g : V R is sublinear if Positive homogeneity: f (λx) = λf (x), λ > 0; Subadditivity: f (x + y) f (x) + f (y). A convex body K containing origin defines a sublinear function (Minkowski functional): g(x) := inf{λ > 0 : x λk}. A symmetric convex body defines a norm on the underlying vector space, i.e., it is sublinear (triangle inequality) and λx = λ x.
11 A function g : V R is sublinear if Positive homogeneity: f (λx) = λf (x), λ > 0; Subadditivity: f (x + y) f (x) + f (y). A convex body K containing origin defines a sublinear function (Minkowski functional): g(x) := inf{λ > 0 : x λk}. A symmetric convex body defines a norm on the underlying vector space, i.e., it is sublinear (triangle inequality) and λx = λ x.
12 Proof of existence of supporting hyperplane Pick x 0 K, then g(x 0 ) = 1 by definition. Let f : Rx 0 R be f (λx 0 ) = λg(x 0 ), λ R. It is clearly linear and dominated by g, thus there is a linear extension f, and f g. x K = g(x) 1 = f (x) 1. Thus, K { f 1}, i.e., f = 1 is a supporting hyperplane at x 0.
13 John s lemma Theorem Every n-dimensional convex body K contains a unique ellipsoid E of largest volume, and E K ne.
14 Distance between convex bodies How to say two convex bodies are alike? Cube and sphere seem to be two extremal examples: for symmetric convex bodies, a cube is made of fewest possible faces, a ball can be regarded as made of infinite many faces. We need to introduce a quantitative measurement for the distance between convex bodies. A general principle for introducing distance for convex bodies is that a convex body and its images under affine transformation are all regarded as one same object. In other words, the distance should be affine invariant.
15 Distance between convex bodies How to say two convex bodies are alike? Cube and sphere seem to be two extremal examples: for symmetric convex bodies, a cube is made of fewest possible faces, a ball can be regarded as made of infinite many faces. We need to introduce a quantitative measurement for the distance between convex bodies. A general principle for introducing distance for convex bodies is that a convex body and its images under affine transformation are all regarded as one same object. In other words, the distance should be affine invariant.
16 Distance between convex bodies How to say two convex bodies are alike? Cube and sphere seem to be two extremal examples: for symmetric convex bodies, a cube is made of fewest possible faces, a ball can be regarded as made of infinite many faces. We need to introduce a quantitative measurement for the distance between convex bodies. A general principle for introducing distance for convex bodies is that a convex body and its images under affine transformation are all regarded as one same object. In other words, the distance should be affine invariant.
17 Affine transformation: y = A x + x 0, where A is an invertible n n matrix. It is a combination of a linear transformation and a translation. It preserves linear structure and convexity. Distance: d(k, L) = inf{λ : K L λ K, } where K, L are linear images of K and L. For example: d(ball, cube) = n, and d(k, L) = 1 means K and L are identical up to affine transformation.
18 Affine transformation: y = A x + x 0, where A is an invertible n n matrix. It is a combination of a linear transformation and a translation. It preserves linear structure and convexity. Distance: d(k, L) = inf{λ : K L λ K, } where K, L are linear images of K and L. For example: d(ball, cube) = n, and d(k, L) = 1 means K and L are identical up to affine transformation.
19 Even though a cube looks less and less like a ball as dimension grows, we will see that there do exist slice of cube which is almost round. More precisely, The cube in R n has almost spherical sections whose dimension k is roughly log n. In fact, this statement is true for all convex bodies. This is the content of Dvoretzky s Theorem which we are aiming for. A slice of n-cube has at most n-pair of faces. If the slice dimension is low, this sounds more plausible. So the significance is that k log n.
20 Even though a cube looks less and less like a ball as dimension grows, we will see that there do exist slice of cube which is almost round. More precisely, The cube in R n has almost spherical sections whose dimension k is roughly log n. In fact, this statement is true for all convex bodies. This is the content of Dvoretzky s Theorem which we are aiming for. A slice of n-cube has at most n-pair of faces. If the slice dimension is low, this sounds more plausible. So the significance is that k log n.
21 Even though a cube looks less and less like a ball as dimension grows, we will see that there do exist slice of cube which is almost round. More precisely, The cube in R n has almost spherical sections whose dimension k is roughly log n. In fact, this statement is true for all convex bodies. This is the content of Dvoretzky s Theorem which we are aiming for. A slice of n-cube has at most n-pair of faces. If the slice dimension is low, this sounds more plausible. So the significance is that k log n.
22 Brunn-Minkowski inequality Original form of Brunn: Theorem (Brunn) Let K be a convex body in R n, let u be a unit vector in R n, and for each r, let H r be the hyperplane x u = r. Then the function is concave on its support. r vol(k H r ) 1 n 1
23 1-d illustration
24 A novel view by Minkowski: the slice A r := K H r viewed as convex sets in R n, then for r < s < t with s = (1 λ)r + λt, A s includes the Minkowski sum (1 λ)a r + λa t := {(1 λ)x + λy : x A r, y A t }.
25 Brunn s inequality says: vol(a s ) 1 n 1 (1 λ)vol(ar ) 1 n 1 + λvol(at ) 1 n 1. Minkowski s formulation only involves two sets, which gets rid of the cross-section of convex body. Theorem (Brunn-Minkowski) If A and B are nonempty compact subsets of R n, then vol((1 λ)a + λb) 1 n (1 λ)vol(a) 1 n + λvol(b) 1 n.
26 Brunn s inequality says: vol(a s ) 1 n 1 (1 λ)vol(ar ) 1 n 1 + λvol(at ) 1 n 1. Minkowski s formulation only involves two sets, which gets rid of the cross-section of convex body. Theorem (Brunn-Minkowski) If A and B are nonempty compact subsets of R n, then vol((1 λ)a + λb) 1 n (1 λ)vol(a) 1 n + λvol(b) 1 n.
27 Prékopa-Leindler inequality Brunn-Minkowski inequality can be derived by an inequality involving three functions: Theorem (Prékopa-Leindler) If f, g and h are nonnegative measurable functions on R n, λ (0, 1) and for all x and y, h((1 λ)x + λy) f (x) 1 λ g(y) λ, then h ( f ) 1 λ ( g) λ.
28 Take f, g, h to be the characteristic functions for A, B, and (1 λ)a + λb respectively, then Prekopa-Leindler implies the multiplicative form of Brunn-Minkowski: vol((1 λ)a + λb) vol(a) 1 λ vol(b) λ.
29 Theorem (Isoperimetric inequality) Among bodies of a given volume, Euclidean balls have lease surface area. The Minkowski sum A ɛ := A + ɛb can be regarded as ɛ neighborhood of A Surface area of a compact set A: vol( A) = lim ɛ 0 vol(a+ɛb n) vol(a) ɛ.
30 Theorem (Isoperimetric inequality) Among bodies of a given volume, Euclidean balls have lease surface area. The Minkowski sum A ɛ := A + ɛb can be regarded as ɛ neighborhood of A Surface area of a compact set A: vol( A) = lim ɛ 0 vol(a+ɛb n) vol(a) ɛ.
31 Then Brunn-Minkowski implies vol(a + ɛb n ) (vol(a) 1 n + ɛvol(bn ) 1 n ) n vol(a) + nɛvol(a) n 1 n vol(bn ) 1 n. Take a compact set A with same volume of B n, we get vol( A) nvol(b n ) = vol(s n 1 ). In other words, if B is a Euclidean ball of same volume with A, then vol(a ɛ ) vol(b ɛ ), ɛ > 0.
32 Then Brunn-Minkowski implies vol(a + ɛb n ) (vol(a) 1 n + ɛvol(bn ) 1 n ) n vol(a) + nɛvol(a) n 1 n vol(bn ) 1 n. Take a compact set A with same volume of B n, we get vol( A) nvol(b n ) = vol(s n 1 ). In other words, if B is a Euclidean ball of same volume with A, then vol(a ɛ ) vol(b ɛ ), ɛ > 0.
33 Concentration of measure on S n This formulation makes it possible to talk about isoperimetric inequality in a measured metric space (X, d, µ). P. Lévy proved isoperimetric inequality on sphere. As one might guess, if B is a spherical cap of same measure as A, then vol(a ɛ ) vol(b ɛ ), ɛ > 0.
34 On S n 1, the measure is the surface area normalized to be 1, the distance is the Euclidean distance inherited from R n. Take a subset A S n 1 with vol(a) = 1 2, then B is a half sphere and vol(a ɛ ) vol(b ɛ ) 1 e nɛ2 /2.
35 An estimate of the ɛ cap: ɛ cap S n 1 = spherical cone B n. (1 ɛ 2 ) n 2 e nɛ 2 /2.
36 A more striking fact occurs when taking a function f : S n 1 R which is 1-Lipschitz: i.e., f (θ) f (φ) θ φ. Then for the median M of f, we have vol({f M}) and vol({f M}) have measure at least half. At a point x distance within ɛ from {f M}({f M}), we have f (x) M + ɛ, (f (x) M ɛ) thus vol( f M > ɛ) 2e nɛ2 /2. Even though f could vary by 2 from definition, but f is almost constant!!!
37 A more striking fact occurs when taking a function f : S n 1 R which is 1-Lipschitz: i.e., f (θ) f (φ) θ φ. Then for the median M of f, we have vol({f M}) and vol({f M}) have measure at least half. At a point x distance within ɛ from {f M}({f M}), we have f (x) M + ɛ, (f (x) M ɛ) thus vol( f M > ɛ) 2e nɛ2 /2. Even though f could vary by 2 from definition, but f is almost constant!!!
38 Dvoretzky s Theorem Theorem There is a positive number c such that, for every ɛ > 0 and every natural number n, every symmetric convex body of dimension n has a slice of dimension k > cɛ 2 log(1 + ɛ 1 ) log n which is within distance 1 + ɛ of the k-dimensional Euclidean ball.
39 Strategy of the proof The distance is measured up to affine transformations, so assume the maximal ellipsoid of K is B 1, i.e., B 1 K nb 1. (John s Lemma) The symmetric convex body defines a norm on R n. K becomes the unit sphere under this norm. Take a k-dimensional slice, and consider the S k 1 in this slice. We will show that we can choose a slice, such that the restriction of the norm on this copy of S k 1 is almost constant. Consequently, that slice of K is close to S k 1.
40 Strategy of the proof The distance is measured up to affine transformations, so assume the maximal ellipsoid of K is B 1, i.e., B 1 K nb 1. (John s Lemma) The symmetric convex body defines a norm on R n. K becomes the unit sphere under this norm. Take a k-dimensional slice, and consider the S k 1 in this slice. We will show that we can choose a slice, such that the restriction of the norm on this copy of S k 1 is almost constant. Consequently, that slice of K is close to S k 1.
41 Strategy of the proof The distance is measured up to affine transformations, so assume the maximal ellipsoid of K is B 1, i.e., B 1 K nb 1. (John s Lemma) The symmetric convex body defines a norm on R n. K becomes the unit sphere under this norm. Take a k-dimensional slice, and consider the S k 1 in this slice. We will show that we can choose a slice, such that the restriction of the norm on this copy of S k 1 is almost constant. Consequently, that slice of K is close to S k 1.
42 : S n 1 R is 1-Lipschitz. Let be the Euclidean norm, since B 1 K, then x x. Thus x y x y x y. Due the concentration of measure discussed above, such function is close to a constant on a large portion, say N S n 1, and this constant is the median of the function, but it can be shown the average M = x dθ S n 1 has the same effect. Find a k-dimensional subspace H, such that H S n 1 lies (almost) in N.
43 : S n 1 R is 1-Lipschitz. Let be the Euclidean norm, since B 1 K, then x x. Thus x y x y x y. Due the concentration of measure discussed above, such function is close to a constant on a large portion, say N S n 1, and this constant is the median of the function, but it can be shown the average M = x dθ S n 1 has the same effect. Find a k-dimensional subspace H, such that H S n 1 lies (almost) in N.
44 : S n 1 R is 1-Lipschitz. Let be the Euclidean norm, since B 1 K, then x x. Thus x y x y x y. Due the concentration of measure discussed above, such function is close to a constant on a large portion, say N S n 1, and this constant is the median of the function, but it can be shown the average M = x dθ S n 1 has the same effect. Find a k-dimensional subspace H, such that H S n 1 lies (almost) in N.
45 Fix a slice say S k 1 := H S n 1, if we have suitably many points on this S k 1 which also lie in N, we are actually done given that points are well distributed all over S k 1, namely, the collection of points forms a δ-net. A collection of points {x 1,, x l } is called a δ-net of S k 1, if y S k 1, there exists some x k, such that y x k δ, The most economical way to arrange a δ-net is to take a maximum collection of points so that their δ/2 caps are disjoint (maximal δ-separated). Each cap has volume ( δ 2 )k 1, so there are at most ( 2 δ )k 1 many points in this δ-net.
46 Fix a slice say S k 1 := H S n 1, if we have suitably many points on this S k 1 which also lie in N, we are actually done given that points are well distributed all over S k 1, namely, the collection of points forms a δ-net. A collection of points {x 1,, x l } is called a δ-net of S k 1, if y S k 1, there exists some x k, such that y x k δ, The most economical way to arrange a δ-net is to take a maximum collection of points so that their δ/2 caps are disjoint (maximal δ-separated). Each cap has volume ( δ 2 )k 1, so there are at most ( 2 δ )k 1 many points in this δ-net.
47 Fix a slice say S k 1 := H S n 1, if we have suitably many points on this S k 1 which also lie in N, we are actually done given that points are well distributed all over S k 1, namely, the collection of points forms a δ-net. A collection of points {x 1,, x l } is called a δ-net of S k 1, if y S k 1, there exists some x k, such that y x k δ, The most economical way to arrange a δ-net is to take a maximum collection of points so that their δ/2 caps are disjoint (maximal δ-separated). Each cap has volume ( δ 2 )k 1, so there are at most ( 2 δ )k 1 many points in this δ-net.
48 Lemma If S S k 1 is a δ-net, such that M(1 γ) φ M(1 + γ), φ S, then θ S k 1, M 1 γ 2δ 1 δ θ M 1 + γ 1 δ. By choosing γ and δ small, M on whole S k 1.
49 The chance of each point lies outside of N is at most e nɛ2 /2 i.e., vol({ θ M > ɛ}) e nɛ2 /2. So if ( 2 δ )k 1 e nɛ2 /2 < 1, we can definitely find a k-dimensional slice S k 1 on which there exists a δ-net S, of at most ( 2 δ )k 1 members, such that x S, θ M ɛ. let ɛ = Mγ, we get k nm 2 M 1 γ 2δ 1 δ γ2 log(2/δ), and by the lemma, θ M 1 + γ 1 δ, θ S k 1.
50 The chance of each point lies outside of N is at most e nɛ2 /2 i.e., vol({ θ M > ɛ}) e nɛ2 /2. So if ( 2 δ )k 1 e nɛ2 /2 < 1, we can definitely find a k-dimensional slice S k 1 on which there exists a δ-net S, of at most ( 2 δ )k 1 members, such that x S, θ M ɛ. let ɛ = Mγ, we get k nm 2 M 1 γ 2δ 1 δ γ2 log(2/δ), and by the lemma, θ M 1 + γ 1 δ, θ S k 1.
51 The chance of each point lies outside of N is at most e nɛ2 /2 i.e., vol({ θ M > ɛ}) e nɛ2 /2. So if ( 2 δ )k 1 e nɛ2 /2 < 1, we can definitely find a k-dimensional slice S k 1 on which there exists a δ-net S, of at most ( 2 δ )k 1 members, such that x S, θ M ɛ. let ɛ = Mγ, we get k nm 2 M 1 γ 2δ 1 δ γ2 log(2/δ), and by the lemma, θ M 1 + γ 1 δ, θ S k 1.
52 It remains to show a lower bound of M which is roughly like log n n. This is done by computation M = x dθ. S n 1 We shift the computation to R n with the Gaussian measure, namely a probability measure µ with density (2π) n 2 e x (x x2 n ) dx 1 dx n = ( e x2 2 dx) n = ( 2π) n. R n e
53 It remains to show a lower bound of M which is roughly like log n n. This is done by computation M = x dθ. S n 1 We shift the computation to R n with the Gaussian measure, namely a probability measure µ with density (2π) n 2 e x (x x2 n ) dx 1 dx n = ( e x2 2 dx) n = ( 2π) n. R n e
54 Volume of unit ball: v n = 1 n vol(s n 1 ). v n : = Vol(B1 n ) = dx 1 dx n = 1 0 r n 1 dr B1 n π/2 0 2π sin ϕ1 n 2 dϕ 1 0 dϕ n 1 = vol(s n 1 ). n
55 Using polar coordinates: e 1 R n which implies 2 (x x2 n ) dx 1 dx n = (nv n ) v n = π n 2 Γ( n 2 + 1). 0 e r2 2 r n 1 dr, Thus, M = Sn 1 x dθ = Γ( n 2 ) 2Γ( n+1 2 ) x dµ(x). R n
56 Using polar coordinates: e 1 R n which implies 2 (x x2 n ) dx 1 dx n = (nv n ) v n = π n 2 Γ( n 2 + 1). 0 e r2 2 r n 1 dr, Thus, M = Sn 1 x dθ = Γ( n 2 ) 2Γ( n+1 2 ) x dµ(x). R n
57 Γ( n 2 ) is about 2Γ( n+1 n 1, so it remains to show 2 ) R n x dµ(x) > log n. Recall the norm is defined by the symmetric convex body K whose maximal ellipsoid is B n 1. Among all convex bodies K whose maximal ellipsoid is B n 1, the cube is the one which minimize R n x dµ(x). So just need to focus on the norm defined by cube, which is x = max 1 i n x i.
58 Γ( n 2 ) is about 2Γ( n+1 n 1, so it remains to show 2 ) R n x dµ(x) > log n. Recall the norm is defined by the symmetric convex body K whose maximal ellipsoid is B n 1. Among all convex bodies K whose maximal ellipsoid is B n 1, the cube is the one which minimize R n x dµ(x). So just need to focus on the norm defined by cube, which is x = max 1 i n x i.
59 R n x dµ(x) is the average of x, the median R is about the same order. The median R : µ( x R) = µ( x R) = 1 2. µ( x R) = 1 2 implies the cube [ R, R]n has measure 1 2, i.e., µ([ R, R] n ) = ( 1 R e x 2 2 dx) n = 1 2π R 2. So R R R log n. Finally, x 2 e 2 dx should be about 1 log 2/n, which implies R n x dµ(x) R 2 > c log n, and the proof is completed.
60 R n x dµ(x) is the average of x, the median R is about the same order. The median R : µ( x R) = µ( x R) = 1 2. µ( x R) = 1 2 implies the cube [ R, R]n has measure 1 2, i.e., µ([ R, R] n ) = ( 1 R e x 2 2 dx) n = 1 2π R 2. So R R R log n. Finally, x 2 e 2 dx should be about 1 log 2/n, which implies R n x dµ(x) R 2 > c log n, and the proof is completed.
61 R n x dµ(x) is the average of x, the median R is about the same order. The median R : µ( x R) = µ( x R) = 1 2. µ( x R) = 1 2 implies the cube [ R, R]n has measure 1 2, i.e., µ([ R, R] n ) = ( 1 R e x 2 2 dx) n = 1 2π R 2. So R R R log n. Finally, x 2 e 2 dx should be about 1 log 2/n, which implies R n x dµ(x) R 2 > c log n, and the proof is completed.
62 Specific cube section Droretzky s theorem is a deep general theory on the existence of almost spherical slice of a convex body. we conclude this talk by presenting some questions concerning specific sections of cube. Two extremal questions present themselves very naturally: Problem What is the maximal or minimal area of an i-dimensional cross-section of the unit cube?
63 Specific cube section Droretzky s theorem is a deep general theory on the existence of almost spherical slice of a convex body. we conclude this talk by presenting some questions concerning specific sections of cube. Two extremal questions present themselves very naturally: Problem What is the maximal or minimal area of an i-dimensional cross-section of the unit cube?
64 The lower bound is referred as Good s conjecture, and was proved by Hensley (1979) for i = n 1 and Vaaler (around the same time) for all i. Theorem Let I n denote a unit cube centered at origin, and H i denote an i-dimensional subspace, then v i (H i I n ) 1.
65 Concerning the upper bound, we have Theorem (Ball) v i (H i I n ) ( n i ) i 2, the upper bound is best possible if i n. Theorem (Ball) v i (H i I n ) 2 n i 2, the upper bound is optimal if i n 2.
66 α(n, i) maximal area of i-dimensional cross-section
67 Thank you!
Probabilistic Methods in Asymptotic Geometric Analysis.
Probabilistic Methods in Asymptotic Geometric Analysis. C. Hugo Jiménez PUC-RIO, Brazil September 21st, 2016. Colmea. RJ 1 Origin 2 Normed Spaces 3 Distribution of volume of high dimensional convex bodies
More informationSteiner s formula and large deviations theory
Steiner s formula and large deviations theory Venkat Anantharam EECS Department University of California, Berkeley May 19, 2015 Simons Conference on Networks and Stochastic Geometry Blanton Museum of Art
More information1 Lesson 1: Brunn Minkowski Inequality
1 Lesson 1: Brunn Minkowski Inequality A set A R n is called convex if (1 λ)x + λy A for any x, y A and any λ [0, 1]. The Minkowski sum of two sets A, B R n is defined by A + B := {a + b : a A, b B}. One
More informationAsymptotic Geometric Analysis, Fall 2006
Asymptotic Geometric Analysis, Fall 006 Gideon Schechtman January, 007 1 Introduction The course will deal with convex symmetric bodies in R n. In the first few lectures we will formulate and prove Dvoretzky
More informationAround the Brunn-Minkowski inequality
Around the Brunn-Minkowski inequality Andrea Colesanti Technische Universität Berlin - Institut für Mathematik January 28, 2015 Summary Summary The Brunn-Minkowski inequality Summary The Brunn-Minkowski
More informationLocally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem
56 Chapter 7 Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem Recall that C(X) is not a normed linear space when X is not compact. On the other hand we could use semi
More informationAlgorithmic Convex Geometry
Algorithmic Convex Geometry August 2011 2 Contents 1 Overview 5 1.1 Learning by random sampling.................. 5 2 The Brunn-Minkowski Inequality 7 2.1 The inequality.......................... 8 2.1.1
More informationEntropy Power Inequalities: Results and Speculation
Entropy Power Inequalities: Results and Speculation Venkat Anantharam EECS Department University of California, Berkeley December 12, 2013 Workshop on Coding and Information Theory Institute of Mathematical
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 informationLectures in Geometric Functional Analysis. Roman Vershynin
Lectures in Geometric Functional Analysis Roman Vershynin Contents Chapter 1. Functional analysis and convex geometry 4 1. Preliminaries on Banach spaces and linear operators 4 2. A correspondence between
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 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 informationThe Covering Index of Convex Bodies
The Covering Index of Convex Bodies Centre for Computational and Discrete Geometry Department of Mathematics & Statistics, University of Calgary uary 12, 2015 Covering by homothets and illumination Let
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationProblem Set 6: Solutions Math 201A: Fall a n x n,
Problem Set 6: Solutions Math 201A: Fall 2016 Problem 1. Is (x n ) n=0 a Schauder basis of C([0, 1])? No. If f(x) = a n x n, n=0 where the series converges uniformly on [0, 1], then f has a power series
More informationNotions 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 informationConvex Geometry. Otto-von-Guericke Universität Magdeburg. Applications of the Brascamp-Lieb and Barthe inequalities. Exercise 12.
Applications of the Brascamp-Lieb and Barthe inequalities Exercise 12.1 Show that if m Ker M i {0} then both BL-I) and B-I) hold trivially. Exercise 12.2 Let λ 0, 1) and let f, g, h : R 0 R 0 be measurable
More informationSelçuk Demir WS 2017 Functional Analysis Homework Sheet
Selçuk Demir WS 2017 Functional Analysis Homework Sheet 1. Let M be a metric space. If A M is non-empty, we say that A is bounded iff diam(a) = sup{d(x, y) : x.y A} exists. Show that A is bounded iff there
More informationConvex Geometry. Carsten Schütt
Convex Geometry Carsten Schütt November 25, 2006 2 Contents 0.1 Convex sets... 4 0.2 Separation.... 9 0.3 Extreme points..... 15 0.4 Blaschke selection principle... 18 0.5 Polytopes and polyhedra.... 23
More informationJensen s inequality for multivariate medians
Jensen s inequality for multivariate medians Milan Merkle University of Belgrade, Serbia emerkle@etf.rs Given a probability measure µ on Borel sigma-field of R d, and a function f : R d R, the main issue
More informationMurat Akman. The Brunn-Minkowski Inequality and a Minkowski Problem for Nonlinear Capacities. March 10
The Brunn-Minkowski Inequality and a Minkowski Problem for Nonlinear Capacities Murat Akman March 10 Postdoc in HA Group and Postdoc at the University of Connecticut Minkowski Addition of Sets Let E 1
More informationProblem Set 1: Solutions Math 201A: Fall Problem 1. Let (X, d) be a metric space. (a) Prove the reverse triangle inequality: for every x, y, z X
Problem Set 1: s Math 201A: Fall 2016 Problem 1. Let (X, d) be a metric space. (a) Prove the reverse triangle inequality: for every x, y, z X d(x, y) d(x, z) d(z, y). (b) Prove that if x n x and y n y
More informationAliprantis, Border: Infinite-dimensional Analysis A Hitchhiker s Guide
aliprantis.tex May 10, 2011 Aliprantis, Border: Infinite-dimensional Analysis A Hitchhiker s Guide Notes from [AB2]. 1 Odds and Ends 2 Topology 2.1 Topological spaces Example. (2.2) A semimetric = triangle
More informationChapter 1. Optimality Conditions: Unconstrained Optimization. 1.1 Differentiable Problems
Chapter 1 Optimality Conditions: Unconstrained Optimization 1.1 Differentiable Problems Consider the problem of minimizing the function f : R n R where f is twice continuously differentiable on R n : P
More informationThe weak topology of locally convex spaces and the weak-* topology of their duals
The weak topology of locally convex spaces and the weak-* topology of their duals Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto April 3, 2014 1 Introduction These notes
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationBRUNN-MINKOWSKI INEQUALITIES IN PRODUCT METRIC MEASURE SPACES
BRUNN-MINKOWSKI INEQUALITIES IN PRODUCT METRIC MEASURE SPACES MANUEL RITORÉ AND JESÚS YEPES NICOLÁS Abstract. Given one metric measure space satisfying a linear Brunn-Minkowski inequality, and a second
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 informationB. Appendix B. Topological vector spaces
B.1 B. Appendix B. Topological vector spaces B.1. Fréchet spaces. In this appendix we go through the definition of Fréchet spaces and their inductive limits, such as they are used for definitions of function
More informationExercises: Brunn, Minkowski and convex pie
Lecture 1 Exercises: Brunn, Minkowski and convex pie Consider the following problem: 1.1 Playing a convex pie Consider the following game with two players - you and me. I am cooking a pie, which should
More informationLebesgue Integration on R n
Lebesgue Integration on R n The treatment here is based loosely on that of Jones, Lebesgue Integration on Euclidean Space We give an overview from the perspective of a user of the theory Riemann integration
More informationContinuity of convex functions in normed spaces
Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional
More informationTopological properties of Z p and Q p and Euclidean models
Topological properties of Z p and Q p and Euclidean models Samuel Trautwein, Esther Röder, Giorgio Barozzi November 3, 20 Topology of Q p vs Topology of R Both R and Q p are normed fields and complete
More informationMH 7500 THEOREMS. (iii) A = A; (iv) A B = A B. Theorem 5. If {A α : α Λ} is any collection of subsets of a space X, then
MH 7500 THEOREMS Definition. A topological space is an ordered pair (X, T ), where X is a set and T is a collection of subsets of X such that (i) T and X T ; (ii) U V T whenever U, V T ; (iii) U T whenever
More informationOverview of normed linear spaces
20 Chapter 2 Overview of normed linear spaces Starting from this chapter, we begin examining linear spaces with at least one extra structure (topology or geometry). We assume linearity; this is a natural
More informationMath 5052 Measure Theory and Functional Analysis II Homework Assignment 7
Math 5052 Measure Theory and Functional Analysis II Homework Assignment 7 Prof. Wickerhauser Due Friday, February 5th, 2016 Please do Exercises 3, 6, 14, 16*, 17, 18, 21*, 23*, 24, 27*. Exercises marked
More informationUnbounded Convex Semialgebraic Sets as Spectrahedral Shadows
Unbounded Convex Semialgebraic Sets as Spectrahedral Shadows Shaowei Lin 9 Dec 2010 Abstract Recently, Helton and Nie [3] showed that a compact convex semialgebraic set S is a spectrahedral shadow if the
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationLecture 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 information7. Let X be a (general, abstract) metric space which is sequentially compact. Prove X must be complete.
Math 411 problems The following are some practice problems for Math 411. Many are meant to challenge rather that be solved right away. Some could be discussed in class, and some are similar to hard exam
More informationTheory of Probability Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 8.75 Theory of Probability Fall 008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Section Prekopa-Leindler inequality,
More informationCONCENTRATION INEQUALITIES AND GEOMETRY OF CONVEX BODIES
CONCENTRATION INEQUALITIES AND GEOMETRY OF CONVEX BODIES Olivier Guédon, Piotr Nayar, Tomasz Tkocz In memory of Piotr Mankiewicz Contents 1. Introduction... 5 2. Brascamp Lieb inequalities in a geometric
More informationB 1 = {B(x, r) x = (x 1, x 2 ) H, 0 < r < x 2 }. (a) Show that B = B 1 B 2 is a basis for a topology on X.
Math 6342/7350: Topology and Geometry Sample Preliminary Exam Questions 1. For each of the following topological spaces X i, determine whether X i and X i X i are homeomorphic. (a) X 1 = [0, 1] (b) X 2
More information1 Lesson 0: Intro and motivation (Brunn-Minkowski)
1 Lesson 0: Intro and motivation (Brunn-Minkowski) Convex sets are in correspondence with norms, which will be our first motivation to studying them. A very basic inequality is Brunn-Minkowski, which is
More informationChapter 3: Baire category and open mapping theorems
MA3421 2016 17 Chapter 3: Baire category and open mapping theorems A number of the major results rely on completeness via the Baire category theorem. 3.1 The Baire category theorem 3.1.1 Definition. A
More information1 Directional Derivatives and Differentiability
Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=
More informationAsymptotic Convex Geometry Lecture Notes
Asymptotic Convex Geometry Lecture Notes Tomasz Tkocz These lecture notes were written for the course -8 An introduction to asymptotic convex geometry that I taught at Carnegie Mellon University in Fall
More informationThis chapter reviews some basic geometric facts that we will need during the course.
Chapter 1 Some Basic Geometry This chapter reviews some basic geometric facts that we will need during the course. 1.1 Affine Geometry We will assume that you are familiar with the basic notions of linear
More informationFall, 2003 CIS 610. Advanced geometric methods. Homework 3. November 11, 2003; Due November 25, beginning of class
Fall, 2003 CIS 610 Advanced geometric methods Homework 3 November 11, 2003; Due November 25, beginning of class You may work in groups of 2 or 3 Please, write up your solutions as clearly and concisely
More informationFunctional Analysis, Math 7320 Lecture Notes from August taken by Yaofeng Su
Functional Analysis, Math 7320 Lecture Notes from August 30 2016 taken by Yaofeng Su 1 Essentials of Topology 1.1 Continuity Next we recall a stronger notion of continuity: 1.1.1 Definition. Let (X, d
More informationAn Algorithmist s Toolkit Nov. 10, Lecture 17
8.409 An Algorithmist s Toolkit Nov. 0, 009 Lecturer: Jonathan Kelner Lecture 7 Johnson-Lindenstrauss Theorem. Recap We first recap a theorem (isoperimetric inequality) and a lemma (concentration) from
More informationConvex Analysis and Economic Theory AY Elementary properties of convex functions
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory AY 2018 2019 Topic 6: Convex functions I 6.1 Elementary properties of convex functions We may occasionally
More informationThe proximal mapping
The proximal mapping http://bicmr.pku.edu.cn/~wenzw/opt-2016-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghes lecture notes Outline 2/37 1 closed function 2 Conjugate function
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More informationNOTES ON VECTOR-VALUED INTEGRATION MATH 581, SPRING 2017
NOTES ON VECTOR-VALUED INTEGRATION MATH 58, SPRING 207 Throughout, X will denote a Banach space. Definition 0.. Let ϕ(s) : X be a continuous function from a compact Jordan region R n to a Banach space
More informationOptimality Conditions for Nonsmooth Convex Optimization
Optimality Conditions for Nonsmooth Convex Optimization Sangkyun Lee Oct 22, 2014 Let us consider a convex function f : R n R, where R is the extended real field, R := R {, + }, which is proper (f never
More informationA Brunn Minkowski theory for coconvex sets of finite volume
A Brunn Minkowski theory for coconvex sets of finite volume Rolf Schneider Abstract Let C be a closed convex cone in R n, pointed and with interior points. We consider sets of the form A = C \ K, where
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 informationAnalysis III Theorems, Propositions & Lemmas... Oh My!
Analysis III Theorems, Propositions & Lemmas... Oh My! Rob Gibson October 25, 2010 Proposition 1. If x = (x 1, x 2,...), y = (y 1, y 2,...), then is a distance. ( d(x, y) = x k y k p Proposition 2. In
More informationA NICE PROOF OF FARKAS LEMMA
A NICE PROOF OF FARKAS LEMMA DANIEL VICTOR TAUSK Abstract. The goal of this short note is to present a nice proof of Farkas Lemma which states that if C is the convex cone spanned by a finite set and if
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 information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More informationNotes on Distributions
Notes on Distributions Functional Analysis 1 Locally Convex Spaces Definition 1. A vector space (over R or C) is said to be a topological vector space (TVS) if it is a Hausdorff topological space and the
More informationConvex Sets. Prof. Dan A. Simovici UMB
Convex Sets Prof. Dan A. Simovici UMB 1 / 57 Outline 1 Closures, Interiors, Borders of Sets in R n 2 Segments and Convex Sets 3 Properties of the Class of Convex Sets 4 Closure and Interior Points of Convex
More informationDefinition 6.1. A metric space (X, d) is complete if every Cauchy sequence tends to a limit in X.
Chapter 6 Completeness Lecture 18 Recall from Definition 2.22 that a Cauchy sequence in (X, d) is a sequence whose terms get closer and closer together, without any limit being specified. In the Euclidean
More information2. Dual space is essential for the concept of gradient which, in turn, leads to the variational analysis of Lagrange multipliers.
Chapter 3 Duality in Banach Space Modern optimization theory largely centers around the interplay of a normed vector space and its corresponding dual. The notion of duality is important for the following
More informationMathematics for Economists
Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples
More informationDvoretzky s Theorem and Concentration of Measure
Dvoretzky s Theorem and Concentration of Measure David Miyamoto November 0, 06 Version 5 Contents Introduction. Convex Geometry Basics................................. Motivation and the Gaussian Reformulation....................
More informationAppendix B Convex analysis
This version: 28/02/2014 Appendix B Convex analysis In this appendix we review a few basic notions of convexity and related notions that will be important for us at various times. B.1 The Hausdorff distance
More informationFunctional 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 informationLecture 5. Ch. 5, Norms for vectors and matrices. Norms for vectors and matrices Why?
KTH ROYAL INSTITUTE OF TECHNOLOGY Norms for vectors and matrices Why? Lecture 5 Ch. 5, Norms for vectors and matrices Emil Björnson/Magnus Jansson/Mats Bengtsson April 27, 2016 Problem: Measure size of
More informationChapter 4: Asymptotic Properties of the MLE
Chapter 4: Asymptotic Properties of the MLE Daniel O. Scharfstein 09/19/13 1 / 1 Maximum Likelihood Maximum likelihood is the most powerful tool for estimation. In this part of the course, we will consider
More informationAdditive Combinatorics Lecture 12
Additive Combinatorics Lecture 12 Leo Goldmakher Scribe: Gal Gross April 4th, 2014 Last lecture we proved the Bohr-to-gAP proposition, but the final step was a bit mysterious we invoked Minkowski s second
More informationAnalysis-3 lecture schemes
Analysis-3 lecture schemes (with Homeworks) 1 Csörgő István November, 2015 1 A jegyzet az ELTE Informatikai Kar 2015. évi Jegyzetpályázatának támogatásával készült Contents 1. Lesson 1 4 1.1. The Space
More informationMA3051: Mathematical Analysis II
MA3051: Mathematical Analysis II Course Notes Stephen Wills 2014/15 Contents 0 Assumed Knowledge 2 Sets and maps................................ 2 Sequences and series............................. 2 Metric
More informationPart III. 10 Topological Space Basics. Topological Spaces
Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.
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 informationChapter 1. Preliminaries. The purpose of this chapter is to provide some basic background information. Linear Space. Hilbert Space.
Chapter 1 Preliminaries The purpose of this chapter is to provide some basic background information. Linear Space Hilbert Space Basic Principles 1 2 Preliminaries Linear Space The notion of linear space
More informationNORMS ON SPACE OF MATRICES
NORMS ON SPACE OF MATRICES. Operator Norms on Space of linear maps Let A be an n n real matrix and x 0 be a vector in R n. We would like to use the Picard iteration method to solve for the following system
More informationMoment Measures. Bo az Klartag. Tel Aviv University. Talk at the asymptotic geometric analysis seminar. Tel Aviv, May 2013
Tel Aviv University Talk at the asymptotic geometric analysis seminar Tel Aviv, May 2013 Joint work with Dario Cordero-Erausquin. A bijection We present a correspondence between convex functions and Borel
More informationApproximately Gaussian marginals and the hyperplane conjecture
Approximately Gaussian marginals and the hyperplane conjecture Tel-Aviv University Conference on Asymptotic Geometric Analysis, Euler Institute, St. Petersburg, July 2010 Lecture based on a joint work
More informationIntroduction to Functional Analysis
Introduction to Functional Analysis Carnegie Mellon University, 21-640, Spring 2014 Acknowledgements These notes are based on the lecture course given by Irene Fonseca but may differ from the exact lecture
More informationThe Canonical Gaussian Measure on R
The Canonical Gaussian Measure on R 1. Introduction The main goal of this course is to study Gaussian measures. The simplest example of a Gaussian measure is the canonical Gaussian measure P on R where
More informationSemicontinuous functions and convexity
Semicontinuous functions and convexity Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto April 3, 2014 1 Lattices If (A, ) is a partially ordered set and S is a subset
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More 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 informationAppendix A: Separation theorems in IR n
Appendix A: Separation theorems in IR n These notes provide a number of separation theorems for convex sets in IR n. We start with a basic result, give a proof with the help on an auxiliary result and
More informationCHAPTER II THE HAHN-BANACH EXTENSION THEOREMS AND EXISTENCE OF LINEAR FUNCTIONALS
CHAPTER II THE HAHN-BANACH EXTENSION THEOREMS AND EXISTENCE OF LINEAR FUNCTIONALS In this chapter we deal with the problem of extending a linear functional on a subspace Y to a linear functional on the
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 informationHelly's Theorem and its Equivalences via Convex Analysis
Portland State University PDXScholar University Honors Theses University Honors College 2014 Helly's Theorem and its Equivalences via Convex Analysis Adam Robinson Portland State University Let us know
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 informationIn English, this means that if we travel on a straight line between any two points in C, then we never leave C.
Convex sets In this section, we will be introduced to some of the mathematical fundamentals of convex sets. In order to motivate some of the definitions, we will look at the closest point problem from
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 0: Vector spaces 0.1 Basic notation Here are some of the fundamental sets and spaces
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationMath 341: Convex Geometry. Xi Chen
Math 341: Convex Geometry Xi Chen 479 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca CHAPTER 1 Basics 1. Euclidean Geometry
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationConstraint qualifications for convex inequality systems with applications in constrained optimization
Constraint qualifications for convex inequality systems with applications in constrained optimization Chong Li, K. F. Ng and T. K. Pong Abstract. For an inequality system defined by an infinite family
More informationSeparation in General Normed Vector Spaces 1
John Nachbar Washington University March 12, 2016 Separation in General Normed Vector Spaces 1 1 Introduction Recall the Basic Separation Theorem for convex sets in R N. Theorem 1. Let A R N be non-empty,
More informationDimensionality in the Stability of the Brunn-Minkowski Inequality: A blessing or a curse?
Dimensionality in the Stability of the Brunn-Minkowski Inequality: A blessing or a curse? Ronen Eldan, Tel Aviv University (Joint with Bo`az Klartag) Berkeley, September 23rd 2011 The Brunn-Minkowski Inequality
More information