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.
The Moore--Penrose pseudoinverse exchanges image and adjoint-image, and exchanges kernel and adjoint-kernel
Statement
For every finite real or complex matrix ,
and
Facts & Assumptions
Given: A finite real or complex matrix .
and are the orthogonal projections onto and ( and are the orthogonal projections onto and ).
Pseudoinversion is involutive and adjoint-compatible: and (Pseudoinversion is involutive, commutes with adjoints, and is equivariant under unitary left and right factors).
For every finite-dimensional operator, and ( and in finite dimension).
Proof
Apply [L1] to : is the orthogonal projection onto . Apply [L1] again to and use [L2] to identify ; then is also the orthogonal projection onto . Orthogonal projections onto a given space are unique, so .
Using [L2] in the same way, is both the orthogonal projection onto and the orthogonal projection onto . Hence .
By [L3] and step 1.1,
By [L3] and step 2.1,
Steps 1.1, 2.1, 3.1, and 2.2 give the image and kernel identities.
Depends on
- Pseudoinversion is involutive, commutes with adjoints, and is equivariant under unitary left and right factors
- $AA^+$ and $A^+A$ are the orthogonal projections onto $\operatorname{im}A$ and $\operatorname{im}A^*$
- $\ker T^*=(\operatorname{im}T)^\perp$ and $\operatorname{im}T^*=(\ker T)^\perp$ in finite dimension
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
- Roger Penrose, A generalized inverse for matrices (standard reference, not scraped)
- Stanford CS205L, Unit 11: Zero Singular Values (standard reference, not scraped)