Jamshīd al-Kāshī: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>HistoryofIran
No edit summary
Line 1: Line 1:
In [[mathematics]], the '''Prékopa–Leindler inequality''' is an [[integral]] [[inequality (mathematics)|inequality]] closely related to the [[reverse Young's inequality]], the [[Brunn–Minkowski inequality]] and a number of other important and classical inequalities in [[mathematical analysis|analysis]]. The result is named after the [[Hungary|Hungarian]] [[mathematician]]s [[András Prékopa]] and [[László Leindler]].
The title of the writer is Jayson. I am really fond of handwriting but I can't make it my profession really. For a whilst I've been in Alaska but I will have to transfer in a year or two. Credit authorising is how he makes money.<br><br>Have a look at my site - [http://kjhkkb.net/xe/notice/374835 psychic love readings]
 
==Statement of the inequality==
Let 0&nbsp;&lt;&nbsp;''λ''&nbsp;&lt;&nbsp;1 and let ''f'', ''g'', ''h''&nbsp;:&nbsp;'''R'''<sup>''n''</sup>&nbsp;→&nbsp;[0,&nbsp;+∞) be non-[[negative number|negative]] [[real number|real-valued]] [[measurable function]]s defined on ''n''-dimensional [[Euclidean space]] '''R'''<sup>''n''</sup>. Suppose that these functions satisfy
 
{{NumBlk|:|<math>h \left( (1-\lambda)x + \lambda y \right) \geq f(x)^{1 - \lambda} g(y)^{\lambda}</math>|{{EquationRef|1}}}}
 
for all ''x'' and ''y'' in '''R'''<sup>''n''</sup>. Then
 
:<math>\| h\|_{1} := \int_{\mathbb{R}^{n}} h(x) \, \mathrm{d} x \geq \left( \int_{\mathbb{R}^{n}} f(x) \, \mathrm{d} x \right)^{1 -\lambda} \left( \int_{\mathbb{R}^{n}} g(x) \, \mathrm{d} x \right)^{\lambda} =: \| f\|_{1}^{1 -\lambda} \| g\|_{1}^{\lambda}. \, </math>
 
==Essential form of the inequality==
Recall that the [[essential supremum]] of a measurable function ''f''&nbsp;:&nbsp;'''R'''<sup>''n''</sup>&nbsp;→&nbsp;'''R''' is defined by
 
:<math>\mathop{\mathrm{ess\,sup}}_{x \in \mathbb{R}^{n}} f(x) = \inf \left\{ t \in [- \infty, + \infty] | f(x) \leq t \mbox{ for almost all } x \in \mathbb{R}^{n} \right\}.</math>
 
This notation allows the following ''essential form'' of the Prékopa–Leindler inequality: let 0&nbsp;&lt;&nbsp;''λ''&nbsp;&lt;&nbsp;1 and let ''f'', ''g''&nbsp;∈&nbsp;''L''<sup>1</sup>('''R'''<sup>''n''</sup>;&nbsp;[0,&nbsp;+∞)) be non-negative [[absolutely integrable]] functions. Let
 
:<math>s(x) = \mathop{\mathrm{ess\,sup}}_{y \in \mathbb{R}^{n}} f \left( \frac{x - y}{1 - \lambda} \right)^{1 - \lambda} g \left( \frac{y}{\lambda} \right)^{\lambda}.</math>
 
Then ''s'' is measurable and
 
:<math>\| s \|_{1} \geq \| f \|_{1}^{1 - \lambda} \| g \|_{1}^{\lambda}.</math>
 
The essential supremum form was given in.<ref>{{cite journal | authors = [[Herm Jan Brascamp]] and [[Elliott H. Lieb]] | title = On extensions of the Brunn–Minkowski and Prekopa–Leindler theorems, including inequalities for log concave functions and with an application to the diffusion equation | journal = Journal of Functional Analysis | volume = 22 |issue=4 | pages = 366&ndash;389 | year = 1976 |doi=10.1016/0022-1236(76)90004-5 }}</ref>  Its use can change the left side of the inequality. For example, a function ''g'' that takes the value 1 at exactly one point will not usually yield a zero left side in the "non-essential sup" form but it will always yield a zero left side in the "essential sup" form.
 
==Relationship to the Brunn–Minkowski inequality==
It can be shown that the usual Prékopa–Leindler inequality implies the [[Brunn–Minkowski inequality]] in the following form: if 0&nbsp;&lt;&nbsp;''λ''&nbsp;&lt;&nbsp;1 and ''A'' and ''B'' are [[bounded set|bounded]], [[measurable set|measurable subsets]] of '''R'''<sup>''n''</sup> such that the [[Minkowski sum]] (1&nbsp;&minus;&nbsp;''λ'')''A''&nbsp;+&nbsp;λ''B'' is also measurable, then
 
:<math>\mu \left( (1 - \lambda) A + \lambda B \right) \geq \mu (A)^{1 - \lambda} \mu (B)^{\lambda},</math>
 
where ''μ'' denotes ''n''-dimensional [[Lebesgue measure]]. Hence, the Prékopa–Leindler inequality can also be used<ref>Gardner, Richard J. (2002). "The Brunn–Minkowski inequality". Bull. Amer. Math. Soc. (N.S.) 39 (3): pp. 355–405 (electronic). doi:10.1090/S0273-0979-02-00941-2. ISSN 0273-0979.</ref> to prove the Brunn–Minkowski inequality in its more familiar form: if 0&nbsp;&lt;&nbsp;''λ''&nbsp;&lt;&nbsp;1 and ''A'' and ''B'' are non-[[empty set|empty]], [[bounded set|bounded]], [[measurable set|measurable subsets]] of '''R'''<sup>''n''</sup> such that (1&nbsp;&minus;&nbsp;''λ'')''A''&nbsp;+&nbsp;λ''B'' is also measurable, then
 
:<math>\mu \left( (1 - \lambda) A + \lambda B \right)^{1 / n} \geq (1 - \lambda) \mu (A)^{1 / n} + \lambda \mu (B)^{1 / n}.</math>
 
==Applications in probability and statistics==
The Prékopa–Leindler inequality is useful in the theory of [[Logarithmically concave function|log-concave distributions]], as it can be used to show that log-concavity is preserved by [[Marginal distribution|marginalization]] and [[Independence (probability)|independent]] summation of log-concave distributed random variables. Suppose that ''H(x,y)'' is a log-concave distribution for ''(x,y)'' ∈ '''R'''<sup>''m''</sup> × '''R'''<sup>''n''</sup>, so that by definition we have
 
{{NumBlk|:|<math>H \left( (1 - \lambda)(x_1,y_1) + \lambda (x_2,y_2) \right) \geq H(x_1,y_1)^{1 - \lambda}  H(x_2,y_2)^{\lambda},</math>|{{EquationRef|2}}}}
 
and let ''M(y)'' denote the marginal distribution obtained by integrating over ''x'':
 
:<math>M(y) = \int_{\mathbb{R}^{m}} H(x,y) dx.</math>
 
Let ''y<sub>1</sub>, y<sub>2</sub>'' ∈ '''R'''<sup>''n''</sup> and 0&nbsp;&lt;&nbsp;''λ''&nbsp;&lt;&nbsp;1 be given. Then equation ({{EquationNote|2}}) satisfies condition ({{EquationNote|1}}) with ''h(x) = H(x,(1-λ)y<sub>1</sub> + λy<sub>2</sub>)'',  ''f(x)'' = ''H(x,y<sub>1</sub>)'' and ''g(x)'' = ''H(x,y<sub>2</sub>)'', so the Prékopa–Leindler inequality applies. It can be written in terms of ''M'' as
 
:<math>M((1-\lambda) y_1 + \lambda y_2) \geq M(y_1)^{1-\lambda} M(y_2)^\lambda,</math>
 
which is the definition of log-concavity for ''M''.
 
To see how this implies the preservation of log-convexity by independent sums, suppose that ''X'' and ''Y'' are independent random variables with log-concave distribution. Since the product of two log-concave functions is log-concave, the joint distribution of ''(X,Y)'' is also log-concave. Log-concavity is preserved by affine changes of coordinates, so the distribution of ''(X+Y,X-Y)'' is log-concave as well. Since the distribution of ''X+Y'' is a marginal over the joint distribution of ''(X+Y,X-Y)'', we conclude that ''X+Y'' has a log-concave distribution.
 
==Notes==
<references/>
 
==References==
* {{cite journal
| last=Gardner
| first=Richard J.
| title=The Brunn–Minkowski inequality
| journal=[[Bulletin of the American Mathematical Society|Bull. Amer. Math. Soc.]] (N.S.)
| volume=39
| issue=3
| year=2002
| pages = pp. 355&ndash;405 (electronic)
| issn = 0273-0979
| url = http://www.ams.org/bull/2002-39-03/S0273-0979-02-00941-2/S0273-0979-02-00941-2.pdf
| doi=10.1090/S0273-0979-02-00941-2
}}
 
* {{ cite journal
| last=Prékopa
| first=András
| title=Logarithmic concave measures with application to stochastic programming
| journal=[[Acta Scientiarum Mathematicarum|Acta Sci. Math.]]
| volume=32
| year=1971
| pages=pp. 301–316
| url=http://rutcor.rutgers.edu/~prekopa/SCIENT1.pdf
}}
 
* {{ cite journal
| last=Prékopa
| first=András
| title=On logarithmic concave measures and functions
| journal=[[Acta Scientiarum Mathematicarum|Acta Sci. Math.]]
| volume=34
| year=1973
| pages=pp. 335–343
| url=http://rutcor.rutgers.edu/~prekopa/SCIENT2.pdf
}}
 
{{DEFAULTSORT:Prekopa-Leindler Inequality}}
[[Category:Geometric inequalities]]
[[Category:Integral geometry]]
[[Category:Real analysis]]
[[Category:Theorems in analysis]]

Revision as of 18:42, 18 February 2014

The title of the writer is Jayson. I am really fond of handwriting but I can't make it my profession really. For a whilst I've been in Alaska but I will have to transfer in a year or two. Credit authorising is how he makes money.

Have a look at my site - psychic love readings