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.
Real symmetric quadratic forms tested on phasors
Statement
Let be a finite set and a real symmetric matrix, meaning . For with , write and . Then .
Thus is positive semidefinite on real vectors, meaning for every , if and only if for every . Likewise, for every nonzero real if and only if for every nonzero complex .
For any real symmetric array , let , so that , with when and otherwise. Then . This identity allows signed coefficients ; nonnegativity of the form requires a separate positive-semidefiniteness premise.
Statement references
Facts & Assumptions
On a finite vertex set, matrix action and the second-linear inner product are given by finite sums, and a real symmetric matrix is self-adjoint (Finite vertex Hilbert space in the article convention).
Complex conjugation preserves sums and products, fixes real numbers, and satisfies (Conjugation is an involutive real-field automorphism, zz̄=|z|², and modulus is definite, multiplicative, and subadditive).
Proof
Given: A finite set , a real symmetric matrix , a vector with real , and a real symmetric array .
Goal: Prove the quadratic-form decomposition, the two positivity equivalences, and the signed-weight identity.
Expanding the finite sums using [F1] and [F2] gives . Interchanging and in the finite sum and using gives . The imaginary term therefore vanishes, proving the decomposition.
If for all real , the decomposition makes for all complex ; the converse follows by taking . If the real form is strictly positive on nonzero vectors, then a nonzero has at least one nonzero component vector, and the decomposition is strictly positive because the other term is nonnegative. The converse again follows by taking .
By [F2], . Since , interchanging the indices in the second diagonal sum and in the last cross term yields , by the matrix action in [F1]. No sign condition on was used. If is positive semidefinite on real vectors, step 2.1 gives nonnegativity on complex vectors.
Depends on
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.