Convex Geometry. Otto-von-Guericke Universität Magdeburg. Applications of the Brascamp-Lieb and Barthe inequalities. Exercise 12.

Size: px
Start display at page:

Download "Convex Geometry. Otto-von-Guericke Universität Magdeburg. Applications of the Brascamp-Lieb and Barthe inequalities. Exercise 12."

Transcription

1 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 functions satisfying that hx λ y 1 λ ) fx) λ gy) 1 λ, for all x, y R 0. Show that 0 hx) dx 0 ) λ 1 λ fx) dx gx) dx). 0 Hint: Consider the function F x) = fe x )e x, and analogously for g and h. Exercise 12.3 Let c i > 0 and v i S n 1, 1 i m, such that m c i v i v i ) = I n, and let α i > 0, 1 i m and 1 p <. For K K0 n with x K = m v i, x p ) 1/p we know that Show that the inequality is best possible. ) n Γ vol K) 2 n p ) Γ 1 + n p m α i ci α i ) ci /p. Exercise 12.4 Let A, A i R n n, 1 i m be positive definite symmetric matrices and let λ i > 0, 1 i m, with m λ i = 1. i) Show that ) π e x,ax n 1/2 dx =. R n det A Hint: Recall that for a positive definite symmetric matrix A R n n, the ellipsoid given by EA, 0) = { x R n : x, Ax 1 } has volume vol EA, 0) ) = vol B n )/det A) 1/2. ii) Using the above identity and BL-I), show that π n/2 det m λ ia i ) ) m π n/2 λi. det Ai Discussion: List 12

2 John s ellipsoids Exercise 11.1 Let P B n be a polytope with m facets. Show that its inradius satisfies rp ) c log m)/n, for a suitable constant c. Exercise 11.2 Let u 1,..., u m S n 1, and let P = { x R n : u i, x 1, 1 i m }. Let r 1 be such that µ n 1 rs n 1 P ) 1/2. Show that vol P ) r n /2)vol B n ). Exercise 11.3 For u i and P as in the previous exercise, show that for a suitable constant c. vol P ) ) n n/2 c vol B n ), log m Exercise 11.4 Let v S n 1, t [0, 1] and let U = { u S n 1 : v, u t }. Show that µ n 1 U) 1 4e nt2 /4 and, in particular, for t 4/ n it holds µ n 1 U) 0.9. Hint: Assume, without loss of generality, that v = e n and use the Measure concentration theorem for the sphere. Discussion: List 11

3 John s ellipsoids Exercise 10.1 How is the volume of the ball distributed?) Let B n denote the n-dimensional ball of volume 1. i) Using Stirling s formula, show that a section of B n through the center maximal section) has n 1)-dimensional volume about e. ii) Show that any parallel section to the previous one, at distance x from the center, has n 1)- dimensional volume about fx) = e exp πex 2 ). Exercise symmetric polytopes as sections of the cube) Let v 1,..., v m R n \{0} and let P = { x R n : 1 v i, x 1, 1 i m } be a 0-symmetric polytope. Prove that P can be obtained as the intersection of an m-dimensional cube m > n) with an n-dimensional plane. Exercise 10.3 Let V R n. Prove that conv V v V 1 2 v + 1 ) 2 v B n. Exercise 10.4 Use the previous exercise in order to prove that if v i P = conv {v 1,..., v m }, then vol P ) m 2 n vol B n). B n, i = 1,..., m and Discussion: List 10

4 John s ellipsoids Exercise 9.1 Let K, L K n 0. i) Prove that the Banach-Mazur distance is defined as d BM K, L) := inf { λ > 0 : T GLn, R) with K T L λk }. ii) Show that d BM K, L) = d BM K, L ). Exercise 9.2 Let K, L K n and let ) 1/n vol K) αk, L) = max { vol t + T L) : t + T L K, T GLn, R), t R n}. Determine an upper bound for the ratio αk, L)/d BM K, L). Exercise 9.3 Let S R n be an n-dimensional simplex. Show that RS)/rS) n with equality if and only if S is regular. Exercise 9.4 Show Jung s theorem: Let K K n. Then n RK) DK) 2n + 1), and equality holds if and only if K contains a regular n-simplex of diameter DK). Use the following lemma: Let x i R n, 1 i m, with x i x j D, 1 i, j m. Then there exists x R n with x i x D n/2n + 1)), 1 i m, and equality holds if and only if {x 1,..., x m } contains the vertices of a regular simplex of diameter D. Discussion: List 9

