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

Every endomorphism has a polar decomposition T = SU with U non-negative and S an isometry on the orthogonal complement of ker T, and S is unique exactly when T is invertible

Statement

Let T:V→V be an endomorphism of a finite-dimensional real or complex inner product space. Then there exist a non-negative endomorphism U and a linear isometry S:V→V such that

T=SUandU=T∗T.

Equivalently, S is an isometry on (ker⁡T)⊥=im⁡U. The factor S is unique if and only if T is invertible.

Facts & Assumptions

Given: An endomorphism T:V→V of a finite-dimensional real or complex inner product space.

[L1]

There are orthonormal bases (ej) and (fj) and singular values s1≥⋯≥sr>0=sr+1=⋯=sn such that Tej=sjfj for all j (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).

[L2]

A linear map that sends an orthonormal basis to an orthonormal basis is a linear isometry (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces).

[L3]

A non-negative operator has a unique non-negative square root (A non-negative operator has a unique non-negative square root).

Proof

technique · direct
1.1L1L2L3algebra

By [L1], define Uej:=sjej and Sej:=fj for every j. Then S is a linear isometry by [L2], SUej=sjfj=Tej for every basis vector, hence T=SU, and U2ej=sj2ej=T∗Tej. Thus U2=T∗T, and because U is self-adjoint with nonnegative eigenvalues in the basis (ej), [L3] identifies U with the unique non-negative square root T∗T.

2.1step 1.1algebra

If T is invertible, then all singular values are positive, so U is invertible. Any other factorisation T=S′U with the same non-negative factor U=T∗T satisfies S′=TU−1=S, so S is unique.

3.1step 1.1algebra∎

If T is not invertible, then r<n. Define another isometry S′ by S′ej=fj for j≠r+1 and S′er+1=−fr+1. Then S′≠S, but S′Uej=SUej=Tej for j≤r and S′Uej=0=Tej for j>r because sj=0. Hence S′U=T, so uniqueness fails.

Depends on

Used by

Dependency tree · two levels

11 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