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.
Exact Frobenius moments of wide Gaussian pseudoinverses
Statement
Assume Countable Choice for the finite-dimensional Gaussian probability law. Let and let be a positive integer, with over and over normalized . Let have iid entries as in Standard real and normalized complex Gaussian matrix laws. Then has full row rank almost surely and The complex entry convention is variance one, . Write for the Moore–Penrose pseudoinverse of The Moore--Penrose pseudoinverse as the solution of the four Penrose equations. On the full-row-rank event, Here means that has density for . For every diagonal index , has distribution with over and over .
Facts & Assumptions
Given: A finite iid Gaussian matrix, with Countable Choice for finite-dimensional Lebesgue measure.
Standard real and normalized complex Gaussian matrix laws: rows have independent entries with real density or normalized complex density .
A Gaussian matrix with has full row rank almost surely (A wide Gaussian matrix has full row rank almost surely).
For , (The real Beta--Gamma identity).
The Gamma function is the Euler integral for (The real Gamma function by Euler's integral).
Nonnegative measurable functions on a sigma-finite product may be integrated in either order (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).
Orthogonal/unitary changes preserve the Gaussian density and its product factorization (Orthogonal and unitary invariance of Gaussian matrix blocks).
A Moore–Penrose pseudoinverse satisfies the four Penrose equations (The Moore--Penrose pseudoinverse as the solution of the four Penrose equations).
The matrix satisfying those equations is unique (Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse).
Under Countable Choice, a diffeomorphism between open real coordinate domains transforms every nonnegative measurable integral by the absolute Jacobian determinant (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions).
Under Countable Choice, polar coordinates in give (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma). Its angular normalization here is determined by the probability density in [F1].
for , and (The real Gamma functional equation ).
Countable Choice is the axiom used to obtain the repository's finite-dimensional Lebesgue measure (The Axiom of Countable Choice ()).
Proof
Write with first row and remaining rows . If , set ; then and the inverse-diagonal identity is immediate. If , [F2] gives full row rank of , so is the orthogonal projector onto , of dimension . To obtain the inverse entry without an assumed block-inverse formula, solve . The lower equation gives , and substitution into the upper equation gives . Full row rank of from [F2] makes invertible and , hence .
For each fixed , choose orthonormal coordinates in which is diagonal with ones. Independence of from and invariance [F7] show that is a sum of independent squared real Gaussians, or squared moduli of normalized complex Gaussians. Apply [F10] separately on the open half-lines via and (absolute derivative ); the omitted point has zero measure. Adding the two densities gives the real square density by [F6]. For the complex square law, [F11] applied to the normalized density gives , so . Applying the same formula with any nonnegative Borel function of , and then [F10] with , shows that the squared modulus has density on . The first real square is thus Gamma and the complex square Gamma, the latter normalized by [F12]. If independent Gamma variables have common scale and shapes , [F5] and the diffeomorphism of the positive quadrant onto , of determinant one in [F10], show that their sum has convolution density with normalization and numerator . For each , substituting by [F10] and using [F3] makes this , which is the Gamma density of shape and scale . Iterating this finite convolution gives over and over . Tonelli [F5] integrates first over and then over , so the reciprocal law holds unconditionally for the first diagonal entry; row permutation invariance gives the same law for every index.
Integrating the Gamma density with the scaling from [F10] yields for and . Using the Gamma recurrence [F12] gives . Thus step 2.1 gives over and over .
By step 2.1 all inverse diagonal entries have the same reciprocal-Gamma law and finite mean in the stated ranges, so is times the value in step 3.1. Put . Then , is self-adjoint and idempotent, so , , , and ; these are the four Penrose equations [F8], hence uniqueness [F9] gives . Also , and therefore almost surely.
Depends on
- Standard real and normalized complex Gaussian matrix laws
- Orthogonal and unitary invariance of Gaussian matrix blocks
- A wide Gaussian matrix has full row rank almost surely
- The real Beta--Gamma identity
- The real Gamma function by Euler's integral
- $\Gamma(1/2)=\sqrt\pi$ from the Gaussian integral
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- The Moore--Penrose pseudoinverse $A^+$ as the solution of the four Penrose equations
- Every finite real or complex matrix has a unique Moore--Penrose pseudoinverse
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions
- Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma
- The real Gamma functional equation $\Gamma(s+1)=s\Gamma(s)$
Used by
Dependency tree · two levels
57 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
- Halko, Martinsson, and Tropp, Finding Structure with Randomness, Proposition 10.2 and Appendix A.1 (standard reference, not scraped)
- Martinsson and Tropp, Randomized Numerical Linear Algebra: Foundations & Algorithms, §11.4.2 (standard reference, not scraped)