5 John s ellipsoids Exercise 8.1 Let K R n be a closed convex set and let F be a face of K with 0 relint F. The support normal) cone of the face F is defined as the support normal) cone of K at any point of the relative interior of F. Let C = {λu : u K, λ 0} be the support cone of F. Show that C is the normal cone of K at F, i.e., C = cl { v R n : v, x = 0 for all x F, and v, x < 0 for all x K\F }. Exercise 8.2 Let K, L K n, and for x bd K we write SK, x) and NK, x) to denote the support cone and the normal cone of K at x, respectively. Show that: i) If C 1, C 2 R n are two closed convex cones with apex the origin), then C 1 C 2 ) = C 1 +C 2. ii) For x K and y L it holds NK + L, x + y) = NK, x) NL, y) and SK + L, x + y) = SK, x) + SL, y). Exercise 8.3 Let K K n. Show that if B n is the minimum volume ellipsoid containing K, then 1/n)B n K. Exercise 8.4 Let K K n and let B n be the maximum volume ellipsoid contained in K. Let λ i > 0 and u i S n 1 bd K, 1 1 m, the values and points defined by John s theorem. Show that: i) For any x, y K it holds ii) DK) 2nn + 1). m λ i 1 ui, x ) 1 u i, y ) = n + x, y. Discussion: List 8

6 John s ellipsoids Exercise 7.1 Let K, L, M K n. Prove the following properties for the Banach-Mazur distance: i) d BM K, L) = d BM L, K). ii) d BM K, L) 1 and d BM K, x + T K) = 1 for all x R n and T GLn, R). iii) d BM verifies the multiplicative triangular inequality, i.e., d BM K, M) d BM K, L) d BM L, M). Exercise 7.2 If B n is the minimum volume ellipsoid containing K, then 0 int K. Exercise 7.3 For a convex body K K n let { } Ft + AK) n νk) = inf : A GLn, R), t Rn. vol t + AK) n 1 Find upper and lower bounds depending only on the dimension) for νk). Exercise 7.4 Determine a minimal set of vertices V of the 3-dimensional cube C 3 such that the minimum volume ellipsoid containing conv V coincides with the minimum volume ellipsoid of C 3. Discussion: List 7

7 John s ellipsoids Exercise 6.1 Show that C pds = {x A R nn+1)/2 : A is positive definite} is a convex cone with apex the origin and with interior points, i.e., it has dimension nn + 1)/2. Exercise 6.2 Show that Cpds 1 = {x A C pds : det A 1} is a closed and strictly convex set which is smooth, i.e., for each boundary point of Cpds 1 there exists a uniquely determined supporting hyperplane. Exercise 6.3 Let S n be the regular simplex of inradius 1 and let B n S n. i) Determine its volume, surface area, circumradius and diameter. ii) Let u 1,..., u n+1 S n 1 bd S n. Show that n+1 u i = 0 and for any x R n it holds x = n/n + 1) n+1 x, u i u i. iii) Show that B n is the maximum volume ellipsoid contained in S n. Exercise 6.4 Let K K n. If x + α B n is the circumball of K then K x + α B n and the center x conv { x + αs n 1 ) bd K }. Discussion: List 6

8 Brunn-Minkowski type inequalities Exercise 5.1 Let C = [0, 1] n. Show that vol k C L) 1 for any k-dimensional plane L R n. Exercise 5.2 Show that the Steiner symmetral of a simplex with respect to a hyperplane orthogonal to any of its edges is also a simplex. Exercise 5.3 Let A i R n n be positive definite symmetric) matrices and let λ i > 0, 1 i m, such that m λ i = 1. Then m ) 1/n det λ i A i m m λ i det A i ) 1/n det A i ) λi/n. Equality holds in the first inequality if and only if A i = µ i A 1 for all i = 2,..., m. Equality holds in the second inequality if and only if det A 1 = = det A m. Exercise 5.4 For K K n with interior points, let F K, x), x K, be a non-negative real-valued function, continuous in K and x, such that F µk + a, µx + a) = µ m F K, x) for some m > 0 and for all µ > 0 and a R n. We also define GK) = K F K, x) dx. Suppose that log F λk + 1 λ)l, λx + 1 λ)y ) λ log F K, x) + 1 λ) log F L, y) whenever x K and y L, for K, L K n, and for 0 λ 1. Prove the following statements: i) GµK) = µ m+n GK) for all µ > 0. ii) G λk + 1 λ)l ) GK) λ GL) 1 λ. Discussion: List 5

