Convexity of Intersection Bodies

Size: px
Start display at page:

Download "Convexity of Intersection Bodies"

Transcription

1 Convexity of Intersection Bodies Gautier Berck P&V January 11, 2014

2 Introduction Classic descriptions Let K be a convex body centered at the origin of the n-dimensional space V. Classic definition, V = R n The boundary of the intersection body of K, IK R n, is characterized by: Intrinsic definition x (IK) x = Area(K x ) The boundary of the intersection body of K, IK Λ n 1 V, is characterized by: a (IK) ω Λ n 1 V, ω(a) = ω K a (P&V) Intersection Bodies January 11, / 15

3 Introduction On the dual space Let Ω Λ n V be a fixed volume form. IK class V = R n x x IK V IK intr Λ n 1 V a Ω(a ) Definition Let ξ V and ω ξ Λ n 1 V be such that Ω = ξ ω ξ. Then, ( ξ IK := K ker ξ ω ξ ) 1. (P&V) Intersection Bodies January 11, / 15

4 Introduction On the dual space Let Ω Λ n V be a fixed volume form. IK class V = R n x x IK V IK intr Λ n 1 V a Ω(a ) Definition The intersection body of K, IK V, is characterized by: ξ IK ξ IK 1. (P&V) Intersection Bodies January 11, / 15

5 Introduction Convexity Busemann s theorem The intersection body of a centered convex body is convex. Equivalently, IK is a norm on V. (P&V) Intersection Bodies January 11, / 15

6 Introduction Two proofs Geometric proof The intersection body is the limit of duals of floating bodies; these are obviously convex. Analytical proof This proof extends directly to the whole family of L p -intersection bodies. (P&V) Intersection Bodies January 11, / 15

7 Floating bodies and floating hypersurfaces Basics K V, convex, centered. Floating body K α V : floating body with parameter α [0, 1/2]. K K α αvol(k) (P&V) Intersection Bodies January 11, / 15

8 Floating bodies and floating hypersurfaces Basics K V, convex, centered. Floating body K α V : floating body with parameter α [0, 1/2]. Easy properties K α is convex and centered. K 0 = K. K 1/2 = {0}. (P&V) Intersection Bodies January 11, / 15

9 Floating bodies and floating hypersurfaces Basics K V, convex, centered. Floating hypersurface The floating hypersurface S α V is defined by ξ S α Ω = α Vol(K). K {ξ 1} Property Kα S α K α S α (P&V) Intersection Bodies January 11, / 15

10 Floating bodies and floating hypersurfaces Basics K V, convex, centered. Theorem (Schutt-Werner) The floating hypersurface is convex. Hence Kα = S α K α K α S α S α (P&V) Intersection Bodies January 11, / 15

11 Floating bodies and floating hypersurfaces Distributions (V, Ω) ϕ C 0 (V ) a test function. Notation f D a distribution on V f, ϕ or V f ϕω (P&V) Intersection Bodies January 11, / 15

12 Floating bodies and floating hypersurfaces Distributions (V, Ω) ϕ C 0 (V ) a test function. Definition f is homogeneous of degree α if f, ϕ( /λ) = λ α+n f, ϕ Example δ is homogeneous of degree n. (P&V) Intersection Bodies January 11, / 15

13 Floating bodies and floating hypersurfaces Distributions Definition Let ξ V and ω ξ Ω n 1 (V ) be such that Ω = ξ ω ξ. The Radon transform of ϕ w.r.t ξ, R ξ (ϕ), is the test function on R defined by R ξ (ϕ)(s) = ϕω ξ. ξ x=s Definition The pull-back on V of a distribution f on R, πξ f, is defined by duality: π ξ f, ϕ := f, R ξ(ϕ). Proposition If f is homogeneous of degree α, so are its pull-back π ξ f and the map ξ π ξ f. (P&V) Intersection Bodies January 11, / 15

14 Floating bodies and floating hypersurfaces Examples Intersection body ξ IK = π ξ δ, 1 K 1 (P&V) Intersection Bodies January 11, / 15

