Study guide
9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem
GRE Subject Test: Mathematics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Single-Variable Differential Calculus
1.1 Limits, Continuity, and Epsilon-Delta Definitions 1.2 Differentiation Rules, Implicit & Inverse Differentiation 1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema 1.4 L'Hôpital's Rule, Curve Sketching, and Optimization 1.5 Functions, Graphs, Transformations, and Inverses 1.6 Trigonometric Functions, Identities, and Equations 1.7 Coordinate Geometry, Lines, Circles, and Conics 1.8 Parametric and Polar Curves
2 Chapter 2: Single-Variable Integral Calculus
2.1 Riemann Sums and the Fundamental Theorem of Calculus 2.2 Advanced Integration Techniques 2.3 Geometric Applications: Areas, Volumes, and Arc Length 2.4 Improper Integrals and Convergence Criteria
3 Chapter 3: Sequences, Infinite Series & Power Series
3.1 Sequences, Monotonicity, and Limits 3.2 Infinite Series and Convergence Tests 3.3 Power Series, Radius and Interval of Convergence 3.4 Taylor and Maclaurin Series with Error Bounds
4 Chapter 4: Multivariable Differential Calculus
4.1 Multivariable Functions, Limits, and Partial Derivatives 4.2 Directional Derivatives, Gradients, and Tangent Planes 4.3 Multivariable Chain Rule and Implicit Differentiation 4.4 Multivariable Extrema, Hessian Matrix, and Lagrange Multipliers
5 Chapter 5: Multivariable Integration & Vector Calculus
5.1 Multiple Integrals in Cylindrical and Spherical Coordinates 5.2 Change of Variables and the Jacobian Determinant 5.3 Vector Fields, Line Integrals, and Green's Theorem 5.4 Surface Integrals, Stokes' Theorem, and the Divergence Theorem
6 Chapter 6: Ordinary Differential Equations
6.1 First-Order ODEs: Separable, Linear, and Exact Equations 6.2 Special First-Order ODEs: Homogeneous, Bernoulli, and Orthogonal Trajectories 6.3 Second-Order Linear Homogeneous ODEs with Constant Coefficients 6.4 Nonhomogeneous Linear ODEs: Undetermined Coefficients and Variation of Parameters
7 Chapter 7: Elementary Algebra & Number Theory
7.1 Elementary Algebra, Polynomials, Roots, and Factorization 7.2 Divisibility, Primes, and the Euclidean Algorithm 7.3 Modular Arithmetic, Chinese Remainder Theorem, and Euler's Totient
8 Chapter 8: Linear Algebra: Vector Spaces & Transformations
8.1 Vector Spaces, Subspaces, Span, and Linear Independence 8.2 Basis, Dimension, and Coordinate Representations 8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem 8.4 Matrix Representations of Transformations and Change of Basis
9 Chapter 9: Linear Algebra: Matrices, Determinants & Spectral Theory
9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction 9.2 Determinants, Matrix Inverses, and Cramer's Rule 9.3 Eigenvalues, Eigenvectors, and Diagonalization 9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem
10 Chapter 10: Abstract Algebra: Groups, Rings & Fields
10.1 Groups, Subgroups, and Permutations 10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms 10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields
11 Chapter 11: Introductory Real Analysis
11.1 The Real Field and Metric Space Topology 11.2 Compactness, Completeness, and Connectedness in R^n 11.3 Continuity, Uniform Continuity, and Value Theorems 11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence
12 Chapter 12: Complex Analysis
12.1 Complex Numbers and Analytic Functions 12.2 Contour Integration and Cauchy's Theorems 12.3 Laurent Series, Singularities, and the Residue Theorem
13 Chapter 13: Topology, Geometry & Numerical Analysis
13.1 Topological Spaces, Open/Closed Sets, and Bases 13.2 Euclidean Geometry, Similarity, Circles, and Transformations 13.3 Numerical Analysis: Error, Root Finding, Interpolation, and Quadrature
14 Chapter 14: Probability, Statistics & Discrete Mathematics
14.1 Logic, Set Theory, Algorithms, and Combinatorics 14.2 Graph Theory: Trees, Cycles, Paths, and Planarity 14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem 14.4 Random Variables, Expected Value, Variance, and Common Distributions
9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem
Key Takeaways Explain This Topic AI
Inner products define geometry via the Cauchy-Schwarz inequality |<u, v>| <= ||u|| ||v||, inducing norms, angles, and orthogonal projections.
The Gram-Schmidt process algorithmically constructs an orthonormal basis from any linearly independent set, underlying the matrix QR factorization where Q is orthogonal and R is upper triangular.
The Spectral Theorem establishes that every real symmetric matrix (and complex Hermitian matrix) possesses exclusively real eigenvalues and admits an orthonormal basis of eigenvectors, making it orthogonally diagonalizable as A = Q Lambda Q^T.
A symmetric matrix is positive definite if and only if all its eigenvalues are strictly positive, or equivalently by Sylvester's Criterion, all leading principal minors are strictly positive.
Last updated: September 2026
9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem
Inner product spaces enrich vector spaces with metric concepts including lengths, angles, and orthogonality. On the GRE Mathematics Subject Test, questions test the Cauchy-Schwarz inequality, Gram-Schmidt orthogonalization, QR factorization, the Spectral Theorem for symmetric and Hermitian matrices, and Sylvester's criterion for quadratic form definiteness.
Inner Products, Norms, and Geometric Inequalities
An inner product on a real vector space V V V is a map ⟨ ⋅ , ⋅ ⟩ : V × V → R \langle \cdot, \cdot \rangle: V \times V \to \mathbb{R} ⟨ ⋅ , ⋅ ⟩ : V × V → R satisfying:
Symmetry : ⟨ u , v ⟩ = ⟨ v , u ⟩ \langle \mathbf{u}, \mathbf{v} \rangle = \langle \mathbf{v}, \mathbf{u} \rangle ⟨ u , v ⟩ = ⟨ v , u ⟩ .
Bilinearity : ⟨ c u 1 + d u 2 , v ⟩ = c ⟨ u 1 , v ⟩ + d ⟨ u 2 , v ⟩ \langle c\mathbf{u}_1 + d\mathbf{u}_2, \mathbf{v} \rangle = c\langle \mathbf{u}_1, \mathbf{v} \rangle + d\langle \mathbf{u}_2, \mathbf{v} \rangle ⟨ c u 1 + d u 2 , v ⟩ = c ⟨ u 1 , v ⟩ + d ⟨ u 2 , v ⟩ .
Positive Definiteness : ⟨ v , v ⟩ ≥ 0 \langle \mathbf{v}, \mathbf{v} \rangle \ge 0 ⟨ v , v ⟩ ≥ 0 , with ⟨ v , v ⟩ = 0 ⟺ v = 0 \langle \mathbf{v}, \mathbf{v} \rangle = 0 \iff \mathbf{v} = \mathbf{0} ⟨ v , v ⟩ = 0 ⟺ v = 0 .
For a complex vector space, symmetry is replaced by conjugate symmetry ⟨ u , v ⟩ = ⟨ v , u ⟩ ‾ \langle \mathbf{u}, \mathbf{v} \rangle = \overline{\langle \mathbf{v}, \mathbf{u} \rangle} ⟨ u , v ⟩ = ⟨ v , u ⟩ , making the inner product sesquilinear.
The Induced Norm and Inequalities
The inner product induces the Euclidean norm ∥ v ∥ = ⟨ v , v ⟩ \|\mathbf{v}\| = \sqrt{\langle \mathbf{v}, \mathbf{v} \rangle} ∥ v ∥ = ⟨ v , v ⟩ . Foundational inequalities include:
Cauchy-Schwarz Inequality : ∣ ⟨ u , v ⟩ ∣ ≤ ∥ u ∥ ∥ v ∥ , |\langle \mathbf{u}, \mathbf{v} \rangle| \le \|\mathbf{u}\| \|\mathbf{v}\|, ∣ ⟨ u , v ⟩ ∣ ≤ ∥ u ∥∥ v ∥ , with equality if and only if u \mathbf{u} u and v \mathbf{v} v are linearly dependent.
Triangle Inequality : ∥ u + v ∥ ≤ ∥ u ∥ + ∥ v ∥ \|\mathbf{u} + \mathbf{v}\| \le \|\mathbf{u}\| + \|\mathbf{v}\| ∥ u + v ∥ ≤ ∥ u ∥ + ∥ v ∥ .
Parallelogram Identity : ∥ u + v ∥ 2 + ∥ u − v ∥ 2 = 2 ∥ u ∥ 2 + 2 ∥ v ∥ 2 \|\mathbf{u} + \mathbf{v}\|^2 + \|\mathbf{u} - \mathbf{v}\|^2 = 2\|\mathbf{u}\|^2 + 2\|\mathbf{v}\|^2 ∥ u + v ∥ 2 + ∥ u − v ∥ 2 = 2∥ u ∥ 2 + 2∥ v ∥ 2 .
Pythagorean Theorem : If ⟨ u , v ⟩ = 0 \langle \mathbf{u}, \mathbf{v} \rangle = 0 ⟨ u , v ⟩ = 0 , then ∥ u + v ∥ 2 = ∥ u ∥ 2 + ∥ v ∥ 2 \|\mathbf{u} + \mathbf{v}\|^2 = \|\mathbf{u}\|^2 + \|\mathbf{v}\|^2 ∥ u + v ∥ 2 = ∥ u ∥ 2 + ∥ v ∥ 2 .
The Gram-Schmidt Process and QR Factorization
Given a linearly independent set { v 1 , … , v k } \{\mathbf{v}_1, \dots, \mathbf{v}_k\} { v 1 , … , v k } , the Gram-Schmidt process generates an orthogonal set { u 1 , … , u k } \{\mathbf{u}_1, \dots, \mathbf{u}_k\} { u 1 , … , u k } spanning the same subspace: u 1 = v 1 u 2 = v 2 − ⟨ v 2 , u 1 ⟩ ∥ u 1 ∥ 2 u 1 ⋮ u k = v k − ∑ j = 1 k − 1 ⟨ v k , u j ⟩ ∥ u j ∥ 2 u j \begin{aligned} \mathbf{u}_1 &= \mathbf{v}_1 \\ \mathbf{u}_2 &= \mathbf{v}_2 - \frac{\langle \mathbf{v}_2, \mathbf{u}_1 \rangle}{\|\mathbf{u}_1\|^2} \mathbf{u}_1 \\ &\;\;\vdots \\ \mathbf{u}_k &= \mathbf{v}_k - \sum_{j=1}^{k-1} \frac{\langle \mathbf{v}_k, \mathbf{u}_j \rangle}{\|\mathbf{u}_j\|^2} \mathbf{u}_j \end{aligned} u 1 u 2 u k = v 1 = v 2 − ∥ u 1 ∥ 2 ⟨ v 2 , u 1 ⟩ u 1 ⋮ = v k − j = 1 ∑ k − 1 ∥ u j ∥ 2 ⟨ v k , u j ⟩ u j
Normalizing each vector e i = u i / ∥ u i ∥ \mathbf{e}_i = \mathbf{u}_i / \|\mathbf{u}_i\| e i = u i /∥ u i ∥ produces an orthonormal basis ( ⟨ e i , e j ⟩ = δ i j \langle \mathbf{e}_i, \mathbf{e}_j \rangle = \delta_{ij} ⟨ e i , e j ⟩ = δ ij ).
QR Factorization
Every m × n m \times n m × n matrix A A A with linearly independent columns admits a Q R QR QR factorization : A = Q R , A = Q R, A = QR ,
where Q ∈ M m × n ( R ) Q \in M_{m \times n}(\mathbb{R}) Q ∈ M m × n ( R ) has orthonormal columns ( Q T Q = I n Q^T Q = I_n Q T Q = I n ), and R ∈ M n × n ( R ) R \in M_{n \times n}(\mathbb{R}) R ∈ M n × n ( R ) is an upper triangular matrix with strictly positive diagonal entries r i i = ∥ u i ∥ > 0 r_{ii} = \|\mathbf{u}_i\| > 0 r ii = ∥ u i ∥ > 0 .
Orthogonal Projections and Subspaces
Let W ⊂ V W \subset V W ⊂ V be a finite-dimensional subspace with orthonormal basis { e 1 , … , e k } \{\mathbf{e}_1, \dots, \mathbf{e}_k\} { e 1 , … , e k } .
The orthogonal projection of v ∈ V \mathbf{v} \in V v ∈ V onto W W W is: P W ( v ) = ∑ i = 1 k ⟨ v , e i ⟩ e i . P_W(\mathbf{v}) = \sum_{i=1}^k \langle \mathbf{v}, \mathbf{e}_i \rangle \mathbf{e}_i. P W ( v ) = i = 1 ∑ k ⟨ v , e i ⟩ e i .
The vector v − P W ( v ) \mathbf{v} - P_W(\mathbf{v}) v − P W ( v ) lies in the orthogonal complement W ⊥ = { x ∈ V : ⟨ x , w ⟩ = 0 , ∀ w ∈ W } W^\perp = \{\mathbf{x} \in V : \langle \mathbf{x}, \mathbf{w} \rangle = 0, \; \forall \mathbf{w} \in W\} W ⊥ = { x ∈ V : ⟨ x , w ⟩ = 0 , ∀ w ∈ W } .
Best Approximation Theorem : P W ( v ) P_W(\mathbf{v}) P W ( v ) is the unique vector in W W W minimizing the distance to v \mathbf{v} v : ∥ v − P W ( v ) ∥ = min w ∈ W ∥ v − w ∥ . \|\mathbf{v} - P_W(\mathbf{v})\| = \min_{\mathbf{w} \in W} \|\mathbf{v} - \mathbf{w}\|. ∥ v − P W ( v ) ∥ = w ∈ W min ∥ v − w ∥.
Symmetric and Hermitian Matrices & The Spectral Theorem
A real matrix A A A is symmetric if A = A T A = A^T A = A T . A complex matrix A A A is Hermitian if A = A ∗ = A ‾ T A = A^* = \overline{A}^T A = A ∗ = A T .
Fundamental Properties of Symmetric/Hermitian Operators
Real Spectra : Every eigenvalue of a real symmetric or complex Hermitian matrix is strictly real. Proof : If A v = λ v A\mathbf{v} = \lambda \mathbf{v} A v = λ v with v ≠ 0 \mathbf{v} \neq \mathbf{0} v = 0 , then λ ∥ v ∥ 2 = v ∗ A v = ( A v ) ∗ v = λ ‾ ∥ v ∥ 2 ⟹ λ = λ ‾ ∈ R \lambda \|\mathbf{v}\|^2 = \mathbf{v}^* A \mathbf{v} = (A\mathbf{v})^* \mathbf{v} = \overline{\lambda} \|\mathbf{v}\|^2 \implies \lambda = \overline{\lambda} \in \mathbb{R} λ ∥ v ∥ 2 = v ∗ A v = ( A v ) ∗ v = λ ∥ v ∥ 2 ⟹ λ = λ ∈ R .
Orthogonal Eigenspaces : Eigenvectors corresponding to distinct eigenvalues are mutually orthogonal. Proof : If A v 1 = λ 1 v 1 A\mathbf{v}_1 = \lambda_1 \mathbf{v}_1 A v 1 = λ 1 v 1 and A v 2 = λ 2 v 2 A\mathbf{v}_2 = \lambda_2 \mathbf{v}_2 A v 2 = λ 2 v 2 with λ 1 ≠ λ 2 \lambda_1 \neq \lambda_2 λ 1 = λ 2 , then λ 1 ⟨ v 1 , v 2 ⟩ = ⟨ A v 1 , v 2 ⟩ = ⟨ v 1 , A v 2 ⟩ = λ 2 ⟨ v 1 , v 2 ⟩ \lambda_1 \langle \mathbf{v}_1, \mathbf{v}_2 \rangle = \langle A\mathbf{v}_1, \mathbf{v}_2 \rangle = \langle \mathbf{v}_1, A\mathbf{v}_2 \rangle = \lambda_2 \langle \mathbf{v}_1, \mathbf{v}_2 \rangle λ 1 ⟨ v 1 , v 2 ⟩ = ⟨ A v 1 , v 2 ⟩ = ⟨ v 1 , A v 2 ⟩ = λ 2 ⟨ v 1 , v 2 ⟩ . Because λ 1 ≠ λ 2 \lambda_1 \neq \lambda_2 λ 1 = λ 2 , we must have ⟨ v 1 , v 2 ⟩ = 0 \langle \mathbf{v}_1, \mathbf{v}_2 \rangle = 0 ⟨ v 1 , v 2 ⟩ = 0 .
The Spectral Theorem
Let A ∈ M n × n ( R ) A \in M_{n \times n}(\mathbb{R}) A ∈ M n × n ( R ) be a real symmetric matrix. Then:
A A A has n n n real eigenvalues (counted with algebraic multiplicity).
There exists an orthonormal basis of R n \mathbb{R}^n R n consisting of eigenvectors of A A A .
A A A is orthogonally diagonalizable : A = Q Λ Q T , A = Q \Lambda Q^T, A = Q Λ Q T , where Q Q Q is an orthogonal matrix ( Q − 1 = Q T Q^{-1} = Q^T Q − 1 = Q T ) and Λ = diag ( λ 1 , … , λ n ) \Lambda = \operatorname{diag}(\lambda_1, \dots, \lambda_n) Λ = diag ( λ 1 , … , λ n ) .
In terms of rank-1 projection matrices, A = ∑ i = 1 n λ i q i q i T A = \sum_{i=1}^n \lambda_i \mathbf{q}_i \mathbf{q}_i^T A = ∑ i = 1 n λ i q i q i T .
Quadratic Forms and Definiteness
A quadratic form on R n \mathbb{R}^n R n is a polynomial q ( x ) = x T A x q(\mathbf{x}) = \mathbf{x}^T A \mathbf{x} q ( x ) = x T A x , where A A A is a real symmetric matrix.
Classification by Eigenvalues
Because A = Q Λ Q T A = Q \Lambda Q^T A = Q Λ Q T , setting y = Q T x \mathbf{y} = Q^T \mathbf{x} y = Q T x transforms the form into a sum of squares: q ( x ) = y T Λ y = ∑ i = 1 n λ i y i 2 . q(\mathbf{x}) = \mathbf{y}^T \Lambda \mathbf{y} = \sum_{i=1}^n \lambda_i y_i^2. q ( x ) = y T Λ y = i = 1 ∑ n λ i y i 2 .
Definiteness Class Geometric / Value Condition Eigenvalue Criterion Sylvester's Minor Criterion
Positive Definite q ( x ) > 0 q(\mathbf{x}) > 0 q ( x ) > 0 for all x ≠ 0 \mathbf{x} \neq \mathbf{0} x = 0 All λ i > 0 \lambda_i > 0 λ i > 0 All leading principal minors Δ k > 0 \Delta_k > 0 Δ k > 0
Negative Definite q ( x ) < 0 q(\mathbf{x}) < 0 q ( x ) < 0 for all x ≠ 0 \mathbf{x} \neq \mathbf{0} x = 0 All λ i < 0 \lambda_i < 0 λ i < 0 Alternating: ( − 1 ) k Δ k > 0 (-1)^k \Delta_k > 0 ( − 1 ) k Δ k > 0 ( Δ 1 < 0 , Δ 2 > 0 , … \Delta_1 < 0, \Delta_2 > 0, \dots Δ 1 < 0 , Δ 2 > 0 , … )
Positive Semidefinite q ( x ) ≥ 0 q(\mathbf{x}) \ge 0 q ( x ) ≥ 0 for all x \mathbf{x} x All λ i ≥ 0 \lambda_i \ge 0 λ i ≥ 0 All principal minors ≥ 0 \ge 0 ≥ 0 (leading alone is insufficient)
Negative Semidefinite q ( x ) ≤ 0 q(\mathbf{x}) \le 0 q ( x ) ≤ 0 for all x \mathbf{x} x All λ i ≤ 0 \lambda_i \le 0 λ i ≤ 0 Principal minors alternate ≤ 0 \le 0 ≤ 0 and ≥ 0 \ge 0 ≥ 0
Indefinite Takes both positive and negative values Both λ > 0 \lambda > 0 λ > 0 and λ < 0 \lambda < 0 λ < 0 Fails above tests; e.g. Δ n < 0 \Delta_n < 0 Δ n < 0 for even n n n
- Step-by-Step Worked Problems
- Problem 1: Gram-Schmidt and QR Factorization
Apply Gram-Schmidt to orthogonalize v 1 = ( 1 , 1 , 0 ) T \mathbf{v}_1 = (1, 1, 0)^T v 1 = ( 1 , 1 , 0 ) T and v 2 = ( 1 , 0 , 2 ) T \mathbf{v}_2 = (1, 0, 2)^T v 2 = ( 1 , 0 , 2 ) T .
Solution :
First vector: u 1 = v 1 = ( 1 1 0 ) , ∥ u 1 ∥ 2 = 1 2 + 1 2 + 0 2 = 2. \mathbf{u}_1 = \mathbf{v}_1 = \begin{pmatrix} 1 \\ 1 \\ 0 \end{pmatrix}, \quad \|\mathbf{u}_1\|^2 = 1^2 + 1^2 + 0^2 = 2. u 1 = v 1 = 1 1 0 , ∥ u 1 ∥ 2 = 1 2 + 1 2 + 0 2 = 2.
Second vector projection: ⟨ v 2 , u 1 ⟩ = 1 ( 1 ) + 0 ( 1 ) + 2 ( 0 ) = 1. \langle \mathbf{v}_2, \mathbf{u}_1 \rangle = 1(1) + 0(1) + 2(0) = 1. ⟨ v 2 , u 1 ⟩ = 1 ( 1 ) + 0 ( 1 ) + 2 ( 0 ) = 1. u 2 = v 2 − ⟨ v 2 , u 1 ⟩ ∥ u 1 ∥ 2 u 1 = ( 1 0 2 ) − 1 2 ( 1 1 0 ) = ( 1 / 2 − 1 / 2 2 ) . \mathbf{u}_2 = \mathbf{v}_2 - \frac{\langle \mathbf{v}_2, \mathbf{u}_1 \rangle}{\|\mathbf{u}_1\|^2} \mathbf{u}_1 = \begin{pmatrix} 1 \\ 0 \\ 2 \end{pmatrix} - \frac{1}{2} \begin{pmatrix} 1 \\ 1 \\ 0 \end{pmatrix} = \begin{pmatrix} 1/2 \\ -1/2 \\ 2 \end{pmatrix}. u 2 = v 2 − ∥ u 1 ∥ 2 ⟨ v 2 , u 1 ⟩ u 1 = 1 0 2 − 2 1 1 1 0 = 1/2 − 1/2 2 .
Norm of u 2 \mathbf{u}_2 u 2 : ∥ u 2 ∥ 2 = ( 1 / 2 ) 2 + ( − 1 / 2 ) 2 + 2 2 = 1 / 4 + 1 / 4 + 4 = 9 / 2 ⟹ ∥ u 2 ∥ = 3 2 . \|\mathbf{u}_2\|^2 = (1/2)^2 + (-1/2)^2 + 2^2 = 1/4 + 1/4 + 4 = 9/2 \implies \|\mathbf{u}_2\| = \frac{3}{\sqrt{2}}. ∥ u 2 ∥ 2 = ( 1/2 ) 2 + ( − 1/2 ) 2 + 2 2 = 1/4 + 1/4 + 4 = 9/2 ⟹ ∥ u 2 ∥ = 2 3 .
Orthonormal basis vectors: e 1 = 1 2 ( 1 1 0 ) , e 2 = 2 3 ( 1 / 2 − 1 / 2 2 ) = 1 3 2 ( 1 − 1 4 ) . \mathbf{e}_1 = \frac{1}{\sqrt{2}} \begin{pmatrix} 1 \\ 1 \\ 0 \end{pmatrix}, \quad \mathbf{e}_2 = \frac{\sqrt{2}}{3} \begin{pmatrix} 1/2 \\ -1/2 \\ 2 \end{pmatrix} = \frac{1}{3\sqrt{2}} \begin{pmatrix} 1 \\ -1 \\ 4 \end{pmatrix}. e 1 = 2 1 1 1 0 , e 2 = 3 2 1/2 − 1/2 2 = 3 2 1 1 − 1 4 .
Problem 2: Definiteness via Sylvester's Criterion
Classify the quadratic form q ( x 1 , x 2 , x 3 ) = 2 x 1 2 + 2 x 2 2 + 2 x 3 2 − 2 x 1 x 2 − 2 x 2 x 3 q(x_1, x_2, x_3) = 2x_1^2 + 2x_2^2 + 2x_3^2 - 2x_1 x_2 - 2x_2 x_3 q ( x 1 , x 2 , x 3 ) = 2 x 1 2 + 2 x 2 2 + 2 x 3 2 − 2 x 1 x 2 − 2 x 2 x 3 .
Solution :
Construct the associated symmetric matrix A A A : A = ( 2 − 1 0 − 1 2 − 1 0 − 1 2 ) A = \begin{pmatrix} 2 & -1 & 0 \\ -1 & 2 & -1 \\ 0 & -1 & 2 \end{pmatrix} A = 2 − 1 0 − 1 2 − 1 0 − 1 2
Compute leading principal minors:
Δ 1 = det ( 2 ) = 2 > 0 \Delta_1 = \det(2) = 2 > 0 Δ 1 = det ( 2 ) = 2 > 0 .
Δ 2 = det ( 2 − 1 − 1 2 ) = 4 − 1 = 3 > 0 \Delta_2 = \det \begin{pmatrix} 2 & -1 \\ -1 & 2 \end{pmatrix} = 4 - 1 = 3 > 0 Δ 2 = det ( 2 − 1 − 1 2 ) = 4 − 1 = 3 > 0 .
Δ 3 = det ( A ) = 2 ( 4 − 1 ) − ( − 1 ) ( − 2 − 0 ) + 0 = 2 ( 3 ) − 2 = 6 − 2 = 4 > 0 \Delta_3 = \det(A) = 2(4 - 1) - (-1)(-2 - 0) + 0 = 2(3) - 2 = 6 - 2 = 4 > 0 Δ 3 = det ( A ) = 2 ( 4 − 1 ) − ( − 1 ) ( − 2 − 0 ) + 0 = 2 ( 3 ) − 2 = 6 − 2 = 4 > 0 .
Because all leading principal minors are strictly positive ( Δ 1 = 2 > 0 , Δ 2 = 3 > 0 , Δ 3 = 4 > 0 \Delta_1 = 2 > 0, \Delta_2 = 3 > 0, \Delta_3 = 4 > 0 Δ 1 = 2 > 0 , Δ 2 = 3 > 0 , Δ 3 = 4 > 0 ), Sylvester's Criterion confirms that A A A is positive definite .
GRE Exam Traps & Pitfalls
Trap 1: Misapplying Sylvester's Criterion to Semidefinite Forms Leading principal minors Δ k ≥ 0 \Delta_k \ge 0 Δ k ≥ 0 do NOT guarantee positive semidefiniteness! Consider A = ( 0 0 0 − 1 ) A = \begin{pmatrix} 0 & 0 \\ 0 & -1 \end{pmatrix} A = ( 0 0 0 − 1 ) . Here Δ 1 = 0 \Delta_1 = 0 Δ 1 = 0 and Δ 2 = 0 ≥ 0 \Delta_2 = 0 \ge 0 Δ 2 = 0 ≥ 0 , yet A A A has eigenvalue − 1 -1 − 1 and is indefinite. To test semidefiniteness, you must check all principal minors or compute the eigenvalues directly.
Trap 2: Normalization Omission in Gram-Schmidt Projections Forgetting to divide by ∥ u j ∥ 2 \|\mathbf{u}_j\|^2 ∥ u j ∥ 2 when calculating ⟨ v , u j ⟩ ∥ u j ∥ 2 u j \frac{\langle \mathbf{v}, \mathbf{u}_j \rangle}{\|\mathbf{u}_j\|^2} \mathbf{u}_j ∥ u j ∥ 2 ⟨ v , u j ⟩ u j distorts the orthogonal basis and destroys orthogonality.
Trap 3: Overlooking Complex Conjugation in Hermitian Matrices For complex vectors, ⟨ u , v ⟩ = ∑ u i v i ‾ \langle \mathbf{u}, \mathbf{v} \rangle = \sum u_i \overline{v_i} ⟨ u , v ⟩ = ∑ u i v i . Forgetting conjugation in v ∗ A v \mathbf{v}^* A \mathbf{v} v ∗ A v leads to incorrect, non-real expressions.