9 Brunn-Minkowski type inequalities Exercise 4.1 Show that 1 0 n1 t) n 1 t n dt = n!)2 2n)! Exercise 4.2 Let K K n 0 and let a Rn. Show that vol n 1 K Ha, b) ) is maximal for b = 0. Exercise 4.3 Let a i, b i 0. Then n 1/n n ) 1/n n ) 1/n a i + b i )) a i + b i, and equality holds if and only if a i = λ b i, 1 i n. Exercise 4.4 Hölder-inequality) If f, g : R n R 0 are integrable functions with non-vanishing integrals) and p, q > 1 such that 1/p + 1/q = 1, then ) 1/p ) 1/q fx) gx) dx fx) p dx gx) q dx. R n R n R n Hint: Apply the AGM-inequality to the numbers a 1 = fy) p R fx) p dx n and a 2 = gy) q R n gx) q dx. Discussion: List 4

10 Symmetrisations Exercise 3.1 Prove that the regular simplex has maximal volume among all simplices of circumradius 1. Exercise 3.2 Prove the following statements: i) Any zonotope is centrally symmetric with respect to some point. ii) Any planar centrally symmetric polygon is a zonotope. iii) Let n 3 and let P P n be a full-dimensional polytope. Then P is a zonotope if and only if all its 2-faces are centrally symmetric. Exercise 3.3 Schwarz rotation symmetral) Let K K n with dim K = n, n 2. a K Kt) B n 1a) B n 1t) B n 1b) a Let rt) = t t b b l Without loss of generality we may consider the line given by l = { x 1, 0,..., 0) : x 1 R }, and we may also assume that K lies between the parallel hyperplanes {x R n : x 1 = a} and {x R n : x 1 = b}, for a < b. For each t [a, b], let Kt) = K {x R n : x 1 = t}, and we write B n 1 t) to denote the n 1)-dimensional ball with n 1)-dimensional volume vol n 1 Bn 1 t) ) ) = vol n 1 Kt) and centered in the point t, 0,..., 0). The Schwarz rotation symmetral of K is defined as K s = B n 1 t). t [a,b] vol n 1 Kt) ) /vol n 1 B n 1 )) 1/n 1) denote the radius of Bn 1 t). Show that rt) is a concave function in [a, b]. Exercise 3.4 Show that the Schwarz symmetral K s of a convex body K is also a convex body with vol K s ) = vol K). Discussion: List 3

11 Symmetrisations Exercise 2.1 Let H be a hyperplane and P be a polytope. Then st H P ) is a polytope. Exercise 2.2 A convex body is called unconditional if it is symmetric with respect to the coordinates hyperplanes. i) Show that each convex body can be transformed into an unconditional convex body via Steiner s symmetrisation. ii) Using Steiner s symmetrisation, establish the isodiametric inequality, i.e., 2 n vol K) vol B n )DK) n. Exercise 2.3 Let K = 1 2 K K) denote the central symmetrisation of K Kn. Then i) V 1 K) = V 1 K), ii) V i K) V i K) for i = 2,..., n, iii) DK) = DK), iv) rk) rk) and RK) RK). Exercise 2.4 For given K K n and u S n 1, the width of K in the direction u is defined as ωk, u) = hk, u)+hk, u). Then ωk) = min { ωk, u) : u S n 1} is called the minimal width of the convex body K. Show that i) ωk) = ωk); however ii) if H is a hyperplane, then the minimal width of st H K) can both increase or decrease. Discussion: List 2

12 Symmetrisations Exercise 1.1 Let K, K K n and let H be a hyperplane. Then: i) st H K K ) st H K) st H K ). ii) conv [ st H K) st H K ) ] st H [ conv K K ) ]. Show with examples that the reverse inclusions do not hold in general. Exercise 1.2 Let K i, K K n, i N, with dim K i = dim K = n, and let 0 int K. Then lim i K i = K if and only if, for any ε > 0, it holds 1 ε)k K i 1 + ε)k for any sufficiently large i. Exercise 1.3 Let H be a hyperplane. i) st H : {K K n : dim K = n} {K K n : dim K = n} is a continuous map. ii) Show with an example that the condition dim K = n can not be omitted; i.e., find a sequence K i K n, i N, of convex bodies converging to K K n with int K =, such that lim i st H K i ) st H K) strictly. Discussion: List 1

ON THE ISOTROPY CONSTANT OF PROJECTIONS OF POLYTOPES

ON THE ISOTROPY CONSTANT OF PROJECTIONS OF POLYTOPES ON THE ISOTROPY CONSTANT OF PROJECTIONS OF POLYTOPES DAVID ALONSO-GUTIÉRREZ, JESÚS BASTERO, JULIO BERNUÉS, AND PAWE L WOLFF Abstract. The isotropy constant of any d-dimensional polytope with n vertices

More information

Exercises: Brunn, Minkowski and convex pie

Exercises: 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 information