15 Floating bodies and floating hypersurfaces Examples Intersection body ξ IK = π ξ δ, 1 K 1 Translated Heaviside On R, H t (s) := { 1 s t 0 s < t Proposition The floating hypersurface S α = (K α) is the level set at height α Vol(K) of the function ξ π ξ H 1, 1 K. (P&V) Intersection Bodies January 11, / 15

16 Floating bodies and floating hypersurfaces Convexity: proof 1 Theorem Up to normalization, the dual of floating bodies converge to the intersection body: lim t S 1/2 t = (IK). t 0 Vol(K) Hence the intersection body is convex. (P&V) Intersection Bodies January 11, / 15

17 Floating bodies and floating hypersurfaces Convexity: proof 1 Proof The hypersurface t S 1/2 t is characterized by: which is equivalent to π ξ H t, 1 K = (1/2 t) Vol(K) π ξ H 0 H t, 1 K = Vol(K). t Taking the limit as t goes to 0, it comes π ξ δ, 1 K = Vol(K) which characterizes (IK)/ Vol(K). (P&V) Intersection Bodies January 11, / 15

18 Definitions L p -intersection bodies For 1 < p 0 and K V, the L p -intersection-body of K, I p K V, is the body whose Minkowski functional is ξ IpK = ( x K + ξ (ξ x) p ) 1/p. K K + ξ ξ = 0 ξ > 0 (P&V) Intersection Bodies January 11, / 15

19 Definitions Alternative definition For 1 < p 0 and K V, the L p -intersection-body of K, I p K V, is the body whose Minkowski functional is ξ IpK = π ξ sp +, 1 K 1/p with s p +, ϕ := s p ϕ(s)ds. 0 (P&V) Intersection Bodies January 11, / 15

20 Easy properties Property For p 1, I p K is convex even if K is a non-symmetric star-body. Property since lim p 1 I p K = IK 1/p (1 + p) lim (1 + p 1 p)sp + = δ. (P&V) Intersection Bodies January 11, / 15

21 Brunn-Minkowski for moments Definition Let K V and η V s.t. η 0 on K. For r 0, the r-th moment of K w.r.t η is M r (K) := (η x) r Ω. x K (P&V) Intersection Bodies January 11, / 15

22 Brunn-Minkowski for moments Definition Let K V and η V s.t. η 0 on K. For r 0, the r-th moment of K w.r.t η is M r (K) := (η x) r Ω. Theorem (Hadwiger) x K Let η be non-negative on two convex bodies K 0 and K 1. Then M r (K 0 + K 1 ) 1 n+r M r (K 0 ) 1 n+r + M(K 1 ) 1 n+r. (P&V) Intersection Bodies January 11, / 15

23 Brunn-Minkowski for moments Definition Let K V be symmetric and η V s.t. η 0 on K. For r 0, the symmetric r-th moment of K w.r.t η is M s r (K) := η x r Ω. x K (P&V) Intersection Bodies January 11, / 15

24 Brunn-Minkowski for moments Definition Let K V be symmetric and η V s.t. η 0 on K. For r 0, the symmetric r-th moment of K w.r.t η is M s r (K) := η x r Ω. x K Brunn s theorem for moments Let K be a centered convex body in V, p 0 and H t a family of parallel hyperplanes defined by the equations ξ x = t. Then any linear form η 0 on H 0 may be extended to a linear form η on V s.t. the symmetric p-th moment M s p(k H t ) is maximal at t = 0. (P&V) Intersection Bodies January 11, / 15

25 Brunn-Minkowski for moments K η = 0 ξ = 0 Idea of the proof Choose η arbitrarily and consider K {η 0}. (P&V) Intersection Bodies January 11, / 15

26 Brunn-Minkowski for moments Idea of the proof Choose η arbitrarily and consider K {η 0}. For this half-body, the moments of hyperplane sections to the right power is a concave function of t. (P&V) Intersection Bodies January 11, / 15

27 Brunn-Minkowski for moments Idea of the proof Choose η arbitrarily and consider K {η 0}. For this half-body, the moments of hyperplane sections to the right power is a concave function of t. One can choose η so that the moment to the right power is maximal at t = 0, hence the moment itself is maximal at t = 0 (but not necessarily a concave function). (P&V) Intersection Bodies January 11, / 15

28 Brunn-Minkowski for moments Idea of the proof Choose η arbitrarily and consider K {η 0}. For this half-body, the moments of hyperplane sections to the right power is a concave function of t. One can choose η so that the moment to the right power is maximal at t = 0, hence the moment itself is maximal at t = 0 (but not necessarily a concave function). The result follows by symmetry. (P&V) Intersection Bodies January 11, / 15

29 Distributions s r + For r > 1 s r +, ϕ = 0 s r ϕ(s)ds (P&V) Intersection Bodies January 11, / 15

30 Distributions s r + For k 1 < r < k with k N s r +, ϕ = 0 ( ) s r ϕ(s) T0 k 1 ϕ(s) ds (P&V) Intersection Bodies January 11, / 15

31 Distributions Easy properties ( s r + ) = rs r 1 + lim r 1 (r + 1)s r + = δ lim r 1 ( s r + ) = δ (P&V) Intersection Bodies January 11, / 15

32 Distributions Property Let ξ, η V, ξ 0, and f D (R), d q dt q ( π ξ+tη f ) t=0 = ηq π ξ f (q). (P&V) Intersection Bodies January 11, / 15

33 Convexity: proof 2 Busemann s theorem The intersection body of a centered convex body is convex. Proof: (P&V) Intersection Bodies January 11, / 15

34 Convexity: proof 2 Proof: One needs, for ν T ξ IK, d 2 dt 2 ( ξ + tν IK ) t=0 0. (P&V) Intersection Bodies January 11, / 15

35 Convexity: proof 2 Proof: One needs, for ν T ξ IK, Easier to deal with d 2 dt 2 ( ξ + tν IK ) t= IK = π δ, 1 K. (P&V) Intersection Bodies January 11, / 15

36 Convexity: proof 2 Proof: One needs, for ν T ξ IK, d 2 dt 2 ( ξ + tν IK ) t=0 0. For any given λ R and η = ν + λξ, d 2 ( ξ + tη 1 dt 2 IK ) t=0 = 2λ2 d 2 dt 2 ( ξ + tν IK ) t=0. (P&V) Intersection Bodies January 11, / 15

37 Convexity: proof 2 Proof: One needs, for ν T ξ IK, d 2 dt 2 ( ξ + tν IK ) t=0 0. d 2 ( ) ξ + tη 1 dt 2 IK t=0 = π ξ δ, η 2 1 K (P&V) Intersection Bodies January 11, / 15

38 Convexity of L p -intersection bodies Theorem For 1 < p 0, the L p -intersection body of a centered convex body is convex. Proof: (P&V) Intersection Bodies January 11, / 15

39 Convexity of L p -intersection bodies Proof: One needs, for ν T ξ IK, d 2 ( ) ξ + tν IpK dt 2 t=0 0. (P&V) Intersection Bodies January 11, / 15

40 Convexity of L p -intersection bodies Proof: One needs, for ν T ξ IK, d 2 ( ) ξ + tν IpK dt 2 t=0 0. For any given λ R and η = ν + λξ, d 2 ( ξ + tη p dt 2 IK ) t=0 = p(p 1)λ2 + p d 2 dt 2 ( ξ + tν IK ) t=0. (P&V) Intersection Bodies January 11, / 15

41 Convexity of L p -intersection bodies Proof: One needs, for ν T ξ IK, d 2 ( ) ξ + tν IpK dt 2 t=0 0. d 2 ( ξ + tη p ) dt 2 IK t=0 = ( π ξ s p +), η 2 1 K (P&V) Intersection Bodies January 11, / 15

42 Convexity of L p -intersection bodies Proof: One needs, for ν T ξ IK, d 2 ( ) ξ + tν IpK dt 2 t=0 0. If p > 1, πξ sp +, η 2 1 K = p(p 1) x K + ξ (η x) 2 (ξ x) p 2 Ω (P&V) Intersection Bodies January 11, / 15

43 Convexity of L p -intersection bodies Proof: One needs, for ν T ξ IK, If 0 < p < 1, d 2 ( ) ξ + tν IpK dt 2 t=0 0. for ϕ = R ξ ( η 2 1 K ). πξ sp +, η 2 1 K = s p ( +, Rξ η 2 ) 1 K = p(p 1) 0 s p 2 (ϕ(s) ϕ(0)) ds (P&V) Intersection Bodies January 11, / 15

44 Convexity of L p -intersection bodies Proof: One needs, for ν T ξ IK, If 0 < p < 1, d 2 ( ) ξ + tν IpK dt 2 t=0 0. πξ sp +, η 2 1 K = s p ( +, Rξ η 2 ) 1 K for ϕ = R ξ ( η 2 1 K ). Choose η so that ϕ(0) ϕ(s). = p(p 1) 0 s p 2 (ϕ(s) ϕ(0)) ds (P&V) Intersection Bodies January 11, / 15

45 Convexity of L p -intersection bodies Proof: One needs, for ν T ξ IK, If 1 < p < 0, d 2 ( ) ξ + tν IpK dt 2 t=0 0. πξ sp +, η 2 1 K = p(p 1) for ϕ = R ξ ( η 2 1 K ). 0 s p 2 ( ϕ(s) ϕ(0) sϕ (0) ) ds (P&V) Intersection Bodies January 11, / 15

46 Convexity of L p -intersection bodies Proof: One needs, for ν T ξ IK, If 1 < p < 0, d 2 ( ) ξ + tν IpK dt 2 t=0 0. πξ sp +, η 2 1 K = p(p 1) 0 s p 2 ( ϕ(s) ϕ(0) sϕ (0) ) ds for ϕ = R ξ ( η 2 1 K ). Choose η so that ϕ(0) ϕ(s). By symmetry, ϕ (0) = 0. (P&V) Intersection Bodies January 11, / 15

Walrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.

Walrasian Demand. u(x) where B(p, w) = {x R n + : p x w}. Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian

More information

Duality of linear conic problems

Duality of linear conic problems Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least

More information

14.451 Lecture Notes 10

14.451 Lecture Notes 10 14.451 Lecture Notes 1 Guido Lorenzoni Fall 29 1 Continuous time: nite horizon Time goes from to T. Instantaneous payo : f (t; x (t) ; y (t)) ; (the time dependence includes discounting), where x (t) 2

More information

Lecture 5 Principal Minors and the Hessian

Lecture 5 Principal Minors and the Hessian Lecture 5 Principal Minors and the Hessian Eivind Eriksen BI Norwegian School of Management Department of Economics October 01, 2010 Eivind Eriksen (BI Dept of Economics) Lecture 5 Principal Minors and

More information

Ideal Class Group and Units

Ideal Class Group and Units Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals

More information

Properties of BMO functions whose reciprocals are also BMO

Properties of BMO functions whose reciprocals are also BMO Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and

More information

Metric Spaces. Chapter 7. 7.1. Metrics

Metric Spaces. Chapter 7. 7.1. Metrics Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

More information

Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

More information

Geometrical Characterization of RN-operators between Locally Convex Vector Spaces

Geometrical Characterization of RN-operators between Locally Convex Vector Spaces Geometrical Characterization of RN-operators between Locally Convex Vector Spaces OLEG REINOV St. Petersburg State University Dept. of Mathematics and Mechanics Universitetskii pr. 28, 198504 St, Petersburg

More information

2.3 Convex Constrained Optimization Problems

2.3 Convex Constrained Optimization Problems 42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions

More information

. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2

. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2 4. Basic feasible solutions and vertices of polyhedra Due to the fundamental theorem of Linear Programming, to solve any LP it suffices to consider the vertices (finitely many) of the polyhedron P of the

More information

Lecture 2: August 29. Linear Programming (part I)

Lecture 2: August 29. Linear Programming (part I) 10-725: Convex Optimization Fall 2013 Lecture 2: August 29 Lecturer: Barnabás Póczos Scribes: Samrachana Adhikari, Mattia Ciollaro, Fabrizio Lecci Note: LaTeX template courtesy of UC Berkeley EECS dept.

More information

Convex Rationing Solutions (Incomplete Version, Do not distribute)

Convex Rationing Solutions (Incomplete Version, Do not distribute) Convex Rationing Solutions (Incomplete Version, Do not distribute) Ruben Juarez rubenj@hawaii.edu January 2013 Abstract This paper introduces a notion of convexity on the rationing problem and characterizes

More information

Probability Generating Functions

Probability Generating Functions page 39 Chapter 3 Probability Generating Functions 3 Preamble: Generating Functions Generating functions are widely used in mathematics, and play an important role in probability theory Consider a sequence

More information

Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

More information

Support Vector Machines

Support Vector Machines Support Vector Machines Charlie Frogner 1 MIT 2011 1 Slides mostly stolen from Ryan Rifkin (Google). Plan Regularization derivation of SVMs. Analyzing the SVM problem: optimization, duality. Geometric

More information

The Ideal Class Group

The Ideal Class Group Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned

More information

MICROLOCAL ANALYSIS OF THE BOCHNER-MARTINELLI INTEGRAL

MICROLOCAL ANALYSIS OF THE BOCHNER-MARTINELLI INTEGRAL PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 MICROLOCAL ANALYSIS OF THE BOCHNER-MARTINELLI INTEGRAL NIKOLAI TARKHANOV AND NIKOLAI VASILEVSKI

More information

Chapter 6. Cuboids. and. vol(conv(p ))

Chapter 6. Cuboids. and. vol(conv(p )) Chapter 6 Cuboids We have already seen that we can efficiently find the bounding box Q(P ) and an arbitrarily good approximation to the smallest enclosing ball B(P ) of a set P R d. Unfortunately, both

More information

Systems with Persistent Memory: the Observation Inequality Problems and Solutions

Systems with Persistent Memory: the Observation Inequality Problems and Solutions Chapter 6 Systems with Persistent Memory: the Observation Inequality Problems and Solutions Facts that are recalled in the problems wt) = ut) + 1 c A 1 s ] R c t s)) hws) + Ks r)wr)dr ds. 6.1) w = w +

