Английская Википедия:Cauchy–Schwarz inequality

Содержание

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Шаблон:Short description The Cauchy–Schwarz inequality (also called Cauchy–Bunyakovsky–Schwarz inequality) is an upper bound on the inner product between two vectors in an inner product space in terms of the product of the vector norms. It is considered one of the most important and widely used inequalities in mathematics.

The inequality for sums was published by Шаблон:Harvs. The corresponding inequality for integrals was published by Шаблон:Harvs and Шаблон:Harvs. Schwarz gave the modern proof of the integral version.

Statement of the inequality

The Cauchy–Schwarz inequality states that for all vectors <math>\mathbf{u}</math> and <math>\mathbf{v}</math> of an inner product space

Шаблон:NumBlk where <math>\langle \cdot, \cdot \rangle</math> is the inner product. Examples of inner products include the real and complex dot product; see the examples in inner product. Every inner product gives rise to a Euclidean <math>l_2</math> norm, called the Шаблон:Em or [[inner product space#Norm|Шаблон:Em Шаблон:Em]], where the norm of a vector <math>\mathbf{u}</math> is denoted and defined by <math display="block">\|\mathbf{u}\| := \sqrt{\langle \mathbf{u}, \mathbf{u} \rangle},</math> where <math>\langle \mathbf{u}, \mathbf{u} \rangle</math> is always a non-negative real number (even if the inner product is complex-valued). By taking the square root of both sides of the above inequality, the Cauchy–Schwarz inequality can be written in its more familiar form:

Moreover, the two sides are equal if and only if <math>\mathbf{u}</math> and <math>\mathbf{v}</math> are linearly dependent.

Special cases

Sedrakyan's lemma - Positive real numbers

Sedrakyan's inequality, also called Bergström's inequality, Engel's form, the T2 lemma, or Titu's lemma, states that for real numbers <math>u_1, u_2, \dots, u_n</math> and positive real numbers <math>v_1, v_2, \dots, v_n</math>: <math display=block>\frac{\left(\sum_{i=1}^n u_i\right)^2 }{\sum_{i=1}^n v_i} \leq \sum_{i=1}^n \frac{u_i^2}{v_i} \quad \text{ or equivalently, } \quad \frac{\left(u_1 + u_2 + \cdots + u_n\right)^2}{v_1 + v_2 + \cdots + v_n} \leq \frac{u^2_1}{v_1} + \frac{u^2_2}{v_2} + \cdots + \frac{u^2_n}{v_n} .</math>

It is a direct consequence of the Cauchy–Schwarz inequality, obtained by using the dot product on <math>\R^n</math> upon substituting <math>u_i' = u_i / \sqrt{v_i}</math> and <math>v_i' = \sqrt{v_i}</math>. This form is especially helpful when the inequality involves fractions where the numerator is a perfect square.

Шаблон:Math - The plane

Файл:Cauchy-Schwarz inequation in Euclidean plane.gif

Cauchy-Schwarz inequality in a unit circle of the Euclidean plane

The real vector space <math>\R^2</math> denotes the 2-dimensional plane. It is also the 2-dimensional Euclidean space where the inner product is the dot product. If <math>\mathbf{u} = \left(u_1, u_2\right)</math> and <math>\mathbf{v} = \left(v_1, v_2\right)</math> then the Cauchy–Schwarz inequality becomes: <math display=block>\langle \mathbf{u}, \mathbf{v} \rangle^2 = (\|\mathbf{u}\| \|\mathbf{v}\| \cos \theta)^2 \leq \|\mathbf{u}\|^2 \|\mathbf{v}\|^2,</math> where <math>\theta</math> is the angle between <math>\mathbf{u}</math> and <math>\mathbf{v}</math>.

The form above is perhaps the easiest in which to understand the inequality, since the square of the cosine can be at most 1, which occurs when the vectors are in the same or opposite directions. It can also be restated in terms of the vector coordinates <math>u_1</math>, <math>u_2</math>, <math>v_1</math>, and <math>v_2</math> as <math display=block>\left(u_1 v_1 + u_2 v_2\right)^2 \leq \left(u_1^2 + u_2^2\right) \left(v_1^2 + v_2^2\right),</math> where equality holds if and only if the vector <math>\left(u_1, u_2\right)</math> is in the same or opposite direction as the vector <math>\left(v_1, v_2\right)</math>, or if one of them is the zero vector.

Шаблон:AnchorШаблон:Math - n-dimensional Euclidean space

Шаблон:AnchorIn Euclidean space <math>\R^n</math> with the standard inner product, which is the dot product, the Cauchy–Schwarz inequality becomes: <math display=block>\left(\sum_{i=1}^n u_i v_i\right)^2 \leq \left(\sum_{i=1}^n u_i^2\right) \left(\sum_{i=1}^n v_i^2\right).</math>

The Cauchy–Schwarz inequality can be proved using only elementary algebra in this case by observing that the difference of the right and the left hand side is <math> \frac{1}{2} \sum_{i,j=1,\ldots,n} (u_i v_j - u_j v_i)^2 \ge 0</math>

or by considering the following quadratic polynomial in <math>x</math> <math display=block> \left(u_1 x + v_1\right)^2 + \cdots + \left(u_n x + v_n\right)^2 = \left(\sum_i u_i^2\right) x^2 + 2 \left(\sum_i u_i v_i\right) x + \sum_i v_i^2.</math>

Since the latter polynomial is nonnegative, it has at most one real root, hence its discriminant is less than or equal to zero. That is, <math display=block>\left(\sum_i u_i v_i\right)^2 - \left(\sum_i {u_i^2}\right) \left(\sum_i {v_i^2}\right) \leq 0.</math>

Шаблон:Math - n-dimensional Complex space

If <math>\mathbf{u}, \mathbf{v} \in \Complex^n</math> with <math>\mathbf{u} = \left(u_1, \ldots, u_n\right)</math> and <math>\mathbf{v} = \left(v_1, \ldots, v_n\right)</math> (where <math>u_1, \ldots, u_n \in \Complex</math> and <math>v_1, \ldots, v_n \in \Complex</math>) and if the inner product on the vector space <math>\Complex^n</math> is the canonical complex inner product (defined by <math>\langle \mathbf{u}, \mathbf{v} \rangle := u_1 \overline{v_1} + \cdots + u_{n} \overline{v_n},</math> where the bar notation is used for complex conjugation), then the inequality may be restated more explicitly as follows: <math display=block>|\langle \mathbf{u}, \mathbf{v} \rangle|^2 = \left|\sum_{k=1}^n u_k\bar{v}_k\right|^2 \leq \langle \mathbf{u}, \mathbf{u} \rangle \langle \mathbf{v}, \mathbf{v} \rangle = \left(\sum_{k=1}^n u_k \bar{u}_k\right) \left(\sum_{k=1}^n v_k \bar{v}_k\right) = \sum_{j=1}^n \left|u_j\right|^2 \sum_{k=1}^n \left|v_k\right|^2.</math>

That is, <math display=block>\left|u_1 \bar{v}_1 + \cdots + u_n \bar{v}_n\right|^2 \leq \left(\left|u_1\right|^2 + \cdots + \left|u_n\right|^2\right) \left(\left|v_1\right|^2 + \cdots + \left|v_n\right|^2\right).</math>

Шаблон:Math

For the inner product space of square-integrable complex-valued functions, the following inequality: <math display=block>\left|\int_{\R^n} f(x) \overline{g(x)}\,dx\right|^2 \leq \int_{\R^n} |f(x)|^2\,dx \int_{\R^n} |g(x)|^2 \,dx.</math>

The Hölder inequality is a generalization of this.

Applications

Analysis

In any inner product space, the triangle inequality is a consequence of the Cauchy–Schwarz inequality, as is now shown: <math display="block">\begin{alignat}{4} \|\mathbf{u} + \mathbf{v}\|^2 &= \langle \mathbf{u} + \mathbf{v}, \mathbf{u} + \mathbf{v} \rangle && \\ &= \|\mathbf{u}\|^2 + \langle \mathbf{u}, \mathbf{v} \rangle + \langle \mathbf{v}, \mathbf{u} \rangle + \|\mathbf{v}\|^2 ~ && ~ \text{ where } \langle \mathbf{v}, \mathbf{u} \rangle = \overline{\langle \mathbf{u}, \mathbf{v} \rangle} \\ &= \|\mathbf{u}\|^2 + 2 \operatorname{Re} \langle \mathbf{u}, \mathbf{v} \rangle + \|\mathbf{v}\|^2 && \\ &\leq \|\mathbf{u}\|^2 + 2|\langle \mathbf{u}, \mathbf{v} \rangle| + \|\mathbf{v}\|^2 && \\ &\leq \|\mathbf{u}\|^2 + 2\|\mathbf{u}\|\|\mathbf{v}\| + \|\mathbf{v}\|^2 ~ && ~ \text{ using CS}\\ &=(\|\mathbf{u}\| + \|\mathbf{v}\|)^2. && \end{alignat}</math>

Taking square roots gives the triangle inequality: <math display=block>\|\mathbf{u} + \mathbf{v}\| \leq \|\mathbf{u}\| + \|\mathbf{v}\|.</math>

The Cauchy–Schwarz inequality is used to prove that the inner product is a continuous function with respect to the topology induced by the inner product itself.

Geometry

The Cauchy–Schwarz inequality allows one to extend the notion of "angle between two vectors" to any real inner-product space by defining: <math display=block>\cos\theta_{\mathbf{u} \mathbf{v}} = \frac{\langle \mathbf{u}, \mathbf{v} \rangle}{\|\mathbf{u}\| \|\mathbf{v}\|}.</math>

The Cauchy–Schwarz inequality proves that this definition is sensible, by showing that the right-hand side lies in the interval Шаблон:Math and justifies the notion that (real) Hilbert spaces are simply generalizations of the Euclidean space. It can also be used to define an angle in complex inner-product spaces, by taking the absolute value or the real part of the right-hand side, as is done when extracting a metric from quantum fidelity.

Probability theory

Let <math>X</math> and <math>Y</math> be random variables, then the covariance inequality is given by: <math display=block>\operatorname{Var}(X) \geq \frac{\operatorname{Cov}(X, Y)^2}{\operatorname{Var}(Y)}.</math>

After defining an inner product on the set of random variables using the expectation of their product, <math display=block>\langle X, Y \rangle := \operatorname{E}(X Y),</math> the Cauchy–Schwarz inequality becomes <math display=block>|\operatorname{E}(XY)|^2 \leq \operatorname{E}(X^2) \operatorname{E}(Y^2).</math>

To prove the covariance inequality using the Cauchy–Schwarz inequality, let <math>\mu = \operatorname{E}(X)</math> and <math>\nu = \operatorname{E}(Y),</math> then <math display=block>\begin{align} |\operatorname{Cov}(X, Y)|^2 &= |\operatorname{E}((X - \mu)(Y - \nu))|^2 \\ &= |\langle X - \mu, Y - \nu \rangle |^2\\ &\leq \langle X - \mu, X - \mu \rangle \langle Y - \nu, Y - \nu \rangle \\ & = \operatorname{E}\left((X - \mu)^2\right) \operatorname{E}\left((Y - \nu)^2\right) \\ & = \operatorname{Var}(X) \operatorname{Var}(Y), \end{align}</math> where <math>\operatorname{Var}</math> denotes variance and <math>\operatorname{Cov}</math> denotes covariance.

Proofs

There are many different proofs of the Cauchy–Schwarz inequality other than those given below. When consulting other sources, there are often two sources of confusion. First, some authors define Шаблон:Math to be linear in the second argument rather than the first. Second, some proofs are only valid when the field is <math>\mathbb R</math> and not <math>\mathbb C.</math>

This section gives proofs of the following theorem:

In all of the proofs given below, the proof in the trivial case where at least one of the vectors is zero (or equivalently, in the case where <math>\|\mathbf{u}\|\|\mathbf{v}\|= 0</math>) is the same. It is presented immediately below only once to reduce repetition. It also includes the easy part of the proof of the Equality Characterization given above; that is, it proves that if <math>\mathbf{u}</math> and <math>\mathbf{v}</math> are linearly dependent then <math>\left|\langle \mathbf{u}, \mathbf{v} \rangle\right| = \|\mathbf{u}\| \|\mathbf{v}\|.</math>

Шаблон:Collapse top By definition, <math>\mathbf{u}</math> and <math>\mathbf{v}</math> are linearly dependent if and only if one is a scalar multiple of the other. If <math>\mathbf{u} = c \mathbf{v}</math> where <math>c</math> is some scalar then <math display=block>|\langle \mathbf{u}, \mathbf{v} \rangle| = |\langle c \mathbf{v}, \mathbf{v} \rangle| = |c \langle \mathbf{v}, \mathbf{v} \rangle| = |c|\|\mathbf{v}\| \|\mathbf{v}\| =\|c \mathbf{v}\| \|\mathbf{v}\| =\|\mathbf{u}\| \|\mathbf{v}\|</math>

which shows that equality holds in the Шаблон:EquationNote. The case where <math>\mathbf{v} = c \mathbf{u}</math> for some scalar <math>c</math> is very similar, with the main difference between the complex conjugation of <math>c:</math> <math display=block>|\langle \mathbf{u}, \mathbf{v} \rangle| = |\langle \mathbf{u}, c \mathbf{u} \rangle| = \left|\overline{c} \langle \mathbf{u}, \mathbf{u} \rangle\right| = \left|\overline{c}\right| \|\mathbf{u}\| \|\mathbf{u}\| = |c| \|\mathbf{u}\| \|\mathbf{u}\| =\|\mathbf{u}\| \|c \mathbf{u}\| =\|\mathbf{u}\| \|\mathbf{v}\|.</math>

If at least one of <math>\mathbf{u}</math> and <math>\mathbf{v}</math> is the zero vector then <math>\mathbf{u}</math> and <math>\mathbf{v}</math> are necessarily linearly dependent (just scalar multiply the non-zero vector by the number <math>0</math> to get the zero vector; for example, if <math>\mathbf{u} = \mathbf{0}</math> then let <math>c = 0</math> so that <math>\mathbf{u} = c \mathbf{v}</math>), which proves the converse of this characterization in this special case; that is, this shows that if at least one of <math>\mathbf{u}</math> and <math>\mathbf{v}</math> is <math>\mathbf{0}</math> then the Equality Characterization holds.

If <math>\mathbf{u} = \mathbf{0},</math> which happens if and only if <math>\|\mathbf{u}\|= 0,</math> then <math>\|\mathbf{u}\| \|\mathbf{v}\| = 0</math> and <math>|\langle \mathbf{u}, \mathbf{v} \rangle| = |\langle \mathbf{0}, \mathbf{v} \rangle| = |0| = 0</math> so that in particular, the Cauchy–Schwarz inequality holds because both sides of it are <math>0.</math> The proof in the case of <math>\mathbf{v} = \mathbf{0}</math> is identical. Шаблон:Collapse bottom

Consequently, the Cauchy–Schwarz inequality only needs to be proven only for non-zero vectors and also only the non-trivial direction of the Equality Characterization must be shown.

Proof 1

The special case of <math>\mathbf{v} = \mathbf{0}</math> was proven above so it is henceforth assumed that <math>\mathbf{v} \neq \mathbf{0}.</math> The Cauchy–Schwarz Шаблон:Emequality (and the rest of the theorem) is an almost immediate corollary of the following Шаблон:Em:Шаблон:Sfn

Equality Шаблон:EquationRef is readily verified by elementarily expanding <math>\left\|\|\mathbf{v}\|^2 \mathbf{u} - \langle \mathbf{u}, \mathbf{v} \rangle \mathbf{v}\right\|^2</math> (via the definition of the norm) and then simplifying:

This expansion does not require <math>\mathbf{v}</math> to be non-zero; however, <math>\mathbf{v}</math> must be non-zero in order to divide both sides by <math>\|\mathbf{v}\|^2</math> and to deduce the Cauchy–Schwarz inequality from it. Swapping <math>\mathbf{u}</math> and <math>\mathbf{v}</math> gives rise to: <math display=block>\left\|\|\mathbf{u}\|^2 \mathbf{v} - \overline{\langle \mathbf{u}, \mathbf{v} \rangle} \mathbf{u}\right\|^2 ~=~ \|\mathbf{u}\|^2 \left[\|\mathbf{u}\|^2\|\mathbf{v}\|^2 - |\langle \mathbf{u}, \mathbf{v} \rangle|^2\right]</math> and thus <math display=block>\begin{alignat}{4} \|\mathbf{u}\|^2\|\mathbf{v}\|^2 \left[\|\mathbf{u}\|^2 \|\mathbf{v}\|^2 - |\langle \mathbf{u}, \mathbf{v} \rangle|^2\right] ~&=~ \|\mathbf{u}\|^2 \left\|\|\mathbf{v}\|^2 \mathbf{u} - \langle \mathbf{u}, \mathbf{v} \rangle \mathbf{v}\right\|^2 \\ ~&=~ \|\mathbf{v}\|^2 \left\|\|\mathbf{u}\|^2 \mathbf{v} - \overline{\langle \mathbf{u}, \mathbf{v} \rangle} \mathbf{u}\right\|^2. \\ \end{alignat} </math>

Proof 2

The special case of <math>\mathbf{v} = \mathbf{0}</math> was proven above so it is henceforth assumed that <math>\mathbf{v} \neq \mathbf{0}.</math> Let <math display=block>\mathbf{z} := \mathbf{u} - \frac {\langle \mathbf{u}, \mathbf{v} \rangle} {\langle \mathbf{v}, \mathbf{v} \rangle} \mathbf{v}.</math>

It follows from the linearity of the inner product in its first argument that: <math display=block>\langle \mathbf{z}, \mathbf{v} \rangle = \left\langle \mathbf{u} - \frac{\langle \mathbf{u}, \mathbf{v} \rangle} {\langle \mathbf{v}, \mathbf{v} \rangle} \mathbf{v}, \mathbf{v} \right\rangle = \langle \mathbf{u}, \mathbf{v} \rangle - \frac{\langle \mathbf{u}, \mathbf{v} \rangle} {\langle \mathbf{v}, \mathbf{v} \rangle} \langle \mathbf{v}, \mathbf{v} \rangle = 0.</math>

Therefore, <math>\mathbf{z}</math> is a vector orthogonal to the vector <math>\mathbf{v}</math> (Indeed, <math>\mathbf{z}</math> is the projection of <math>\mathbf{u}</math> onto the plane orthogonal to <math>\mathbf{v}.</math>) We can thus apply the Pythagorean theorem to <math display=block>\mathbf{u}= \frac{\langle \mathbf{u}, \mathbf{v} \rangle} {\langle \mathbf{v}, \mathbf{v} \rangle} \mathbf{v} + \mathbf{z}</math> which gives <math display=block>\|\mathbf{u}\|^2 = \left|\frac{\langle \mathbf{u}, \mathbf{v} \rangle}{\langle \mathbf{v}, \mathbf{v} \rangle}\right|^2 \|\mathbf{v}\|^2 + \|\mathbf{z}\|^2 = \frac{|\langle \mathbf{u}, \mathbf{v} \rangle|^2}{(\|\mathbf{v}\|^2 )^2} \,\|\mathbf{v}\|^2 + \|\mathbf{z}\|^2 = \frac{|\langle \mathbf{u}, \mathbf{v} \rangle|^2}{\|\mathbf{v}\|^2} + \|\mathbf{z}\|^2 \geq \frac{|\langle \mathbf{u}, \mathbf{v} \rangle|^2}{\|\mathbf{v}\|^2}.</math>

The Cauchy–Schwarz inequality follows by multiplying by <math>\|\mathbf{v}\|^2</math> and then taking the square root. Moreover, if the relation <math>\geq</math> in the above expression is actually an equality, then <math>\|\mathbf{z}\|^2 = 0</math> and hence <math>\mathbf{z} = \mathbf{0};</math> the definition of <math>\mathbf{z}</math> then establishes a relation of linear dependence between <math>\mathbf{u}</math> and <math>\mathbf{v}.</math> The converse was proved at the beginning of this section, so the proof is complete. <math>\blacksquare</math>

Proof for real inner products

Let <math>(V, \langle \cdot, \cdot \rangle)</math> be a real inner product space. Consider an arbitrary pair <math>\mathbf{u}, \mathbf{v} \in V</math> and the function <math>p : \R \to \R</math> defined by <math>p(t) = \langle t\mathbf{u} + \mathbf{v}, t\mathbf{u} + \mathbf{v}\rangle.</math> Since the inner product is positive-definite, <math>p(t)</math> only takes non-negative values. On the other hand, <math>p(t)</math> can be expanded using the bilinearity of the inner product and using the fact that <math>\langle \mathbf{u}, \mathbf{v} \rangle = \langle \mathbf{v}, \mathbf{u} \rangle</math> for real inner products: <math display=block>p(t) = \Vert \mathbf{u} \Vert^2 t^2 + t \left[\langle \mathbf{u}, \mathbf{v} \rangle + \langle \mathbf{v}, \mathbf{u} \rangle\right] + \Vert \mathbf{v} \Vert^2 = \Vert \mathbf{u} \Vert^2 t^2 + 2t \langle \mathbf{u}, \mathbf{v} \rangle + \Vert \mathbf{v} \Vert^2.</math> Thus, <math>p</math> is a polynomial of degree <math>2</math> (unless <math>u = 0,</math> which is a case that can be independently verified). Since the sign of <math>p</math> does not change, the discriminant of this polynomial must be non-positive: <math display=block>\Delta = 4 \left(\langle \mathbf{u}, \mathbf{v} \rangle ^2 - \Vert \mathbf{u} \Vert^2 \Vert \mathbf{v} \Vert^2\right) \leqslant 0.</math> The conclusion follows.

For the equality case, notice that <math>\Delta = 0</math> happens if and only if <math>p(t) = (t\Vert \mathbf{u} \Vert + \Vert \mathbf{v} \Vert)^2.</math> If <math>t_0 = -\Vert \mathbf{v} \Vert / \Vert \mathbf{u} \Vert,</math> then <math>p(t_0) = \langle t_0\mathbf{u} + \mathbf{v},t_0\mathbf{u} + \mathbf{v}\rangle = 0,</math> and hence <math>\mathbf{v} = -t_0\mathbf{u}.</math>

This proof can be generalized to complex inner products by instead considering <math>p(t) = \langle t\alpha\mathbf{u} + \mathbf{v}, t\alpha\mathbf{u} + \mathbf{v} \rangle</math> where <math>\alpha</math> is a complex number satisfying <math>|\alpha| = 1</math> and <math>\alpha\langle\mathbf{u}, \mathbf{v}\rangle = |\langle\mathbf{u}, \mathbf{v}\rangle|</math>.

Proof for the dot product

The Cauchy–Schwarz inequality in the case where the inner product is the dot product on <math>\R^n</math> is now proven. The Cauchy–Schwarz inequality may be rewritten as <math>\left|\mathbf{a} \cdot \mathbf{b}\right|^2 \leq \left\|\mathbf{a}\right\|^2 \, \left\|\mathbf{b}\right\|^2</math> or equivalently, <math>\left(\mathbf{a} \cdot \mathbf{b}\right)^2 \leq \left(\mathbf{a} \cdot \mathbf{a}\right) \, \left(\mathbf{b} \cdot \mathbf{b}\right)</math> for <math>\mathbf{a} := \left(a_1, \ldots, a_n\right), \mathbf{b} := \left(b_1, \ldots, b_n\right) \in \R^n,</math> which expands to: <math display=block>\left(a_1^2 + a_2^2 + \cdots + a_n^2\right) \left(b_1^2 + b_2^2 + \cdots + b_n^2\right) \geq \left(a_1b_1 + a_2b_2 + \cdots + a_nb_n\right)^2.</math>

To simplify, let <math display=block>\begin{align} A &= a_1^2 + a_2^2 + \cdots + a_n^2, \\ B &= b_1^2 + b_2^2 + \cdots + b_n^2 \\ D &= a_1 b_1 + a_2 b_2 + \cdots + a_n b_n \\\end{align}</math> so that the statement that remains to be to proven can be written as <math>A B \geq D^2,</math> which can be rearranged to <math>D^2 - A B \leq 0.</math> The discriminant of the quadratic equation <math>A x^2 + 2 D x + B</math> is <math>4 D^2 - 4 A B.</math>

Therefore, to complete the proof it is sufficient to prove that this quadratic either has no real roots or exactly one real root, because this will imply: <math display=block>4 \left(D^2 - A B\right) \leq 0.</math>

Substituting the values of <math>A, B, D</math> into <math>A x^2 + 2 D x + B</math> gives: <math display=block>\begin{alignat}{4} A x^2 + 2 D x + B &= \left(a_1^2 + a_2^2 + \cdots + a_n^2\right) x^2 + 2 \left(a_1 b_1 + a_2 b_2 + \cdots + a_n b_n\right) x + \left(b_1^2 + b_2^2 + \cdots + b_n^2\right) \\ &= \left(a_1^2 x^2 + 2a_1 b_1 x + b_1^2\right) + \left(a_2^2 x^2 + 2a_2 b_2 x + b_2^2\right) + \cdots + \left(a_n^2 x^2 + 2a_n b_n x + b_n^2\right) \\ &= \left(a_1x + b_1\right)^2 + \left(a_2 x + b_2\right)^2 + \cdots + \left(a_n x + b_n\right)^2 \\ &\geq 0 \end{alignat}</math> which is a sum of terms that are each <math>\,\geq 0\,</math> by the trivial inequality: <math>r^2 \geq 0</math> for all <math>r \in \R.</math> This proves the inequality and so to finish the proof, it remains to show that equality is achievable. The equality <math>a_i x = - b_i</math> is the equality case for Cauchy–Schwarz after inspecting <math display=block>\left(a_1 x + b_1\right)^2 + \left(a_2 x + b_2\right)^2 + \cdots + \left(a_n x + b_n\right)^2 \geq 0,</math> which proves that equality is achievable. <math>\blacksquare</math>

Generalizations

Various generalizations of the Cauchy–Schwarz inequality exist. Hölder's inequality generalizes it to <math>L^p</math> norms. More generally, it can be interpreted as a special case of the definition of the norm of a linear operator on a Banach space (Namely, when the space is a Hilbert space). Further generalizations are in the context of operator theory, e.g. for operator-convex functions and operator algebras, where the domain and/or range are replaced by a C*-algebra or W*-algebra.

An inner product can be used to define a positive linear functional. For example, given a Hilbert space <math>L^2(m), m</math> being a finite measure, the standard inner product gives rise to a positive functional <math>\varphi</math> by <math>\varphi (g) = \langle g, 1 \rangle.</math> Conversely, every positive linear functional <math>\varphi</math> on <math>L^2(m)</math> can be used to define an inner product <math>\langle f, g \rangle _\varphi := \varphi\left(g^* f\right),</math> where <math>g^*</math> is the pointwise complex conjugate of <math>g.</math> In this language, the Cauchy–Schwarz inequality becomes <math display=block>\left|\varphi\left(g^* f\right)\right|^2 \leq \varphi\left(f^* f\right) \varphi\left(g^* g\right),</math>

which extends verbatim to positive functionals on C*-algebras:

The next two theorems are further examples in operator algebra.

This extends the fact <math>\varphi\left(a^*a\right) \cdot 1 \geq \varphi(a)^* \varphi(a) = |\varphi(a)|^2,</math> when <math>\varphi</math> is a linear functional. The case when <math>a</math> is self-adjoint, that is, <math>a = a^*,</math> is sometimes known as Kadison's inequality.

Another generalization is a refinement obtained by interpolating between both sides of the Cauchy–Schwarz inequality:

This theorem can be deduced from Hölder's inequality. There are also non-commutative versions for operators and tensor products of matrices.

Several matrix versions of the Cauchy–Schwarz inequality and Kantorovich inequality are applied to linear regression models.

See also

• Шаблон:Annotated link
• Шаблон:Annotated link
• Шаблон:Annotated link
• Шаблон:Annotated link
• Шаблон:Annotated link
• Шаблон:Annotated link
• Шаблон:Annotated link

References

• Шаблон:Citation
• Шаблон:Citation
• Шаблон:Citation
• Шаблон:Citation
• Шаблон:Citation
• Шаблон:Halmos A Hilbert Space Problem Book 1982
• Шаблон:Citation.
• Шаблон:Citation
• Шаблон:Citation.
• Шаблон:Citation
• Шаблон:Springer
• Шаблон:Citation

External links

• Earliest Uses: The entry on the Cauchy–Schwarz inequality has some historical information.
• Example of application of Cauchy–Schwarz inequality to determine Linearly Independent Vectors Tutorial and Interactive program.