Mathematics for Economists

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

ON SUCCESSIVE RADII AND p-sums OF CONVEX BODIES

ON SUCCESSIVE RADII AND p-sums OF CONVEX BODIES ON SUCCESSIVE RADII AND p-sums OF CONVEX BODIES BERNARDO GONZÁLEZ AND MARÍA A. HERNÁNDEZ CIFRE Abstract. We study the behavior of the so called successive inner and outer radii with respect to the p-sums

More information

Probabilistic Methods in Asymptotic Geometric Analysis.

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 information

A glimpse into convex geometry. A glimpse into convex geometry

A glimpse into convex geometry. A glimpse into convex geometry A glimpse into convex geometry 5 \ þ ÏŒÆ 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

More information

Around the Brunn-Minkowski inequality

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

On John type ellipsoids

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

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

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

More information

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

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

More information

Preliminary Version Draft 2015

Preliminary Version Draft 2015 Convex Geometry Introduction Martin Henk TU Berlin Winter semester 2014/15 webpage CONTENTS i Contents Preface ii WS 2014/15 0 Some basic and convex facts 1 1 Support and separate 7 2 Radon, Helly, Caratheodory

More information

Basic convexity. 1.1 Convex sets and combinations. λ + μ b (λ + μ)a;

Basic convexity. 1.1 Convex sets and combinations. λ + μ b (λ + μ)a; 1 Basic convexity 1.1 Convex sets and combinations AsetA R n is convex if together with any two points x, y it contains the segment [x, y], thus if (1 λ)x + λy A for x, y A, 0 λ 1. Examples of convex sets

More information

Math 341: Convex Geometry. Xi Chen

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

POLARS AND DUAL CONES

POLARS AND DUAL CONES POLARS AND DUAL CONES VERA ROSHCHINA Abstract. The goal of this note is to remind the basic definitions of convex sets and their polars. For more details see the classic references [1, 2] and [3] for polytopes.

More information

DAR S CONJECTURE AND THE LOG-BRUNN-MINKOSKI INEQUALITY

DAR S CONJECTURE AND THE LOG-BRUNN-MINKOSKI INEQUALITY DAR S CONJECTURE AND THE LOG-BRUNN-MINKOSKI INEQUALITY DONGMENG XI AND GANGSONG LENG Abstract. In 999, Dar conjectured if there is a stronger version of the celebrated Brunn-Minkowski inequality. However,

More information

Asymptotic Convex Geometry Lecture Notes

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

Course 212: Academic Year Section 1: Metric Spaces

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

1 Lesson 1: Brunn Minkowski Inequality

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

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

Shape optimization problems for variational functionals under geometric constraints

Shape optimization problems for variational functionals under geometric constraints Shape optimization problems for variational functionals under geometric constraints Ilaria Fragalà 2 nd Italian-Japanese Workshop Cortona, June 20-24, 2011 The variational functionals The first Dirichlet

More information

Star bodies with completely symmetric sections

Star bodies with completely symmetric sections Star bodies with completely symmetric sections Sergii Myroshnychenko, Dmitry Ryabogin, and Christos Saroglou Abstract We say that a star body is completely symmetric if it has centroid at the origin and

More information

HW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given.

HW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given. HW1 solutions Exercise 1 (Some sets of probability distributions.) Let x be a real-valued random variable with Prob(x = a i ) = p i, i = 1,..., n, where a 1 < a 2 < < a n. Of course p R n lies in the standard

More information

Chapter 2 Convex Analysis

Chapter 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

1 Definition and Basic Properties of Compa Operator

1 Definition and Basic Properties of Compa Operator 1 Definition and Basic Properties of Compa Operator 1.1 Let X be a infinite dimensional Banach space. Show that if A C(X ), A does not have bounded inverse. Proof. Denote the unit ball of X by B and the

More information

MAT-INF4110/MAT-INF9110 Mathematical optimization

MAT-INF4110/MAT-INF9110 Mathematical optimization MAT-INF4110/MAT-INF9110 Mathematical optimization Geir Dahl August 20, 2013 Convexity Part IV Chapter 4 Representation of convex sets different representations of convex sets, boundary polyhedra and polytopes:

More information

Inequality Constraints

Inequality Constraints Chapter 2 Inequality Constraints 2.1 Optimality Conditions Early in multivariate calculus we learn the significance of differentiability in finding minimizers. In this section we begin our study of the

More information

In particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with

In particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with Appendix: Matrix Estimates and the Perron-Frobenius Theorem. This Appendix will first present some well known estimates. For any m n matrix A = [a ij ] over the real or complex numbers, it will be convenient

More information

