Positive definiteness gives a positive smallest eigenvalue with . Hence the set is compact, and attains a maximum there. Its two constraint gradients are and ; they are linearly independent because are nonzero and is invertible.
Put . At any constrained extremum the multiplier equations are
Multiplication by and gives . If the objective is zero. Otherwise , so and normalization gives . Thus every maximum is at most one, and the value one is attained at . This proves on the normalized constraints.
For nonzero arbitrary vectors apply that result to and . If either vector is zero the conclusion is immediate. Therefore
Equality for nonzero vectors holds precisely when they are linearly dependent. This is the Cauchy-Schwarz inequality for the inner product induced by .

Articles by others on the same topic (0)

There are currently no matching articles.