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.
Standard real and normalized complex Gaussian matrix laws
Definition
Assume the Axiom of Countable Choice so that the repository's Lebesgue measure on each positive-dimensional real coordinate space is a measure. A standard real Gaussian scalar has Lebesgue density A normalized complex Gaussian scalar is for independent standard real Gaussian scalars ; its density on is and .
For or , an iid standard Gaussian matrix in has independent entries with the corresponding scalar law. For , its expectations are finite-dimensional Lebesgue integrals against the product density. If or , the matrix space has one element, the empty matrix; its law assigns that element probability one, and the expectation of any function is its value there. Independence means the product-density factorization, with this one-point convention for an empty product. The normalized complex convention is fixed throughout; it is not the unnormalized law .
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Lebesgue measurable sets, the family $\mathcal{L}(\mathbb{R}^n)$, and the restricted set function $\lambda_n$
- Assuming countable choice, $\mathcal{L}(\mathbb{R}^n)$ is a sigma-algebra containing every elementary set and $\lambda_n$ is a complete measure extending elementary volume
Used by
- Exact Gaussian randomized range finder Algorithm
- Reorthogonalized randomized power subspace iteration Algorithm
- A wide Gaussian matrix has full row rank almost surely Lemma
- Affine second-moment bounds for normalized complex Gaussian block products Lemma
- Direct expected spectral bound for the normalized complex range finder Lemma
- Exact Frobenius moments of wide Gaussian pseudoinverses Lemma
- Finite Gaussian increment comparison Lemma
- Normalization and second moments of the Gaussian matrix laws Lemma
- Orthogonal and unitary invariance of Gaussian matrix blocks Lemma
- Real scaled-Gaussian spectral and Frobenius product bounds Lemma
- Spectral moments and integrable tails for wide Gaussian pseudoinverses Lemma
- Squared-norm concentration for real and normalized complex Gaussians Lemma
- Expected real and normalized complex Gaussian power-rangefinder error Theorem
- Expected spectral error for real and normalized complex Gaussian range finders Theorem
- Gaussian sketches embed a fixed subspace at the additive dimension rate Theorem
Dependency tree · two levels
21 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, §10.1 (standard reference, not scraped)
- Martinsson and Tropp, Randomized Numerical Linear Algebra: Foundations & Algorithms, §§11.1, 11.4 (standard reference, not scraped)