Measuring Ellipsoids 1
|
|
- Loraine Joseph
- 5 years ago
- Views:
Transcription
1 Measuring Ellipsoids 1
2 Igor Rivin Temple University 2
3 What is an ellipsoid? E = {x E n Ax = 1}, where A is a non-singular linear transformation of E n. Remark that Ax = Ax, Ax = x, A t Ax. The matrix Q = A t A is a positive definite matrix, with eigenvalues λ 1,..., λ n, whose (positive) square roots σ 1,..., σ n are the so-called singular values of A. Their geometric significance is that the semi-axes of E are the quantities a i = 1/σ i. After an orthogonal change of coordinates, we can write E = {x E n n x 2 i λ i = i=1 n i=1 x 2 i σ2 i = n i=1 x 2 i a 2 i = 1}. 3
4 Volume of an Ellipsoid vol E = κ n det A = κ n n a i, i=1 where κ n is the volume of the unit ball in E n. 4
5 k-th Mean Curvature m k ( K, x) ( ) n 1 m k k (x) = s k (k 1 (x),..., k n 1 (x)). k-th integral mean curvature M k M k = K m k (x)da, 5
6 Steiner s Formula for Area of Parallel Surface (at distance ρ) vol n 1 K ρ = n 1 k=0 ( ) n 1 M k k ( K)ρ k, The volume of a neighborhood of thickness ρ vol Kρ = vol K + ρ 0 vol n 1 K τ dτ. 6
7 Another formula for M k Let G n,r be the Grassmanian of affine r-planes in E n, with a suitably normalized invariant measure µ. Then µ ( {L r G n,r L r K } ) = ω n 2... ω n r 1 M (n r)ω r 1... ω r 1 ( K), (1) 0 where ω k is the surface area of the unit sphere in E k+1. 7
8 Theorem 1 (Archimedes axiom). M( K) is monotonic under inclusion. That is, if K 1 K 2, then M i ( K 1 ) M i ( K 2 ). The inequality is strict if K 2 \K 1 has non-empty interior, and i < n 1, where n is the dimension of the ambient Euclidean space. 8
9 Integral Mean Curvature for Polytopes Let P be a convex polytope in E n. ( ) n 1 M i i ( P) = α ( f )vol n i 1 f, codim. i faces f of P (2) where α ( f ) is the exterior angle at f, described as follows: Consider the Gauss map, which maps each point p of P to the set of outer normals to the support planes to P passing through p. The image of all of P will be the unit sphere S n 1 E n, and the combinatorial structure of P will induce a dual cell decomposition C of S n 1, in particular, the image of a codimension-i face f of P will be an i-dimensional totally geodesic face f of C. The i-dimensional area of that face is the exterior angle at f. 9
10 Polyhedra which tile space Suppose that translates of P tile E n, so that P is a fundamental domain for a free action of a group G of translations on E. In particular, G acts on P, preserving the combinatorial structure. Let the quotient by P G. Then ( ) n 1 M i i = ω i vol n 1 i f. codim. i faces f of P G In particular, if P is a rectangular parallelopiped: P = [0, l 1 ] [0, l 2 ] [0, l n ], then we obtain M i (P) = ω i s n 1 i (l 1,..., l n ). 10
11 Inscribed and Circumscribed Cubes The cube C i with vertices ( ) ±1, ±1,, ±1 n n n inscribed in the unit sphere, while the cube C o with vertices (±1, ±1,, ±1) is circumscribed around the unit sphere. is If E is an ellipsoid with semi-axes a 1,..., a n, the preimages of P i of C i and P o of C o are, respectively, inscribed and circumscribed (rectangular) parallelopipeds. From the Archimedean theorem, it follows that the mean curvatures of E are contained between those of P i and P o. 11
12 Which means that: M i (P o ) ( n ) n 1 i = M i ( P n ) M (E) M i (P o ), or ( ) n 1 i 2 ωi s n 1 i (l 1,..., l n ) ( n n 1 ) M i (E) i and M i (E) 2 n 1 iω is n 1 i (l 1,..., l n ) ). ( n 1 i In three dimensions, the upper bound of is sharp, as shown by examining ellipsoids with l 1 = 1, l 2 = 1, l 3 1. The lower bound is not sharp; the sharp bound is given by Polya and Szegö in a 1948 paper. 12
13 Area of the Equidistant Surface Theorem 2. Let f (ρ) = 1 n n (ρ + 2l ρ i ) ρ n 2 n l i. i=1 Then the area of the equidistant surface E ρ is bounded as follows: i=1 c n f (ρ) vol n 1 E ρ C n f (ρ), where C n /c n ( n ) n 1 Γ ((n + 1)/2) 2π (n+1)/2. (estimate for volume follows immediately). 13
14 Lattice Points Consider an ellipsoid E, and consider the number N(e) of points of the integer lattice in E. How do we estimate (E) = N(E) vol E? By a fairly obvious argument argument, (E) is dominated by the volume of a tubular neighborhood of radius (n) around E. We have: (E) C n n 0 f (ρ)dρ. (3) 14
15 John ellipsoid It is a well-known theorem of Fritz John that for any convex body K, there exists an ellipsoid E K, such that E K /n K E K for centrally-symmetric K, E K /n can be improved to E K / n. We can estimate the symmetric functions of the semi-axes (and hence the semi-axes themselves) of the John ellipsoid in terms of the mean curvature integrals of K, and vice versa. 15
16 Can we do better? 16
17 Cauchy s formula Let K be a convex body in E n. Let u S n 1 be a unit vector, and let us define V u (K) to be the (unsigned) n 1-dimensional volume of the orthogonal projection of K in the direction U. Cauchy s formula then states that V n 1 ( K) = n 1 ω n 2 V u(k) dσ S n 1 = (n 1) ω n 1 ω V u(k) dσ, n 2 S n 1 where dσ denotes the standard area element on the unit sphere. 17
18 Projected areas of an Ellipsoid In the case where K = E is an ellipsoid, given by n E = {x E n i=1 q 2 i x2 i = 1} there are several ways of computing V u. The result is: ( ni=1 u 2 ) V u (E) = κ n 1 i q2 i ni=1 q i. (4) 18
19 Since V n (E) = κ n ni=1 q i, we can rewrite Cauchy s formula (4) for E in the form: R(E) def = V n 1( E) V n (E) = n S n 1 n i=1 u 2 i q2 i dσ, (5) where R(E) is the isoperimetric ratio of E. 19
20 Amazing, but true! Theorem 3. The ratio R(E) is a norm on the vectors q of inverse lengths of semiaxes (q = (q 1,..., q n ).) Proof. The integrand in the formula (5) is a norm. Corollary 4. There exist constants c n,p, C n,p, such that c n,p q p R(q) C n,p q p, where q p is the L p norm of q. 20
21 How can we compute integrals ove S n? Theorem 5. Let f (x 1,..., x n ) be a homogeneous function on E n of degree d (in other words, f (λx 1,..., λx n ) = λ d f (x 1,..., x n ).) Then ( ) ( ) n + d n Γ 2 f dσ = Γ E ( f (X S n 1 2 1,..., X n ) ), where X 1,..., X n are independent random variables with probability density e x2. 21
22 Application to Ellipsoids R(E) = n S n 1 = n Γ ( n 2 ) Γ ( n+1 2 n u 2 i q2 i dσ )E i=1 ( ) q 2 1 X q 2 n X n where X i is a Gaussian with variance 1/2., 22
23 A class of Hypergeometric Functions First, we need a definition: Definition 6. Let a, b 1,..., b n, c, x 1,..., x n be complex numbers, with x i < 1, i = 1,..., n, Ra > 0, R(c a) > 0. We then define the Lauricella Hypergeometric Function F D (a; b 1,..., b n ; c; x 1,..., x n ) as follows: F D (a; b 1,..., b n ; c; x 1,..., x n ) = Γ(c) Γ(a)Γ(c a) 1 0 u a 1 (1 u) c a 1 n (1 ux i ) b i du. (6) i=1 We also have the series expansion: F D (a; b 1,..., b n ; c; x 1,..., x n ) = (a) ni=1 m1 + +m n (b i ) mi m 1 =0 m n =0 valid whenever x i < 1, i. (c) m1 + +m n n i=1 x m i i m i!, (7) 23
24 Now, we can write ( ) R(E) = n Γ2 n 2 Γ ( ) α 2 n+1 2 n q 2 ( j 2 F D 1/2; η 1j,..., η nj ; n + 1 ) 2 ; 1 αq2 1,..., 1 αq2 n j=1 where η ij = 1/2 + δ ij, and α is a positive parameter satisfying 1 αq 2 j < 1., (8) 24
25 Low Dimensions In two dimensions, the circumference of an ellipse with semiaxes a b is: ( ) C(a, b) = 4aE π/2, 1 b 2 /a 2. In three dimensions, the surface area of an ellipsoid with semiaxes a b c is given by ( A(a, b, c) = 2π c 2 bc 2 ) + a a 2 c 2F(φ, m) + b 2 c 2 E(φ, m), where m = a2 (b 2 c 2 ) b 2 (a 2 c 2 ), and φ = arcsin 1 c2. a 2 25
26 Law of Large Numbers Theorem 7. Let q 1,..., q n,... be a sequence of positive numbers such that ni=1 q 4 i lim n ( ni=1 q 2 ) = 0. 2 i Let E n be the ellipsoid in E n with semiaxes a 1 = 1/q 1,..., a n = 1/q n. Then lim n Γ ( ) n+1 2 Γ ( ) n 2 R(E n ) n 12 ni=1 q 2 i = 1. 26
27 Corollary 8. Let a 1,..., a n,... be such that 0 < c 1 a i /a j c 2 <, for any i, j. Let E n be the ellipsoid with major semi-axes a 1,..., a n. Then lim n Γ ( n+1 2 Γ ( ) n 2 ) n R(E n ) 1 2 ni=1 1 a 2 i = 1. 27
28 Finite Dimensions We know that R(E) is a norm on the vector q = (q 1,..., q n ) let us agree to write q R def = R(E) n = S n 1 n q 2 i x2 i dσ. i=1 where q is the vector of inverses of the major semi-axes of E. We know that for any p > 0, c n,p q p q R C n,p q p, for some dimensional constants c n,p, C n,p. we will give good estimates on the constants c n,2 and C n,2. How good? 28
29 3Γ ( n 2 ) 2Γ ( n+1 2 ) q R q ( ) Γ n2 ( ). (9) πγ n
30 First Basic Inequality Lemma 9. Let F(x) be a probability distribution, and let M a (F) def = E F ( x a ) denote the absolute moments of F (we will abuse notation in the sequel by referring to the absolute moments of a random variable as well as those of its distribution function). Further, let 0 β α. Then M β (F) 1 + M α (F). 30
31 Second Basic Inequality n n S n 1 i=1 q 2 i u2 i dσ i=1 q 2 i S n 1 u 1 dσ. (holds by concavity of square root). 31
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 informationGeometric problems. Chapter Projection on a set. The distance of a point x 0 R n to a closed set C R n, in the norm, is defined as
Chapter 8 Geometric problems 8.1 Projection on a set The distance of a point x 0 R n to a closed set C R n, in the norm, is defined as dist(x 0,C) = inf{ x 0 x x C}. The infimum here is always achieved.
More informationLinear Ordinary Differential Equations
MTH.B402; Sect. 1 20180703) 2 Linear Ordinary Differential Equations Preliminaries: Matrix Norms. Denote by M n R) the set of n n matrix with real components, which can be identified the vector space R
More informationOn the spectrum of the Hodge Laplacian and the John ellipsoid
Banff, July 203 On the spectrum of the Hodge Laplacian and the John ellipsoid Alessandro Savo, Sapienza Università di Roma We give upper and lower bounds for the first eigenvalue of the Hodge Laplacian
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 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 informationBrunn Minkowski Theory in Minkowski space-times. François Fillastre Université de Cergy Pontoise France
Brunn Minkowski Theory in Minkowski space-times François Fillastre Université de Cergy Pontoise France Convex bodies A convex body is a (non empty) compact convex set of R d+1 Convex bodies A convex body
More informationOptimal Transportation. Nonlinear Partial Differential Equations
Optimal Transportation and Nonlinear Partial Differential Equations Neil S. Trudinger Centre of Mathematics and its Applications Australian National University 26th Brazilian Mathematical Colloquium 2007
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 informationA. Iosevich and I. Laba January 9, Introduction
K-DISTANCE SETS, FALCONER CONJECTURE, AND DISCRETE ANALOGS A. Iosevich and I. Laba January 9, 004 Abstract. In this paper we prove a series of results on the size of distance sets corresponding to sets
More informationA class of non-convex polytopes that admit no orthonormal basis of exponentials
A class of non-convex polytopes that admit no orthonormal basis of exponentials Mihail N. Kolountzakis and Michael Papadimitrakis 1 Abstract A conjecture of Fuglede states that a bounded measurable set
More information1.1. MEASURES AND INTEGRALS
CHAPTER 1: MEASURE THEORY In this chapter we define the notion of measure µ on a space, construct integrals on this space, and establish their basic properties under limits. The measure µ(e) will be defined
More informationa. Define a function called an inner product on pairs of points x = (x 1, x 2,..., x n ) and y = (y 1, y 2,..., y n ) in R n by
Real Analysis Homework 1 Solutions 1. Show that R n with the usual euclidean distance is a metric space. Items a-c will guide you through the proof. a. Define a function called an inner product on pairs
More informationLecture 2: Linear Algebra Review
EE 227A: Convex Optimization and Applications January 19 Lecture 2: Linear Algebra Review Lecturer: Mert Pilanci Reading assignment: Appendix C of BV. Sections 2-6 of the web textbook 1 2.1 Vectors 2.1.1
More informationNonlinear Programming Models
Nonlinear Programming Models Fabio Schoen 2008 http://gol.dsi.unifi.it/users/schoen Nonlinear Programming Models p. Introduction Nonlinear Programming Models p. NLP problems minf(x) x S R n Standard form:
More informationChapter 8. Infinite Series
8.4 Series of Nonnegative Terms Chapter 8. Infinite Series 8.4 Series of Nonnegative Terms Note. Given a series we have two questions:. Does the series converge? 2. If it converges, what is its sum? Corollary
More information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 Minimum volume ellipsoid around a set Löwner-John ellipsoid
More informationTHE STEINER FORMULA FOR EROSIONS. then one shows in integral geometry that the volume of A ρk (ρ 0) is a polynomial of degree n:
THE STEINER FORMULA FOR EROSIONS. G. MATHERON Abstract. If A and K are compact convex sets in R n, a Steiner-type formula is valid for the erosion of A by K if and only if A is open with respect to K.
More informationLMI MODELLING 4. CONVEX LMI MODELLING. Didier HENRION. LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ. Universidad de Valladolid, SP March 2009
LMI MODELLING 4. CONVEX LMI MODELLING Didier HENRION LAAS-CNRS Toulouse, FR Czech Tech Univ Prague, CZ Universidad de Valladolid, SP March 2009 Minors A minor of a matrix F is the determinant of a submatrix
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 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 informationSHARP BOUNDARY TRACE INEQUALITIES. 1. Introduction
SHARP BOUNDARY TRACE INEQUALITIES GILES AUCHMUTY Abstract. This paper describes sharp inequalities for the trace of Sobolev functions on the boundary of a bounded region R N. The inequalities bound (semi-)norms
More informationLebesgue Measure on R n
8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationEuler Characteristic of Two-Dimensional Manifolds
Euler Characteristic of Two-Dimensional Manifolds M. Hafiz Khusyairi August 2008 In this work we will discuss an important notion from topology, namely Euler Characteristic and we will discuss several
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 informationEE/ACM Applications of Convex Optimization in Signal Processing and Communications Lecture 17
EE/ACM 150 - Applications of Convex Optimization in Signal Processing and Communications Lecture 17 Andre Tkacenko Signal Processing Research Group Jet Propulsion Laboratory May 29, 2012 Andre Tkacenko
More informationCOURSE ON LMI PART I.2 GEOMETRY OF LMI SETS. Didier HENRION henrion
COURSE ON LMI PART I.2 GEOMETRY OF LMI SETS Didier HENRION www.laas.fr/ henrion October 2006 Geometry of LMI sets Given symmetric matrices F i we want to characterize the shape in R n of the LMI set F
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 informationWhat can be expressed via Conic Quadratic and Semidefinite Programming?
What can be expressed via Conic Quadratic and Semidefinite Programming? A. Nemirovski Faculty of Industrial Engineering and Management Technion Israel Institute of Technology Abstract Tremendous recent
More informationNotation. General. Notation Description See. Sets, Functions, and Spaces. a b & a b The minimum and the maximum of a and b
Notation General Notation Description See a b & a b The minimum and the maximum of a and b a + & a f S u The non-negative part, a 0, and non-positive part, (a 0) of a R The restriction of the function
More informationStar 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 informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationIn Orbifolds, Small Isoperimetric Regions are Small Balls
1 October 11, 2006 February 22, 2008 In Orbifolds, Small Isoperimetric Regions are Small Balls Frank Morgan Department of Mathematics and Statistics Williams College Williamstown, MA 01267 Frank.Morgan@williams.edu
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationSemidefinite Programming
Chapter 2 Semidefinite Programming 2.0.1 Semi-definite programming (SDP) Given C M n, A i M n, i = 1, 2,..., m, and b R m, the semi-definite programming problem is to find a matrix X M n for the optimization
More informationON THE FOLIATION OF SPACE-TIME BY CONSTANT MEAN CURVATURE HYPERSURFACES
ON THE FOLIATION OF SPACE-TIME BY CONSTANT MEAN CURVATURE HYPERSURFACES CLAUS GERHARDT Abstract. We prove that the mean curvature τ of the slices given by a constant mean curvature foliation can be used
More informationHW1 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 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 informationGeometric and isoperimetric properties of sets of positive reach in E d
Geometric and isoperimetric properties of sets of positive reach in E d Andrea Colesanti and Paolo Manselli Abstract Some geometric facts concerning sets of reach R > 0 in the n dimensional Euclidean space
More informationLecture 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 informationA 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 information8. Geometric problems
8. Geometric problems Convex Optimization Boyd & Vandenberghe extremal volume ellipsoids centering classification placement and facility location 8 1 Minimum volume ellipsoid around a set Löwner-John ellipsoid
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 informationCSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming
CSC2411 - Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming Notes taken by Mike Jamieson March 28, 2005 Summary: In this lecture, we introduce semidefinite programming
More informationConvexity 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). τ.
Convexity in R n Let E be a convex subset of R n. A function f : E (, ] is convex iff f(tx + (1 t)y) (1 t)f(x) + tf(y) x, y E, t [0, 1]. A similar definition holds in any vector space. A topology is needed
More informationAffine 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 informationOptimization 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 informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
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 informationMATH 205C: STATIONARY PHASE LEMMA
MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)
More informationFunctional Analysis Review
Outline 9.520: Statistical Learning Theory and Applications February 8, 2010 Outline 1 2 3 4 Vector Space Outline A vector space is a set V with binary operations +: V V V and : R V V such that for all
More informationA LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION
A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION O. SAVIN. Introduction In this paper we study the geometry of the sections for solutions to the Monge- Ampere equation det D 2 u = f, u
More informationON THE SHAPE OF LIQUID DROPS AND CRYSTALS IN THE SMALL MASS REGIME
ON THE SHAPE OF LIQUID DROPS AND CRYSTALS IN THE SMALL MASS REGIME A. FIGALLI AND F. MAGGI Abstract. We consider liquid drops or crystals lying in equilibrium under the action of a potential energy. For
More informationChapter One. The Calderón-Zygmund Theory I: Ellipticity
Chapter One The Calderón-Zygmund Theory I: Ellipticity Our story begins with a classical situation: convolution with homogeneous, Calderón- Zygmund ( kernels on R n. Let S n 1 R n denote the unit sphere
More informationA strongly polynomial algorithm for linear systems having a binary solution
A strongly polynomial algorithm for linear systems having a binary solution Sergei Chubanov Institute of Information Systems at the University of Siegen, Germany e-mail: sergei.chubanov@uni-siegen.de 7th
More informationMultivariable Calculus
2 Multivariable Calculus 2.1 Limits and Continuity Problem 2.1.1 (Fa94) Let the function f : R n R n satisfy the following two conditions: (i) f (K ) is compact whenever K is a compact subset of R n. (ii)
More informationNonlinear Programming Algorithms Handout
Nonlinear Programming Algorithms Handout Michael C. Ferris Computer Sciences Department University of Wisconsin Madison, Wisconsin 5376 September 9 1 Eigenvalues The eigenvalues of a matrix A C n n are
More informationLoos Symmetric Cones. Jimmie Lawson Louisiana State University. July, 2018
Louisiana State University July, 2018 Dedication I would like to dedicate this talk to Joachim Hilgert, whose 60th birthday we celebrate at this conference and with whom I researched and wrote a big blue
More informationPart II Probability and Measure
Part II Probability and Measure Theorems Based on lectures by J. Miller Notes taken by Dexter Chua Michaelmas 2016 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationPart II. Geometry and Groups. Year
Part II Year 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2014 Paper 4, Section I 3F 49 Define the limit set Λ(G) of a Kleinian group G. Assuming that G has no finite orbit in H 3 S 2, and that Λ(G),
More informationSpectral Gap and Concentration for Some Spherically Symmetric Probability Measures
Spectral Gap and Concentration for Some Spherically Symmetric Probability Measures S.G. Bobkov School of Mathematics, University of Minnesota, 127 Vincent Hall, 26 Church St. S.E., Minneapolis, MN 55455,
More 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 ε
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 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 informationLecture 5 - Hausdorff and Gromov-Hausdorff Distance
Lecture 5 - Hausdorff and Gromov-Hausdorff Distance August 1, 2011 1 Definition and Basic Properties Given a metric space X, the set of closed sets of X supports a metric, the Hausdorff metric. If A is
More informationLATTICE POINT COVERINGS
LATTICE POINT COVERINGS MARTIN HENK AND GEORGE A. TSINTSIFAS Abstract. We give a simple proof of a necessary and sufficient condition under which any congruent copy of a given ellipsoid contains an integral
More informationCentre for Mathematics and Its Applications The Australian National University Canberra, ACT 0200 Australia. 1. Introduction
ON LOCALLY CONVEX HYPERSURFACES WITH BOUNDARY Neil S. Trudinger Xu-Jia Wang Centre for Mathematics and Its Applications The Australian National University Canberra, ACT 0200 Australia Abstract. In this
More information(x, y) = d(x, y) = x y.
1 Euclidean geometry 1.1 Euclidean space Our story begins with a geometry which will be familiar to all readers, namely the geometry of Euclidean space. In this first chapter we study the Euclidean distance
More informationGEOMETRY HW 7 CLAY SHONKWILER
GEOMETRY HW 7 CLAY SHONKWILER 4.5.1 Let S R 3 be a regular, compact, orientable surface which is not homeomorphic to a sphere. Prove that there are points on S where the Gaussian curvature is positive,
More informationMath 302 Outcome Statements Winter 2013
Math 302 Outcome Statements Winter 2013 1 Rectangular Space Coordinates; Vectors in the Three-Dimensional Space (a) Cartesian coordinates of a point (b) sphere (c) symmetry about a point, a line, and a
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 informationEQUIVALENCE OF TOPOLOGIES AND BOREL FIELDS FOR COUNTABLY-HILBERT SPACES
EQUIVALENCE OF TOPOLOGIES AND BOREL FIELDS FOR COUNTABLY-HILBERT SPACES JEREMY J. BECNEL Abstract. We examine the main topologies wea, strong, and inductive placed on the dual of a countably-normed space
More informationDuke University, Department of Electrical and Computer Engineering Optimization for Scientists and Engineers c Alex Bronstein, 2014
Duke University, Department of Electrical and Computer Engineering Optimization for Scientists and Engineers c Alex Bronstein, 2014 Linear Algebra A Brief Reminder Purpose. The purpose of this document
More informationStructural and Multidisciplinary Optimization. P. Duysinx and P. Tossings
Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be
More informationUSA Mathematical Talent Search Solutions to Problem 4/4/16
4/4/1. Find, with proof, all integers n such that there is a solution in nonnegative real numbers (x, y, z) to the system of equations 2x 2 + y 2 + z 2 = n and x + 4y + 5z = 2. Credit This problem was
More informationShape 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 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 informationSemidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5
Semidefinite and Second Order Cone Programming Seminar Fall 2001 Lecture 5 Instructor: Farid Alizadeh Scribe: Anton Riabov 10/08/2001 1 Overview We continue studying the maximum eigenvalue SDP, and generalize
More informationQuasi-conformal maps and Beltrami equation
Chapter 7 Quasi-conformal maps and Beltrami equation 7. Linear distortion Assume that f(x + iy) =u(x + iy)+iv(x + iy) be a (real) linear map from C C that is orientation preserving. Let z = x + iy and
More informationCALCULUS ON MANIFOLDS. 1. Riemannian manifolds Recall that for any smooth manifold M, dim M = n, the union T M =
CALCULUS ON MANIFOLDS 1. Riemannian manifolds Recall that for any smooth manifold M, dim M = n, the union T M = a M T am, called the tangent bundle, is itself a smooth manifold, dim T M = 2n. Example 1.
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 informationSPECTRAL 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 informationAlexander Ostrowski
Ostrowski p. 1/3 Alexander Ostrowski 1893 1986 Walter Gautschi wxg@cs.purdue.edu Purdue University Ostrowski p. 2/3 Collected Mathematical Papers Volume 1 Determinants Linear Algebra Algebraic Equations
More informationConvex Optimization & Parsimony of L p-balls representation
Convex Optimization & Parsimony of L p -balls representation LAAS-CNRS and Institute of Mathematics, Toulouse, France IMA, January 2016 Motivation Unit balls associated with nonnegative homogeneous polynomials
More informationA 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 informationSCALE INVARIANT FOURIER RESTRICTION TO A HYPERBOLIC SURFACE
SCALE INVARIANT FOURIER RESTRICTION TO A HYPERBOLIC SURFACE BETSY STOVALL Abstract. This result sharpens the bilinear to linear deduction of Lee and Vargas for extension estimates on the hyperbolic paraboloid
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 informationA Mathematical Trivium
A Mathematical Trivium V.I. Arnold 1991 1. Sketch the graph of the derivative and the graph of the integral of a function given by a freehand graph. 2. Find the limit lim x 0 sin tan x tan sin x arcsin
More information0.1 Complex Analogues 1
0.1 Complex Analogues 1 Abstract In complex geometry Kodaira s theorem tells us that on a Kähler manifold sufficiently high powers of positive line bundles admit global holomorphic sections. Donaldson
More informationIndex. Bertrand mate, 89 bijection, 48 bitangent, 69 Bolyai, 339 Bonnet s Formula, 283 bounded, 48
Index acceleration, 14, 76, 355 centripetal, 27 tangential, 27 algebraic geometry, vii analytic, 44 angle at a corner, 21 on a regular surface, 170 angle excess, 337 angle of parallelism, 344 angular velocity,
More informationA metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions
1 Distance Reading [SB], Ch. 29.4, p. 811-816 A metric space is a set S with a given distance (or metric) function d(x, y) which satisfies the conditions (a) Positive definiteness d(x, y) 0, d(x, y) =
More informationAlexander Barvinok and J.A. Hartigan. January 2010
MAXIMUM ENTROPY GAUSSIAN APPROXIMATIONS FOR THE NUMBER OF INTEGER POINTS AND VOLUMES OF POLYTOPES Alexander Barvinok and J.A. Hartigan January 200 We describe a maximum entropy approach for computing volumes
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 informationEE731 Lecture Notes: Matrix Computations for Signal Processing
EE731 Lecture Notes: Matrix Computations for Signal Processing James P. Reilly c Department of Electrical and Computer Engineering McMaster University September 22, 2005 0 Preface This collection of ten
More informationSection 3.9. Matrix Norm
3.9. Matrix Norm 1 Section 3.9. Matrix Norm Note. We define several matrix norms, some similar to vector norms and some reflecting how multiplication by a matrix affects the norm of a vector. We use matrix
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 informationξ,i = x nx i x 3 + δ ni + x n x = 0. x Dξ = x i ξ,i = x nx i x i x 3 Du = λ x λ 2 xh + x λ h Dξ,
1 PDE, HW 3 solutions Problem 1. No. If a sequence of harmonic polynomials on [ 1,1] n converges uniformly to a limit f then f is harmonic. Problem 2. By definition U r U for every r >. Suppose w is a
More informationGeometry of Ricci Solitons
Geometry of Ricci Solitons H.-D. Cao, Lehigh University LMU, Munich November 25, 2008 1 Ricci Solitons A complete Riemannian (M n, g ij ) is a Ricci soliton if there exists a smooth function f on M such
More informationLogarithmic functional and reciprocity laws
Contemporary Mathematics Volume 00, 1997 Logarithmic functional and reciprocity laws Askold Khovanskii Abstract. In this paper, we give a short survey of results related to the reciprocity laws over the
More informationCHAPTER 3. Gauss map. In this chapter we will study the Gauss map of surfaces in R 3.
CHAPTER 3 Gauss map In this chapter we will study the Gauss map of surfaces in R 3. 3.1. Surfaces in R 3 Let S R 3 be a submanifold of dimension 2. Let {U i, ϕ i } be a DS on S. For any p U i we have a
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More information