Alphabeta Math
PropositionStatement: AI-generatedProof: AI-generated
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 V be a finite set and B=(Bxy)x,y∈V a real symmetric matrix, meaning Bxy=Byx∈R. For f=u+iv∈CV with u,v∈RV, write f∗Bf=∑x,y∈Vfx‾Bxyfy and uTBu=∑x,y∈VuxBxyuy. Then f∗Bf=uTBu+vTBv.

Thus B is positive semidefinite on real vectors, meaning uTBu≥0 for every u∈RV, if and only if f∗Bf≥0 for every f∈CV. Likewise, uTBu>0 for every nonzero real u if and only if f∗Bf>0 for every nonzero complex f.

For any real symmetric array b=(bxy)x,y∈V, let L=diag⁡(∑ybxy)−b, so that Lxy=δxy∑zbxz−bxy, with δxy=1 when x=y and 0 otherwise. Then f∗Lf=12∑x,y∈Vbxy∣fx−fy∣2. This identity allows signed coefficients bxy; nonnegativity of the form requires a separate positive-semidefiniteness premise.

Facts & Assumptions

[F1]

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).

[F2]

Complex conjugation preserves sums and products, fixes real numbers, and satisfies zz‾=∣z∣2 (Conjugation is an involutive real-field automorphism, zz̄=|z|², and modulus is definite, multiplicative, and subadditive).

Proof

Given: A finite set V, a real symmetric matrix B, a vector f=u+iv with real u,v, and a real symmetric array b.

Goal: Prove the quadratic-form decomposition, the two positivity equivalences, and the signed-weight identity.

1.1F1F2algebra

Expanding the finite sums using [F1] and [F2] gives f∗Bf=uTBu+vTBv+i(uTBv−vTBu). Interchanging x and y in the finite sum and using Bxy=Byx gives vTBu=uTBv. The imaginary term therefore vanishes, proving the decomposition.

2.1step 1.1algebra

If uTBu≥0 for all real u, the decomposition makes f∗Bf≥0 for all complex f; the converse follows by taking v=0. If the real form is strictly positive on nonzero vectors, then a nonzero f=u+iv 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 v=0.

3.1F1F2step 2.1algebra∎

By [F2], ∣fx−fy∣2=∣fx∣2+∣fy∣2−fx‾fy−fy‾fx. Since bxy=byx, interchanging the indices in the second diagonal sum and in the last cross term yields 12∑x,ybxy∣fx−fy∣2=∑x(∑ybxy)∣fx∣2−∑x,ybxyfx‾fy=f∗Lf, by the matrix action in [F1]. No sign condition on b was used. If L is positive semidefinite on real vectors, step 2.1 gives nonnegativity on complex vectors.

Depends on

Used by · 4

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.