In take and . Which multiple of can be subtracted from so that the remainder is orthogonal to ? It is , which equals when the inner product is conjugate-linear in its first argument, and the remainder is . That single subtraction proves the Cauchy-Schwarz inequality, drives the complex Gram-Schmidt process, and explains how orthonormal coefficients account for squared length. Throughout, is an inner product space over , either or , with linear in and conjugate-linear in , and a tuple such as stands for a column vector.
Key terms
Cauchy-Schwarz inequality
Definition For all vectors and in an inner product space over ,
No dimension bound is needed. If , both sides are . If , write and , which is positive by positive definiteness. Set and . Then , and expanding with gives
because the products , and all equal . Since , multiplying by gives , and taking nonnegative square roots gives the inequality. The coefficient must be with in the first slot. Its conjugate would generally leave a remainder that is not orthogonal to .
In plain words The inner product of two vectors is never larger in size than the product of their lengths. The proof removes from its component along , and what is left has a squared length that cannot be negative.
Example For and we have and , so and . Then and , which matches . The squared inequality reads . The conjugated coefficient would leave a remainder whose inner product with is . Positivity matters too. For the indefinite form with matrix , the vector pairs with itself to give and with to give , so a bound by the two self pairings would claim .
Equality case of Cauchy-Schwarz
Definition For vectors and in an inner product space over ,
holds if and only if and are linearly dependent over . If , both sides are and the pair is dependent. If , equality means in the proof above, and positive definiteness turns this into , that is with . Conversely, if and the pair is dependent, then for some scalar , and .
In plain words The bound is reached exactly when one vector is a scalar multiple of the other. Over the scalars are complex, so a vector and its rotated copy count as dependent.
Example For and , the inner product is , whose absolute value equals . Equality holds although is not a real multiple of . For the opening pair the squared inequality is strict, matching the nonzero remainder of squared norm , so is not a complex multiple of .
Triangle inequality
Definition For all vectors and in an inner product space over ,
Using and then Cauchy-Schwarz,
and both sides of the inequality are nonnegative, so square roots may be taken. Equality forces both steps to be equalities, so the pair is dependent and is a nonnegative real number. This happens exactly when one of the vectors is a nonnegative real multiple of the other. Together with and positivity, this shows that is a norm, and the distance satisfies .
In plain words One side of a triangle is never longer than the other two together. Equality here asks for more than equality in Cauchy-Schwarz, because the vectors must point the same way, not merely lie on a common line. Over the line through is a complex line, which also contains rotated copies such as .
Example Take . The vector gives equality, since . The vector gives equality in Cauchy-Schwarz, yet has norm , which is strictly less than .
Complex Gram-Schmidt process
Definition Let be linearly independent vectors in an inner product space over . Set and, for ,
Then is orthonormal, meaning is for and otherwise, and for every . Each is orthogonal to every earlier , because linearity in the second slot and the orthonormality of give . Each is nonzero, since would put in . Rearranging the subtraction writes as a combination of , which keeps the spans equal at each step. If the inputs are dependent, the first input that lies in the span of the earlier ones leaves a zero remainder, or is zero itself when it is . That zero signals the dependence, and it cannot be normalized. Applied to any basis, the process shows that every finite-dimensional inner product space has an orthonormal basis.
In plain words Take the vectors in order. From each one remove its components along the directions already built, then rescale what is left to length . The only change from the real process is that the coefficient is , with the earlier direction in the first slot.
Example Take and in . Then and , so
This is the remainder from the opening. Its norm is , so , and . Rearranged, .
Orthonormal expansion and Parseval’s identity
Definition Let be an orthonormal basis of a finite-dimensional inner product space over . Every has the orthonormal expansion
Indeed, if , pairing with in the first slot removes every term except the th, so . For any finite orthonormal list and any scalars , the cross terms with vanish, which gives the Pythagorean identity
Applied to the expansion of , it gives Parseval’s identity
and the same expansion gives for all . The coefficient is . The reversed pairing is its conjugate.
In plain words In an orthonormal basis each coordinate is a single inner product, with no system to solve. The squared length is the sum of the squared sizes of those coordinates, just as in the standard basis.
Example Use the basis , found above and . The coefficients are
Their squared sizes are and , which add to . The phases check out as well, since and add to .
Bessel’s inequality
Definition Let be a finite orthonormal list in an inner product space over , not necessarily a basis. For every ,
with equality if and only if . To prove it, let and . Then for every , so and
Equality means , so lies in the span. Conversely, a vector in the span equals its own expansion, so . When the list is an orthonormal basis of a finite-dimensional , every lies in the span and Bessel’s inequality becomes Parseval’s identity.
In plain words An incomplete orthonormal list may see only part of a vector. The squared coefficients it reads off add up to at most the full squared length, and the shortfall is exactly the squared length of the part the list cannot see.
Example In with and , the sum of squared coefficients is while . In take , and . The coefficients are and , so the left side is . Here and , and is the missing amount.
Check yourself
- In let and . Check the Cauchy-Schwarz inequality, decide whether it is strict, and verify that with has .
Show the answer
The inner product is , with . The squared norms are and , so the squared inequality reads , that is . It is strict, so the vectors are independent. The coefficient is and
Its squared norm is , which equals . As a further check, .
- Apply the complex Gram-Schmidt process to and in .
Show the answer
First , so . Next , so and
Its squared norm is , so
Check that . With the reversed coefficient the remainder would be , whose inner product with is , so it is not orthogonal.
- With , and , a student takes the coefficients to be . The squared sizes still add to . Is the expansion correct?
Show the answer
No. The student’s coefficients are and , the conjugates of the correct ones. Conjugation does not change absolute values, so the Parseval sum is still . Rebuilding the vector exposes the error,
which is not . The correct coefficients are , namely and . A Parseval check alone cannot catch a conjugation mistake.