More information

Minkowski Sum of Polytopes Defined by Their Vertices

Minkowski Sum of Polytopes Defined by Their Vertices Minkowski Sum of Polytopes Defined by Their Vertices Vincent Delos, Denis Teissandier To cite this version: Vincent Delos, Denis Teissandier. Minkowski Sum of Polytopes Defined by Their Vertices. Journal

More information

Chapter 6. Orthogonality

Chapter 6. Orthogonality 6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be

More information

Spazi vettoriali e misure di similaritá

Spazi vettoriali e misure di similaritá Spazi vettoriali e misure di similaritá R. Basili Corso di Web Mining e Retrieval a.a. 2008-9 April 10, 2009 Outline Outline Spazi vettoriali a valori reali Operazioni tra vettori Indipendenza Lineare

More information

Date: April 12, 2001. Contents

Date: April 12, 2001. Contents 2 Lagrange Multipliers Date: April 12, 2001 Contents 2.1. Introduction to Lagrange Multipliers......... p. 2 2.2. Enhanced Fritz John Optimality Conditions...... p. 12 2.3. Informative Lagrange Multipliers...........

More information

EXIT TIME PROBLEMS AND ESCAPE FROM A POTENTIAL WELL

EXIT TIME PROBLEMS AND ESCAPE FROM A POTENTIAL WELL EXIT TIME PROBLEMS AND ESCAPE FROM A POTENTIAL WELL Exit Time problems and Escape from a Potential Well Escape From a Potential Well There are many systems in physics, chemistry and biology that exist

