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 square root and covariance matrices
Remark
Assume AC. Let be a nonzero finite-dimensional complex inner-product space and let be a positive covariance matrix, that is a self-adjoint operator on with for every (Self-adjoint, positive, unitary and normal operators, Order on bounded self adjoint operators). Then has a unique positive square root , obtained by the same continuous functional calculus as on the main page: since is finite dimensional and nonzero the spectrum of is a finite nonempty subset of , and is applied to by the calculus, the square root lying in (Positive square root).
Unitary covariance change. If is unitary on , then : the operator is positive, because , and its square is ; uniqueness of the positive square root therefore identifies it with . In particular the square root is equivariant under the unitary changes of coordinates in which covariance matrices are compared.
Scope. This remark is orientation for the probability track: covariance matrices are positive, and the finite-dimensional instance of the positive-square-root theorem supplies their standard square roots. It proves no probability theorem, and it does not assert positivity of any particular covariance matrix; that positivity is a hypothesis of the interface, to be supplied by the consumer (The Axiom of Choice for the declared choice strength).
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
22 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
- Theo Bühler and Dietmar Salamon, Functional Analysis, §5.4, printed pp.245–260 (standard reference, not scraped)
- John B. Conway, A Course in Functional Analysis, 2nd ed., Chapter IX §3, printed pp.239–243 (standard reference, not scraped)