In a complex vector space, the definition of inner product is slightly different from the real case:
Let be a complex vector space. An inner product on is a function that assigns to every pair of vectors , from a complex number in such a way that the following three conditions are satisfied:
- linearity in the first argument: is linear in ,
- Hermiticity: for all , where indicates the complex conjugate of a complex number ,
- positive definiteness: for all ; moreover, if then .
A complex vector space with an inner product is often referred to as a (complex) inner product space.
The length of a vector is given by (as in the real case).
Also, the distance between and is given by the same formula as in the real case: .
A complex inner product is also known as a Hermitian inner product (after the mathematician Hermite). Because of Hermiticity, , so is real for all . Therefore the inequality of the positive definiteness makes sense.
Each complex-valued map with two arguments and from the -dimensional vector space which is linear in the first argument, and Hermitian (that is, satisfies the Hermiticity rule), is of the form This map is an inner product on if and only if .
On we can define an inner product in many ways. The most common is the standard inner product of and :
If we restrict this inner product to , then the complex conjugation is no longer needed and we get the standard inner product on .
We verify that the standard inner product satisfies the conditions on the inner product. Linearity in the first argument and positive definiteness can be proved just as in the real case. We establish Hermiticity by the following chain of equalities for :
Let be the set of complex-valued continuous functions defined on a real interval . Here, complex-valued means that the values of lie in and continuous means that each of the two compositions (the real part of ) and (the imaginary part of ) is a continuous function . Then with the usual pointwise addition and scalar multiplication is a vector space. Take and define
The verification that this defines an inner product on is easy, except for the second part of positive definiteness. Here is a proof of it. Take and suppose that for a number in . Then there is an interval of positive length around within such that for all in that interval. Then
So if , then for all .
An important example is the subspace of the inner product space of complex functions defined on spanned by the functions for defined by
If then we have because Also,
so
These functions are at the core of the complex Fourier theory.
The complex dot product is not bilinear. It is linear in the first argument, but semi-linear or half-linear in the second argument; that is, . Here is a derivation of this property:
We conclude that the complex dot product is linear in the first argument and non-linear but half-linear (namely, up to a complex conjugation) in the second argument. Therefore, the complex inner product is referred to as one-and-a-half-linear.
The concept of angle in the complex case is a lot more complicated than in the real case. We will not deal with it in this course.
The Cauchy-Schwarz inequality known for real inner product spaces reads as follows in the complex case.
In a complex inner product space we have, for all vectors ,
This inequality is an equality if and only if and are linearly dependent.
The proof of the Cauchy-Schwarz inequality in the complex case is slightly more complicated than in the real case.
If , then it follows from the linearity of the inner product in the first argument that for all . In particular, , so . Hence the Cauchy-Schwarz inequality holds with the equality sign. This proves the rule in case because and are linearly dependent.
Now assume that and let . Write for the complex argument of and for . Then we have
For we define
Caclulations with show that it is a quadratic function in : In particular, is a quadratic polynomial in with real coefficients (recall from above that is real) and satisfies for each . Since this real function is never negative, the discriminant must be less than or equal to zero:
After dividing by and moving the second term to the right, we find . Because the values at both sides are never negative, this is equivalent to
where is the absolute value of a complex number . We conclude
We end by establishing that the Cauchy-Schwarz inequality is an equality if and only if and are linearly dependent. The two vectors and are linearly dependent if and only if at least one of the two is the zero vector or both are nonzero and there is a complex scalar such that .
If at least one of the two is the zero vector, both sides of the Cauchy-Schwarz inequality are zero, and so the inequality is an equality. Conversely, if both sides of the inequality are zero, then in particular the right-hand side equals zero. This means that or , which implies or , and so and are linearly dependent. This establishes that the right-hand side of the inequality is zero if and only if at least one of the two vectors is equal to .
Therefore, for the remainder of the proof we will assume that and are nonzero vectors. If they are linearly dependent, then there is a complex scalar such that , and so so equality holds in the Cauchy-Schwartz inequality. Conversely, if equality holds, then the inequality sign in the above deduction of the inequality must be an equality sign: . This means that the discriminant of the real quadratic function is equal to zero, so has a zero. Let be a solution of . Then , and so . We have shown that and are linearly dependent. This concludes the proof of the statement about equality in the Cauchy-Schwartz inequality.
An interesting consequence of the Cauchy-Schwarz inequality is the following fact: let and be sequences of complex numbers. Then the following inequality holds:
Consider the inner product space with standard inproduct.
Determine the inner product of the vectors