ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generated

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 Marchenko–Pastur support and closing lower edge at aspect one

Example

Assume AC. Let $(ξ_{i j})_{i, j \geq 1}$ be one infinite real iid array with mean zero, variance one and finite fourth moment. Set $X_{n} = (ξ_{i j})_{1 \leq i \leq n, 1 \leq j \leq p_{n}}$ and suppose $p_{n} / n \to 1$ . For $S_{n} = X_{n}^{T} X_{n} / n$ , the limiting empirical spectral distribution has density $ρ_{1} (x) = {\begin{cases} \frac{\sqrt{4 - x}}{2 π \sqrt{x}}, & 0 < x < 4, \\ 0, & otherwise, \end{cases}$ and no atom at zero; almost surely the largest eigenvalue tends to $4$ and the smallest positive eigenvalue tends to $0$ .

Example references

Marchenko–Pastur measure with aspect ratio gamma

Almost-sure Marchenko–Pastur law for finite-fourth-moment sample covariance matrices

Almost-sure limit of the largest sample-covariance eigenvalue

Almost-sure limit and structural-zero count at the lower sample-covariance edge

Facts & Assumptions

Given: AC, the entry-law assumptions in the Example, and $γ = 1$ .

[A1]

The Axiom of Choice (The Axiom of Choice).

[A2]

The Axiom of Choice implies countable choice (AC implies DC implies countable choice).

[F1]

Under countable choice, the density, endpoints, and atom are defined by the Marchenko–Pastur formula (Marchenko–Pastur measure with aspect ratio gamma).

[L1]

The MP weak law is stated in Almost-sure Marchenko–Pastur law for finite-fourth-moment sample covariance matrices.

[L2]

The largest-edge conclusion is stated in Almost-sure limit of the largest sample-covariance eigenvalue.

[L3]

The smallest-positive-edge conclusion is stated in Almost-sure limit and structural-zero count at the lower sample-covariance edge.

Verification

Given: The hypotheses and notation in the Example.

1.1givenA2F1algebra

At $γ = 1$ , the endpoints are $a = 0$ and $b = 4$ , and the atom is zero. On $(0, 4)$ the density simplifies as $\sqrt{(4 - x) x} / (2 π x) = \sqrt{4 - x} / (2 π \sqrt{x})$ , giving the formula in the Example.

2.1A1L1L2L3step 1.1algebra∎

The nested array and AC satisfy [L1]–[L3]. The MP weak law [L1] gives the density computed in step 1.1. Independently, [L2] gives largest edge $4$ , while [L3] gives an eventually defined smallest positive eigenvalue tending to zero. Their simultaneous probability-one conclusions prove the Example, without inferring either edge from the weak law.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

36 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

Bai and Silverstein, Spectral Analysis of Large Dimensional Random Matrices, Chapters 3 and 5 (standard reference, not scraped)