SPECTRAL THEOREM FOR COMPACT SELF-ADJOINT OPERATORS

SPECTRAL THEOREM FOR COMPACT SELF-ADJOINT OPERATORS SPECTRAL THEOREM FOR COMPACT SELF-ADJOINT OPERATORS G. RAMESH Contents Introduction 1 1. Bounded Operators 1 1.3. Examples 3 2. Compact Operators 5 2.1. Properties 6 3. The Spectral Theorem 9 3.3. Self-adjoint

More information

Geometry of log-concave Ensembles of random matrices

Geometry of log-concave Ensembles of random matrices Geometry of log-concave Ensembles of random matrices Nicole Tomczak-Jaegermann Joint work with Radosław Adamczak, Rafał Latała, Alexander Litvak, Alain Pajor Cortona, June 2011 Nicole Tomczak-Jaegermann

More information

Continuity of convex functions in normed spaces

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

Simplices. Rolf Schneider

Simplices. Rolf Schneider Simplices Rolf Schneider These two lectures are about extremal properties of simplices in the affine geometry of convex bodies. I begin with the well-known fact that the space of affine equivalence classes

More information

MAT 257, Handout 13: December 5-7, 2011.

MAT 257, Handout 13: December 5-7, 2011. MAT 257, Handout 13: December 5-7, 2011. The Change of Variables Theorem. In these notes, I try to make more explicit some parts of Spivak s proof of the Change of Variable Theorem, and to supply most

More information

LECTURE 5: SURFACES IN PROJECTIVE SPACE. 1. Projective space

LECTURE 5: SURFACES IN PROJECTIVE SPACE. 1. Projective space LECTURE 5: SURFACES IN PROJECTIVE SPACE. Projective space Definition: The n-dimensional projective space P n is the set of lines through the origin in the vector space R n+. P n may be thought of as the

More information

Isomorphic Steiner symmetrization of p-convex sets

Isomorphic Steiner symmetrization of p-convex sets Isomorphic Steiner symmetrization of p-convex sets Alexander Segal Tel-Aviv University St. Petersburg, June 2013 Alexander Segal Isomorphic Steiner symmetrization 1 / 20 Notation K will denote the volume

More information

Selçuk Demir WS 2017 Functional Analysis Homework Sheet

Selç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 information

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

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

More information

Affine surface area and convex bodies of elliptic type

Affine surface area and convex bodies of elliptic type Affine surface area and convex bodies of elliptic type Rolf Schneider Abstract If a convex body K in R n is contained in a convex body L of elliptic type (a curvature image), then it is known that the

More information

Analysis-3 lecture schemes

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

MINKOWSKI AREAS AND VALUATIONS. Monika Ludwig. Abstract

MINKOWSKI AREAS AND VALUATIONS. Monika Ludwig. Abstract MINKOWSKI AREAS AND VALUATIONS Monika Ludwig Abstract All continuous GL(n) covariant valuations that map convex bodies to convex bodies are completely classified. This establishes a characterization of

More information

Lectures in Geometric Functional Analysis. Roman Vershynin

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

Minkowski Valuations

Minkowski Valuations Minkowski Valuations Monika Ludwig Abstract Centroid and difference bodies define SL(n) equivariant operators on convex bodies and these operators are valuations with respect to Minkowski addition. We

More information

Optimization and Optimal Control in Banach Spaces

Optimization and Optimal Control in Banach Spaces Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex non-smooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,

More information

Week 3: Faces of convex sets

Week 3: Faces of convex sets Week 3: Faces of convex sets Conic Optimisation MATH515 Semester 018 Vera Roshchina School of Mathematics and Statistics, UNSW August 9, 018 Contents 1. Faces of convex sets 1. Minkowski theorem 3 3. Minimal

More information

ANALYTIC METHODS IN CONVEX GEOMETRY

ANALYTIC METHODS IN CONVEX GEOMETRY ANALYTIC METHODS IN CONVEX GEOMETRY September 21, 2013 DMITRY RYABOGIN AND ARTEM ZVAVITCH Dedicated to the memory of Joram Lindenstrauss, 1936-2012 and Aleksander Pelczynski 1932-2012 Contents 1. The General

More information

Convex Geometry. Carsten Schütt

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

MATHEMATICAL ECONOMICS: OPTIMIZATION. Contents

MATHEMATICAL ECONOMICS: OPTIMIZATION. Contents MATHEMATICAL ECONOMICS: OPTIMIZATION JOÃO LOPES DIAS Contents 1. Introduction 2 1.1. Preliminaries 2 1.2. Optimal points and values 2 1.3. The optimization problems 3 1.4. Existence of optimal points 4