More information

Convex analysis and profit/cost/support functions

Convex analysis and profit/cost/support functions CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m

More information

Arrangements And Duality

Arrangements And Duality Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,

More information

How To Prove The Dirichlet Unit Theorem

How To Prove The Dirichlet Unit Theorem Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

More information

Discussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski.

Discussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski. Discussion on the paper Hypotheses testing by convex optimization by A. Goldenschluger, A. Juditsky and A. Nemirovski. Fabienne Comte, Celine Duval, Valentine Genon-Catalot To cite this version: Fabienne

More information

Adaptive Online Gradient Descent

Adaptive Online Gradient Descent Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650

More information

Does Black-Scholes framework for Option Pricing use Constant Volatilities and Interest Rates? New Solution for a New Problem

Does Black-Scholes framework for Option Pricing use Constant Volatilities and Interest Rates? New Solution for a New Problem Does Black-Scholes framework for Option Pricing use Constant Volatilities and Interest Rates? New Solution for a New Problem Gagan Deep Singh Assistant Vice President Genpact Smart Decision Services Financial

More information

OPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN. E.V. Grigorieva. E.N. Khailov

OPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN. E.V. Grigorieva. E.N. Khailov DISCRETE AND CONTINUOUS Website: http://aimsciences.org DYNAMICAL SYSTEMS Supplement Volume 2005 pp. 345 354 OPTIMAL CONTROL OF A COMMERCIAL LOAN REPAYMENT PLAN E.V. Grigorieva Department of Mathematics

