Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

A non-negative operator has a unique non-negative square root

Statement

Let V be a finite-dimensional real or complex inner product space and let T:VV be non-negative. Then there exists a unique non-negative operator R:VV such that

R2=T.

Facts & Assumptions

Given: A finite-dimensional real or complex inner product space V and a non-negative endomorphism T:VV.

[L2]

Every nonnegative real number has a unique nonnegative square root (Square roots exist: a unique a0 with (a)2=a; the positives are {x2:x0}).

Proof

technique · direct
1.1

By [L1], there is an orthonormal basis (e1,,en) of V and numbers λ1,,λn0 such that Tej=λjej. By [L2], each λj has a nonnegative square root. Define R by Rej=λjej. Then R2ej=λjej=Tej for every j, so R2=T; the same basis shows that R is self-adjoint with nonnegative eigenvalues, hence non-negative by [L1].

L1L2algebra
2.1

Let Q be another non-negative square root of T. Because Q2=T, each eigenspace Eλ(T) is Q-invariant. On Eλ(T) one has Q2=λI, and [L1] applied to the non-negative operator QEλ(T) shows that all its eigenvalues are nonnegative; by [L2], the only nonnegative number whose square is λ is λ, so Q=λI on Eλ(T). Thus Q acts on every basis vector ej exactly as R does, and therefore Q=R.

L1L2step 1.1

Depends on

Used by

Dependency tree · two levels

12 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