On the monotonicity of the expected volume of a random. Luis Rademacher Computer Science and Engineering The Ohio State University

Similar documents
arxiv: v1 [math.mg] 27 Jan 2016

Convex Geometry. Carsten Schütt

ON THE ISOTROPY CONSTANT OF PROJECTIONS OF POLYTOPES

Optimization of a Convex Program with a Polynomial Perturbation

Algorithmic Convex Geometry

Volumes of projection bodies of some classes of convex bodies

A sharp Rogers Shephard type inequality for Orlicz-difference body of planar convex bodies

Learning convex bodies is hard

Approximately Gaussian marginals and the hyperplane conjecture

C.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series

Sampling and high-dimensional convex geometry

Convexity in R N Supplemental Notes 1

On isotropicity with respect to a measure

Convex inequalities, isoperimetry and spectral gap III

Mahler Conjecture and Reverse Santalo

Dispersion of Mass and the Complexity of Geometric Problems. Luis Alexis Rademacher

Minkowski Valuations

On the distribution of the ψ 2 -norm of linear functionals on isotropic convex bodies

The centroid body: algorithms and statistical estimation for heavy-tailed distributions

1 Maximal Lattice-free Convex Sets

Estimates for the affine and dual affine quermassintegrals of convex bodies

Hyperplane sections of convex bodies

High-dimensional distributions with convexity properties

GAUSSIAN MEASURE OF SECTIONS OF DILATES AND TRANSLATIONS OF CONVEX BODIES. 2π) n

Lecture 2: Convex functions

Fall, 2003 CIS 610. Advanced geometric methods. Homework 3. November 11, 2003; Due November 25, beginning of class

On John type ellipsoids

Star bodies with completely symmetric sections

ALEXANDER KOLDOBSKY AND ALAIN PAJOR. Abstract. We prove that there exists an absolute constant C so that µ(k) C p max. ξ S n 1 µ(k ξ ) K 1/n

Gaussian Measure of Sections of convex bodies

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.

Rapid Steiner symmetrization of most of a convex body and the slicing problem

On the cells in a stationary Poisson hyperplane mosaic

Random hyperplane tessellations and dimension reduction

Isomorphic Steiner symmetrization of p-convex sets

MINKOWSKI AREAS AND VALUATIONS. Monika Ludwig. Abstract

THE STEINER FORMULA FOR EROSIONS. then one shows in integral geometry that the volume of A ρk (ρ 0) is a polynomial of degree n:

Topics in Stochastic Geometry. Lecture 4 The Boolean model

Geometric Incidences and related problems. Shakhar Smorodinsky. (Ben-Gurion University)

1 Lesson 1: Brunn Minkowski Inequality

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

Probabilistic Methods in Asymptotic Geometric Analysis.

Asymptotic shape of a random polytope in a convex body

Exercises: Brunn, Minkowski and convex pie

THE DUAL BRUNN-MINKOWSKI THEORY FOR BOUNDED BOREL SETS: DUAL AFFINE QUERMASSINTEGRALS AND INEQUALITIES

Topics in Asymptotic Convex Geometry

Recent Progress and Open Problems in Algorithmic Convex Geometry

Integral Jensen inequality

Approximately gaussian marginals and the hyperplane conjecture

Dimensional behaviour of entropy and information

Pointwise estimates for marginals of convex bodies

The minimal volume of simplices containing a convex body

LARGE DEVIATIONS OF TYPICAL LINEAR FUNCTIONALS ON A CONVEX BODY WITH UNCONDITIONAL BASIS. S. G. Bobkov and F. L. Nazarov. September 25, 2011

17.1 Hyperplanes and Linear Forms

On the existence of supergaussian directions on convex bodies

Convexity in R n. The following lemma will be needed in a while. Lemma 1 Let x E, u R n. If τ I(x, u), τ 0, define. f(x + τu) f(x). τ.

Affine surface area and convex bodies of elliptic type

Nonlinear Programming Models

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?

Topics in Theoretical Computer Science: An Algorithmist's Toolkit Fall 2007

Optimization and Optimal Control in Banach Spaces

Solving Convex Programs by Random Walks

Weak and strong moments of l r -norms of log-concave vectors

The Kannan-Lovász-Simonovits Conjecture

Geometry of log-concave Ensembles of random matrices

Invariances in spectral estimates. Paris-Est Marne-la-Vallée, January 2011

Lecture 5. Theorems of Alternatives and Self-Dual Embedding

Optimality Conditions for Nonsmooth Convex Optimization

Math 341: Convex Geometry. Xi Chen

Anti-concentration Inequalities

A NEW ELLIPSOID ASSOCIATED WITH CONVEX BODIES

