Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-28
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.

Over the reals, non-negative and positive operators correspond exactly to positive semidefinite and positive definite symmetric forms

Statement

Let V be a finite-dimensional real inner product space. The assignment

TBT,BT(u,v):=Tu,v,

restricts to a bijection between self-adjoint endomorphisms of V and symmetric bilinear forms on V. Under this bijection, non-negative operators correspond exactly to positive semidefinite forms, and positive operators correspond exactly to positive definite forms.

Facts & Assumptions

Given: A finite-dimensional real inner product space V, a linear map T:VV, and the bilinear form BT(u,v):=Tu,v.

[L1]

Bilinear forms on V correspond bijectively to linear maps VV (Bilinear forms on V correspond linearly and bijectively to linear maps VV).

[L2]

On a finite-dimensional real inner product space, every linear functional is uniquely of the form vv,w for some w (Finite-dimensional Riesz representation: every functional is uniquely vv,w).

[L3]

A symmetric bilinear form is positive semidefinite or positive definite exactly when its quadratic values satisfy the corresponding weak or strict inequalities (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature pq of a real symmetric bilinear or quadratic form).

Proof

technique · direct
1.1

For a linear map T, the form BT(u,v)=Tu,v is bilinear. Conversely, let B be a bilinear form on V. By [L1], the assignment uB(u,) is a linear map VV. For each uV, [L2] gives a unique vector TuV such that B(u,v)=Tu,v for every vV. If a,bR and u,uV, then for every v one has T(au+bu),v=B(au+bu,v)=aB(u,v)+bB(u,v)=aTu+bTu,v, so uniqueness in [L2] gives T(au+bu)=aTu+bTu. Thus T is linear, and the correspondence TBT is bijective on all linear maps and bilinear forms. In the real case, T is self-adjoint exactly when Tu,v=u,Tv for all u,v, and symmetry of the inner product makes this exactly the condition BT(u,v)=BT(v,u). Thus self-adjoint endomorphisms correspond exactly to symmetric bilinear forms.

L1L2algebra
2.1

For every vV, one has BT(v,v)=Tv,v. Therefore the weak inequality in Non-negative and positive operators is exactly the positive-semidefinite condition in [L3], and the strict inequality on nonzero vectors is exactly the positive-definite condition in [L3].

L3algebra

Depends on

Used by

Dependency tree · two levels

14 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