Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Directional deterministic equivalent for bounded sample-covariance entries

Statement

Assume the Axiom of Choice. On a common probability space, for each positive integer n, let Nn be a positive integer with Nn/n→κ∈(0,∞), let Xn∈Cn×Nn have entries from one common iid law with mean zero, second absolute moment one and absolute value bounded by a fixed finite constant, and let Tn be deterministic Hermitian positive semidefinite (self-adjoint with v∗Tnv≥0 for every v) with uniformly bounded induced Euclidean operator norm and empirical eigenvalue measures Hn=n−1∑iδλi(Tn)⇒H. Let xn∈Cn be deterministic unit vectors such that for every w∈C∖[0,∞), xn∗(Tn−wIn)−1xn⟶mH(w):=∫[0,∞)(t−w)−1 dH(t). For An=Nn−1Tn1/2XnXn∗Tn1/2, define the directional spectral measure μnxn(B)=xn∗1B(An)xn for Borel B⊆[0,∞). Then almost surely μnxn⇒Fc,H, where c=κ−1 and Fc,H is the probability measure characterized by mc,H(z)=∫[0,∞)1t(1−c−czmc,H(z))−z dH(t),Im⁡z>0.

Statement references

Bai, Miao, and Pan, Theorem 1 and complete Section 2 proof, printed pp. 8–16 (full paper PDF).

Silverstein, Theorem 1.1 and complete Section 3 proof (full paper PDF).

Facts & Assumptions

Given: The common probability space, hypotheses, matrices, and directional measures in the Statement, including AC.

[A1]

The Axiom of Choice permits a choice function for every family of nonempty sets (The Axiom of Choice).

[F1]

For Hermitian An and unit xn, the directional spectral measure is ∑λ∥Pλxn∥22δλ (Directional spectral measure of a Hermitian matrix).

[F2]

This measure is a Borel probability because the spectral projections are orthogonal and sum to the identity (A Hermitian directional spectral measure is a probability law).

[F3]

The expected resolvent has deterministic equivalent −(z(I+qnTn))−1, uniformly for deterministic unit-vector quadratic forms (Deterministic equivalent for the bounded complex sample-covariance resolvent).

[F4]

The bounded-entry empirical spectral distribution converges almost surely to Fc,H with the stated fixed-point transform (General-population sample-covariance law for bounded entries).

[F5]

A bounded-entry directional resolvent quadratic form concentrates almost surely about its expectation (Adapted concentration of bounded complex resolvent quadratic forms).

[F6]

Dominated convergence passes limits through integrals under a common integrable bound (Dominated convergence).

[F7]

The normalized operator norm of bounded complex iid matrices is almost surely eventually bounded (Operator-norm bound for bounded complex iid matrices).

[F8]

Tight probability laws on a Polish space have weakly convergent subsequences under AC (Prokhorov tightness theorem on polish spaces).

[F9]

The Stieltjes transform uses (t−z)−1 and determines a probability measure uniquely (Stieltjes transform of a probability measure on the real line, Stieltjes inversion and uniqueness for probability measures on the real line).

[F10]

The nonzero eigenvalues of Y∗Y and YY∗ agree with multiplicity (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).

[F11]

A Polish space is a separable topological space whose topology is induced by a complete metric (Polish spaces are separable completely metrizable spaces).

[F12]

Weak convergence of Borel probabilities means convergence of integrals against every bounded continuous real-valued function (Weak convergence of borel probability measures).

[F13]

The operator norm is the maximum of ∥Av∥2 over unit vectors in the domain (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

Proof

1.1givenF4F6F9F10algebra

Fix z∈C+ and let qn(z)=E[Nn−1tr⁡(Nn−1Xn∗TnXn−zI)−1]. By [F4], the empirical transforms of An converge almost surely to mc,H(z); their absolute values are at most 1/Im⁡z, so [F6] gives convergence of their expectations. By [F10], the nonzero eigenvalue equality for An and Nn−1Xn∗TnXn gives qn=−(1−cn)/z+cnE[n−1tr⁡(An−zI)−1], with cn=n/Nn. Hence qn(z)→u(z):=−(1−c)/z+cmc,H(z).

2.1givenF3F5F13step 1.1algebra

For deterministic unit xn, [F3] and [F5] yield xn∗(An−zI)−1xn+1zxn∗(I+qn(z)Tn)−1xn⟶0almost surely. The matrix inverses are uniformly bounded by ∣z∣/Im⁡z from the positive-measure resolvent estimate in the proof of [F3]. Since Tn are uniformly bounded and qn→u, the resolvent identity gives ∥(I+qnTn)−1−(I+uTn)−1∥op≤M(∣z∣/Im⁡z)2∣qn−u∣⟶0.

3.1givenF4step 1.1step 2.1algebra

Since u∈C+, w=−1/u also lies in C+ and (I+uTn)−1=u−1(Tn−wI)−1. The population-resolvent hypothesis at this fixed w therefore gives xn∗(I+uTn)−1xn→u−1mH(−1/u). By [F4], mc,H(z)=−z−1∫(1+ut)−1dH(t)=−[zu]−1mH(−1/u). Step 2.1 now proves xn∗(An−zI)−1xn→mc,H(z) almost surely for each fixed z∈C+.

4.1givenA1F1F2F7F8F9F11F12F13step 3.1algebra∎

The resolvent in step 3.1 is the Stieltjes transform of μnxn by [F1]. Intersect the probability-one events over a countable dense subset of C+. By [F7], on this event the spectra of An are eventually contained in one compact interval, so [F2] makes the directional measures a tight sequence of probabilities. The half-line is Polish: it is a closed subset of the complete real line with dense subset Q∩[0,∞), in the sense of [F11]. By [A1] and [F8], every subsequence has a weakly convergent further subsequence. Its transform agrees with mc,H on the dense set by step 3.1; continuity of Stieltjes transforms extends equality to all C+, and [F9] identifies that limit with Fc,H. Therefore every subsequence has the same further limit, which by the bounded-continuous-test definition [F12] proves μnxn⇒Fc,H almost surely.

Source notes

Bai, Miao, and Pan, Theorem 1, equations (1.1)–(1.5), and Section 2, equations (2.1)–(2.9), printed pp. 8–16 (full paper PDF).

Depends on

Used by

Dependency tree · two levels

65 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