More information

Ball and Spindle Convexity with respect to a Convex Body

Ball and Spindle Convexity with respect to a Convex Body Ball and Spindle Convexity with respect to a Convex Body Zsolt Lángi Dept. of Geometry, Budapest University of Technology and Economics, Egry József u. 1, Budapest, Hungary, 1111 Márton Naszódi 1 Dept.

More information

Volumes of projection bodies of some classes of convex bodies

Volumes of projection bodies of some classes of convex bodies Volumes of projection bodies of some classes of convex bodies Christos Saroglou University of Crete Department of Mathematics Abstract Schneider posed the problem of determining the maximal value of the

More information

Introduction to Real Analysis Alternative Chapter 1

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

Notes on Fixed Point Theorems

Notes on Fixed Point Theorems Notes on Fixed Point Theorems 4 Basic Definitions In this section of the notes we will consider some of the basic fixed point theorems of analysis, the Brouwer and Kakutani theorems and their extensions

More information

High-dimensional distributions with convexity properties

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

On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q)

On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q) On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q) Andreas Löhne May 2, 2005 (last update: November 22, 2005) Abstract We investigate two types of semicontinuity for set-valued

More information

REAL RENORMINGS ON COMPLEX BANACH SPACES

REAL RENORMINGS ON COMPLEX BANACH SPACES REAL RENORMINGS ON COMPLEX BANACH SPACES F. J. GARCÍA PACHECO AND A. MIRALLES Abstract. In this paper we provide two ways of obtaining real Banach spaces that cannot come from complex spaces. In concrete

More information

Real Analysis Problems

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

More information

Asymptotic Geometric Analysis, Fall 2006

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

Hamiltonian Mechanics

Hamiltonian Mechanics Chapter 3 Hamiltonian Mechanics 3.1 Convex functions As background to discuss Hamiltonian mechanics we discuss convexity and convex functions. We will also give some applications to thermodynamics. We

More information

Chapter 7. Extremal Problems. 7.1 Extrema and Local Extrema

Chapter 7. Extremal Problems. 7.1 Extrema and Local Extrema Chapter 7 Extremal Problems No matter in theoretical context or in applications many problems can be formulated as problems of finding the maximum or minimum of a function. Whenever this is the case, advanced

More information

SPECTRAL THEOREM FOR SYMMETRIC OPERATORS WITH COMPACT RESOLVENT

SPECTRAL THEOREM FOR SYMMETRIC OPERATORS WITH COMPACT RESOLVENT SPECTRAL THEOREM FOR SYMMETRIC OPERATORS WITH COMPACT RESOLVENT Abstract. These are the letcure notes prepared for the workshop on Functional Analysis and Operator Algebras to be held at NIT-Karnataka,

More information

Lecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016

Lecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016 Lecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016 1 Entropy Since this course is about entropy maximization,

More information

Topology Exercise Sheet 2 Prof. Dr. Alessandro Sisto Due to March 7

Topology Exercise Sheet 2 Prof. Dr. Alessandro Sisto Due to March 7 Topology Exercise Sheet 2 Prof. Dr. Alessandro Sisto Due to March 7 Question 1: The goal of this exercise is to give some equivalent characterizations for the interior of a set. Let X be a topological

More information

IE 521 Convex Optimization Homework #1 Solution

IE 521 Convex Optimization Homework #1 Solution IE 521 Convex Optimization Homework #1 Solution your NAME here your NetID here February 13, 2019 Instructions. Homework is due Wednesday, February 6, at 1:00pm; no late homework accepted. Please use the

More information

Mathematics 530. Practice Problems. n + 1 }

Mathematics 530. Practice Problems. n + 1 } Department of Mathematical Sciences University of Delaware Prof. T. Angell October 19, 2015 Mathematics 530 Practice Problems 1. Recall that an indifference relation on a partially ordered set is defined

More information

Handout 2: Elements of Convex Analysis

Handout 2: Elements of Convex Analysis ENGG 5501: Foundations of Optimization 2018 19 First Term Handout 2: Elements of Convex Analysis Instructor: Anthony Man Cho So September 10, 2018 As briefly mentioned in Handout 1, the notion of convexity

More information

PROBLEMS. (b) (Polarization Identity) Show that in any inner product space

