The hypothesis implies , since the zero vector is a scalar multiple of every vector. Set
Since is not a scalar multiple of , . Positive definiteness and bilinearity of the real inner product give
Multiplying by and taking square roots proves the strict Cauchy-Schwarz inequality
Since every real number satisfies , this proves, in particular,
The argument derives the required inequality directly from the inner product axioms.
Symmetry of the real inner product gives . Moreover, i with shows that
so the Gram matrix is a positive semidefinite matrix. To also check reality of every eigenvalue, allow a nonzero vector with . Since is a real symmetric matrix,
Here is the conjugate transpose, and cancels the imaginary part. Thus
because . This proves both that every eigenvalue is real and that it is nonnegative.
Bilinearity of the real inner product gives, for the specified linear combinations,
The last equality is the entrywise rule for matrix multiplication, with the transpose of the column vector .
Apply the divergence theorem to . The product rule gives
because the two gradient inner products cancel. Also . Thus
This is Green's second identity, under the usual regularity assumptions permitting these derivatives and boundary integrals.
The real spectral theorem states that a symmetric matrix has an orthonormal basis of real eigenvectors, and hence is a diagonalisable matrix. Here is a proof in this setting.
For , the quadratic form attains a maximum on the unit sphere, by compactness and the extreme value theorem. Choose a unit maximizer and put . For any , the Rayleigh quotient along has a maximum at , so
The last equality uses and . Thus is orthogonal to every , so .
The orthogonal complement is an invariant subspace, because for ,
The restriction of to is again symmetric with respect to the induced inner product. By mathematical induction on dimension, it has an orthonormal basis of eigenvectors; adjoining gives one for . If has those basis vectors as columns, then is a real diagonal matrix and .
Adding and subtracting the two coordinates shows that and . The normalized eigenvectors can therefore be chosen as
Their inner product is , and their squared norms are one, proving orthonormality. If , every nonzero vector is an eigenvector; this chosen orthonormal basis still works.
For and , the outer products are
Their inner product is zero and both squared norms are two. Thus and are orthogonal spectral projectors, with . Since and , the eigenvalues are , , and
Multiplying these decompositions uses and , , giving the identity matrix.
Expanding the determinant gives . Solving each eigenvalue equation yields
Their pairwise inner products are , and . Their squared Euclidean norms are , respectively, so division by gives an orthonormal basis. This also follows from the spectral theorem for real symmetric matrices: symmetry makes eigenvectors for distinct eigenvalues orthogonal.
By the vector triple product identity,
The last inner product vanishes by perpendicularity. Taking the inner product with gives
This is the identity for cross products with a common vector, and holds without nondegeneracy assumptions.
The standard Fourier series is
with Fourier coefficients
These follow by taking inner products with the individual basis vectors and using their orthogonality and squared norms.
With inner product , orthogonality means
The constant function has squared norm , and each sine or cosine has squared norm . Thus the displayed family is orthogonal but not normalized; these different lengths determine the coefficient factors.
Use the real inner product
Orthogonality means this integral is zero for any two distinct listed functions. The individual squared norms are positive: the constant function has squared norm , while every listed sine or cosine has squared norm . Thus they are orthogonal but not normalized to unit length in this inner product.
Take the inner product of the Fourier series with . Fourier orthogonality eliminates the constant, all cosine terms, and all sine terms except the th. The remaining squared norm is
so
For a square-integrable function, the calculation is justified by taking inner products of finite Fourier partial sums and passing to their mean-square limit.
General definitions. The Euler-Lagrange equation gives . Write and . A normal mode has fixed displacement pattern and common time factor, ; its normal frequency satisfies
Here is angular frequency. A normal coordinate is the coefficient of one pattern in a complete modal expansion, so these coordinates decouple the equations. Since is positive definite, the change turns the mode equation into the ordinary symmetric eigenvalue problem for .
Three-mass equations. Let be horizontal displacements from the unstretched equilibrium, ordered left to right. The kinetic energy and potential energy are
Differentiating the potential energy gives
Thus and
Frequencies and patterns. Put . Expansion of the generalized eigenvalue problem for small oscillations gives
Solving at each root gives
The zero normal mode is uniform translation. In the lower nonzero mode, the central mass stays fixed, the two end masses move oppositely, and their unequal displacements balance both the end-mass momenta and the forces on the central mass. In the upper mode the end masses move together and the centre oppositely. Both vibrating modes leave the centre of mass fixed.
Orthogonality. Because is symmetric, two mode equations imply
Distinct eigenvalues therefore give the mass-matrix orthogonality of normal modes:
The Euclidean dot product need not vanish for unequal masses; for example , while . The modal squared norms are .
Figure 1.
The three normal modes of the unequal free mass chain
. Masses from left to right are m, 2m and 3m, joined by springs k and 3k. Arrow lengths show the modal amplitude ratios (1,1,1), (-3,0,1), and (1,-2,1). Details.
Normal coordinates. Expand . Project using the mass-weighted inner product and divide by each modal norm to obtain
For example, the inverse equations are , , . They reduce the energies to
and hence
The first coordinate is the centre of mass and has free linear motion. Multiplying by respectively gives mass-normalized normal coordinates if desired.
A Hermitian matrix obeys , where the dagger is conjugate transpose. If with , then . This scalar is real because its complex conjugate equals . Since , the eigenvalue is real.
For the Gram matrix, conjugate symmetry of the inner product gives
Thus is Hermitian. The assumption that the vectors form a basis additionally makes positive definite, though only Hermiticity is needed here.
A real orthogonal matrix satisfies ; a complex unitary matrix satisfies . Their columns are orthonormal in the corresponding real or complex inner product.
Adopt the convention that a complex inner product is linear in its second argument, conjugate symmetric, and positive definite: , with equality exactly when . Conjugate symmetry and second-argument linearity then imply antilinearity in the first:
For the specified real symmetric matrix use . Its upper block is the outer product , so it has one zero eigenvalue and one eigenvalue . A complete orthonormal eigenbasis is
If , the last two eigenvalues coincide and their eigenspace is the span of ; every nonzero vector in that span is an eigenvector. Since , the zero eigenspace remains one-dimensional.
By the spectral theorem, the Hermitian matrix has a complete orthonormal eigenbasis. If , idempotence gives , so every eigenvalue is zero or one. Since , at least one is zero. Therefore
The trace of an idempotent equals its rank; here Hermiticity further identifies as an orthogonal projection matrix.
A complex inner product is conjugate-linear in its first argument, linear in its second, conjugate symmetric and positive definite: and for nonzero . An orthonormal basis is a spanning linearly independent family with . The associated norm is .
For two distinct basis elements , their orthogonality and unit norms give . Hence their distance is ; if the same element is selected twice, it is zero.
Finally, for , the scalar quadratic form obeys , proving is real.
A Hermitian matrix satisfies . If with , then is real because its conjugate equals . Since , its eigenvalue is real. If with , then
so : distinct eigenspaces are orthogonal for the standard complex inner product.
The converse is false. For example has the two real eigenvalues one and two but is not a Hermitian matrix. It can be embedded as a block in a example if desired.
For Hermitian , . Thus is Hermitian exactly when , equivalently when their commutator vanishes. Also , so a value that works for every such pair is
This sum is their anticommutator.
Use the inner product on . The distinct real eigenvalues permit a full orthonormal eigenvector expansion; the two child solutions establish that expansion and apply it to the proposed quadratic form.