A quadratic form is the algebraic shadow of a geometry: signature zero parts flatten, positive parts curve one way, negative the other. This chapter reduces every real quadratic form to a sum of ± squares (Gauss), proves that the counts of signs are intrinsic (Sylvester), and then crowns Euclidean geometry with the spectral theorem: symmetric endomorphisms diagonalize in orthonormal bases — the single most-used theorem of applied linear algebra.
12.1 Bilinear and quadratic forms
Definition 12.1
A symmetric bilinear form on a real vector space E is a bilinear φ:E×E→R with φ(x,y)=φ(y,x); the associated quadratic form is q(x)=φ(x,x). The form φ is recovered from q by polarization:
φ(x,y)=21(q(x+y)−q(x)−q(y)).
In a basis (ei), the matrix of φ is the symmetricB=(φ(ei,ej)), with q(x)=XTBX; a change of basis with matrix P replaces B by PTBP (congruence — not similarity!). The rank of q is rkB (invariant: congruence multiplies by invertible matrices).
Example 12.2
On R2: q(x,y)=x2+4xy+y2 has matrix (1221). An inner product is exactly a symmetric bilinear form whose quadratic form is positive definite; this chapter studies the general, sign-indefinite case.
Example 12.3(Congruence in action)
Take q(x,y)=x2+4xy+y2 (matrix B=(1221)) and the new basis e1′=(1,1), e2′=(1,−1), i.e. P=(111−1). Then
PTBP=(111−1)(1221)(111−1)=(600−2):
in the coordinates (u,v) along the new basis, q=6u2−2v2 — check: x=u+v, y=u−v gives x2+4xy+y2=6u2−2v2 directly. Note the new diagonal entries 6,−2 are not the eigenvalues3,−1 of B: congruence rescales, only similarity preserves spectra — but the signs agree, as Sylvester’s theorem demands. (The basis here is orthogonal but not orthonormal; normalizing it by 21 would divide the diagonal by 2 and recover the eigenvalues.)
Example 12.4(Gram determinants measure area)
For v1,v2 in a Euclidean space, the Gram matrix G=(⟨vi,vj⟩) packages lengths and angle; its determinant packages area:
the squared area of the parallelogram on v1,v2 — and Cauchy–Schwarz is exactly the statement detG≥0. Worked instance: v1=(1,2,2), v2=(2,1,−2) in R3:
G=(9009),detG=81:
the vectors are orthogonal of length 3, spanning a parallelogram (here, a square) of area 81=9. Closing insight: no cross product and no dimension-3 magic was used — detG measures k-dimensional volume in any dimension, the starting point of the weekend problem’s Part I and of the surface-area integrals later in this volume.
12.2 Gauss reduction and Sylvester’s inertia
Theorem 12.5(Gauss reduction)
Every quadratic formq on a finite-dimensional real space can be written
q=i=1∑sℓi2−j=1∑tmj2,
where ℓ1,…,ℓs,m1,…,mt are linearly independent linear forms; equivalently, some basis makes the matrix of q diagonal with entries +1 (s times), −1 (t times), 0.
Proof. Induction on the number of variables, in coordinates: q(x1,…,xn).
Case 1: some square appears, say the coefficient a of x12 is nonzero. Group all the x1-terms and complete the square:
q=a(x1+a1λ(x2,…,xn))2+q1(x2,…,xn),
where λ is linear and q1 quadratic in the remaining variables: one independent form split off (it involves x1, the others do not), induction applies to q1, and ± signs come from the sign of a after rescaling by ∣a∣.
Case 2: no square, but some cross term, say bx1x2 with b=0. Use the identity
x1x2=41((x1+x2)2−(x1−x2)2)
after grouping: writing q=bx1x2+x1α+x2β+q2 (with α,β,q2 in the other variables), one checks
q=4b[(x1+x2+bα+β)2−(x1−x2+bβ−α)2]+q,
with q free of x1,x2: two independent forms split off, and induction finishes.
Independence of the collected forms: order the batches as produced. The forms of the first batch contain x1 (Case 1) or x1,x2 (Case 2); all later forms are free of those variables. Suppose a linear combination of all collected forms vanishes. Reading the coefficient of x1 (and x2): only the first batch contributes, and within that batch the one or two forms are visibly independent (ℓ alone; or ℓ±m with independent ℓ,m): the first-batch coefficients vanish. Strip the batch and repeat: by induction along the batches, all coefficients vanish — the whole family is free, triangularity made explicit. ∎
Theorem 12.6(Sylvester’s law of inertia)
The pair (s,t) in Theorem 12.5 depends only on q, not on the reduction: it is the signature of q. Moreover
s=max{dimF:q∣F positive definite},
and symmetrically for t.
Proof. Let q=∑i≤sℓi2−∑j≤tmj2 and let F+ be the span of the (pre-)dual vectors on which (ℓi) restrict to coordinates — concretely: complete the independent family (ℓ1,…,ℓs,m1,…,mt) into a basis of the dualE∗, and let (u1,…,un) be the basis of E whose coordinate forms these are (the pre-dual basis: ℓi(uk)=δik for k≤s, and the later forms vanish on the earlier vectors). Set F+=Vect(u1,…,us): for x=∑i≤sxiui∈F+,
ℓi(x)=xi,mj(x)=0,soq(x)=i≤s∑xi2>0(x=0):
q∣F+ is positive definite and the max in the display is ≥s. Conversely, let F be any subspace with q∣F positive definite, and G={x:ℓ1(x)=⋯=ℓs(x)=0}, of codimension ≤s; on G, q(x)=−∑mj2≤0. Then F∩G={0} (a nonzero vector there would have q>0 and q≤0), so dimF≤dimE−dimG≤s. Hence the max equals s for every reduction: s is intrinsic, and t=rkq−s likewise. ∎
Example 12.7
q(x,y,z)=xy+yz+zx (no squares). With x1=x, x2=y: q=xy+z(x+y), and the two-square identity gives
q=41(x+y+2z)2−41(x−y)2−z2,
(expand to check). Three independent forms: signature (1,2), rank 3. One positive direction, two negative: the “light cone” geometry of this form.
Example 12.8(A degenerate form, reduced in full)
q(x,y,z)=xy+yz on R3: no squares, so Case 2 with the grouping q=y(x+z). The two-square identity on the product of the independent forms y and x+z:
q=41(y+x+z)2−41(y−x−z)2.
The two linear forms y+x+z and y−x−z are independent (their difference is 2(x+z), their sum 2y), so Sylvester reads off: signature (1,1), rank 2 — degenerate. The kernel of the polar form is found by solving φ(v,⋅)=0: with matrix 21010101010, the kernel is {y=0,x+z=0}=R(1,0,−1), the direction along which q sees nothing. Closing insight: rank deficiency shows up in Gauss as “running out of variables” — the reduction produced only two squares out of three dimensions, and the missing dimension is exactly the kernel.
Example 12.9(One form, two roads to the signature)
q(x,y,z)=2x2+2y2+2z2+2xy+2yz, matrix 210121012. Road 1, Gauss: complete squares in order,
three positive squares on independent forms, signature (3,0): positive definite. Road 2, eigenvalues: the matrix is the tridiagonal 2I+N with N the neighbor matrix; its eigenvalues are 2+2, 2, 2−2 (check the eigenvectors(1,±2,1) and (1,0,−1)), all positive: same verdict, by Corollary 12.15. Gauss is faster; eigenvalues say more (they give the principal axes and the extreme values of q on the sphere). Closing insight: the positive pivots 2,23,34 of Gauss are exactly the ratios Δk−1Δk of leading principal minors (Δ1=2, Δ2=3, Δ3=4) — the weekend problem proves this in general.
Method 12.10(Computing a signature: three routes)
Gauss (always works, fastest by hand): complete squares in order, Case 2 when no square is available; count the signs. Check that the collected linear forms are independent — fewer forms than variables means a kernel (Example 12.8).
Leading minors (for definiteness tests): all Δk>0 iff positive definite (Exercise 12.8); the pivots Δk/Δk−1 even give the Gauss coefficients (weekend problem). Fails silently if some Δk=0: fall back on route 1.
Eigenvalues (most informative, most expensive): signs of the spectrum (Corollary 12.15); also yields the principal axes and the extreme values of q on the unit sphere. Prefer it when the eigenstructure is needed anyway.
12.3 The spectral theorem
Now let E be Euclidean (inner product ⟨⋅,⋅⟩, Year 1 volume).
For u∈L(E), the adjointu∗ is the unique endomorphism with
⟨u(x),y⟩=⟨x,u∗(y)⟩(x,y∈E);
in an orthonormal basis, Mat(u∗)=Mat(u)T. u is symmetric (self-adjoint) when u∗=u — equivalently its matrix in an orthonormal basis is symmetric.
Existence and uniqueness of the adjoint. For fixed y, the form x↦⟨u(x),y⟩ is linear, hence (finite dimension) of the shape ⟨x,zy⟩ for a unique zy — the map y↦zy=:u∗(y) being linear by uniqueness. The matrix identification: ⟨u(ei),ej⟩ read both ways. ∎
Example 12.12(The adjoint depends on the inner product)
On R2 take the weighted inner product ⟨x,y⟩D=x1y1+2x2y2 (matrix D=diag(1,2)) and u of matrix A=(0010) in the canonical basis. From ⟨u(x),y⟩D=(Ax)TDy=xT(ATD)y and ⟨x,u∗(y)⟩D=xT(DA∗)y, the adjoint’s matrix is
Closing insight: “Mat(u∗)=Mat(u)T” is a statement about orthonormal bases only; in general the metric D intervenes, exactly as in the simultaneous reduction of the weekend problem.
Proof.An eigenvector exists. The function x↦⟨u(x),x⟩ is continuous on the unit sphere S of E, which is compact (finite dimension, Theorem 5.13): it attains its maximum λ at some a∈S. We claim u(a)=λa. For any y⊥a with ∥y∥=1 and t∈R, the vector xt=1+t2a+ty lies on S (∥a+ty∥2=1+t2 by Pythagoras); expanding the maximized function,
(symmetry of u merged the two cross terms: ⟨u(a),y⟩=⟨a,u(y)⟩=⟨u(y),a⟩). g is a differentiable function of t with a maximum at t=0; the quotient rule at 0 gives
g′(0)=12⟨u(a),y⟩⋅1−⟨u(a),a⟩⋅0=2⟨u(a),y⟩=0.
So u(a) is orthogonal to the whole hyperplane a⊥: u(a)∈(a⊥)⊥=Ra, i.e. u(a)=μa; and μ=⟨u(a),a⟩=λ.
Induction. The orthogonal complement F=a⊥ is u-stable: for x⊥a, ⟨u(x),a⟩=⟨x,u(a)⟩=λ⟨x,a⟩=0. The restriction u∣F is symmetric for the induced inner product; by induction on the dimension, F has an orthonormal eigenbasis; prepend a.
Complements.Eigenvalues are the real numbers ⟨u(e),e⟩ on the eigenbasis. Orthogonality of eigenspaces: u(x)=λx, u(y)=μy give λ⟨x,y⟩=⟨u(x),y⟩=⟨x,u(y)⟩=μ⟨x,y⟩, so ⟨x,y⟩=0 when λ=μ. Matrix form: columns of P = the orthonormal eigenbasis. ∎
Example 12.14(A full spectral run)
Diagonalize orthogonally A=(1221). Characteristic polynomial(1−λ)2−4: eigenvalues3 and −1. Eigenvectors: (A−3I)v=0 gives v1=21(1,1); (A+I)v=0 gives v2=21(1,−1) — orthogonal, as Theorem 12.13 guarantees without computation. With P=(v1v2) (a rotation by 4π):
PTAP=(300−1),x2+4xy+y2=3u2−v2in the rotated frame.
So the form of Exercise 12.1 is a hyperbola-type form: signature (1,1), consistent with its Gauss reduction(x+2y)2−3y2 — different squares, same signature, as Sylvester demands. Closing insight: Gauss gave the answer faster, but the spectral route also reports that on the unit circle q ranges exactly over [−1,3], attained along v2 and v1: the extra work buys geometry.
Corollary 12.15(Principal axes; positivity tests)
Every quadratic formq on a Euclidean space diagonalizes in some orthonormal basis: q(x)=∑iλixi2 with λi the eigenvalues of the symmetric matrix of q; the signature counts positive and negative eigenvalues.
A symmetric matrix is positive semidefinite (resp. definite) iff all its eigenvalues are ≥0 (resp. >0); and then the extreme values of the Rayleigh quotient are
∥x∥=1min⟨Ax,x⟩=λmin,∥x∥=1max⟨Ax,x⟩=λmax.
Proof. (1) Write q(x)=⟨Ax,x⟩ with Asymmetric (the matrix of q in an orthonormal basis); diagonalize A by the spectral theorem: for x=∑xiei in the orthonormal eigenbasis,
q(x)=⟨i∑λixiei,j∑xjej⟩=i∑λixi2
(orthonormality kills the cross terms). The ± signs of the λi count the signature by Sylvester: rescaling each coordinate by ∣λi∣ exhibits a Gauss reduction with independent forms.
(2) In the eigenbasis, ⟨Ax,x⟩=∑λixi2, trapped between λmin∥x∥2 and λmax∥x∥2, with equality at the corresponding eigenvectors; positivity of all eigenvalues is thus equivalent to positivity of the form. ∎
Example 12.16
A=(2112): eigenvalues3 (eigenvector21(1,1)) and 1 (21(1,−1)). The quadratic form2x2+2xy+2y2 becomes 3X2+Y2 in the rotated orthonormal frame: an ellipse’s principal axes, computed. The Gauss reduction reaches a diagonal form too, but only the spectral theorem reaches it without distorting lengths.
Example 12.17(An ellipse fully identified)
Which curve is 5x2+4xy+2y2=6? The matrix (5222) has characteristic polynomialλ2−7λ+6=(λ−1)(λ−6): eigenvalues1 and 6, both positive — an ellipse. Orthonormal eigenvectors: for λ=1, solve (4221)v=0: v1=51(1,−2); for λ=6: v2=51(2,1). In the rotated coordinates (X,Y) along (v2,v1) the equation becomes
6X2+Y2=6,i.e.X2+6Y2=1:
semi-axes 1 (along v2) and 6 (along v1). Closing insight: the rough shape was free of charge — det=6>0 and positive trace announce an ellipse before any eigenvector is computed — but only the spectral theorem delivers the axes’ directions and lengths, i.e. the actual geometry.
Example 12.18(Extremes on the sphere, read off the spectrum)
What are the extreme values of q(x,y,z)=2xy+2yz+2zx on the unit sphere? Its matrix (the all-ones off-diagonal of Exercise 12.2) has eigenvalues2 and −1 (double), so by Corollary 12.15 (2):
∥v∥=1maxq(v)=2 at v=31(1,1,1),∥v∥=1minq(v)=−1 on the circle x+y+z=0.
No calculus, no Lagrange multipliers: the spectral theorem solves this constrained optimization outright — and exhibits the maximizer. Closing insight: compare with the multiplier method of the differential-calculus chapter, which finds the same critical points with more work; for quadratic objectives on spheres, spectra are the royal road (the weekend problem of the Hermitian chapter builds the whole Courant–Fischer theory on this observation).
Remark 12.19(Common pitfalls)
(i) Congruence is not similarity: a change of basis for a form acts by PTBP, not P−1BP; eigenvalues are not invariants of a quadratic form (I and 4I are congruent via P=2I) — only their signs are (Sylvester). Speak of the eigenvalues of a form only once an inner product is fixed. (ii) Positive entries prove nothing:(1221) has all entries positive yet signature (1,1) (det=−3); conversely a positive definite matrix may have negative off-diagonal entries (Example 12.9 shifted: 2I−N works equally). Use Method 12.10. (iii) Dependent squares: writing q=ℓ12−ℓ22 says nothing if ℓ1,ℓ2 are proportional — x2+2xy+y2=(x+y)2 has rank 1, not 2; always check independence before reading off the signature. (iv) Sphere extremes without compactness: the Rayleigh bounds of Corollary 12.15 are attained because the sphere is compact; on the open ball or the whole space, an indefinite form has neither maximum nor minimum.
Remark 12.20(Where this is used)
The spectral theorem is the single most exported result of this book: statistics diagonalizes covariance matrices with it (principal component analysis), mechanics extracts normal modes of oscillation from it (the simultaneous reduction of the weekend problem), numerical analysis builds Cholesky and singular value decompositions on it (same problem), and the next chapter transports it to complex Hermitian spaces. The Year 3 volume proves its infinite-dimensional avatar for compactself-adjoint operators, where the finite-dimensional proof’s compactness argument becomes the whole story.
Remark 12.21(Perspectives within this volume)
Quadratic forms thread through the rest of Book 4 under three disguises. As Hessians: the differential-calculus chapter classifies critical points by the signature of the second-order form, so Sylvester’s invariance is what makes “saddle” a well-defined word. As energies: the differential-equations chapter’s oscillators carry the quadratic energy 21x′2+21ω2x2, and the simultaneous reduction of this chapter’s weekend problem is exactly the extraction of normal modes. As geometry: the conics of this chapter grow into the quadric surfaces of the geometry chapters, where the second fundamental form of a surface — a quadratic form on each tangent plane — has signature deciding whether the surface curves like a bowl or a saddle. The Hermitian chapter, next, replays the whole score over C.
12.4 Exercises
Exercise 12.1★
Gauss-reduce and give rank and signature:
q1(x,y)=x2+4xy+y2,q2(x,y,z)=x2+2y2+3z2+2xy+2yz.
Solution
Solution of Exercise 12.1.
q1=(x+2y)2−3y2: rank 2, signature (1,1) (a hyperbola-type form).
q2: complete the square in x: q2=(x+y)2+y2+2yz+3z2=(x+y)2+(y+z)2+2z2: rank 3, signature (3,0) — positive definite.
Exercise 12.2★
Diagonalize orthogonally A=011101110 (eigenvalues from Chapter 3’s computation; now make the basis orthonormal) and reduce the form q(x,y,z)=2xy+2yz+2zx to principal axes.
Solution
Solution of Exercise 12.2.
Eigenvalues2 (on Vect(1,1,1)) and −1 (on the plane x+y+z=0). Orthonormalize: e1=31(1,1,1); in the plane, Gram–Schmidt on (1,−1,0),(1,0,−1) gives e2=21(1,−1,0), e3=61(1,1,−2). Then P=(e1e2e3) is orthogonal with PTAP=diag(2,−1,−1).
The form q=2xy+2yz+2zx has matrix A: in the rotated coordinates q=2X2−Y2−Z2 — principal axes; signature (1,2), agreeing with Example 12.7 (the same form!).
Exercise 12.3★
Prove that u∗∗=u, (u∘v)∗=v∗∘u∗, and that keru∗=(imu)⊥. Deduce rku∗=rku.
Solution
Solution of Exercise 12.3.
u∗∗=u: ⟨u∗∗x,y⟩=⟨x,u∗y⟩=⟨ux,y⟩ for all y. (uv)∗=v∗u∗: ⟨uvx,y⟩=⟨vx,u∗y⟩=⟨x,v∗u∗y⟩. Kernel: y∈keru∗⟺⟨x,u∗y⟩=0∀x⟺⟨u(x),y⟩=0∀x⟺y⊥imu. Ranks: dimkeru∗=n−rku (orthogonal complement), so rku∗=rku by rank–nullity — the Euclidean avatar of the transpose-rank theorem.
Exercise 12.4★★
Let A be real symmetric with A3=A. Prove that A2 is the matrix of an orthogonal projection. More generally, relate the spectral decompositions of A and P(A) for a polynomial P.
Solution
Solution of Exercise 12.4.
Spectral: A=PDPT, D diagonal with entries λi satisfying λi3=λi: λi∈{−1,0,1}. Then A2=PD2PT with D2 diagonal of entries 0/1: A2 is symmetric and idempotent ((A2)2=A4=A⋅A3=A2) — symmetric idempotent = orthogonal projection (it is the projection onto ker(A2−I)=ker(A−I)⊕ker(A+I) along kerA, and these are orthogonal by the spectral theorem).
Prove that O(n)={P:PTP=I} is a compact subset of Mn(R)(closed: preimage of {I} under a continuous map; bounded: columns are unit vectors). Is it connected?
Solution
Solution of Exercise 12.5.
Closed: O(n)=g−1({I}) for the continuousg(P)=PTP (polynomial entries). Bounded: each column of P∈O(n) is a unit vector, so all entries lie in [−1,1]. Closed and bounded in Mn(R)≃Rn2: compact (Theorem 4.16 (2)).
Not connected: det takes the two values ±1 on O(n), and a continuous surjection onto {−1,1} splits the space (Example 4.28’s argument).
Exercise 12.6★★
(Square root) Let A be symmetric positive semidefinite. Construct a symmetric positive semidefinite B with B2=A, and prove that it is unique(existence: take square roots of the eigenvalues in a spectral basis; uniqueness: a candidate B commutes with A=B2, so preserves its eigenspaces — reduce to the scalar case on each).
Solution
Solution of Exercise 12.6.
Existence:A=PDPT with D=diag(λi), λi≥0; set B=PDPT with D=diag(λi): symmetric, positive semidefinite, B2=A.
Uniqueness: let B be symmetric psd with B2=A. B commutes with A; hence B preserves each eigenspaceEλ(A) (for Ax=λx: A(Bx)=BAx=λBx). On Eλ(A), the restriction of B is symmetric psd with square λid; its eigenvaluesμ satisfy μ2=λ, μ≥0: μ=λ — so the restriction, being diagonalizable with the single eigenvalueλ, isλid. Since E=⨁Eλ(A), B is determined: B=A.
Exercise 12.7★★
For real symmetricA, prove that ∣∣∣A∣∣∣2:=sup∥x∥2=1∥Ax∥2=maxi∣λi∣ (spectral radius), and compute ∣∣∣A∣∣∣2 for A=(1221).
Solution
Solution of Exercise 12.7.
In an orthonormal eigenbasis, ∥Ax∥22=∑λi2xi2≤(maxiλi2)∥x∥22, with equality at the corresponding eigenvector: ∣∣∣A∣∣∣2=max∣λi∣. For the given matrix: eigenvalues3,−1 (Example 12.16’s twin): ∣∣∣A∣∣∣2=3.
Exercise 12.8★★★
(Sylvester’s criterion) Let A be real symmetric with leading principal minors Δ1,…,Δn (determinants of the top-left blocks). Prove that A is positive definite if and only if all Δk>0. (For ⇒: restrictions of a definite form are definite, and the determinant of a positive definite matrix — the product of its eigenvalues — is positive. For ⇐: induct on n; the top-left (n−1)-block is positive definite, diagonalize the form on that subspace and complete the square in the last variable; the sign of the last diagonal entry is governed by detA=Δn>0.)
Solution
Solution of Exercise 12.8.
(⇒) The top-left k×k block Ak is the matrix of the restriction of the (definite) form to the span of the first k basis vectors: positive definite, so its eigenvalues are positive and Δk=detAk>0.
(⇐) Induction on n; n=1 clear. Assume all Δk>0. By induction, An−1 is positive definite: the form q restricted to F=Vect(e1,…,en−1) is definite. Diagonalize q∣F (Gauss): coordinates y1,…,yn−1 with q∣F=∑yi2. In the full space, completing the square in the last variable,
q=i=1∑n−1(yi+cixn)2+cxn2
for suitable constants (collect the cross terms into the squares). The reduction exhibits signature (n−1+ϵ,⋅) with ϵ the sign contribution of c; and the determinant keeps the sign of the product of the diagonal coefficients under congruence (det(PTAP)=(detP)2detA): Δn>0 forces c>0. Hence q is a sum of n squares of independent forms: positive definite.
(For ≤: any hyperplane meets the 2-plane spanned by the top two eigenvectors. For ≥: choose H=(e1)⊥.)
Solution
Solution of Exercise 12.9.
Let (e1,…,en) be an orthonormal eigenbasis for λ1≥⋯≥λn.
λ2≤ the min-max: for any hyperplane H, the 2-dimensional V=Vect(e1,e2) satisfies dim(H∩V)≥1 (Grassmann): pick a unit x∈H∩V, x=ae1+be2, a2+b2=1:
⟨u(x),x⟩=λ1a2+λ2b2≥λ2:
every hyperplane’s max is ≥λ2.
≥: for H=e1⊥, every unit x=∑i≥2xiei∈H has ⟨u(x),x⟩=∑i≥2λixi2≤λ2, attained at e2: this hyperplane’s max is exactly λ2. The min over H is therefore λ2.
Exercise 12.10★★
Determine rank and signature of q(x1,…,xn)=∑i<jxixj on Rn (n≥2), in two ways: by the algebraic identity 2q=(∑xi)2−∑xi2 together with the restriction of q to the hyperplane ∑xi=0; and by computing the eigenvalues of its matrix 21(J−I), where J is the all-ones matrix.
Solution
Solution of Exercise 12.10.
Algebraic road:2q=(∑xi)2−∑xi2. On the hyperplane H:∑xi=0 (dimension n−1), q=−21∑xi2 is negative definite; on the line R(1,…,1), q(t,…,t)=(2n)t2>0. A subspace where q is positive definite meets H trivially, so has dimension ≤1: by Sylvester (Theorem 12.6), s=1, and t≥n−1 from H; rank ≤n forces signature (1,n−1), rank n.
Spectral road: the matrix is 21(J−I); J has eigenvaluesn (on (1,…,1)) and 0 (on H), so 21(J−I) has eigenvalues2n−1 (once) and −21 (n−1 times): one positive, n−1 negative — same signature, by Corollary 12.15.
Exercise 12.11★★
Let A, B be real symmetric with B positive semidefinite. Prove
λmin(A)trB≤tr(AB)≤λmax(A)trB.
(Write B=CTC and tr(AB)=∑i⟨Aci,ci⟩ over the columns ci of CT.) In particular tr(AB)≥0 when both are positive semidefinite.
Solution
Solution of Exercise 12.11.
Write B=CTC (Exercise 12.6 via C=B). Then, with c1,…,cn the columns of CT:
tr(AB)=tr(ACTC)=tr(CACT)=i=1∑n⟨Aci,ci⟩.
By Corollary 12.15 (2), each term lies between λmin(A)∥ci∥2 and λmax(A)∥ci∥2, and ∑∥ci∥2=tr(CTC)1=trB: the double inequality follows. If A is also positive semidefinite, λmin(A)≥0: tr(AB)≥0.
Exercise 12.12★★★
On E=Mn(R), consider q(M)=tr(M2).
Show that q is a quadratic form with polar form φ(M,N)=tr(MN).
Show that the symmetric and antisymmetric matrices form φ-orthogonal subspaces on which q is respectively positive definite and negative definite (compute tr(M2) entrywise in each case).
Conclude: q has signature (2n(n+1),2n(n−1)) and rank n2.
Solution
Solution of Exercise 12.12.
φ(M,N)=tr(MN) is bilinear and symmetric (tr(MN)=tr(NM)), and φ(M,M)=q(M): q is the quadratic form of φ.
For Ssymmetric and K antisymmetric: tr(SK)=tr((SK)T)=tr(KTST)=−tr(KS)=−tr(SK), so φ(S,K)=0: the two subspaces are φ-orthogonal. Entrywise, tr(M2)=∑i,jmijmji: for symmetricM this is ∑mij2>0 (M=0); for antisymmetric M it is −∑mij2<0.
Mn(R)=Sn⊕An with dimensions 2n(n+1) and 2n(n−1); a Gauss reduction adapted to this φ-orthogonal splitting writes q as 2n(n+1) positive and 2n(n−1) negative squares: signature (2n(n+1),2n(n−1)) (Sylvester), rank n2: the form is nondegenerate.
12.5 Problem: Cholesky, Hadamard, and the polar decomposition
Problem 12.1
The spectral theorem is a microscope; this problem uses it as a factory. From Gram matrices we manufacture the Cholesky factorization (and identify the Gauss pivots as ratios of minors), then prove Hadamard’s inequality on determinants, build the polar decompositionA=QS and the singular value decomposition, classify plane conics, and end with the simultaneous reduction of two forms — the theorem behind normal modes of oscillation. Throughout, E=Rn with its standard inner product.
Part I — Gram matrices and Cholesky. For vectors v1,…,vn∈E, their Gram matrix is G=(⟨vi,vj⟩)i,j.
Show that G is symmetric positive semidefinite, and positive definite if and only if (v1,…,vn) is linearly independent (compute XTGX).
Conversely, show that every symmetric positive semidefinite A is a Gram matrix: A=CTC for some C (use the square root of Exercise 12.6), with C invertible iff A is definite.
Deduce that a positive semidefinite A satisfies ∣aij∣≤aiiajj for all i,j(restrict to two coordinates) — the Cauchy–Schwarz inequality, reread matricially.
(Cholesky) Let A be positive definite. Prove that there is a unique upper triangular T with positive diagonal entries such that
A=TTT
(existence: apply Gram–Schmidt to vectors realizing A as a Gram matrix; uniqueness: if T1TT1=T2TT2, show T1T2−1 is orthogonal and triangular with positive diagonal, hence I).
Show that the leading principal minors satisfy Δk=(t11⋯tkk)2, and deduce that the pivots produced by the Gauss reduction of a positive definite form, taken in the natural variable order, are
dk=Δk−1Δk(Δ0=1):
the minors of Sylvester’s criterion (Exercise 12.8) and the pivots of Gauss are the same data. Check on Example 12.9.
Part II — Hadamard’s inequality.
Let A be positive definite. Prove
detA≤a11a22⋯ann
(normalize: B=DAD with D=diag(aii−1/2) has unit diagonal; bound detB=∏μi by AM–GM against trB=n).
Show that equality holds iff A is diagonal.
Deduce Hadamard’s inequality: for every real square matrix M with columns c1,…,cn,
∣detM∣≤i=1∏n∥ci∥2,
with equality (for invertible M) iff the columns are pairwise orthogonal (apply questions 6–7 to MTM).
Geometric and combinatorial dividends: interpret question 8 as “the volume of a parallelepiped is at most the product of its edge lengths”; and show that a matrix with all entries in [−1,1] has ∣detM∣≤nn/2. (Matrices attaining this bound — Hadamard matrices — exist for n=1,2 and many multiples of 4; whether for all multiples of 4 is a famous open problem.)
Let A be invertible. Show that ATA is positive definite, and that
S=ATA(the square root of Exercise 12.6),Q=AS−1
give a factorization A=QS with Q orthogonal and S positive definite.
Prove that this factorization of an invertible A is unique.
Extend existence to arbitrary A: choose εk→0 with A+εkI invertible, write A+εkI=QkSk, and use the compactness of O(n) (Exercise 12.5) to extract Qk→Q; show Sk=QkT(A+εkI) converges to some positive semidefinite S with A=QS and S=ATA. Where does uniqueness fail for singular A?
(Singular value decomposition) Deduce that every real square A writes
A=UΣVT,U,V∈O(n),Σ=diag(σ1,…,σn),σi≥0,
where the σi (the singular values) are the eigenvalues of ATA.
Three consequences: ∣∣∣A∣∣∣2=σmax for every real A (generalizing Exercise 12.7); ∣detA∣=σ1⋯σn; and the image of the unit sphere under an invertible A is an ellipsoid with semi-axes σ1,…,σn along the columns of U.
Part IV — Conics, by the spectral theorem. A plane conic is the zero set of f(x)=q(x)+⟨b,x⟩+c, with q=0 a quadratic form of matrix A, b∈R2, c∈R.
Reduce f by a rotation (principal axes, Corollary 12.15) followed by a translation, and classify the possible nonempty, nondegenerate shapes by the signature of q: ellipse (detA>0), hyperbola (detA<0), parabola (detA=0, rank 1, with the linear term not absorbed).
Run the reduction in full for
x2+4xy+y2+2x−2y=4:
rotated coordinates, reduced equation, nature and center of the conic.
(Central conics) Suppose detA=0. Show the center is x0=−21A−1b, and that the congruence by (I0x01) of the 3×3 matrix Q=(AbT/2b/2c) yields
detQ=f(x0)detA:
the central conic is degenerate (a point or two lines) exactly when detQ=0.
Verify question 17 on the example of question 16: compute x0, f(x0) and detQ, and conclude again that the conic is a nondegenerate hyperbola.
(A quadric pencil) For λ∈R, classify the surface
x2+y2+z2+2λ(xy+yz+zx)=1
by the eigenvalues of its matrix (all-ones structure: eigenvalues1+2λ and 1−λ double): sphere/ellipsoid, cylinder, pair of planes, hyperboloids of one and two sheets, according to λ.
Part V — Two forms at once: simultaneous reduction.
Let q be positive definite and q′ an arbitrary quadratic form on E. Prove that there is a basis of E which is orthonormal for q and orthogonal for q′: in it, q=∑xi2 and q′=∑μixi2(use q as the inner product and apply the spectral theorem to the endomorphism representing q′).
Matrix form: for A positive definite and Bsymmetric, there is an invertible P with PTAP=I and PTBP=diag(μ1,…,μn), where the μi are the roots of det(B−μA)=0.
Run it in full for
A=(2111),B=(0110):
the generalized eigenvaluesμ±, and vectors diagonalizing both forms.
Show that positive definiteness cannot be dropped: for
A=(100−1),B=(0110),
no basis diagonalizes both forms (if P diagonalized both, det(B−μA) would split with real roots; compute it).
Synthesis. In one sentence each: (i) the one theorem every Part leaned on; (ii) which results of Parts I–III survive for positive semidefinite matrices, and which need definiteness; (iii) the physical system whose small oscillations questions 20–22 diagonalize (kinetic and potential energy as the two forms), and what the μi mean there.
Solution
Solution of Problem 12.1.
1.G is symmetric by symmetry of the inner product, and
XTGX=i,j∑xixj⟨vi,vj⟩=i∑xivi2≥0,
with equality iff ∑xivi=0: G is definite iff the only null combination is trivial, i.e. iff the family is independent.
2. With B=A (Exercise 12.6): A=B2=BTB, the Gram matrix of the columns of B; take C=B. And XTAX=∥CX∥2, so A is definite iff CX=0 for X=0, iff C is invertible.
3. The restriction of the form to Vect(ei,ej) has matrix (aiiaijaijajj), still positive semidefinite: its determinant (product of its nonnegative eigenvalues) is ≥0: aij2≤aiiajj. This is Cauchy–Schwarz for the vectors vi,vj of a Gram realization.
4.Existence: write A as the Gram matrix of an independent family (v1,…,vn) (questions 1–2). Gram–Schmidt produces an orthonormal (e1,…,en) with
vk=i≤k∑tikei,tkk=vk−projk−1vk>0,
so T=(tik) is upper triangular with positive diagonal, and
ajk=⟨vj,vk⟩=i∑tijtik=(TTT)jk.
Uniqueness: if T1TT1=T2TT2 then R=T1T2−1 satisfies RTR=I: R is orthogonal, and also upper triangular with positive diagonal (product of such). Then R−1=RT is simultaneously upper (inverse of upper) and lower (transpose of upper) triangular: diagonal; an orthogonal diagonal matrix has entries ±1, and positivity forces R=I: T1=T2.
5. For i,j≤k, (TTT)ij=∑mtmitmj only involves m≤min(i,j)≤k: the leading k×k block of A is TkTTk with Tk the leading block of T. Hence Δk=(detTk)2=(t11⋯tkk)2. Now the Gauss reduction of a positive definite form in the natural order never meets a zero square coefficient (the pivots are the diagonal entries of the successively reduced positive definite blocks): it produces q=∑kdkℓk2 with ℓk=xk+(terms in xk+1,…), i.e. A=LTDL with L unipotent triangular; then T=DL is a Cholesky factor, so by uniqueness tkk2=dk and
dk=(t11⋯tk−1,k−1)2(t11⋯tkk)2=Δk−1Δk.
On Example 12.9: Δ1,Δ2,Δ3=2,3,4 and the pivots were 2,23,34.
6. Each aii=eiTAei>0. Let D=diag(aii−1/2) and B=DAD: positive definite (congruence), with bii=1, so trB=n. Its eigenvaluesμi>0 satisfy, by AM–GM,
detB=i∏μi≤(n∑μi)n=1,
and detB=(detD)2detA=∏aiidetA: detA≤∏aii.
7. AM–GM is an equality iff all μi are equal (to 1); a symmetric matrix with sole eigenvalue1 is PIPT=I. So equality iff B=I iff aij=0 for i=j: A diagonal.
8. If M is singular both sides are ≥0=∣detM∣. Otherwise A=MTM is positive definite with aii=∥ci∥2 and detA=(detM)2: question 6 gives (detM)2≤∏∥ci∥2. Equality iff A=MTM is diagonal (question 7), i.e. iff the columns are pairwise orthogonal.
9.∣detM∣ is the volume of the parallelepiped spanned by the columns: the volume is at most the product of the edge lengths, with equality exactly for rectangular boxes. If ∣mij∣≤1 then ∥ci∥≤n, so ∣detM∣≤nn/2. (Attaining it forces orthogonal columns of entries ±1: a Hadamard matrix.)
10.XTATAX=∥AX∥2>0 for X=0 (A invertible): ATA is positive definite. Its square root S is positive definite (eigenvaluesλi>0), hence invertible, and Q=AS−1 satisfies
QTQ=S−1ATAS−1=S−1S2S−1=I:
A=QS with Q orthogonal, S positive definite.
11. If A=QS=Q′S′ then S′2=S′TQ′TQ′S′=ATA=S2; two positive semidefinite matrices with the same square coincide (Exercise 12.6): S′=S, then Q′=AS−1=Q.
12.det(A+εI) is a nonzero polynomial in ε: it has finitely many roots, so some sequence εk→0 avoids them. Write A+εkI=QkSk (question 10). O(n) is compact (Exercise 12.5): a subsequence gives Qφ(k)→Q∈O(n). Then
Sφ(k)=Qφ(k)T(A+εφ(k)I)⟶QTA=:S,
symmetric positive semidefinite as a limit of such (closed conditions), and A=QS. Moreover S2=STS=ATQQTA=ATA, so S=ATA by uniqueness. For singular A, S is singular and Q is not unique: it can be modified arbitrarily on (imS)⊥ — extreme case A=0, where every orthogonal Q works.
13. Diagonalize S=PΣPT (spectral theorem), Σ=diag(σi) with σi≥0 the eigenvalues of S=ATA. Then
A=QS=(QP)ΣPT=UΣVT,U=QP,V=P∈O(n).
14.∥Ax∥2=xTS2x≤σmax2∥x∥2 with equality at a top eigenvector of S: ∣∣∣A∣∣∣2=σmax — for symmetricA, S=A2 has eigenvalues∣λi∣, recovering Exercise 12.7. Determinant: ∣detA∣=∣detU∣detΣ∣detV∣=σ1⋯σn. Sphere: writing x=Vy with ∥y∥=1, Ax=UΣy has coordinates zi=σiyi in the orthonormal frame of the columns of U: the image is {∑zi2/σi2=1}, an ellipsoid with semi-axes σi.
15. A rotation to principal axes (Corollary 12.15) turns f into λ1X2+λ2Y2+β1X+β2Y+c, with λ1λ2=detA. If detA=0, absorb the linear terms by the translation X↦X−2λ1β1 (and likewise Y): λ1X′2+λ2Y′2=c′. For detA>0 (equal signs): an ellipse (c′ of the right sign), a point, or empty. For detA<0: a hyperbola (c′=0) or two crossing lines. If detA=0 with rank 1 (say λ2=0=λ1): λ1X′2+β2Y+c′′, a parabola when β2=0; otherwise two parallel lines, one line, or empty. Nondegenerate shapes: ellipse, hyperbola, parabola, governed by the sign of detA.
16. The quadratic part x2+4xy+y2 has matrix (1221), eigenvalues3 and −1 with orthonormal directions 21(1,1), 21(1,−1). In the rotated coordinates u=2x+y, v=2x−y: x2+y2=u2+v2, 2xy=u2−v2, so the form is 3u2−v2, and 2x−2y=22v. The equation becomes
3u2−v2+22v=4⟺3u2−(v−2)2=2:
a hyperbola, center at (u,v)=(0,2), i.e. (x,y)=(1,−1), with axes along the rotated frame.
17.f(x)=(x−x0)TA(x−x0)+f(x0) whenever Ax0=−2b, i.e. x0=−21A−1b: the gradient of f vanishes exactly there (x0 is the center of symmetry). With M=(I0x01):
and detM=1: detQ=f(x0)detA. The centered equation reads q(X)=−f(x0): for f(x0)=0 it degenerates to q(X)=0 (two lines through the center if the signature is (1,1), the single point x0 if q is definite); for f(x0)=0 the conic is a genuine ellipse or hyperbola.
18.A−1=−31(1−2−21), 2b=(1,−1): x0=−A−12b=(1,−1), as found in question 16. f(x0)=q(1,−1)+2+2−4=(1−4+1)+0=−2=0, and detQ=f(x0)detA=(−2)(−3)=6=0: nondegenerate; detA=−3<0: a hyperbola — and indeed the centered equation 3u2−(v−2)2=−f(x0)=2 matches question 16.
19. The matrix is (1−λ)I+λJ: eigenvalues1+2λ (direction (1,1,1)) and 1−λ (double, on x+y+z=0). Cases:
−21<λ<1: all eigenvalues positive: an ellipsoid of revolution about (1,1,1) (a sphere for λ=0);
λ=1: q=(x+y+z)2: the equation gives the two parallel planes x+y+z=±1;
λ=−21: eigenvalues0,23,23: a circular cylinder of axis (1,1,1);
λ>1: signature (1,2): a hyperboloid of two sheets;
λ<−21: signature (2,1): a hyperboloid of one sheet.
20. The polar form of q is an inner product ⟨⋅,⋅⟩q on E. For fixed x, y↦φ′(x,y) (polar form of q′) is linear, hence equals ⟨zx,y⟩q for a unique zx; u(x):=zx is linear (uniqueness), and ⟨u(x),y⟩q=φ′(x,y)=φ′(y,x)=⟨u(y),x⟩q: u is symmetric in the Euclidean space (E,⟨⋅,⋅⟩q). The spectral theorem (Theorem 12.13) gives a q-orthonormal eigenbasis (εi), u(εi)=μiεi: in it q(x)=∑xi2 and q′(x)=⟨u(x),x⟩q=∑μixi2.
21. Let P be the matrix of that basis: congruence gives PTAP=I and PTBP=diag(μi). Then
22.det(B−μA)=det(−2μ1−μ1−μ−μ)=2μ2−(1−μ)2=μ2+2μ−1: roots μ±=−1±2. Solving (B−μ±A)v=0: v±=(1−μ±,2μ±) (the second row identity (1−μ)2=2μ2 at the roots confirms it). The A-norms come out clean: qA(v±)=2(1+μ±2), and one checks φA(v+,v−)=0 using μ++μ−=−2, μ+μ−=−1. The basis (2(1+μ+2)v+,2(1+μ−2)v−) is orthonormal for A and diagonalizes B with entries μ±.
23. If some invertible P diagonalized both forms, question 21’s computation would give det(B−μA)=(detP)−2∏(d2i−μd1i), a real polynomial split into real linear factors. But here
det(B−μA)=det(−μ11μ)=−μ2−1,
of degree 2 with no real root: contradiction. (The Lorentz-signature A admits B-“rotations” with no real axes.)
24.A−1B=A−1/2(A−1/2BA−1/2)A1/2 with A1/2=A positive definite (Exercise 12.6): A−1B is similar to the symmetricA−1/2BA−1/2, hence diagonalizable with real eigenvalues. And det(B−μA)=detA⋅det(A−1B−μI): the pencil roots μi of question 21 are exactly the eigenvalues of A−1B.
25. (i) Every Part leaned on the spectral theorem: through the square root (Cholesky, polar), the eigenvalue bounds (Hadamard), the principal axes (conics), and the q-adapted version (simultaneous reduction). (ii) Gram realizations, Hadamard, and the polar decomposition survive in the semidefinite world; Cholesky’s uniqueness, the pivot formula, and the simultaneous reduction need definiteness (questions 12 and 23 show exactly how they fail). (iii) Coupled small oscillations: kinetic energy (positive definite) and potential energy are two quadratic forms; the basis of questions 20–22 is the system’s normal modes, and the μi are the squared angular frequencies.