Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
About this page
How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
✓ 25 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 21 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
Abstract Algebra
- Binary Operations, Monoids, Groups and Subgroups
- Cosets, Index and Lagrange's Theorem
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Normal Subgroups and Quotient Groups
- Polynomial Rings, the Division Algorithm and Roots
- Rings, Subrings, Integral Domains and Fields
- Simple Field Extensions and the Construction of the Complex Numbers
Linear Algebra
- Determinants of Matrices over a Commutative Ring
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- Vector Spaces, Linear Subspaces, Span and Direct Sums
Real Analysis
2 · Logical flowchart
3 · Items
Definition
Real and complex inner product spaces, with the inner product linear in the first argument
Definition
The norm ‖ v‖=√⟨ v,v⟩ induced by a real or complex inner product
Proposition
The standard formulas ⟨ x,y⟩=∑_k<nxₖ yₖ on ℝⁿ and ∑_k<nxₖyₖ on ℂⁿ are inner products
Lemma
Inner products separate vectors, and the induced norm is homogeneous: ‖λ v‖=|λ|‖ v‖
Theorem
Cauchy–Schwarz: |⟨ u,v⟩|≤‖ u‖‖ v‖, with equality exactly for linearly dependent vectors
Corollary
The inner-product norm is definite, homogeneous, and satisfies the triangle inequality
Proposition
Pythagoras, the parallelogram identity, and the real and complex polarisation identities
Proposition
On ℝⁿ, abstract Cauchy–Schwarz is exactly the published finite-sum Cauchy–Schwarz inequality
Definition
Orthogonal vectors and subspaces, orthogonal and orthonormal sets, and orthonormal bases
Definition
The orthogonal complement W^⊥={v:⟨ v,w⟩=0 for all w∈ W}
Theorem
Every finite orthogonal list of nonzero vectors is linearly independent
Theorem
Gram–Schmidt turns every finite independent list into an orthonormal list with the same successive spans
Corollary
Every finite-dimensional real or complex inner product space has an orthonormal basis
Theorem
Bessel's inequality for a finite orthonormal list and Parseval's identity for an orthonormal basis
Theorem
For a subspace W of a finite-dimensional inner product space, V=W⊕ W^⊥
Corollary
In finite dimension, W^⊥⊥=W and dim W+dim W^⊥=dim V
Definition
The orthogonal projection P_Wv is the W-component in V=W⊕ W^⊥
Proposition
Orthogonal projection is linear, and an orthonormal basis (eᵢ) of W gives P_Wv=∑ᵢ⟨ v,eᵢ⟩ eᵢ
Theorem
The orthogonal projection is the unique nearest point in the subspace
Definition
The Gram matrix G(v₀,…,vᵣ₋₁)=(⟨ vᵢ,vⱼ⟩)_i,j<r and Gram determinant, with empty value 1
Theorem
A Gram determinant is nonnegative and is positive exactly when the vector list is linearly independent
Theorem
Every invertible real or complex square matrix has a unique factorisation A=QR with Q orthogonal or unitary and R upper triangular with positive real diagonal
Theorem
Finite-dimensional Riesz representation: every functional is uniquely v↦⟨ v,w⟩
Definition
The adjoint T^*:W→ V is characterised by ⟨ Tv,w⟩_W=⟨ v,T^*w⟩_V
Theorem
Every linear map between finite-dimensional inner product spaces has a unique adjoint
Proposition
Adjoints satisfy (S+T)^*=S^*+T^*, (λ T)^*=λ̄ T^*, (ST)^*=T^*S^*, and T^**=T
Theorem
In orthonormal bases, the matrix of the adjoint is the conjugate transpose of the matrix
Theorem
ker T^*=(imT)^⊥ and imT^*=(ker T)^⊥ in finite dimension
Theorem
For a linear map T:V→ W between finite-dimensional inner-product spaces, x minimises ‖ Tx-b‖ if and only if T^*(Tx-b)=0, equivalently T^*Tx=T^*b; minimisers exist and any two differ by an element of ker T
Lemma
If W is T-invariant, then W^⊥ is T^*-invariant
Theorem
An endomorphism is an orthogonal projection exactly when it is idempotent and self-adjoint
Definition
Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces
Theorem
For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and T^*T=I are equivalent
Corollary
Orthogonal and unitary operators form groups, and their determinants have modulus one
Sources
- Sheldon Axler, Linear Algebra Done Right, 4th ed., §6A
- Sergei Treil, Linear Algebra Done Wrong, Ch. 5, §5.1
- Sheldon Axler, Linear Algebra Done Right, 4th ed., §6A, Example 6.3
- Sheldon Axler, Linear Algebra Done Right, 4th ed., §§6A–6B
- Sergei Treil, Linear Algebra Done Wrong, Ch. 5, §§5.1–5.3
- Sheldon Axler, Linear Algebra Done Right, 4th ed., §6C
- Sergei Treil, Linear Algebra Done Wrong, Ch. 5, §5.2
- Sheldon Axler, Linear Algebra Done Right, 4th ed., result 6.25
- Sergei Treil, Linear Algebra Done Wrong, Theorem 5.2.6
- Sheldon Axler, Linear Algebra Done Right, 4th ed., result 6.32
- Sergei Treil, Linear Algebra Done Wrong, §5.3.1
- Sheldon Axler, Linear Algebra Done Right, 4th ed., result 6.35
- Sheldon Axler, Linear Algebra Done Right, 4th ed., results 6.24, 6.26, and 6.30
- Sheldon Axler, Linear Algebra Done Right, 4th ed., result 6.49
- Sergei Treil, Linear Algebra Done Wrong, §5.3.3
- Sheldon Axler, Linear Algebra Done Right, 4th ed., results 6.51 and 6.52
- Sergei Treil, Linear Algebra Done Wrong, Proposition 5.3.6
- Sheldon Axler, Linear Algebra Done Right, 4th ed., definition 6.55
- Sergei Treil, Linear Algebra Done Wrong, Definition 5.3.1
- Sheldon Axler, Linear Algebra Done Right, 4th ed., result 6.57
- Sergei Treil, Linear Algebra Done Wrong, Proposition 5.3.3 and Remark 5.3.4
- Sheldon Axler, Linear Algebra Done Right, 4th ed., result 6.61
- Sergei Treil, Linear Algebra Done Wrong, Theorem 5.3.2
- Kenneth Hoffman and Ray Kunze, Linear Algebra, 2nd ed., p. 332, Theorem 7
- Sheldon Axler, Linear Algebra Done Right, 4th ed., result 7.58
- Sheldon Axler, Linear Algebra Done Right, 4th ed., result 6.42
- Sheldon Axler, Linear Algebra Done Right, 4th ed., definition 7.1
- Sergei Treil, Linear Algebra Done Wrong, §5.5.1
- Sheldon Axler, Linear Algebra Done Right, 4th ed., discussion following definition 7.1
- Sheldon Axler, Linear Algebra Done Right, 4th ed., result 7.5
- Sergei Treil, Linear Algebra Done Wrong, §5.5.1, useful formulas for adjoints
- Sheldon Axler, Linear Algebra Done Right, 4th ed., result 7.9
- Sheldon Axler, Linear Algebra Done Right, 4th ed., result 7.6
- Sergei Treil, Linear Algebra Done Wrong, Theorem 5.5.1
- Sergei Treil, Linear Algebra Done Wrong, §5.4.1
- Sheldon Axler, Linear Algebra Done Right, 4th ed., §7A
- Sheldon Axler, Linear Algebra Done Right, 4th ed., §§6C and 7A
- Sheldon Axler, Linear Algebra Done Right, 4th ed., definitions 7.44 and 7.51
- Sheldon Axler, Linear Algebra Done Right, 4th ed., results 7.45, 7.49, and 7.53
- Sheldon Axler, Linear Algebra Done Right, 4th ed., §7D