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.
Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form
Definition
Let be a symmetric bilinear form on a finite-dimensional real vector space, and write . The form is positive definite when for every , and negative definite when for every . The same terminology applies to the associated quadratic form.
Suppose a basis gives a diagonal matrix with positive diagonal entries, negative diagonal entries, and zero entries. Its inertia is the triple , its rank is , and its signature is . Sylvester's law of inertia proves that this triple is independent of the diagonalizing basis, and therefore justifies the notation.
Depends on
Used by
- Positive determinant does not imply positive definiteness Counterexample
- Same complexification with different killing form signatures Counterexample
- Nondegenerate critical points, nullity, index, and coindex Definition
- If v₁,…,vₘ∈ℝⁿ satisfy ⟨ vᵢ,vⱼ⟩=t≥0 for i≠ j and ⟨ vᵢ,vᵢ⟩>t, they are linearly independent Lemma
- Sylvester inertia makes the Morse index intrinsic Lemma
- Over the reals, non-negative and positive operators correspond exactly to positive semidefinite and positive definite symmetric forms Proposition
- Sylvester's law of inertia: every real symmetric form is congruent to diag(Iₚ,-I_q,0ᵣ), and (p,q,r) is unique Theorem
Dependency tree · two levels
17 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- H. Pinkham, Linear Algebra, §7.7 (standard reference, not scraped)
- J. Kuan, Positive Definite Matrices (standard reference, not scraped)