Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "Minkowski Inequality"
 
(10 intermediate revisions by 5 users not shown)
Line 1: Line 1:
−
Minkowski Inequality states:
+
The '''Minkowski Inequality''' states that if <math>r>s</math> are nonzero real numbers, then for any positive numbers <math>a_{ij}</math> the following holds:
 +
<math>\left(\sum_{j=1}^{m}\left(\sum_{i=1}^{n}a_{ij}^r\right)^{s/r}\right)^{1/s}\geq \left(\sum_{i=1}^{n}\left(\sum_{j=1}^{m}a_{ij}^s\right)^{r/s}\right)^{1/r}</math>
  
−
Let <math>r>s</math> be a nonzero real number, then for any positive numbers <math>a_{ij}</math>, the following inequality holds:
+
Notice that if either <math>r</math> or <math>s</math> is zero, the inequality is equivalent to [[Hölder's Inequality]].
  
−
<math>(\sum_{j=1}^{m}(\sum_{i=1}^{n}a_{ij}^r)^{s/r})^{1/s}\geq (\sum_{i=1}^{n}(\sum_{j=1}^{m}a_{ij}^s)^{r/s})^{1/r}</math>
+
== Equivalence with the standard form ==
  
−
Notice that if one of <math>r,s</math> is zero, the inequality is equivelant to [[Holder's Inequality]].
+
For <math>r>s>0</math>, putting <math>x_{ij}:=a_{ij}^s</math> and <math>p:=\frac rs>1</math>, the symmetrical form given above becomes
  
 +
<center><math> \sum_{j=1}^{m}\biggl(\sum_{i=1}^{n}x_{ij}^p\biggr)^{1/p}
 +
\geq\left(\sum_{i=1}^{n}\biggl(\sum_{j=1}^{m}x_{ij}\biggr)^p\right)^{1/p}</math>.</center>
 +
 +
Putting <math>m=2</math> and <math>a_i:=x_{i1},b_i:=x_{i2}</math>, we get the form in which the Minkowski Inequality is given most often:
 +
 +
<center><math>\biggl(\sum_{i=1}^{n}a_i^p\biggr)^{1/p}+ \biggl(\sum_{i=1}^{n}b_i^p\biggr)^{1/p}
 +
\geq\left(\sum_{i=1}^{n}\Bigl(a_i+b_i\Bigr)^p\right)^{1/p}</math></center>
 +
 +
As the latter can be iterated, there is no loss of generality by putting <math>m=2</math>.
 +
 +
== Problems ==
 +
* [http://www.artofproblemsolving.com/Forum/viewtopic.php?p=432791#432791 AIME 1991 Problem 15]
  
−
{{wikify}}
 
 
{{stub}}
 
{{stub}}
  
−
[[Category:Definition]]
+
[[Category:Algebra]]
−
[[Category:Inequality]]
+
[[Category:Inequalities]]

Latest revision as of 15:49, 29 December 2021

The Minkowski Inequality states that if $r>s$ are nonzero real numbers, then for any positive numbers $a_{ij}$ the following holds: $\left(\sum_{j=1}^{m}\left(\sum_{i=1}^{n}a_{ij}^r\right)^{s/r}\right)^{1/s}\geq \left(\sum_{i=1}^{n}\left(\sum_{j=1}^{m}a_{ij}^s\right)^{r/s}\right)^{1/r}$

Notice that if either $r$ or $s$ is zero, the inequality is equivalent to Hölder's Inequality.

Equivalence with the standard form

For $r>s>0$, putting $x_{ij}:=a_{ij}^s$ and $p:=\frac rs>1$, the symmetrical form given above becomes

$\sum_{j=1}^{m}\biggl(\sum_{i=1}^{n}x_{ij}^p\biggr)^{1/p} \geq\left(\sum_{i=1}^{n}\biggl(\sum_{j=1}^{m}x_{ij}\biggr)^p\right)^{1/p}$.

Putting $m=2$ and $a_i:=x_{i1},b_i:=x_{i2}$, we get the form in which the Minkowski Inequality is given most often:

$\biggl(\sum_{i=1}^{n}a_i^p\biggr)^{1/p}+ \biggl(\sum_{i=1}^{n}b_i^p\biggr)^{1/p} \geq\left(\sum_{i=1}^{n}\Bigl(a_i+b_i\Bigr)^p\right)^{1/p}$

As the latter can be iterated, there is no loss of generality by putting $m=2$.

Problems

This article is a stub. Help us out by expanding it.

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Minkowski_Inequality&oldid=168869"