Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
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.
✓ 23 results · all verified · 8 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 15 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
Abstract Algebra
Linear Algebra
Real Analysis
2 · Logical flowchart
3 · Items
Definition
Linear functionals and the algebraic dual V^*=L(V,F)
Definition
The dual family (b^*)_b∈ B associated to a Hamel basis B, defined by b^*(c)=δ_bc
Theorem
The dual family of a finite basis is a basis of the dual space, with the same dimension
Theorem
For an infinite Hamel basis, its dual family is linearly independent but does not span the algebraic dual
Lemma
Assuming choice, if v∉ U≤ V, some f∈ V^* vanishes on U and satisfies f(v)=1
Definition
The canonical evaluation map J_V:V→ V^** given by J_V(v)(f)=f(v)
Theorem
Assuming choice, the canonical map J_V:V→ V^** is linear and injective
Theorem
Assuming choice, J_V:V→ V^** is surjective if and only if V is finite-dimensional
Definition
The annihilator U^∘≤ V^* of U≤ V and the preannihilator ^∘ S≤ V of S≤ V^*
Theorem
Assuming choice, ^∘(U^∘)=U; in finite dimension, dim U^∘=dim V-dim U
Definition
The transpose or algebraic adjoint T^*:W^*→ V^*, T^*(g)=g∘ T, of a linear map T:V→ W
Proposition
Transpose is linear, sends identities to identities, and reverses composition: (S∘ T)^*=T^*∘ S^*
Theorem
Assuming choice, ker T^*=(imT)^∘ and imT^*=(ker T)^∘; in finite dimensions rankT^*=rankT
Theorem
In dual bases, the matrix of T^* is the transpose of the matrix of T
Definition
Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms
Theorem
Alternating forms are skew-symmetric; the converse holds when charF≠2, while in characteristic 2 alternating forms are symmetric
Theorem
Bilinear forms on V correspond linearly and bijectively to linear maps V→ V^*
Definition
The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space
Theorem
A basis change by P changes the matrix of a bilinear form from A to P^TAP
Corollary
Congruent matrices have the same rank; hence rank and nondegeneracy of a bilinear form are basis-independent
Definition
Sesquilinear and Hermitian forms over a field with an involution, using the convention linear in the first variable
Theorem
For the linear-first convention, a basis change by P sends a sesquilinear matrix A to P^TA σ(P); Hermitian forms satisfy A=σ(A)^T
Definition
A quadratic form q in arbitrary characteristic and its polar form b_q(u,v)=q(u+v)-q(u)-q(v)
Theorem
If charF≠2, quadratic forms and symmetric bilinear forms correspond by q(v)=B(v,v) and B(u,v)=1/2 b_q(u,v)
Theorem
Every symmetric bilinear form on a finite-dimensional space over a field of characteristic not 2 has an orthogonal basis
Corollary
Over a field of characteristic not 2, every symmetric matrix is congruent to a diagonal matrix
Corollary
Over a field of characteristic not 2, every quadratic form has diagonal coordinates q(x)=a₁x₁²+⋯+aₙxₙ²
Theorem
Every alternating form on a finite-dimensional space has a basis of symplectic pairs followed by a basis of its radical; in particular its rank is even
Definition
Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p-q of a real symmetric bilinear or quadratic form
Theorem
Sylvester's law of inertia: every real symmetric form is congruent to diag(Iₚ,-I_q,0ᵣ), and (p,q,r) is unique
Corollary
Two real symmetric bilinear forms are congruent if and only if they have the same inertia
Lemma
For symmetric M=beginpmatrixA&BB^T&C endpmatrix with A invertible, a block-unitriangular congruence gives A⊕(C-B^TA⁻¹B) and factors det M
Theorem
Sylvester's criterion: a real symmetric n× n matrix with n≥1 is positive definite if and only if all leading principal minors are positive
Sources
- H. Pinkham, Linear Algebra, §6.1
- K. Conrad, Infinite-Dimensional Dual Spaces
- H. Pinkham, Linear Algebra, Chapter 6
- K. Conrad, Infinite-Dimensional Dual Spaces, Theorem 1
- K. Conrad, Infinite-Dimensional Dual Spaces, Corollary 2
- H. Pinkham, Linear Algebra, §6.4
- H. Pinkham, Linear Algebra, §§6.4–6.6
- K. Conrad, Bilinear Forms
- H. Pinkham, Linear Algebra, Chapter 7
- K. Conrad, Bilinear Forms, §4
- H. Pinkham, Linear Algebra, Chapters 6–7
- K. Conrad, Bilinear Forms, §§1 and 4
- H. Pinkham, Linear Algebra, §7.7
- H. Pinkham, Linear Algebra, §7.8
- K. Conrad, Bilinear Forms, §7
- K. Conrad, Bilinear Forms, §5
- K. Conrad, Bilinear Forms, §6
- J. Kuan, Positive Definite Matrices