A standard Gaussian matrix has full rank almost surely
ProvedGaussianMatrix.full_rank_aeLet be a standard Gaussian matrix. Then, almost surely,
Equivalently, a wide () Gaussian matrix has full row rank and is invertible almost surely; a tall one has full column rank. This is the structural fact that makes the pseudoinverse well defined with probability one in the analysis of randomized range finders, and that lets one treat as the inverse-Wishart matrix.
Formalization Note. rank is Mathlib's matrix rank over ; the statement is a -almost-everywhere equality, with no restriction on (for or both sides are ).
import Definitions.Def_GaussianMatrix_basic open MeasureTheory ProbabilityTheory open scoped Matrix
namespace GaussianMatrix
theorem full_rank_ae (p m : ℕ) :
∀ᵐ G ∂(gaussianMatrix p m), (Matrix.of G).rank = min p m := by sorry
end GaussianMatrixRead-back
What the Lean code literally says, in plain math · claude-fable-5-1
Let be natural numbers (explicit arguments; either may be ), and let be the law of a array with independent entries. The statement asserts that for -almost every ,
where is viewed as a real matrix and is Mathlib's matrix rank: the dimension (as a natural number) of the column space of , i.e. of the range of the linear map from to . "Almost every" means the set of arrays for which is contained in a -null set; the equality is an equality of natural numbers, and is the minimum of the natural numbers and . Edge cases: if or the array space is a single point, the unique matrix has rank , and the claim holds for that point.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.