Chapter 10 · Introduction

Chapter 10 — Inner Product Spaces and Quadratic Forms

Lengths, angles and orthogonality on abstract vector spaces: inner products and orthonormal bases, the self-adjoint, normal and unitary operators of the spectral theorem, and quadratic forms with their reduction and classification.

On New Year's Day 1801 Giuseppe Piazzi in Palermo found a faint moving point of light — the dwarf planet Ceres — and followed it for six weeks before it vanished into the glare of the Sun. Astronomers had too few, too noisy observations to say where it would reappear. The 24-year-old Carl Friedrich Gauss predicted the position, and Ceres was found again almost exactly where he said. His method, published in 1809 (Legendre had published the same idea in 1805), was least squares: among all orbits, choose the one that makes the sum of the squared errors smallest. In the language of this chapter, Gauss projected the vector of observations orthogonally onto a subspace. A century later David Hilbert and Erhard Schmidt carried the same geometry — lengths, angles, perpendicular projections — into spaces of functions, where Fourier series become expansions in an orthonormal basis and Parseval's identity is Pythagoras' theorem with infinitely many terms. Schmidt's orthogonalisation procedure, already used by Laplace and by Gram, is the Gram–Schmidt process of §10.1.

An inner product does more than measure: it pairs each linear map $T$ with an adjoint $T^*$, and the operators that interact well with their adjoints — self-adjoint ($T^*=T$), unitary ($T^*T=I$) and normal ($T^*T=TT^*$) — are exactly the ones that can be diagonalised by an orthonormal basis. That is the spectral theorem, the summit of finite-dimensional linear algebra: a real symmetric matrix has real eigenvalues and perpendicular eigenvectors, so every quadratic form $x^TAx$ becomes a sum of squares $\sum\lambda_iy_i^2$ after a rotation of the axes. This is how one classifies conics and quadrics, decides whether a critical point is a minimum (the Hessian test of §6.2), and reads off the principal stresses of a loaded beam or the principal components of a data set. Sylvester's law of inertia then says that the numbers of positive, negative and zero squares do not depend on how the reduction is done.

Inner products→Cauchy–Schwarz→Gram–Schmidt→Projections & least squares→Adjoint T*→Self-adjoint, normal, unitary→Spectral theorem→Quadratic forms→Sylvester's law
🎯 By the end of this chapter you can…
  • decide whether a given formula is an inner product on $\mathbb{R}^n$, $\mathbb{C}^n$, a matrix or polynomial space, and use the Cauchy–Schwarz inequality, the parallelogram law and polarisation;
  • run the Gram–Schmidt process, write $A=QR$, and compute orthogonal complements, orthogonal projections, distances and best approximations (including orthogonal polynomials);
  • state and use Bessel's inequality and Parseval's identity, and solve least-squares problems through the normal equations $A^*A\hat x=A^*b$;
  • compute adjoints and use $\ker T^*=(\operatorname{im}T)^\perp$; recognise Hermitian, unitary and normal matrices and their eigenvalue properties;
  • state and apply the spectral theorems (real symmetric and complex normal), test positive definiteness, find square roots and the singular value decomposition, and locate eigenvalues with Gershgorin discs;
  • reduce a quadratic form to a diagonal form by Lagrange's method and by an orthogonal change of variables, compute its rank, index and signature, classify conics and quadrics, and count congruence classes.
Teaser — What a Symmetric Matrix Does to the Unit Circle

A unit vector $x$ (red) runs round the circle and $Ax$ (blue) traces the image curve (purple). The dashed green lines are the real eigen-directions, where $Ax$ is parallel to $x$. For a symmetric matrix they are perpendicular, they are the axes of the image ellipse, and the value of the quadratic form $\langle Ax,x\rangle=x^TAx$ runs exactly between the two eigenvalues. Compare with the non-symmetric matrix and the rotation.

x—
Ax—
⟨Ax, x⟩—
range of ⟨Ax, x⟩—
eigenvalues—

How this is examined

CSIR NET draws steadily on this chapter, in both parts of the paper. Part B questions are usually short computations: the projection of a vector onto a line or plane, the distance from a point to a subspace, a polynomial orthogonal to $P_1$ for a given integral inner product, the value of a least-squares minimum, the eigenvalues of a Hermitian, unitary or orthogonal matrix built from a vector ($I-2uu^T$, $uu^*$), the number of positive eigenvalues of a symmetric matrix, the signature of a quadratic form, or the type of conic defined by a quadratic equation. Part C, where several options can be correct, tests the structure theory: "every normal matrix is diagonalisable by a unitary matrix", "a matrix with real eigenvalues is Hermitian", "if $P^2=P$ then $P$ is an orthogonal projection", "$A^*A$ and $AA^*$ have the same eigenvalues", "two real symmetric matrices with the same rank and signature are congruent", "a positive definite matrix has positive diagonal entries", "Gershgorin discs prove invertibility". Each false option is one of the counterexamples in the ⚠️ boxes of the three sections. GATE MA asks very similar questions, often on Gram–Schmidt, projections and positive definiteness.

Sections in this chapter

✅ Before you start

This chapter uses the whole of the linear algebra of Chapters 8 and 9. You need bases, dimension and direct sums (§8.1); linear maps, their matrices, change of basis and the dual space (§8.2); rank, determinants and the special matrices — symmetric, Hermitian, orthogonal, unitary, idempotent — together with the conjugate transpose $A^*$ (§8.3). For §10.2 and §10.3 you also need eigenvalues, characteristic and minimal polynomials (§9.1), diagonalisability, invariant subspaces and Schur's triangularisation (§9.2). Norms and the $\ell^2$ and $C[a,b]$ examples (§7.4), series of non-negative terms (§2.3), the Weierstrass approximation theorem (§5.2) and the Hessian test for extrema (§6.2) appear in examples and applications. Complex numbers are used only through conjugation, $|z|^2=z\bar z$, and the fact that every complex polynomial has a root.