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.
Pseudoinversion is involutive, commutes with adjoints, and is equivariant under unitary left and right factors
Statement
Let be a finite real or complex matrix.
- .
- .
- If and are unitary of compatible sizes, then .
Facts & Assumptions
Given: A matrix over or , and compatible unitary matrices and .
Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse (Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse).
Unitary operators preserve the inner product and satisfy (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces).
Proof
Because satisfies the Penrose equations for , the same equations read in reverse order show that satisfies the Penrose equations for : and the products and are already self-adjoint.
Put . Using [L2] and the Penrose equations for , and similarly . The products and are and , hence self-adjoint.
By uniqueness in [L1], the Moore--Penrose pseudoinverse of is . Hence .
Taking adjoints of the Penrose equations for shows that obeys and that and are self-adjoint.
Therefore is the Moore--Penrose pseudoinverse of , so uniqueness in [L1] gives .
So is a Moore--Penrose pseudoinverse of , and [L1] yields . Together with steps 2.1 and 3.1, this proves the three claims.
Depends on
Used by
Dependency tree · two levels
7 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
- Roger Penrose, A generalized inverse for matrices (standard reference, not scraped)