PROBLEMS. (b) (Polarization Identity) Show that in any inner product space 1 Professor Carl Cowen Math 54600 Fall 09 PROBLEMS 1. (Geometry in Inner Product Spaces) (a) (Parallelogram Law) Show that in any inner product space x + y 2 + x y 2 = 2( x 2 + y 2 ). (b) (Polarization

More information

Optimality Conditions for Nonsmooth Convex Optimization

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

Extreme points of compact convex sets

Extreme points of compact convex sets Extreme points of compact convex sets In this chapter, we are going to show that compact convex sets are determined by a proper subset, the set of its extreme points. Let us start with the main definition.

More information

L p Spaces and Convexity

L p Spaces and Convexity L p Spaces and Convexity These notes largely follow the treatments in Royden, Real Analysis, and Rudin, Real & Complex Analysis. 1. Convex functions Let I R be an interval. For I open, we say a function

More information

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

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.

More information

Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty

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

Discrete Geometry. Problem 1. Austin Mohr. April 26, 2012

Discrete Geometry. Problem 1. Austin Mohr. April 26, 2012 Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T

More information

Exercises from other sources REAL NUMBERS 2,...,

Exercises from other sources REAL NUMBERS 2,..., Exercises from other sources REAL NUMBERS 1. Find the supremum and infimum of the following sets: a) {1, b) c) 12, 13, 14, }, { 1 3, 4 9, 13 27, 40 } 81,, { 2, 2 + 2, 2 + 2 + } 2,..., d) {n N : n 2 < 10},

More information

Midterm 1. Every element of the set of functions is continuous

Midterm 1. Every element of the set of functions is continuous Econ 200 Mathematics for Economists Midterm Question.- Consider the set of functions F C(0, ) dened by { } F = f C(0, ) f(x) = ax b, a A R and b B R That is, F is a subset of the set of continuous functions

More information

Functional Analysis Exercise Class

Functional Analysis Exercise Class Functional Analysis Exercise Class Week 2 November 6 November Deadline to hand in the homeworks: your exercise class on week 9 November 13 November Exercises (1) Let X be the following space of piecewise

More information

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

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

More information

Implicit Functions, Curves and Surfaces

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

More information

ESTIMATES FOR THE MONGE-AMPERE EQUATION

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

On the constant in the reverse Brunn-Minkowski inequality for p-convex balls.

On the constant in the reverse Brunn-Minkowski inequality for p-convex balls. On the constant in the reverse Brunn-Minkowski inequality for p-convex balls. A.E. Litvak Abstract This note is devoted to the study of the dependence on p of the constant in the reverse Brunn-Minkowski

More information

arxiv: v1 [math.dg] 3 Mar 2014

arxiv: v1 [math.dg] 3 Mar 2014 arxiv:1403.0322v1 [math.dg] 3 Mar 2014 ORIGIN-SYMMETRIC BODIES OF REVOLUTION WITH MINIMAL MAHLER VOLUME IN R 3 -A NEW PROOF YOUJIANG LIN AND GANGSONG LENG Abstract. In [22], Meyer and Reisner proved the

More information

FUNCTIONAL ANALYSIS HAHN-BANACH THEOREM. F (m 2 ) + α m 2 + x 0

FUNCTIONAL ANALYSIS HAHN-BANACH THEOREM. F (m 2 ) + α m 2 + x 0 FUNCTIONAL ANALYSIS HAHN-BANACH THEOREM If M is a linear subspace of a normal linear space X and if F is a bounded linear functional on M then F can be extended to M + [x 0 ] without changing its norm.

More information

Algorithmic Convex Geometry

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

APPLICATIONS OF DIFFERENTIABILITY IN R n.

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

Topological properties

Topological properties CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological

More information

1 Maximal Lattice-free Convex Sets

1 Maximal Lattice-free Convex Sets 47-831: Advanced Integer Programming Lecturer: Amitabh Basu Lecture 3 Date: 03/23/2010 In this lecture, we explore the connections between lattices of R n and convex sets in R n. The structures will prove

More information

Functional Analysis Exercise Class

Functional Analysis Exercise Class Functional Analysis Exercise Class Wee November 30 Dec 4: Deadline to hand in the homewor: your exercise class on wee December 7 11 Exercises with solutions Recall that every normed space X can be isometrically

More information

Course 224: Geometry - Continuity and Differentiability

Course 224: Geometry - Continuity and Differentiability Course 224: Geometry - Continuity and Differentiability Lecture Notes by Prof. David Simms L A TEXed by Chris Blair 1 Continuity Consider M, N finite dimensional real or complex vector spaces. What does

More information

One-dimensional integrals are taken over intervals, while n-dimensional integrals are taken over more complicated sets in R n.

One-dimensional integrals are taken over intervals, while n-dimensional integrals are taken over more complicated sets in R n. Tel Aviv University, 2013/14 Analysis-III,IV 71 6 Riemann integral 6a What is the problem................ 71 6b Dimension one: reminder.............. 73 6c Higher dimensions.................. 75 6d asic