More information

ORIENTATIONS. Contents

ORIENTATIONS. Contents ORIENTATIONS Contents 1. Generators for H n R n, R n p 1 1. Generators for H n R n, R n p We ended last time by constructing explicit generators for H n D n, S n 1 by using an explicit n-simplex which

More information

Tail inequalities for order statistics of log-concave vectors and applications

Tail inequalities for order statistics of log-concave vectors and applications Tail inequalities for order statistics of log-concave vectors and applications Rafał Latała Based in part on a joint work with R.Adamczak, A.E.Litvak, A.Pajor and N.Tomczak-Jaegermann Banff, May 2011 Basic

More information

NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

More information

Lecture Notes for Chapter 34: Images

Lecture Notes for Chapter 34: Images Lecture Notes for hapter 4: Images Disclaimer: These notes are not meant to replace the textbook. Please report any inaccuracies to the professor.. Spherical Reflecting Surfaces Bad News: This subject

More information

8.1 Examples, definitions, and basic properties

8.1 Examples, definitions, and basic properties 8 De Rham cohomology Last updated: May 21, 211. 8.1 Examples, definitions, and basic properties A k-form ω Ω k (M) is closed if dω =. It is exact if there is a (k 1)-form σ Ω k 1 (M) such that dσ = ω.

More information

MINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS. denote the family of probability density functions g on X satisfying

MINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS. denote the family of probability density functions g on X satisfying MINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS I. Csiszár (Budapest) Given a σ-finite measure space (X, X, µ) and a d-tuple ϕ = (ϕ 1,..., ϕ d ) of measurable functions on X, for a = (a 1,...,

More information

Properties of moments of random variables

Properties of moments of random variables Properties of moments of rom variables Jean-Marie Dufour Université de Montréal First version: May 1995 Revised: January 23 This version: January 14, 23 Compiled: January 14, 23, 1:5pm This work was supported

More information

Geometric Camera Parameters

Geometric Camera Parameters Geometric Camera Parameters What assumptions have we made so far? -All equations we have derived for far are written in the camera reference frames. -These equations are valid only when: () all distances

More information

Tropical cycles and Chow polytopes

Tropical cycles and Chow polytopes Tropical cycles and Chow polytopes Alex Fink Department of Mathematics University of California, Berkeley Tropical Geometry in Combinatorics and Algebra MSRI October 16, 2009 Alex Fink (UC Berkeley) Tropical

More information

Two-Stage Stochastic Linear Programs

Two-Stage Stochastic Linear Programs Two-Stage Stochastic Linear Programs Operations Research Anthony Papavasiliou 1 / 27 Two-Stage Stochastic Linear Programs 1 Short Reviews Probability Spaces and Random Variables Convex Analysis 2 Deterministic

More information

E3: PROBABILITY AND STATISTICS lecture notes

E3: PROBABILITY AND STATISTICS lecture notes E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................

More information

Valuations and Surface Area Measures

Valuations and Surface Area Measures Valuations and Surface Area Measures Christoph Haberl and Lukas Parapatits Abstract We consider valuations defined on polytopes containing the origin which have measures on the sphere as values. We show

More information

Corollary. (f є C n+1 [a,b]). Proof: This follows directly from the preceding theorem using the inequality

Corollary. (f є C n+1 [a,b]). Proof: This follows directly from the preceding theorem using the inequality Corollary For equidistant knots, i.e., u i = a + i (b-a)/n, we obtain with (f є C n+1 [a,b]). Proof: This follows directly from the preceding theorem using the inequality 120202: ESM4A - Numerical Methods

More information

LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS. 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method

LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS. 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method LECTURE 5: DUALITY AND SENSITIVITY ANALYSIS 1. Dual linear program 2. Duality theory 3. Sensitivity analysis 4. Dual simplex method Introduction to dual linear program Given a constraint matrix A, right

More information

Lecture 6 Black-Scholes PDE

Lecture 6 Black-Scholes PDE Lecture 6 Black-Scholes PDE Lecture Notes by Andrzej Palczewski Computational Finance p. 1 Pricing function Let the dynamics of underlining S t be given in the risk-neutral measure Q by If the contingent

More information

CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC. 1. Introduction

CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC. 1. Introduction Acta Math. Univ. Comenianae Vol. LXXXI, 1 (2012), pp. 71 77 71 CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC E. BALLICO Abstract. Here we study (in positive characteristic) integral curves

More information

A new continuous dependence result for impulsive retarded functional differential equations

A new continuous dependence result for impulsive retarded functional differential equations CADERNOS DE MATEMÁTICA 11, 37 47 May (2010) ARTIGO NÚMERO SMA#324 A new continuous dependence result for impulsive retarded functional differential equations M. Federson * Instituto de Ciências Matemáticas

More information

1. Introduction. PROPER HOLOMORPHIC MAPPINGS BETWEEN RIGID POLYNOMIAL DOMAINS IN C n+1

1. Introduction. PROPER HOLOMORPHIC MAPPINGS BETWEEN RIGID POLYNOMIAL DOMAINS IN C n+1 Publ. Mat. 45 (2001), 69 77 PROPER HOLOMORPHIC MAPPINGS BETWEEN RIGID POLYNOMIAL DOMAINS IN C n+1 Bernard Coupet and Nabil Ourimi Abstract We describe the branch locus of proper holomorphic mappings between

More information

A FIRST COURSE IN OPTIMIZATION THEORY

A FIRST COURSE IN OPTIMIZATION THEORY A FIRST COURSE IN OPTIMIZATION THEORY RANGARAJAN K. SUNDARAM New York University CAMBRIDGE UNIVERSITY PRESS Contents Preface Acknowledgements page xiii xvii 1 Mathematical Preliminaries 1 1.1 Notation

More information

Critical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima.

Critical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima. Lecture 0: Convexity and Optimization We say that if f is a once continuously differentiable function on an interval I, and x is a point in the interior of I that x is a critical point of f if f (x) =

More information

Fiber Polytopes for the Projections between Cyclic Polytopes

Fiber Polytopes for the Projections between Cyclic Polytopes Europ. J. Combinatorics (2000) 21, 19 47 Article No. eujc.1999.0319 Available online at http://www.idealibrary.com on Fiber Polytopes for the Projections between Cyclic Polytopes CHRISTOS A. ATHANASIADIS,

More information

Follow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu

Follow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part

More information

arxiv:1502.06681v2 [q-fin.mf] 26 Feb 2015

arxiv:1502.06681v2 [q-fin.mf] 26 Feb 2015 ARBITRAGE, HEDGING AND UTILITY MAXIMIZATION USING SEMI-STATIC TRADING STRATEGIES WITH AMERICAN OPTIONS ERHAN BAYRAKTAR AND ZHOU ZHOU arxiv:1502.06681v2 [q-fin.mf] 26 Feb 2015 Abstract. We consider a financial

More information

Vectors and Index Notation

Vectors and Index Notation Vectors and Index Notation Stephen R. Addison January 12, 2004 1 Basic Vector Review 1.1 Unit Vectors We will denote a unit vector with a superscript caret, thus â denotes a unit vector. â â = 1 If x is

More information

Manual for SOA Exam MLC.

Manual for SOA Exam MLC. Chapter 4. Life Insurance. c 29. Miguel A. Arcones. All rights reserved. Extract from: Arcones Manual for the SOA Exam MLC. Fall 29 Edition. available at http://www.actexmadriver.com/ c 29. Miguel A. Arcones.

More information

Section 1.1. Introduction to R n

Section 1.1. Introduction to R n The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to

More information

Inner Product Spaces

Inner Product Spaces Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

More information

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

More information

ON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE

ON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE Illinois Journal of Mathematics Volume 46, Number 1, Spring 2002, Pages 145 153 S 0019-2082 ON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE J. HUISMAN Abstract. Let C be a

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

More information

Linear Programming Notes V Problem Transformations

Linear Programming Notes V Problem Transformations Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material

More information

Systems of Linear Equations

Systems of Linear Equations Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

More information

Statistical Machine Learning

Statistical Machine Learning Statistical Machine Learning UoC Stats 37700, Winter quarter Lecture 4: classical linear and quadratic discriminants. 1 / 25 Linear separation For two classes in R d : simple idea: separate the classes

More information

What is Linear Programming?

What is Linear Programming? Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to

More information

1 3 4 = 8i + 20j 13k. x + w. y + w

1 3 4 = 8i + 20j 13k. x + w. y + w ) Find the point of intersection of the lines x = t +, y = 3t + 4, z = 4t + 5, and x = 6s + 3, y = 5s +, z = 4s + 9, and then find the plane containing these two lines. Solution. Solve the system of equations

