Introduction
Consider a deterministic skew Hilbert–Schmidt kernel evaluated between independent isotropic random rows. We investigate its empirical singular spectrum with no additional dimension normalization. The main probabilistic problem is to characterize, solely through the temporal kernel, when the resulting spectra are tight, collapse, or converge. Our answers require a uniform quadratic-form variance bound (QC4), but neither independent temporal coordinates nor a prior spectral envelope.
The proof has two distinct ingredients. First, a regularized positive covariance and two independent spatial blocks detect every failure of tightness, including quadratic energy distributed among an unbounded number of individually small modes. Second, an amplitude-window comparison transfers the remaining tight spectral data to a deterministic canonical measure. The source–law parametrization itself is classical; the contribution here is the reversible identification for this independent-row skew model together with the converse tightness theorem.
For a fixed kernel, exact scaling across spatial dimensions forces every convergent full-sequence spectrum to be half-Cauchy. A single bounded resolvent response with a strictly positive limit already detects this rigidity without assuming weak trace. The resulting framework also gives a precise, dimension-sensitive criterion for polygonal approximations of Brownian Lévy area to retain the full macroscopic spectrum. Logarithmic statistics and one-response statements for varying kernels require additional, explicitly separated conditions.
Model and row hypothesis
We write S p \mathcal{S}_p S p for the Schatten class, ∥ ⋅ ∥ o p \lVert\cdot\rVert_{\mathrm{op}} ∥ ⋅ ∥ op for the operator norm, and ∥ ⋅ ∥ F \lVert\cdot\rVert_F ∥ ⋅ ∥ F for the Frobenius norm of a finite matrix. Let H d \mathcal{H}_d H d be a real separable Hilbert space and let K d K_d K d be real skew-adjoint and Hilbert–Schmidt. Write λ 1 , d ≥ λ 2 , d ≥ ⋯ ≥ 0 \lambda_{1,d} \ge\lambda_{2,d} \ge\cdots\ge0 λ 1 , d ≥ λ 2 , d ≥ ⋯ ≥ 0 for its singular values counted once per skew pair , with zeros appended in finite rank. Thus its full singular-value list satisfies s 2 k − 1 ( K d ) = s 2 k ( K d ) = λ k , d s_{2k-1}(K_d)=s_{2k}(K_d)=\lambda_{k,d} s 2 k − 1 ( K d ) = s 2 k ( K d ) = λ k , d . Let X 1 , d , … , X d , d X_{1,d},\ldots,X_{d,d} X 1 , d , … , X d , d be independent centered isotropic cylindrical rows:
E X i , d ( h ) X i , d ( g ) = ⟨ h , g ⟩ . (1) \mathbb{E}X_{i,d}(h)X_{i,d}(g)=\langle h,g\rangle. \tag*{(1)} E X i , d ( h ) X i , d ( g ) = ⟨ h , g ⟩ . (1)
2020 Mathematics Subject Classification. Primary 60B20; Secondary 46L54, 47B10, 60F05, 60H05.
Key words and phrases. Random skew-symmetric matrices, empirical spectral distributions, weak trace class, logarithmic determinants, Lévy area, quadratic-form concentration, free infinite divisibility.
The rows need not be identically distributed, and their temporal coordinates need not be independent. Set
H d ( K d ) i j = ⟨ X i , d , K d X j , d ⟩ ( i ≠ j ) , H i i = 0 , μ d = 1 d ∑ j = 1 d δ s j ( H d ( K d ) ) . (2) H_d(K_d)_{ij}=\langle X_{i,d},K_dX_{j,d}\rangle\quad(i\ne j),\qquad H_{ii}=0,\qquad\mu_d=\frac{1}{d}\sum_{j=1}^{d}\delta_{s_j(H_d(K_d))}. \tag*{(2)} H d ( K d ) ij = ⟨ X i , d , K d X j , d ⟩ ( i = j ) , H ii = 0 , μ d = d 1 j = 1 ∑ d δ s j ( H d ( K d )) . (2)
Bilinear entries are defined by L 2 L^2 L 2 limits of finite-rank approximations, not as inner products of Hilbert-valued white noises. All couplings across different d d d are allowed. No further normalization is applied to the singular values in (2) . Define
F d ( z ) = 1 d log det ( I + z H d ) , q ^ d ( z ) = ∫ μ d ( d s ) 1 + z 2 s 2 , z > 0. (3) F_d(z)=\frac{1}{d}\log\det(I+zH_d),\qquad\widehat q_d(z)=\int\frac{\mu_d(\mathrm{d}s)}{1+z^2s^2},\qquad z>0. \tag*{(3)} F d ( z ) = d 1 log det ( I + z H d ) , q d ( z ) = ∫ 1 + z 2 s 2 μ d ( d s ) , z > 0. (3)
All spectral laws below are probability measures on [ 0 , ∞ ) [0,\infty) [ 0 , ∞ ) . For a random probability measure μ \mu μ , its mean is defined by ( E μ ) ( B ) = E [ μ ( B ) ] (\mathbb{E}\mu)(B)=\mathbb{E}[\mu(B)] ( E μ ) ( B ) = E [ μ ( B )] for Borel sets B B B . Skew symmetry gives the identities
F d ( z ) = 1 2 ∫ log ( 1 + z 2 s 2 ) μ d ( d s ) , q ^ d ( z ) = 1 d tr ( I + z H d ) − 1 . F_d(z)=\frac{1}{2}\int\log(1+z^2s^2)\,\mu_d(\mathrm{d}s),\qquad\widehat q_d(z)=\frac{1}{d}\operatorname{tr}(I+zH_d)^{-1}. F d ( z ) = 2 1 ∫ log ( 1 + z 2 s 2 ) μ d ( d s ) , q d ( z ) = d 1 tr ( I + z H d ) − 1 .
In particular, the determinant is positive and the resolvent trace is real. We write d L d_{\mathrm{L}} d L for the Lévy metric on probability measures, which metrizes weak convergence; weak convergence in probability of random measures is understood in this metric. We assume the following uniform quadratic-form variance bound:
Var ⟨ X i , d , T X i , d ⟩ ≤ κ ∥ T ∥ S 2 2 for every finite-rank real self-adjoint T . \operatorname{Var}\langle X_{i,d},TX_{i,d}\rangle\le\kappa\lVert T\rVert_{S_2}^{2}
\qquad\text{for every finite-rank real self-adjoint }T. Var ⟨ X i , d , T X i , d ⟩ ≤ κ ∥ T ∥ S 2 2 for every finite-rank real self-adjoint T .
(QC4)
The constant is independent of the row, spatial dimension and temporal projection. The centered quadratic form then extends to Hilbert–Schmidt T T T in L 2 L^2 L 2 ; uncentered forms below are used for trace-class T T T . Independent coordinates with uniformly bounded fourth moments satisfy QC4, as do their orthogonal images. Independence of temporal coordinates is not assumed.
Almost-sure conclusions are understood for each fixed deterministic kernel array and each fixed joint coupling of its rows across dimensions, on an event that may depend on this choice. The stated simultaneous parameter conclusions hold on one such event. Tightness almost surely means that, on that event, the entire sequence ( μ d ( ω ) ) d (\mu_d(\omega))_d ( μ d ( ω ) ) d is a tight family of probability measures.
Remark (Dependent coordinates). A direct non-product example is a row uniformly distributed on the sphere of radius m \sqrt{m} m in R m \mathbb{R}^m R m . It is centered and isotropic, and for every real symmetric matrix T T T ,
Var ⟨ X , T X ⟩ = 2 m m + 2 tr ( T 2 ) − 2 m + 2 ( tr T ) 2 ≤ 2 ∥ T ∥ S 2 2 . \operatorname{Var}\langle X,TX\rangle=\frac{2m}{m+2}\operatorname{tr}(T^2)-\frac{2}{m+2}(\operatorname{tr}T)^2\le2\lVert T\rVert_{S_2}^{2}. Var ⟨ X , T X ⟩ = m + 2 2 m tr ( T 2 ) − m + 2 2 ( tr T ) 2 ≤ 2 ∥ T ∥ S 2 2 .
Thus independent spherical rows satisfy QC4 with κ = 2 \kappa=2 κ = 2 , uniformly over arbitrary temporal dimensions m = m d m=m_d m = m d .
Exact tightness and the zero boundary
For ε > 0 \varepsilon>0 ε > 0 , define the quadratic energy left after deleting ⌊ ε d ⌋ \lfloor\varepsilon d\rfloor ⌊ ε d ⌋ temporal skew pairs by
E d ( ε ) = d ∑ k > ⌊ ε d ⌋ λ k , d 2 . (4) \mathcal{E}_d(\varepsilon)=d\sum_{k>\lfloor\varepsilon d\rfloor}\lambda_{k,d}^{2}. \tag*{(4)} E d ( ε ) = d k > ⌊ ε d ⌋ ∑ λ k , d 2 . (4)
This quantity retains the entire remaining tail, regardless of its temporal rank.
Theorem A (Exact tightness and nullity). Under QC4, the following are equivalent:
(i) ( E μ d ) d (\mathbb{E}\mu_d)_d ( E μ d ) d is tight;
(ii) ( μ d ) d (\mu_d)_d ( μ d ) d is tight almost surely;
(iii) lim sup d → ∞ E d ( ε ) < ∞ \limsup_{d\to\infty}\mathcal{E}_d(\varepsilon)<\infty lim sup d → ∞ E d ( ε ) < ∞ for every ε > 0 \varepsilon>0 ε > 0 .
Furthermore,
μ d ⇒ δ 0 in probability ⟺ E d ( ε ) → 0 for every ε > 0. (5) \mu_d\Rightarrow\delta_0\text{ in probability}\qquad\Longleftrightarrow\qquad\mathcal{E}_d(\varepsilon)\to0\text{ for every }\varepsilon>0. \tag*{(5)} μ d ⇒ δ 0 in probability ⟺ E d ( ε ) → 0 for every ε > 0. (5) In this case convergence is almost sure. These zero-limit conditions are also equivalent to a decomposition into deterministic skew operators
K d = R d + S d , rank R d = o ( d ) , d ∥ S d ∥ S 2 2 ⟶ 0. (6) K_d=R_d+S_d,\qquad\operatorname{rank}R_d=o(d),\qquad d\lVert S_d\rVert_{S_2}^{2}\longrightarrow0. \tag*{(6)} K d = R d + S d , rank R d = o ( d ) , d ∥ S d ∥ S 2 2 ⟶ 0. (6) One may take R d R_d R d to be a spectral truncation of K d K_d K d .
The necessity follows from a regularized positive covariance and two independent spatial blocks. It detects energy spread over arbitrarily many small modes as well as large individual coefficients.
The canonical source and the moving spectral criterion
Put x k , d = d λ k , d x_{k,d}=d\lambda_{k,d} x k , d = d λ k , d and define the finite positive measure
η d = 2 d ∑ k x k , d 2 1 + x k , d 2 δ x k , d on [ 0 , ∞ ) . (7) \eta_d=\frac{2}{d}\sum_k\frac{x_{k,d}^2}{1+x_{k,d}^2}\,\delta_{x_{k,d}}\text{ on }[0,\infty). \tag*{(7)} η d = d 2 k ∑ 1 + x k , d 2 x k , d 2 δ x k , d on [ 0 , ∞ ) . (7)
Its total mass is at most d ∥ K d ∥ S 2 2 d\lVert K_d\rVert_{\mathit{S}_2}^2 d ∥ K d ∥ S 2 2 . Zero coefficients have zero weight at finite d d d , although a weak limit of the source measures may have an atom at zero. For any finite positive measure η \eta η on [ 0 , ∞ ) [0,\infty) [ 0 , ∞ ) , write
G η ( t ) = ∫ g t ( x ) η ( d x ) , g t ( x ) = t 2 ( 1 + x 2 ) 1 + t 2 x 2 , t > 0 , G η ( 0 ) = 0. (8) G_\eta(t)=\int g_t(x)\,\eta(\mathrm{d}x),\qquad g_t(x)=\frac{t^2(1+x^2)}{1+t^2x^2},\qquad t>0,\quad G_\eta(0)=0. \tag*{(8)} G η ( t ) = ∫ g t ( x ) η ( d x ) , g t ( x ) = 1 + t 2 x 2 t 2 ( 1 + x 2 ) , t > 0 , G η ( 0 ) = 0. (8)
In particular,
G d ( t ) : = G η d ( t ) = 2 d ∑ k t 2 d 2 λ k , d 2 1 + t 2 d 2 λ k , d 2 = 1 d tr t 2 d 2 K d ∗ K d I + t 2 d 2 K d ∗ K d . G_d(t):=G_{\eta_d}(t)=\frac{2}{d}\sum_k\frac{t^2d^2\lambda_{k,d}^2}{1+t^2d^2\lambda_{k,d}^2}
=\frac{1}{d}\operatorname{tr}\frac{t^2d^2K_d^*K_d}{I+t^2d^2K_d^*K_d}. G d ( t ) := G η d ( t ) = d 2 k ∑ 1 + t 2 d 2 λ k , d 2 t 2 d 2 λ k , d 2 = d 1 tr I + t 2 d 2 K d ∗ K d t 2 d 2 K d ∗ K d .
Thus G d ( t ) G_d(t) G d ( t ) is the normalized effective dimension of the temporal covariance at scale t d td t d . The canonical compactness condition is
lim t ↓ 0 lim sup d → ∞ G d ( t ) = 0. \lim_{t\downarrow0}\limsup_{d\to\infty}G_d(t)=0. t ↓ 0 lim d → ∞ lim sup G d ( t ) = 0.
It is equivalent to bounded total masses and tightness of ( η d ) (\eta_d) ( η d ) as finite measures. Theorem A identifies it exactly with tightness of the mean empirical laws under QC4. It allows a limiting atom at zero, representing diffuse quadratic energy, and imposes no logarithmic moment at infinity.
Let q η ( z ) ∈ ( 0 , 1 ] q_\eta(z)\in(0,1] q η ( z ) ∈ ( 0 , 1 ] be the unique root
q η ( z ) + G η ( z q η ( z ) ) = 1 , z > 0. (9) q_\eta(z)+G_\eta(zq_\eta(z))=1,\qquad z>0. \tag*{(9)} q η ( z ) + G η ( z q η ( z )) = 1 , z > 0. (9)
and abbreviate q d = q η d q_d=q_{\eta_d} q d = q η d . We use weak convergence of finite measures, including convergence of their total masses. Its bounded-Lipschitz metric is
d B L ( η , ξ ) = sup ∥ f ∥ ∞ ≤ 1 , Lip ( f ) ≤ 1 ∣ ∫ f d η − ∫ f d ξ ∣ . d_{\mathrm{BL}}(\eta,\xi)=\sup_{\lVert f\rVert_\infty\leq1,\operatorname{Lip}(f)\leq1}\left|\int f\,\mathrm{d}\eta-\int f\,\mathrm{d}\xi\right|. d BL ( η , ξ ) = ∥ f ∥ ∞ ≤ 1 , Lip ( f ) ≤ 1 sup ∫ f d η − ∫ f d ξ .
The deterministic parametrization below is the classical canonical-measure parametrization of symmetric free infinitely divisible laws, folded onto [ 0 , ∞ ) [0,\infty) [ 0 , ∞ ) [3 , 2 ] . We record the transform properties needed below and identify the present independent-row model with these classical laws.
Theorem B (Reversible moving correspondence). There is a continuous injective map M : η ↦ μ η \mathcal{M}:\eta\mapsto\mu_\eta M : η ↦ μ η from finite positive measures on [ 0 , ∞ ) [0,\infty) [ 0 , ∞ ) to probability measures on [ 0 , ∞ ) [0,\infty) [ 0 , ∞ ) , characterized by
∫ μ η ( d s ) 1 + z 2 s 2 = q η ( z ) , z > 0. (10) \int\frac{\mu_\eta(\mathrm{d}s)}{1+z^2s^2}=q_\eta(z),\qquad z>0. \tag*{(10)} ∫ 1 + z 2 s 2 μ η ( d s ) = q η ( z ) , z > 0. (10) It is a homeomorphism onto a weakly closed image. For arbitrary kernels in the QC4 model, the following are equivalent:
η d \eta_d η d converges weakly to a finite positive measure;
G d ( t ) → G ( t ) < ∞ G_d(t)\to G(t)<\infty G d ( t ) → G ( t ) < ∞ for every t > 0 t>0 t > 0 , and G ( t ) → 0 G(t)\to0 G ( t ) → 0 as t ↓ 0 t\downarrow0 t ↓ 0 ;
E μ d \mathbb{E}\mu_d E μ d converges weakly to a probability measure;
μ d \mu_d μ d converges weakly in probability to a deterministic probability measure.
If the source limit is η \eta η , the limits in (ii)–(iv) are G η ( t ) G_\eta(t) G η ( t ) , μ η \mu_\eta μ η and μ η \mu_\eta μ η , respectively, and the empirical convergence is almost sure.
More generally, whenever the mean empirical laws are tight, equivalently when (RC) holds,
q ^ d ( z ) − q d ( z ) ⟶ 0 almost surely and in L 1 , d L ( μ d , μ η d ) ⟶ 0 almost surely . (11) \widehat q_d(z)-q_d(z)\longrightarrow0\quad\text{almost surely and in }L^1,\qquad d_{\mathrm{L}}(\mu_d,\mu_{\eta_d})\longrightarrow0\quad\text{almost surely}. \tag*{(11)} q d ( z ) − q d ( z ) ⟶ 0 almost surely and in L 1 , d L ( μ d , μ η d ) ⟶ 0 almost surely . (11)
The first convergence is almost surely locally uniform in log z \log z log z . Within this tight class, the small-parameter requirement in (ii) is automatic.
Fixed kernels
Write S 1 , ∞ = { K : sup n n s n ( K ) < ∞ } \mathcal{S}_{1,\infty}=\{K:\sup_n n s_n(K)<\infty\} S 1 , ∞ = { K : sup n n s n ( K ) < ∞ } and S 1 , ∞ 0 = { K : n s n ( K ) → 0 } \mathcal{S}^{0}_{1,\infty}=\{K:n s_n(K)\to0\} S 1 , ∞ 0 = { K : n s n ( K ) → 0 } . Let H C b \mathrm{HC}_b HC b be the law of ∣ Cauchy ( 0 , b ) ∣ |\operatorname{Cauchy}(0,b)| ∣ Cauchy ( 0 , b ) ∣ , with H C 0 = δ 0 \mathrm{HC}_0=\delta_0 HC 0 = δ 0 .
Theorem C (Fixed-kernel critical classification). Assume QC4 and let K d = K K_d=K K d = K be any fixed real skew K ∈ S 2 K\in\mathcal{S}_2 K ∈ S 2 . Then
( E μ d ) d is tight ⟺ ( μ d ) d is tight almost surely ⟺ K ∈ S 1 , ∞ , (12) (\mathbb{E}\mu_d)_d\text{ is tight}\ \Longleftrightarrow\ (\mu_d)_d\text{ is tight almost surely}\ \Longleftrightarrow\ K\in\mathcal{S}_{1,\infty}, \tag*{(12)} ( E μ d ) d is tight ⟺ ( μ d ) d is tight almost surely ⟺ K ∈ S 1 , ∞ , (12) μ d ⇒ δ 0 in probability ⟺ K ∈ S 1 , ∞ 0 . (13) \mu_d\Rightarrow\delta_0\text{ in probability}\ \Longleftrightarrow\ K\in\mathcal{S}^{0}_{1,\infty}. \tag*{(13)} μ d ⇒ δ 0 in probability ⟺ K ∈ S 1 , ∞ 0 . (13) For every fixed z 0 > 0 z_0>0 z 0 > 0 , the following are equivalent:
F d ( z 0 ) F_d(z_0) F d ( z 0 ) converges in probability to a finite deterministic L L L ;
k λ k ( K ) → c k\lambda_k(K)\to c k λ k ( K ) → c for some finite c ≥ 0 c\ge0 c ≥ 0 ;
μ d \mu_d μ d converges weakly in probability to a deterministic probability measure;
q ^ d ( z 0 ) \widehat q_d(z_0) q d ( z 0 ) converges in probability to a deterministic q 0 ∈ ( 0 , 1 ] q_0\in(0,1] q 0 ∈ ( 0 , 1 ] .
When they hold,
c = e L − 1 π z 0 = q 0 − 1 − 1 π z 0 , μ d ⇒ H C π c a.s. , F d ( z ) ⟶ log ( 1 + π c z ) . (14) \begin{aligned}
c&=\frac{e^L-1}{\pi z_0}=\frac{q_0^{-1}-1}{\pi z_0},\\
\mu_d&\Rightarrow\mathrm{HC}_{\pi c}\quad\text{a.s.},\qquad F_d(z)\longrightarrow\log(1+\pi cz). \tag*{(14)}
\end{aligned} c μ d = π z 0 e L − 1 = π z 0 q 0 − 1 − 1 , ⇒ HC π c a.s. , F d ( z ) ⟶ log ( 1 + π cz ) . (14) The logarithmic convergence is almost sure and in L 1 L^1 L 1 for every z > 0 z>0 z > 0 , locally uniform in log z \log z log z on the almost-sure event. The bounded responses converge almost surely and in L 1 L^1 L 1 to ( 1 + π c z ) − 1 (1+\pi cz)^{-1} ( 1 + π cz ) − 1 , locally uniformly in log z \log z log z almost surely. The zero-law convergence in (1.12) is also almost sure. No weak-trace or logarithmic-tightness assumption is made in this theorem.
This is a specialization of the general tightness and source criteria. The scalar limit is taken across all spatial dimensions.
Logarithmic information
The logarithmic source and its scalar potential are
Φ d ( t ) = 1 d ∑ k log ( 1 + t 2 x k , d 2 ) = 1 d log det 2 ( I + t d K d ) , (15) \Phi_d(t)=\frac{1}{d}\sum_k\log(1+t^2x_{k,d}^2)=\frac{1}{d}\log\det{}_2(I+tdK_d), \tag*{(15)} Φ d ( t ) = d 1 k ∑ log ( 1 + t 2 x k , d 2 ) = d 1 log det 2 ( I + t d K d ) , (15)
V d ( z ) = min q > 0 { q − log q − 1 + Φ d ( z q ) } . (16) V_d(z)=\min_{q>0}\{q-\log q-1+\Phi_d(zq)\}. \tag*{(16)} V d ( z ) = q > 0 min { q − log q − 1 + Φ d ( z q )} . (16)
Here det 2 \det{}_2 det 2 is the Carleman–Fredholm determinant; the exponential regularization cancels within each imaginary eigenvalue pair. One has t Φ d ′ ( t ) = G d ( t ) t\Phi'_d(t)=G_d(t) t Φ d ′ ( t ) = G d ( t ) , and the minimizing root is q d ( z ) q_d(z) q d ( z ) . To compare F d F_d F d with V d V_d V d , we impose upper-amplitude logarithmic integrability:
lim M → ∞ lim sup d → ∞ 1 d ∑ k : x k , d > M log ( 1 + x k , d 2 ) = 0. (17) \lim_{M\to\infty}\limsup_{d\to\infty}\frac{1}{d}\sum_{k:x_{k,d}>M}\log(1+x_{k,d}^2)=0. \tag*{(17)} M → ∞ lim d → ∞ lim sup d 1 k : x k , d > M ∑ log ( 1 + x k , d 2 ) = 0. (17)
Under QC4, RC and LI, Theorem 5.1 proves E ∣ F d ( z ) − V d ( z ) ∣ → 0 \mathbb{E}|F_d(z)-V_d(z)|\to0 E ∣ F d ( z ) − V d ( z ) ∣ → 0 for every z > 0 z>0 z > 0 and identifies the limiting logarithmic statistic. RC alone suffices for the bounded spectral conclusions. This distinction matters even for an array with only one nonzero skew pair.
Scalar criteria under dimension dilation
Fix distinct positive numbers r j r_j r j with r j → 1 r_j\to1 r j → 1 . We call the array dilation coherent if
G l f l o o r r j d r f l o o r ( t ) − r j − 1 G d ( r j t ) ⟶ 0 for every j and t > 0 (18) G_{lfloor r_jdrfloor}(t)-r_j^{-1}G_d(r_jt)\longrightarrow0\qquad\text{for every }j\text{ and }t>0 \tag*{(18)} G l f l oor r j d r f l oor ( t ) − r j − 1 G d ( r j t ) ⟶ 0 for every j and t > 0 (18)
This condition concerns the full response, including its diffuse quadratic component. For a fixed kernel it follows from an exact cross-dimensional identity once source compactness is known.
Theorem D (Scalar criteria for response homogeneity). Assume QC4 and (DC). The following are equivalent:
μ d \mu_d μ d converges weakly in probability to a deterministic probability measure;
G d ( t ) → b t G_d(t)\to bt G d ( t ) → b t for every t > 0 t>0 t > 0 , for some b ≥ 0 b\ge0 b ≥ 0 .
They imply (RC), and
η d ⇒ 2 b π ( 1 + x 2 ) d x , μ d ⇒ H C b almost surely . (19) \eta_d \Rightarrow\frac{2b}{\pi(1+x^2)}\,\mathrm{d}x,\qquad\mu_d \Rightarrow\mathrm{HC}_b\ \text{almost surely}. \tag*{(19)} η d ⇒ π ( 1 + x 2 ) 2 b d x , μ d ⇒ HC b almost surely . (19)
For any fixed z 0 > 0 z_0 > 0 z 0 > 0 they admit the following scalar criteria.
(a) If (RC) is assumed, they are equivalent to convergence in probability of q ^ d ( z 0 ) \widehat{q}_d(z_0) q d ( z 0 ) to a deterministic number q 0 q_0 q 0 . Necessarily q 0 > 0 q_0 > 0 q 0 > 0 and b = ( q 0 − 1 − 1 ) / z 0 b = (q_0^{-1} - 1)/z_0 b = ( q 0 − 1 − 1 ) / z 0 . The premise (RC) may be omitted if some r j < 1 r_j < 1 r j < 1 , provided the scalar limit is required to be positive.
(b) If (LI) is assumed, they are equivalent to convergence in probability of F d ( z 0 ) F_d(z_0) F d ( z 0 ) to a finite deterministic number L L L . Here no prior assumption of (RC) is needed: the finite logarithmic limit forces source compactness. In this case b = ( e L − 1 ) / z 0 b = (e^L - 1)/z_0 b = ( e L − 1 ) / z 0 and F d ( z ) → log ( 1 + b z ) F_d(z) \to\log(1 + bz) F d ( z ) → log ( 1 + b z ) in L 1 L^1 L 1 for every z > 0 z > 0 z > 0 .
In either case, all bounded responses converge almost surely and in L 1 L^1 L 1 to ( 1 + b z ) − 1 (1 + bz)^{-1} ( 1 + b z ) − 1 , locally uniformly in log z \log z log z almost surely.
Both scalar criteria identify the same source homogeneity G ( t ) = b t G(t) = bt G ( t ) = b t . The bounded criterion obtains source compactness from a contracting scale, or assumes it explicitly; the finite logarithmic observation supplies it automatically. Temporal resolution. For a deterministic partition of [ 0 , T ] [0,T] [ 0 , T ] with cell lengths h j , d h_{j,d} h j , d , Theorem 7.1 proves that the polygonal area matrix recovers the full H C T / 2 \mathrm{HC}_{T/2} HC T /2 bulk exactly when
∑ j : d h j , d > ε h j , d ⟶ 0 for every ε > 0. \sum_{j:\,d h_{j,d}>\varepsilon} h_{j,d} \longrightarrow0 \qquad\text{for every }\varepsilon> 0. j : d h j , d > ε ∑ h j , d ⟶ 0 for every ε > 0.
This condition can hold even when the normalized mean-square matrix error diverges.
Scope of the assertions. QC4 is the standing row assumption. Tightness requires no prior source condition and is equivalent to RC; collapse to zero is characterized by G d ( 1 ) → 0 G_d(1) \to0 G d ( 1 ) → 0 , as proved in Lemma 2.1 . The logarithmic comparison requires RC and LI. For varying kernels, bounded one-response rigidity uses DC and either RC or a contracting coherent scale with a positive scalar limit; logarithmic one-response rigidity uses DC and LI, with compactness supplied by the finite observation. The fixed-kernel theorem requires none of these additional assumptions.
Related work. The canonical-measure parametrization used in Theorem B is classical. Bercovici and Pata [3 ] identify the weighting x 2 / ( 1 + x 2 ) x^2/(1 + x^2) x 2 / ( 1 + x 2 ) in triangular-array limits; Benaych-Georges [2 Theorem 1.1] records the finite-measure parametrization and its weak-topology homeomorphism. A zero atom represents the semicircular component. Random-matrix realizations through invariant infinitely divisible ensembles were obtained in [2 , 4 ] . We use this parametrization to identify the limits of the present row model.
Quadratic-form concentration is a standard basis for sample-covariance universality [1 , 12 ] . Yaskov [13 Theorem 5.15] and Remark 4.3 treats signed Gram matrices with independent columns, including Gaussian comparison without separate spectral convergence. On a finite positive-amplitude band, Schur inertia relates our row model to that framework; see the Schur-inertia comparison in § 3 . Our argument retains all low-amplitude modes in an infinite-rank window estimate and proves the converse tightness criterion before any compactness assumption. These estimates support the fixed-kernel classification, scalar recovery, and temporal-resolution criterion. Hazarika and Paul [8 ] study proportional-dimensional commutators of independent-entry data matrices.
Dela Cruz and Oberhauser [5 Theorem 5.1] prove the almost-sure half-Cauchy bulk law for the full Brownian Lévy-area matrix, and also obtain edge and local statistics. Their Remark 6.1 discusses temporal series truncation and spatial low-rank approximation. Theorem 7.1 concerns polygonal time discretization: it gives a necessary and sufficient condition on arbitrary deterministic partitions for retaining that full-area bulk while the spatial dimension grows. Foster and Habermann [6 ] study mean-square area approximation. The Gaussian exterior formulation in [14 ] provides related algebraic context; the independent-row identity used here is proved directly.
Proof structure. Section 2 proves the exact tightness and zero-law criteria directly from regularized covariance, without using a deterministic equivalent. Section 3 establishes the amplitude-window comparison, and Section 4 combines it with the canonical transform and its inverse. Sections 5 and 6 treat logarithmic statistics, scalar criteria and the fixed-kernel theorem. Section 7 gives the temporal-resolution criterion; Section 8 distinguishes the roles of the hypotheses. Appendix A supplies logarithmic self-averaging under weak trace, and Appendix B treats ordered spectral recovery.
Exact spectral tightness and the zero boundary
The same response controls both spectral tails and their converse. An upper bound follows by separating temporal amplitudes at a threshold. For the lower bound, the regularized temporal covariance has trace proportional to G d ( t ) G_d(t) G d ( t ) and enough effective rank to survive sampling through two independent spatial blocks. This also detects energy spread over arbitrarily many small modes. Lower covariance spectral estimates under weak assumptions on isotropic observations are developed by Yaskov [11 ] ; the argument below concerns a skew-kernel evaluation.
Elementary spectral estimates. The singular-value rank inequality bounds the change of any bounded monotone spectral statistic of range one by r / d r/d r / d under a rank-r r r perturbation. Resampling one row of the model changes its skew matrix by rank at most two. Consequently such a statistic Z d Z_d Z d satisfies
P ( ∣ Z d − E Z d ∣ > δ ) ≤ 2 e − d δ 2 / 2 , E ∣ Z d − E Z d ∣ ≤ C 0 d − 1 / 2 , (20) \mathbb{P}(\lvert Z_d-\mathbb{E}Z_d\rvert>\delta)\le2e^{-d\delta^2/2},\qquad\mathbb{E}\lvert Z_d-\mathbb{E}Z_d\rvert\le C_0d^{-1/2}, \tag*{(20)} P (∣ Z d − E Z d ∣ > δ ) ≤ 2 e − d δ 2 /2 , E ∣ Z d − E Z d ∣ ≤ C 0 d − 1/2 , (20)
by bounded differences [10 ] . This uses only independence of the spatial rows.
Independence and isotropy also give the exact isometry
E ∥ H d ( L ) ∥ F 2 = d ( d − 1 ) ∥ L ∥ S 2 2 ( L ∈ S 2 real skew ) . (21) \mathbb{E}\lVert H_d(L)\rVert_F^2=d(d-1)\lVert L\rVert_{S_2}^2\qquad(L\in S_2\ \text{real skew}). \tag*{(21)} E ∥ H d ( L ) ∥ F 2 = d ( d − 1 ) ∥ L ∥ S 2 2 ( L ∈ S 2 real skew ) . (21)
For the latter identity, finite-rank expansion gives E ∣ ⟨ X i , L X j ⟩ ∣ 2 = ∥ L ∥ S 2 2 \mathbb{E}\lvert\langle X_i,LX_j\rangle\rvert^2=\lVert L\rVert_{S_2}^2 E ∣⟨ X i , L X j ⟩ ∣ 2 = ∥ L ∥ S 2 2 when i ≠ j i\ne j i = j . Summing over the off-diagonal entries and passing to the Hilbert–Schmidt limit proves the formula. These estimates use neither QC4 nor source compactness.
Lemma 2.1 (Trimmed energy and the canonical source). For arbitrary deterministic skew Hilbert–Schmidt kernels, condition (RC) is equivalent to
lim sup d → ∞ E d ( ε ) < ∞ for every ε > 0. \limsup_{d\to\infty}\mathcal{E}_d(\varepsilon)<\infty\qquad\text{for every }\varepsilon>0. d → ∞ lim sup E d ( ε ) < ∞ for every ε > 0. where E d \mathcal{E}_d E d is defined in (4) . Moreover,
η d ⇒ 0 ⟺ G d ( 1 ) → 0 ⟺ E d ( ε ) → 0 for every ε > 0. (22) \eta_d\Rightarrow0\quad\Longleftrightarrow\quad G_d(1)\to0\quad\Longleftrightarrow\quad\mathcal{E}_d(\varepsilon)\to0\quad\text{for every }\varepsilon>0. \tag*{(22)} η d ⇒ 0 ⟺ G d ( 1 ) → 0 ⟺ E d ( ε ) → 0 for every ε > 0. (22) These assertions are deterministic and require no logarithmic integrability.
Proof. Write p = ⌊ ε d ⌋ p=\lfloor\varepsilon d\rfloor p = ⌊ ε d ⌋ and x k , d = d λ k , d x_{k,d}=d\lambda_{k,d} x k , d = d λ k , d . Splitting at p p p gives
G d ( t ) ≤ 2 p d + 2 t 2 d ∑ k > p x k , d 2 ≤ 2 ε + 2 t 2 E d ( ε ) . (23) G_d(t)\le\frac{2p}{d}+\frac{2t^2}{d}\sum_{k>p}x_{k,d}^2\le2\varepsilon+2t^2\mathcal{E}_d(\varepsilon). \tag*{(23)} G d ( t ) ≤ d 2 p + d 2 t 2 k > p ∑ x k , d 2 ≤ 2 ε + 2 t 2 E d ( ε ) . (23)
Thus bounded trimmed energy implies (RC), by sending t ↓ 0 t\downarrow0 t ↓ 0 and then ε ↓ 0 \varepsilon\downarrow0 ε ↓ 0 .
Conversely, (RC) and g 1 ≤ max ( 1 , t − 2 ) g t g_1\le\max(1,t^{-2})g_t g 1 ≤ max ( 1 , t − 2 ) g t give B 0 : = sup d G d ( 1 ) < ∞ B_0:=\sup_dG_d(1)<\infty B 0 := sup d G d ( 1 ) < ∞ ; each of the finitely many initial measures has finite mass. Fix ε > 0 \varepsilon>0 ε > 0 and choose t ε > 0 t_\varepsilon>0 t ε > 0 with lim sup d G d ( t ε ) < ε / 2 \limsup_dG_d(t_\varepsilon)<\varepsilon/2 lim sup d G d ( t ε ) < ε /2 . Eventually G d ( t ε ) ≤ ε G_d(t_\varepsilon)\le\varepsilon G d ( t ε ) ≤ ε . For y d = x p + 1 , d y_d=x_{p+1,d} y d = x p + 1 , d , monotonicity and ( p + 1 ) / d > ε (p+1)/d>\varepsilon ( p + 1 ) / d > ε yield
2 ε t ε 2 y d 2 1 + t ε 2 y d 2 ≤ G d ( t ε ) ≤ ε , \frac{2\varepsilon t_\varepsilon^2y_d^2}{1+t_\varepsilon^2y_d^2}\le G_d(t_\varepsilon)\le\varepsilon, 1 + t ε 2 y d 2 2 ε t ε 2 y d 2 ≤ G d ( t ε ) ≤ ε ,
so y d ≤ t ε − 1 y_d\le t_\varepsilon^{-1} y d ≤ t ε − 1 . Hence
E d ( ε ) = 1 d ∑ k > p x k , d 2 ≤ 1 + y d 2 2 G d ( 1 ) ≤ 1 + t ε − 2 2 B 0 . (24) \mathcal{E}_d(\varepsilon)=\frac{1}{d}\sum_{k>p}x_{k,d}^2\le\frac{1+y_d^2}{2}G_d(1)\le\frac{1+t_\varepsilon^{-2}}{2}B_0. \tag*{(24)} E d ( ε ) = d 1 k > p ∑ x k , d 2 ≤ 2 1 + y d 2 G d ( 1 ) ≤ 2 1 + t ε − 2 B 0 . (24)
This proves the required boundedness. Because η d \eta_d η d is positive and G d ( 1 ) G_d(1) G d ( 1 ) is its total mass, η d ⇒ 0 \eta_d \Rightarrow0 η d ⇒ 0 is equivalent to G d ( 1 ) → 0 G_d(1) \to0 G d ( 1 ) → 0 . If every trimmed energy tends to zero, (23) at t = 1 t=1 t = 1 , followed by ϵ ↓ 0 \epsilon\downarrow0 ϵ ↓ 0 , gives this mass convergence. Conversely, if G d ( 1 ) → 0 G_d(1) \to0 G d ( 1 ) → 0 , then for each fixed ϵ > 0 \epsilon>0 ϵ > 0 the same monotonicity estimate at t = 1 t=1 t = 1 gives y d ≤ 1 y_d \leq1 y d ≤ 1 eventually. Equation (24) then gives E d ( ϵ ) ≤ G d ( 1 ) → 0 \mathcal{E}_d(\epsilon) \leq G_d(1) \to0 E d ( ϵ ) ≤ G d ( 1 ) → 0 . □
Lemma 2.2 (Detection through a positive covariance). Let K K K be a real skew Hilbert–Schmidt operator evaluated on d d d independent centered isotropic QC4 rows. Let C C C be positive trace class, with 0 ⪯ C ⪯ K ∗ K 0 \preceq C \preceq K^*K 0 ⪯ C ⪯ K ∗ K and L = tr C > 0 L=\operatorname{tr} C>0 L = tr C > 0 . Suppose that
⌈ 512 ( 1 + κ ) ⌉ ≤ r ≤ d , tr ( C 2 ) ≤ L 2 r . \lceil512(1+\kappa)\rceil\leq r \leq d,\qquad\operatorname{tr}(C^2)\leq\frac{L^2}{r}. ⌈ 512 ( 1 + κ )⌉ ≤ r ≤ d , tr ( C 2 ) ≤ r L 2 . With b = d L / 4 b=\sqrt{d}L/4 b = d L /4 and θ = r / ( 2 10 d ) \theta=r/(2^{10}d) θ = r / ( 2 10 d ) , one has
E μ d ( ( b , ∞ ) ) ≥ θ , (25) \mathbb{E}\mu_d((b,\infty))\geq\theta, \tag*{(25)} E μ d (( b , ∞ )) ≥ θ , (25) \mathbb{P}{\mu_d((b,\infty))<\theta/2}\leq\exp\left(-\frac{r^2}{2^{23}d}\right).
{#eq:2.7}
Proof. Split the spatial indices into blocks of sizes
m = ⌊ r / 64 ⌋ , n = d − m , ℓ = ⌊ m / 2 ⌋ . m=\lfloor r/64\rfloor,\qquad n=d-m,\qquad\ell=\lfloor m/2\rfloor. m = ⌊ r /64 ⌋ , n = d − m , ℓ = ⌊ m /2 ⌋ .
The assumptions imply m ≥ 8 m\geq8 m ≥ 8 , m ≥ r / 128 m\geq r/128 m ≥ r /128 , ℓ ≥ m / 3 \ell\geq m/3 ℓ ≥ m /3 , ℓ ≤ r / 128 \ell\leq r/128 ℓ ≤ r /128 , and n ≥ 63 d / 64 n\geq63d/64 n ≥ 63 d /64 . For i ≤ m i\leq m i ≤ m , let Y i = C 1 / 2 X i Y_i=C^{1/2}X_i Y i = C 1/2 X i and form the Gram matrix A = ( ⟨ Y i , Y j ⟩ ) i , j ≤ m A=(\langle Y_i,Y_j\rangle)_{i,j\leq m} A = (⟨ Y i , Y j ⟩ ) i , j ≤ m . Independence and isotropy give E ⟨ Y i , Y j ⟩ 2 = tr ( C 2 ) \mathbb{E}\langle Y_i,Y_j\rangle^2=\operatorname{tr}(C^2) E ⟨ Y i , Y j ⟩ 2 = tr ( C 2 ) for i ≠ j i\ne j i = j , while QC4 gives Var ∥ Y i ∥ 2 ≤ κ tr ( C 2 ) \operatorname{Var}\|Y_i\|^2\leq\kappa\operatorname{tr}(C^2) Var ∥ Y i ∥ 2 ≤ κ tr ( C 2 ) . Consequently
E ∥ A − L I m ∥ F 2 ≤ m ( m − 1 + κ ) tr ( C 2 ) ≤ m ( m + κ ) L 2 r . (26) \mathbb{E}\|A-LI_m\|_F^2\leq m(m-1+\kappa)\operatorname{tr}(C^2)\leq\frac{m(m+\kappa)L^2}{r}. \tag*{(26)} E ∥ A − L I m ∥ F 2 ≤ m ( m − 1 + κ ) tr ( C 2 ) ≤ r m ( m + κ ) L 2 . (26)
If fewer than ℓ \ell ℓ eigenvalues of A A A are at least L / 2 L/2 L /2 , more than m / 2 m/2 m /2 eigenvalues contribute at least L 2 / 4 L^2/4 L 2 /4 each to this squared deviation. Markov’s inequality bounds the failure probability by 8 ( m + κ ) / r ≤ 9 / 64 < 1 / 4 8(m+\kappa)/r\leq9/64<1/4 8 ( m + κ ) / r ≤ 9/64 < 1/4 .
Let V : R m → H V:\mathbb{R}^m\to\mathcal{H} V : R m → H have columns K X i KX_i K X i and write B = V ∗ V B=V^*V B = V ∗ V . Since C ⪯ K ∗ K C\preceq K^*K C ⪯ K ∗ K ,
B ⪰ A almost surely . (27) B\succeq A\quad\text{almost surely}. \tag*{(27)} B ⪰ A almost surely . (27)
Indeed, B − A B-A B − A is the Gram matrix of ( K ∗ K − C ) 1 / 2 X i (K^*K-C)^{1/2}X_i ( K ∗ K − C ) 1/2 X i . Thus, on an event of probability at least 3 / 4 3/4 3/4 , B B B has at least ℓ \ell ℓ eigenvalues at least L / 2 L/2 L /2 . Choose there a measurable m × ℓ m\times\ell m × ℓ isometry E E E spanning such a spectral subspace, and set
B E = E ∗ B E ⪰ ( L / 2 ) I ℓ , U = V E B E − 1 / 2 . B_E=E^*BE\succeq(L/2)I_\ell,\qquad U=VEB_E^{-1/2}. B E = E ∗ B E ⪰ ( L /2 ) I ℓ , U = V E B E − 1/2 .
Then U ∗ U = I ℓ U^*U=I_\ell U ∗ U = I ℓ .
Condition on the first block. Let D = ( ⟨ X j , K X i ⟩ ) j > m , i ≤ m D=(\langle X_j,KX_i\rangle)_{j>m,\ i\leq m} D = (⟨ X j , K X i ⟩ ) j > m , i ≤ m be the corresponding n × m n\times m n × m off-diagonal block of H d H_d H d . The rows of W = D E B E − 1 / 2 W=DEB_E^{-1/2} W = D E B E − 1/2 are independent isotropic vectors w j = U ∗ X j w_j=U^*X_j w j = U ∗ X j in R ℓ \mathbb{R}^\ell R ℓ . QC4 for the projection U U ∗ UU^* U U ∗ gives E 2 ∥ w j ∥ 4 ≤ ℓ 2 + κ ℓ \mathbb{E}_2\|w_j\|^4\leq\ell^2+\kappa\ell E 2 ∥ w j ∥ 4 ≤ ℓ 2 + κ ℓ . Expanding the sum of the centered independent matrices w j w j ∗ − I ℓ w_jw_j^*-I_\ell w j w j ∗ − I ℓ yields
E 2 ∥ n − 1 W ∗ W − I ℓ ∥ F 2 ≤ ℓ ( ℓ + κ − 1 ) n . (28) \mathbb{E}_2\left\|n^{-1}W^*W-I_\ell\right\|_F^2\leq\frac{\ell(\ell+\kappa-1)}{n}. \tag*{(28)} E 2 n − 1 W ∗ W − I ℓ F 2 ≤ n ℓ ( ℓ + κ − 1 ) . (28)
Each eigenvalue below 1 / 2 1/2 1/2 contributes at least 1 / 4 1/4 1/4 to the squared deviation. The conditional expected number of eigenvalues at least 1 / 2 1/2 1/2 is therefore at least
ℓ ( 1 − 4 ( ℓ + κ ) n ) ≥ ℓ / 2 , \ell\left(1-\frac{4(\ell+\kappa)}{n}\right)\geq\ell/2, ℓ ( 1 − n 4 ( ℓ + κ ) ) ≥ ℓ /2 ,
using ℓ ≤ r / 128 \ell\leq r/128 ℓ ≤ r /128 , κ ≤ r / 512 \kappa\leq r/512 κ ≤ r /512 and n ≥ 63 d / 64 n\geq63d/64 n ≥ 63 d /64 . Since D E = W B E 1 / 2 DE=WB_E^{1/2} D E = W B E 1/2 , each corresponding singular value of D E DE D E is at least
n L / 4 ≥ d L / 8 > b . \sqrt{nL/4}\geq\sqrt{dL/8}>b. n L /4 ≥ d L /8 > b .
Spatial compression and right multiplication by an isometry cannot increase singular values. The expected number of singular values of H d H_d H d exceeding b b b is consequently at least ( 3 / 4 ) ( ℓ / 2 ) ≥ m / 8 ≥ r / 1024 (3/4)(\ell/2)\geq m/8\geq r/1024 ( 3/4 ) ( ℓ /2 ) ≥ m /8 ≥ r /1024 . This proves (25) . Resampling one spatial row changes H d H_d H d by rank at most two,
::: so its tail fraction at a deterministic threshold changes by at most 2 / d 2/d 2/ d . The one-sided form of (20) gives exp ( − d θ 2 / 8 ) \exp(-d\theta^2/8) exp ( − d θ 2 /8 ) , proving (2.7).
For the cylindrical constructions, QC4 extends to positive trace-class forms by finite-rank truncation: centered forms converge in L 2 L^2 L 2 and their means converge in trace norm. The vectors C 1 / 2 X i C^{1/2}X_i C 1/2 X i , K X i KX_i K X i and ( K ∗ K − C ) 1 / 2 X i (K^*K-C)^{1/2}X_i ( K ∗ K − C ) 1/2 X i exist in L 2 ( H ) L^2(\mathcal{H}) L 2 ( H ) . Applying these three operators to common finite-dimensional projections of the rows and passing to the limit proves the Gram identity in (27) . For the random isometry U U U , rank-one QC4 gives E ∣ X j ( h ) ∣ 4 ≤ ( κ + 1 ) ∥ h ∥ 4 \mathbb{E}|X_j(h)|^4\le(\kappa+1)\lVert h\rVert^4 E ∣ X j ( h ) ∣ 4 ≤ ( κ + 1 ) ∥ h ∥ 4 . Expanding its finitely many unit columns in a fixed orthonormal basis, independence of each second-block row from U U U gives convergence of these evaluations in product L 4 L^4 L 4 . Fubini’s theorem transfers isotropy and the deterministic-projector bound Var ∥ U ∗ X j ∥ 2 ≤ κ ℓ \operatorname{Var}\lVert U^*X_j\rVert^2\le\kappa\ell Var ∥ U ∗ X j ∥ 2 ≤ κ ℓ to the conditional law. No pathwise continuous realization of a cylindrical row is used. □
Proposition 2.3 (Two-sided response detection). For every R > 0 R>0 R > 0 ,
E μ d ( ( R , ∞ ) ) ≤ min { 1 , 2 G d ( 1 / R ) } . (29) \mathbb{E}\mu_d((R,\infty))\le\min\{1,2G_d(1/R)\}. \tag*{(29)} E μ d (( R , ∞ )) ≤ min { 1 , 2 G d ( 1/ R )} . (29) Put r 0 = ⌈ 512 ( 1 + κ ) ⌉ r_0=\lceil512(1+\kappa)\rceil r 0 = ⌈ 512 ( 1 + κ )⌉ and c ∗ = 2 − 12 c_* = 2^{-12} c ∗ = 2 − 12 . For t > 0 t>0 t > 0 , write g = G d ( t ) g=G_d(t) g = G d ( t ) and h = min { g , 1 } h=\min\{g,1\} h = min { g , 1 } . If d h ≥ 4 r 0 dh\ge4r_0 d h ≥ 4 r 0 , then
E μ d ( ( g 4 t , ∞ ) ) ≥ c ∗ h , (30) \mathbb{E}\mu_d\left(\left(\frac{\sqrt{g}}{4t},\infty\right)\right)\ge c_*h, \tag*{(30)} E μ d ( ( 4 t g , ∞ ) ) ≥ c ∗ h , (30) P { μ d ( ( g 4 t , ∞ ) ) < c ∗ h 2 } ≤ exp ( − c ∗ 2 d h 2 / 8 ) . (31) \mathbb{P}\left\{\mu_d\left(\left(\frac{\sqrt{g}}{4t},\infty\right)\right)<\frac{c_*h}{2}\right\}\le\exp(-c_*^2dh^2/8). \tag*{(31)} P { μ d ( ( 4 t g , ∞ ) ) < 2 c ∗ h } ≤ exp ( − c ∗ 2 d h 2 /8 ) . (31)
Proof. For the upper bound, retain the temporal pairs with x k , d ≤ R x_{k,d}\le R x k , d ≤ R . The rank inequality and the second-moment isometry (21) give
E μ d ( ( R , ∞ ) ) ≤ 2 d # { k : x k , d > R } + 2 d ∑ x k , d ≤ R x k , d 2 R 2 . \mathbb{E}\mu_d((R,\infty))\le\frac{2}{d}\#\{k:x_{k,d}>R\}+\frac{2}{d}\sum_{x_{k,d}\le R}\frac{x_{k,d}^2}{R^2}. E μ d (( R , ∞ )) ≤ d 2 # { k : x k , d > R } + d 2 x k , d ≤ R ∑ R 2 x k , d 2 .
Each summand is bounded by twice the corresponding summand of G d ( 1 / R ) G_d(1/R) G d ( 1/ R ) : use 1 ≤ 2 x 2 / ( R 2 + x 2 ) 1\le2x^2/(R^2+x^2) 1 ≤ 2 x 2 / ( R 2 + x 2 ) for x > R x>R x > R and x 2 / R 2 ≤ 2 x 2 / ( R 2 + x 2 ) x^2/R^2\le2x^2/(R^2+x^2) x 2 / R 2 ≤ 2 x 2 / ( R 2 + x 2 ) for x ≤ R x\le R x ≤ R . This part uses only independence and isotropy.
For the lower bound apply Lemma 2.2 to the regularized temporal covariance
C t = K d ∗ K d ( I + t 2 d 2 K d ∗ K d ) − 1 . (32) C_t=K_d^*K_d(I+t^2d^2K_d^*K_d)^{-1}. \tag*{(32)} C t = K d ∗ K d ( I + t 2 d 2 K d ∗ K d ) − 1 . (32)
It satisfies 0 ⪯ C t ⪯ K d ∗ K d 0\preceq C_t\preceq K_d^*K_d 0 ⪯ C t ⪯ K d ∗ K d and
L t : = tr C t = g t 2 d , ∥ C t ∥ o p ≤ 1 t 2 d 2 , L t 2 tr ( C t 2 ) ≥ d g . (33) L_t:=\operatorname{tr}C_t=\frac{g}{t^2d},\qquad\lVert C_t\rVert_{\mathrm{op}}\le\frac{1}{t^2d^2},\qquad\frac{L_t^2}{\operatorname{tr}(C_t^2)}\ge dg. \tag*{(33)} L t := tr C t = t 2 d g , ∥ C t ∥ op ≤ t 2 d 2 1 , tr ( C t 2 ) L t 2 ≥ d g . (33)
Choose r = ⌊ d h / 2 ⌋ r=\lfloor dh/2\rfloor r = ⌊ d h /2 ⌋ . Then r 0 ≤ r ≤ d r_0\le r\le d r 0 ≤ r ≤ d , r ≥ d h / 4 r\ge dh/4 r ≥ d h /4 , and r ≤ d g r\le dg r ≤ d g . The detector’s threshold is d L t / 4 = g / ( 4 t ) \sqrt{dL_t}/4=\sqrt{g}/(4t) d L t /4 = g / ( 4 t ) , and its fraction is at least h / 2 12 h/2^{12} h / 2 12 . Its concentration bound is at most exp ( − d h 2 / 2 27 ) \exp(-dh^2/2^{27}) exp ( − d h 2 / 2 27 ) , as required. □
Proof of the tightness assertions in Theorem A. By Lemma 2.1 , the trimmed-energy condition is exactly (RC). Under this condition, (29) proves tightness of the mean laws; finitely many initial probability measures are individually tight. At every deterministic threshold R R R , bounded differences give
P { ∣ μ d ( ( R , ∞ ) ) − E μ d ( ( R , ∞ ) ) ∣ > u } ≤ 2 e − d u 2 / 2 . (34) \mathbb{P}\left\{\left|\mu_d((R,\infty))-\mathbb{E}\mu_d((R,\infty))\right|>u\right\}\le2e^{-du^2/2}. \tag*{(34)} P { ∣ μ d (( R , ∞ )) − E μ d (( R , ∞ )) ∣ > u } ≤ 2 e − d u 2 /2 . (34)
Borel–Cantelli at integer thresholds and positive rational u u u upgrades mean tightness to almost-sure tightness of the sample sequence. Conversely, if that sequence is almost surely tight, Z R : = sup d μ d ( ( R , ∞ ) ) ↓ 0 Z_R:=\sup_d\mu_d((R,\infty))\downarrow0 Z R := sup d μ d (( R , ∞ )) ↓ 0 almost surely. Dominated convergence gives sup d E μ d ( ( R , ∞ ) ) ≤ E Z R → 0 \sup_d\mathbb{E}\mu_d((R,\infty))\le\mathbb{E}Z_R\to0 sup d E μ d (( R , ∞ )) ≤ E Z R → 0 . If (RC) fails, choose ε > 0 \varepsilon>0 ε > 0 , t j ↓ 0 t_j\downarrow0 t j ↓ 0 , and strictly increasing d j d_j d j such that G d j ( t j ) ≥ ε G_{d_j}(t_j)\ge\varepsilon G d j ( t j ) ≥ ε . The dimensions may be taken large enough for Proposition 2.3 to apply. It forces a fixed positive mean tail fraction above R j = ε / ( 4 t j ) → ∞ R_j=\sqrt{\varepsilon}/(4t_j)\to\infty R j = ε / ( 4 t j ) → ∞ , excluding mean tightness. The failure probabilities in (31) are at most e − c ε d j e^{-c_\varepsilon d_j} e − c ε d j and are summable. Thus some δ > 0 \delta>0 δ > 0 satisfies μ d j ( ( R j , ∞ ) ) ≥ δ \mu_{d_j}((R_j,\infty))\ge\delta μ d j (( R j , ∞ )) ≥ δ almost surely for all large j j j , under any coupling across dimensions. This also proves almost-sure non-tightness when the equivalent conditions fail. □
The same escaping subsequence has, on one probability-one event,
F d j ( z ) ≥ δ 2 log ( 1 + z 2 R j 2 ) ⟶ ∞ for every z > 0. (35) F_{d_j}(z) \ge\frac{\delta}{2}\log(1+z^2R_j^2)\longrightarrow\infty\qquad\text{for every } z>0. \tag*{(35)} F d j ( z ) ≥ 2 δ log ( 1 + z 2 R j 2 ) ⟶ ∞ for every z > 0. (35)
In particular, boundedness in probability of one logarithmic response forces the tightness conditions of Theorem A.
Proof of the zero-limit assertions in Theorem A. By Lemma 2.1 , the energy condition is equivalent to G d ( 1 ) → 0 G_d(1)\to0 G d ( 1 ) → 0 . Responses at any two fixed positive parameters bound one another up to deterministic constants. Therefore (29) implies E μ d ( ( R , ∞ ) ) → 0 \mathbb{E}\mu_d((R,\infty))\to0 E μ d (( R , ∞ )) → 0 for every R > 0 R>0 R > 0 . Apply (2.16 on a countable positive sequence of thresholds tending to zero to obtain μ d ⇒ δ 0 \mu_d\Rightarrow\delta_0 μ d ⇒ δ 0 almost surely. Conversely, convergence in probability to δ 0 \delta_0 δ 0 implies the same mean-tail convergence. If G d ( 1 ) G_d(1) G d ( 1 ) stayed above some a > 0 a>0 a > 0 on a subsequence, (30) at t = 1 t=1 t = 1 would force a positive mean fraction above a / 4 \sqrt{a}/4 a /4 , a contradiction.
Under the energy condition choose a deterministic sequence ε d ↓ 0 \varepsilon_d\downarrow0 ε d ↓ 0 sufficiently slowly that E d ( ε d ) → 0 \mathcal{E}_d(\varepsilon_d)\to0 E d ( ε d ) → 0 . Let R d R_d R d retain the first ⌊ ε d d ⌋ \lfloor\varepsilon_d d\rfloor ⌊ ε d d ⌋ skew pairs of K d K_d K d , and put S d = K d − R d S_d=K_d-R_d S d = K d − R d . Then
rank R d d ≤ 2 ε d ⟶ 0 , d ∥ S d ∥ S 2 2 = 2 E d ( ε d ) ⟶ 0. \frac{\operatorname{rank}R_d}{d}\le2\varepsilon_d\longrightarrow0,\qquad d\lVert S_d\rVert_{S_2}^2=2\mathcal{E}_d(\varepsilon_d)\longrightarrow0. d rank R d ≤ 2 ε d ⟶ 0 , d ∥ S d ∥ S 2 2 = 2 E d ( ε d ) ⟶ 0.
Conversely, any deterministic skew decomposition with these limits, evaluated on the same rows, gives
E μ d ( ( R , ∞ ) ) ≤ rank R d d + ( d − 1 ) ∥ S d ∥ S 2 2 R 2 ⟶ 0. \mathbb{E}\mu_d((R,\infty))\le\frac{\operatorname{rank}R_d}{d}+\frac{(d-1)\lVert S_d\rVert_{S_2}^2}{R^2}\longrightarrow0. E μ d (( R , ∞ )) ≤ d rank R d + R 2 ( d − 1 ) ∥ S d ∥ S 2 2 ⟶ 0.
Equation (34) again gives almost-sure convergence to δ 0 \delta_0 δ 0 . □
Corollary 2.4 (Fixed-kernel critical boundaries). For a fixed real skew K ∈ S 2 K\in S_2 K ∈ S 2 under QC4,
( E μ d ) d is tight ⟺ ( μ d ) d is tight almost surely ⟺ K ∈ S 1 , ∞ , (\mathbb{E}\mu_d)_d\text{ is tight}\Longleftrightarrow(\mu_d)_d\text{ is tight almost surely}\Longleftrightarrow K\in S_{1,\infty}, ( E μ d ) d is tight ⟺ ( μ d ) d is tight almost surely ⟺ K ∈ S 1 , ∞ ,
μ d ⇒ δ 0 in probability ⟺ μ d ⇒ δ 0 almost surely ⟺ K ∈ S 1 , ∞ 0 . \mu_d\Rightarrow\delta_0\text{ in probability}\Longleftrightarrow\mu_d\Rightarrow\delta_0\text{ almost surely}\Longleftrightarrow K\in S^0_{1,\infty}. μ d ⇒ δ 0 in probability ⟺ μ d ⇒ δ 0 almost surely ⟺ K ∈ S 1 , ∞ 0 .
Boundedness in probability of F d ( z 0 ) F_d(z_0) F d ( z 0 ) at one z 0 > 0 z_0>0 z 0 > 0 also forces K ∈ S 1 , ∞ K\in S_{1,\infty} K ∈ S 1 , ∞ .
Proof. If A = sup k k λ k ( K ) < ∞ A=\sup_k k\lambda_k(K)<\infty A = sup k k λ k ( K ) < ∞ , then E d ( ε ) ≤ A 2 d ∑ k > ⌊ ε d ⌋ k − 2 \mathcal{E}_d(\varepsilon)\le A^2d\sum_{k>\lfloor\varepsilon d\rfloor}k^{-2} E d ( ε ) ≤ A 2 d ∑ k > ⌊ ε d ⌋ k − 2 is bounded for each fixed ε > 0 \varepsilon>0 ε > 0 as d → ∞ d\to\infty d → ∞ . Conversely, the energy bound at ε = 1 \varepsilon=1 ε = 1 gives boundedness of n ∑ k > n λ k 2 n\sum_{k>n}\lambda_k^2 n ∑ k > n λ k 2 , and
n 2 λ 2 n 2 ≤ n ∑ k > n λ k 2 . n^2\lambda_{2n}^2\le n\sum_{k>n}\lambda_k^2. n 2 λ 2 n 2 ≤ n k > n ∑ λ k 2 .
Monotonicity fills the gaps between even indices and gives weak trace. The same argument with limits zero gives little weak trace; in the other direction, k λ k → 0 k\lambda_k\to0 k λ k → 0 bounds each sufficiently remote tail by an arbitrarily small multiple of ∑ k − 2 \sum k^{-2} ∑ k − 2 . Theorem A now applies. The final assertion follows from (35) . □
Exterior determinants and a single amplitude window
This section supplies the probabilistic estimates used in both the moving and fixed-kernel arguments under QC4. The exterior mean is distribution-free under isotropy. A positive Schur complement controls both mean replacement and sample variance; a Gaussian reference is used only to compare its mean logarithm with the exterior determinant.
The exterior mean and its scalar saddle
Write e m e_m e m for the m m m th elementary symmetric function, with e 0 = 1 e_0=1 e 0 = 1 .
Lemma 3.1 (Exterior determinant identity). For independent centered isotropic rows and a real skew K ∈ S 2 K\in S_2 K ∈ S 2 ,
P d K ( z ) : = E det ( I + z H d ( K ) ) = ∑ 2 m ≤ d ( d ) 2 m e m ( λ 1 2 , λ 2 2 , … ) z 2 m , ( d ) r = d ! ( d − r ) ! (36) P_d^K(z):=\mathbb{E}\det(I+zH_d(K))=\sum_{2m\le d}(d)_{2m}e_m(\lambda_1^2,\lambda_2^2,\ldots)z^{2m},\qquad(d)_r=\frac{d!}{(d-r)!} \tag*{(36)} P d K ( z ) := E det ( I + z H d ( K )) = 2 m ≤ d ∑ ( d ) 2 m e m ( λ 1 2 , λ 2 2 , … ) z 2 m , ( d ) r = ( d − r )! d ! (36)
Thus the mean depends only on the covariance and the temporal singular coefficients. With K K K fixed while the auxiliary dimension n n n varies,
∑ n ≥ 0 P n K ( z ) w n n ! = e w F K ( z w ) , F K ( u ) = ∏ k ≥ 1 ( 1 + u 2 λ k 2 ) . (37) \sum_{n\ge0} P_n^K(z)\frac{w^n}{n!}=e^w\mathcal{F}_K(zw),\qquad\mathcal{F}_K(u)=\prod_{k\ge1}(1+u^2\lambda_k^2). \tag*{(37)} n ≥ 0 ∑ P n K ( z ) n ! w n = e w F K ( z w ) , F K ( u ) = k ≥ 1 ∏ ( 1 + u 2 λ k 2 ) . (37)
For a subset J J J of the skew pairs of K d K_d K d ,
1 d log P d K J ( z ) ≤ Φ d J ( z ) : = 1 d ∑ k ∈ J log ( 1 + z 2 d 2 λ k , d 2 ) . (38) \frac{1}{d}\log P_d^{K_J}(z)\le\Phi_d^J(z):=\frac{1}{d}\sum_{k\in J}\log(1+z^2d^2\lambda_{k,d}^2). \tag*{(38)} d 1 log P d K J ( z ) ≤ Φ d J ( z ) := d 1 k ∈ J ∑ log ( 1 + z 2 d 2 λ k , d 2 ) . (38)
Proof. In finite temporal dimension, the principal-Pfaffian expansion and the minor-summation formula [9 ] give, for ∣ I ∣ = 2 m |I|=2m ∣ I ∣ = 2 m ,
Pf ( ( X K X K T ) I , I ) = ∑ ∣ J ∣ = 2 m det ( X I , J ) Pf ( K J , J ) . \operatorname{Pf}((X_KX_K^{\mathsf T})_{I,I})=\sum_{|J|=2m}\det(X_{I,J})\operatorname{Pf}(K_{J,J}). Pf (( X K X K T ) I , I ) = ∣ J ∣ = 2 m ∑ det ( X I , J ) Pf ( K J , J ) .
Expanding the two determinants row by row, independence and isotropy give
E [ det ( X I , J ) det ( X I , J ′ ) ] = ( 2 m ) ! 1 { J = J ′ } . \mathbb{E}[\det(X_{I,J})\det(X_{I,J'})]=(2m)!\mathbf{1}_{\{J=J'\}}. E [ det ( X I , J ) det ( X I , J ′ )] = ( 2 m )! 1 { J = J ′ } .
Each row appears only quadratically; temporal coordinate independence and fourth moments are unnecessary. The sum of the squared size-2 m 2m 2 m principal Pfaffians of K K K is e m ( λ 2 ) e_m(\lambda^2) e m ( λ 2 ) . Summing over I I I proves (36) .
For infinite temporal rank, take spectral truncations K n → K K_n\to K K n → K in S 2 S_2 S 2 and write ω K = ∑ p < q K p q e p ∧ e q ∈ Λ 2 H \omega_K=\sum_{p<q}K_{pq}e_p\wedge e_q\in\Lambda^2\mathcal{H} ω K = ∑ p < q K pq e p ∧ e q ∈ Λ 2 H . The coordinates of ω K ∧ m / m ! \omega_K^{\wedge m}/m! ω K ∧ m / m ! are the corresponding Pfaffians. The same isometry gives
E ∣ Pf ( H d ( K n ) I , I ) − Pf ( H d ( K ℓ ) I , I ) ∣ 2 = ( 2 m ) ! ∥ ω K n ∧ m − ω K ℓ ∧ m m ! ∥ 2 . \mathbb{E}\left|\operatorname{Pf}(H_d(K_n)_{I,I})-\operatorname{Pf}(H_d(K_\ell)_{I,I})\right|^2=(2m)!\left\|\frac{\omega_{K_n}^{\wedge m}-\omega_{K_\ell}^{\wedge m}}{m!}\right\|^2. E ∣ Pf ( H d ( K n ) I , I ) − Pf ( H d ( K ℓ ) I , I ) ∣ 2 = ( 2 m )! m ! ω K n ∧ m − ω K ℓ ∧ m 2 .
Continuity of exterior multiplication in fixed degrees makes this tend to zero. The bilinear entries converge in L 2 L^2 L 2 , and continuity of the finite Pfaffian polynomial identifies the probability limit. Hence the Pfaffians converge in L 2 L^2 L 2 and their squares in L 1 L^1 L 1 . This proves the infinite-rank formula. Positivity permits rearrangement of the generating series; ( d ) 2 m ≤ d 2 m (d)_{2m}\le d^{2m} ( d ) 2 m ≤ d 2 m proves (38) . □
Consider the objective defining V d V_d V d in (16) . Its derivative has the sign of q + G d ( z q ) − 1 q+G_d(zq)-1 q + G d ( z q ) − 1 , which is strictly increasing in q q q , and the objective diverges at both endpoints. Thus its unique minimizer is q d ( z ) ∈ ( 0 , 1 ] q_d(z)\in(0,1] q d ( z ) ∈ ( 0 , 1 ] . Testing at q = 1 q=1 q = 1 gives
e − 1 − Φ d ( z ) ≤ q d ( z ) ≤ 1 , 0 ≤ V d ( z ) ≤ Φ d ( z ) . (39) e^{-1-\Phi_d(z)}\le q_d(z)\le1,\qquad0\le V_d(z)\le\Phi_d(z). \tag*{(39)} e − 1 − Φ d ( z ) ≤ q d ( z ) ≤ 1 , 0 ≤ V d ( z ) ≤ Φ d ( z ) . (39)
Writing u = log z u=\log z u = log z , t = z q d ( z ) t=zq_d(z) t = z q d ( z ) and B = t G d ′ ( t ) ≥ 0 B=tG'_d(t)\ge0 B = t G d ′ ( t ) ≥ 0 , differentiation of the root equation and of the objective at its minimizer gives
d q d d u = − q d B q d + B , d V d ( e u ) d u = 1 − q d ( e u ) , 0 ≤ d 2 V d ( e u ) d u 2 ≤ 1. (40) \frac{dq_d}{du}=-\frac{q_dB}{q_d+B},\qquad\frac{dV_d(e^u)}{du}=1-q_d(e^u),\qquad0\le\frac{d^2V_d(e^u)}{du^2}\le1. \tag*{(40)} d u d q d = − q d + B q d B , d u d V d ( e u ) = 1 − q d ( e u ) , 0 ≤ d u 2 d 2 V d ( e u ) ≤ 1. (40)
The same root derivative holds for q η q_\eta q η , since G η G_\eta G η is differentiable and nondecreasing on positive arguments.
Lemma 3.2 (Uniform scalar saddle estimate). If sup d Φ d ( z ) ≤ B < ∞ \sup_d\Phi_d(z)\le B<\infty sup d Φ d ( z ) ≤ B < ∞ at a fixed z > 0 z>0 z > 0 , then
∣ 1 d log P d K d ( z ) − V d ( z ) ∣ ≤ C B d . (41) \left|\frac{1}{d}\log P_d^{K_d}(z)-V_d(z)\right|\le\frac{C_B}{d}. \tag*{(41)} d 1 log P d K d ( z ) − V d ( z ) ≤ d C B . (41) The estimate is uniform on parameter sets with a common source bound.
Proof. Put q = q d ( z ) q=q_d(z) q = q d ( z ) and w = d q w=dq w = d q . Introduce independent variables
N ∼ Pois ( w ) , B k ∼ Bernoulli ( z 2 w 2 λ k , d 2 1 + z 2 w 2 λ k , d 2 ) , S = 2 ∑ k B k . N\sim\operatorname{Pois}(w),\qquad B_k\sim\operatorname{Bernoulli}\left(\frac{z^2w^2\lambda_{k,d}^2}{1+z^2w^2\lambda_{k,d}^2}\right),\qquad S=2\sum_k B_k. N ∼ Pois ( w ) , B k ∼ Bernoulli ( 1 + z 2 w 2 λ k , d 2 z 2 w 2 λ k , d 2 ) , S = 2 k ∑ B k .
The sum is almost surely finite. Coefficient extraction in (37) gives
P d K d ( z ) = d ! w d e w F K d ( z w ) P ( N + S = d ) . (42) P_d^{K_d}(z)=\frac{d!}{w^d}e^w\mathcal{F}_{K_d}(zw)\mathbb{P}(N+S=d). \tag*{(42)} P d K d ( z ) = w d d ! e w F K d ( z w ) P ( N + S = d ) . (42)
The root equation gives E ( N + S ) = d \mathbb{E}(N+S)=d E ( N + S ) = d , while Var S ≤ 2 d \operatorname{Var} S\le2d Var S ≤ 2 d and c d ≤ w ≤ d cd\le w\le d c d ≤ w ≤ d , with c = e − 1 − B c=e^{-1-B} c = e − 1 − B . With probability at least 7 / 8 7/8 7/8 , ∣ S − E S ∣ ≤ 4 d |S-\mathbb{E}S|\le4\sqrt{d} ∣ S − E S ∣ ≤ 4 d . For sufficiently large d d d , uniformly in the kernel, the required Poisson index d − S d-S d − S is nonnegative and lies within 4 d 4\sqrt{d} 4 d of w w w . Stirling’s bounds give a Poisson mass at least c B / d c_B/\sqrt{d} c B / d throughout this window. The maximal Poisson mass is at most C B / d C_B/\sqrt{d} C B / d , so conditioning on S S S proves
c B d − 1 / 2 ≤ P ( N + S = d ) ≤ C B d − 1 / 2 . c_Bd^{-1/2}\le\mathbb{P}(N+S=d)\le C_Bd^{-1/2}. c B d − 1/2 ≤ P ( N + S = d ) ≤ C B d − 1/2 .
The bounded remaining range of dimensions is uniform as well, since
P ( N + S = d ) ≥ P ( N = d ) P ( S = 0 ) ≥ e − d ( c d ) d d ! e − d B . \mathbb{P}(N+S=d)\ge\mathbb{P}(N=d)\mathbb{P}(S=0)\ge e^{-d}\frac{(cd)^d}{d!}e^{-dB}. P ( N + S = d ) ≥ P ( N = d ) P ( S = 0 ) ≥ e − d d ! ( c d ) d e − d B .
Here P ( S = 0 ) = F K d ( z w ) − 1 ≥ e − d B \mathbb{P}(S=0)=\mathcal{F}_{K_d}(zw)^{-1}\ge e^{-dB} P ( S = 0 ) = F K d ( z w ) − 1 ≥ e − d B . Finally,
log P d K d ( z ) − d V d ( z ) = log d ! − d log d + d + log P ( N + S = d ) . \log P_d^{K_d}(z)-dV_d(z)=\log d!-d\log d+d+\log\mathbb{P}(N+S=d). log P d K d ( z ) − d V d ( z ) = log d ! − d log d + d + log P ( N + S = d ) .
The two half-logarithmic terms cancel, proving (41) . □
Logarithmic perturbation estimates
For a real skew matrix H H H of size d d d , let μ H \mu_H μ H be its empirical singular law and put F H ( z ) = d − 1 log det ( I + z H ) F_H(z)=d^{-1}\log\det(I+zH) F H ( z ) = d − 1 log det ( I + z H ) . Direct differentiation gives
d F H ( e u ) d u = ∫ e 2 u s 2 1 + e 2 u s 2 μ H ( d s ) , 0 ≤ d 2 F H ( e u ) d u 2 ≤ 1 2 . (43) \frac{\mathrm{d}F_H(e^u)}{\mathrm{d}u}=\int\frac{e^{2u}s^2}{1+e^{2u}s^2}\,\mu_H(\mathrm{d}s),\qquad0\le\frac{\mathrm{d}^2F_H(e^u)}{\mathrm{d}u^2}\le\frac{1}{2}. \tag*{(43)} d u d F H ( e u ) = ∫ 1 + e 2 u s 2 e 2 u s 2 μ H ( d s ) , 0 ≤ d u 2 d 2 F H ( e u ) ≤ 2 1 . (43)
Since a skew resolvent has operator norm at most one, integration along a skew line segment gives
∣ F A ( z ) − F B ( z ) ∣ ≤ z d ∥ A − B ∥ F . (44) |F_A(z)-F_B(z)|\le\frac{z}{\sqrt{d}}\lVert A-B\rVert_F. \tag*{(44)} ∣ F A ( z ) − F B ( z ) ∣ ≤ d z ∥ A − B ∥ F . (44)
Together with (21) , this gives L 2 L^2 L 2 convergence of the sample logarithms under Hilbert–Schmidt approximation of the kernel.
Lemma 3.3 (Rank and logarithmic perturbation bounds). For real skew U , B U,B U , B of size d d d , with rank B ≤ r B\le r B ≤ r ,
∣ log det ( I + z ( U + B ) ) − log det ( I + z U ) ∣ ≤ ∑ j = 1 r log ( 1 + z s j ( B ) ) \left|\log\det(I+z(U+B))-\log\det(I+zU)\right|
\le\sum_{j=1}^{r}\log(1+zs_j(B)) ∣ log det ( I + z ( U + B )) − log det ( I + z U ) ∣ ≤ j = 1 ∑ r log ( 1 + z s j ( B )) ≤ log det ( I + z B ) + r 2 log 2 , (45) \le\log\det(I+zB)+\frac{r}{2}\log2, \tag*{(45)} ≤ log det ( I + z B ) + 2 r log 2 , (45) where singular values beyond dimension d d d are read as zero. If B = H d ( K d J ) B=H_d(K_d^J) B = H d ( K d J ) for a set of r / 2 r/2 r /2 temporal pairs, then
1 d E ∣ log det ( I + z ( U + B ) ) − log det ( I + z U ) ∣ ≤ Φ d J ( z ) + r log 2 2 d . (46) \frac{1}{d}\mathbb{E}\left|\log\det(I+z(U+B))-\log\det(I+zU)\right|
\le\Phi_d^J(z)+\frac{r\log2}{2d}. \tag*{(46)} d 1 E ∣ log det ( I + z ( U + B )) − log det ( I + z U ) ∣ ≤ Φ d J ( z ) + 2 d r log 2 . (46) No independence between U U U and B B B is required.
Proof. Factor the determinant ratio relative to U U U , and then factor the inverse ratio relative to U + B U+B U + B . Both resolvents are contractions, and ∣ det ( I + M ) ∣ ≤ ∏ j ( 1 + s j ( M ) ) |\det(I+M)|\le\prod_j(1+s_j(M)) ∣ det ( I + M ) ∣ ≤ ∏ j ( 1 + s j ( M )) bounds each ratio by the first sum in (45) . Pair the singular values of B B B and use ( 1 + x ) 2 ≤ 2 ( 1 + x 2 ) (1+x)^2\le2(1+x^2) ( 1 + x ) 2 ≤ 2 ( 1 + x 2 ) . Jensen’s inequality and (38) give (46) . □
Removing a temporal head of full even rank r r r and applying (21) to the remainder gives
E μ H d ( K ) ( ( x , ∞ ) ) ≤ r d + d x 2 ∑ j > r s j ( K ) 2 . (47) \mathbb{E}\mu_{H_d(K)}((x,\infty))\le\frac{r}{d}+\frac{d}{x^2}\sum_{j>r}s_j(K)^2. \tag*{(47)} E μ H d ( K ) (( x , ∞ )) ≤ d r + x 2 d j > r ∑ s j ( K ) 2 . (47)
If A = sup k k λ k ( K ) < ∞ A=\sup_k k\lambda_k(K)<\infty A = sup k k λ k ( K ) < ∞ , optimizing r r r , with r = 0 r=0 r = 0 when the optimizer falls below the first skew pair, yields
sup d E μ H d ( K ) ( ( x , ∞ ) ) ≤ min { 1 , C 0 A / x } . (48) \sup_d\mathbb{E}\mu_{H_d(K)}((x,\infty))\le\min\{1,C_0A/x\}. \tag*{(48)} d sup E μ H d ( K ) (( x , ∞ )) ≤ min { 1 , C 0 A / x } . (48)
The estimate is uniform for varying kernels with the same A A A . For g z ( s ) = 1 2 log ( 1 + z 2 s 2 ) g_z(s)=\frac{1}{2}\log(1+z^2s^2) g z ( s ) = 2 1 log ( 1 + z 2 s 2 ) , integration by parts consequently gives
sup d ∫ ( R , ∞ ) g z ( s ) E μ d ( d s ) ≤ C 0 A R ( g z ( R ) + 1 ) ⟶ 0. (49) \sup_d\int_{(R,\infty)}g_z(s)\,\mathbb{E}\mu_d(ds)\le\frac{C_0A}{R}\bigl(g_z(R)+1\bigr)\longrightarrow0. \tag*{(49)} d sup ∫ ( R , ∞ ) g z ( s ) E μ d ( d s ) ≤ R C 0 A ( g z ( R ) + 1 ) ⟶ 0. (49)
Mean replacement and variance from the Schur complement
Lemma 3.4 (QC4 comparison and self-averaging). For a real skew T ∈ S 2 T\in S_2 T ∈ S 2 , let superscripts X X X and G G G denote the given QC4 rows and independent standard Gaussian rows, respectively. Then
∣ E F d X ( T ; z ) − E F d G ( T ; z ) ∣ ≤ C κ z 4 { d ∥ T ∥ S 2 4 + d 2 ∥ T ∥ S 4 4 } , (50) \left|\mathbb{E}F_d^X(T;z)-\mathbb{E}F_d^G(T;z)\right|\le C_\kappa z^4\{d\|T\|_{S_2}^4+d^2\|T\|_{S_4}^4\}, \tag*{(50)} E F d X ( T ; z ) − E F d G ( T ; z ) ≤ C κ z 4 { d ∥ T ∥ S 2 4 + d 2 ∥ T ∥ S 4 4 } , (50) Var ( F d X ( T ; z ) ) ≤ C κ z 4 { ∥ T ∥ S 2 4 + d ∥ T ∥ S 4 4 } . (51) \operatorname{Var}(F_d^X(T;z))\le C_\kappa z^4\{\|T\|_{S_2}^4+d\|T\|_{S_4}^4\}. \tag*{(51)} Var ( F d X ( T ; z )) ≤ C κ z 4 { ∥ T ∥ S 2 4 + d ∥ T ∥ S 4 4 } . (51) Here ∥ T ∥ S 2 4 = ( tr T ∗ T ) 2 \|T\|_{S_2}^4=(\operatorname{tr}T^*T)^2 ∥ T ∥ S 2 4 = ( tr T ∗ T ) 2 , whereas ∥ T ∥ S 4 4 = tr ( ( T ∗ T ) 2 ) \|T\|_{S_4}^4=\operatorname{tr}((T^*T)^2) ∥ T ∥ S 4 4 = tr (( T ∗ T ) 2 ) .
Proof. First work in finite temporal dimension. Condition on all rows except row i i i in a hybrid array Z Z Z of QC4 and Gaussian rows. Let B B B be the remaining skew matrix and let V V V have columns T Z j TZ_j T Z j , j ≠ i j\ne i j = i . Schur complementation gives
log det ( I + z H d ) = log det ( I + z B ) + log ( 1 + ⟨ Z i , M i Z i ⟩ ) , \log\det(I+zH_d)=\log\det(I+zB)+\log(1+\langle Z_i,M_iZ_i\rangle), log det ( I + z H d ) = log det ( I + z B ) + log ( 1 + ⟨ Z i , M i Z i ⟩) , M i = z 2 V ( I + z 2 B T B ) − 1 V ∗ ⪰ 0. (52) M_i=z^2V(I+z^2B^\mathsf{T}B)^{-1}V^*\succeq0. \tag*{(52)} M i = z 2 V ( I + z 2 B T B ) − 1 V ∗ ⪰ 0. (52) Indeed the symmetric part of ( I + z B ) − 1 (I+zB)^{-1} ( I + z B ) − 1 is ( I + z 2 B T B ) − 1 (I+z^2B^\mathsf{T}B)^{-1} ( I + z 2 B T B ) − 1 . The finite-rank M i M_i M i is determined by the other rows. Conditional QC4 therefore applies to M i M_i M i , and both candidate rows have quadratic mean m i = tr M i m_i=\operatorname{tr}M_i m i = tr M i .
For Q ≥ 0 Q\ge0 Q ≥ 0 with mean m m m , Taylor’s theorem gives
0 ≤ log ( 1 + m ) − E log ( 1 + Q ) ≤ 1 2 Var Q . 0\le\log(1+m)-\mathbb{E}\log(1+Q)\le\frac{1}{2}\operatorname{Var}Q. 0 ≤ log ( 1 + m ) − E log ( 1 + Q ) ≤ 2 1 Var Q . The linear terms cancel between the two row laws, so one replacement has conditional error at most ( κ + 2 ) ∥ M i ∥ S 2 2 / 2 (\kappa+2)\|M_i\|_{S_2}^2/2 ( κ + 2 ) ∥ M i ∥ S 2 2 /2 . Put S = T ∗ T S=T^*T S = T ∗ T and θ = max { κ , 2 } \theta=\max\{\kappa,2\} θ = max { κ , 2 } . The middle factor in M i M_i M i is a positive contraction, and hence
E ∥ M i ∥ S 2 2 ≤ z 4 E tr ( ( V ∗ V ) 2 ) \mathbb{E}\|M_i\|_{S_2}^2\le z^4\mathbb{E}\operatorname{tr}((V^*V)^2) E ∥ M i ∥ S 2 2 ≤ z 4 E tr (( V ∗ V ) 2 ) ≤ z 4 { ( d − 1 ) ( tr S ) 2 + [ ( d − 1 ) θ + ( d − 1 ) ( d − 2 ) ] tr ( S 2 ) } . (53) \le z^4\{(d-1)(\operatorname{tr}S)^2+[(d-1)\theta+(d-1)(d-2)]\operatorname{tr}(S^2)\}. \tag*{(53)} ≤ z 4 {( d − 1 ) ( tr S ) 2 + [( d − 1 ) θ + ( d − 1 ) ( d − 2 )] tr ( S 2 )} . (53) For distinct rows, the summand is E ⟨ T Z j , T Z k ⟩ 2 = tr ( S 2 ) \mathbb{E}\langle TZ_j,TZ_k\rangle^2=\operatorname{tr}(S^2) E ⟨ T Z j , T Z k ⟩ 2 = tr ( S 2 ) ; diagonal summands are at most ( tr S ) 2 + θ tr ( S 2 ) (\operatorname{tr}S)^2+\theta\operatorname{tr}(S^2) ( tr S ) 2 + θ tr ( S 2 ) . Summing d d d replacements and dividing by d d d proves (50) .
For the variance, tensorization over the independent spatial rows gives
Var ( F d X ) ≤ 1 d 2 ∑ i E Var X i ( log ( 1 + ⟨ X i , M i X i ⟩ ) ) . \operatorname{Var}(F_d^X)\le\frac{1}{d^2}\sum_i\mathbb{E}\operatorname{Var}_{X_i}\bigl(\log(1+\langle X_i,M_iX_i\rangle)\bigr). Var ( F d X ) ≤ d 2 1 i ∑ E Var X i ( log ( 1 + ⟨ X i , M i X i ⟩) ) . A one-Lipschitz scalar function contracts variance, by the independent-copy formula for variance. Thus each conditional variance is at most κ ∥ M i ∥ S 2 2 \kappa\|M_i\|_{S_2}^2 κ ∥ M i ∥ S 2 2 . Equation (53) proves (51) .
For cylindrical rows, T Z j TZ_j T Z j is Hilbert valued in L 2 L^2 L 2 . The positive trace-class quadratic form associated with S S S has a finite second moment: finite-rank approximation in QC4 gives E ∥ T Z j ∥ 4 ≤ ( tr S ) 2 + κ tr ( S 2 ) \mathbb{E}\|TZ_j\|^4\le(\operatorname{tr}S)^2+\kappa\operatorname{tr}(S^2) E ∥ T Z j ∥ 4 ≤ ( tr S ) 2 + κ tr ( S 2 ) . Apply the preceding argument to spectral truncations of T T T . Equation (44) gives L 2 L^2 L 2 convergence of the logarithms, so both the means and variances converge. The Schatten norms on the right converge as well. This proves the asserted infinite-rank bounds without higher moment assumptions. □
Lemma 3.5 (Gaussian Jensen comparison). For independent standard Gaussian cylindrical rows and a real skew K ∈ S 2 K\in S_2 K ∈ S 2 , put h = ∥ K ∥ S 2 h=\|K\|_{S_2} h = ∥ K ∥ S 2 and k = ∥ K ∥ o p k=\|K\|_{\mathrm{op}} k = ∥ K ∥ op . If z k < 1 zk<1 z k < 1 , then
0 ≤ 1 d log P d K ( z ) − E F d G ( K ; z ) ≤ z 2 h 2 2 ( 1 − z k ) . (54) 0\le\frac{1}{d}\log P_d^K(z)-\mathbb{E}F_d^G(K;z)\le\frac{z^2h^2}{2(1-zk)}. \tag*{(54)} 0 ≤ d 1 log P d K ( z ) − E F d G ( K ; z ) ≤ 2 ( 1 − z k ) z 2 h 2 . (54)
Proof. First work in finite temporal dimension, with standard Gaussian array law γ \gamma γ . For f ( Z ) = log det ( I + z Z K Z T ) f(Z)=\log\det(I+zZKZ^{\mathsf T}) f ( Z ) = log det ( I + z Z K Z T ) and R = ( I + z Z K Z T ) − 1 R=(I+zZKZ^{\mathsf T})^{-1} R = ( I + z Z K Z T ) − 1 , skew symmetry gives ∥ R − R T ∥ o p ≤ 1 \lVert R-R^{\mathsf T}\rVert_{\mathrm{op}}\le1 ∥ R − R T ∥ op ≤ 1 and ∇ Z f = z ( R − R T ) Z K \nabla_Zf=z(R-R^{\mathsf T})ZK ∇ Z f = z ( R − R T ) Z K . Consequently
∣ f ( Y ) − f ( Z ) ∣ ≤ z ∥ Z K ∥ F ∥ Y − Z ∥ F + 1 2 z k ∥ Y − Z ∥ F 2 . \lvert f(Y)-f(Z)\rvert\le z\lVert ZK\rVert_{\mathrm{F}}\lVert Y-Z\rVert_{\mathrm{F}}+\frac{1}{2}zk\lVert Y-Z\rVert_{\mathrm{F}}^2. ∣ f ( Y ) − f ( Z )∣ ≤ z ∥ Z K ∥ F ∥ Y − Z ∥ F + 2 1 z k ∥ Y − Z ∥ F 2 .
Couple γ \gamma γ to ν \nu ν and use E γ ∥ Z K ∥ F 2 = d h 2 \mathbb{E}_{\gamma}\lVert ZK\rVert_{\mathrm{F}}^2=dh^2 E γ ∥ Z K ∥ F 2 = d h 2 . Here W 2 W_2 W 2 is the quadratic Wasserstein distance and Ent \operatorname{Ent} Ent is relative entropy. The Gaussian transportation inequality W 2 ( ν , γ ) 2 ≤ 2 Ent ( ν ∣ γ ) W_2(\nu,\gamma)^2\le2\operatorname{Ent}(\nu\mid\gamma) W 2 ( ν , γ ) 2 ≤ 2 Ent ( ν ∣ γ ) [7 ] yields
∣ ν f − γ f ∣ ≤ z 2 d h 2 Ent ( ν ∣ γ ) + z k Ent ( ν ∣ γ ) . \lvert\nu f-\gamma f\rvert\le z\sqrt{2dh^2\operatorname{Ent}(\nu\mid\gamma)}+zk\operatorname{Ent}(\nu\mid\gamma). ∣ ν f − γ f ∣ ≤ z 2 d h 2 Ent ( ν ∣ γ ) + z k Ent ( ν ∣ γ ) .
The function e f e^f e f has polynomial growth, so entropy duality applies. Maximizing in Ent \sqrt{\operatorname{Ent}} Ent gives
log E γ e f − E γ f ≤ z 2 d h 2 2 ( 1 − z k ) . \log\mathbb{E}_{\gamma}e^{f-\mathbb{E}_{\gamma}f}\le\frac{z^2dh^2}{2(1-zk)}. log E γ e f − E γ f ≤ 2 ( 1 − z k ) z 2 d h 2 .
Divide by d d d and use Jensen’s inequality for the lower bound. For K ∈ S 2 K\in\mathcal{S}_2 K ∈ S 2 , spectral truncation gives L 2 L^2 L 2 convergence of the logarithms by (44) –(21) . Fatou’s lemma passes the centered exponential estimate to the limit, and Lemma 3.1 identifies its determinant expectation. □
A bounded-amplitude window
Proposition 3.6 (Uniform window estimate). Assume QC4 and let T d ∈ S 2 T_d\in\mathcal{S}_2 T d ∈ S 2 be real skew with
d ∥ T d ∥ S 2 2 ≤ E 0 , d ∥ T d ∥ o p ≤ M . (55) d\lVert T_d\rVert_{\mathcal{S}_2}^2\le E_0,\qquad d\lVert T_d\rVert_{\mathrm{op}}\le M. \tag*{(55)} d ∥ T d ∥ S 2 2 ≤ E 0 , d ∥ T d ∥ op ≤ M . (55) The temporal rank may be infinite. For each z > 0 z>0 z > 0 ,
E ∣ F d X ( T d ; z ) − V d T d ( z ) ∣ ≤ C d , E ∣ q ^ d T d ( z ) − q d T d ( z ) ∣ ≤ C d . (56) \mathbb{E}\lvert F_d^X(T_d;z)-V_d^{T_d}(z)\rvert\le\frac{C}{d},\qquad
\mathbb{E}\lvert\widehat q_d^{T_d}(z)-q_d^{T_d}(z)\rvert\le\frac{C}{\sqrt d}. \tag*{(56)} E ∣ F d X ( T d ; z ) − V d T d ( z )∣ ≤ d C , E ∣ q d T d ( z ) − q d T d ( z )∣ ≤ d C . (56) Here the deterministic quantities are formed from T d T_d T d , and C C C depends only on E 0 E_0 E 0 , M M M , κ \kappa κ , z z z , locally uniformly in log z \log z log z .
Proof. The window assumptions imply
∥ T d ∥ S 4 4 ≤ ∥ T d ∥ o p 2 ∥ T d ∥ S 2 2 ≤ M 2 E 0 d 3 , Φ d T d ( z ) ≤ z 2 E 0 2 . \lVert T_d\rVert_{\mathcal{S}_4}^4\le\lVert T_d\rVert_{\mathrm{op}}^2\lVert T_d\rVert_{\mathcal{S}_2}^2\le\frac{M^2E_0}{d^3},\qquad\Phi_d^{T_d}(z)\le\frac{z^2E_0}{2}. ∥ T d ∥ S 4 4 ≤ ∥ T d ∥ op 2 ∥ T d ∥ S 2 2 ≤ d 3 M 2 E 0 , Φ d T d ( z ) ≤ 2 z 2 E 0 .
Thus (50) is O ( d − 1 ) O(d^{-1}) O ( d − 1 ) , and (51) is O ( d − 2 ) O(d^{-2}) O ( d − 2 ) . For d > 2 z M d>2zM d > 2 z M the Gaussian gap (54) is O ( d − 1 ) O(d^{-1}) O ( d − 1 ) as well. The source bound allows Lemma 3.2 to be applied uniformly. Consequently the mean logarithmic error and the standard deviation are both O ( d − 1 ) O(d^{-1}) O ( d − 1 ) , proving the first estimate for large d d d . For the remaining bounded range, Jensen’s inequality and (38) give E F d X ≤ Φ d T d ( z ) ≤ z 2 E 0 / 2 \mathbb{E}F_d^X\le\Phi_d^{T_d}(z)\le z^2E_0/2 E F d X ≤ Φ d T d ( z ) ≤ z 2 E 0 /2 , while 0 ≤ V d T d ( z ) ≤ z 2 E 0 / 2 0\le V_d^{T_d}(z)\le z^2E_0/2 0 ≤ V d T d ( z ) ≤ z 2 E 0 /2 . Enlarging the constant therefore proves the first estimate for all d d d , uniformly on each compact log z \log z log z interval.
Set D ( u ) = E F d X ( T d ; e u ) − V d T d ( e u ) D(u)=\mathbb{E}F_d^X(T_d;e^u)-V_d^{T_d}(e^u) D ( u ) = E F d X ( T d ; e u ) − V d T d ( e u ) . The preceding bounds are locally uniform, while (43) and (40) give ∣ D ′ ′ ∣ ≤ 1 \lvert D''\rvert\le1 ∣ D ′′ ∣ ≤ 1 . A difference quotient with step d − 1 / 2 d^{-1/2} d − 1/2 yields ∣ D ′ ∣ ≤ C d − 1 / 2 \lvert D'\rvert\le Cd^{-1/2} ∣ D ′ ∣ ≤ C d − 1/2 . This bounds the mean error of the bounded response. Equation (20) bounds its centered mean absolute deviation by C 0 d − 1 / 2 C_0d^{-1/2} C 0 d − 1/2 , proving the second estimate. Small dimensions are again absorbed using ∣ q ^ d T d − q d T d ∣ ≤ 1 \lvert\widehat q_d^{T_d}-q_d^{T_d}\rvert\le1 ∣ q d T d − q d T d ∣ ≤ 1 . □
Remark (Comparison with signed Gram models). Restrict the temporal kernel to ε ≤ d λ ≤ M \varepsilon\le d\lambda\le M ε ≤ d λ ≤ M , and let p p p be the resulting temporal dimension. Write Z ∈ R d × p Z\in\mathbb{R}^{d\times p} Z ∈ R d × p for the row matrix, B = i d K B=i dK B = i d K , X = Z ∗ X=Z^* X = Z ∗ and C = X X ∗ / d C=XX^*/d C = X X ∗ / d . Then Q = Z B Z ∗ / d = i H d ( K ) Q=ZBZ^*/d=iH_d(K) Q = Z B Z ∗ / d = i H d ( K ) is Hermitian. If n − n_- n − denotes the number of strictly negative eigenvalues, the two Schur complements of
( B − 1 X / d X ∗ / d t I d ) ( t > 0 ) \begin{pmatrix}
B^{-1} & X/\sqrt d\\
X^*/\sqrt d & tI_d
\end{pmatrix}
\qquad(t>0) ( B − 1 X ∗ / d X / d t I d ) ( t > 0 )
give the exact identity
# { j : λ j ( Q ) > t } = n − ( B − 1 − C / t ) − n − ( B − 1 ) . (57) \#\{j:\lambda_j(Q)>t\}=n_-(B^{-1}-C/t)-n_-(B^{-1}). \tag*{(57)} # { j : λ j ( Q ) > t } = n − ( B − 1 − C / t ) − n − ( B − 1 ) . (57)
The first matrix on the right is B − 1 + p − 1 X T X ∗ B^{-1}+p^{-1}XTX^{*} B − 1 + p − 1 X T X ∗ with T = − p ( d t ) − 1 I d T=-p(dt)^{-1}I_d T = − p ( d t ) − 1 I d . Thus on subsequences with p / d → ρ ∈ ( 0 , ∞ ) p/d\to\rho\in(0,\infty) p / d → ρ ∈ ( 0 , ∞ ) and a limiting empirical law for B − 1 B^{-1} B − 1 , the signed Gram theorem [13 Theorem 5.15] applies. QC4 implies its weak quadratic-form concentration assumption. With the convention s ν ( z ) = ∫ ( u − z ) − 1 ν ( d u ) s_\nu(z)=\int(u-z)^{-1}\nu(du) s ν ( z ) = ∫ ( u − z ) − 1 ν ( d u ) , its limiting transform satisfies
s ( z ) = s ν ( z + ( t − ρ s ( z ) ) − 1 ) , ν = lim μ B − 1 . s(z)=s_\nu\left(z+(t-\rho s(z))^{-1}\right),\qquad\nu=\lim\mu_{B^{-1}}. s ( z ) = s ν ( z + ( t − ρ s ( z ) ) − 1 ) , ν = lim μ B − 1 .
The limit has no atom at zero: such an atom would force ∣ s ( i v ) ∣ → ∞ |s(iv)|\to\infty ∣ s ( i v ) ∣ → ∞ , whereas the right side stays bounded because ν \nu ν is supported away from zero. Thus (57) also passes to the limit. When p / d → 0 p/d\to0 p / d → 0 , the band is negligible by rank. This comparison explains the classical finite-band content. It does not perform the subsequent removal of the positive lower cutoff, retain a diffuse source atom at zero, or establish the converse tightness assertion of Theorem A.
Canonical source compactness and the moving law
Lemma 4.1 (Source compactness). For a sequence of finite positive measures η d \eta_d η d , condition (RC) is equivalent to
B 0 : = sup d η d ( [ 0 , ∞ ) ) < ∞ , lim M → ∞ sup d η d ( ( M , ∞ ) ) = 0. (58) B_0:=\sup_d\eta_d([0,\infty))<\infty,\qquad\lim_{M\to\infty}\sup_d\eta_d((M,\infty))=0. \tag*{(58)} B 0 := d sup η d ([ 0 , ∞ )) < ∞ , M → ∞ lim d sup η d (( M , ∞ )) = 0. (58) Under these conditions, sup d G η d ( t ) → 0 \sup_dG_{\eta_d}(t)\to0 sup d G η d ( t ) → 0 as t ↓ 0 t\downarrow0 t ↓ 0 . Weakly convergent source sequences have locally uniformly convergent responses on [ 0 , ∞ ) [0,\infty) [ 0 , ∞ ) .
Proof. Since G η d ( 1 ) = η d ( [ 0 , ∞ ) ) G_{\eta_d}(1)=\eta_d([0,\infty)) G η d ( 1 ) = η d ([ 0 , ∞ )) and g t ≥ min ( 1 , t 2 ) g_t\ge\min(1,t^2) g t ≥ min ( 1 , t 2 ) , (RC) bounds the total masses for all sufficiently large d d d , and hence for all d d d . For M ≥ 1 M\ge1 M ≥ 1 ,
η d ( ( M , ∞ ) ) ≤ 2 G η d ( 1 / M ) , G η d ( t ) ≤ t 2 ( 1 + M 2 ) B 0 + η d ( ( M , ∞ ) ) , 0 < t ≤ 1. \eta_d((M,\infty))\le2G_{\eta_d}(1/M),\qquad G_{\eta_d}(t)\le t^2(1+M^2)B_0+\eta_d((M,\infty)),\qquad0<t\le1. η d (( M , ∞ )) ≤ 2 G η d ( 1/ M ) , G η d ( t ) ≤ t 2 ( 1 + M 2 ) B 0 + η d (( M , ∞ )) , 0 < t ≤ 1.
The first estimate follows from g 1 / M ( x ) ≥ 1 / 2 g_{1/M}(x)\ge1/2 g 1/ M ( x ) ≥ 1/2 for x > M x>M x > M ; the second splits the integral at M M M and uses g t ≤ 1 g_t\le1 g t ≤ 1 . These prove both implications. Each finite initial family is individually tight and has responses tending to zero at zero, so the asymptotic bounds become uniform in d d d .
For fixed t > 0 t>0 t > 0 , g t g_t g t is bounded and continuous. On positive compact t t t -intervals its logarithmic derivative is uniformly bounded in x x x , since ∣ ∂ log t g t ( x ) ∣ ≤ 2 max ( 1 , t 2 ) |\partial_{\log t}g_t(x)|\le2\max(1,t^2) ∣ ∂ l o g t g t ( x ) ∣ ≤ 2 max ( 1 , t 2 ) . Weak convergence, bounded masses and a finite grid therefore give local uniform convergence away from zero; uniform small-parameter control includes zero. □
We use classical existence and prove directly the continuity and inverse properties needed below.
Lemma 4.2 (The canonical law and its inverse). The map M \mathcal{M} M in Theorem B exists and is a homeomorphism onto a weakly closed image.
Proof. For finite η \eta η , dominated convergence gives G η ( 0 + ) = 0 G_\eta(0+)=0 G η ( 0 + ) = 0 . The function q ↦ q + G η ( z q ) q\mapsto q+G_\eta(zq) q ↦ q + G η ( z q ) is strictly increasing from zero and is at least one at q = 1 q=1 q = 1 , so the root is unique. Weak source convergence implies pointwise root convergence by monotone squeezing. Also q η ( z ) → 1 q_\eta(z)\to1 q η ( z ) → 1 as z ↓ 0 z\downarrow0 z ↓ 0 .
Write C + = { w : ℑ w > 0 } \mathbb{C}_+=\{w:\Im w>0\} C + = { w : ℑ w > 0 } . Let σ \sigma σ be the symmetric extension of η \eta η , ∫ f d σ = 1 2 ∫ ( f ( x ) + f ( − x ) ) η ( d x ) \int f\,d\sigma=\frac12\int(f(x)+f(-x))\eta(dx) ∫ f d σ = 2 1 ∫ ( f ( x ) + f ( − x )) η ( d x ) . The free Lévy–Khintchine theorem [3 Theorem 3.2], [2, Theorem 1.1] gives a symmetric freely infinitely divisible law ν η \nu_\eta ν η with canonical pair ( 0 , σ ) (0,\sigma) ( 0 , σ ) and
φ ν η ( w ) = ∫ [ 0 , ∞ ) w ( 1 + x 2 ) w 2 − x 2 η ( d x ) , w ∈ C + . (59) \varphi_{\nu_\eta}(w)=\int_{[0,\infty)}\frac{w(1+x^2)}{w^2-x^2}\,\eta(dx),\qquad w\in\mathbb{C}_+. \tag*{(59)} φ ν η ( w ) = ∫ [ 0 , ∞ ) w 2 − x 2 w ( 1 + x 2 ) η ( d x ) , w ∈ C + . (59)
Put m ν ( w ) = ∫ ( w − s ) − 1 ν ( d s ) m_\nu(w)=\int(w-s)^{-1}\nu(ds) m ν ( w ) = ∫ ( w − s ) − 1 ν ( d s ) and s ~ ν = 1 / m ν \widetilde{s}_\nu=1/m_\nu s ν = 1/ m ν . The defining local inverse [3 Section 2] gives
s ~ ν ( w ) + φ ν ( s ~ ν ( w ) ) = w (60) \widetilde{s}_\nu(w)+\varphi_\nu(\widetilde{s}_\nu(w))=w \tag*{(60)} s ν ( w ) + φ ν ( s ν ( w )) = w (60)
on a sufficiently high truncated cone. For freely infinitely divisible ν \nu ν , both sides are analytic on C + \mathbb{C}_+ C + because s ~ ν ( C + ) ⊂ C + \widetilde{s}_\nu(\mathbb{C}_+)\subset\mathbb{C}_+ s ν ( C + ) ⊂ C + and φ ν \varphi_\nu φ ν extends analytically there. Thus (60) holds throughout C + \mathbb{C}_+ C + .
Let μ η \mu_\eta μ η be the image of ν η \nu_\eta ν η under absolute value and Q ( z ) = ∫ ( 1 + z 2 s 2 ) − 1 μ η ( d s ) Q(z)=\int(1+z^2s^2)^{-1}\mu_\eta(ds) Q ( z ) = ∫ ( 1 + z 2 s 2 ) − 1 μ η ( d s ) . Symmetry and (59) give
m ν η ( i / z ) = − i z Q ( z ) , φ ν η ( i / t ) = − i G η ( t ) / t . m_{\nu_\eta}(i/z)=-izQ(z),\qquad\varphi_{\nu_\eta}(i/t)=-iG_\eta(t)/t. m ν η ( i / z ) = − i z Q ( z ) , φ ν η ( i / t ) = − i G η ( t ) / t .
Equation (60) at w = i / z w=i/z w = i / z becomes Q ( z ) + G η ( z Q ( z ) ) = 1 Q(z)+G_{\eta}(zQ(z))=1 Q ( z ) + G η ( z Q ( z )) = 1 , so Q = q η Q=q_{\eta} Q = q η . Stieltjes uniqueness for the squared variable gives uniqueness of μ η \mu_{\eta} μ η . Root continuity and
ν ( [ 1 / z , ∞ ) ) ≤ 2 ( 1 − ∫ ν ( d s ) 1 + z 2 s 2 ) , z > 0 , (61) \nu([1/z,\infty))\le2\left(1-\int\frac{\nu(\mathrm{d}s)}{1+z^{2}s^{2}}\right),\qquad z>0, \tag*{(61)} ν ([ 1/ z , ∞ )) ≤ 2 ( 1 − ∫ 1 + z 2 s 2 ν ( d s ) ) , z > 0 , (61)
give tightness and identify every output cluster point along a weakly convergent source sequence. This proves continuity of M \mathcal{M} M .
For injectivity, put t = z q η ( z ) t=zq_{\eta}(z) t = z q η ( z ) . Differentiation of the root gives
d d z ( z q η ( z ) ) = q η ( z ) 2 q η ( z ) + t G η ′ ( t ) > 0. \frac{\mathrm{d}}{\mathrm{d}z}\left(zq_{\eta}(z)\right)=\frac{q_{\eta}(z)^{2}}{q_{\eta}(z)+tG_{\eta}'(t)}>0. d z d ( z q η ( z ) ) = q η ( z ) + t G η ′ ( t ) q η ( z ) 2 > 0.
Thus a common output law identifies G η ( t ) = 1 − q η ( z ) G_{\eta}(t)=1-q_{\eta}(z) G η ( t ) = 1 − q η ( z ) on a nonempty open interval. The identity
G η ( v − 1 / 2 ) = η ( [ 0 , ∞ ) ) + ( 1 − v ) ∫ η ( d x ) v + x 2 , v > 0 , (62) G_{\eta}(v^{-1/2})=\eta([0,\infty))+(1-v)\int\frac{\eta(\mathrm{d}x)}{v+x^{2}},\qquad v>0, \tag*{(62)} G η ( v − 1/2 ) = η ([ 0 , ∞ )) + ( 1 − v ) ∫ v + x 2 η ( d x ) , v > 0 , (62)
has a holomorphic right-hand side on C ∖ ( − ∞ , 0 ] \mathbb{C}\setminus(-\infty,0] C ∖ ( − ∞ , 0 ] . Analytic uniqueness extends equality to all v > 0 v>0 v > 0 . Evaluation at v = 1 v=1 v = 1 identifies total mass; Stieltjes uniqueness then identifies the pushforward under x ↦ x 2 x\mapsto x^{2} x ↦ x 2 , hence η \eta η , including its atom at zero. This also proves injectivity of η ↦ G η \eta\mapsto G_{\eta} η ↦ G η .
Finally suppose μ η n ⇒ ν \mu_{\eta_n}\Rightarrow\nu μ η n ⇒ ν for a probability measure ν \nu ν , and write q ( z ) q(z) q ( z ) for its bounded response. For small fixed z z z , eventually q η n ( z ) ≥ 1 / 2 q_{\eta_n}(z)\ge1/2 q η n ( z ) ≥ 1/2 , and hence
lim sup n G η n ( z / 2 ) ≤ lim sup n G η n ( z q η n ( z ) ) = 1 − q ( z ) . \limsup_{n}G_{\eta_n}(z/2)\le\limsup_{n}G_{\eta_n}(zq_{\eta_n}(z))=1-q(z). n lim sup G η n ( z /2 ) ≤ n lim sup G η n ( z q η n ( z )) = 1 − q ( z ) .
The right-hand side tends to zero as z ↓ 0 z\downarrow0 z ↓ 0 . Lemma 4.1 therefore makes the sources relatively compact. Continuity and injectivity identify a unique source cluster point η \eta η with ν = μ η \nu=\mu_{\eta} ν = μ η , and imply η n ⇒ η \eta_n\Rightarrow\eta η n ⇒ η . This proves inverse continuity and closedness of the image. □ \square □
Proof of the stochastic assertions in Theorem B. First assume (RC). Let K d ≤ M K_d^{\le M} K d ≤ M retain the pairs with x k , d ≤ M x_{k,d}\le M x k , d ≤ M , and put r d ( M ) = 2 # { k : x k , d > M } r_d(M)=2\#\{k:x_{k,d}>M\} r d ( M ) = 2# { k : x k , d > M } . The retained kernel satisfies
d ∥ K d ≤ M ∥ S 2 2 = ∫ [ 0 , M ] ( 1 + x 2 ) η d ( d x ) ≤ ( 1 + M 2 ) B 0 , d ∥ K d ≤ M ∥ o p ≤ M . d\lVert K_d^{\le M}\rVert_{S_2}^{2}=\int_{[0,M]}(1+x^{2})\eta_d(\mathrm{d}x)\le(1+M^{2})B_0,\qquad d\lVert K_d^{\le M}\rVert_{\mathrm{op}}\le M. d ∥ K d ≤ M ∥ S 2 2 = ∫ [ 0 , M ] ( 1 + x 2 ) η d ( d x ) ≤ ( 1 + M 2 ) B 0 , d ∥ K d ≤ M ∥ op ≤ M .
Deleting the other pairs changes the sample matrix by rank at most r d ( M ) r_d(M) r d ( M ) , so its bounded response changes by at most r d ( M ) / d r_d(M)/d r d ( M ) / d . The source responses differ by at most the same number, uniformly in their argument. Since q ↦ q + G d ( z q ) q\mapsto q+G_d(zq) q ↦ q + G d ( z q ) increases by at least the increase in q q q , the corresponding roots also differ by at most r d ( M ) / d r_d(M)/d r d ( M ) / d . Proposition 3.6 consequently gives, for fixed M ≥ 1 M\ge1 M ≥ 1 ,
E ∣ q ^ d ( z ) − q d ( z ) ∣ ≤ 2 r d ( M ) d + C B 0 , M , κ , z d ≤ 2 ( 1 + M − 2 ) η d ( ( M , ∞ ) ) + C B 0 , M , κ , z d . (63) \mathbb{E}|{\widehat q}_d(z)-q_d(z)|\le\frac{2r_d(M)}{d}+\frac{C_{B_0,M,\kappa,z}}{\sqrt d}
\le2(1+M^{-2})\eta_d((M,\infty))+\frac{C_{B_0,M,\kappa,z}}{\sqrt d}. \tag*{(63)} E ∣ q d ( z ) − q d ( z ) ∣ ≤ d 2 r d ( M ) + d C B 0 , M , κ , z ≤ 2 ( 1 + M − 2 ) η d (( M , ∞ )) + d C B 0 , M , κ , z . (63)
Take d → ∞ d\to\infty d → ∞ , then M → ∞ M\to\infty M → ∞ . No lower-amplitude truncation is made.
Resampling a row changes the full bounded response by at most 2 / d 2/d 2/ d , independently of the deleted amplitudes. The bounded-differences estimate (20) , together with the vanishing deterministic bias in (63) , upgrades this L 1 L^{1} L 1 comparison to almost-sure convergence. Apply Borel–Cantelli at a countable dense set of logarithmic parameters. The uniform derivative bounds in (43) and (40) extend convergence locally uniformly on one probability-one event. No independence across dimensions is required.
On that event the empirical laws are tight: use (61) and 1 − q d ( z ) = G d ( z q d ( z ) ) ≤ G d ( z ) 1-q_d(z)=G_d(zq_d(z))\le G_d(z) 1 − q d ( z ) = G d ( z q d ( z )) ≤ G d ( z ) , followed by Lemma 4.1. If the moving Lévy distance failed to vanish, a bad subsequence would have a further subsequence whose sources converge weakly to some η \eta η . Every sample-law cluster point then has response q η q_{\eta} q η and equals μ η \mu_{\eta} μ η , whereas source continuity gives μ η d ⇒ μ η \mu_{\eta_d}\Rightarrow\mu_{\eta} μ η d ⇒ μ η . This contradiction proves (11) . The argument applies pathwise because the source family has compact closure and the response comparison holds simultaneously at all parameters.
Relative compactness and injectivity of the source and output transforms prove the four equivalences within the tight class by the subsequence criterion. Along each source-convergent subsequence the empirical laws converge almost surely to its output; bounded convergence gives the same mean-law limit. Thus either mean-law convergence or convergence in probability identifies all source cluster points. Without a prior tightness assumption, weak convergence of the sources implies (RC); weak convergence of the mean laws implies tightness; and convergence in probability to a deterministic law implies weak convergence of the mean laws. Theorem A therefore supplies (RC) in the latter cases as well. Pointwise convergence G d ( t ) → G ( t ) G_d(t) \to G(t) G d ( t ) → G ( t ) with G ( 0 + ) = 0 G(0+) = 0 G ( 0 + ) = 0 implies (RC) directly. This proves the assertions without a prior compactness hypothesis.
Corollary 4.3 (Recovery between two arrays). For two QC4 arrays, assume tightness of the mean empirical laws for only the first array. Under arbitrary joint coupling, and without assuming separate convergence,
d B L ( η d K , η d L ) → 0 ⟺ sup 0 ≤ t ≤ T ∣ G d K ( t ) − G d L ( t ) ∣ → 0 for every T > 0 d_{\mathrm{BL}}(\eta_d^K,\eta_d^L) \to0 \Longleftrightarrow\sup_{0 \le t \le T} \left|G_d^K(t)-G_d^L(t)\right| \to0 \quad\text{for every } T>0 d BL ( η d K , η d L ) → 0 ⟺ 0 ≤ t ≤ T sup G d K ( t ) − G d L ( t ) → 0 for every T > 0 ⟺ d L ( μ d K , μ d L ) → P 0. (64) \Longleftrightarrow d_L(\mu_d^K,\mu_d^L) \xrightarrow{\mathbb{P}} 0. \tag*{(64)} ⟺ d L ( μ d K , μ d L ) P 0. (64) Each condition forces tightness of the second array, and the last distance then tends to zero almost surely.
Proof. For two arrays, first assume only that the first mean-law sequence is tight. Each condition in (64) forces tightness of the second. For source-measure distance, total masses differ by at most d B L d_{\mathrm{BL}} d BL , and the one-Lipschitz cutoff f M ( x ) = min { 1 , ( x − M ) + } f_M(x)=\min\{1,(x-M)_+\} f M ( x ) = min { 1 , ( x − M ) + } gives
η d L ( ( M + 1 , ∞ ) ) ≤ η d K ( ( M , ∞ ) ) + d B L ( η d K , η d L ) . \eta_d^L((M+1,\infty)) \le\eta_d^K((M,\infty)) + d_{\mathrm{BL}}(\eta_d^K,\eta_d^L). η d L (( M + 1 , ∞ )) ≤ η d K (( M , ∞ )) + d BL ( η d K , η d L ) .
Lemma 4.1 then transfers (RC) to the second source sequence. Locally uniform response comparison transfers (RC) directly. Finally, on the event d L ( μ d K , μ d L ) < δ d_L(\mu_d^K,\mu_d^L)<\delta d L ( μ d K , μ d L ) < δ ,
μ d L ( ( R + δ , ∞ ) ) ≤ μ d K ( ( R , ∞ ) ) + δ . \mu_d^L((R+\delta,\infty)) \le\mu_d^K((R,\infty))+\delta. μ d L (( R + δ , ∞ )) ≤ μ d K (( R , ∞ )) + δ .
If the random distance tends to zero in probability, take expectations and then lim sup d → ∞ \limsup_{d\to\infty} lim sup d → ∞ , R → ∞ R\to\infty R → ∞ and δ ↓ 0 \delta\downarrow0 δ ↓ 0 . This proves tightness of the second mean-law sequence; Theorem A again gives (RC).
Both source families now have a common compact closure. Joint convergent subsequences and the injective continuous maps η ↦ G η \eta\mapsto G_\eta η ↦ G η and η ↦ μ η \eta\mapsto\mu_\eta η ↦ μ η show that source distance tends to zero if and only if the response differences vanish locally uniformly, and if and only if deterministic output distance tends to zero. The triangle inequality and the two almost-sure moving approximations convert this last condition to almost-sure vanishing of the random distance. Conversely, vanishing random distance in probability forces the deterministic distance to vanish by the same triangle inequality. This proves (64) under arbitrary coupling.
:::
Logarithmic statistics
The bounded theory uses all finite canonical measures. Logarithmic statistics are controlled under an additional upper-amplitude integrability condition. For a finite source measure define
ℓ t ( x ) = 1 + x 2 2 x 2 log ( 1 + t 2 x 2 ) ( x > 0 ) , ℓ t ( 0 ) = t 2 / 2 , Φ η ( t ) = ∫ ℓ t d η . \ell_t(x)=\frac{1+x^2}{2x^2}\log(1+t^2x^2)\quad(x>0),\qquad\ell_t(0)=t^2/2,\qquad\Phi_\eta(t)=\int\ell_t\,d\eta. ℓ t ( x ) = 2 x 2 1 + x 2 log ( 1 + t 2 x 2 ) ( x > 0 ) , ℓ t ( 0 ) = t 2 /2 , Φ η ( t ) = ∫ ℓ t d η .
Whenever Φ η ( 1 ) < ∞ \Phi_\eta(1)<\infty Φ η ( 1 ) < ∞ , this potential is finite for every t > 0 t>0 t > 0 , satisfies t Φ η ′ ( t ) = G η ( t ) t\Phi_\eta'(t)=G_\eta(t) t Φ η ′ ( t ) = G η ( t ) , and tends to zero at zero. Define V η V_\eta V η by the minimum in (16) , with Φ η \Phi_\eta Φ η in place of Φ d \Phi_d Φ d .
Theorem 5.1 (Logarithmic extension). Assume QC4, (RC), and (LI). Then
E ∣ F d ( z ) − V d ( z ) ∣ ⟶ 0 ( z > 0 ) , (65) \mathbb{E}|F_d(z)-V_d(z)|\longrightarrow0\qquad(z>0), \tag*{(65)} E ∣ F d ( z ) − V d ( z ) ∣ ⟶ 0 ( z > 0 ) , (65) locally uniformly in log z \log z log z . Along any subsequence with η d ⇒ η \eta_d\Rightarrow\eta η d ⇒ η , one has Φ η ( 1 ) < ∞ \Phi_\eta(1)<\infty Φ η ( 1 ) < ∞ and
Φ d ⟶ Φ η locally uniformly on [ 0 , ∞ ) , V d ( z ) ⟶ V η ( z ) , F d ( z ) ⟶ V η ( z ) in L 1 . \Phi_d\longrightarrow\Phi_\eta\quad\text{locally uniformly on }[0,\infty),\qquad V_d(z)\longrightarrow V_\eta(z),\qquad F_d(z)\longrightarrow V_\eta(z)\quad\text{in }L^1. Φ d ⟶ Φ η locally uniformly on [ 0 , ∞ ) , V d ( z ) ⟶ V η ( z ) , F d ( z ) ⟶ V η ( z ) in L 1 .
The limiting potential satisfies
V η ( z ) = 1 2 ∫ log ( 1 + z 2 s 2 ) μ η ( d s ) . (66) V_{\eta}(z)=\frac{1}{2}\int\log(1+z^{2}s^{2})\mu_{\eta}(\mathrm{d}s). \tag*{(66)} V η ( z ) = 2 1 ∫ log ( 1 + z 2 s 2 ) μ η ( d s ) . (66)
Under these hypotheses, source convergence is also equivalent to finite convergence of Φ d ( t ) \Phi_d(t) Φ d ( t ) for every t > 0 t>0 t > 0 .
Proof. The upper-amplitude condition is lim M → ∞ lim sup d ∫ ( M , ∞ ) ℓ 1 d η d = 0 \lim_{M\to\infty}\limsup_d\int_{(M,\infty)}\ell_1\,\mathrm{d}\eta_d=0 lim M → ∞ lim sup d ∫ ( M , ∞ ) ℓ 1 d η d = 0 . For 0 ≤ t ≤ T 0\le t\le T 0 ≤ t ≤ T , ℓ t ≤ max ( 1 , T 2 ) ℓ 1 \ell_t\le\max(1,T^2)\ell_1 ℓ t ≤ max ( 1 , T 2 ) ℓ 1 . On bounded x x x -intervals the functions ℓ t ( x ) \ell_t(x) ℓ t ( x ) are continuous, including at zero. Cutoffs, weak convergence and the preceding uniform integrability therefore imply convergence of Φ d ( t ) \Phi_d(t) Φ d ( t ) to Φ η ( t ) \Phi_\eta(t) Φ η ( t ) , with a finite limit. The same argument controls small t t t uniformly: first discard x > M x>M x > M , then use ℓ t ( x ) ≤ t 2 ( 1 + M 2 ) / 2 \ell_t(x)\le t^2(1+M^2)/2 ℓ t ( x ) ≤ t 2 ( 1 + M 2 ) /2 on [ 0 , M ] [0,M] [ 0 , M ] . A finite parameter grid proves local uniform convergence on [ 0 , ∞ ) [0,\infty) [ 0 , ∞ ) . The minimizing roots converge by Theorem B; substitution in the objective gives convergence of V d V_d V d .
For the stochastic comparison retain only pairs with x k , d ≤ M x_{k,d}\le M x k , d ≤ M , as in the proof of Theorem B. Write Φ d > M \Phi_d^{>M} Φ d > M for the discarded potential and r d ( M ) r_d(M) r d ( M ) for its full rank. The window estimate and (46) give
E ∣ F d − V d ∣ ≤ C M d + 2 Φ d > M ( z ) + r d ( M ) log 2 2 d . \mathbb{E}|F_d-V_d|\le\frac{C_M}{d}+2\Phi_d^{>M}(z)+\frac{r_d(M)\log2}{2d}. E ∣ F d − V d ∣ ≤ d C M + 2 Φ d > M ( z ) + 2 d r d ( M ) log 2 .
Indeed 0 ≤ V d − V d ≤ M ≤ Φ d > M ( z ) 0\le V_d-V_d^{\le M}\le\Phi_d^{>M}(z) 0 ≤ V d − V d ≤ M ≤ Φ d > M ( z ) , by testing the full objective at the truncated minimizer, which is at most one. The last two terms vanish after d → ∞ d\to\infty d → ∞ and M → ∞ M\to\infty M → ∞ by (LI) and source tightness. This proves (65) . The one-Lipschitz bounds in log z \log z log z for F d F_d F d and V d V_d V d give its local uniform form.
The deterministic derivative identity gives z V η ′ ( z ) = 1 − q η ( z ) zV_\eta'(z)=1-q_\eta(z) z V η ′ ( z ) = 1 − q η ( z ) and V η ( 0 + ) = 0 V_\eta(0+)=0 V η ( 0 + ) = 0 . The bounded-transform identity and Tonelli’s theorem yield
∫ 0 z 1 − q η ( t ) t d t = 1 2 ∫ log ( 1 + z 2 s 2 ) μ η ( d s ) , \int_0^z\frac{1-q_\eta(t)}{t}\,\mathrm{d}t=\frac{1}{2}\int\log(1+z^2s^2)\mu_\eta(\mathrm{d}s), ∫ 0 z t 1 − q η ( t ) d t = 2 1 ∫ log ( 1 + z 2 s 2 ) μ η ( d s ) ,
proving (66) , including finiteness. Finally, source compactness reduces convergence of all Φ d ( t ) \Phi_d(t) Φ d ( t ) to uniqueness of cluster sources. Equal limiting potentials have equal derivatives t Φ η ′ ( t ) = G η ( t ) t\Phi_\eta'(t)=G_\eta(t) t Φ η ′ ( t ) = G η ( t ) , and hence equal sources by Lemma 4.2 . □
Dilation coherence and response homogeneity
For a finite source measure η \eta η and r > 0 r>0 r > 0 , define
η [ r ] ( B ) = ∫ 1 B ( r x ) r ( 1 + x 2 ) 1 + r 2 x 2 η ( d x ) . \eta^{[r]}(B)=\int\mathbf{1}_B(rx)\frac{r(1+x^2)}{1+r^2x^2}\,\eta(\mathrm{d}x). η [ r ] ( B ) = ∫ 1 B ( r x ) 1 + r 2 x 2 r ( 1 + x 2 ) η ( d x ) .
This is again a finite positive measure, and
G η [ r ] ( t ) = r − 1 G η ( r t ) , η [ r ] ( { 0 } ) = r η ( { 0 } ) . (67) G_{\eta^{[r]}}(t)=r^{-1}G_\eta(rt),\qquad\eta^{[r]}(\{0\})=r\eta(\{0\}). \tag*{(67)} G η [ r ] ( t ) = r − 1 G η ( r t ) , η [ r ] ({ 0 }) = r η ({ 0 }) . (67)
The function G η G_\eta G η is real analytic on ( 0 , ∞ ) (0,\infty) ( 0 , ∞ ) : its Stieltjes representation (62) is holomorphic off ( − ∞ , 0 ] (-\infty,0] ( − ∞ , 0 ] . This includes an atom at zero, whose contribution to G η ( t ) G_\eta(t) G η ( t ) is η ( { 0 } ) t 2 \eta(\{0\})t^2 η ({ 0 }) t 2 . Analytic uniqueness will identify the same degree-one homogeneity from either scalar observation.
Lemma 6.1 (A bounded response detects source mass). Assume QC4. If η d ( [ 0 , ∞ ) ) → ∞ \eta_d([0,\infty))\to\infty η d ([ 0 , ∞ )) → ∞ , then q ^ d ( z ) → 0 \widehat{q}_d(z)\to0 q d ( z ) → 0 almost surely and in L 1 L^1 L 1 for every z > 0 z>0 z > 0 . Consequently,
lim inf d E q ^ d ( z 0 ) > 0 ⟹ sup d η d ( [ 0 , ∞ ) ) < ∞ . (68) \liminf_d\mathbb{E}\widehat{q}_d(z_0)>0\quad\Longrightarrow\quad\sup_d\eta_d([0,\infty))<\infty. \tag*{(68)} d lim inf E q d ( z 0 ) > 0 ⟹ d sup η d ([ 0 , ∞ )) < ∞. (68) No source-compactness assumption is required.
Proof. Fix z > 0 z>0 z > 0 and write m d = η d ( [ 0 , ∞ ) ) = G d ( 1 ) m_d=\eta_d([0,\infty))=G_d(1) m d = η d ([ 0 , ∞ )) = G d ( 1 ) . We may assume m d > 0 m_d>0 m d > 0 . For S = K d ∗ K d S=K_d^*K_d S = K d ∗ K d , set
C = S ( I + d 2 S ) − 1 , L = tr C = m d / d . C=S(I+d^2S)^{-1},\qquad L=\operatorname{tr}C=m_d/d. C = S ( I + d 2 S ) − 1 , L = tr C = m d / d .
Then 0 ⪯ C ⪯ S 0\preceq C\preceq S 0 ⪯ C ⪯ S , ∥ C ∥ o p ≤ d − 2 \lVert C\rVert_\mathrm{op}\le d^{-2} ∥ C ∥ op ≤ d − 2 and tr C 2 ≤ L / d 2 \operatorname{tr}C^2\le L/d^2 tr C 2 ≤ L / d 2 . Delete row and column i i i of H d H_d H d , obtaining B i B_i B i , and put
D i = ( I + z 2 B i ∗ B i ) − 1 , V i = ( K d X j ) j ≠ i , M i = z 2 V i D i V i ∗ . D_i=(I+z^2B_i^*B_i)^{-1},\qquad V_i=(K_dX_j)_{j\ne i},\qquad M_i=z^2V_iD_iV_i^*. D i = ( I + z 2 B i ∗ B i ) − 1 , V i = ( K d X j ) j = i , M i = z 2 V i D i V i ∗ .
The Schur complement gives R i i : = [ ( I + z H d ) − 1 ] i i = ( 1 + ⟨ X i , M i X i ⟩ ) − 1 R_{ii}:=[(I+zH_d)^{-1}]_{ii}=(1+\langle X_i,M_iX_i\rangle)^{-1} R ii := [( I + z H d ) − 1 ] ii = ( 1 + ⟨ X i , M i X i ⟩ ) − 1 and q ^ d ( z ) = d − 1 ∑ i R i i \widehat q_d(z)=d^{-1}\sum_iR_{ii} q d ( z ) = d − 1 ∑ i R ii . The rank inequality applied to the minor with an added zero coordinate gives ∣ tr D i − d q ^ d ( z ) ∣ ≤ 3 |\operatorname{tr}D_i-d\widehat q_d(z)|\le3 ∣ tr D i − d q d ( z ) ∣ ≤ 3 .
Let A i A_i A i be the Gram matrix of ( C 1 / 2 X j ) j ≠ i (C^{1/2}X_j)_{j\ne i} ( C 1/2 X j ) j = i , and let h i h_i h i count its eigenvalues below L / 2 L/2 L /2 . With p = d − 1 p=d-1 p = d − 1 ,
E ∥ A i − L I p ∥ F 2 ≤ p ( p − 1 + κ ) L / d 2 . \mathbb{E}\lVert A_i-LI_p\rVert_F^2\le p(p-1+\kappa)L/d^2. E ∥ A i − L I p ∥ F 2 ≤ p ( p − 1 + κ ) L / d 2 .
Fix 0 < δ ≤ 1 0<\delta\le1 0 < δ ≤ 1 and d ≥ 16 / δ d\ge16/\delta d ≥ 16/ δ . Markov’s inequality yields
P { h i > δ d / 8 } ≤ 32 ( 1 + κ / d ) δ m d . \mathbb{P}\{h_i>\delta d/8\}\le\frac{32(1+\kappa/d)}{\delta m_d}. P { h i > δ d /8 } ≤ δ m d 32 ( 1 + κ / d ) .
On the complementary event, V i ∗ V i ⪰ A i ⪰ ( L / 2 ) P i V_i^*V_i\succeq A_i\succeq(L/2)P_i V i ∗ V i ⪰ A i ⪰ ( L /2 ) P i , where P i P_i P i has codimension at most δ d / 8 \delta d/8 δ d /8 . If also tr D i ≥ δ d / 2 \operatorname{tr}D_i\ge\delta d/2 tr D i ≥ δ d /2 , then at least δ d / 4 \delta d/4 δ d /4 eigenvalues of D i D_i D i are at least δ / 4 \delta/4 δ /4 . A rank perturbation therefore shows that M i M_i M i has at least k = ⌊ δ d / 8 ⌋ ≥ δ d / 16 k=\lfloor\delta d/8\rfloor\ge\delta d/16 k = ⌊ δ d /8 ⌋ ≥ δ d /16 eigenvalues at least b = z 2 L δ / 8 b=z^2L\delta/8 b = z 2 L δ /8 . Their rank-k k k spectral projection depends only on the other rows. Write E i E_i E i for expectation over X i X_i X i conditional on all other rows. Conditional QC4 and Chebyshev’s inequality then give
E i R i i ≤ 4 κ k + ( 1 + b k / 2 ) − 1 ≤ 64 κ δ d + ( 1 + z 2 δ 2 m d / 256 ) − 1 . E_iR_{ii}\le\frac{4\kappa}{k}+(1+bk/2)^{-1}\le\frac{64\kappa}{\delta d}+(1+z^2\delta^2m_d/256)^{-1}. E i R ii ≤ k 4 κ + ( 1 + bk /2 ) − 1 ≤ δ d 64 κ + ( 1 + z 2 δ 2 m d /256 ) − 1 .
Here this conditional estimate is used only on the preceding events, which depend on rows other than i i i ; the cylindrical evaluations on the random projection are justified as in Lemma 2.2 . Since q ^ d ( z ) ≥ δ \widehat q_d(z)\ge\delta q d ( z ) ≥ δ implies tr D i ≥ δ d / 2 \operatorname{tr}D_i\ge\delta d/2 tr D i ≥ δ d /2 , we first use the unconditional bound
E q ^ d ( z ) ≤ δ + 1 d ∑ i E [ R i i 1 { tr D i ≥ δ d / 2 } ] . \mathbb{E}\widehat q_d(z)\le\delta+\frac{1}{d}\sum_i\mathbb{E}[R_{ii}\mathbf{1}_{\{\operatorname{tr}D_i\ge\delta d/2\}}]. E q d ( z ) ≤ δ + d 1 i ∑ E [ R ii 1 { tr D i ≥ δ d /2 } ] .
For each summand, discard the bad Gram event and condition only on rows other than i i i . The preceding estimates then give
E q ^ d ( z ) ≤ δ + 32 ( 1 + κ / d ) δ m d + 64 κ δ d + ( 1 + z 2 δ 2 m d / 256 ) − 1 . \mathbb{E}\widehat q_d(z)\le\delta+\frac{32(1+\kappa/d)}{\delta m_d}+\frac{64\kappa}{\delta d}+(1+z^2\delta^2m_d/256)^{-1}. E q d ( z ) ≤ δ + δ m d 32 ( 1 + κ / d ) + δ d 64 κ + ( 1 + z 2 δ 2 m d /256 ) − 1 .
If m d → ∞ m_d\to\infty m d → ∞ , first let d → ∞ d\to\infty d → ∞ and then δ ↓ 0 \delta\downarrow0 δ ↓ 0 . Row-replacement concentration gives almost-sure convergence, simultaneously for all z > 0 z>0 z > 0 by a countable dense set and monotonicity. Applying this argument to any subsequence on which m d → ∞ m_d\to\infty m d → ∞ proves (68) . □
Proof of Theorem D. Automatic compactness. Convergence of the empirical laws in probability to a deterministic probability measure implies convergence, hence tightness, of their mean laws. A finite logarithmic limit also forces mean tightness, without a moment bound on F d ( z 0 ) F_d(z_0) F d ( z 0 ) . Indeed,
μ d ( ( R , ∞ ) ) ≤ min { 1 , 2 F d ( z 0 ) log ( 1 + z 0 2 R 2 ) } . (69) \mu_d((R,\infty))\le\min\left\{1,\frac{2F_d(z_0)}{\log(1+z_0^2R^2)}\right\}. \tag*{(69)} μ d (( R , ∞ )) ≤ min { 1 , log ( 1 + z 0 2 R 2 ) 2 F d ( z 0 ) } . (69)
If F d ( z 0 ) F_d(z_0) F d ( z 0 ) is bounded in probability, its expected tail fraction is at most
P { F d ( z 0 ) > M } + 2 M log ( 1 + z 0 2 R 2 ) . \mathbb{P}\{F_d(z_0)>M\}+\frac{2M}{\log(1+z_0^2R^2)}. P { F d ( z 0 ) > M } + log ( 1 + z 0 2 R 2 ) 2 M .
First choose M M M , uniformly in d d d , and then R R R . In both cases Theorem A gives (RC).
Spectral convergence and homogeneity. Under (i), the preceding argument and Theorem B give a unique source limit η \eta η . Coherence implies G η ( r j t ) = r j G η ( t ) G_\eta(r_jt)=r_jG_\eta(t) G η ( r j t ) = r j G η ( t ) for every j , t > 0 j,t>0 j , t > 0 . Fix one t > 0 t>0 t > 0 . Real-analytic uniqueness in r r r gives G η ( u ) = b u G_\eta(u)=bu G η ( u ) = b u for all u > 0 u>0 u > 0 , proving (ii). Conversely, (ii) itself implies (RC), because lim sup d G d ( t ) = b t → 0 \limsup_dG_d(t)=bt\to0 lim sup d G d ( t ) = b t → 0 as t ↓ 0 t\downarrow0 t ↓ 0 . Direct integration and source injectivity identify the unique limit
η b ( d x ) = 2 b π ( 1 + x 2 ) d x , G η b ( t ) = b t . \eta_b(dx)=\frac{2b}{\pi(1+x^2)}\,dx,\qquad G_{\eta_b}(t)=bt. η b ( d x ) = π ( 1 + x 2 ) 2 b d x , G η b ( t ) = b t .
Its root is ( 1 + b z ) − 1 (1+bz)^{-1} ( 1 + b z ) − 1 , the bounded response of H C b HC_b H C b . Theorem B proves (i), (19) , and the bounded-response conclusions.
The bounded scalar criterion. If the scalar limit is positive and coherence includes σ = r j < 1 \sigma=r_j<1 σ = r j < 1 , Lemma 6.1 gives B : = sup d G d ( 1 ) < ∞ B:=\sup_dG_d(1)<\infty B := sup d G d ( 1 ) < ∞ . Iterate (DC) along the actual indices d k + 1 = ⌊ σ d k ⌋ d_{k+1}=\lfloor\sigma d_k\rfloor d k + 1 = ⌊ σ d k ⌋ , d 0 = d d_0=d d 0 = d . For every fixed k k k , this gives G d k ( 1 ) − σ − k G d ( σ k ) → 0 G_{d_k}(1)-\sigma^{-k}G_d(\sigma^k)\to0 G d k ( 1 ) − σ − k G d ( σ k ) → 0 , hence lim sup d G d ( σ k ) ≤ B σ k \limsup_dG_d(\sigma^k)\le B\sigma^k lim sup d G d ( σ k ) ≤ B σ k . Monotonicity and then k → ∞ k \to\infty k → ∞ prove (RC). Thus both versions of this criterion reduce to the compact case.
Assume (RC) and q ^ d ( z 0 ) → q 0 \widehat{q}_d(z_0) \to q_0 q d ( z 0 ) → q 0 in probability. The moving equivalent gives q d ( z 0 ) → q 0 q_d(z_0) \to q_0 q d ( z 0 ) → q 0 . Source compactness and continuity of the roots imply q 0 > 0 q_0 > 0 q 0 > 0 . From any subsequence choose a further one with η d ⇒ η \eta_d \Rightarrow\eta η d ⇒ η . Coherence, compactness and injectivity identify the source limit at dimensions ⌊ r j d ⌋ \lfloor r_jd \rfloor ⌊ r j d ⌋ as η [ r j ] \eta^{[r_j]} η [ r j ] . The same scalar limit holds there, so
G η ( r j z 0 q 0 ) = r j ( 1 − q 0 ) for every j . (70) G_\eta(r_jz_0q_0) = r_j(1-q_0) \qquad\text{for every } j. \tag*{(70)} G η ( r j z 0 q 0 ) = r j ( 1 − q 0 ) for every j . (70)
The distinct arguments accumulate at z 0 q 0 > 0 z_0q_0 > 0 z 0 q 0 > 0 . Analytic uniqueness gives G η ( t ) = b t G_\eta(t) = bt G η ( t ) = b t with b = ( 1 − q 0 ) / ( z 0 q 0 ) b = (1-q_0)/(z_0q_0) b = ( 1 − q 0 ) / ( z 0 q 0 ) . Every source cluster point is therefore η b \eta_b η b , proving (ii). Its converse was proved above.
The logarithmic scalar criterion. Assume (LI) and F d ( z 0 ) → L < ∞ F_d(z_0) \to L < \infty F d ( z 0 ) → L < ∞ in probability. The first paragraph supplies (RC). Theorem 5.1 now gives V d ( z 0 ) → L V_d(z_0) \to L V d ( z 0 ) → L and logarithmic source continuity along every source-convergent subsequence, including its dilated dimensions. For a source cluster measure η \eta η , the finite potential satisfies
t Φ η ′ ( t ) = G η ( t ) , Φ η ( 0 + ) = 0 , Φ η [ r ] ( t ) = r − 1 Φ η ( r t ) . t\Phi_\eta'(t) = G_\eta(t), \qquad\Phi_\eta(0+) = 0, \qquad\Phi_{\eta^{[r]}}(t) = r^{-1}\Phi_\eta(rt). t Φ η ′ ( t ) = G η ( t ) , Φ η ( 0 + ) = 0 , Φ η [ r ] ( t ) = r − 1 Φ η ( r t ) .
The last identity also holds at the zero atom: its potential contribution is η ( { 0 } ) t 2 / 2 \eta(\{0\})t^2/2 η ({ 0 }) t 2 /2 . Put h ( r ) = V η [ r ] ( z 0 ) h(r) = V_{\eta^{[r]}}(z_0) h ( r ) = V η [ r ] ( z 0 ) . Coherence and logarithmic continuity give h ( r j ) = L h(r_j) = L h ( r j ) = L . With w = r q w = rq w = r q , the scalar variational formula becomes
J ( r ) : = r h ( r ) = min w > 0 { w − r log ( w / r ) − r + Φ η ( z 0 w ) } , w r + G η ( z 0 w r ) = r , J ′ ( r ) = log ( r / w r ) . (71) \begin{aligned}
J(r) &:= rh(r) = \min_{w>0}\{w-r\log(w/r)-r+\Phi_\eta(z_0w)\},\\
w_r+G_\eta(z_0w_r) &= r, \qquad J'(r)=\log(r/w_r). \tag*{(71)}
\end{aligned} J ( r ) w r + G η ( z 0 w r ) := r h ( r ) = w > 0 min { w − r log ( w / r ) − r + Φ η ( z 0 w )} , = r , J ′ ( r ) = log ( r / w r ) . (71)
The derivative of w ↦ w + G η ( z 0 w ) w \mapsto w+G_\eta(z_0w) w ↦ w + G η ( z 0 w ) is at least one. Since G η G_\eta G η and Φ η \Phi_\eta Φ η are real analytic for positive arguments, analytic implicit inversion makes w r w_r w r and h ( r ) h(r) h ( r ) real analytic. Thus h ( r j ) = L h(r_j) = L h ( r j ) = L forces h ≡ L h \equiv L h ≡ L . The envelope identity yields w r = r e − L w_r = re^{-L} w r = r e − L and
G η ( t ) = e L − 1 z 0 t ( t > 0 ) . G_\eta(t) = \frac{e^L-1}{z_0}t \qquad(t>0). G η ( t ) = z 0 e L − 1 t ( t > 0 ) .
All cluster sources coincide, proving (ii). Conversely, (ii) supplies (RC); together with (LI), Theorem 5.1 gives Φ d ( t ) → b t \Phi_d(t) \to bt Φ d ( t ) → b t , V d ( z ) → log ( 1 + b z ) V_d(z) \to\log(1+bz) V d ( z ) → log ( 1 + b z ) and the asserted L 1 L^1 L 1 logarithmic convergence.
For one fixed kernel the exact identity is
G n ( t ) = d n G d ( n d t ) . (72) G_n(t)=\frac{d}{n}G_d\left(\frac{n}{d}t\right). \tag*{(72)} G n ( t ) = n d G d ( d n t ) . (72)
Once (RC) is available, local uniform response continuity permits n = ⌊ r d ⌋ n=\lfloor rd\rfloor n = ⌊ r d ⌋ and gives (DC). Thus the fixed-kernel criterion uses the same homogeneity principle. The diffuse example in § 8 shows why rank-profile convergence alone cannot replace the full-response condition.
Fixed kernels
Proof of Theorem C. Corollary 2.4 proves the tightness and zero-law assertions. A probability-law limit, or a finite logarithmic limit by (69) , forces tight mean empirical laws and hence A K : = sup k k λ k ( K ) < ∞ A_K := \sup_k k\lambda_k(K) < \infty A K := sup k k λ k ( K ) < ∞ . Suppose instead that q ^ d ( z 0 ) → q 0 > 0 \widehat{q}_d(z_0) \to q_0 > 0 q d ( z 0 ) → q 0 > 0 in probability. Since 0 ≤ q ^ d ( z 0 ) ≤ 1 0 \leq\widehat{q}_d(z_0) \leq1 0 ≤ q d ( z 0 ) ≤ 1 , convergence in probability also gives E q ^ d ( z 0 ) → q 0 \mathbb{E}\widehat{q}_d(z_0) \to q_0 E q d ( z 0 ) → q 0 . Lemma 6.1 therefore gives B : = sup d G d ( 1 ) < ∞ B := \sup_d G_d(1) < \infty B := sup d G d ( 1 ) < ∞ . For 0 < λ k ≤ 1 0 < \lambda_k \leq1 0 < λ k ≤ 1 , choose d = ⌊ 1 / λ k ⌋ d=\lfloor1/\lambda_k\rfloor d = ⌊ 1/ λ k ⌋ . The first k k k skew pairs then give G d ( 1 ) ≥ k / d ≥ k λ k / 2 G_d(1) \geq k/d \geq k\lambda_k/2 G d ( 1 ) ≥ k / d ≥ k λ k /2 . The finitely many larger coefficients cause no difficulty, so again A K < ∞ A_K < \infty A K < ∞ .
The bound λ k ≤ A K / k \lambda_k \leq A_K/k λ k ≤ A K / k gives G d ( t ) ≤ π A K t G_d(t) \leq\pi A_Kt G d ( t ) ≤ π A K t and
1 d ∑ d λ k > M log ( 1 + d 2 λ k 2 ) ≤ ∫ 0 A K / M log ( 1 + A K 2 / x 2 ) d x → 0. \frac{1}{d}\sum_{d\lambda_k>M}\log(1+d^2\lambda_k^2)
\leq\int_0^{A_K/M}\log(1+A_K^2/x^2)\,dx \to0. d 1 d λ k > M ∑ log ( 1 + d 2 λ k 2 ) ≤ ∫ 0 A K / M log ( 1 + A K 2 / x 2 ) d x → 0.
Thus RC and LI hold. The exact identity (72) gives DC, and Theorem D implies η d ⇒ 2 c ( 1 + x 2 ) − 1 d x \eta_d \Rightarrow2c(1+x^2)^{-1}\,dx η d ⇒ 2 c ( 1 + x 2 ) − 1 d x for some c ≥ 0 c \ge0 c ≥ 0 . For each y > 0 y>0 y > 0 , weak source convergence yields
1 d # { k : d λ k > y } = 1 2 ∫ ( y , ∞ ) 1 + x 2 x 2 η d ( d x ) ⟶ c y . \frac{1}{d}\#\{k:d\lambda_k>y\}=\frac{1}{2}\int_{(y,\infty)}\frac{1+x^2}{x^2}\,\eta_d(dx)\longrightarrow\frac{c}{y}. d 1 # { k : d λ k > y } = 2 1 ∫ ( y , ∞ ) x 2 1 + x 2 η d ( d x ) ⟶ y c .
The test function, extended by zero on [ 0 , y ] [0,y] [ 0 , y ] , is bounded and continuous except at y y y , where the limiting source has no atom. Taking y > c y>c y > c and 0 < y < c 0<y<c 0 < y < c gives d λ d → c d\lambda_d\to c d λ d → c ; for c = 0 c=0 c = 0 only the first inequality is needed. The scalar limits identify c = ( e L − 1 ) / ( π z 0 ) = ( q 0 − 1 − 1 ) / ( π z 0 ) c=(e^L-1)/(\pi z_0)=(q_0^{-1}-1)/(\pi z_0) c = ( e L − 1 ) / ( π z 0 ) = ( q 0 − 1 − 1 ) / ( π z 0 ) .
Conversely, k λ k → c k\lambda_k\to c k λ k → c gives a common weak-trace bound. Dominated convergence in
G d ( t ) = 2 ∫ 0 ∞ t 2 [ d λ ⌈ d x ⌉ ] 2 1 + t 2 [ d λ ⌈ d x ⌉ ] 2 d x G_d(t)=2\int_0^\infty\frac{t^2[d\lambda_{\lceil dx\rceil}]^2}{1+t^2[d\lambda_{\lceil dx\rceil}]^2}\,dx G d ( t ) = 2 ∫ 0 ∞ 1 + t 2 [ d λ ⌈ d x ⌉ ] 2 t 2 [ d λ ⌈ d x ⌉ ] 2 d x
gives G d ( t ) → π c t G_d(t)\to\pi ct G d ( t ) → π c t . Theorem B yields the almost-sure half-Cauchy limit and all bounded-response limits. Theorem 5.1 identifies the limiting logarithmic potential, and Proposition A.1 gives almost-sure and L 1 L^1 L 1 convergence of the sample logarithms. The one-Lipschitz bound in log z \log z log z gives the asserted local uniformity. □
Temporal approximation of Brownian area
Arbitrary deterministic time partitions
7.1. Arbitrary deterministic time partitions. Fix T > 0 T>0 T > 0 and put b = T / 2 b=T/2 b = T /2 . For each d d d , let π d \pi_d π d be a finite deterministic partition 0 = t 0 , d < t 1 , d < ⋯ < t N d , d = T 0=t_{0,d}<t_{1,d}<\cdots<t_{N_d,d}=T 0 = t 0 , d < t 1 , d < ⋯ < t N d , d = T , with cell lengths h j , d = t j , d − t j − 1 , d h_{j,d}=t_{j,d}-t_{j-1,d} h j , d = t j , d − t j − 1 , d . Set p j , d = h j , d / T p_{j,d}=h_{j,d}/T p j , d = h j , d / T and
K π d = 1 2 D h J N d D h , ( J N ) j ℓ = sgn ( ℓ − j ) , L d = ∑ j p j , d min { 1 , d p j , d } . K_{\pi_d}=\frac{1}{2}D_{\sqrt{h}}J_{N_d}D_{\sqrt{h}},\qquad(J_N)_{j\ell}=\operatorname{sgn}(\ell-j),\qquad L_d=\sum_j p_{j,d}\min\{1,dp_{j,d}\}. K π d = 2 1 D h J N d D h , ( J N ) j ℓ = sgn ( ℓ − j ) , L d = j ∑ p j , d min { 1 , d p j , d } .
Here D h = diag ( h 1 , d , … , h N d , d ) D_{\sqrt{h}}=\operatorname{diag}(\sqrt{h_{1,d}},\ldots,\sqrt{h_{N_d,d}}) D h = diag ( h 1 , d , … , h N d , d ) . For independent Brownian coordinates, let A i k d = 1 2 ∫ 0 T ( B i d B k − B k d B i ) A^d_{ik}=\frac{1}{2}\int_0^T(B^i\,dB^k-B^k\,dB^i) A ik d = 2 1 ∫ 0 T ( B i d B k − B k d B i ) . Its temporal kernel on L 2 ( 0 , T ) L^2(0,T) L 2 ( 0 , T ) is S ( s , t ) = 1 2 sgn ( t − s ) S(s,t)=\frac{1}{2}\operatorname{sgn}(t-s) S ( s , t ) = 2 1 sgn ( t − s ) , with positive skew-pair coefficients T / ( ( 2 k − 1 ) π ) T/((2k-1)\pi) T / (( 2 k − 1 ) π ) . Indeed its eigenvalue equation differentiates to an exponential with boundary condition f ( T ) = − f ( 0 ) f(T)=-f(0) f ( T ) = − f ( 0 ) . The continuum bulk is therefore H C b \mathrm{HC}_b HC b by the fixed-kernel theorem. The polygonal area matrix is
A i k d , π = 1 2 ∑ j < ℓ ( Δ j B i Δ ℓ B k − Δ j B k Δ ℓ B i ) = H d ( K π d ) i k , (73) A^{d,\pi}_{ik}=\frac{1}{2}\sum_{j<\ell}(\Delta_jB^i\Delta_\ell B^k-\Delta_jB^k\Delta_\ell B^i)=H_d(K_{\pi_d})_{ik}, \tag*{(73)} A ik d , π = 2 1 j < ℓ ∑ ( Δ j B i Δ ℓ B k − Δ j B k Δ ℓ B i ) = H d ( K π d ) ik , (73)
where Δ j B i = B t j , d i − B t j − 1 , d i \Delta_jB^i=B^i_{t_{j,d}}-B^i_{t_{j-1,d}} Δ j B i = B t j , d i − B t j − 1 , d i and the row coordinates are Δ j B i / h j , d \Delta_jB^i/\sqrt{h_{j,d}} Δ j B i / h j , d . Moreover K π d K_{\pi_d} K π d is the compression of S S S to cellwise constants. The singular-value inequality for compressions gives λ k ( K π d ) ≤ T / ( ( 2 k − 1 ) π ) \lambda_k(K_{\pi_d})\le T/((2k-1)\pi) λ k ( K π d ) ≤ T / (( 2 k − 1 ) π ) , hence a common weak-trace bound A = T / π A=T/\pi A = T / π . The following result also holds for these kernels evaluated on general QC4 rows.
Theorem 7.1 (Recovery on arbitrary deterministic partitions). Assume QC4 for the rows evaluating K π d K_{\pi_d} K π d . The following are equivalent:
(i) ∑ j : d h j , d ≥ ε h j , d → 0 \sum_{j:dh_{j,d}\ge\varepsilon}h_{j,d}\to0 ∑ j : d h j , d ≥ ε h j , d → 0 for every ε > 0 \varepsilon>0 ε > 0 ;
(ii) F d ( z 0 ) → log ( 1 + b z 0 ) F_d(z_0)\to\log(1+bz_0) F d ( z 0 ) → log ( 1 + b z 0 ) in probability for one fixed z 0 > 0 z_0>0 z 0 > 0 ;
(iii) μ d ⇒ H C b \mu_d\Rightarrow\mathrm{HC}_b μ d ⇒ HC b in probability .
When these conditions hold, the empirical and sample logarithmic convergences hold almost surely, the latter at every positive parameter. No nesting or regularity of the partitions is required.
For a fixed z 0 > 0 z_0>0 z 0 > 0 , set
τ b = z 0 1 + b z 0 , m 0 = ( b τ b ) 2 2 ( 1 + b τ b ) , \tau_b=\frac{z_0}{1+bz_0},\qquad m_0=\frac{(b\tau_b)^2}{2(1+b\tau_b)}, τ b = 1 + b z 0 z 0 , m 0 = 2 ( 1 + b τ b ) ( b τ b ) 2 , M 0 = max { ( b z 0 ) 2 / 2 , b z 0 } , ϵ d ( t ) = log 2 + log ( 1 + b t d ) d . M_0=\max\{(bz_0)^2/2,bz_0\},\qquad\epsilon_d(t)=\frac{\log2+\log(1+btd)}{d}. M 0 = max {( b z 0 ) 2 /2 , b z 0 } , ϵ d ( t ) = d log 2 + log ( 1 + b t d ) . The deterministic potential satisfies
m 0 L d ≤ log ( 1 + b z 0 ) − V d ( z 0 ) ≤ M 0 L d + ϵ d ( z 0 ) . (74) m_0\mathcal{L}_d\le\log(1+bz_0)-V_d(z_0)\le M_0\mathcal{L}_d+\epsilon_d(z_0). \tag*{(74)} m 0 L d ≤ log ( 1 + b z 0 ) − V d ( z 0 ) ≤ M 0 L d + ϵ d ( z 0 ) . (74)
Consequently, with e d = C T , κ , z 0 d − 1 / 4 log ( d + 2 ) e_d = C_{T,\kappa,z_0}d^{-1/4}\log(d+2) e d = C T , κ , z 0 d − 1/4 log ( d + 2 ) ,
m 0 L d − e d ≤ E ∣ F d ( z 0 ) − log ( 1 + b z 0 ) ∣ ≤ M 0 L d + ϵ d ( z 0 ) + e d . (75) m_0\mathcal{L}_d-e_d \le\mathbb{E}|F_d(z_0)-\log(1+bz_0)| \le M_0\mathcal{L}_d+\epsilon_d(z_0)+e_d. \tag*{(75)} m 0 L d − e d ≤ E ∣ F d ( z 0 ) − log ( 1 + b z 0 ) ∣ ≤ M 0 L d + ϵ d ( z 0 ) + e d . (75)
Proof. Suppress the index d d d on cell lengths. The weighted-sign determinant identity is
det ( I + w K π ) = 1 2 { ∏ j ( 1 + w h j / 2 ) + ∏ j ( 1 − w h j / 2 ) } . (76) \det(I+wK_\pi)=\frac{1}{2}\left\{\prod_j(1+wh_j/2)+\prod_j(1-wh_j/2)\right\}. \tag*{(76)} det ( I + w K π ) = 2 1 { j ∏ ( 1 + w h j /2 ) + j ∏ ( 1 − w h j /2 ) } . (76)
Indeed every even principal Pfaffian of J N J_N J N is one, by induction using expansion along its first row. Its corresponding principal determinant in K π K_\pi K π is therefore the product of the selected h j / 2 h_j/2 h j /2 , and odd principal determinants vanish. The principal-minor expansion gives (76) . Put Ψ d ( t ) = d − 1 ∑ j log ( 1 + b t d p j ) \Psi_d(t)=d^{-1}\sum_j\log(1+bt dp_j) Ψ d ( t ) = d − 1 ∑ j log ( 1 + b t d p j ) . We claim
0 ≤ Ψ d ( t ) − Φ d ( t ) ≤ ϵ d ( t ) , 0 ≤ Φ d ( t ) ≤ Ψ d ( t ) ≤ b t . (77) 0\le\Psi_d(t)-\Phi_d(t)\le\epsilon_d(t),\qquad0\le\Phi_d(t)\le\Psi_d(t)\le bt. \tag*{(77)} 0 ≤ Ψ d ( t ) − Φ d ( t ) ≤ ϵ d ( t ) , 0 ≤ Φ d ( t ) ≤ Ψ d ( t ) ≤ b t . (77)
For x j = b t d p j x_j=bt dp_j x j = b t d p j , write r = ∏ j ( 1 − x j ) / ( 1 + x j ) r=\prod_j(1-x_j)/(1+x_j) r = ∏ j ( 1 − x j ) / ( 1 + x j ) . Equation (76) expresses the determinant as ∏ j ( 1 + x j ) ( 1 + r ) / 2 \prod_j(1+x_j)(1+r)/2 ∏ j ( 1 + x j ) ( 1 + r ) /2 . If r ≥ 0 r\ge0 r ≥ 0 , the last factor lies in [ 1 / 2 , 1 ] [1/2,1] [ 1/2 , 1 ] . If r < 0 r<0 r < 0 , choose an index with x j > 1 x_j>1 x j > 1 ; then ∣ r ∣ ≤ ( x j − 1 ) / ( x j + 1 ) |r|\le(x_j-1)/(x_j+1) ∣ r ∣ ≤ ( x j − 1 ) / ( x j + 1 ) and ( 1 + r ) / 2 ≥ ( 1 + x j ) − 1 ≥ ( 1 + b t d ) − 1 (1+r)/2\ge(1+x_j)^{-1}\ge(1+btd)^{-1} ( 1 + r ) /2 ≥ ( 1 + x j ) − 1 ≥ ( 1 + b t d ) − 1 . This proves the first two comparisons; log ( 1 + x ) ≤ x \log(1+x)\le x log ( 1 + x ) ≤ x gives the last.
For a > 0 a>0 a > 0 define χ a ( 0 ) = 0 \chi_a(0)=0 χ a ( 0 ) = 0 and χ a ( u ) = a − u − 1 log ( 1 + a u ) \chi_a(u)=a-u^{-1}\log(1+au) χ a ( u ) = a − u − 1 log ( 1 + a u ) for u > 0 u>0 u > 0 . The identity
χ a ( u ) = a ∫ 0 1 a u s 1 + a u s d s \chi_a(u)=a\int_0^1\frac{aus}{1+aus}\,ds χ a ( u ) = a ∫ 0 1 1 + a u s a u s d s
gives
a 2 2 ( 1 + a ) min { 1 , u } ≤ χ a ( u ) ≤ max { a 2 / 2 , a } min { 1 , u } . \frac{a^2}{2(1+a)}\min\{1,u\}\le\chi_a(u)\le\max\{a^2/2,a\}\min\{1,u\}. 2 ( 1 + a ) a 2 min { 1 , u } ≤ χ a ( u ) ≤ max { a 2 /2 , a } min { 1 , u } .
Since b t − Ψ d ( t ) = ∑ j p j χ b t ( d p j ) bt-\Psi_d(t)=\sum_jp_j\chi_{bt}(dp_j) b t − Ψ d ( t ) = ∑ j p j χ b t ( d p j ) , we obtain
( b t ) 2 2 ( 1 + b t ) L d ≤ b t − Ψ d ( t ) ≤ max { ( b t ) 2 / 2 , b t } L d . (78) \frac{(bt)^2}{2(1+bt)}\mathcal{L}_d\le bt-\Psi_d(t)\le\max\{(bt)^2/2,bt\}\mathcal{L}_d. \tag*{(78)} 2 ( 1 + b t ) ( b t ) 2 L d ≤ b t − Ψ d ( t ) ≤ max {( b t ) 2 /2 , b t } L d . (78)
Together with (77) , this shows that L d → 0 \mathcal{L}_d\to0 L d → 0 is equivalent to Φ d ( t 0 ) → b t 0 \Phi_d(t_0)\to bt_0 Φ d ( t 0 ) → b t 0 at any one positive parameter, and then the source converges at every parameter.
The continuum source Φ ∞ ( t ) = b t \Phi_\infty(t)=bt Φ ∞ ( t ) = b t has minimizer q ∞ ( z ) = ( 1 + b z ) − 1 q_\infty(z)=(1+bz)^{-1} q ∞ ( z ) = ( 1 + b z ) − 1 and potential log ( 1 + b z ) \log(1+bz) log ( 1 + b z ) . Testing each scalar objective at the other minimizer gives
b τ b − Φ d ( τ b ) ≤ log ( 1 + b z 0 ) − V d ( z 0 ) ≤ b z 0 q d ( z 0 ) − Φ d ( z 0 q d ( z 0 ) ) . b\tau_b-\Phi_d(\tau_b)\le\log(1+bz_0)-V_d(z_0)\le bz_0q_d(z_0)-\Phi_d(z_0q_d(z_0)). b τ b − Φ d ( τ b ) ≤ log ( 1 + b z 0 ) − V d ( z 0 ) ≤ b z 0 q d ( z 0 ) − Φ d ( z 0 q d ( z 0 )) .
Apply (78) and (77) , using q d ( z 0 ) ≤ 1 q_d(z_0)\le1 q d ( z 0 ) ≤ 1 , to get (74) . Proposition A.1 gives (75) and the equivalence of (ii) with L d → 0 \mathcal{L}_d\to0 L d → 0 . For the reverse implication, convergence of F d ( z 0 ) F_d(z_0) F d ( z 0 ) in probability and E ∣ F d ( z 0 ) − V d ( z 0 ) ∣ → 0 \mathbb{E}|F_d(z_0)-V_d(z_0)|\to0 E ∣ F d ( z 0 ) − V d ( z 0 ) ∣ → 0 force the deterministic V d ( z 0 ) V_d(z_0) V d ( z 0 ) to have the same limit; the lower loss bound then gives L d → 0 \mathcal{L}_d\to0 L d → 0 .
For every δ > 0 \delta>0 δ > 0 ,
min { 1 , δ } ∑ d p j > δ p j ≤ L d ≤ δ + ∑ d p j > δ p j . \min\{1,\delta\}\sum_{dp_j>\delta}p_j\le\mathcal{L}_d\le\delta+\sum_{dp_j>\delta}p_j. min { 1 , δ } d p j > δ ∑ p j ≤ L d ≤ δ + d p j > δ ∑ p j .
After rescaling by T T T , this proves the equivalence of (i) with L d → 0 \mathcal{L}_d\to0 L d → 0 . The common weak-trace bound supplies (RC) and (LI) by the estimates used in the proof of Theorem C. Convex secants in log t \log t log t turn Φ d ( t ) → b t \Phi_d(t)\to bt Φ d ( t ) → b t into G d ( t ) → b t G_d(t)\to bt G d ( t ) → b t . Conversely the injective correspondence in Theorem B, together with logarithmic continuity from Theorem 5.1 , recovers this source from the limiting law H C b HC_b H C b . Its root is ( 1 + b z ) − 1 (1+bz)^{-1} ( 1 + b z ) − 1 , proving the equivalence with (iii). Theorem B and Proposition A.1 give the almost-sure conclusions under any coupling across dimensions.
The criterion weights cells by elapsed time. It permits cells larger than 1 / d 1/d 1/ d when their total length vanishes. For equal cells it reduces to N d / d → ∞ N_d/d\to\infty N d / d → ∞ . Two examples distinguish it from familiar discretization conditions.
First, for d ≥ 2 d\ge2 d ≥ 2 , take one normalized cell of length p 1 = d − 1 / 3 p_1=d^{-1/3} p 1 = d − 1/3 and d 2 d^2 d 2 equal remaining cells of total length 1 − p 1 1-p_1 1 − p 1 . Then L d ≤ d − 1 / 3 + d − 1 → 0 \mathcal{L}_d\le d^{-1/3}+d^{-1}\to0 L d ≤ d − 1/3 + d − 1 → 0 , whereas d ∑ j h j 2 ∼ T 2 d 1 / 3 → ∞ d\sum_jh_j^2\sim T^2d^{1/3}\to\infty d ∑ j h j 2 ∼ T 2 d 1/3 → ∞ . In the natural Brownian coupling, A d − A d , π A^{d}-A^{d,\pi} A d − A d , π is the sum of the independent local cell areas. Each off-diagonal local area has variance h j 2 / 4 h_j^2/4 h j 2 /4 by Itô isometry. Consequently
1 d E ∥ A d − A d , π ∥ F 2 = d − 1 4 ∑ j h j 2 ⟶ ∞ , (79) \frac{1}{d}\mathbb{E}\lVert A^{d}-A^{d,\pi}\rVert_{\mathrm{F}}^2=\frac{d-1}{4}\sum_j h_j^2\longrightarrow\infty, \tag*{(79)} d 1 E ∥ A d − A d , π ∥ F 2 = 4 d − 1 j ∑ h j 2 ⟶ ∞ , (79)
although the full H C T / 2 \mathrm{HC}_{T/2} HC T /2 bulk is recovered.
Second, divide half the time into n c = ⌈ d ⌉ n_c=\lceil\sqrt{d}\rceil n c = ⌈ d ⌉ equal cells and the other half into n f = ⌈ d 2 ⌉ n_f=\lceil d^2\rceil n f = ⌈ d 2 ⌉ equal cells. Then N d / d → ∞ N_d/d\to\infty N d / d → ∞ and max j h j → 0 \max_j h_j\to0 max j h j → 0 , but
Ψ d ( t ) = n c d log ( 1 + b t d 2 n c ) + n f d log ( 1 + b t d 2 n f ) ⟶ b t 2 . \Psi_d(t)=\frac{n_c}{d}\log\left(1+\frac{btd}{2n_c}\right)+\frac{n_f}{d}\log\left(1+\frac{btd}{2n_f}\right)\longrightarrow\frac{bt}{2}. Ψ d ( t ) = d n c log ( 1 + 2 n c b t d ) + d n f log ( 1 + 2 n f b t d ) ⟶ 2 b t .
Equations (77) and Theorem B give the limiting law H C T / 4 \mathrm{HC}_{T/4} HC T /4 . A vanishing mesh and a diverging number-of-cells/dimension ratio therefore do not suffice together.
Spectral truncation. Fix c > 0 c>0 c > 0 . For comparison, retaining the first m d m_d m d pairs of coefficients c / ( k − 1 2 ) c/(k-\frac{1}{2}) c / ( k − 2 1 ) gives rescaled profiles a d ( x ) = d λ ⌈ d x ⌉ , d a_d(x)=d\lambda_{\lceil dx\rceil,d} a d ( x ) = d λ ⌈ d x ⌉ , d converging to a γ ( x ) = c x − 1 1 ( 0 , γ ) ( x ) a_\gamma(x)=cx^{-1}\mathbf{1}_{(0,\gamma)}(x) a γ ( x ) = c x − 1 1 ( 0 , γ ) ( x ) whenever m d / d → γ ∈ [ 0 , ∞ ] m_d/d\to\gamma\in[0,\infty] m d / d → γ ∈ [ 0 , ∞ ] . The common weak-trace bound 2 c 2c 2 c , Lemma B.1 , and source injectivity therefore give
μ d ⇒ H C π c in probability ⟺ m d / d → ∞ . \mu_d\Rightarrow\mathrm{HC}_{\pi c}\text{ in probability}\quad\Longleftrightarrow\quad m_d/d\to\infty. μ d ⇒ HC π c in probability ⟺ m d / d → ∞.
Indeed a bounded-ratio subsequence has a profile different from c / x c/x c / x . For Brownian area, c = T / ( 2 π ) c=T/(2\pi) c = T / ( 2 π ) . Although m d → ∞ m_d\to\infty m d → ∞ gives Hilbert–Schmidt convergence of the temporal kernels, m d = o ( d ) m_d=o(d) m d = o ( d ) gives the zero empirical limit. This uses temporal eigenmodes, whereas the preceding theorem uses time cells.
What the spectral criteria distinguish
The exact zero boundary and the canonical source distinguish two different ways in which temporal spectra can move with the dimension.
A diffuse cloud. Take d 2 d^2 d 2 pairs of size σ / ( 2 d 3 / 2 ) \sigma/(\sqrt{2}d^{3/2}) σ / ( 2 d 3/2 ) , with σ > 0 \sigma>0 σ > 0 . Their amplitudes x k , d x_{k,d} x k , d all equal σ / 2 d \sigma/\sqrt{2d} σ / 2 d , and
η d = σ 2 1 + σ 2 / ( 2 d ) δ σ / 2 d ⇒ σ 2 δ 0 , G d ( t ) ⟶ σ 2 t 2 . \eta_d=\frac{\sigma^2}{1+\sigma^2/(2d)}\delta_{\sigma/\sqrt{2d}}\Rightarrow\sigma^2\delta_0,\qquad G_d(t)\longrightarrow\sigma^2t^2. η d = 1 + σ 2 / ( 2 d ) σ 2 δ σ / 2 d ⇒ σ 2 δ 0 , G d ( t ) ⟶ σ 2 t 2 .
Conditions (RC) and (LI) hold. Theorem B therefore applies under QC4 and gives the limiting root q + σ 2 z q 2 = 1 q+\sigma^2z_q^2=1 q + σ 2 z q 2 = 1 . This is the transform of the absolute semicircle law of variance σ 2 \sigma^2 σ 2 ; equivalently, the empirical eigenvalue law of i H d iH_d i H d tends almost surely to the symmetric semicircle law. Here ∥ K d ∥ S 2 → 0 \lVert K_d\rVert_{S^2}\to0 ∥ K d ∥ S 2 → 0 and d λ ⌈ d x ⌉ , d → 0 d\lambda_{\lceil dx\rceil,d}\to0 d λ ⌈ d x ⌉ , d → 0 for each x > 0 x>0 x > 0 , but for every ε > 0 \varepsilon>0 ε > 0 ,
d ∑ k > ⌊ ε d ⌋ λ k , d 2 ⟶ σ 2 / 2. d\sum_{k>\lfloor\varepsilon d\rfloor}\lambda_{k,d}^2\longrightarrow\sigma^2/2. d k > ⌊ ε d ⌋ ∑ λ k , d 2 ⟶ σ 2 /2.
Thus the exact zero criterion in Theorem A excludes a decomposition into an o ( d ) o(d) o ( d ) -rank part and a remainder with d ∥ ⋅ ∥ S 2 2 → 0 d\lVert\cdot\rVert_{S^2}^2\to0 d ∥ ⋅ ∥ S 2 2 → 0 . The atom σ 2 δ 0 \sigma^2\delta_0 σ 2 δ 0 records precisely this retained quadratic energy. The array is not dilation coherent, since r − 1 G d ( r t ) → r σ 2 t 2 r^{-1}G_d(rt)\to r\sigma^2t^2 r − 1 G d ( r t ) → r σ 2 t 2 .
Large modes and logarithmic information. A single pair λ 1 , d = e β d \lambda_{1,d}=e^{\beta d} λ 1 , d = e β d , β > 0 \beta>0 β > 0 , has temporal rank two. Theorem A therefore gives μ d ⇒ δ 0 \mu_d\Rightarrow\delta_0 μ d ⇒ δ 0 almost surely, regardless of its size. Its source mass is at most 2 / d 2/d 2/ d , and it satisfies (DC). With Gaussian rows, however,
H d = e β d ( u v T − v u T ) , det ( I + z H d ) = 1 + z 2 e 2 β d ( ∥ u ∥ 2 ∥ v ∥ 2 − ⟨ u , v ⟩ 2 ) , H_d=e^{\beta d}(uv^{\mathsf T}-vu^{\mathsf T}),\qquad\det(I+zH_d)=1+z^2e^{2\beta d}(\lVert u\rVert^2\lVert v\rVert^2-\langle u,v\rangle^2), H d = e β d ( u v T − v u T ) , det ( I + z H d ) = 1 + z 2 e 2 β d (∥ u ∥ 2 ∥ v ∥ 2 − ⟨ u , v ⟩ 2 ) ,
where u , v u,v u , v are independent standard Gaussian vectors. The Gram determinant divided by d 2 d^2 d 2 tends to one with summable exceptional probabilities. Hence F d ( z ) → 2 β F_d(z)\to2\beta F d ( z ) → 2 β almost surely. Here (LI) fails. The logarithmic conclusion requires an extra hypothesis even when the complete bounded spectral theory applies.
One logarithmic value without coherence or order. Fix z 0 > 0 z_0>0 z 0 > 0 . For 0 < γ < 1 / 2 0<\gamma<1/2 0 < γ < 1/2 and b > 0 b>0 b > 0 , take ⌊ γ d ⌋ \lfloor\gamma d\rfloor ⌊ γ d ⌋ pairs of size b / d b/d b / d . These have a uniform weak-trace bound and limiting source η γ , b = 2 γ b 2 ( 1 + b 2 ) − 1 δ b \eta_{\gamma,b}=2\gamma b^2(1+b^2)^{-1}\delta_b η γ , b = 2 γ b 2 ( 1 + b 2 ) − 1 δ b . Their limiting potential is
V γ , b ( z 0 ) = min q > 0 { q − log q − 1 + γ log ( 1 + b 2 z 0 2 q 2 ) } . V_{\gamma,b}(z_0)=\min_{q>0}\{q-\log q-1+\gamma\log(1+b^2z_0^2q^2)\}. V γ , b ( z 0 ) = q > 0 min { q − log q − 1 + γ log ( 1 + b 2 z 0 2 q 2 )} .
The minimizing root satisfies q ≥ 1 − 2 γ q\ge1-2\gamma q ≥ 1 − 2 γ . Consequently this potential is continuous and strictly increasing in b b b , from zero to infinity: comparison at a minimizing root gives strict increase, and the lower bound on that root gives divergence. Choose distinct γ 1 , γ 2 \gamma_1,\gamma_2 γ 1 , γ 2 and amplitudes giving the same positive potential, and alternate the two arrays. Proposition A.1 gives a common almost-sure limit of F d ( z 0 ) F_d(z_0) F d ( z 0 ) , while the two spectral limits have different zero atoms 1 − 2 γ 1 1-2\gamma_1 1 − 2 γ 1 and 1 − 2 γ 2 1-2\gamma_2 1 − 2 γ 2 , as follows by letting z → ∞ z\to\infty z → ∞ in their scalar root equations. Thus spectral tightness and logarithmic integrability do not make one scalar value sufficient without coherence or spectral order.
The quadratic-form assumption. Isotropy alone is insufficient. Let X i = R i G i X_i=R_iG_i X i = R i G i , with independent Gaussian rows G i G_i G i and independent multipliers R i R_i R i , independent of the rows, taking 0 , 2 0,\sqrt{2} 0 , 2 with equal probabilities. For the reference coefficients c / ( k − 1 2 ) c/(k-\frac12) c / ( k − 2 1 ) with c > 0 c>0 c > 0 , the limiting singular law is 1 2 δ 0 + 1 2 H 2 π c \frac12\delta_0+\frac12H_{2\pi c} 2 1 δ 0 + 2 1 H 2 π c . Indeed the number of active rows is asymptotic to d / 2 d/2 d /2 , and their conditional block is 2 H N d ( K ) 2H_{N_d}(K) 2 H N d ( K ) with Gaussian rows. The fixed-kernel theorem and bounded differences identify the stated almost-sure limit. On m m m temporal coordinates, Var ∥ X i ∥ 2 = m 2 + 4 m \operatorname{Var}\lVert X_i\rVert^2=m^2+4m Var ∥ X i ∥ 2 = m 2 + 4 m , so no dimension-free QC4 bound holds. The exterior determinant means nevertheless remain unchanged.
A zero bounded response is complete escape. The positivity in Theorem C is essential. For the fixed kernel with λ k = k − p \lambda_k=k^{-p} λ k = k − p , 1 / 2 < p < 1 1/2<p<1 1/2 < p < 1 ,
G d ( 1 ) ≥ d − 1 ⌊ d 1 / p ⌋ ⟶ ∞ . G_d(1)\ge d^{-1}\lfloor d^{1/p}\rfloor\longrightarrow\infty. G d ( 1 ) ≥ d − 1 ⌊ d 1/ p ⌋ ⟶ ∞.
Lemma 6.1 gives q ^ d ( z 0 ) → 0 \widehat q_d(z_0)\to0 q d ( z 0 ) → 0 almost surely. For every finite R R R , μ d ( [ 0 , R ] ) ≤ ( 1 + z 0 2 R 2 ) q ^ d ( z 0 ) → 0 \mu_d([0,R])\le(1+z_0^2R^2)\widehat q_d(z_0)\to0 μ d ([ 0 , R ]) ≤ ( 1 + z 0 2 R 2 ) q d ( z 0 ) → 0 . Thus the bounded statistic can converge while no probability-law limit exists.
Logarithmic concentration under a weak-trace bound
Proposition A.1. Assume QC4 and A = sup d , k k λ k , d < ∞ A=\sup_{d,k}k\lambda_{k,d}<\infty A = sup d , k k λ k , d < ∞ . For each z > 0 z>0 z > 0 ,
E ∣ F d ( z ) − V d ( z ) ∣ ≤ C A , κ , z d − 1 / 4 log ( d + 2 ) . (80) \mathbb{E}|F_d(z)-V_d(z)|\le C_{A,\kappa,z}d^{-1/4}\log(d+2). \tag*{(80)} E ∣ F d ( z ) − V d ( z ) ∣ ≤ C A , κ , z d − 1/4 log ( d + 2 ) . (80) Moreover F d ( z ) − V d ( z ) → 0 F_d(z)-V_d(z)\to0 F d ( z ) − V d ( z ) → 0 almost surely, locally uniformly in log z \log z log z . The constants are locally uniform there, and no optimality of the rate is claimed.
Proof. The coefficient bound λ k , d ≤ A / k \lambda_{k,d}\le A/k λ k , d ≤ A / k and monotonicity give
Φ d ( z ) ≤ ∫ 0 ∞ log ( 1 + z 2 A 2 / x 2 ) d x = π A z . \Phi_d(z)\le\int_0^\infty\log(1+z^2A^2/x^2)\,\mathrm{d}x=\pi Az. Φ d ( z ) ≤ ∫ 0 ∞ log ( 1 + z 2 A 2 / x 2 ) d x = π A z .
For 1 ≤ r ≤ d 1\le r\le d 1 ≤ r ≤ d , remove the first r r r temporal pairs and denote the remaining kernel by L d L_d L d . Its squared Hilbert–Schmidt norm and fourth Schatten power are bounded by C A 2 / r CA^2/r C A 2 / r and C A 4 / r 3 CA^4/r^3 C A 4 / r 3 , respectively. The discarded logarithmic potential is bounded by
H d , r ( z ) : = 1 d ∑ k ≤ r log ( 1 + z 2 d 2 λ k , d 2 ) ≤ C A , z r d log ( e + d / r ) . H_{d,r}(z):=\frac{1}{d}\sum_{k\le r}\log(1+z^2d^2\lambda_{k,d}^2)\le C_{A,z}\frac{r}{d}\log(e+d/r). H d , r ( z ) := d 1 k ≤ r ∑ log ( 1 + z 2 d 2 λ k , d 2 ) ≤ C A , z d r log ( e + d / r ) .
The last estimate follows from r ! ≥ ( r / e ) r r!\ge(r/e)^r r ! ≥ ( r / e ) r . The bound (46) controls the expected sample change by H d , r ( z ) + r log 2 / d H_{d,r}(z)+r\log2/d H d , r ( z ) + r log 2/ d ; testing the scalar minima bounds the potential change by H d , r ( z ) H_{d,r}(z) H d , r ( z ) .
Use the three estimates underlying Proposition 3.6 . Since ∥ L d ∥ o p = O ( A / r ) \lVert L_d\rVert_{\mathrm{op}}=O(A/r) ∥ L d ∥ op = O ( A / r ) , formulas (50) , (54) , and (41) apply for large r r r . Substitution of the displayed tail norms gives
∣ E F d ( L d ; z ) − V L d ( z ) ∣ ≤ C A , κ , z ( d r 2 + d 2 r 3 + 1 r + 1 d ) . (81) \left|\mathbb{E}F_d(L_d;z)-V_{L_d}(z)\right|\le C_{A,\kappa,z}\left(\frac{d}{r^2}+\frac{d^2}{r^3}+\frac{1}{r}+\frac{1}{d}\right). \tag*{(81)} ∣ E F d ( L d ; z ) − V L d ( z ) ∣ ≤ C A , κ , z ( r 2 d + r 3 d 2 + r 1 + d 1 ) . (81)
Here V L d V_{L_d} V L d is the potential formed from the remaining source. All estimates hold uniformly on compact positive parameter intervals.
Set g z ( s ) = 1 2 log ( 1 + z 2 s 2 ) g_z(s) = \frac{1}{2}\log(1+z^2s^2) g z ( s ) = 2 1 log ( 1 + z 2 s 2 ) and g z , d ( s ) = g z ( min { s , d 2 } ) g_{z,d}(s) = g_z(\min\{s,d^2\}) g z , d ( s ) = g z ( min { s , d 2 }) . Equation (48) gives
E ∫ ( g z − g z , d ) d μ d = ∫ d 2 ∞ g z ′ ( s ) E μ d ( ( s , ∞ ) ) d s ≤ C A / d 2 . \mathbb{E}\int(g_z-g_{z,d})\,d\mu_d=\int_{d^2}^{\infty}g_z'(s)\mathbb{E}\mu_d((s,\infty))\,ds\le CA/d^2. E ∫ ( g z − g z , d ) d μ d = ∫ d 2 ∞ g z ′ ( s ) E μ d (( s , ∞ )) d s ≤ C A / d 2 .
The clipped statistic has range O z ( log ( d + 2 ) ) O_z(\log(d+2)) O z ( log ( d + 2 )) . Bounded differences therefore give centered L 1 L^1 L 1 error O z ( log ( d + 2 ) / d ) O_z(\log(d+2)/\sqrt{d}) O z ( log ( d + 2 ) / d ) and, for each fixed η > 0 \eta>0 η > 0 , summable deviation probabilities 2 exp [ − c z d η 2 / log 2 ( d + 2 ) ] 2\exp[-c_zd\eta^2/\log^2(d+2)] 2 exp [ − c z d η 2 / log 2 ( d + 2 )] . Markov’s inequality and Borel–Cantelli handle the nonnegative residual. Consequently
F d ( z ) − E F d ( z ) → 0 a.s. , E ∣ F d ( z ) − E F d ( z ) ∣ ≤ C A , z log ( d + 2 ) / d . (82) F_d(z)-\mathbb{E}F_d(z)\to0\quad\text{a.s.},\qquad\mathbb{E}|F_d(z)-\mathbb{E}F_d(z)|\le C_{A,z}\log(d+2)/\sqrt{d}. \tag*{(82)} F d ( z ) − E F d ( z ) → 0 a.s. , E ∣ F d ( z ) − E F d ( z ) ∣ ≤ C A , z log ( d + 2 ) / d . (82)
Combining this with (A.2) and the head bounds, and taking r ≍ d 3 / 4 r\asymp d^{3/4} r ≍ d 3/4 , proves (A.1).
The same deterministic bias bound and (A.3) give almost-sure convergence. A countable dense parameter set and the one-Lipschitz dependence of both potentials on log z \log z log z give local uniformity. Finitely many small dimensions are absorbed in the constants. □
Appendix B. Ordered spectral recovery under domination
Weak-trace profiles
For a nonnegative nonincreasing function a a a on ( 0 , ∞ ) (0,\infty) ( 0 , ∞ ) with ∫ 0 ∞ log ( 1 + a 2 ) d x < ∞ \int_0^\infty\log(1+a^2)\,dx<\infty ∫ 0 ∞ log ( 1 + a 2 ) d x < ∞ , define
η a ( B ) = 2 ∫ { a > 0 } 1 B ( a ( x ) ) a ( x ) 2 1 + a ( x ) 2 d x , ρ ∗ ( a , b ) = ∫ 0 ∞ e − x min { 1 , ∣ a ( x ) − b ( x ) ∣ } d x . (83) \eta_a(B)=2\int_{\{a>0\}}\mathbf{1}_B(a(x))\frac{a(x)^2}{1+a(x)^2}\,dx,\qquad\rho_*(a,b)=\int_0^\infty e^{-x}\min\{1,|a(x)-b(x)|\}\,dx. \tag*{(83)} η a ( B ) = 2 ∫ { a > 0 } 1 B ( a ( x )) 1 + a ( x ) 2 a ( x ) 2 d x , ρ ∗ ( a , b ) = ∫ 0 ∞ e − x min { 1 , ∣ a ( x ) − b ( x ) ∣ } d x . (83)
Profiles are identified almost everywhere. For the step profile a d ( x ) = d λ ⌈ d x ⌉ , d a_d(x)=d\lambda_{\lceil dx\rceil,d} a d ( x ) = d λ ⌈ d x ⌉ , d , one has η a d = η d \eta_{a_d}=\eta_d η a d = η d . We write G a = G η a G_a=G_{\eta_a} G a = G η a , q a = q η a q_a=q_{\eta_a} q a = q η a , V a = V η a V_a=V_{\eta_a} V a = V η a and μ a = μ η a \mu_a=\mu_{\eta_a} μ a = μ η a . The source potential is Φ a ( t ) = ∫ 0 ∞ log ( 1 + t 2 a ( x ) 2 ) d x \Phi_a(t)=\int_0^\infty\log(1+t^2a(x)^2)\,dx Φ a ( t ) = ∫ 0 ∞ log ( 1 + t 2 a ( x ) 2 ) d x .
Lemma B.1 (Compact weak-trace profiles). For each A < ∞ A<\infty A < ∞ , the class of nonnegative nonincreasing profiles a ( x ) ≤ A / x a(x)\le A/x a ( x ) ≤ A / x is compact in ρ ∗ \rho_* ρ ∗ . On this class, a ↦ η a a\mapsto\eta_a a ↦ η a is a homeomorphism onto its image, and
Φ a ( t ) ≤ π A t , G a ( t ) ≤ π A t , η a ( ( M , ∞ ) ) ≤ 2 A M , η a ( [ 0 , ε ] ) ≤ 4 A ε . (84) \Phi_a(t)\le\pi At,\qquad G_a(t)\le\pi At,\qquad\eta_a((M,\infty))\le\frac{2A}{M},\qquad\eta_a([0,\varepsilon])\le4A\varepsilon. \tag*{(84)} Φ a ( t ) ≤ π A t , G a ( t ) ≤ π A t , η a (( M , ∞ )) ≤ M 2 A , η a ([ 0 , ε ]) ≤ 4 A ε . (84) Every sequence in the class satisfies (RC) and (LI). Moreover,
η c / x ( d s ) = 2 c 1 + s 2 d s , G c / x ( t ) = π c t , μ c / x = H C π c . (85) \eta_{c/x}(ds)=\frac{2c}{1+s^2}\,ds,\qquad G_{c/x}(t)=\pi ct,\qquad\mu_{c/x}=H\!C_{\pi c}. \tag*{(85)} η c / x ( d s ) = 1 + s 2 2 c d s , G c / x ( t ) = π c t , μ c / x = H C π c . (85)
Proof. Helly selection on compact subintervals of ( 0 , ∞ ) (0,\infty) ( 0 , ∞ ) , followed by dominated convergence in ρ ∗ \rho_* ρ ∗ , proves compactness. Convergence in ρ ∗ \rho_* ρ ∗ of decreasing profiles implies pointwise convergence at the continuity points of the limit, by monotonicity. For a bounded continuous f f f , the integrand defining ∫ f d η a \int f\,d\eta_a ∫ f d η a is bounded by 2 ∥ f ∥ ∞ min ( 1 , A 2 / x 2 ) 2\|f\|_\infty\min(1,A^2/x^2) 2∥ f ∥ ∞ min ( 1 , A 2 / x 2 ) . Almost-everywhere profile convergence therefore implies weak source convergence. For y > 0 y>0 y > 0 , the measure of a superlevel set is recovered by
∣ { x : a ( x ) > y } ∣ = 1 2 ∫ ( y , ∞ ) 1 + s 2 s 2 η a ( d s ) . |\{x:a(x)>y\}|=\frac{1}{2}\int_{(y,\infty)}\frac{1+s^2}{s^2}\,\eta_a(ds). ∣ { x : a ( x ) > y } ∣ = 2 1 ∫ ( y , ∞ ) s 2 1 + s 2 η a ( d s ) .
These superlevel lengths determine a decreasing profile almost everywhere. Thus the map is injective, and compactness proves inverse continuity.
The first two bounds follow by integration against A / x A/x A / x . The upper source tail is bounded by twice ∣ { a > M } ∣ ≤ A / M |\{a>M\}|\le A/M ∣ { a > M } ∣ ≤ A / M . For the lower source tail split the integral of 2 a 2 1 { a ≤ ε } 2a^2\mathbf{1}_{\{a\le\varepsilon\}} 2 a 2 1 { a ≤ ε } at A / ε A/\varepsilon A / ε ; both resulting bounds are 2 A ε 2A\varepsilon 2 A ε . Finally,
∫ { a > M } log ( 1 + a 2 ) d x ≤ ∫ 0 A / M log ( 1 + A 2 / x 2 ) d x ⟶ 0. \int_{\{a>M\}}\log(1+a^2)\,dx\le\int_0^{A/M}\log(1+A^2/x^2)\,dx\longrightarrow0. ∫ { a > M } log ( 1 + a 2 ) d x ≤ ∫ 0 A / M log ( 1 + A 2 / x 2 ) d x ⟶ 0.
This proves uniform logarithmic integrability. Substitution s = c / x s=c/x s = c / x gives (B.3); the case c = 0 c=0 c = 0 follows directly. □
One-point inverse estimate
Proposition B.2 (One-response recovery under spectral domination). Let A > 0 A>0 A > 0 and let a , b a,b a , b be nonnegative nonincreasing profiles satisfying 0 ≤ a ( x ) ≤ b ( x ) ≤ A / x 0\le a(x)\le b(x)\le A/x 0 ≤ a ( x ) ≤ b ( x ) ≤ A / x almost everywhere. Fix z 0 > 0 z_0>0 z 0 > 0 , and set
τ = z 0 1 + π A z 0 , Δ = V b ( z 0 ) − V a ( z 0 ) , D ( t ) = Φ b ( t ) − Φ a ( t ) . \tau=\frac{z_0}{1+\pi A z_0},\qquad\Delta=V_b(z_0)-V_a(z_0),\qquad D(t)=\Phi_b(t)-\Phi_a(t). τ = 1 + π A z 0 z 0 , Δ = V b ( z 0 ) − V a ( z 0 ) , D ( t ) = Φ b ( t ) − Φ a ( t ) . Then Δ ≥ 0 \Delta\ge0 Δ ≥ 0 and
D ( τ ) ≤ Δ ≤ D ( z 0 ) , (86) D(\tau)\le\Delta\le D(z_0), \tag*{(86)} D ( τ ) ≤ Δ ≤ D ( z 0 ) , (86) ρ ∗ ( a , b ) 2 ≤ ( 4 A + τ − 2 ) Δ . (87) \rho_\ast(a,b)^2\le(4A+\tau^{-2})\Delta. \tag*{(87)} ρ ∗ ( a , b ) 2 ≤ ( 4 A + τ − 2 ) Δ. (87) The exponent 1 / 2 1/2 1/2 in the estimate for ρ ∗ \rho_\ast ρ ∗ is optimal uniformly over such ordered pairs, for every fixed A , z 0 > 0 A,z_0>0 A , z 0 > 0 .
Proof. The envelope gives G b ( t ) ≤ π A t G_b(t)\le\pi At G b ( t ) ≤ π A t , hence q b ( z 0 ) ≥ ( 1 + π A z 0 ) − 1 q_b(z_0)\ge(1+\pi A z_0)^{-1} q b ( z 0 ) ≥ ( 1 + π A z 0 ) − 1 . Testing the two objectives at each other’s minimizers yields D ( z 0 q b ( z 0 ) ) ≤ Δ ≤ D ( z 0 q a ( z 0 ) ) D(z_0q_b(z_0))\le\Delta\le D(z_0q_a(z_0)) D ( z 0 q b ( z 0 )) ≤ Δ ≤ D ( z 0 q a ( z 0 )) . The positive representation
log 1 + t 2 b 2 1 + t 2 a 2 = ∫ a 2 b 2 t 2 1 + t 2 v d v \log\frac{1+t^2b^2}{1+t^2a^2}=\int_{a^2}^{b^2}\frac{t^2}{1+t^2v}\,dv log 1 + t 2 a 2 1 + t 2 b 2 = ∫ a 2 b 2 1 + t 2 v t 2 d v
shows that D D D is increasing, proving (B.4).
For the profile bound put h = min { 1 , b − a } h=\min\{1,b-a\} h = min { 1 , b − a } , E = { b ≥ τ − 1 } E=\{b\ge\tau^{-1}\} E = { b ≥ τ − 1 } and ℓ = log [ ( 1 + τ 2 b 2 ) / ( 1 + τ 2 a 2 ) ] \ell=\log[(1+\tau^2b^2)/(1+\tau^2a^2)] ℓ = log [( 1 + τ 2 b 2 ) / ( 1 + τ 2 a 2 )] . On E E E one has ℓ ≥ ( b − a ) / ( 2 b ) ≥ x h / ( 2 A ) \ell\ge(b-a)/(2b)\ge xh/(2A) ℓ ≥ ( b − a ) / ( 2 b ) ≥ x h / ( 2 A ) ; on E c E^c E c one has ℓ ≥ τ 2 ( b − a ) 2 / 2 \ell\ge\tau^2(b-a)^2/2 ℓ ≥ τ 2 ( b − a ) 2 /2 . For any measurable 0 ≤ f ≤ 1 0\le f\le1 0 ≤ f ≤ 1 , ( ∫ f ) 2 ≤ 2 ∫ x f ( x ) d x (\int f)^2\le2\int xf(x)\,dx ( ∫ f ) 2 ≤ 2 ∫ x f ( x ) d x . Applying this inequality to f = e − x h 1 E f=e^{-xh}1_E f = e − x h 1 E , and Cauchy–Schwarz on E c E^c E c , gives
( ∫ E e − x h d x ) 2 ≤ 4 A ∫ E ℓ d x , ( ∫ E c e − x h d x ) 2 ≤ τ − 2 ∫ E c ℓ d x . \left(\int_E e^{-x}h\,dx\right)^2\le4A\int_E\ell\,dx,\qquad
\left(\int_{E^c}e^{-x}h\,dx\right)^2\le\tau^{-2}\int_{E^c}\ell\,dx. ( ∫ E e − x h d x ) 2 ≤ 4 A ∫ E ℓ d x , ( ∫ E c e − x h d x ) 2 ≤ τ − 2 ∫ E c ℓ d x .
A final Cauchy–Schwarz inequality gives ρ ∗ ( a , b ) 2 ≤ ( 4 A + τ − 2 ) D ( τ ) \rho_\ast(a,b)^2\le(4A+\tau^{-2})D(\tau) ρ ∗ ( a , b ) 2 ≤ ( 4 A + τ − 2 ) D ( τ ) . For optimality take a = 0 a=0 a = 0 and b ε = ε 1 ( 0 , 1 ) b_\varepsilon=\varepsilon1_{(0,1)} b ε = ε 1 ( 0 , 1 ) , with 0 < ε < min { A , 1 } 0<\varepsilon<\min\{A,1\} 0 < ε < min { A , 1 } . Then ρ ∗ ( 0 , b ε ) = ( 1 − e − 1 ) ε \rho_\ast(0,b_\varepsilon)=(1-e^{-1})\varepsilon ρ ∗ ( 0 , b ε ) = ( 1 − e − 1 ) ε , whereas V b ε ( z 0 ) = z 0 2 ε 2 + O z 0 ( ε 4 ) V_{b_\varepsilon}(z_0)=z_0^2\varepsilon^2+O_{z_0}(\varepsilon^4) V b ε ( z 0 ) = z 0 2 ε 2 + O z 0 ( ε 4 ) . No uniform exponent larger than 1 / 2 1/2 1/2 is therefore possible. □
In particular, suppose two QC4 arrays have ordered profiles 0 ≤ a d ≤ b d ≤ A / x 0\le a_d\le b_d\le A/x 0 ≤ a d ≤ b d ≤ A / x . Corollary 4.3, Theorem 5.1 , Lemma B.1 , and Proposition B.2 give
F d Y ( z 0 ) − F d X ( z 0 ) → P 0 ⟺ ρ ∗ ( a d , b d ) → 0 ⟺ d L ( μ d X , μ d Y ) → 0. F_d^Y(z_0)-F_d^X(z_0)\xrightarrow{\mathbb{P}}0
\Longleftrightarrow
\rho_\ast(a_d,b_d)\to0
\Longleftrightarrow
d_L(\mu_d^X,\mu_d^Y)\to0. F d Y ( z 0 ) − F d X ( z 0 ) P 0 ⟺ ρ ∗ ( a d , b d ) → 0 ⟺ d L ( μ d X , μ d Y ) → 0.
When these conditions hold, both random quantities tend to zero almost surely, by Theorem B and Proposition A.1. The scalar condition compares two ordered sources and does not require either array to converge. Orthogonal temporal compressions provide this order: if L = P K P ∣ P H L=PKP|_{P\mathcal{H}} L = P K P ∣ P H , approximation numbers give s j ( L ) ≤ s j ( K ) s_j(L)\le s_j(K) s j ( L ) ≤ s j ( K ) , and hence λ k ( L ) ≤ λ k ( K ) \lambda_k(L)\le\lambda_k(K) λ k ( L ) ≤ λ k ( K ) .
Declaration of AI Use
The author used GPT-6.0 (OpenAI) interactively in developing and refining the mathematical arguments and the presentation of this paper. The author takes full responsibility for the correctness and mathematical content of the manuscript.
References
School of Mathematical Sciences, University of Science and Technology of China, Hefei 230026, China
Email address: zhaoguangqian@mail.ustc.edu.cn