More information

1 )(y 0) {1}. Thus, the total count of points in (F 1 (y)) is equal to deg y0

1 )(y 0) {1}. Thus, the total count of points in (F 1 (y)) is equal to deg y0 1. Classification of 1-manifolds Theorem 1.1. Let M be a connected 1 manifold. Then M is diffeomorphic either to [0, 1], [0, 1), (0, 1), or S 1. We know that none of these four manifolds are not diffeomorphic

More information

A Redundant Klee-Minty Construction with All the Redundant Constraints Touching the Feasible Region

A Redundant Klee-Minty Construction with All the Redundant Constraints Touching the Feasible Region A Redundant Klee-Minty Construction with All the Redundant Constraints Touching the Feasible Region Eissa Nematollahi Tamás Terlaky January 5, 2008 Abstract By introducing some redundant Klee-Minty constructions,

More information

A NEW ELLIPSOID ASSOCIATED WITH CONVEX BODIES

A NEW ELLIPSOID ASSOCIATED WITH CONVEX BODIES A NEW ELLIPSOID ASSOCIATED WITH CONVEX BODIES Erwin Lutwak, Deane Yang, and Gaoyong Zhang Department of Mathematics Polytechnic University Brooklyn, NY 11201 Abstract. It is shown that corresponding to

More information

On Approximating the Covering Radius and Finding Dense Lattice Subspaces

On Approximating the Covering Radius and Finding Dense Lattice Subspaces On Approximating the Covering Radius and Finding Dense Lattice Subspaces Daniel Dadush Centrum Wiskunde & Informatica (CWI) ICERM April 2018 Outline 1. Integer Programming and the Kannan-Lovász (KL) Conjecture.

More information

INFORMATION-BASED COMPLEXITY CONVEX PROGRAMMING

INFORMATION-BASED COMPLEXITY CONVEX PROGRAMMING 1 TECHNION - THE ISRAEL INSTITUTE OF TECHNOLOGY FACULTY OF INDUSTRIAL ENGINEERING & MANAGEMENT INFORMATION-BASED COMPLEXITY OF CONVEX PROGRAMMING A. Nemirovski Fall Semester 1994/95 2 Information-Based

More information

General Convexity, General Concavity, Fixed Points, Geometry, and Min-Max Points

General Convexity, General Concavity, Fixed Points, Geometry, and Min-Max Points Mathematica Moravica Vol. 12-1 2008), 63 109 General Convexity, General Concavity, Fixed Points, Geometry, and Min-Max Points Milan R. Tasković Abstract. This paper continues the study of general convexity

More information

Unbounded Convex Semialgebraic Sets as Spectrahedral Shadows

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

Math 5052 Measure Theory and Functional Analysis II Homework Assignment 7

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

Minkowski Valuations on Convex Functions

Minkowski Valuations on Convex Functions Minkowski Valuations on Convex Functions Andrea Colesanti, Monika Ludwig and Fabian Mussnig Abstract A classification of SL(n) contravariant Minkowski valuations on convex functions and a characterization

More information

k-dimensional INTERSECTIONS OF CONVEX SETS AND CONVEX KERNELS

k-dimensional INTERSECTIONS OF CONVEX SETS AND CONVEX KERNELS Discrete Mathematics 36 (1981) 233-237 North-Holland Publishing Company k-dimensional INTERSECTIONS OF CONVEX SETS AND CONVEX KERNELS Marilyn BREEN Department of Mahematics, Chiversify of Oklahoma, Norman,

More information

Assignment-10. (Due 11/21) Solution: Any continuous function on a compact set is uniformly continuous.

Assignment-10. (Due 11/21) Solution: Any continuous function on a compact set is uniformly continuous. Assignment-1 (Due 11/21) 1. Consider the sequence of functions f n (x) = x n on [, 1]. (a) Show that each function f n is uniformly continuous on [, 1]. Solution: Any continuous function on a compact set

More information

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

(convex combination!). Use convexity of f and multiply by the common denominator to get. Interchanging the role of x and y, we obtain that f is ( 2M ε 1. 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 information

Polynomiality of Linear Programming

Polynomiality of Linear Programming Chapter 10 Polynomiality of Linear Programming In the previous section, we presented the Simplex Method. This method turns out to be very efficient for solving linear programmes in practice. While it is

More information

Packing convex bodies by cylinders

Packing convex bodies by cylinders Packing convex bodies by cylinders K. Bezdek A. E. Litvak Abstract In [BL] in relation to the unsolved Bang s plank problem (1951) we obtained a lower bound for the sum of relevant measures of cylinders

More information