Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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 k≥1 and let p be a positive integer, with p≥2 over R and p≥1 over normalized C. Let G∈Fk×(k+p) have iid entries as in Standard real and normalized complex Gaussian matrix laws. Then G has full row rank almost surely and E∥G†∥F2={k/(p−1),F=R,k/p,F=C. The complex entry convention is variance one, E∣Gij∣2=1. Write G†=G+ for the Moore–Penrose pseudoinverse of The Moore--Penrose pseudoinverse A+ as the solution of the four Penrose equations. On the full-row-rank event, G†=G∗(GG∗)−1,(G†)∗G†=(GG∗)−1. Here U∼Γ(a,θ) means that U has density ua−1e−u/θ/(θaΓ(a)) for u>0. For every diagonal index i, ((GG∗)−1)ii has distribution 1/U with U∼Γ((p+1)/2,2) over R and U∼Γ(p+1,1) over C.

Facts & Assumptions

Given: A finite iid Gaussian matrix, with Countable Choice for finite-dimensional Lebesgue measure.

[F1]

Standard real and normalized complex Gaussian matrix laws: rows have independent entries with real density (2π)−1/2e−x2/2 or normalized complex density π−1e−∣z∣2.

[F2]

A k×ℓ Gaussian matrix with ℓ>k has full row rank almost surely (A wide Gaussian matrix has full row rank almost surely).

[F3]

For a,b>0, B(a,b)=Γ(a)Γ(b)/Γ(a+b) (The real Beta--Gamma identity).

[F4]

The Gamma function is the Euler integral Γ(a)=∫0∞ta−1e−t dt for a>0 (The real Gamma function by Euler's integral).

[F5]

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).

[F7]

Orthogonal/unitary changes preserve the Gaussian density and its product factorization (Orthogonal and unitary invariance of Gaussian matrix blocks).

[F8]

A Moore–Penrose pseudoinverse satisfies the four Penrose equations (The Moore--Penrose pseudoinverse A+ as the solution of the four Penrose equations).

[F9]
[F10]

Under Countable Choice, a C1 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).

[F11]

Under Countable Choice, polar coordinates in R2 give dx=r dr dσ (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma). Its angular normalization here is determined by the probability density in [F1].

[F12]

Γ(a)=(a−1)Γ(a−1) for a>1, and Γ(1)=1 (The real Gamma functional equation Γ(s+1)=sΓ(s)).

[A1]

Countable Choice is the axiom used to obtain the repository's finite-dimensional Lebesgue measure (The Axiom of Countable Choice (ACω)).

Proof

1.1givenF2A1algebra

Write G=[gH] with first row g and remaining k−1 rows H. If k=1, set P=Ik+p; then GG∗=gg∗=gPg∗ and the inverse-diagonal identity is immediate. If k>1, [F2] gives full row rank of H, so P=I−H∗(HH∗)−1H is the orthogonal projector onto ker⁡H, of dimension (k+p)−(k−1)=p+1. To obtain the inverse entry without an assumed block-inverse formula, solve GG∗(xy)=(10). The lower equation gives y=−(HH∗)−1Hg∗x, and substitution into the upper equation gives (gPg∗)x=1. Full row rank of G from [F2] makes GG∗ invertible and gPg∗>0, hence ((GG∗)−1)11=x=(gPg∗)−1.

2.1step 1.1F1F3F5F6F7F10F11F12choose

For each fixed H, choose orthonormal coordinates in which P is diagonal with p+1 ones. Independence of g from H and invariance [F7] show that gPg∗ is a sum of p+1 independent squared real Gaussians, or squared moduli of normalized complex Gaussians. Apply [F10] separately on the open half-lines via x=u and x=−u (absolute derivative 1/(2u)); the omitted point has zero measure. Adding the two densities gives the real square density u−1/2e−u/2/2π=u−1/2e−u/2/(2Γ(1/2)) by [F6]. For the complex square law, [F11] applied to the normalized density gives 1=π−1σ(S1)∫0∞e−r2r dr=σ(S1)/(2π), so σ(S1)=2π. Applying the same formula with any nonnegative Borel function of r2, and then [F10] with u=r2, shows that the squared modulus has density e−u on (0,∞). The first real square is thus Gamma(1/2,2) and the complex square Gamma(1,1), the latter normalized by [F12]. If independent Gamma variables have common scale θ and shapes a,b, [F5] and the diffeomorphism (u,v)↦(u,s=u+v) of the positive quadrant onto 0<u<s, of determinant one in [F10], show that their sum has convolution density with normalization 1/(θa+bΓ(a)Γ(b)) and numerator e−s/θ∫0sua−1(s−u)b−1du. For each s>0, substituting u=st by [F10] and using [F3] makes this e−s/θsa+b−1B(a,b), which is the Gamma density of shape a+b and scale θ. Iterating this finite convolution gives gPg∗∼Γ((p+1)/2,2) over R and gPg∗∼Γ(p+1,1) over C. Tonelli [F5] integrates first over g and then over H, so the reciprocal law holds unconditionally for the first diagonal entry; row permutation invariance gives the same law for every index.

3.1step 2.1F4F10F12algebra

Integrating the Gamma density with the scaling u=θt from [F10] yields EU−1=θ−1Γ(a−1)/Γ(a) for U∼Γ(a,θ) and a>1. Using the Gamma recurrence [F12] gives Γ(a)=(a−1)Γ(a−1). Thus step 2.1 gives E((GG∗)−1)11=1/(p−1) over R and 1/p over C.

4.1step 2.1step 3.1F2F8F9algebra∎

By step 2.1 all inverse diagonal entries have the same reciprocal-Gamma law and finite mean in the stated ranges, so Etr⁡(GG∗)−1 is k times the value in step 3.1. Put B=G∗(GG∗)−1. Then GB=Ik, BG is self-adjoint and idempotent, so GBG=G, BGB=B, (GB)∗=GB, and (BG)∗=BG; these are the four Penrose equations [F8], hence uniqueness [F9] gives B=G†. Also B∗B=(GG∗)−1, and therefore ∥G†∥F2=tr⁡(GG∗)−1 almost surely.

Depends on

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