More information

PROJECTIVE GEOMETRY. b3 course 2003. Nigel Hitchin

PROJECTIVE GEOMETRY. b3 course 2003. Nigel Hitchin PROJECTIVE GEOMETRY b3 course 2003 Nigel Hitchin hitchin@maths.ox.ac.uk 1 1 Introduction This is a course on projective geometry. Probably your idea of geometry in the past has been based on triangles

More information

The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions. Daniel M. Kane

The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions. Daniel M. Kane The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions Daniel M. Kane Outline Definitions and Motivation Previous Work Statements of Theorems Proof of the Noise Sensitivity

More information

Lecture 5/6. Enrico Bini

Lecture 5/6. Enrico Bini Advanced Lecture 5/6 November 8, 212 Outline 1 2 3 Theorem (Lemma 3 in [?]) Space of feasible C i N is EDF-schedulable if and only if i U i 1 and: t D n i=1 { max, t + Ti D i T i } C i t with D = {d i,k

More information

10.2 Series and Convergence

10.2 Series and Convergence 10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and

More information

Linear Algebra Notes

Linear Algebra Notes Linear Algebra Notes Chapter 19 KERNEL AND IMAGE OF A MATRIX Take an n m matrix a 11 a 12 a 1m a 21 a 22 a 2m a n1 a n2 a nm and think of it as a function A : R m R n The kernel of A is defined as Note

More information

Linear Programming Problems

Linear Programming Problems Linear Programming Problems Linear programming problems come up in many applications. In a linear programming problem, we have a function, called the objective function, which depends linearly on a number

More information

A Game Theoretic Formulation of the Service Provisioning Problem in Cloud Systems

A Game Theoretic Formulation of the Service Provisioning Problem in Cloud Systems A Game Theoretic Formulation of the Service Provisioning Problem in Cloud Systems Danilo Ardagna 1, Barbara Panicucci 1, Mauro Passacantando 2 1 Politecnico di Milano,, Italy 2 Università di Pisa, Dipartimento

More information

WHEN DOES A RANDOMLY WEIGHTED SELF NORMALIZED SUM CONVERGE IN DISTRIBUTION?

WHEN DOES A RANDOMLY WEIGHTED SELF NORMALIZED SUM CONVERGE IN DISTRIBUTION? WHEN DOES A RANDOMLY WEIGHTED SELF NORMALIZED SUM CONVERGE IN DISTRIBUTION? DAVID M MASON 1 Statistics Program, University of Delaware Newark, DE 19717 email: davidm@udeledu JOEL ZINN 2 Department of Mathematics,

More information

15 Kuhn -Tucker conditions

15 Kuhn -Tucker conditions 5 Kuhn -Tucker conditions Consider a version of the consumer problem in which quasilinear utility x 2 + 4 x 2 is maximised subject to x +x 2 =. Mechanically applying the Lagrange multiplier/common slopes

More information

An optimal transportation problem with import/export taxes on the boundary

An optimal transportation problem with import/export taxes on the boundary An optimal transportation problem with import/export taxes on the boundary Julián Toledo Workshop International sur les Mathématiques et l Environnement Essaouira, November 2012..................... Joint

More information

Fixed Point Theorems

Fixed Point Theorems Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation

More information

A NEW LOOK AT CONVEX ANALYSIS AND OPTIMIZATION

A NEW LOOK AT CONVEX ANALYSIS AND OPTIMIZATION 1 A NEW LOOK AT CONVEX ANALYSIS AND OPTIMIZATION Dimitri Bertsekas M.I.T. FEBRUARY 2003 2 OUTLINE Convexity issues in optimization Historical remarks Our treatment of the subject Three unifying lines of

More information

Decentralization and Private Information with Mutual Organizations

Decentralization and Private Information with Mutual Organizations Decentralization and Private Information with Mutual Organizations Edward C. Prescott and Adam Blandin Arizona State University 09 April 2014 1 Motivation Invisible hand works in standard environments

More information

Some representability and duality results for convex mixed-integer programs.

Some representability and duality results for convex mixed-integer programs. Some representability and duality results for convex mixed-integer programs. Santanu S. Dey Joint work with Diego Morán and Juan Pablo Vielma December 17, 2012. Introduction About Motivation Mixed integer

More information

1.5 / 1 -- Communication Networks II (Görg) -- www.comnets.uni-bremen.de. 1.5 Transforms

1.5 / 1 -- Communication Networks II (Görg) -- www.comnets.uni-bremen.de. 1.5 Transforms .5 / -- Communication Networks II (Görg) -- www.comnets.uni-bremen.de.5 Transforms Using different summation and integral transformations pmf, pdf and cdf/ccdf can be transformed in such a way, that even

More information

Order statistics and concentration of l r norms for log-concave vectors

Order statistics and concentration of l r norms for log-concave vectors Order statistics and concentration of l r norms for log-concave vectors Rafa l Lata la Abstract We establish upper bounds for tails of order statistics of isotropic log-concave vectors and apply them to

More information

The Australian Journal of Mathematical Analysis and Applications

The Australian Journal of Mathematical Analysis and Applications The Australian Journal of Mathematical Analysis and Applications Volume 7, Issue, Article 11, pp. 1-14, 011 SOME HOMOGENEOUS CYCLIC INEQUALITIES OF THREE VARIABLES OF DEGREE THREE AND FOUR TETSUYA ANDO

More information

The Math Circle, Spring 2004

The Math Circle, Spring 2004 The Math Circle, Spring 2004 (Talks by Gordon Ritter) What is Non-Euclidean Geometry? Most geometries on the plane R 2 are non-euclidean. Let s denote arc length. Then Euclidean geometry arises from the

More information

The integrating factor method (Sect. 2.1).

The integrating factor method (Sect. 2.1). The integrating factor method (Sect. 2.1). Overview of differential equations. Linear Ordinary Differential Equations. The integrating factor method. Constant coefficients. The Initial Value Problem. Variable

More information

Multivariate Lorenz dominance A review and new perspectives

Multivariate Lorenz dominance A review and new perspectives Siena Conference, May 23 26, 2005 1 A review and new perspectives by Karl Mosler University of Cologne mosler@statistikuni-koelnde and Gleb Koshevoy CEMI, Russian Academy of Science, Moscow koshevoy@cemirssiru

More information

SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 3. Symmetrical Components & Faults Calculations

SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 3. Symmetrical Components & Faults Calculations SAMPLE OF THE STUDY MATERIAL PART OF CHAPTER 3 3.0 Introduction Fortescue's work proves that an unbalanced system of 'n' related phasors can be resolved into 'n' systems of balanced phasors called the

More information

1 Norms and Vector Spaces

1 Norms and Vector Spaces 008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)