POLARS AND DUAL CONES

x log x, which is strictly convex, and use Jensen s Inequality:

Notes for Functional Analysis

8. Geometric problems

On the isotropic constant of marginals

Generalized Ham-Sandwich Cuts

Supplement: Universal Self-Concordant Barrier Functions

MAT-INF4110/MAT-INF9110 Mathematical optimization

Small faces in stationary Poisson hyperplane tessellations

Measuring Ellipsoids 1

Optimizing volume with prescribed diameter or minimum width

Asteroide Santana, Santanu S. Dey. December 4, School of Industrial and Systems Engineering, Georgia Institute of Technology

Polynomiality of Linear Programming

Conve functions 2{2 Conve functions f : R n! R is conve if dom f is conve and y 2 dom f 2 [0 1] + f ( + (1 ; )y) f () + (1 ; )f (y) (1) f is concave i

Synthetic Geometry. 1.4 Quotient Geometries

Interplay of convex geometry and Banach space theory

Integer knapsacks and the Frobenius problem. Lenny Fukshansky Claremont McKenna College

Handout 2: Elements of Convex Analysis

Locally convex spaces, the hyperplane separation theorem, and the Krein-Milman theorem

A finite universal SAGBI basis for the kernel of a derivation. Osaka Journal of Mathematics. 41(4) P.759-P.792

8. Geometric problems

DECOUPLING LECTURE 6

3. Convex functions. basic properties and examples. operations that preserve convexity. the conjugate function. quasiconvex functions

Multiplicativity of Maximal p Norms in Werner Holevo Channels for 1 < p 2

An Improved Construction of Progression-Free Sets

RECAP: Extremal problems Examples

This chapter reviews some basic geometric facts that we will need during the course.

Super-Gaussian directions of random vectors

Deviation Measures and Normals of Convex Bodies

Transcription:

On the monotonicity of the expected volume of a random simplex Luis Rademacher Computer Science and Engineering The Ohio State University

Sylvester s problem 4 random points: what is the probability that they are in convex position? P : convex hull of n random points in convex n K body K. Which convex bodies K are extremal for EvolP K n volk

Questions by Meckes and Reitzner K M = EvolP K n cd EvolP M n M s weak conjecture: for n=d+1 (random simplex) there exists some c. M s strong conjecture: for n=d+1 and c=1 R s question: for arbitrary n and c=1.

Connectionwith slicing Slicing conjecture: every d-dimensional convex body of volume one has a hyperplane section of area >=c for some universal c. Equivalent: for K a d-dimensional convex body L K :=(deta(k)/(volk) 2 ) 1/2d hasauniversalupperbound. M s weak conjecture slicing M s weak conjecture: c>0suchthatforanypairk,m ofd-dimensionalconvexbodies K M = EvolP K d+1 c d EvolP M d+1

Main result About M s strong conjecture: True in dimension 1,2 False in dimension >=4 Strong numerical evidence for falsity in dim. 3. M s strong conjecture: ForanypairK,M ofd-dimensionalconvexbodies K M? = EvolP K d+1 EvolP M d+1

Busemann-Petty ( θ S d 1 )vol d 1 (K θ ) vol d 1 (L θ )? = volk cvoll Classical: when c=1, true iff dim<5 c slicing Similarity with our problem: Dimension-dependent answer, connection with slicing Difference with our problem: Ours has elementary solution, no Fourier analysis.

Questionby Vempala K M? = deta(k) c d deta(m) A(K) = covariance matrix of K Original question: for c=1.

c slicing: Questionby Vempala K M? = deta(k) c d deta(m) deta(k)/vol(k) 2 =L 2d K : easy from * and bounded isotropic constant : : 1. Let K,M be two convex bodies. Assumption with * imply L K c 1/2 d(k,m) L M : By affine invariance, w.l.o.g. K,M are in position such that K M d(k,m)k. Implies volm d(k,m) d volk. 2. Use Klartag s isomorphic slicing problem: given K,ε, there exists M s.t. d(k,m) 1+εand L M 1/ ǫ

Question by Vempala Connection with random simplexes: (µ(k)=centroid of K) ( deta(k)=d!e Xi K (volconvµ(k),x1,...,x d ) 2) = d! d+1 E( (volpd+1 K )2), I.e. second moment version of Meckes s question.

Second result We also solve Vempala s question for c=1 True in dimension 1,2 False in dimension >=3 Our solution to Vempala s question inspired our solution to Meckes s strong conjecture. Vempala s question(for c = 1): K L? = deta(k) deta(l)

Solutionto Vempala s question Intuition: extreme point near the centroid E (random simplexusing L\K) < E( using L)

Solution to Vempala s question Idea: Monotonicity of K adeta(k) holds for dimension difffor every K L there is a nonincreasing path of convex bodies from L to K. We will: define path, compute derivative along path, and study sign of derivative.

Solution to Vempala s question W.l.o.g. K is a polytope (by continuity, if there is a counterexample, then there is one where K is a polytope) Path : push hyperplanes parallel to facets of K in, one by one. L K

Solution to Vempala s question deta( ) continuous along path, piecewise continuously differentiable. Enough to compute derivative with respect intersection with moving halfspace. Enough to compute derivative in isotropic position (sign of derivative is invariant under affine transformations). K t =K {x:a T x t} d dt deta(k t)

Solution to Vempala s question Simple value of derivative in isotropic position: Proposition. Let K R d be an isotropic convex body. Let v R d be a unit vector. Let a=inf x K v x, b=sup x K v x. Let H t ={x R d :v x t}. LetK t =K H t,s t =K bdryh t. Then d dt deta(k t) = t=a ( d E X Sa X 2) vol d 1 S a volk.

Solution to Vempala s question Derivative implies dimension dependent condition: Lemma. Monotonicity under inclusion of K deta(k) holds for some dimensiondiffforanyisotropicconvex body K R d wehave dbd K. Proof: if part : condition implies negative derivative along path. d dt deta(k t) = t=a ( d E X Sa X 2) vol d 1 S a volk.

Proof (cont d) Only if part: There is an isotropic convex body L with a boundary point x at distance <d 1/2 from the origin. By an approximation argument can assume x is extreme point (keeping isotropy and distance condition) of new body L. Positive derivative as one pushes hyperplane in at x a little bit. If K is L truncated near x, deta(k) > deta(l).

When does the condition hold? Condition: for any isotropic convex body K dbd K. Milman-Pajor, Kannan-Lovász-Simonovits: For any isotropic convex body K: d+2 d B d K d(d+2)b d and this is best possible. I.e., condition fails iffd 3.

Solution to Meckes s strong conjecture Argument parallels case of det A(K): same path between K and L (push hyperplanes in), same derivative (i.e. with respect to moving hyperplane) Our derivative is a special case Crofton s differential equation: (from Kendall and Moran, Geometrical Probability, 1963)

Derivative Proposition (general derivative, Crofton). Let K R d be a convex body. Let v R d be a unit vector. Let a = inf x K v x, b = sup x K v x. Let H t = {x R d : v x t}. Let K t = K H t, S t = K bdryh t. Let f :(R d ) k Rbe asymmetriccontinuous function. Let X 1,...,X k berandom pointsink. Then d dt Ef(X ( 1,...,X k ) =k Ef(X 1,...,X k ) E ( ) ) vol d 1 S a f(x 1,...,X k ) X 1 S a t=a volk

Solution to Meckes s strong conjecture Dimension dependent condition (same proof): Lemma. Monotonicity under inclusion of K E Xi KvolconvX 0,...,X d holdsforsomedimensiondiffforanyconvexbodyk R d andanyx bdryk and X 0,...,X d randomink wehave EvolconvX 0,X 1,...,X d Evolconvx,X 1,...,X d.

When does the condition hold? Failsford 4: K=halfball,x=0,L=ballofsamevolumeasK. Ontheotherhand, EvolPd+1 EvolP K d+1 L (Blaschke-Groemer) = 1 ( ) d+1 κd+1 κ d(d+2) 1 (known) d! κ (d+1) 2ω d+1 κ d E K volconv(0,x 1,...,X d )=E Bd volconv(0,x 1,...,X d ) (symmety) = 1 ( ) d κd+1 2 (known) d! ω d+1 Combine to get κ d E K volconv(0,x 1,...,X d ) EvolP K d+1 2 d+2 d+1

When does the condition hold? true for d=1, easy (directly, without the condition)

When does the condition hold? Trueford=2: Theorem(Blaschke). Among all 2-dimensional convex bodies, E Xi K(volconv(X 0,X 1,X 2 )) vol(k) 1 12 withequalityiffk isatriangle. Lemma. LetK R 2 beaconvex body andletx bdryk. Then E X1,X 2 K(volconvx,X 1,X 2 ) volk 8 9π2. (1) Proof idea: Worst case, K is half ellipse, x its center. Then Steiner symmetrization, Blaschke s Schüttelung (shaking), symmetrization around x, Busemann s inequality.

When does the condition hold? d=3? The proof doesn t handle it, but numerical integration strongly suggests false (same counterexample).

Open questions Higher moments? (Reitzner) What about more than d+1 points? (technical) 3-D case Weak conjecture via Crofton s differential equation?