More information

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

More information

4: SINGLE-PERIOD MARKET MODELS

4: SINGLE-PERIOD MARKET MODELS 4: SINGLE-PERIOD MARKET MODELS Ben Goldys and Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2015 B. Goldys and M. Rutkowski (USydney) Slides 4: Single-Period Market

More information

Separation Properties for Locally Convex Cones

Separation Properties for Locally Convex Cones Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam

More information

Mathematical Methods of Engineering Analysis

Mathematical Methods of Engineering Analysis Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................

More information

EXISTENCE AND NON-EXISTENCE RESULTS FOR A NONLINEAR HEAT EQUATION

EXISTENCE AND NON-EXISTENCE RESULTS FOR A NONLINEAR HEAT EQUATION Sixth Mississippi State Conference on Differential Equations and Computational Simulations, Electronic Journal of Differential Equations, Conference 5 (7), pp. 5 65. ISSN: 7-669. UL: http://ejde.math.txstate.edu

More information

Metric Spaces. Chapter 1

Metric Spaces. Chapter 1 Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence

More information

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

More information

Mathematical Physics, Lecture 9

Mathematical Physics, Lecture 9 Mathematical Physics, Lecture 9 Hoshang Heydari Fysikum April 25, 2012 Hoshang Heydari (Fysikum) Mathematical Physics, Lecture 9 April 25, 2012 1 / 42 Table of contents 1 Differentiable manifolds 2 Differential

More information

6.042/18.062J Mathematics for Computer Science December 12, 2006 Tom Leighton and Ronitt Rubinfeld. Random Walks

6.042/18.062J Mathematics for Computer Science December 12, 2006 Tom Leighton and Ronitt Rubinfeld. Random Walks 6.042/8.062J Mathematics for Comuter Science December 2, 2006 Tom Leighton and Ronitt Rubinfeld Lecture Notes Random Walks Gambler s Ruin Today we re going to talk about one-dimensional random walks. In

More information

Dot product and vector projections (Sect. 12.3) There are two main ways to introduce the dot product

Dot product and vector projections (Sect. 12.3) There are two main ways to introduce the dot product Dot product and vector projections (Sect. 12.3) Two definitions for the dot product. Geometric definition of dot product. Orthogonal vectors. Dot product and orthogonal projections. Properties of the dot

More information

POLYTOPES WITH MASS LINEAR FUNCTIONS, PART I

POLYTOPES WITH MASS LINEAR FUNCTIONS, PART I POLYTOPES WITH MASS LINEAR FUNCTIONS, PART I DUSA MCDUFF AND SUSAN TOLMAN Abstract. We analyze mass linear functions on simple polytopes, where a mass linear function is an affine function on whose value

More information