Introduction
A particle filter can report a healthy effective sample size (ESS) while its covariance estimate has already collapsed. The ESS is a scalar summary of the weight distribution; the object that the filter’s own propagation, its proposal adaptation and any downstream Gaussian summary actually consume is the spectrum of the ensemble second-moment matrix. In the proportional regime d / N → c d/N \to c d / N → c these two objects decouple. In the companion paper [1 ] we showed what a single resampling step does to the spectrum: the limiting spectral distribution factorizes into a population channel and a count channel,
μ S = H ⊠ T c ( ν ) , \mu_S = H \boxtimes\mathcal{T}_c(\nu), μ S = H ⊠ T c ( ν ) ,
with exact zero-atom masses, a rank-and-spectral-gap transition and exact second-moment costs. The present paper solves the associated inverse problem, which is ill-posed in a way that is specific to this setting and which we make precise.
The zero-atom mass m 0 m_0 m 0 of the limiting law has an interpretation that we develop in § 2.5 and which motivates everything that follows. Asymptotically a fraction m 0 m_0 m 0 of the limiting eigenvalue mass sits at zero, so only a fraction 1 − m 0 1-m_0 1 − m 0 of the spectrum carries nonzero second-order information, and ( 1 − m 0 ) d (1-m_0)d ( 1 − m 0 ) d is an effective-dimension proxy for spectral preconditioning and condition-number control. Weight-only summaries such as the ESS do not determine the limiting spectral law or its zero-atom mass, so they cannot say how much was lost. This is a structural information gap, not a claim that the ESS never responds to degeneration: the monitor experiment of § 5.5 shows synchronized dynamics, and even when the ESS alarms it cannot identify the distortion law or say how to repair it.
The forward map from population spectra to observed spectra is injective, so two population spectra can produce two different observed spectra under one and the same weight vector. A diagnostic that is a function of the weights alone therefore takes the same value on both, which is the precise sense in which spectral information is necessary rather than convenient (Lemma 3).
The inverse problem is harder than invertibility alone suggests. The forward map, a free multiplicative convolution with the distortion law, has no uniformly Lipschitz inverse on any class containing nearby atoms, so no error budget can be carried by the inverse itself. We therefore work at a resolution scale θ \theta θ and control a resolution-restricted condition number, whose positivity we prove; the budget is informative above θ \theta θ and vacuous below it, and we say so rather than concealing the floor in a hypothesis.
The motivation for a repair carrying its own diagnostics comes from the contrast with linear filtering. The Kalman filter [2 ] propagates an error covariance, a computable certificate of its uncertainty that drives the gain and bounds its precision. Particle filters have no counterpart. Our contribution is to give them one, and to delimit when it is trustworthy. Raising N N N does not by itself remove the distortion: in the proportional limit it changes c c c and hence the distortion law, and the pre-registered limit W 1 ( H 0 ⊠ T , H 0 ) W_1(H_0 \boxtimes T,H_0) W 1 ( H 0 ⊠ T , H 0 ) remains bounded away from zero over the range studied. A different scheme changes T T T , which once known can still be divided out at a fixed resolution scale. The repair buys spectral accuracy at fixed N N N , the budget that binds in high dimensions.
The main theorems hold in an exogenous-weight generalized sample-covariance model (G1–G4), covering exogenous importance weights, sample-split and cross-fitted weighting, and conditionally exogenous local approximations (§ 2.3 ). Its boundary has three regions, located numerically in § 5.3 : where the repair is certified, where the mismatch diagnostic stays dormant because the distortion law is unchanged even though the weights are not exogenous, and where neither applies. The fluctuation matrix is Gaussian in the main theorems and universality is left open. No claim about end-to-end filtering accuracy is made beyond the stated spectral and invariance results.
Prior work and what is missing
Resampling and weight degeneracy. Weight degeneracy and the effective sample size go back to [3 ] , with SMC methodology surveyed in [4 , 5 ] , convergence theory in [6 ] and the Feynman–Kac framework in [7 ] ; resampling schemes are compared in [8 , 9 ] , and in high dimensions the particle filter collapses unless the ensemble grows exponentially with an effective dimension [10 , 11 ] . These analyses quantify resampling through Monte Carlo variance and weight degeneracy; its spectral effect on high-dimensional ensembles is the subject of [1 ] , whose forward law we invert.
Rejuvenation moves and ensemble filters. Resample–move [12 ] applies a target-invariant Markov kernel after resampling, formalized for SMC samplers in [13 ] and embedded in particle MCMC in [14 ] ; geometric ergodicity under drift and minorization is established in [15 ] , and adapting the proposal covariance to the empirical covariance is adaptive Metropolis [16 ] . Ensemble transform methods [17 ] , optimal-transport formulations of the ensemble Kalman filter [18 ] , hybrid ensemble Kalman and particle filters [19 ] , differentiable resampling [20 ] , the feedback particle filter [21 ] and interacting-particle samplers [22 , 23 ] avoid the multiplicative count channel altogether. Our addition is a proposal preconditioner whose spectrum has been corrected for resampling distortion, confining spectral error to the mixing constants, and we keep standard resampling rather than replacing it.
Inverse problems and regularization. The unknown here is a measure rather than a finite-dimensional parameter, the forward map is a free multiplicative convolution with a law that is itself estimated, and the inverse is injective but not Lipschitz. This places the problem within the classical theory of ill-posed problems and regularization [24 , 25 , 26 ] ; the statistical and Bayesian viewpoints [27 , 28 ] apply as well, since the distortion law is estimated from the weights and the repair carries both an error budget and a mismatch diagnostic. What replaces a singular-value decomposition or a discrepancy principle is a resolution-restricted condition number, a budget valid above that resolution, and a forward residual certifying model mismatch.
Spectrum estimation and free deconvolution. The Marchenko–Pastur law [29 ] and its generalization [30 ] describe the sample spectrum as a deformation of the population spectrum; El Karoui [31 ] inverts this relation, Ledoit and Wolf [32 ] derive nonlinear shrinkage, and [33 ] reviews eigenvalue cleaning. Free deconvolution with a known factor is developed for signal processing in [34 , 35 ] , with consistent covariance-eigenvalue estimation in [36 ] and a survey in [37 ] . Our inversion differs in that the factor is a random count-law channel built from the weights and in that it carries an error budget and a mismatch diagnostic; nonlinear shrinkage is the external baseline of § 5.2 .
The paper makes three contributions.
The conditioning object and what it costs. That spectral law extends to random importance weights when one conditions on the weights together with the realized counts, and we delimit when this conditioning is legitimate. Conditioning on the weights alone leaves the count diagonal random. Because the forward map is injective, this also fixes what no weight-only diagnostic can see: the zero-atom mass of the resulting law quantifies the second-order dimension the filter has lost.
Regularized inversion with an explicit budget. A regularized free-deconvolution estimator is consistent with a local error budget at a fixed resolution scale. Injectivity gives no Lipschitz inverse, so the budget rests on a resolution-restricted condition number whose positivity we establish, together with a computable forward residual that certifies violation of the model.
Diagnosed, target-preserving use. The repaired spectrum is used only as a Metropolis-adjusted preconditioner, so spectral error enters the mixing constants and not the invariant target, and the full-cycle error obeys a recursion whose abstention term is governed by the geometric abstention load.
The repair recovers eigenvalue laws, not eigenvectors, and this boundary separates the tasks the tool serves from those it does not (Table 1 ).
Table 1. What the repaired spectrum can and cannot support. The lift of § 4.1 recovers a population eigenvalue law, not the population eigenbasis.
Throughout, d d d is the state dimension, N N N the ensemble size and c = d / N c=d/N c = d / N .
Section 2 states the forward problem and identifies the object to be conditioned on; Section 3 develops the inversion, its condition number and its certificate; Section 4 treats the target-preserving use of the recovered spectrum and the full cycle; Section 5 reports the pre-registered experiments. Proofs of the main results are in the supplementary material.
The forward problem and the conditioning object
Notation
Ensemble and second-moment matrices. X = [ x 1 , … , x N ] ∈ R d × N X=[x_1,\ldots,x_N]\in\mathbb{R}^{d\times N} X = [ x 1 , … , x N ] ∈ R d × N ; weights w i ≥ 0 w_i\ge0 w i ≥ 0 , ∑ i w i = 1 \sum_i w_i=1 ∑ i w i = 1 ; λ i = N w i \lambda_i=Nw_i λ i = N w i ; ρ N = 1 N ∑ i δ λ i \rho_N=\frac{1}{N}\sum_i\delta_{\lambda_i} ρ N = N 1 ∑ i δ λ i ; m ^ = X w \hat m=Xw m ^ = X w ; S w = ∑ i w i x i x i ⊤ S_w=\sum_iw_ix_ix_i^\top S w = ∑ i w i x i x i ⊤ ; S w u = S w − m ^ m ^ ⊤ S_w^u=S_w-\hat m\hat m^\top S w u = S w − m ^ m ^ ⊤ ; counts n = ( n 1 , … , n N ) n=(n_1,\ldots,n_N) n = ( n 1 , … , n N ) satisfying (A1) ∑ i n i = N \sum_i n_i=N ∑ i n i = N a.s. and (A2) E [ n i ∣ X , w ] = N w i \mathbb{E}[n_i\mid X,w]=Nw_i E [ n i ∣ X , w ] = N w i ; m ^ r = 1 N X n \hat m_r=\frac{1}{N}Xn m ^ r = N 1 X n ; S r u = 1 N ∑ i n i x i x i ⊤ S_r^u=\frac{1}{N}\sum_i n_ix_ix_i^\top S r u = N 1 ∑ i n i x i x i ⊤ ; S r = S r u − m ^ r m ^ r ⊤ S_r=S_r^u-\hat m_r\hat m_r^\top S r = S r u − m ^ r m ^ r ⊤ ; k i = ⌊ λ i ⌋ k_i=\lfloor\lambda_i\rfloor k i = ⌊ λ i ⌋ , u i = frac ( λ i ) u_i=\operatorname{frac}(\lambda_i) u i = frac ( λ i ) , R N = ∑ i u i R_N=\sum_i u_i R N = ∑ i u i . For a symmetric matrix A A A , μ A \mu_A μ A denotes its empirical spectral distribution (ESD).
Metrics. d B L d_{\mathrm{BL}} d BL is the bounded-Lipschitz metric and W 1 W_1 W 1 the 1-Wasserstein metric. The fixed-band Stieltjes discrepancy between finite measures μ , ν \mu,\nu μ , ν on R \mathbb{R} R , at bandwidth h > 0 h>0 h > 0 over the segment [ 0 , ξ h i ] [0,\xi_{\mathrm{hi}}] [ 0 , ξ hi ] , is
d S t ( μ , ν ) : = d S t ( h , ξ h i ) ( μ , ν ) : = sup { ∣ m μ ( z ) − m ν ( z ) ∣ : z = ξ + i h , ξ ∈ [ 0 , ξ h i ] } (1) d_{\mathrm{S t}}(\mu,\nu):=d_{\mathrm{S t}}^{(h,\xi_{\mathrm{hi}})}(\mu,\nu):=\sup\left\{\lvert m_\mu(z)-m_\nu(z)\rvert:z=\xi+ih,\ \xi\in[0,\xi_{\mathrm{hi}}]\right\} \tag*{(1)} d St ( μ , ν ) := d St ( h , ξ hi ) ( μ , ν ) := sup { ∣ m μ ( z ) − m ν ( z )∣ : z = ξ + ih , ξ ∈ [ 0 , ξ hi ] } (1)
on the upper-half-plane branch Im m μ > 0 \operatorname{Im}m_\mu>0 Im m μ > 0 , with m μ ( z ) = ∫ ( t − z ) − 1 μ ( d t ) m_\mu(z)=\int(t-z)^{-1}\mu(dt) m μ ( z ) = ∫ ( t − z ) − 1 μ ( d t ) . Values on the segment determine μ \mu μ , and weak convergence implies uniform convergence there, so d S t d_{\mathrm{S t}} d St is a metric adapted to the limit theorems below. The pair ( h , ξ h i ) (h,\xi_{\mathrm{hi}}) ( h , ξ hi ) is fixed in the theory (Remark 3); smaller h h h is more sensitive to local differences, which is the bandwidth dependence of the activation zone (§ 5.5 ).
Free probability. ⊞ \boxplus ⊞ , ⊠ \boxtimes ⊠ are the free additive and multiplicative convolutions [38 , 39 , 40 ] . T c ( η ) T_c(\eta) T c ( η ) is the covariance-side spectral map, defined by c T c ( η ) + ( 1 − c ) δ 0 = D c ( η ⊠ MP ( 1 / c ) ) cT_c(\eta)+(1-c)\delta_0=D_c(\eta\boxtimes\operatorname{MP}(1/c)) c T c ( η ) + ( 1 − c ) δ 0 = D c ( η ⊠ MP ( 1/ c )) with MP the Marchenko–Pastur law [29 ] , equivalently by the companion fixed-point equation z = − 1 / m ( z ) + ∫ t ( 1 + c t m ( z ) ) − 1 η ( d t ) z=-1/m(z)+\int t(1+ctm(z))^{-1}\eta(dt) z = − 1/ m ( z ) + ∫ t ( 1 + c t m ( z ) ) − 1 η ( d t ) . We write s T ( z ) : = ∫ ( 1 − z x ) − 1 T ( d x ) s_T(z):=\int(1-zx)^{-1}T(dx) s T ( z ) := ∫ ( 1 − z x ) − 1 T ( d x ) for the companion transform, L μ ( t ) : = ∫ e − t x μ ( d x ) L_\mu(t):=\int e^{-tx}\mu(dx) L μ ( t ) := ∫ e − t x μ ( d x ) for the Laplace transform, and ν m u l t i ( ρ ) : = MixPoi ( ρ ) \nu_{\mathrm{multi}}(\rho):=\operatorname{MixPoi}(\rho) ν multi ( ρ ) := MixPoi ( ρ ) , ν r e s ( π ) : = L ( K + Poi ( U ) ) \nu_{\mathrm{res}}(\pi):=\mathcal{L}(K+\operatorname{Poi}(U)) ν res ( π ) := L ( K + Poi ( U )) with ( K , U ) ∼ π (K,U)\sim\pi ( K , U ) ∼ π for the count laws.
Resolution scale and classes. θ > 0 \theta>0 θ > 0 is the resolution scale of the spectral inversion (§ 3.2 ), a scalar distinct from the count law ν \nu ν . H a , b : = P ( [ a , b ] ) \mathcal{H}_{a,b}:=\mathcal{P}([a,b]) H a , b := P ([ a , b ]) with 0 < a < b < ∞ 0<a<b<\infty 0 < a < b < ∞ , and U ⊆ H a , b \mathcal{U}\subseteq\mathcal{H}_{a,b} U ⊆ H a , b is the certified class, the relative neighborhood of H 0 H_0 H 0 on which the condition number is evaluated; it is fixed exogenously and is never estimated from the data.
High-dimensional and spectral assumptions
(G1) d / N → c ∈ ( 0 , ∞ ) d/N\to c\in(0,\infty) d / N → c ∈ ( 0 , ∞ ) . (G2) H N = μ Σ N ⇒ H H_N=\mu_{\Sigma_N}\Rightarrow H H N = μ Σ N ⇒ H , sup N ∥ Σ N ∥ o p < ∞ \sup_N\lVert\Sigma_N\rVert_{\mathrm{op}}<\infty sup N ∥ Σ N ∥ op < ∞ , H H H compactly supported; a 1 = ∫ τ H ( d τ ) a_1=\int\tau\,H(d\tau) a 1 = ∫ τ H ( d τ ) . (G3) Z N = ( z i j ) Z_N=(z_{ij}) Z N = ( z ij ) has i.i.d. centered unit-variance entries; the main theorems use Gaussian entries, with universality left as an open direction. The fluctuation model is X N = Σ N 1 / 2 Z N X_N=\Sigma_N^{1/2}Z_N X N = Σ N 1/2 Z N , with Var ( z i j ) = 1 \operatorname{Var}(z_{ij})=1 Var ( z ij ) = 1 ; the sample-covariance normalization is carried by the factor 1 / N 1/N 1/ N in S u S^u S u , not by X N X_N X N . This is the generalized sample-covariance setting of [30 ] . Gaussianity is used at exactly one point: conditionally on the count diagonal, the whitened fluctuation matrix is orthogonally invariant and hence asymptotically free from the deterministic population factor [38 , 41 ] .
The resampling environment
(G4) (exogenous random environment ) There exist W N \mathcal{W}_N W N and auxiliary randomness U N U_N U N such that ( W N , U N ) ⊥ Z N (\mathcal{W}_N,U_N)\perp Z_N ( W N , U N ) ⊥ Z N ; w N = w N ( W N ) w_N=w_N(\mathcal{W}_N) w N = w N ( W N ) ; and n N = R N ( w N , U N ) n_N=R_N(w_N,U_N) n N = R N ( w N , U N ) for the measurable realization of the chosen scheme. With the extended environment E N : = σ ( W N , n N ) \mathcal{E}_N:=\sigma(\mathcal{W}_N,n_N) E N := σ ( W N , n N ) we have E N ⊥ Z N \mathcal{E}_N\perp Z_N E N ⊥ Z N , and conditionally on E N \mathcal{E}_N E N the diagonal D N = diag ( n N ) D_N=\operatorname{diag}(n_N) D N = diag ( n N ) is deterministic.
(W2) (weight-law convergence ) ρ N ⇒ ρ \rho_N\Rightarrow\rho ρ N ⇒ ρ in probability and 1 N ∑ i λ i 2 → r 2 : = ∫ λ 2 ρ ( d λ ) < ∞ \frac{1}{N}\sum_i\lambda_i^2\to r_2:=\int\lambda^2\rho(d\lambda)<\infty N 1 ∑ i λ i 2 → r 2 := ∫ λ 2 ρ ( d λ ) < ∞ in probability. Consequently ∫ λ ρ ( d λ ) = 1 \int\lambda\,\rho(d\lambda)=1 ∫ λ ρ ( d λ ) = 1 and max i λ i = O P ( N ) \max_i\lambda_i=O_{\mathbb{P}}(\sqrt{N}) max i λ i = O P ( N ) .
(M)/(R) For multinomial resampling we assume (W2); for residual resampling we assume (W2) and π N = 1 N ∑ i δ ( k i , u i ) ⇒ π \pi_N=\frac{1}{N}\sum_i\delta_{(k_{i,u_i})}\Rightarrow\pi π N = N 1 ∑ i δ ( k i , u i ) ⇒ π in probability.
Interpretation. (G4) admits three legitimate sources: exogenous importance weights; sample splitting or cross-fitting, where one subset of particles estimates the weight structure and an independent subset carries the spectral ensemble; and conditionally exogenous local approximations. The low-dimensional model w i = ω ( B T x i ) w_i = \omega(B^\mathsf{T}x_i) w i = ω ( B T x i ) , q ≪ d q \ll d q ≪ d , is treated as a proved proposition rather than an assumption.
Count laws under random weights
Lemma 1 Centering. Under ( A 1 ) (A1) ( A 1 ) –( A 2 ) (A2) ( A 2 ) , conditionally on ( X , w ) (X,w) ( X , w ) :
(i) E [ m ^ r ∣ X , w ] = m ^ \mathbb{E}[\widehat{m}_r \mid X,w] = \widehat{m} E [ m r ∣ X , w ] = m and E [ S r c ∣ X , w ] = S w c − B n ⪯ S w c \mathbb{E}[S_r^\mathsf{c} \mid X,w] = S_w^\mathsf{c} - B_n \preceq S_w^\mathsf{c} E [ S r c ∣ X , w ] = S w c − B n ⪯ S w c , where B n = 1 N 2 X C n X T ⪰ 0 B_n = \frac{1}{N^2}XC_nX^\mathsf{T} \succeq0 B n = N 2 1 X C n X T ⪰ 0 with C n = Cov ( n ∣ X , w ) C_n = \operatorname{Cov}(n \mid X,w) C n = Cov ( n ∣ X , w ) . Resampling is unbiased for the uncentered second moment but downward biased for the centered covariance; the exact loss equals the conditional covariance of the resampled mean. Under 1 N ∑ i λ i ∥ x i ∥ 2 = O p ( d ) \frac{1}{N}\sum_i \lambda_i\lVert x_i\rVert^2 = O_{\mathrm{p}}(d) N 1 ∑ i λ i ∥ x i ∥ 2 = O p ( d ) one has tr B n = O p ( d / N ) \operatorname{tr} B_n = O_{\mathrm{p}}(d/N) tr B n = O p ( d / N ) and d − 1 tr B n = O p ( 1 / N ) d^{-1}\operatorname{tr} B_n = O_{\mathrm{p}}(1/N) d − 1 tr B n = O p ( 1/ N ) . The matrix B n B_n B n may have rank up to d d d ; it is not low-rank.
(ii) S w c ⪯ c x ∣ X , w S r c + B n S_w^\mathsf{c} \preceq_{\mathrm{cx}\mid X,w} S_r^\mathsf{c} + B_n S w c ⪯ cx ∣ X , w S r c + B n : for every convex Φ \Phi Φ with existing expectations, Φ ( S w c ) ≤ E [ Φ ( S r c + B n ) ∣ X , w ] \Phi(S_w^\mathsf{c}) \le\mathbb{E}[\Phi(S_r^\mathsf{c} + B_n)\mid X,w] Φ ( S w c ) ≤ E [ Φ ( S r c + B n ) ∣ X , w ] .
(iii) (Finite-rank invariance of the ESD) rank ( S r u − S r c ) ≤ 1 \operatorname{rank}(S_r^\mathsf{u} - S_r^\mathsf{c}) \le1 rank ( S r u − S r c ) ≤ 1 , hence sup x ∣ F S r c ( x ) − F S r u ( x ) ∣ ≤ 1 / d \sup_x\lvert F^{S_r^\mathsf{c}}(x) - F^{S_r^\mathsf{u}}(x)\rvert\le1/d sup x ∣ F S r c ( x ) − F S r u ( x )∣ ≤ 1/ d ; as d → ∞ d \to\infty d → ∞ the centered and uncentered laws coincide and the zero-atom masses differ by at most 1 / d 1/d 1/ d .
(iv) (Boundary note) This concerns only the ESD and normalized nullity: extreme eigenvalues, outliers, and unbounded spectral moments are not preserved by finite-rank perturbations. Edge convergence transfers only under an additional no-outlier condition with adjacent extreme order statistics sharing a limit.
Proof. See Section S-A of the supplementary material.
Remark 1 Why the conditioning object is E N \mathcal{E}_N E N and not $\mathcal{W}_N. The distinction matters already at the level of the count laws. The multinomial count vector is a function of the weights and of fresh resampling randomness, and it is this joint object that enters the resampled second-moment matrix. Conditioning on W N \mathcal{W}_N W N therefore leaves the count diagonal random, whereas conditioning on E N = σ ( W N , n N ) \mathcal{E}_N = \sigma(\mathcal{W}_N,n_N) E N = σ ( W N , n N ) freezes it. Since the deterministic spectral theorem requires a deterministic diagonal, E N \mathcal{E}_N E N is the minimal conditioning under which that theorem applies, and ( G 4 ) (G4) ( G 4 ) is exactly the requirement that this conditioning is compatible with the fluctuation matrix, E N ⊥ Z N \mathcal{E}_N \perp Z_N E N ⊥ Z N .
Theorem 1 Count laws under random weights. Assume ( W 2 ) (W2) ( W 2 ) (and π N ⇒ π \pi_N \Rightarrow\pi π N ⇒ π in the residual case). Then, in probability:
(i) (Multinomial) ν N = 1 N ∑ i δ n i ⇒ MixPoi ( ρ ) \nu_N = \frac{1}{N}\sum_i \delta_{n_i} \Rightarrow\operatorname{MixPoi}(\rho) ν N = N 1 ∑ i δ n i ⇒ MixPoi ( ρ ) in d B L d_{\mathrm{BL}} d BL ;
(ii) (Residual) ν N ⇒ L ( K + Poi ( U ) ) \nu_N \Rightarrow\mathcal{L}(K+\operatorname{Poi}(U)) ν N ⇒ L ( K + Poi ( U )) , ( K , U ) ∼ π (K,U)\sim\pi ( K , U ) ∼ π ;
(iii) (Second count moments) 1 N ∑ i n i 2 → 1 + r 2 \frac{1}{N}\sum_i n_i^2 \to1+r_2 N 1 ∑ i n i 2 → 1 + r 2 (multinomial), resp. r 2 + E π U r_2+\mathbb{E}_\pi U r 2 + E π U (residual).
The proof uses a balls-into-bins representation with an Efron–Stein variance bound [42 ] for bounded test functions, Le Cam Poissonization [43 ] for expectations, and exact factorial-moment computations for the unbounded second-moment statistic.
Proof. See Section S-B of the supplementary material.
The random-environment spectral law
Theorem 2 Deterministic core used in the proof of [1 Theorem 12] For deterministic diagonal D ~ N \widetilde{D}_N D N with entries in Z ≥ 0 \mathbb{Z}_{\ge0} Z ≥ 0 , ESD ⇒ η ~ \operatorname{ESD} \Rightarrow\widetilde{\eta} ESD ⇒ η (probability law, mean ≤ 1 \le1 ≤ 1 ), 1 N ∑ i d ~ i 2 ≤ K < ∞ \frac{1}{N}\sum_i \widetilde{d}_i^2 \le K < \infty N 1 ∑ i d i 2 ≤ K < ∞ , Gaussian Z N Z_N Z N independent of D ~ N \widetilde{D}_N D N , and Σ N \Sigma_N Σ N satisfying ( G 2 ) (G2) ( G 2 ) , the ESD of
1 N Σ N 1 / 2 Z N D ~ N Z N T Σ N 1 / 2 \frac{1}{N}\Sigma_N^{1/2}Z_N\widetilde{D}_NZ_N^{\mathsf{T}}\Sigma_N^{1/2} N 1 Σ N 1/2 Z N D N Z N T Σ N 1/2 converges in probability to H ⊠ T c ( η ~ ) H \boxtimes\mathcal{T}_c(\widetilde{\eta}) H ⊠ T c ( η ) .
This deterministic-diagonal statement is the imported step used in the proof of [1 Theorem 12] , verified in [1 SM §S7] . Its deterministic-diagonal form, rather than a count-law form, is what makes the conditioning argument work.
Lemma 2 Continuity of the spectral map If η L ⇒ η \eta_L \Rightarrow\eta η L ⇒ η with ∫ t η L ( d t ) \int t\,\eta_L(\mathrm{d}t) ∫ t η L ( d t ) uniformly bounded, then T c ( η L ) ⇒ T c ( η ) \mathcal{T}_c(\eta_L) \Rightarrow\mathcal{T}_c(\eta) T c ( η L ) ⇒ T c ( η ) .
Proof. See Section S-C of the supplementary material.
Theorem 3 Random-environment spectral law Under ( G 1 ) (G1) ( G 1 ) –( G 4 ) (G4) ( G 4 ) with ( M ) (M) ( M ) or ( R ) (R) ( R ) , with ν = ν m u l t i ( ρ ) \nu= \nu_{\mathrm{multi}}(\rho) ν = ν multi ( ρ ) resp. ν r e s ( π ) \nu_{\mathrm{res}}(\pi) ν res ( π ) ,
μ r S c ⇒ H ⊠ T c ( ν ) in probability. (2) \mu_r^{S_c} \Rightarrow H \boxtimes\mathcal{T}_c(\nu) \quad\text{in probability.} \tag*{(2)} μ r S c ⇒ H ⊠ T c ( ν ) in probability. (2) Proof. See Section S-D of the supplementary material.
Corollary 1 Centered law Under the same assumptions, μ r S c ⇒ H ⊠ T c ( ν ) \mu_r^{S_c} \Rightarrow H \boxtimes\mathcal{T}_c(\nu) μ r S c ⇒ H ⊠ T c ( ν ) in probability. Centering does not re-enter the random-matrix argument; it is a rank-one ESD perturbation (Lemma 1(iii)).
Corollary 2 Closed-form reference quantities Let μ = H ⊠ T c ( ν ) \mu= H \boxtimes\mathcal{T}_c(\nu) μ = H ⊠ T c ( ν ) . Then, with all four items taken from [1 ] except where noted:
Zero atom. μ ( { 0 } ) = max { H ( { 0 } ) , T c ( ν ) ( { 0 } ) } \mu(\{0\}) = \max\{H(\{0\}), \mathcal{T}_c(\nu)(\{0\})\} μ ({ 0 }) = max { H ({ 0 }) , T c ( ν ) ({ 0 })} , and under multinomial resampling T c ( ν ) ( { 0 } ) = max ( 0 , 1 − ( 1 − ν ( { 0 } ) ) / c ) \mathcal{T}_c(\nu)(\{0\}) = \max(0, 1 - (1 - \nu(\{0\}))/c) T c ( ν ) ({ 0 }) = max ( 0 , 1 − ( 1 − ν ({ 0 })) / c ) .
Active-column fraction. p s : = 1 − ν ( { 0 } ) p_s := 1 - \nu(\{0\}) p s := 1 − ν ({ 0 }) ; under multinomial resampling p s = 1 − L ρ ( 1 ) p_s = 1 - \mathcal{L}_\rho(1) p s = 1 − L ρ ( 1 ) . The rank threshold is p s ⋛ c p_s \gtreqless c p s ⋛ c ; p s p_s p s alone does not determine the general spectral gap.
Rank-only benchmark. If H = δ 1 H = \delta_1 H = δ 1 and D N D_N D N is asymptotically an active-column projection, the Marchenko–Pastur benchmark is ( c − p s ) 2 (\sqrt{c} - \sqrt{p_s})^2 ( c − p s ) 2 ; it is not a universal lower-edge bound for general ( H , ν ) (H,\nu) ( H , ν ) .
Second moment. If m 1 ( ν ) = 1 m_1(\nu) = 1 m 1 ( ν ) = 1 , then m 2 ( μ ) = m 2 ( H ) + c m 1 ( H ) 2 m 2 ( ν ) m_2(\mu) = m_2(H) + c m_1(H)^2m_2(\nu) m 2 ( μ ) = m 2 ( H ) + c m 1 ( H ) 2 m 2 ( ν ) , with m 2 ( ν ) = 1 + r 2 m_2(\nu) = 1 + r_2 m 2 ( ν ) = 1 + r 2 (multinomial) resp. r 2 + E π [ U ] r_2 + \mathbb{E}_\pi[U] r 2 + E π [ U ] (residual); the random-weight instantiation is Theorem 1(iii).
Lemma 3 Weight-only diagnostics cannot separate spectra Fix a weight vector w w w and the resampling scheme, so that the distortion law T = T c ( ν ) T = \mathcal{T}_c(\nu) T = T c ( ν ) is fixed, and let D = ψ ( w ) D = \psi(w) D = ψ ( w ) be any diagnostic that is a function of the weights alone. If the forward map is injective on the candidate class, there exist H 1 ≠ H 2 H_1 \ne H_2 H 1 = H 2 on which D D D takes the same value while the limiting laws H 1 ⊠ T H_1 \boxtimes T H 1 ⊠ T and H 2 ⊠ T H_2 \boxtimes T H 2 ⊠ T differ.
Proof. Both data sets share w w w , hence ν \nu ν , T T T and the value of ψ \psi ψ ; by injectivity on the class (Lemma 4(iii)) the two limiting laws differ. □
The statement is deliberately confined to the class of functionals the filter has access to before it looks at the spectrum. It is not a statement about scalar diagnostics in general: the zero-atom mass is itself a scalar and separates some spectra, and on compact support a moment sequence determines the measure. It is also not a statement of dynamical blindness; the monitor experiment of § 5.6 shows the ESS and the zero-atom mass moving in synchrony. What fails is the identification of the distortion law, and with it the possibility of directing a repair.
One consequence is used later: with a 1 = m 1 ( H ) a_1 = m_1(H) a 1 = m 1 ( H ) and m 1 ( ν ) = 1 m_1(\nu) = 1 m 1 ( ν ) = 1 , residual resampling never exceeds multinomial in the second spectral moment, m 2 , r e s i d u a l = m 2 , H + c a 1 2 ( r 2 + E π [ U ] ) ≤ m 2 , m u l t i m_{2,\mathrm{residual}} = m_{2,H} + c a_1^2(r_2 + \mathbb{E}_{\pi}[U]) \le m_{2,\mathrm{multi}} m 2 , residual = m 2 , H + c a 1 2 ( r 2 + E π [ U ]) ≤ m 2 , multi , and the active-column fraction is nonincreasing in the convex order (§ 16.2 of the supplementary material). These four items are the reference values against which the experiments of § 5 are checked.
Inversion and certification
The inversion problem and the condition number
The observed object is μ ^ N = μ S r c \widehat{\mu}_N = \mu_{\mathcal{S}_r^c} μ N = μ S r c , and Corollary 1 gives ε N : = d S t ( μ ^ N , μ ) → 0 \varepsilon_N := d_{\mathrm{St}}(\widehat{\mu}_N,\mu) \to0 ε N := d St ( μ N , μ ) → 0 in probability with μ = H 0 ⊠ T \mu= H_0 \boxtimes T μ = H 0 ⊠ T , where the distortion law T = T c ( ν ) T = T_c(\nu) T = T c ( ν ) is computable from the weights. The task is to recover H 0 H_0 H 0 from μ ^ N \widehat{\mu}_N μ N and the weights alone. The candidate class is H a , b = P ( [ a , b ] ) \mathcal{H}_{a,b} = \mathcal{P}([a,b]) H a , b = P ([ a , b ]) , 0 < a < b < ∞ 0 < a < b < \infty 0 < a < b < ∞ , compact and away from the zero-atom and hard-edge regions where inversion degenerates, and the forward operator is F T ( G ) : = G ⊠ T \mathcal{F}_T(G) := G \boxtimes T F T ( G ) := G ⊠ T .
Structure of the forward map
Lemma 4 Structure of the forward map
(i) H a , b \mathcal{H}_{a,b} H a , b is weakly compact. (ii) G ↦ G ⊠ T G \mapsto G \boxtimes T G ↦ G ⊠ T is weakly continuous on P ( [ a , b ] ) \mathcal{P}([a,b]) P ([ a , b ]) . (iii) Let T ∈ P ( R ≥ 0 ) T \in\mathcal{P}(\mathbb{R}_{\ge0}) T ∈ P ( R ≥ 0 ) satisfy 0 < m 1 ( T ) < ∞ 0 < m_1(T) < \infty 0 < m 1 ( T ) < ∞ . Then F T \mathcal{F}_T F T is injective on H a , b \mathcal{H}_{a,b} H a , b : S G ⊠ T = S G S T S_{G\boxtimes T} = S_GS_T S G ⊠ T = S G S T , and S T S_T S T is defined and nonzero on a left interval ( − δ , 0 ] (-\delta,0] ( − δ , 0 ] , so division recovers S G S_G S G ; compactly supported measures are moment-determinate.
Proof. See Section S-E of the supplementary material.
Resolution-restricted condition number. Injectivity does not provide a uniform Lipschitz inverse. Let U ⊆ H a , b \mathcal{U} \subseteq\mathcal{H}_{a,b} U ⊆ H a , b be the certified class and let θ > 0 \theta> 0 θ > 0 be a resolution scale. Write
κ i n v ( θ ) ( H 0 , T ; U ) : = inf G 1 ≠ G 2 ∈ U W 1 ( G 1 , G 2 ) ≥ θ d S t ( F T ( G 1 ) , F T ( G 2 ) ) W 1 ( G 1 , G 2 ) . (3) \kappa_{\mathrm{inv}}^{(\theta)}(H_0,T;\mathcal{U}) := \inf_{\substack{G_1 \ne G_2 \in\mathcal{U}\\ W_1(G_1,G_2)\geq\theta}} \frac{d_{\mathrm{St}}(\mathcal{F}_T(G_1),\mathcal{F}_T(G_2))}{W_1(G_1,G_2)}. \tag*{(3)} κ inv ( θ ) ( H 0 , T ; U ) := G 1 = G 2 ∈ U W 1 ( G 1 , G 2 ) ≥ θ inf W 1 ( G 1 , G 2 ) d St ( F T ( G 1 ) , F T ( G 2 )) . (3)
The restriction W 1 ≥ θ W_1 \geq\theta W 1 ≥ θ is essential: without it the ratio has no positive lower bound in general, since a homeomorphism that contracts measure differences near the diagonal drives the infimum to zero (F ( x ) = x 2 F(x)=x^2 F ( x ) = x 2 on [ 0 , 1 ] [0,1] [ 0 , 1 ] , where ∣ x 2 − y 2 ∣ / ∣ x − y ∣ = x + y \lvert x^2-y^2\rvert/\lvert x-y\rvert=x+y ∣ x 2 − y 2 ∣ / ∣ x − y ∣ = x + y ), so the unrestricted quantity cannot carry an error budget. With the restriction it is finite and strictly positive by Theorem 6. We work with d H : = W 1 d_{\mathcal{H}} := W_1 d H := W 1 throughout, so the inversion budget is a W 1 W_1 W 1 budget and connects to the cycle analysis of § 4.3 : a mass-t t t atom moved over a fixed distance costs O ( t ) O(t) O ( t ) in both W 1 W_1 W 1 and the fixed-bandwidth Stieltjes discrepancy, which is what makes the two commensurable.
Remark 3 Implemented discrepancy The registered implementation (§ 5.1 ) uses a root-mean-square discretization of d S t d_{\mathrm{St}} d St over n x n_x n x grid points, with the zero atom removed (which leaves the condition number unchanged by the maximum-atom rule) and a data-dependent band converging to a fixed band; the vanishing of ε N \varepsilon_N ε N , δ N \delta_N δ N and Theorem 5 hold verbatim for it. On the grid-supported class used in the computations, identifiability additionally requires injectivity of G ↦ ( m F T ( G ) + ( z j ) ) j ≤ n x G \mapsto(m^+_{\mathcal{F}_T(G)}(z_j))_{j\leq n_x} G ↦ ( m F T ( G ) + ( z j ) ) j ≤ n x , where m μ + ( z ) : = m μ ( z ) + μ ( { 0 } ) / z m_\mu^+(z) := m_\mu(z) + \mu(\{0\})/z m μ + ( z ) := m μ ( z ) + μ ({ 0 }) / z denotes the Stieltjes transform with the zero atom removed, checked locally by κ ^ i n v > 0 \widehat{\kappa}_{\mathrm{inv}} > 0 κ inv > 0 , and the implemented budget B ^ N \widehat{B}_N B N is a consistent estimate, not a certified bound (§ 17.1 of the supplementary material).
The plug-in distortion law
We do not estimate the limiting law ρ \rho ρ ; the plug-in distortion law is built directly from the realized weights:
ν ^ N m u l t i : = 1 N ∑ i = 1 N Poi ( λ i ) , ν ^ N r e s : = 1 N ∑ i = 1 N L ( k i + Poi ( u i ) ) , T ^ N : = T c N ( ν ^ N ) , c N = d / N . (4) \widehat{\nu}^{\mathrm{multi}}_N := \frac{1}{N}\sum_{i=1}^{N}\operatorname{Poi}(\lambda_i), \qquad\widehat{\nu}^{\mathrm{res}}_N := \frac{1}{N}\sum_{i=1}^{N}\mathcal{L}(k_i+\operatorname{Poi}(u_i)), \qquad\widehat{T}_N := T_{c_N}(\widehat{\nu}_N), \qquad c_N=d/N. \tag*{(4)} ν N multi := N 1 i = 1 ∑ N Poi ( λ i ) , ν N res := N 1 i = 1 ∑ N L ( k i + Poi ( u i )) , T N := T c N ( ν N ) , c N = d / N . (4)
Lemma 5 Plug-in lemma. (i) Multinomial: ρ N ⇒ ρ \rho_N \Rightarrow\rho ρ N ⇒ ρ under (W2) implies ν ^ N m u l t i ⇒ MixPoi ( ρ ) \widehat{\nu}^{\mathrm{multi}}_N \Rightarrow\operatorname{MixPoi}(\rho) ν N multi ⇒ MixPoi ( ρ ) ; (ii) residual: π N ⇒ π \pi_N \Rightarrow\pi π N ⇒ π implies ν ^ N r e s ⇒ L ( K + Poi ( U ) ) \widehat{\nu}^{\mathrm{res}}_N \Rightarrow\mathcal{L}(K+\operatorname{Poi}(U)) ν N res ⇒ L ( K + Poi ( U )) ; (iii) in both cases m 1 ( ν ^ N ) = 1 m_1(\widehat{\nu}_N)=1 m 1 ( ν N ) = 1 exactly and m 2 ( ν ^ N ) = O p ( 1 ) m_2(\widehat{\nu}_N)=O_p(1) m 2 ( ν N ) = O p ( 1 ) , so Lemma 2 gives T ^ N ⇒ T \widehat{T}_N \Rightarrow T T N ⇒ T ; (iv) joint continuity of ( G , Q ) ↦ G ⊠ Q (G,Q)\mapsto G\boxtimes Q ( G , Q ) ↦ G ⊠ Q on compact sets gives δ N : = sup G ∈ H a , b d S t ( G ⊠ T ^ N , G ⊠ T ) → 0 \delta_N := \sup_{G\in\mathcal{H}_{a,b}}d_{\mathrm{St}}(G\boxtimes\widehat{T}_N,G\boxtimes T)\to0 δ N := sup G ∈ H a , b d St ( G ⊠ T N , G ⊠ T ) → 0 in probability.
Proof. See Section S-E of the supplementary material.
Of the two available laws, T ^ c o n d \widehat{T}^{\mathrm{cond}} T cond and T ^ r e a l i z e d : = T c N ( ν N ) \widehat{T}^{\mathrm{realized}}:=T_{c_N}(\nu_N) T realized := T c N ( ν N ) , the realized-count law inverts better at the largest ensemble size of § 5.2 and the conditional plug-in is smoother, which the mismatch diagnostic requires of its reference law; we retain T ^ c o n d \widehat{T}^{\mathrm{cond}} T cond as default and claim no strict ordering.
The estimator and its consistency
H ^ N ∈ a r g m i n G ∈ H a , b { d S t ( μ ^ N , F ^ T N ( G ) ) 2 + γ N R ( G ) } (5) \widehat{H}_N \in\mathop{\mathrm{arg\,min}}_{G\in\mathcal{H}_{a,b}} \left\{d_{\mathrm{St}}\left(\widehat{\mu}_N,\widehat{\mathcal{F}}_{T_N}(G)\right)^2+\gamma_N R(G)\right\} \tag*{(5)} H N ∈ arg min G ∈ H a , b { d St ( μ N , F T N ( G ) ) 2 + γ N R ( G ) } (5)
a Tikhonov-regularized minimum-distance problem [24 ] with R R R lower semicontinuous; an argmin exists by lower semicontinuity on a compact set. Quadratic penalties R ( G ) = ∫ x 2 G ( d x ) R(G)=\int x^2G(dx) R ( G ) = ∫ x 2 G ( d x ) are safe defaults, entropy penalties being typically infinite on atomic laws. The schedule must be scale-free: a fixed γ N = γ 0 / N \gamma_N=\gamma_0/N γ N = γ 0 / N does not adapt to the scale of H H H , because the penalty enters through R ( H 0 ) R(H_0) R ( H 0 ) , and in the strong-anisotropy regime can displace the spike mass entirely, so we use γ N = γ r e l / R ^ N \gamma_N=\gamma_{\mathrm{rel}}/\widehat{R}_N γ N = γ rel / R N .
Theorem 4 Consistency and local error budget Assume (i) H 0 ∈ H a , b H_0\in\mathcal{H}_{a,b} H 0 ∈ H a , b and the ideal model μ = F T ( H 0 ) \mu=\mathcal{F}_T(H_0) μ = F T ( H 0 ) ; (ii) R ( H 0 ) < ∞ R(H_0)<\infty R ( H 0 ) < ∞ ; (iii) ε N → 0 \varepsilon_N\to0 ε N → 0 in probability (Corollary 1); (iv) δ N → 0 \delta_N\to0 δ N → 0 in probability (Lemma 5; in the oracle setting δ N = 0 \delta_N=0 δ N = 0 ); (v) γ N → 0 \gamma_N\to0 γ N → 0 . Then W 1 ( H ^ N , H 0 ) → 0 W_1(\widehat{H}_N,H_0)\to0 W 1 ( H N , H 0 ) → 0 in probability. Moreover, with κ : = κ i n v ( θ ) ( H 0 , T ; U ) \kappa:=\kappa_{\mathrm{inv}}^{(\theta)}(H_0,T;U) κ := κ inv ( θ ) ( H 0 , T ; U ) , which is strictly positive by Theorem 6, and B N : = κ − 1 [ δ N + ( ε N + δ N ) 2 + γ N R ( H 0 ) + ε N ] B_N:=\kappa^{-1}[\delta_N+\sqrt{(\varepsilon_N+\delta_N)^2+\gamma_NR(H_0)+\varepsilon_N}] B N := κ − 1 [ δ N + ( ε N + δ N ) 2 + γ N R ( H 0 ) + ε N ] , on the event { H ^ N ∈ U } \{\widehat{H}_N\in U\} { H N ∈ U } , which has probability tending to one,
W 1 ( H ^ N , H 0 ) ≤ max { θ , B N } . (6) W_1(\widehat{H}_N,H_0)\le\max\{\theta,B_N\}. \tag*{(6)} W 1 ( H N , H 0 ) ≤ max { θ , B N } . (6)
Consistency is proved without the condition number, from compactness and injectivity; the budget is the quantitative refinement, informative only at scale B N ≥ θ B_N\ge\theta B N ≥ θ , and below θ \theta θ the max is trivial. Throughout, B N B_N B N is read at fixed θ \theta θ with the maximum suppressed; since B N = o p ( 1 ) B_N=o_p(1) B N = o p ( 1 ) under (iii)–(v), consistency statements are unaffected.
Proof. See Section S-F of the supplementary material.
Theorem 5 Consistent mismatch diagnostic Suppose H a , b \mathcal{H}_{a,b} H a , b is compact, ε N → 0 \varepsilon_N\to0 ε N → 0 and δ N → 0 \delta_N\to0 δ N → 0 in probability, and define ε m o d e l : = inf G ∈ H a , b d S t ( μ , G ⊠ T ) \varepsilon_{\mathrm{model}}:=\inf_{G\in\mathcal{H}_{a,b}}d_{\mathrm{St}}(\mu,G\boxtimes T) ε model := inf G ∈ H a , b d St ( μ , G ⊠ T ) and its computable proxy ε ^ m o d e l , N : = inf G ∈ H a , b d S t ( μ ^ N , G ⊠ T ^ N ) \widehat{\varepsilon}_{\mathrm{model},N}:=\inf_{G\in\mathcal{H}_{a,b}}d_{\mathrm{St}}(\widehat{\mu}_N,G\boxtimes\widehat{T}_N) ε model , N := inf G ∈ H a , b d St ( μ N , G ⊠ T N ) . Then ∣ ε ^ m o d e l , N − ε m o d e l ∣ ≤ ε N + δ N → 0 |\widehat{\varepsilon}_{\mathrm{model},N}-\varepsilon_{\mathrm{model}}|\le\varepsilon_N+\delta_N\to0 ∣ ε model , N − ε model ∣ ≤ ε N + δ N → 0 in probability.
Proof. See Section S-G of the supplementary material. The theoretical certificate is the global minimum-distance residual; an implemented certificate additionally carries a numerical optimization error η N o p t \eta_N^{\mathrm{opt}} η N opt .
Model mismatch. If μ ∉ F T ( H a , b ) \mu\notin\mathcal{F}_T(\mathcal{H}_{a,b}) μ ∈ / F T ( H a , b ) , the estimator targets the pseudo-true spectrum H † ∈ a r g m i n G ∈ H a , b d S t ( μ , F T ( G ) ) H^\dagger\in\mathop{\mathrm{arg\,min}}_{G\in\mathcal{H}_{a,b}}d_{\mathrm{St}}(\mu,\mathcal{F}_T(G)) H † ∈ arg min G ∈ H a , b d St ( μ , F T ( G )) , and ε ^ m o d e l \widehat{\varepsilon}_{\mathrm{model}} ε model certifies the forward residual, not W 1 ( H ^ N , H 0 ) W_1(\widehat{H}_N,H_0) W 1 ( H N , H 0 ) . If H † H^\dagger H † is unique with κ i n v ( θ ) ( H † , T ; U ) > 0 \kappa_{\mathrm{inv}}^{(\theta)}(H^\dagger,T;U)>0 κ inv ( θ ) ( H † , T ; U ) > 0 , the same argument gives W 1 ( H ^ N , H † ) → 0 W_1(\widehat{H}_N,H^\dagger)\to0 W 1 ( H N , H † ) → 0 at the local rate, with W 1 ( H † , H 0 ) W_1(H^\dagger,H_0) W 1 ( H † , H 0 ) the irreducible spectral bias of misspecification.
Theorem 6 Identifiability: strict positivity at finite resolution Let U ⊆ H a , b U\subseteq\mathcal{H}_{a,b} U ⊆ H a , b be closed. Under Lemma 4, F T \mathcal{F}_T F T is a homeomorphism of U U U onto its image, so its inverse is uniformly continuous: for every resolution scale θ > 0 \theta>0 θ > 0 there exists δ θ > 0 \delta_\theta>0 δ θ > 0 such that
W 1 ( G 1 , G 2 ) ≥ θ ⟹ d S t ( F T ( G 1 ) , F T ( G 2 ) ) ≥ δ θ . (7) W_1(G_1,G_2)\ge\theta\quad\Longrightarrow\quad d_{\mathrm{St}}\left(\mathcal{F}_T(G_1),\mathcal{F}_T(G_2)\right)\ge\delta_\theta. \tag*{(7)} W 1 ( G 1 , G 2 ) ≥ θ ⟹ d St ( F T ( G 1 ) , F T ( G 2 ) ) ≥ δ θ . (7)
Since W 1 ≤ b − a W_1 \le b-a W 1 ≤ b − a on H a , b \mathcal{H}_{a,b} H a , b , the resolution-restricted condition number of § 3.2 satisfies
κ i n v ( θ ) ( H 0 , T ; U ) ≥ δ θ b − a > 0. (8) \kappa_{\mathrm{inv}}^{(\theta)}(H_0,T;\mathcal{U}) \ge\frac{\delta_\theta}{b-a} > 0. \tag*{(8)} κ inv ( θ ) ( H 0 , T ; U ) ≥ b − a δ θ > 0. (8)
The modulus δ θ \delta_\theta δ θ is not explicit, and the restriction is intrinsic: two measures on a common compact support can have arbitrarily close transforms while remaining at a fixed W 1 W_1 W 1 distance, so no support-free explicit constant exists and none is claimed. What degenerates as θ ↓ 0 \theta\downarrow0 θ ↓ 0 is the modulus, not the positivity, so the degradation measured in § 5.3 concerns conditioning rather than existence. The theorem is a positivity statement, not a computable region; it supplies what the budget of Theorem 4 requires, and the modulus is assessed numerically on the two-point family (§ 5.3 and Section S-K of the supplementary material), no constant from which enters any theorem. Per scheme, T = T c ( ν m u l t i ( ρ ) ) T=T_c(\nu_{\mathrm{multi}}(\rho)) T = T c ( ν multi ( ρ )) or T = T c ( ν r e s ( π ) ) T=T_c(\nu_{\mathrm{res}}(\pi)) T = T c ( ν res ( π )) , the residual case requiring π \pi π because the floor–fraction map is discontinuous at integers.
Remark 4 Conditioning mechanism The quantity that tracks the condition number is the zero-atom mass q q q of the distortion law, not the distance ∣ c − p s ∣ \lvert c-p_s\rvert ∣ c − p s ∣ to the onset boundary, where the atom is born with zero mass and inversion is well conditioned (§ 5.3 ). With m 1 ( T ) m_1(T) m 1 ( T ) pinned at one, Cauchy–Schwarz gives m 2 ( T ) ≥ ( ∫ x > 0 x T ( d x ) ) 2 / ( 1 − q ) = ( 1 − q ) − 1 m_2(T) \ge\left(\int_{x>0} x\,T(\mathrm{d}x)\right)^2/(1-q)=(1-q)^{-1} m 2 ( T ) ≥ ( ∫ x > 0 x T ( d x ) ) 2 / ( 1 − q ) = ( 1 − q ) − 1 , so a growing atom forces a more dispersed T T T , which contracts the Stieltjes discrepancy relative to W 1 W_1 W 1 : the inequality direction that obstructs inversion, and an instance of the smoothing effect of free convolution [44 ] . This is a consistency argument, not a rate statement; Theorem 6 guarantees positivity.
Target-preserving use and the full cycle
Target-preserving rejuvenation
The recovered spectrum is only ever used as a proposal preconditioner, never as a target. Write F k − 1 N = σ ( particle system and all randomness up to k − 1 ) \mathcal{F}_{k-1}^{N}=\sigma(\text{particle system and all randomness up to }k-1) F k − 1 N = σ ( particle system and all randomness up to k − 1 ) and let the computable target at step k k k be the F k − 1 N \mathcal{F}_{k-1}^{N} F k − 1 N -conditional measure
π ~ k N ( d x ) : = g k ( y k ∣ x ) ν ^ k ∣ k − 1 N ( d x ) ν ^ k ∣ k − 1 N ( g k ( y k ∣ ⋅ ) ) , ν ^ k ∣ k − 1 N ( d x ) = 1 N ∑ j = 1 N p k ( d x ∣ x k − 1 j ) . (9) \widetilde{\pi}_k^N(\mathrm{d}x) := \frac{g_k(y_k\mid x)\,\widehat{\nu}_{k\mid k-1}^N(\mathrm{d}x)}{\widehat{\nu}_{k\mid k-1}^N(g_k(y_k\mid\cdot))}, \qquad\widehat{\nu}_{k\mid k-1}^N(\mathrm{d}x)=\frac{1}{N}\sum_{j=1}^{N}p_k(\mathrm{d}x\mid x_{k-1}^j). \tag*{(9)} π k N ( d x ) := ν k ∣ k − 1 N ( g k ( y k ∣ ⋅ )) g k ( y k ∣ x ) ν k ∣ k − 1 N ( d x ) , ν k ∣ k − 1 N ( d x ) = N 1 j = 1 ∑ N p k ( d x ∣ x k − 1 j ) . (9)
The rejuvenation kernel R k R_k R k consists of L k L_k L k random-walk Metropolis–Hastings (MH) steps [45 ] with target π ~ k N = π ~ k N \widetilde{\pi}_k^N=\widetilde{\pi}_k^N π k N = π k N , evaluated in density form. Because the target is the computable SMC target and not a surrogate built from the recovered spectrum, that spectrum enters only through the proposal. A surrogate target is not used: spectral-law error is not state-space target error, and controlling the former would require a target-approximation theorem that Theorems 4 and 5 do not supply.
The proposal uses M k = Σ ^ k l i f t + ε I M_k=\widehat{\Sigma}_k^{\mathrm{lift}}+\varepsilon I M k = Σ k lift + ε I with Σ ^ k l i f t = U k diag ( Q H ^ k , γ ( ( j − 1 2 ) / d ) j = 1 d ) U k ⊤ \widehat{\Sigma}_k^{\mathrm{lift}}=U_k\operatorname{diag}\left(Q_{\widehat{H}_{k,\gamma}}\left((j-\frac{1}{2})/d\right)_{j=1}^{d}\right)U_k^\top Σ k lift = U k diag ( Q H k , γ ( ( j − 2 1 ) / d ) j = 1 d ) U k ⊤ , where Q G Q_G Q G is the quantile function of G G G , U k U_k U k is the ordered eigenvector matrix of S r , k c S_{r,k}^{c} S r , k c and the quantiles follow the nondecreasing eigenvalue order. The lift is rotationally equivariant and recovers a population eigenvalue law, not the eigenbasis; the ε \varepsilon ε -floor prevents a degenerate proposal and is not a geometric-ergodicity condition, its value being set by the posterior anisotropy κ ( C π ) = s max ( s min + r ) / [ s min ( s max + r ) ] \kappa(C_{\pi}) = s_{\max}(s_{\min} + r)/[s_{\min}(s_{\max} + r)] κ ( C π ) = s m a x ( s m i n + r ) / [ s m i n ( s m a x + r )] , capped at 1 + r / s min 1 + r/s_{\min} 1 + r / s m i n under Gaussian linear observations, and by the usability of the empirical eigenbasis, which degrades at high c c c with a macroscopic zero atom. The damped Gaussian-proxy transport G β G_{\beta} G β , of closed-form cost [46 ] , is only a proposal mechanism, with the full Hastings correction whenever it makes the proposal asymmetric.
Invariance and the error decomposition
Lemma 6 Target preservation The MH kernel is reversible for its actual target, π ~ k N R k = π ~ k N \widetilde{\pi}^{N}_{k}R_{k} = \widetilde{\pi}^{N}_{k} π k N R k = π k N , by construction. Since the actual target is the computable SMC target, π ~ k N R k = π ~ k N \widetilde{\pi}^{N}_{k}R_{k} = \widetilde{\pi}^{N}_{k} π k N R k = π k N : the move step preserves the conditional SMC target and introduces no target bias.
Theorem 7 Conditional error decomposition Work conditionally on F k − 1 N \mathcal{F}^{N}_{k-1} F k − 1 N . If the MH kernel satisfies a drift–minorization condition with F k − 1 N \mathcal{F}^{N}_{k-1} F k − 1 N -measurable constants C k , ϱ k C_{k},\varrho_{k} C k , ϱ k , then in a metric compatible with the mixing theorem d ( L ( X k , L k N ∣ F k − 1 N ) , π ~ k N ) ≤ C k ϱ k L k d(\mathcal{L}(X^{N}_{k,L_{k}}\mid\mathcal{F}^{N}_{k-1}),\widetilde{\pi}^{N}_{k}) \le C_{k}\varrho_{k}^{L_{k}} d ( L ( X k , L k N ∣ F k − 1 N ) , π k N ) ≤ C k ϱ k L k , and hence d ( π k , L ( X k , L k N ∣ F k − 1 N ) ) ≤ d ( π k , π ~ k N ) + C k ϱ k L k d(\pi_{k},\mathcal{L}(X^{N}_{k,L_{k}}\mid\mathcal{F}^{N}_{k-1})) \le d(\pi_{k},\widetilde{\pi}^{N}_{k}) + C_{k}\varrho_{k}^{L_{k}} d ( π k , L ( X k , L k N ∣ F k − 1 N )) ≤ d ( π k , π k N ) + C k ϱ k L k . For each fixed k k k , Feynman–Kac stability gives d B L ( π ~ k N , π k ) → 0 d_{\mathrm{BL}}(\widetilde{\pi}^{N}_{k},\pi_{k}) \to0 d BL ( π k N , π k ) → 0 in probability independently of the number of move steps, and the mixing term is made small by raising L k L_{k} L k at no asymptotic bias. The recovered spectrum affects only the proposal, hence only C k , ϱ k C_{k},\varrho_{k} C k , ϱ k , not the invariant target.
Proof. See Section S-H of the supplementary material. The numerical validation of § 5 covers random-walk Metropolis–Hastings; the Metropolis-adjusted Langevin algorithm lies within the scope of Theorem 7 without numerical validation.
The full-cycle recursion under scalar stable dynamics
The one-cycle operator. One cycle maps H k + ↦ H k + 1 + H^{+}_{k} \mapsto H^{+}_{k+1} H k + ↦ H k + 1 + in three stages: propagation, which is not spectrally closed for general dynamics because the spectrum of A Σ A T + Q A\Sigma A^{\mathsf{T}} + Q A Σ A T + Q depends on eigenvector orientation; selection, H k + 1 − → H k + 1 − ⊠ T c ( ν k + 1 ) H^{-}_{k+1} \to H^{-}_{k+1} \boxtimes T_{c}(\nu_{k+1}) H k + 1 − → H k + 1 − ⊠ T c ( ν k + 1 ) (Theorem 3 ); and correction, with W 1 ( H ^ k + 1 , H k + 1 − ) ≤ B k + 1 W_{1}(\widehat{H}_{k+1},H^{-}_{k+1}) \le B_{k+1} W 1 ( H k + 1 , H k + 1 − ) ≤ B k + 1 (Theorem 4), setting H k + 1 + : = H ^ k + 1 H^{+}_{k+1} := \widehat{H}_{k+1} H k + 1 + := H k + 1 . Figure 1 summarizes the corrected cycle.
Figure 1. The spectrally corrected filtering cycle and its error recursion. (a) One cycle: propagation, selection by resampling (Theorem 3 ), and regularized inversion (Theorems 4–6); the supervisor accepts the repair or abstains (Proposition 1). Dashed arrows carry diagnostics and the control signal. (b) The comparison system majorizing η k = W 1 ( H k + , H k ⋆ , + ) \eta_k = W_1(H_k^+, H_k^{\star,+}) η k = W 1 ( H k + , H k ⋆ , + ) : the recursion η k + 1 ≤ a ˉ 2 η k + B k + 1 θ \eta_{k+1} \le\bar{a}^2\eta_k + \mathcal{B}_{k+1}^{\theta} η k + 1 ≤ a ˉ 2 η k + B k + 1 θ has pole a ˉ 2 < 1 \bar{a}^2 < 1 a ˉ 2 < 1 (Theorem 8 (a)); it depicts an upper bound, not the error dynamics.
Scope note. The ideal object is the propagation spectrum with resampling distortion removed; no Bayesian posterior contraction is involved and end-to-end filtering accuracy remains outside the claims. The per-step budget carries the resolution ceiling of § 3.4 , written B k ϑ : = max { ϑ , B k } B^{\vartheta}_{k} := \max\{\vartheta,B_{k}\} B k ϑ := max { ϑ , B k } where the ceiling is visible.
Setting. x k + 1 = a k x k + ξ k x_{k+1} = a_{k}x_{k} + \xi_{k} x k + 1 = a k x k + ξ k , Cov ( ξ k ) = q k I \operatorname{Cov}(\xi_{k}) = q_{k}I Cov ( ξ k ) = q k I , ∣ a k ∣ ≤ a ˉ < 1 |a_{k}| \le\bar{a} < 1 ∣ a k ∣ ≤ a ˉ < 1 , 0 < q min ≤ q k ≤ q max 0 < q_{\min} \le q_{k} \le q_{\max} 0 < q m i n ≤ q k ≤ q m a x . Propagation is spectrally exact with no freeness assumption: Σ k + 1 − = a k 2 Σ k + q k I \Sigma_{k+1}^{-} = a_{k}^{2}\Sigma_{k} + q_{k}I Σ k + 1 − = a k 2 Σ k + q k I shares the eigenbasis of Σ k \Sigma_{k} Σ k , so H k + 1 − = ( D a k 2 ) # H k + ⊞ δ q k H^{-}_{k+1} = (D_{a_{k}^{2}})_{\#}H^{+}_{k} \boxplus\delta_{q_{k}} H k + 1 − = ( D a k 2 ) # H k + ⊞ δ q k . The corrected cycle is summarized in Figure 1 .
Theorem 8 Full-cycle recursion Assume (i) scalar dynamics as above; (ii) (W2) at each step with sup k ≤ K r 2 ( ρ k ) < ∞ \sup_{k\le K} r_2(\rho_k) < \infty sup k ≤ K r 2 ( ρ k ) < ∞ , the time-uniform statements additionally requiring the envelope of (b′); (iii) correction at each step within a uniformly identifiable region, κ i n v , k ( θ ) ≥ κ 0 > 0 \kappa_{\mathrm{inv},k}^{(\theta)} \ge\kappa_0 > 0 κ inv , k ( θ ) ≥ κ 0 > 0 at a fixed θ \theta θ ; (iv) (G1)–(G4) at each step; (v) a common interval [ a , b ] [a,b] [ a , b ] positively invariant under the recursion, which holds when a ≤ q min a \le q_{\min} a ≤ q m i n and b ≥ max { sup supp ( H 0 + ) , q max / ( 1 − a ˉ 2 ) } b \ge\max\{\sup\operatorname{supp}(H_0^+), q_{\max}/(1-\bar{a}^2)\} b ≥ max { sup supp ( H 0 + ) , q m a x / ( 1 − a ˉ 2 )} .
Define the ideal laws H k + 1 ⋆ , − = ( D a k 2 ) # H k ⋆ , + ⊞ δ q k H_{k+1}^{\star,-} = (D_{a_k^2})_{\#}H_k^{\star,+} \boxplus\delta_{q_k} H k + 1 ⋆ , − = ( D a k 2 ) # H k ⋆ , + ⊞ δ q k together with H k ⋆ , + : = H k ⋆ , − H_k^{\star,+} := H_k^{\star,-} H k ⋆ , + := H k ⋆ , − , and set η k : = W 1 ( H k + , H k ⋆ , + ) \eta_k := W_1(H_k^+, H_k^{\star,+}) η k := W 1 ( H k + , H k ⋆ , + ) .
(a) Error recursion: η k + 1 ≤ a ˉ 2 η k + B k + 1 θ \eta_{k+1} \le\bar{a}^2\eta_k + \mathcal{B}_{k+1}^{\theta} η k + 1 ≤ a ˉ 2 η k + B k + 1 θ , using W 1 ( ( D t ) # μ , ( D t ) # ν ) = t W 1 ( μ , ν ) W_1((D_t)_{\#}\mu,(D_t)_{\#}\nu) = tW_1(\mu,\nu) W 1 (( D t ) # μ , ( D t ) # ν ) = t W 1 ( μ , ν ) and the shift isometry.
(b) Fixed horizon: for any fixed K K K , as min k ≤ K N k → ∞ \min_{k\le K}N_k \to\infty min k ≤ K N k → ∞ one has B k + 1 = o p ( 1 ) \mathcal{B}_{k+1} = o_p(1) B k + 1 = o p ( 1 ) uniformly for k ≤ K k \le K k ≤ K (this statement concerns the uncapped budget; the caps B k + 1 θ \mathcal{B}_{k+1}^{\theta} B k + 1 θ used in the recursion below are bounded below by θ \theta θ and do not tend to zero), and η K ≤ a ˉ 2 K η 0 + ∑ j < K a ˉ 2 ( K − 1 − j ) B j + 1 θ \eta_K \le\bar{a}^{2K}\eta_0 + \sum_{j<K}\bar{a}^{2(K-1-j)}\mathcal{B}_{j+1}^{\theta} η K ≤ a ˉ 2 K η 0 + ∑ j < K a ˉ 2 ( K − 1 − j ) B j + 1 θ .
(b′) Long horizon: if a time-uniform envelope B k ≤ b k \mathcal{B}_k \le b_k B k ≤ b k holds simultaneously with probability tending to one and sup k b k < ∞ \sup_k b_k < \infty sup k b k < ∞ , then
lim sup k η k ≤ max { θ , sup k b k } 1 − a ˉ 2 . (10) \limsup_k \eta_k \le\frac{\max\{\theta,\sup_k b_k\}}{1-\bar{a}^2}. \tag*{(10)} k lim sup η k ≤ 1 − a ˉ 2 max { θ , sup k b k } . (10) If moreover b k → 0 b_k \to0 b k → 0 , the bound reduces to θ / ( 1 − a ˉ 2 ) \theta/(1-\bar{a}^2) θ / ( 1 − a ˉ 2 ) . This is a floor of the certified bound, not of the error: as N k N_k N k increases the certificate descends to the resolution scale at which the conditioning statement holds and no further, while the error itself may be smaller. The floor is intrinsic, since θ ↓ 0 \theta\downarrow0 θ ↓ 0 leaves the modulus δ θ \delta_\theta δ θ unbounded below and the budget diverges; θ \theta θ cannot be recovered from the data. A per-time o p ( 1 ) o_p(1) o p ( 1 ) statement does not yield time-uniform control, so the two horizons are stated separately.
Proof. See Section S-I of the supplementary material.
The cost of abstention
Proposition 1 Cost of abstention. In the setting of Theorem 8 , let A A A be the supervisor’s abstention set and define the geometric abstention load Λ K : = ∑ j ∈ A ∩ [ 1 , K ] α ˉ 2 ( K − j ) \Lambda_K := \sum_{j\in A\cap[1,K]} \bar{\alpha}^{2(K-j)} Λ K := ∑ j ∈ A ∩ [ 1 , K ] α ˉ 2 ( K − j ) . Then
η K ≤ α ˉ 2 K η 0 + ∑ j = 1 K α ˉ 2 ( K − j ) [ b j 1 { j ∉ A } + δ f b , j 1 { j ∈ A } ] , (11) \eta_K \le\bar{\alpha}^{2K}\eta_0+\sum_{j=1}^{K}\bar{\alpha}^{2(K-j)}\left[b_j\mathbf{1}_{\{j\notin A\}}+\delta_{\mathrm{fb},j}\mathbf{1}_{\{j\in A\}}\right], \tag*{(11)} η K ≤ α ˉ 2 K η 0 + j = 1 ∑ K α ˉ 2 ( K − j ) [ b j 1 { j ∈ / A } + δ fb , j 1 { j ∈ A } ] , (11) where b j b_j b j and δ f b , j \delta_{\mathrm{fb},j} δ fb , j are the per-step budgets of corrected and fallback steps, each carrying the resolution ceiling of § 3.4 . Consequently: (i) A = ∅ A=\varnothing A = ∅ recovers Theorem 8 . (ii) If sup k b k ≤ b ˉ \sup_k b_k\le\bar{b} sup k b k ≤ b ˉ and sup k δ f b , k ≤ δ ˉ \sup_k\delta_{\mathrm{fb},k}\le\bar{\delta} sup k δ fb , k ≤ δ ˉ , then with both budgets capped and b ˉ θ : = max { θ , b ˉ } \bar{b}^{\theta}:=\max\{\theta,\bar{b}\} b ˉ θ := max { θ , b ˉ } , δ ˉ θ : = max { θ , δ ˉ } \bar{\delta}^{\theta}:=\max\{\theta,\bar{\delta}\} δ ˉ θ := max { θ , δ ˉ } ,
lim sup K η K ≤ b ˉ θ 1 − α ˉ 2 + ( δ ˉ θ − b ˉ θ ) lim sup K Λ K , Λ K ≤ 1 − α ˉ 2 K 1 − α ˉ 2 . \limsup_K\eta_K\le\frac{\bar{b}^{\theta}}{1-\bar{\alpha}^2}+(\bar{\delta}^{\theta}-\bar{b}^{\theta})\limsup_K\Lambda_K,\qquad\Lambda_K\le\frac{1-\bar{\alpha}^{2K}}{1-\bar{\alpha}^2}. K lim sup η K ≤ 1 − α ˉ 2 b ˉ θ + ( δ ˉ θ − b ˉ θ ) K lim sup Λ K , Λ K ≤ 1 − α ˉ 2 1 − α ˉ 2 K . (iii) If b k → 0 b_k\to0 b k → 0 and Λ K → 0 \Lambda_K\to0 Λ K → 0 then lim sup K η K ≤ θ / ( 1 − α ˉ 2 ) \limsup_K\eta_K\le\theta/(1-\bar{\alpha}^2) lim sup K η K ≤ θ / ( 1 − α ˉ 2 ) , the resolution floor of Theorem 8 (b′): the operative condition for approaching that floor is vanishing geometric load, not merely A K = o ( K ) A_K=o(K) A K = o ( K ) , because abstentions clustered at the end of the horizon are fully felt, while the floor itself is not removed by any abstention schedule. (iv) If H k θ , + ∉ H a , b H_k^{\theta,+}\notin\mathcal{H}_{a,b} H k θ , + ∈ / H a , b , every algorithm constrained to H a , b \mathcal{H}_{a,b} H a , b incurs error at least dist W 1 ( H k θ , + , H a , b ) \operatorname{dist}_{W_1}(H_k^{\theta,+},\mathcal{H}_{a,b}) dist W 1 ( H k θ , + , H a , b ) at that step, so abstention is necessary for any algorithm so constrained whenever this distance exceeds δ f b , k \delta_{\mathrm{fb},k} δ fb , k : the abstention rule is not conservatism but a feasibility constraint of the candidate class.
Proof. See Section S-I of the supplementary material. Without correction each selection injects a further multiplicative factor: along successive pure distortion segments the zero mass obeys the maximum-atom rule rather than additive accumulation, and intervening propagation may alter the relation, so no closed long-time formula is claimed. The corrected recursion instead resets the spectrum to a B k θ \mathcal{B}^{\theta}_k B k θ -neighbourhood of H − H^{-} H − at each step; the contrast between compounding and resetting is the comparative hypothesis of the experiments of § 5.4 .
The corrected filtering step
The observation is absorbed exactly once, at the weight update; every later stage consumes information only through weights, spectra, or closed-form diagnostics (Figure 1 ). A trigger can short-circuit the correction and the supervisor can abstain once the diagnostics are measured, every trigger and abstention being logged by a reason code. The complete step-by-step specification is given in § 17.3 of the supplementary material. The per-step cost is O ( d 3 + N d 2 ) O(d^3+Nd^2) O ( d 3 + N d 2 ) , the same order as an ensemble Kalman step and without Sinkhorn-type O ( N 2 ) O(N^2) O ( N 2 ) cost; the forward-map solver passes seven unit tests on the upper-half-plane branch, including a fixed-point residual below 3 × 10 − 13 3\times10^{-13} 3 × 1 0 − 13 (§ 17.1 of the supplementary material).
The recovered spectrum enters only through the preconditioner, and the lift is used only where the empirical eigenbasis is usable and the posterior anisotropy nontrivial; outside that regime the identity preconditioner is competitive or better and the abstention rule decides.
Numerical experiments
Pre-registration and provenance protocol
Every figure and table below answers one pre-registered question: targets, sample sizes, repetition counts and acceptance criteria were frozen before the runs, and every printed number is traceable through a four-level chain in the deviation ledger. The discrepancy follows Remark 3 with h = 0.03 ξ h i h = 0.03\xi_{\mathrm{hi}} h = 0.03 ξ hi and n x = 160 n_x = 160 n x = 160 , or h = 0.01 ξ h i h = 0.01\xi_{\mathrm{hi}} h = 0.01 ξ hi and h = 0.003 ξ h i h = 0.003\xi_{\mathrm{hi}} h = 0.003 ξ hi in the activation study and n x = 400 n_x = 400 n x = 400 , h = 0.01 ξ h i h = 0.01\xi_{\mathrm{hi}} h = 0.01 ξ hi in the strong-anisotropy cells; candidate spectra lie on an equispaced grid over [ a , b ] = [ 0.2 , 2.6 ] [a,b] = [0.2, 2.6] [ a , b ] = [ 0.2 , 2.6 ] with step 0.05 0.05 0.05 , or 0.025 0.025 0.025 in the cycle experiments. Code, data and the ledger are archived at https://doi.org/10.5281/zenodo.23415148 (§ 17.2 of the supplementary material).
The correspondence between each theoretical object and the evidence bearing on it, with the range that evidence supports, is tabulated in § 16.11 of the supplementary material.
Static spectral distortion and repair (EXP-1)
Question. Does resampling distort the spectrum as predicted, and does the plug-in inversion recover the pre-distortion spectrum? The configuration uses H 0 = 0.7 δ 0.5 + 0.3 δ 2.5 H_0 = 0.7\delta_{0.5} + 0.3\delta_{2.5} H 0 = 0.7 δ 0.5 + 0.3 δ 2.5 , c = 0.75 c = 0.75 c = 0.75 , N ∈ { 500 , 1000 , 2000 } N \in\{500, 1000, 2000\} N ∈ { 500 , 1000 , 2000 } , R = 50 R = 50 R = 50 , with Gamma weights for α ∈ { 10 , 1 , 0.3 } \alpha\in\{10, 1, 0.3\} α ∈ { 10 , 1 , 0.3 } , all exogenous and satisfying (G4).
Forward law. The post-resampling spectra match H 0 ⊠ T c ( ν ) H_0 \boxtimes T_c(\nu) H 0 ⊠ T c ( ν ) at every level (Figure 2 (a)), including the zero-atom mass: 0.33325 against 0.33333 for multinomial and 0.24099 against 0.24311 for residual. The second spectral moments follow Corollary 2 (Figure 2 (b)), four of six groups inside two standard errors with a small negative bias for the two heavy-tailed groups.
Figure 2. Static spectral distortion and repair (EXP-1). (a) Post-resampling ESD against H 0 ⊠ T c ( ν ) H_0 \boxtimes T_c(\nu) H 0 ⊠ T c ( ν ) for both schemes at N = 2000 N = 2000 N = 2000 , α = 1 \alpha= 1 α = 1 ; markers compare the empirical zero atom (o) with the closed form (x) [Theorem 3 , Corollary 1]. (b) Second spectral moment against the predicted count moment for the six groups; the line is Corollary 2(4). (c) Median W 1 W_1 W 1 inversion error against N N N for the three inverters (solid: multinomial; dashed: residual; bars: interquartile range); the dotted line is the limit of the uncorrected spectrum [Theorem 4].
Persistent bias and inversion. The no-correction baseline converges to W 1 ( H 0 ⊠ T , H 0 ) W_1(H_0 \boxtimes T, H_0) W 1 ( H 0 ⊠ T , H 0 ) , positive and not decreasing with N N N (Figure 2 (c)). All three inverters reduce the error by an order of magnitude: at α = 1 \alpha= 1 α = 1 the bootstrap log-log slopes are − 0.49 -0.49 − 0.49 and − 0.40 -0.40 − 0.40 (oracle), − 0.43 -0.43 − 0.43 and − 0.61 -0.61 − 0.61 (conditional plug-in), − 0.65 -0.65 − 0.65 and − 1.02 -1.02 − 1.02 (realized count) for multinomial and residual resampling, all with confidence intervals bounded away from zero, so the realized-count inverter decays faster than N − 1 / 2 N^{-1/2} N − 1/2 . At N = 2000 N = 2000 N = 2000 the errors are 0.769/0.705 without correction against 0.034/0.020 for the realized-count inverter. Ledoit–Wolf nonlinear shrinkage [32 ] improves on the uncorrected spectrum but stays a factor of 4.3 to 6.2 behind every structure-aware inverter, because it assigns uniform mass to the null space where the count-rank identity restores the spectrum exactly; the baseline is model-free, so the gap measures the value of the count-law structure rather than a like-for-like contest.
Identifiability and conditioning diagnostics (EXP-2)
Mismatch diagnostic. Nine settings are compared at N = 2000 N = 2000 N = 2000 , c = 0.75 c = 0.75 c = 0.75 , R = 50 R = 50 R = 50 (Figure 3 (a)); p p p -values are one-sided Mann–Whitney tests against the correct multinomial baseline, whose median statistic is 2.55 × 10 − 3 2.55 \times10^{-3} 2.55 × 1 0 − 3 . The statistic stays at this level for correct residual resampling (2.27 × 10 − 3 2.27 \times10^{-3} 2.27 × 1 0 − 3 , p = 0.88 p = 0.88 p = 0.88 ) and fires in two settings: the wrong mechanism (2.76 × 10 − 2 2.76 \times10^{-2} 2.76 × 1 0 − 2 , p = 3.5 × 10 − 18 p = 3.5 \times10^{-18} p = 3.5 × 1 0 − 18 ) and strongly correlated particles at ρ = 0.9 \rho= 0.9 ρ = 0.9 (5.61 × 10 − 3 5.61 \times10^{-3} 5.61 × 1 0 − 3 , p = 4.4 × 10 − 16 p = 4.4 \times10^{-16} p = 4.4 × 1 0 − 16 ), which are the two settings where the median inversion error grows most, by factors of 5.5 and 4.0. It is dormant elsewhere. For endogenous weights depending on a q q q -dimensional projection with q = 10 q = 10 q = 10 , covered by Proposition S2 of the supplementary material, the error is unchanged and there is nothing to detect; at q = 750 q = 750 q = 750 , where q / d = 0.5 q/d = 0.5 q / d = 0.5 lies outside that proposition, and for ρ = 0.5 \rho= 0.5 ρ = 0.5 , dormancy coincides with a moderate error increase, by factors of 1.22 and 1.35. This is the scope of Theorem 5: the diagnostic tests consistency with the forward model, not estimation error, and a mild violation that keeps the observed spectrum close to the image of the forward map shifts the estimate without raising the residual (§ 3.4 ). It detected every violation that inflated the error severalfold and missed only those that inflated it by at most 35%.
Figure 3. Diagnostics for EXP-2. (a) Mismatch statistic across the nine settings against the correct multinomial baseline [Theorem 5; a consistency diagnostic, not an exogeneity test]. (b) Inversion error against the zero-atom mass, colored by the estimated condition number [Theorem 6, Remark 4].
Identifiability. The condition number is driven by the zero-atom mass: the Spearman correlation of κ ^ i n v \hat{\kappa}_{\mathrm{inv}} κ ^ inv is − 0.931 -0.931 − 0.931 against that mass and − 0.817 -0.817 − 0.817 against ∣ c − p s ∣ |c-p_s| ∣ c − p s ∣ , and that of the inversion error against κ ^ i n v \hat{\kappa}_{\mathrm{inv}} κ ^ inv is − 0.684 -0.684 − 0.684 . At the boundary c ≈ p s c \approx p_s c ≈ p s the inversion is well conditioned, which confirms that the boundary is where the atom is born rather than the mechanism of ill-conditioning (Remark 4); the pre-registered prediction was revised accordingly.
Where conditioning enters. At the map level the condition number degrades toward large c c c and heavy-tailed weights, where the zero atom is largest; the discretization, optimizer and bandwidth of the pipeline amplify that degradation. Section S-K of the supplementary material separates the two levels on the two-point candidate family in floating point, not as certified bounds, and no constant from it enters any theorem. The comparative clause activates only on part of the ( c , α ) (c,\alpha) ( c , α ) grid, not at the deployment setting of EXP-3 (§ 5.5 ).
Rejuvenation and stable full-cycle behavior (EXP-3)
Question. Does the corrected spectrum improve Metropolis proposal geometry without moving the target, and does the full-cycle error accumulate? The cycle uses x k + 1 = 0.8 x k + ξ k x_{k+1} = 0.8x_k + \xi_k x k + 1 = 0.8 x k + ξ k , ξ k ∼ N ( 0 , 0.2 I d ) \xi_k \sim\mathcal{N}(0, 0.2I_d) ξ k ∼ N ( 0 , 0.2 I d ) , d = 750 d = 750 d = 750 , N = 1000 N = 1000 N = 1000 , k = 0 , … , 32 k = 0, \ldots, 32 k = 0 , … , 32 , R = 20 R = 20 R = 20 , with exogenous weight schedules α k = 3 \alpha_k = 3 α k = 3 and degeneration shocks at k ∈ { 8 , 16 , 24 } k \in\{8, 16, 24\} k ∈ { 8 , 16 , 24 } . Table 2 reports the Metropolis preconditioning results.
Table 2. Metropolis preconditioning in Regime A (d = 225 d = 225 d = 225 , c = 0.15 c = 0.15 c = 0.15 , κ ( Σ ) = 50 \kappa(\Sigma) = 50 κ ( Σ ) = 50 , r o b s = 200 r_{\mathrm{obs}} = 200 r obs = 200 ): condition number of the preconditioned posterior covariance, slowest-direction ESS per step, acceptance rate, ESS per second, and maximum ∣ z ∣ |z| ∣ z ∣ of the target-displacement test. Target preservation and mixing constants: Lemma 6, Theorem 7.
The median η k = W 1 ( H k + , H k ⋆ , + ) \eta_k = W_1(H_k^{+}, H_k^{\star,+}) η k = W 1 ( H k + , H k ⋆ , + ) over the 20 repetitions (Figure 4 (a)) is 0.698/0.749/0.629 (initial/peak/final) without correction, against 0.058/0.150/0.045 for conditional plug-in, 0.059/0.152/0.047 for oracle and 0.058/0.150/0.056 for plug-in with supervisor, the last with 26 abstentions all from the mismatch clause. Corrected trajectories are bounded, recover within about three steps after each shock, and satisfy Theorem 8 (a) on 100% of steps when the per-step term is the realized correction error W 1 ( H ^ k , H k − ) W_1(\widehat{H}_k, H_k^{-}) W 1 ( H k , H k − ) against the known population spectrum, which checks the propagation structure, not the estimated budget B ^ N \widehat{B}_N B N (Remark 3). The uncorrected trajectory stagnates at a positive plateau, the predicted compounding-versus-resetting contrast discussed after Proposition 1
Figure 4. Full-cycle behavior (EXP-3). (a) Median error η k = W 1 ( H k + , H k ⋆ , + ) \eta_k = W_1(H_k^{+}, H_k^{\star,+}) η k = W 1 ( H k + , H k ⋆ , + ) over 20 repetitions for the four methods; red lines mark the weight shocks Theorem 8 (a). (b) Forced abstention at equal count A K = 6 A_K = 6 A K = 6 , clustered or spread. (c) Error against the geometric abstention load Λ k \Lambda_k Λ k with the bound of Proposition 1.
Between shocks the corrected trajectories settle near 0.045 and peak near 0.15. The plateau is governed by the fixed-N N N per-step budgets, whose median realized value is 0.048, not by the resolution floor of Theorem 8 (b′); the resolution scale enters that theorem only through an upper bound, so no value of θ \theta θ is inferred from these data.
Abstention-cost law. The forced-abstention control uses identical counts A K = 6 A_K = 6 A K = 6 in two schedules: clustered at the end (geometric load Λ K = 2.587 \Lambda_K = 2.587 Λ K = 2.587 , median η 32 = 0.631 \eta_{32} = 0.631 η 32 = 0.631 ) against spread (Λ K = 0.459 \Lambda_K = 0.459 Λ K = 0.459 , median 0.244), significant at p = 9.5 × 10 − 7 p = 9.5 \times10^{-7} p = 9.5 × 1 0 − 7 (one-sided Wilcoxon) with all 20 repetitions in the predicted direction. The cost of abstention is governed by the geometric load, not by the count, which verifies Proposition 1 directly.
Regime A uses d = 225 d = 225 d = 225 , c = 0.15 c = 0.15 c = 0.15 , κ ( Σ ) = 50 \kappa(\Sigma) = 50 κ ( Σ ) = 50 , r o b s = 200 r_{\mathrm{obs}} = 200 r obs = 200 . At matched acceptance (≈ 0.237 \approx0.237 ≈ 0.237 , close to the asymptotically optimal 0.234 for random-walk proposals [47 ] ), the lifted preconditioner attains approximately 90% of the oracle’s slowest-direction ESS per step, so the gains appear in mixing efficiency rather than in acceptance; the global null of no target displacement is not rejected at the 0.05 level (Šidák-adjusted p = 0.059 p = 0.059 p = 0.059 ).
Supervisor mechanics and robustness
The comparative clause is a safety net rather than an active rule: its activation region lies at mid-to-high c c c , above the deployment setting of EXP-3, so it never fires and has no true positives there, and all 26 abstentions are mismatch detections (§ 5.3 ). An earlier standalone condition-number threshold abstained 127 times, clustered at the shock steps; the comparative rule reduced this to 26 without changing the peak error of 0.150.
Three measured qualifications apply. The monitor experiment is negative: under degeneration shocks the ESS falls by a factor of 3.23 in synchrony with the zero-atom mass, contradicting the pre-registered prediction of ESS-blind spectral alarms, so the spectral diagnostics complement the ESS rather than replace it. The centred-statistic slope test of Corollary 2(4) fails at − 8 % -8\% − 8% against a 2% tolerance, because heavy-tailed weights amplify the rank-one centering gap of Lemma 1(iv); the conditional-moment tests remain unbiased. Finally, a fixed schedule γ N = γ 0 / N \gamma_N = \gamma_0/N γ N = γ 0 / N does not adapt to the scale of H H H and degraded the strong-anisotropy fit to W 1 = 2.51 W_1 = 2.51 W 1 = 2.51 against 0.19, which is why the scale-free schedule is recommended.
The certificate as an online monitor
The mismatch residual of Theorem 5 is not a post hoc summary. It is recomputed at every step from quantities the filter already holds, so it can be logged and watched while the filter runs, at no additional asymptotic cost. Figure 5 shows the single supervised run of EXP-3 read this way: the residual rises as the ensemble degenerates and falls at each weight shock, where the mixture of information across the shock makes the observed spectrum locally easier to represent. The residual tracks the estimated condition number of panel (c), which is the mechanism of Remark 4, and it does so without access to the population spectrum: the drop at each shock is computed from the weights and the observed spectrum alone.
Figure 5. The mismatch certificate as an online quantity, from the supervised run of EXP-3. (a) The mismatch residual recomputed at each filter step, with the steps at which the supervisor abstained marked. (b) Effective sample size; dotted lines mark the weight shocks. (c) Estimated condition number κ ^ i n v \hat{\kappa}_{\mathrm{inv}} κ ^ inv . The residual and the condition number move together, and both respond to the shocks, without either having access to the population spectrum.
Two limits of this reading are recorded. First, the residual is a consistency statistic, not an error estimate: at every step of the run the median residual is between 0.0047 and 0.0119, while the actual error η k \eta_k η k ranges over an order of magnitude more. A rising residual says that the forward model is being strained, not how far the estimate has moved. Second, the residual is not an alarm in the sense the negative result of § 5.5 rules out: it responds to weight degeneration as the ESS does, so on these data the two are redundant as alarms and complementary only in what they measure. What the step-by-step record adds is the object of the alarm. The ESS reports that the ensemble has degenerated; the residual reports that the distortion law the repair divides out is no longer being matched, which is the quantity the repair itself depends on.
Departures from Gaussian fluctuations (EXP-4)
Every theorem above assumes Gaussian entries in (G3), and universality is left open. This experiment does not prove universality; it locates the boundary empirically. The design changes one object, the law of the fluctuation matrix Z N Z_N Z N , and holds the weights, the realized counts and the estimation grid fixed, so the comparison is paired. Four laws are used: Gaussian, Rademacher (± 1 \pm1 ± 1 ), and Student t t t with five and three degrees of freedom, each rescaled to unit variance so that (G2) still holds.
The forward law survives all four (Figure 6 (a)). At N = 2000 N = 2000 N = 2000 the empirical zero-atom mass lies within 0.0052 of the closed form for every law and both schemes, and in particular does not drift as the tail is made heavier; the second spectral moment stays within 2.4% of Corollary 2(4) throughout, against 0.5% for Gaussian entries. The repair degrades in a way that is specific to the law (Figure 6 (b)). Against the Gaussian reference at the same seed, the median inversion error of the conditional plug-in inverter under multinomial resampling is essentially unchanged for Rademacher entries (ratio 0.99 at N = 2000 N = 2000 N = 2000 ) and for t 5 t_5 t 5 (1.01), but rises by a factor of 1.95 for t 3 t_3 t 3 at N = 500 N = 500 N = 500 and 2.46 at N = 2000 N = 2000 N = 2000 . The factor does not decrease over this range, so no rate is claimed: the degradation is a property of the finite-N N N fluctuation law, and the consistency of Theorem 4 concerns the pair ( ε N , δ N ) (\varepsilon_N, \delta_N) ( ε N , δ N ) under (G3) rather than this ratio.
Figure 6. Departures from Gaussian fluctuations (EXP-4), paired by seed, weights and counts. (a) Empirical zero atom against the closed form of Corollary 2(1), all four laws and both schemes, at N = 500 N = 500 N = 500 and N = 2000 N = 2000 N = 2000 ; the dashed line is equality. (b) Median W 1 W_1 W 1 inversion error per law at both ensemble sizes, conditional plug-in inverter, multinomial resampling. (c) The mismatch residual against ensemble size; the four curves agree to within 8%, so a departure from Gaussianity is not what the certificate detects.
The certificate does not report this degradation (Figure 6 (c)). Its median is within 8% of the Gaussian value for every law at both ensemble sizes, and the largest deviation, for t 3 t_3 t 3 , is a small decrease . This is the documented scope of Theorem 5 rather than a defect: the residual measures mismatch between the observed spectrum and the image of the forward map, and a heavy-tailed fluctuation law that leaves the limiting spectrum close to that image is not a mismatch in this sense. The experiment therefore delimits the claim. The forward law is robust to the law of Z N Z_N Z N at the level of the limiting spectrum; the quantitative budget is not, since it inherits a factor of about two under t 3 t_3 t 3 ; and the certificate is a test of the distortion law, not of the fluctuation law, so it stays silent exactly where the second bullet of § 6.1 says it must.
Limitations and conclusion
Boundaries of applicability
Gaussian fluctuations. Theorem 3 is proved for Gaussian entries; universality under finite ( 4 + δ ) (4+\delta) ( 4 + δ ) moments is open, and § 5.7 locates the boundary empirically: the limiting spectral law survives Rademacher and Student-t t t entries, the quantitative error budget does not, inheriting a factor of about two under t 3 t_3 t 3 , and the mismatch certificate does not respond because it tests the distortion law rather than the fluctuation law.
Exogeneity. Assumption (G4) is indispensable in general: likelihood-driven weights coupled to the full state break the two-channel factorization. A partial relaxation is proved separately for weights depending on a low-dimensional projection, and the mismatch diagnostic is not a test of exogeneity: it can stay dormant where the inversion error rises moderately (§ 5.3 ).
Finite resolution and dynamics. Quantitative statements hold at the resolution scale θ \theta θ , with the certified full-cycle floor θ / ( 1 − a ˉ 2 ) \theta/(1-\bar{a}^{2}) θ / ( 1 − a ˉ 2 ) ; the closed recursion is proved for scalar stable dynamics, time-uniform claims require a time-uniform envelope, and stability under general or unstable dynamics is not claimed: for a ˉ ≥ 1 \bar{a} \ge1 a ˉ ≥ 1 the error accumulates unless B k B_k B k decays at a compensating rate.
Preconditioner regime. The lifted preconditioner pays off only at low c c c with nontrivial posterior anisotropy; outside that regime the identity preconditioner is competitive or better.
Resampling repairs weight degeneracy at a spectral cost that is, in the high-dimensional regime, computable. This paper shows that the cost is also reparable: within an explicitly identifiable and exogenous regime, resampling-induced spectral distortion can be regularized and locally inverted, with an explicit local error budget and a certified mismatch diagnostic. The repaired spectrum is used only as a Metropolis-adjusted preconditioner, so it can improve proposal geometry without changing the invariant target. Under scalar stable dynamics the full-cycle error budget is geometrically summable, with the certified bound descending to the resolution floor at which the conditioning statement holds; under general dynamics full-cycle stability is not claimed, and we instead quantify the cost of supervisory abstention through the geometric abstention load. The corrected filtering step of § 4.5 and the pre-registered experiments of § 5 support these claims at every level at which they are stated: the forward distortion is computable, the repair is consistent and budgeted, the mismatch is certifiable, and the supervisor’s abstentions are safe and costed.
Funding
This work was supported by the Science and Technology Planning Project of Guangdong Province, China [grant number 2025A0505010006]; the Joint Research Funding Program between the Macao Science and Technology Development Fund (FDCT) and the Department of Science and Technology of Guangdong Province [grant number 0108/2024/AGJ]; and Macao Polytechnic University [grant number RP/FCA-09/2025]. The funders had no role in study design, data collection and analysis, interpretation, writing of the report, or the decision to submit the article for publication.
CRediT authorship contribution statement
Deming Song: Conceptualization, Methodology, Software, Formal analysis, Investigation, Writing – original draft, Visualization. Chi-Kin Lam: Supervision, Funding acquisition, Writing – review & editing, Project administration. Kefeng Li: Validation, Writing – review & editing. Hui Yu: Resources, Validation. Xilin Li: Resources, Validation. Huagang Lin: Resources, Validation.
Data availability
Pre-registered code, data snapshots, and the deviation ledger are archived at Zenodo, https://doi.org/10.5281/zenodo.23415148 . The implementation and experiment scripts are available at https://github.com/songming-teaching/spectral-repair-resampling .
Supplementary material
The supplementary material is organised in three parts. Part I gives the proofs of every result stated in the main text, in Sections S-A to S-L, and follows the order of the theorems: the centering lemma (S-A), the count laws (S-B), continuity of the spectral map (S-C), the random-environment spectral law with its two corollaries (S-D), the structure of the forward map and the plug-in lemma, including the Proposition S1 modulus bound and the analysis of where the degradation lives (S-E), and then the consistency budget, the mismatch certificate and the target-preservation and full-cycle proofs (S-F to S-I). Sections S-K and S-L carry the numerical conditioning study on the two-point family and the low-rank relaxation of the exogeneity assumption. Part II holds the experimental sections S1 to S11, with the count-law checks, the complete comparison for Corollary 2, the inversion sensitivity and fallback studies, the Ledoit–Wolf baseline, the phase diagrams and supervisor audit table, the Metropolis–Hastings details, the activation zone of the comparative clause, the out-of-scope stress test with endogenous weights, the passive monitor experiment, and the theory–evidence correspondence table of Section S11. Part III contains the solver validation protocol (P1), the reproducibility protocol (P2) and the complete step-by-step specification of the filtering step (P3). Theorem, lemma, proposition and section numbers without a prefix refer to the main text. In this arXiv version the supplement follows the references, and both parts use the same reference list.
Declaration of competing interest
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
Supplementary Material for Certifiable inversion of resampling-induced spectral distortion in high-dimensional particle filters
Deming Song; Chi-Kin Lam; Kefeng Li; Hui Yu; Xilin Li; Huagang Lin
This supplement has three parts. Part I contains the detailed proofs of the results stated in the main text; its sections S-A to S-L are the targets of the main text’s pointers to proofs. Part II contains the experimental sections S1 to S11, with the registered protocols and the complete numerical detail. Part III contains the solver validation, reproducibility and algorithm specifications P1 to P3. Theorem, lemma, proposition and section numbers without a prefix refer to the main text. The reference list is shared with the main text and appears immediately before this supplement. No statement in this supplement extends the scope of the main-text claims.
Part I. Detailed proofs
S-A. Proof of Lemma 1 (centering)
Recall m ^ = ∑ i w i x i = X w \hat{m} = \sum_i w_i x_i = Xw m ^ = ∑ i w i x i = X w , m ^ r = 1 N X n \hat{m}_r = \frac{1}{N}Xn m ^ r = N 1 X n , C n = Cov ( n ∣ X , w ) C_n = \operatorname{Cov}(n \mid X,w) C n = Cov ( n ∣ X , w ) , B n = Cov ( m ^ r ∣ X , w ) = 1 N 2 X C n X ⊤ B_n = \operatorname{Cov}(\hat{m}_r \mid X,w) = \frac{1}{N^2}XC_nX^{\top} B n = Cov ( m ^ r ∣ X , w ) = N 2 1 X C n X ⊤ .
Part (i)
By (A2), E [ m ^ r ∣ X , w ] = 1 N X E [ n ∣ X , w ] = X w = m ^ \mathbb{E}[\hat{m}_r \mid X,w] = \frac{1}{N}X\mathbb{E}[n \mid X,w] = Xw = \hat{m} E [ m ^ r ∣ X , w ] = N 1 X E [ n ∣ X , w ] = X w = m ^ . Also
E [ S r u ∣ X , w ] = 1 N ∑ i E [ n i ∣ X , w ] x i x i ⊤ = ∑ i w i x i x i ⊤ = S w u . \mathbb{E}[S_r^u \mid X,w] = \frac{1}{N}\sum_i \mathbb{E}[n_i \mid X,w]x_i x_i^{\top} = \sum_i w_i x_i x_i^{\top} = S_w^u. E [ S r u ∣ X , w ] = N 1 i ∑ E [ n i ∣ X , w ] x i x i ⊤ = i ∑ w i x i x i ⊤ = S w u .
Therefore
E [ S r c ∣ X , w ] = E [ S r u ∣ X , w ] − E [ m ^ r m ^ r ⊤ ∣ X , w ] = S w u − m ^ m ^ ⊤ − Cov ( m ^ r ∣ X , w ) = S w c − B n . \mathbb{E}[S_r^c \mid X,w] = \mathbb{E}[S_r^u \mid X,w] - \mathbb{E}[\hat{m}_r\hat{m}_r^{\top} \mid X,w] = S_w^u - \hat{m}\hat{m}^{\top} - \operatorname{Cov}(\hat{m}_r \mid X,w) = S_w^c - B_n. E [ S r c ∣ X , w ] = E [ S r u ∣ X , w ] − E [ m ^ r m ^ r ⊤ ∣ X , w ] = S w u − m ^ m ^ ⊤ − Cov ( m ^ r ∣ X , w ) = S w c − B n .
B n ⪰ 0 B_n \succeq0 B n ⪰ 0 as a quadratic form in a covariance matrix, so E [ S r c ∣ X , w ] ⪯ S w c \mathbb{E}[S_r^c \mid X,w] \preceq S_w^c E [ S r c ∣ X , w ] ⪯ S w c in Loewner order. Trace magnitude. For multinomial resampling C n = diag ( λ ) − 1 N λ λ ⊤ C_n = \operatorname{diag}(\lambda) - \frac{1}{N}\lambda\lambda^{\top} C n = diag ( λ ) − N 1 λ λ ⊤ , so
tr B n = 1 N [ 1 N ∑ i λ i ∥ x i ∥ 2 − ∥ m ^ ∥ 2 ] . \operatorname{tr} B_n = \frac{1}{N}\left[\frac{1}{N}\sum_i \lambda_i\lVert x_i\rVert^2 - \lVert\hat{m}\rVert^2\right]. tr B n = N 1 [ N 1 i ∑ λ i ∥ x i ∥ 2 − ∥ m ^ ∥ 2 ] .
Under the stated condition 1 N ∑ i λ i ∥ x i ∥ 2 = O p ( d ) \frac{1}{N}\sum_i \lambda_i\lVert x_i\rVert^2 = O_p(d) N 1 ∑ i λ i ∥ x i ∥ 2 = O p ( d ) , tr B n = O p ( d / N ) = O p ( 1 ) \operatorname{tr} B_n = O_p(d/N) = O_p(1) tr B n = O p ( d / N ) = O p ( 1 ) and d − 1 tr B n = O p ( 1 / N ) d^{-1}\operatorname{tr} B_n = O_p(1/N) d − 1 tr B n = O p ( 1/ N ) . The matrix B n B_n B n may have rank up to d d d ; it is not low-rank. □
Part (ii). Conditionally on ( X , w ) (X,w) ( X , w ) , B n B_n B n is deterministic and M : = S r c + B n M := S_r^c + B_n M := S r c + B n satisfies E [ M ∣ X , w ] = S w c \mathbb{E}[M \mid X,w] = S_w^c E [ M ∣ X , w ] = S w c by rearranging part (i). Jensen’s inequality applied to the matrix-valued random element M M M and convex Φ \Phi Φ gives Φ ( E [ M ∣ X , w ] ) ≤ E [ Φ ( M ) ∣ X , w ] \Phi(\mathbb{E}[M \mid X,w]) \le\mathbb{E}[\Phi(M) \mid X,w] Φ ( E [ M ∣ X , w ]) ≤ E [ Φ ( M ) ∣ X , w ] . Admissible functionals include Φ ( M ) = tr M 2 \Phi(M) = \operatorname{tr} M^2 Φ ( M ) = tr M 2 , λ max ( M ) \lambda_{\max}(M) λ m a x ( M ) , − log det ( M + ε I ) -\log\det(M+\varepsilon I) − log det ( M + ε I ) (ε > 0 \varepsilon> 0 ε > 0 ), and M ↦ tr φ ( M ) M \mapsto\operatorname{tr}\varphi(M) M ↦ tr φ ( M ) for scalar φ \varphi φ convex on the relevant interval with tr φ \operatorname{tr}\varphi tr φ finite. □ \square □
Parts (iii) and (iv). S r u − S r c = m ^ r m ^ r T S_r^u-S_r^c=\hat m_r\hat m_r^{\mathsf T} S r u − S r c = m ^ r m ^ r T has rank at most one, and likewise on the weighted side. The rank inequality for empirical spectral distributions of Hermitian matrices, sup x ∣ F A ( x ) − F B ( x ) ∣ ≤ rank ( A − B ) / d \sup_x\lvert F^A(x)-F^B(x)\rvert\le\operatorname{rank}(A-B)/d sup x ∣ F A ( x ) − F B ( x )∣ ≤ rank ( A − B ) / d , gives sup x ∣ F S r c ( x ) − F S r u ( x ) ∣ ≤ 1 / d \sup_x\lvert F^{S_r^c}(x)-F^{S_r^u}(x)\rvert\le1/d sup x ∣ F S r c ( x ) − F S r u ( x )∣ ≤ 1/ d . Hence (a) the limiting spectral distributions exist or fail to exist together and coincide when they exist; (b) the zero-atom masses differ by at most 1 / d 1/d 1/ d , since by interlacing a rank-one perturbation moves at most one zero eigenvalue. □ \square □
Boundary note. Finite-rank perturbations can create, delete, or move outliers (for example I d I_d I d against I d + d e 1 e 1 T I_d+d e_1e_1^{\mathsf T} I d + d e 1 e 1 T ); the statements do not cover extreme eigenvalues or unbounded spectral moments. Edge convergence transfers only if one separately proves the absence of finite-rank outliers and a common limit of adjacent extreme order statistics (for example λ 1 ( S r u ) , λ 2 ( S r u ) → b + \lambda_1(S_r^u),\lambda_2(S_r^u)\to b_+ λ 1 ( S r u ) , λ 2 ( S r u ) → b + ), in which case interlacing λ j + 1 ( S r u ) ≤ λ j ( S r c ) ≤ λ j ( S r u ) \lambda_{j+1}(S_r^u)\le\lambda_j(S_r^c)\le\lambda_j(S_r^u) λ j + 1 ( S r u ) ≤ λ j ( S r c ) ≤ λ j ( S r u ) yields the same edge for the centered matrix. Neither sup N ∥ Σ N ∥ o p < ∞ \sup_N\lVert\Sigma_N\rVert_{\mathrm{op}}<\infty sup N ∥ Σ N ∥ op < ∞ nor moment control alone implies this condition, as spiked models show.
Proof of Theorem 1 (count laws under random weights)
Lemma S1 (balls into bins and Efron–Stein)
Conditionally on w w w , write multinomial counts as n i = ∑ ℓ = 1 N 1 { Y ℓ = i } n_i=\sum_{\ell=1}^{N}\mathbf{1}\{Y_\ell=i\} n i = ∑ ℓ = 1 N 1 { Y ℓ = i } with Y ℓ Y_\ell Y ℓ i.i.d. Categorical( w ) (w) ( w ) . For bounded φ \varphi φ set F ( Y 1 , … , Y N ) = 1 N ∑ i φ ( n i ) F(Y_1,\ldots,Y_N)=\frac{1}{N}\sum_i\varphi(n_i) F ( Y 1 , … , Y N ) = N 1 ∑ i φ ( n i ) . Replacing one Y ℓ Y_\ell Y ℓ by an independent copy changes at most two coordinates of the count vector, hence ∣ F − F ( ℓ ) ∣ ≤ 4 ∥ φ ∥ ∞ / N \lvert F-F^{(\ell)}\rvert\le4\lVert\varphi\rVert_\infty/N ∣ F − F ( ℓ ) ∣ ≤ 4 ∥ φ ∥ ∞ / N . The Efron–Stein inequality gives
Var ( F ∣ w ) ≤ 1 2 ∑ ℓ = 1 N E [ ( F − F ( ℓ ) ) 2 ∣ w ] ≤ 8 ∥ φ ∥ ∞ 2 N . \operatorname{Var}(F\mid w)\le\frac{1}{2}\sum_{\ell=1}^{N}\mathbb{E}\left[(F-F^{(\ell)})^2\mid w\right]\le\frac{8\lVert\varphi\rVert_\infty^2}{N}. Var ( F ∣ w ) ≤ 2 1 ℓ = 1 ∑ N E [ ( F − F ( ℓ ) ) 2 ∣ w ] ≤ N 8 ∥ φ ∥ ∞ 2 . For residual resampling the same argument with R N R_N R N balls (categories u i / R N u_i/R_N u i / R N ) gives Var ≤ 8 R N ∥ φ ∥ ∞ 2 / N 2 = O p ( 1 / N ) \operatorname{Var}\le8R_N\lVert\varphi\rVert_\infty^2/N^2=O_p(1/N) Var ≤ 8 R N ∥ φ ∥ ∞ 2 / N 2 = O p ( 1/ N ) , since R N ≤ N R_N\le N R N ≤ N . No condition on max i λ i \max_i\lambda_i max i λ i and no pairwise covariance expansion is needed. □ \square □
multinomial resampling
Write m ( ϕ ; ρ ~ ) : = ∫ E [ ϕ ( Poi ( λ ) ) ] ρ ~ ( d λ ) m(\phi;\widetilde{\rho}) := \int\mathbb{E}[\phi(\operatorname{Poi}(\lambda))]\,\widetilde{\rho}(\mathrm{d}\lambda) m ( ϕ ; ρ ) := ∫ E [ ϕ ( Poi ( λ ))] ρ ( d λ ) ; the map λ ↦ E [ ϕ ( Poi ( λ ) ) ] \lambda\mapsto\mathbb{E}[\phi(\operatorname{Poi}(\lambda))] λ ↦ E [ ϕ ( Poi ( λ ))] is bounded and continuous, since d T V ( Poi ( λ ) , Poi ( λ ′ ) ) ≤ ∣ λ − λ ′ ∣ d_{\mathrm{TV}}(\operatorname{Poi}(\lambda),\operatorname{Poi}(\lambda')) \leq\lvert\lambda-\lambda'\rvert d TV ( Poi ( λ ) , Poi ( λ ′ )) ≤ ∣ λ − λ ′ ∣ .
Expectation. n i ∣ w ∼ Bin ( N , λ i / N ) n_i \mid w \sim\operatorname{Bin}(N,\lambda_i/N) n i ∣ w ∼ Bin ( N , λ i / N ) , and Le Cam’s bound d T V ( Bin ( N , λ i / N ) , Poi ( λ i ) ) ≤ λ i 2 / N d_{\mathrm{TV}}(\operatorname{Bin}(N,\lambda_i/N),\operatorname{Poi}(\lambda_i)) \leq\lambda_i^2/N d TV ( Bin ( N , λ i / N ) , Poi ( λ i )) ≤ λ i 2 / N gives
∣ E [ 1 N ∑ i ϕ ( n i ) ∣ w ] − m ( ϕ ; ρ N ) ∣ ≤ 2 ∥ ϕ ∥ ∞ 1 N 2 ∑ i λ i 2 = O p ( 1 / N ) , \left\lvert\mathbb{E}\left[\left.\frac{1}{N}\sum_i\phi(n_i)\right|w\right]-m(\phi;\rho_N)\right\rvert\leq2\lVert\phi\rVert_\infty\frac{1}{N^2}\sum_i\lambda_i^2=O_p(1/N), E [ N 1 i ∑ ϕ ( n i ) w ] − m ( ϕ ; ρ N ) ≤ 2 ∥ ϕ ∥ ∞ N 2 1 i ∑ λ i 2 = O p ( 1/ N ) ,
and ρ N ⇒ ρ \rho_N \Rightarrow\rho ρ N ⇒ ρ in probability with a bounded continuous integrand gives m ( ϕ ; ρ N ) → ∫ ϕ d MixPoi ( ρ ) m(\phi;\rho_N)\to\int\phi\,\mathrm{d}\operatorname{MixPoi}(\rho) m ( ϕ ; ρ N ) → ∫ ϕ d MixPoi ( ρ ) in probability.
Variance. Lemma S1 gives Var = O p ( 1 / N ) \operatorname{Var}=O_p(1/N) Var = O p ( 1/ N ) .
From conditional to unconditional convergence. Take a countable convergence-determining class of bounded Lipschitz test functions; for each ϕ \phi ϕ apply the conditional Chebyshev inequality (the conditional bounds are deterministic functions of ρ N \rho_N ρ N vanishing in probability), and combine over the countable class by a finite ϵ \epsilon ϵ -net and a diagonal argument. Tightness is immediate, since 1 N ∑ i n i = 1 \frac{1}{N}\sum_i n_i=1 N 1 ∑ i n i = 1 implies ν N ( [ M , ∞ ) ) ≤ 1 / M \nu_N([M,\infty))\leq1/M ν N ([ M , ∞ )) ≤ 1/ M . The subsequence principle then yields d B L ( ν N , MixPoi ( ρ ) ) → 0 d_{\mathrm{BL}}(\nu_N,\operatorname{MixPoi}(\rho))\to0 d BL ( ν N , MixPoi ( ρ )) → 0 in probability. □ \square □
residual resampling
The primitive assumption is π N ⇒ π \pi_N\Rightarrow\pi π N ⇒ π in probability. Since the u u u -coordinate projection is bounded and continuous, R N / N = 1 N ∑ i u i → E π U R_N/N=\frac{1}{N}\sum_i u_i\to\mathbb{E}_{\pi}U R N / N = N 1 ∑ i u i → E π U in probability.
Case 1: E π U > 0 \mathbb{E}_{\pi}U>0 E π U > 0 . Then R N = Θ p ( N ) R_N=\Theta_p(N) R N = Θ p ( N ) and max i u i / R N = O p ( 1 / N ) \max_i u_i/R_N=O_p(1/N) max i u i / R N = O p ( 1/ N ) . Per coordinate, n ~ i ∣ w ∼ Bin ( R N , u i / R N ) \widetilde{n}_i\mid w\sim\operatorname{Bin}(R_N,u_i/R_N) n i ∣ w ∼ Bin ( R N , u i / R N ) with d T V ( ⋅ , Poi ( u i ) ) ≤ u i 2 / R N d_{\mathrm{TV}}(\cdot,\operatorname{Poi}(u_i))\leq u_i^2/R_N d TV ( ⋅ , Poi ( u i )) ≤ u i 2 / R N , and the average over i i i is at most 1 N ∑ i u i / R N = 1 / N \frac{1}{N}\sum_i u_i/R_N=1/N N 1 ∑ i u i / R N = 1/ N . Hence for bounded continuous ϕ \phi ϕ ,
1 N ∑ i E [ ϕ ( k i + n ~ i ) ∣ w ] = 1 N ∑ i E [ ϕ ( k i + Poi ( u i ) ) ] + O ( ∥ ϕ ∥ ∞ / N ) → E π ϕ ( K + Poi ( U ) ) , \frac{1}{N}\sum_i\mathbb{E}[\phi(k_i+\widetilde{n}_i)\mid w]=\frac{1}{N}\sum_i\mathbb{E}[\phi(k_i+\operatorname{Poi}(u_i))]+O(\lVert\phi\rVert_\infty/N)\to\mathbb{E}_{\pi}\phi(K+\operatorname{Poi}(U)), N 1 i ∑ E [ ϕ ( k i + n i ) ∣ w ] = N 1 i ∑ E [ ϕ ( k i + Poi ( u i ))] + O (∥ ϕ ∥ ∞ / N ) → E π ϕ ( K + Poi ( U )) ,
where the last step uses π N ⇒ π \pi_N\Rightarrow\pi π N ⇒ π and the bounded continuity of ( k , u ) ↦ E ϕ ( k + Poi ( u ) ) (k,u)\mapsto\mathbb{E}\phi(k+\operatorname{Poi}(u)) ( k , u ) ↦ E ϕ ( k + Poi ( u )) . The variance vanishes by the residual version of Lemma S1.
Case 2: E π U = 0 \mathbb{E}_{\pi}U=0 E π U = 0 . Then R N / N → 0 R_N/N\to0 R N / N → 0 . For bounded ϕ \phi ϕ ,
∣ ∫ ϕ d ν N − 1 N ∑ i ϕ ( k i ) ∣ ≤ 2 ∥ ϕ ∥ ∞ 1 N ∑ i 1 { n ~ i ≥ 1 } , \left\lvert\int\phi\,\mathrm{d}\nu_N-\frac{1}{N}\sum_i\phi(k_i)\right\rvert\leq2\lVert\phi\rVert_\infty\frac{1}{N}\sum_i\mathbf{1}\{\widetilde{n}_i\geq1\}, ∫ ϕ d ν N − N 1 i ∑ ϕ ( k i ) ≤ 2 ∥ ϕ ∥ ∞ N 1 i ∑ 1 { n i ≥ 1 } ,
and E [ 1 N ∑ i 1 { n ~ i ≥ 1 } ∣ w ] ≤ R N / N → 0 \mathbb{E}\left[\left.\frac{1}{N}\sum_i\mathbf{1}\{\widetilde{n}_i\geq1\}\right|w\right]\leq R_N/N\to0 E [ N 1 ∑ i 1 { n i ≥ 1 } w ] ≤ R N / N → 0 (using P ( n ~ i ≥ 1 ∣ w ) = 1 − ( 1 − u i / R N ) R N ≤ u i \mathbb{P}(\widetilde{n}_i\geq1\mid w)=1-(1-u_i/R_N)^{R_N}\leq u_i P ( n i ≥ 1 ∣ w ) = 1 − ( 1 − u i / R N ) R N ≤ u i ), so Markov’s inequality concludes; meanwhile 1 N ∑ i δ k i ⇒ L ( K ) \frac{1}{N}\sum_i\delta_{k_i}\Rightarrow\mathcal{L}(K) N 1 ∑ i δ k i ⇒ L ( K ) , consistent with L ( K + Poi ( U ) ) \mathcal{L}(K+\operatorname{Poi}(U)) L ( K + Poi ( U )) since U = 0 U=0 U = 0 almost surely. □ \square □
second count moments
Joint factorial moments. For i ≠ j i\ne j i = j , E [ ( n i ) a ( n j ) b ∣ w ] = ( N ) a + b w i a w j b \mathbb{E}[(n_i)_a(n_j)_b\mid w]=(N)_{a+b}w_i^a w_j^b E [( n i ) a ( n j ) b ∣ w ] = ( N ) a + b w i a w j b , and n 2 = ( n ) 2 + ( n ) 1 n^2=(n)_2+(n)_1 n 2 = ( n ) 2 + ( n ) 1 . Multinomial, expectation. E [ n i 2 ∣ w ] = λ i + λ i 2 ( 1 − 1 / N ) \mathbb{E}[n_i^2 \mid w] = \lambda_i + \lambda_i^2(1-1/N) E [ n i 2 ∣ w ] = λ i + λ i 2 ( 1 − 1/ N ) , so E [ 1 N ∑ i n i 2 ∣ w ] = 1 + 1 N ∑ i λ i 2 − 1 N 2 ∑ i λ i 2 → 1 + r 2 \mathbb{E}\left[\frac{1}{N}\sum_i n_i^2 \mid w\right] = 1+\frac{1}{N}\sum_i\lambda_i^2-\frac{1}{N^2}\sum_i\lambda_i^2 \to1+r_2 E [ N 1 ∑ i n i 2 ∣ w ] = 1 + N 1 ∑ i λ i 2 − N 2 1 ∑ i λ i 2 → 1 + r 2 in probability.
Multinomial, variance. Var ( n i 2 ∣ w ) ≤ C ( λ i + λ i 2 + λ i 3 ) \operatorname{Var}(n_i^2 \mid w) \le C(\lambda_i+\lambda_i^2+\lambda_i^3) Var ( n i 2 ∣ w ) ≤ C ( λ i + λ i 2 + λ i 3 ) (compare the Poisson case, Var ( M 2 ) = 4 λ 3 + 6 λ 2 + λ \operatorname{Var}(M^2)=4\lambda^3+6\lambda^2+\lambda Var ( M 2 ) = 4 λ 3 + 6 λ 2 + λ ). The diagonal sum is ( 1 / N 2 ) ∑ i Var ( n i 2 ) = O p ( N − 1 / 2 ) (1/N^2)\sum_i\operatorname{Var}(n_i^2)=O_p(N^{-1/2}) ( 1/ N 2 ) ∑ i Var ( n i 2 ) = O p ( N − 1/2 ) , using ∑ λ i = N \sum\lambda_i=N ∑ λ i = N , ∑ λ i 2 = O p ( N ) \sum\lambda_i^2=O_p(N) ∑ λ i 2 = O p ( N ) , and ∑ λ i 3 ≤ max i λ i ⋅ ∑ λ i 2 = O p ( N 3 / 2 ) \sum\lambda_i^3\le\max_i\lambda_i\cdot\sum\lambda_i^2=O_p(N^{3/2}) ∑ λ i 3 ≤ max i λ i ⋅ ∑ λ i 2 = O p ( N 3/2 ) . The joint factorial moments show that the leading terms of the off-diagonal covariances cancel: ∣ Cov ( n i 2 , n j 2 ) ∣ = O ( ( λ i 2 λ j 2 + λ i 2 λ j + λ i λ j 2 ) / N ) |\operatorname{Cov}(n_i^2,n_j^2)|=O((\lambda_i^2\lambda_j^2+\lambda_i^2\lambda_j+\lambda_i\lambda_j^2)/N) ∣ Cov ( n i 2 , n j 2 ) ∣ = O (( λ i 2 λ j 2 + λ i 2 λ j + λ i λ j 2 ) / N ) , which sums to O p ( 1 / N ) O_p(1/N) O p ( 1/ N ) at scale 1 / N 2 1/N^2 1/ N 2 . Hence Var ( 1 N ∑ i n i 2 ∣ w ) = O p ( N − 1 / 2 ) \operatorname{Var}(\frac{1}{N}\sum_i n_i^2\mid w)=O_p(N^{-1/2}) Var ( N 1 ∑ i n i 2 ∣ w ) = O p ( N − 1/2 ) .
Residual. With k i = ⌊ λ i ⌋ k_i=\lfloor\lambda_i\rfloor k i = ⌊ λ i ⌋ , and noting that 2 k i u i 2k_i u_i 2 k i u i is already inside λ i 2 = k i 2 + 2 k i u i + u i 2 \lambda_i^2=k_i^2+2k_i u_i+u_i^2 λ i 2 = k i 2 + 2 k i u i + u i 2 ,
n i 2 − λ i 2 = 2 k i ( n ~ i − u i ) + ( n ~ i 2 − u i 2 ) . n_i^2-\lambda_i^2=2k_i(\tilde n_i-u_i)+(\tilde n_i^2-u_i^2). n i 2 − λ i 2 = 2 k i ( n ~ i − u i ) + ( n ~ i 2 − u i 2 ) .
For the expectation, E [ n ~ i 2 − u i 2 ∣ w ] = u i − u i 2 / R N \mathbb{E}[\tilde n_i^2-u_i^2\mid w]=u_i-u_i^2/R_N E [ n ~ i 2 − u i 2 ∣ w ] = u i − u i 2 / R N (from E [ n ~ i 2 ∣ w ] = u i + u i 2 ( 1 − 1 / R N ) ) \mathbb{E}[\tilde n_i^2\mid w]=u_i+u_i^2(1-1/R_N)) E [ n ~ i 2 ∣ w ] = u i + u i 2 ( 1 − 1/ R N )) , so
E [ 1 N ∑ i n i 2 ∣ w ] = 1 N ∑ i λ i 2 + R N N − 1 N R N ∑ i u i 2 . \mathbb{E}\left[\frac{1}{N}\sum_i n_i^2\mid w\right]=\frac{1}{N}\sum_i\lambda_i^2+\frac{R_N}{N}-\frac{1}{NR_N}\sum_i u_i^2. E [ N 1 i ∑ n i 2 ∣ w ] = N 1 i ∑ λ i 2 + N R N − N R N 1 i ∑ u i 2 .
where the last term lies in [ 0 , 1 / N ] [0,1/N] [ 0 , 1/ N ] and the second tends to E π U \mathbb{E}_{\pi}U E π U in probability (to 0 = E π U 0=\mathbb{E}_{\pi}U 0 = E π U in Case 2). For the cross term, with a i = 2 k i a_i=2k_i a i = 2 k i , the exact linear-form variance for n ~ ∼ Multinomial ( R N ; u / R N ) \tilde n\sim\operatorname{Multinomial}(R_N;u/R_N) n ~ ∼ Multinomial ( R N ; u / R N ) is Var ( ∑ i a i n ~ i ∣ w ) = ∑ i u i a i 2 − ( ∑ i u i a i ) 2 / R N ≤ ∑ i u i a i 2 ≤ 4 ∑ i λ i 2 \operatorname{Var}(\sum_i a_i\tilde n_i\mid w)=\sum_i u_i a_i^2-(\sum_i u_i a_i)^2/R_N\le\sum_i u_i a_i^2\le4\sum_i\lambda_i^2 Var ( ∑ i a i n ~ i ∣ w ) = ∑ i u i a i 2 − ( ∑ i u i a i ) 2 / R N ≤ ∑ i u i a i 2 ≤ 4 ∑ i λ i 2 , so the centered cross term is O p ( 1 / N ) O_p(1/N) O p ( 1/ N ) at scale 1 / N 2 1/N^2 1/ N 2 . For the quadratic term, Q N : = ∑ i n ~ i 2 = ∑ i ( n ~ i ) 2 + R N Q_N:=\sum_i\tilde n_i^2=\sum_i(\tilde n_i)_2+R_N Q N := ∑ i n ~ i 2 = ∑ i ( n ~ i ) 2 + R N ; given w w w , R N R_N R N is deterministic, so the randomness sits in ∑ i ( n ~ i ) 2 \sum_i(\tilde n_i)_2 ∑ i ( n ~ i ) 2 . The joint factorial moments E [ ( n ~ i ) a ( n ~ j ) b ∣ w ] = ( R N ) a + b ( u i / R N ) a ( u j / R N ) b \mathbb{E}[(\tilde n_i)_a(\tilde n_j)_b\mid w]=(R_N)_{a+b}(u_i/R_N)^a(u_j/R_N)^b E [( n ~ i ) a ( n ~ j ) b ∣ w ] = ( R N ) a + b ( u i / R N ) a ( u j / R N ) b and u i ≤ 1 u_i\le1 u i ≤ 1 give Var ( Q N ∣ w ) = O ( R N ) \operatorname{Var}(Q_N\mid w)=O(R_N) Var ( Q N ∣ w ) = O ( R N ) : the diagonal terms Var ( ( n ~ i ) 2 ) ≤ E n ~ i 4 = O ( u i ) \operatorname{Var}((\tilde n_i)_2)\le\mathbb{E}\tilde n_i^4=O(u_i) Var (( n ~ i ) 2 ) ≤ E n ~ i 4 = O ( u i ) sum to O ( R N ) O(R_N) O ( R N ) , and the covariances are O ( u i 2 u j 2 / R N ) O(u_i^2u_j^2/R_N) O ( u i 2 u j 2 / R N ) , summing to at most ( ∑ u i 2 ) 2 / R N = O ( R N ) (\sum u_i^2)^2/R_N=O(R_N) ( ∑ u i 2 ) 2 / R N = O ( R N ) . Hence in Case 1, Var ( Q N / N ∣ w ) = O p ( R N / N 2 ) = O p ( 1 / N ) \operatorname{Var}(Q_N/N\mid w)=O_p(R_N/N^2)=O_p(1/N) Var ( Q N / N ∣ w ) = O p ( R N / N 2 ) = O p ( 1/ N ) ; in Case 2, Q N / N ≥ 0 Q_N/N\ge0 Q N / N ≥ 0 with conditional mean at most 2 R N / N → 0 2R_N/N\to0 2 R N / N → 0 , and Markov’s inequality concludes with no variance bound needed. Assembling, 1 N ∑ i n i 2 = 1 N ∑ i λ i 2 + R N / N + o p ( 1 ) → r 2 + E π U \frac{1}{N}\sum_i n_i^2=\frac{1}{N}\sum_i\lambda_i^2+R_N/N+o_p(1)\to r_2+\mathbb{E}_{\pi}U N 1 ∑ i n i 2 = N 1 ∑ i λ i 2 + R N / N + o p ( 1 ) → r 2 + E π U in both cases. □
Proof of Lemma 2 (continuity of the spectral map)
Statement. If η L ⇒ η \eta_L\Rightarrow\eta η L ⇒ η with ∫ t η L ( d t ) \int t\,\eta_L(dt) ∫ t η L ( d t ) uniformly bounded, then T c ( η L ) ⇒ T c ( η ) T_c(\eta_L)\Rightarrow T_c(\eta) T c ( η L ) ⇒ T c ( η ) .
Proof. The companion fixed-point equation z = − 1 m ( z ) + ∫ t 1 + c t m ( z ) η ( d t ) z=-\frac{1}{m(z)}+\int\frac{t}{1+ctm(z)}\,\eta(dt) z = − m ( z ) 1 + ∫ 1 + c t m ( z ) t η ( d t ) , on the Stieltjes branch of a probability measure, is stable in η \eta η : for Im z ≥ v 0 \operatorname{Im}z\ge v_0 Im z ≥ v 0 the integrand t ↦ t ( 1 + c t m ) − 1 t\mapsto t(1+ctm)^{-1} t ↦ t ( 1 + c t m ) − 1 is uniformly bounded and continuous in ( t , m ) (t,m) ( t , m ) , so the right-hand side is weakly continuous in η \eta η ; the bound ∣ m L ( z ) ∣ ≤ 1 / Im z |m_L(z)|\le1/\operatorname{Im}z ∣ m L ( z ) ∣ ≤ 1/ Im z gives equicontinuity; a subsequence argument yields a limit point that solves the equation for η \eta η ; and uniqueness of the fixed point on the stated branch forces convergence of the whole sequence. Pointwise convergence of Stieltjes transforms together with tightness, which follows from ∫ x T c ( η L ) ( d x ) = ∫ t η L ( d t ) \int x\,T_c(\eta_L)(dx)=\int t\,\eta_L(dt) ∫ x T c ( η L ) ( d x ) = ∫ t η L ( d t ) by the moment multiplicativity of the representation D c ( η ⊠ MP ( 1 / c ) ) D_c(\eta\boxtimes\operatorname{MP}(1/c)) D c ( η ⊠ MP ( 1/ c )) , gives weak convergence of the measures. □
S-D. Proofs of Theorem 3 and Corollaries 1 and 2
Theorem 2 (imported deterministic core). For a deterministic diagonal D ~ N \widetilde{D}_N D N with entries in Z ≥ 0 \mathbb{Z}_{\ge0} Z ≥ 0 , ESD ⇒ η ~ \operatorname{ESD} \Rightarrow\widetilde{\eta} ESD ⇒ η (a probability law with mean at most 1), 1 N ∑ i d ~ i 2 ≤ K < ∞ \frac{1}{N}\sum_i \widetilde{d}_i^2 \le K < \infty N 1 ∑ i d i 2 ≤ K < ∞ , Gaussian Z N Z_N Z N independent of D ~ N \widetilde{D}_N D N , and Σ N \Sigma_N Σ N satisfying (G2), the ESD of 1 N Z N D ~ N Z N T Σ N 1 / 2 \frac{1}{N}Z_N\widetilde{D}_N Z_N^{\mathsf{T}}\Sigma_N^{1/2} N 1 Z N D N Z N T Σ N 1/2 converges in probability to H ⊠ T c ( η ~ ) H \boxtimes T_c(\widetilde{\eta}) H ⊠ T c ( η ) . Gaussianity is used at exactly one point: conditionally on D ~ N \widetilde{D}_N D N , Q N = 1 N Z D ~ Z T Q_N = \frac{1}{N}Z\widetilde{D}Z^{\mathsf{T}} Q N = N 1 Z D Z T is orthogonally invariant and hence asymptotically free from Σ N \Sigma_N Σ N . Unbounded diagonal entries are handled by truncation and rank approximation before passing to the limit, with continuity of the fixed point. This is [1 Theorem 12] , proved in [1 SM §S7] .
Theorem 3
Step 1 (good event). For ε > 0 \varepsilon> 0 ε > 0 and constants K 1 , K 2 K_1, K_2 K 1 , K 2 , define the environment event
E N g o o d = { d B L ( ρ N , ρ ) < ε } ∩ { 1 N ∑ i λ i 2 ≤ K 1 } ∩ { d B L ( ν N , ν ) < ε } ∩ { 1 N ∑ i n i 2 ≤ K 2 } . \mathcal{E}_N^{\mathrm{good}} = \{d_{\mathrm{BL}}(\rho_N,\rho) < \varepsilon\} \cap\left\{\frac{1}{N}\sum_i \lambda_i^2 \le K_1\right\} \cap\{d_{\mathrm{BL}}(\nu_N,\nu) < \varepsilon\} \cap\left\{\frac{1}{N}\sum_i n_i^2 \le K_2\right\}. E N good = { d BL ( ρ N , ρ ) < ε } ∩ { N 1 i ∑ λ i 2 ≤ K 1 } ∩ { d BL ( ν N , ν ) < ε } ∩ { N 1 i ∑ n i 2 ≤ K 2 } .
By (W2) and Theorem 1, K 1 K_1 K 1 and K 2 K_2 K 2 can be chosen so that P ( E N g o o d ) → 1 \mathbb{P}(\mathcal{E}_N^{\mathrm{good}}) \to1 P ( E N good ) → 1 as N → ∞ N \to\infty N → ∞ and then ε ↓ 0 \varepsilon\downarrow0 ε ↓ 0 .
Step 2 (truncation and rank control). On E N g o o d \mathcal{E}_N^{\mathrm{good}} E N good let D N ( L ) = diag ( min ( n i , L ) ) D_N^{(L)} = \operatorname{diag}(\min(n_i,L)) D N ( L ) = diag ( min ( n i , L )) . Then
lim L → ∞ lim sup N → ∞ P ( 1 N # { i : n i > L } > ε ) = 0 , \lim_{L\to\infty}\limsup_{N\to\infty}\mathbb{P}\left(\frac{1}{N}\#\{i:n_i>L\}>\varepsilon\right)=0, L → ∞ lim N → ∞ lim sup P ( N 1 # { i : n i > L } > ε ) = 0 ,
since 1 N # { i : n i > L } ≤ L − 2 1 N ∑ i n i 2 ≤ K 2 L − 2 \frac{1}{N}\#\{i:n_i>L\}\le L^{-2}\frac{1}{N}\sum_i n_i^2\le K_2L^{-2} N 1 # { i : n i > L } ≤ L − 2 N 1 ∑ i n i 2 ≤ K 2 L − 2 on the good event. With rank ( S r u − S r u , ( L ) ) ≤ # { i : n i > L } \operatorname{rank}(S_r^{u}-S_r^{u,(L)})\le\#\{i:n_i>L\} rank ( S r u − S r u , ( L ) ) ≤ # { i : n i > L } , the ESD rank inequality gives
sup x ∣ F S r u ( x ) − F S r u , ( L ) ( x ) ∣ ≤ # { i : n i > L } d = N d ⋅ 1 N # { i : n i > L } = O p ( L − 2 ) \sup_x\left|F^{S_r^u}(x)-F^{S_r^{u,(L)}}(x)\right|\le\frac{\#\{i:n_i>L\}}{d}=\frac{N}{d}\cdot\frac{1}{N}\#\{i:n_i>L\}=O_p(L^{-2}) x sup F S r u ( x ) − F S r u , ( L ) ( x ) ≤ d # { i : n i > L } = d N ⋅ N 1 # { i : n i > L } = O p ( L − 2 )
in the double-limit sense (first N → ∞ N\to\infty N → ∞ , then L → ∞ L\to\infty L → ∞ ). The truncated count law ν ( L ) = L ( min ( J , L ) ) \nu^{(L)}=\mathcal{L}(\min(J,L)) ν ( L ) = L ( min ( J , L )) , J ∼ ν J\sim\nu J ∼ ν , has mean at most 1 and uniformly bounded second moment.
Step 3 (Theorem 2 and continuity). Conditionally on the extended environment E N = σ ( W N , n N ) \mathcal{E}_N=\sigma(\mathcal{W}_N,n_N) E N = σ ( W N , n N ) , the diagonal D N ( L ) D_N^{(L)} D N ( L ) is deterministic and satisfies the premises of Theorem 2 on the good event. Conditioning on W N \mathcal{W}_N W N alone would not fix D N D_N D N ; the auxiliary randomness U N U_N U N with ( W N , U N ) ⊥ Z N (\mathcal{W}_N,U_N)\perp Z_N ( W N , U N ) ⊥ Z N closes this gap (Remark 1). Hence for each fixed L L L , μ S r u , ( L ) ⇒ H ⊠ T c ( ν N ( L ) ) \mu_{S_r^{u,(L)}}\Rightarrow H\boxtimes T_c(\nu_N^{(L)}) μ S r u , ( L ) ⇒ H ⊠ T c ( ν N ( L ) ) in probability as N → ∞ N\to\infty N → ∞ . Lemma 2 is used twice: (i) ν N ( L ) ⇒ ν ( L ) \nu_N^{(L)}\Rightarrow\nu^{(L)} ν N ( L ) ⇒ ν ( L ) on the good event, by continuity of truncation; (ii) T c ( ν ( L ) ) ⇒ T c ( ν ) T_c(\nu^{(L)})\Rightarrow T_c(\nu) T c ( ν ( L ) ) ⇒ T c ( ν ) as L → ∞ L\to\infty L → ∞ , the means being uniformly bounded. Combining the three contributions,
d m a t h r m B L ( μ S r u , H ⊠ T c ( ν ) ) ≤ O ( L − 2 ) + ( N-limit term ) + ( L-limit term ) → 0. d_{mathrm{BL}}(\mu_{S_r^u},H\boxtimes T_c(\nu))\le O(L^{-2})+(\text{N-limit term})+(\text{L-limit term})\to0. d ma t h r m B L ( μ S r u , H ⊠ T c ( ν )) ≤ O ( L − 2 ) + ( N-limit term ) + ( L-limit term ) → 0.
Step 4 (pullback to the random environment). All convergences above are conditional on the environment, on the good event. By the subsequence characterization of convergence in probability, every subsequence has a further subsequence along which the environment converges almost surely ((W2) and Theorem 1 hold in probability and therefore almost surely along subsequences), and on it the conditional weak convergence holds almost surely; weak convergence of measures is metrized by d B L d_{\mathrm{BL}} d BL , so μ S r u ⇒ H ⊠ T c ( ν ) \mu_{S^u_r} \Rightarrow H \boxtimes\mathcal{T}_c(\nu) μ S r u ⇒ H ⊠ T c ( ν ) in probability. □
Corollary 1. rank ( S r u − S r c ) ≤ 1 \operatorname{rank}(S^u_r-S^c_r)\leq1 rank ( S r u − S r c ) ≤ 1 , so sup x ∣ F S r u − F S r c ∣ ≤ 1 / d → 0 \sup_x\lvert F^{S^u_r}-F^{S^c_r}\rvert\leq1/d\to0 sup x ∣ F S r u − F S r c ∣ ≤ 1/ d → 0 by Lemma 1(iii), which composed with Theorem 3 gives the claim. The zero atom is inherited up to 1 / d 1/d 1/ d ; extreme eigenvalues are not inherited (Lemma 1(iv)). □
Corollary 2. (1) The maximum-atom rule for free multiplicative convolution of probability measures on R ≥ 0 \mathbb{R}_{\geq0} R ≥ 0 gives ( H ⊠ T c ( ν ) ) ( { 0 } ) = max { H ( { 0 } ) , T c ( ν ) ( { 0 } ) } (H\boxtimes\mathcal{T}_c(\nu))(\{0\})=\max\{H(\{0\}),\mathcal{T}_c(\nu)(\{0\})\} ( H ⊠ T c ( ν )) ({ 0 }) = max { H ({ 0 }) , T c ( ν ) ({ 0 })} , with the multinomial specialization T c ( ν ) ( { 0 } ) = max ( 0 , 1 − ( 1 − ν ( { 0 } ) ) / c ) \mathcal{T}_c(\nu)(\{0\})=\max(0,1-(1-\nu(\{0\}))/c) T c ( ν ) ({ 0 }) = max ( 0 , 1 − ( 1 − ν ({ 0 })) / c ) . (2) p s : = 1 − ν ( { 0 } ) p_s:=1-\nu(\{0\}) p s := 1 − ν ({ 0 }) ; under multinomial resampling ν ( { 0 } ) = E [ e − Λ ] = L ρ ( 1 ) \nu(\{0\})=\mathbb{E}[e^{-\Lambda}]=\mathcal{L}_{\rho}(1) ν ({ 0 }) = E [ e − Λ ] = L ρ ( 1 ) , and the rank threshold is p s ⋚ c p_s\lesseqgtr c p s ⋚ c , the identity-population transition of [1 ] . (3) The benchmark ( c − p s ) 2 (\sqrt{c}-\sqrt{p_s})^2 ( c − p s ) 2 is the Marchenko–Pastur benchmark with unit active columns, by positive-semidefinite monotonicity with D N D_N D N dominating the active-column projection and H = δ 1 H=\delta_1 H = δ 1 ; no uniform positive lower bound exists for general Σ N \Sigma_N Σ N with λ min ( Σ N ) → 0 \lambda_{\min}(\Sigma_N)\to0 λ m i n ( Σ N ) → 0 . (4) m 2 ( H ⊠ T c ( ν ) ) = m 2 , H + c a 1 2 m 2 ( ν ) m_2(H\boxtimes\mathcal{T}_c(\nu))=m_{2,H}+ca_1^2m_2(\nu) m 2 ( H ⊠ T c ( ν )) = m 2 , H + c a 1 2 m 2 ( ν ) for m 1 ( ν ) = 1 m_1(\nu)=1 m 1 ( ν ) = 1 , the spectral-moment identity of [1 ] , with m 2 ( ν ) m_2(\nu) m 2 ( ν ) supplied by Theorem 1(iii). □
S-E. Proofs for Chapter 3: structure of the forward map and the plug-in lemma
Lemma 3
(i) Compactness. H a , b = P ( [ a , b ] ) \mathcal{H}_{a,b}=\mathcal{P}([a,b]) H a , b = P ([ a , b ]) : a uniformly bounded support implies uniform integrability and tightness, and weak limits stay in [ a , b ] [a,b] [ a , b ] . Hence H a , b \mathcal{H}_{a,b} H a , b is weakly compact. □
(ii) Continuity. Weak continuity of ⊠ \boxtimes ⊠ on P ( R ≥ 0 ) \mathcal{P}(\mathbb{R}_{\geq0}) P ( R ≥ 0 ) , with the second argument fixed and of finite first moment, is standard [40 ] ; alternatively, apply the fixed-point stability of Lemma 2. The S-transform is not used here. □
(iii) Injectivity. For G ∈ H a , b G\in\mathcal{H}_{a,b} G ∈ H a , b , m 1 ( G ) ≥ a > 0 m_1(G)\geq a>0 m 1 ( G ) ≥ a > 0 , and m 1 ( T ) = 1 m_1(T)=1 m 1 ( T ) = 1 gives S T ( 0 ) = 1 / m 1 ( T ) = 1 ≠ 0 S_T(0)=1/m_1(T)=1\ne0 S T ( 0 ) = 1/ m 1 ( T ) = 1 = 0 . Since S G ⊠ T = S G S T S_{G\boxtimes T}=S_GS_T S G ⊠ T = S G S T on a common domain, division recovers S G S_G S G ; since G G G is compactly supported, it is moment-determinate, and equality of S-transforms near the origin yields equality of all moments, hence of the measures. For unbounded-support T T T the S-transform is not analytic on a full neighborhood of the origin but is defined on a left interval ( − δ , 0 ] (-\delta,0] ( − δ , 0 ] , and the identity theorem along the interval gives the same conclusion. □
Proposition S1 (zero-free region and modulus bound for the companion transform). Let T ∈ P ( R ≥ 0 ) T \in\mathcal{P}(\mathbb{R}_{\ge0}) T ∈ P ( R ≥ 0 ) with m 1 ( T ) = 1 m_1(T)=1 m 1 ( T ) = 1 , with no bounded-support assumption, and let s T ( z ) = ∫ T ( d x ) 1 − z x s_T(z)=\int\frac{T(dx)}{1-zx} s T ( z ) = ∫ 1 − z x T ( d x ) be its companion transform. The count laws arising from resampling (mixed Poisson laws, residual limits, and plug-in Poisson mixtures) have unbounded support, so the relevant region is the left half-disk rather than a disk around the origin. On { Re z ≤ 0 , ∣ z ∣ ≤ r } \{\operatorname{Re} z \le0,\ |z| \le r\} { Re z ≤ 0 , ∣ z ∣ ≤ r } :
(i) (Analyticity and zero-free left region.) s T s_T s T is analytic on C ∖ [ 0 , ∞ ) \mathbb{C}\setminus[0,\infty) C ∖ [ 0 , ∞ ) , since its poles 1 / x 1/x 1/ x , x ∈ supp T x\in\operatorname{supp} T x ∈ supp T , lie on the nonnegative axis, and for Re z ≤ 0 \operatorname{Re} z\le0 Re z ≤ 0 ,
Re s T ( z ) = ∫ 1 − Re ( z ) x ∣ 1 − z x ∣ 2 T ( d x ) > 0 , \operatorname{Re}s_T(z)=\int\frac{1-\operatorname{Re}(z)x}{|1-zx|^2}\,T(dx)>0, Re s T ( z ) = ∫ ∣1 − z x ∣ 2 1 − Re ( z ) x T ( d x ) > 0 , because the numerator satisfies 1 − Re ( z ) x ≥ 1 1-\operatorname{Re}(z)x\ge1 1 − Re ( z ) x ≥ 1 for all x ≥ 0 x\ge0 x ≥ 0 . Hence s T s_T s T has no zeros on the closed left half-plane.
(ii) (Support-free modulus bound.) For Re z ≤ 0 \operatorname{Re} z\le0 Re z ≤ 0 and ∣ z ∣ ≤ r |z|\le r ∣ z ∣ ≤ r ,
∣ s T ( z ) ∣ ≥ Re s T ( z ) ≥ ∫ ( 1 + r x ) − 2 T ( d x ) ≥ 1 ( 1 + r m 1 ( T ) ) 2 = 1 ( 1 + r ) 2 , |s_T(z)|\ge\operatorname{Re}s_T(z)\ge\int(1+rx)^{-2}\,T(dx)\ge\frac{1}{(1+r m_1(T))^2}=\frac{1}{(1+r)^2}, ∣ s T ( z ) ∣ ≥ Re s T ( z ) ≥ ∫ ( 1 + r x ) − 2 T ( d x ) ≥ ( 1 + r m 1 ( T ) ) 2 1 = ( 1 + r ) 2 1 , where the second inequality uses ∣ 1 − z x ∣ 2 ≤ ( 1 + ∣ z ∣ x ) 2 ≤ ( 1 + r x ) 2 |1-zx|^2\le(1+|z|x)^2\le(1+rx)^2 ∣1 − z x ∣ 2 ≤ ( 1 + ∣ z ∣ x ) 2 ≤ ( 1 + r x ) 2 , and the third is Jensen’s inequality for the convex function x ↦ ( 1 + r x ) − 2 x\mapsto(1+rx)^{-2} x ↦ ( 1 + r x ) − 2 . For a Poisson-type law at r = 1 r=1 r = 1 the measured minimum of Re s T \operatorname{Re}s_T Re s T is 0.596 0.596 0.596 , against the bound 0.25 0.25 0.25 . □
Remark (two-level bound). The intermediate term ∫ ( 1 + r x ) − 2 T ( d x ) \int(1+rx)^{-2}T(dx) ∫ ( 1 + r x ) − 2 T ( d x ) is markedly tighter than its Jensen closure, because the Jensen step discards all higher-moment information. The closed form ( 1 + r ) − 2 (1+r)^{-2} ( 1 + r ) − 2 is the portable bound, requiring only m 1 ( T ) = 1 m_1(T)=1 m 1 ( T ) = 1 , while the integral, available at the cost of one quadrature, is the operative bound whenever T T T is explicitly computable, as is the case for T = T c ( ν ) T=T_c(\nu) T = T c ( ν ) in the pipeline.
Why no explicit inverse modulus is claimed
The division step of the inversion takes place on the S-transform side, S G = S μ / S T S_G=S_\mu/S_T S G = S μ / S T . For w w w in a left neighborhood of 0 0 0 , with z = χ T ( w ) z=\chi_T(w) z = χ T ( w ) , χ T = ψ T − 1 \chi_T=\psi_T^{-1} χ T = ψ T − 1 and ψ T = s T − 1 \psi_T=s_T-1 ψ T = s T − 1 ,
∣ S T ( w ) ∣ = ∣ z s T ( z ) s T ( z ) − 1 ∣ z = χ T ( w ) , |S_T(w)|=\left|\frac{z\,s_T(z)}{s_T(z)-1}\right|_{z=\chi_T(w)}, ∣ S T ( w ) ∣ = s T ( z ) − 1 z s T ( z ) z = χ T ( w ) ,
and Proposition S1(ii) controls the numerator, since χ T ( w ) \chi_T(w) χ T ( w ) lies in the left region for such w w w . A quantitative lower bound on κ i n v ( θ ) \kappa_{\mathrm{inv}}^{(\theta)} κ inv ( θ ) along this route is nevertheless unavailable, for two structural reasons. First, the moment-determinacy step runs in the forward direction only: on P ( [ a , b ] ) \mathcal{P}([a,b]) P ([ a , b ]) , ∣ m k ( G 1 ) − m k ( G 2 ) ∣ ≤ k b k − 1 W 1 ( G 1 , G 2 ) |m_k(G_1)-m_k(G_2)|\le k b^{k-1}W_1(G_1,G_2) ∣ m k ( G 1 ) − m k ( G 2 ) ∣ ≤ k b k − 1 W 1 ( G 1 , G 2 ) , hence sup ∣ s G 1 − s G 2 ∣ ≤ [ r / ( 1 − b r ) 2 ] W 1 ( G 1 , G 2 ) \sup|s_{G_1}-s_{G_2}|\le[r/(1-br)^2]W_1(G_1,G_2) sup ∣ s G 1 − s G 2 ∣ ≤ [ r / ( 1 − b r ) 2 ] W 1 ( G 1 , G 2 ) on the left region. This says that the forward map contracts transform differences, which is the source of ill-conditioning; inversion requires the reverse inequality, transform differences controlling W 1 W_1 W 1 from below, and this fails in general even on compact support. Restricting to pairs with W 1 ≥ θ W_1\ge\theta W 1 ≥ θ removes the diagonal but does not bound the transform difference from below. Second, the inverse-function factor enters inversely: the Lipschitz modulus of χ T = ψ T − 1 \chi_T=\psi_T^{-1} χ T = ψ T − 1 requires a lower bound on ∣ ψ T ′ ∣ |\psi_T'| ∣ ψ T ′ ∣ , and although ψ T ′ ( 0 ) = 1 \psi_T'(0)=1 ψ T ′ ( 0 ) = 1 under m 1 ( T ) = 1 m_1(T)=1 m 1 ( T ) = 1 , a region-wide lower bound is again a form of inverse quantitative continuity that the forward estimates do not imply. What holds rigorously is Theorem 6: F T \mathcal{F}_T F T is a homeomorphism of the compact class U \mathcal{U} U onto its image, its inverse is uniformly continuous, and for every θ > 0 \theta>0 θ > 0 there exists δ θ > 0 \delta_\theta>0 δ θ > 0 with κ i n v ( θ ) ≥ δ θ / ( b − a ) > 0 \kappa_{\mathrm{inv}}^{(\theta)}\geq\delta_\theta/(b-a)>0 κ inv ( θ ) ≥ δ θ / ( b − a ) > 0 .
A quantitative modulus would require (a) an embedding between the band of d S t d_{\mathrm{St}} d St and the left region, (b) a resolution-aware inverse moment modulus, and (c) control of the inverse-function distortion through a lower bound on ∣ ψ T ′ ∣ |\psi_T'| ∣ ψ T ′ ∣ . For the two-point distortion law T = q δ 0 + ( 1 − q ) δ ℓ q T=q\delta_0+(1-q)\delta_{\ell_q} T = q δ 0 + ( 1 − q ) δ ℓ q , ℓ q : = ( 1 − q ) − 1 \ell_q:=(1-q)^{-1} ℓ q := ( 1 − q ) − 1 , one has ψ T ′ ( z ) = ( 1 − ℓ q z ) − 2 \psi_T'(z)=(1-\ell_qz)^{-2} ψ T ′ ( z ) = ( 1 − ℓ q z ) − 2 , so inf ∣ ψ T ′ ∣ \inf|\psi_T'| inf ∣ ψ T ′ ∣ over { Re z ≤ 0 , ∣ z ∣ ≤ 0.5 } \{\operatorname{Re}z\leq0,\ |z|\leq0.5\} { Re z ≤ 0 , ∣ z ∣ ≤ 0.5 } equals ( 1 + ℓ q / 2 ) − 2 (1+\ell_q/2)^{-2} ( 1 + ℓ q /2 ) − 2 , which decreases from 0.444 at q = 0 q=0 q = 0 to 0.141 at q = 0.7 q=0.7 q = 0.7 . No constant from this program enters any theorem.
Where the degradation lives
Three levels can be distinguished. (i) Definition level. The forward map G ↦ G ⊠ T G\mapsto G\boxtimes T G ↦ G ⊠ T contracts the fixed-bandwidth Stieltjes discrepancy more strongly relative to W 1 W_1 W 1 as the zero-atom mass grows; this is the metric pair that defines κ i n v ( θ ) \kappa_{\mathrm{inv}}^{(\theta)} κ inv ( θ ) , and the effect is the one measured in § 5.3 of the main text. (ii) Chain level. Propagating a data error through the inversion chain ψ μ → χ μ → S μ → S G = S μ / S T → χ G → ψ G \psi_\mu\to\chi_\mu\to S_\mu\to S_G=S_\mu/S_T\to\chi_G\to\psi_G ψ μ → χ μ → S μ → S G = S μ / S T → χ G → ψ G meets the amplification factors 1 / ∣ ψ μ ′ ∣ 1/|\psi_\mu'| 1/∣ ψ μ ′ ∣ on the data side, 1 / ∣ S T ∣ 1/|S_T| 1/∣ S T ∣ at the division, and 1 / ∣ χ G ′ ∣ 1/|\chi_G'| 1/∣ χ G ′ ∣ on the side of G G G . Only the first depends on T T T . At the origin it does not: ψ μ ′ ( 0 ) = m 1 ( μ ) = m 1 ( G ) m 1 ( T ) = m 1 ( G ) \psi_\mu'(0)=m_1(\mu)=m_1(G)m_1(T)=m_1(G) ψ μ ′ ( 0 ) = m 1 ( μ ) = m 1 ( G ) m 1 ( T ) = m 1 ( G ) for every T T T with m 1 ( T ) = 1 m_1(T)=1 m 1 ( T ) = 1 , so any dependence on the zero-atom mass enters through the behavior of ψ μ ′ \psi_\mu' ψ μ ′ away from the origin, over the left region on which the inverse χ μ \chi_\mu χ μ is taken. No quantitative value of this modulus is used or claimed. (iii) Benign division. For the two-point distortion law, S T ( w ) = 1 + ( 1 − ℓ q ) χ T ( w ) S_T(w)=1+(1-\ell_q)\chi_T(w) S T ( w ) = 1 + ( 1 − ℓ q ) χ T ( w ) , hence ∣ S T ∣ 2 = ( 1 + ( ℓ q − 1 ) a χ ) 2 + ( ℓ q − 1 ) 2 b χ 2 ≥ 1 |S_T|^2=(1+(\ell_q-1)a_\chi)^2+(\ell_q-1)^2b_\chi^2\geq1 ∣ S T ∣ 2 = ( 1 + ( ℓ q − 1 ) a χ ) 2 + ( ℓ q − 1 ) 2 b χ 2 ≥ 1 for χ T ( w ) = − a χ + i b χ \chi_T(w)=-a_\chi+ib_\chi χ T ( w ) = − a χ + i b χ in the left region, at every q q q . The division therefore never amplifies, which is why an estimate assembled from S S S -side moduli alone cannot capture the degradation. The quantity inf ∣ ψ T ′ ∣ \inf|\psi_T'| inf ∣ ψ T ′ ∣ enters only the exact evaluation of S T S_T S T ; it is a computable proxy correlated with the zero-atom mass, not an error-propagation factor. Note that s μ s_\mu s μ is the companion transform, which is not multiplicative under ⊠ \boxtimes ⊠ ; the multiplicative law belongs to the S S S -transform.
Lemma 4 (plug-in lemma) (i) Multinomial: the argument is the expectation step of Theorem 1(i), but deterministic: ν ^ N m u l t i = 1 N ∑ i Poi ( λ i ) \widehat{\nu}_N^{\mathrm{multi}}=\frac{1}{N}\sum_i\operatorname{Poi}(\lambda_i) ν N multi = N 1 ∑ i Poi ( λ i ) has m ( ϕ ; ν ^ N m u l t i ) = 1 N ∑ i E ϕ ( Poi ( λ i ) ) = m ( ϕ ; ρ N ) → m ( ϕ ; ρ ) m(\phi;\widehat{\nu}_N^{\mathrm{multi}})=\frac{1}{N}\sum_i\mathbb{E}\phi(\operatorname{Poi}(\lambda_i))=m(\phi;\rho_N)\to m(\phi;\rho) m ( ϕ ; ν N multi ) = N 1 ∑ i E ϕ ( Poi ( λ i )) = m ( ϕ ; ρ N ) → m ( ϕ ; ρ ) ; its first moment is exactly 1 1 1 , and its second moment is 1 + 1 N ∑ i λ i 2 = O p ( 1 ) 1+\frac{1}{N}\sum_i\lambda_i^2=O_p(1) 1 + N 1 ∑ i λ i 2 = O p ( 1 ) by (W2). (ii) Residual: ν ^ N r e s \widehat{\nu}_N^{\mathrm{res}} ν N res integrates the bounded continuous kernel ( k , u ) ↦ E ϕ ( k + Poi ( u ) ) (k,u)\mapsto\mathbb{E}\phi(k+\operatorname{Poi}(u)) ( k , u ) ↦ E ϕ ( k + Poi ( u )) against π N ⇒ π \pi_N\Rightarrow\pi π N ⇒ π ; its first moment is exactly 1 1 1 and its second moment is 1 N ∑ i λ i 2 + R N / N = O p ( 1 ) \frac{1}{N}\sum_i\lambda_i^2+R_N/N=O_p(1) N 1 ∑ i λ i 2 + R N / N = O p ( 1 ) . (iii) Lemma 2, whose hypotheses are the first-moment preservation and second-moment boundedness just verified, gives T ^ N ⇒ T \widehat{T}_N\Rightarrow T T N ⇒ T . (iv) Joint continuity of ( G , Q ) ↦ G ⊠ Q (G,Q)\mapsto G\boxtimes Q ( G , Q ) ↦ G ⊠ Q on the relevant compact sets gives uniform continuity on H × ( { T } ∪ { T ^ N } ) \mathcal{H}\times(\{T\}\cup\{\widehat{T}_N\}) H × ({ T } ∪ { T N }) , hence δ N = sup G ∈ H d S t ( G ⊠ T ^ N , G ⊠ T ) → 0 \delta_N=\sup_{G\in\mathcal{H}}d_{\mathrm{St}}(G\boxtimes\widehat{T}_N,G\boxtimes T)\to0 δ N = sup G ∈ H d St ( G ⊠ T N , G ⊠ T ) → 0 in probability. □ \square □
Proof of Theorem 4 (consistency and local error budget)
The assumptions are H 0 ∈ H a , b H_0 \in\mathcal{H}_{a,b} H 0 ∈ H a , b , μ = F T ( H 0 ) \mu= \mathcal{F}_T(H_0) μ = F T ( H 0 ) , R ( H 0 ) < ∞ R(H_0) < \infty R ( H 0 ) < ∞ , and ε N → 0 \varepsilon_N \to0 ε N → 0 , δ N → 0 \delta_N \to0 δ N → 0 , γ N → 0 \gamma_N \to0 γ N → 0 in probability. An argmin exists, since the criterion is lower semicontinuous on the compact set H \mathcal{H} H .
Step 1 (minimality gives the forward fit). By the argmin property and d S t ( μ ^ N , F T ^ N ( H 0 ) ) ≤ ε N + δ N d_{\mathrm{St}}(\widehat{\mu}_N,\mathcal{F}_{\widehat{T}_N}(H_0)) \le\varepsilon_N+\delta_N d St ( μ N , F T N ( H 0 )) ≤ ε N + δ N ,
d S t ( μ ^ N , F T ^ N ( H ^ N ) ) 2 + γ N R ( H ^ N ) ≤ ( ε N + δ N ) 2 + γ N R ( H 0 ) . d_{\mathrm{St}}(\widehat{\mu}_N,\mathcal{F}_{\widehat{T}_N}(\widehat{H}_N))^2+\gamma_N R(\widehat{H}_N)\le(\varepsilon_N+\delta_N)^2+\gamma_N R(H_0). d St ( μ N , F T N ( H N ) ) 2 + γ N R ( H N ) ≤ ( ε N + δ N ) 2 + γ N R ( H 0 ) .
Step 2 (forward residual). By the triangle inequality,
d S t ( F T ( H ^ N ) , F T ( H 0 ) ) ≤ δ N + ( ε N + δ N ) 2 + γ N R ( H 0 ) + ε N → 0 in probability. d_{\mathrm{St}}(\mathcal{F}_T(\widehat{H}_N),\mathcal{F}_T(H_0))\le\delta_N+\sqrt{(\varepsilon_N+\delta_N)^2+\gamma_N R(H_0)}+\varepsilon_N\to0 \quad\text{in probability.} d St ( F T ( H N ) , F T ( H 0 )) ≤ δ N + ( ε N + δ N ) 2 + γ N R ( H 0 ) + ε N → 0 in probability.
Step 3 (consistency by the homeomorphism argument). H \mathcal{H} H is compact and F T \mathcal{F}_T F T is continuous and injective, so F T : H → F T ( H ) \mathcal{F}_T:\mathcal{H}\to\mathcal{F}_T(\mathcal{H}) F T : H → F T ( H ) is a continuous bijection from a compact space onto a Hausdorff space, hence a homeomorphism, and its inverse is uniformly continuous on the compact image. Therefore the convergence of Step 2 implies W 1 ( H ^ N , H 0 ) → 0 W_1(\widehat{H}_N,H_0)\to0 W 1 ( H N , H 0 ) → 0 in probability; continuous maps preserve convergence in probability, and no subsequence extraction is needed. □
Step 4 (the budget; no circularity). Neighborhood entry: Δ U : = inf G ∈ H ∖ U d S t ( F T ( G ) , F T ( H 0 ) ) > 0 \Delta_{\mathcal{U}}:=\inf_{G\in\mathcal{H}\setminus\mathcal{U}}d_{\mathrm{St}}(\mathcal{F}_T(G),\mathcal{F}_T(H_0))>0 Δ U := inf G ∈ H ∖ U d St ( F T ( G ) , F T ( H 0 )) > 0 , since H ∖ U \mathcal{H}\setminus\mathcal{U} H ∖ U is compact in the relative topology, F T \mathcal{F}_T F T is continuous, and injectivity makes the function pointwise positive; a vanishing forward residual therefore forces P ( H ^ N ∈ U ) → 1 \mathbb{P}(\widehat{H}_N\in\mathcal{U})\to1 P ( H N ∈ U ) → 1 . On that event, distinguish W 1 ( H ^ N , H 0 ) ≥ θ W_1(\widehat{H}_N,H_0)\ge\theta W 1 ( H N , H 0 ) ≥ θ and W 1 ( H ^ N , H 0 ) < θ W_1(\widehat{H}_N,H_0)<\theta W 1 ( H N , H 0 ) < θ . In the first case the definition of κ : = κ i n v ( H 0 , T ; U ) \kappa:=\kappa_{\mathrm{inv}}(H_0,T;\mathcal{U}) κ := κ inv ( H 0 , T ; U ) applies to the pair ( H ^ N , H 0 ) (\widehat{H}_N,H_0) ( H N , H 0 ) and gives
W 1 ( H ^ N , H 0 ) ≤ κ − 1 [ δ N + ( ε N + δ N ) 2 + γ N R ( H 0 ) + ε N ] = : B N ; W_1(\widehat{H}_N,H_0)\le\kappa^{-1}\left[\delta_N+\sqrt{(\varepsilon_N+\delta_N)^2+\gamma_N R(H_0)}+\varepsilon_N\right]=:B_N; W 1 ( H N , H 0 ) ≤ κ − 1 [ δ N + ( ε N + δ N ) 2 + γ N R ( H 0 ) + ε N ] =: B N ;
in the second case W 1 ( H ^ N , H 0 ) < θ W_1(\widehat{H}_N,H_0)<\theta W 1 ( H N , H 0 ) < θ trivially. Hence W 1 ( H ^ N , H 0 ) ≤ max { θ , B N } W_1(\widehat{H}_N,H_0)\le\max\{\theta,B_N\} W 1 ( H N , H 0 ) ≤ max { θ , B N } . The condition number is evaluated at the true pair ( H 0 , T ) (H_0,T) ( H 0 , T ) , while the estimate is computed at the realized pair, so no circularity arises. Moreover B N ≤ κ − 1 [ 2 ε N + 2 δ N + γ N R ( H 0 ) ] B_N\le\kappa^{-1}[2\varepsilon_N+2\delta_N+\sqrt{\gamma_N R(H_0)}] B N ≤ κ − 1 [ 2 ε N + 2 δ N + γ N R ( H 0 ) ] by x 2 + y 2 ≤ x + y \sqrt{x^2+y^2}\le x+y x 2 + y 2 ≤ x + y , and the rate statement follows by substitution. □
Proof of Theorem 5 (consistent mismatch certificate)
With ε m o d e l : = inf G ∈ H d S t ( μ , G ⊞ T ) \varepsilon_{\mathrm{model}}:=\inf_{G\in\mathcal{H}}d_{\mathrm{St}}(\mu,G\boxplus T) ε model := inf G ∈ H d St ( μ , G ⊞ T ) and ε ^ m o d e l , N : = inf G ∈ H d S t ( μ ^ N , G ⊞ T ^ N ) \widehat{\varepsilon}_{\mathrm{model},N}:=\inf_{G\in\mathcal{H}}d_{\mathrm{St}}(\widehat{\mu}_N,G\boxplus\widehat{T}_N) ε model , N := inf G ∈ H d St ( μ N , G ⊞ T N ) , the inequality ∣ inf f N − inf f ∣ ≤ sup ∣ f N − f ∣ |\inf f_N-\inf f|\le\sup|f_N-f| ∣ inf f N − inf f ∣ ≤ sup ∣ f N − f ∣ and the triangle inequality give
∣ d S t ( μ ^ N , G ⊞ T ^ N ) − d S t ( μ , G ⊞ T ) ∣ ≤ d S t ( μ ^ N , μ ) + d S t ( G ⊞ T ^ N , G ⊞ T ) ≤ ε N + δ N , \left|d_{\mathrm{St}}(\widehat{\mu}_N,G\boxplus\widehat{T}_N)-d_{\mathrm{St}}(\mu,G\boxplus T)\right|\le d_{\mathrm{St}}(\widehat{\mu}_N,\mu)+d_{\mathrm{St}}(G\boxplus\widehat{T}_N,G\boxplus T)\le\varepsilon_N+\delta_N, d St ( μ N , G ⊞ T N ) − d St ( μ , G ⊞ T ) ≤ d St ( μ N , μ ) + d St ( G ⊞ T N , G ⊞ T ) ≤ ε N + δ N ,
uniformly over G ∈ H G\in\mathcal{H} G ∈ H ; taking suprema gives ∣ ε ^ m o d e l , N − ε m o d e l ∣ ≤ ε N + δ N → 0 |\widehat{\varepsilon}_{\mathrm{model},N}-\varepsilon_{\mathrm{model}}|\le\varepsilon_N+\delta_N\to0 ∣ ε model , N − ε model ∣ ≤ ε N + δ N → 0 in probability. The argument uses only the triangle inequality, so it applies verbatim to the implemented discrepancy of Remark 2. □ \square □
Mismatch. If μ ∉ F T ( H ) \mu\notin\mathcal{F}_{T}(\mathcal{H}) μ ∈ / F T ( H ) , the estimator targets the pseudo-true spectrum H † H^{\dagger} H † . If H † H^{\dagger} H † is the unique minimizer and κ i n v ( θ ) ( H † , T ; U ) > 0 \kappa_{\mathrm{inv}}^{(\theta)}(H^{\dagger},T;\mathcal{U})>0 κ inv ( θ ) ( H † , T ; U ) > 0 , the argument of S-F applies with H † H^{\dagger} H † in place of H 0 H_{0} H 0 ; the forward residual at H † H^{\dagger} H † equals ε m o d e l \varepsilon_{\mathrm{model}} ε model , which shifts the budget by an additive ε m o d e l \varepsilon_{\mathrm{model}} ε model in the forward metric only.
Proofs for Chapter 4 (legitimate rejuvenation)
Lemma 5. Metropolis–Hastings kernels satisfy detailed balance with respect to their actual target π ~ k N \widetilde{\pi}_{k}^{N} π k N . With asymmetric proposals, for example when G β G_{\beta} G β enters the proposal, the full Hastings correction α ( x , x ′ ) = 1 ∧ π ~ k N ( x ′ ) q k ( x ∣ x ′ ) π ~ k N ( x ) q k ( x ′ ∣ x ) \alpha(x,x')=1\wedge\frac{\widetilde{\pi}_{k}^{N}(x')q_{k}(x\mid x')}{\widetilde{\pi}_{k}^{N}(x)q_{k}(x'\mid x)} α ( x , x ′ ) = 1 ∧ π k N ( x ) q k ( x ′ ∣ x ) π k N ( x ′ ) q k ( x ∣ x ′ ) restores reversibility. Hence π ~ k N R k = π ~ k N \widetilde{\pi}_{k}^{N}R_{k}=\widetilde{\pi}_{k}^{N} π k N R k = π k N . The floor M k ⪰ ε I M_{k}\succeq\varepsilon I M k ⪰ ε I makes the proposal covariance nondegenerate in all directions; it does not by itself imply geometric ergodicity. □ \square □
Lemma 6. Under design choice I, π ~ k N = π ~ k N \widetilde{\pi}_{k}^{N}=\widetilde{\pi}_{k}^{N} π k N = π k N , so the move kernel leaves the conditional SMC target invariant. The extended-target representation of SMC samplers [13 ] and of particle Markov chain Monte Carlo [14 ] then applies: the selection-and-move particle system is exact on the extended target, and marginal consistency follows from Feynman–Kac semigroup theory [7 ] , independently of the number of move steps. Under design choice II, Lemma 5 gives invariance only for the surrogate π ~ k N \widetilde{\pi}_{k}^{N} π k N . □ \square □
Theorem 7. Work conditionally on F k − 1 N \mathcal{F}_{k-1}^{N} F k − 1 N . Under the assumed drift–minorization condition for the resulting Metropolis–Hastings kernel, with F k − 1 N \mathcal{F}_{k-1}^{N} F k − 1 N -measurable constants C k , ϱ k C_{k},\varrho_{k} C k , ϱ k (or, for preconditioned MALA, the cited regularity and tail assumptions [15 ] ), the conditional mixing bound
d ( L ( X k , L k a l g ∣ F k − 1 N ) , π ~ k N ) ≤ C k ( F k − 1 N ) ϱ k ( F k − 1 N ) L k d\left(\mathcal{L}\left(X_{k,L_{k}}^{\mathrm{alg}}\mid\mathcal{F}_{k-1}^{N}\right),\widetilde{\pi}_{k}^{N}\right)\leq C_{k}\left(\mathcal{F}_{k-1}^{N}\right)\varrho_{k}\left(\mathcal{F}_{k-1}^{N}\right)^{L_{k}} d ( L ( X k , L k alg ∣ F k − 1 N ) , π k N ) ≤ C k ( F k − 1 N ) ϱ k ( F k − 1 N ) L k
holds in a metric compatible with the mixing theorem (total variation, a V V V -norm, or a weak metric dominated by it). The conditional triangle inequality then gives
d ( π k , L ( X k , L k a l g ∣ F k − 1 N ) ) ≤ d ( π k , π ~ k N ) + C k ϱ k L k . d\left(\pi_{k},\mathcal{L}\left(X_{k,L_{k}}^{\mathrm{alg}}\mid\mathcal{F}_{k-1}^{N}\right)\right)\leq d\left(\pi_{k},\widetilde{\pi}_{k}^{N}\right)+C_{k}\varrho_{k}^{L_{k}}. d ( π k , L ( X k , L k alg ∣ F k − 1 N ) ) ≤ d ( π k , π k N ) + C k ϱ k L k .
For each fixed k k k , standard Feynman–Kac stability assumptions imply d B L ( π ~ k N , π k ) → 0 d_{\mathrm{BL}}(\widetilde{\pi}_{k}^{N},\pi_{k})\to0 d BL ( π k N , π k ) → 0 in probability; if the mixing bound is stated in a V V V -norm, the particle-filter term is matched in the same norm or dominated through it. Unconditional versions follow by taking expectations. Under design choice I the target-approximation term vanishes identically, and Σ ^ l i f t \widehat{\Sigma}^{\mathrm{lift}} Σ lift enters only through the constants C k C_{k} C k and ϱ k \varrho_{k} ϱ k . □ \square □
Proofs for Chapter 4 (the full-cycle recursion)
Corollary 3. This is the conjunction of Theorem 3 (the forward distortion) and Theorem 4 (the inversion budget). □ \square □
Theorem 8. The ideal distortion-free laws are defined by H k + 1 ⋆ , − = ( D a k ) # H k ⋆ , + ⊞ δ q k H_{k+1}^{\star,-}=(D_{a_{k}})_{\#}H_{k}^{\star,+}\boxplus\delta_{q_{k}} H k + 1 ⋆ , − = ( D a k ) # H k ⋆ , + ⊞ δ q k together with the ideal-correction identity H k ⋆ , + : = H k ⋆ , − H_{k}^{\star,+}:=H_{k}^{\star,-} H k ⋆ , + := H k ⋆ , − ; the algorithmic output is H k + = H ^ k H_{k}^{+}=\widehat{H}_{k} H k + = H k , and the tracked error is η k : = W 1 ( H k + , H k ⋆ , + ) \eta_{k}:=W_{1}(H_{k}^{+},H_{k}^{\star,+}) η k := W 1 ( H k + , H k ⋆ , + ) . For t ≥ 0 t\geq0 t ≥ 0 , W 1 ( ( D t ) # μ , ( D t ) # ν ) = t W 1 ( μ , ν ) W_{1}((D_{t})_{\#}\mu,(D_{t})_{\#}\nu)=tW_{1}(\mu,\nu) W 1 (( D t ) # μ , ( D t ) # ν ) = t W 1 ( μ , ν ) , and translation is an isometry, W 1 ( μ ⊞ δ q , ν ⊞ δ q ) = W 1 ( μ , ν ) W_1(\mu\boxplus\delta_q, \nu\boxplus\delta_q) = W_1(\mu,\nu) W 1 ( μ ⊞ δ q , ν ⊞ δ q ) = W 1 ( μ , ν ) . With t = a k 2 t = a_k^2 t = a k 2 , propagation contributes the factor a k 2 ≤ a ˉ 2 a_k^2 \le\bar{a}^2 a k 2 ≤ a ˉ 2 . The distortion introduced by selection is removed by the correction step, whose error is bounded by B k + 1 k = max { θ , B k + 1 } \mathcal{B}_{k+1}^k = \max\{\theta, B_{k+1}\} B k + 1 k = max { θ , B k + 1 } by Theorem 4 applied at step k + 1 k+1 k + 1 with the uniform bound κ i n v , k ( θ ) ≥ κ 0 \kappa_{\mathrm{inv},k}^{(\theta)} \ge\kappa_0 κ inv , k ( θ ) ≥ κ 0 . Iteration gives η k ≤ a ˉ 2 k η 0 + ∑ j < k a ˉ 2 ( k − 1 − j ) B θ j + 1 \eta_k \le\bar{a}^{2k}\eta_0 + \sum_{j<k}\bar{a}^{2(k-1-j)}B\theta_{j+1} η k ≤ a ˉ 2 k η 0 + ∑ j < k a ˉ 2 ( k − 1 − j ) B θ j + 1 . The fixed-horizon statement needs only Theorem 4 at each step with min k ≤ K N k → ∞ \min_{k\le K}N_k \to\infty min k ≤ K N k → ∞ ; the long-horizon statement needs the time-uniform high-probability envelope B k ≤ b k B_k \le b_k B k ≤ b k , which a per-time o p ( 1 ) o_p(1) o p ( 1 ) statement does not imply. With the envelope, lim sup k η k ≤ max { θ , sup k b k } / ( 1 − a ˉ 2 ) \limsup_k \eta_k \le\max\{\theta,\sup_k b_k\}/(1-\bar{a}^2) lim sup k η k ≤ max { θ , sup k b k } / ( 1 − a ˉ 2 ) , the fixed point of the recursion under the ceiling. For moment boundedness, corrected spectra lie in the common compact class, so m 2 ( H k + ) ≤ b 2 m_2(H_k^+) \le b^2 m 2 ( H k + ) ≤ b 2 , and the propagated laws obey m 2 ( H k + 1 − ) = a k 4 m 2 ( H k + ) + 2 a k 2 q k m 1 ( H k + ) + q k 2 m_2(H_{k+1}^-) = a_k^4m_2(H_k^+) + 2a_k^2q_km_1(H_k^+) + q_k^2 m 2 ( H k + 1 − ) = a k 4 m 2 ( H k + ) + 2 a k 2 q k m 1 ( H k + ) + q k 2 , with first-moment recursion m 1 ( H k + 1 − ) = a k 2 m 1 ( H k + ) + q k m_1(H_{k+1}^-) = a_k^2m_1(H_k^+) + q_k m 1 ( H k + 1 − ) = a k 2 m 1 ( H k + ) + q k ; both are uniformly bounded under a ˉ < 1 \bar{a}<1 a ˉ < 1 , q k ≤ q max q_k\le q_{\max} q k ≤ q m a x , and the support bound. For positive invariance of [ a , b ] [a,b] [ a , b ] , the conditions a ≤ q min a\le q_{\min} a ≤ q m i n and b ≥ q max / ( 1 − a ˉ 2 ) b\ge q_{\max}/(1-\bar{a}^2) b ≥ q m a x / ( 1 − a ˉ 2 ) suffice, with the initial support contained in [ a , b ] [a,b] [ a , b ] . □
Proposition 1. In the setting of Theorem 8 , let A ⊆ { 1 , … , K } A\subseteq\{1,\ldots,K\} A ⊆ { 1 , … , K } be the abstention set, and let the per-step budgets be b j b_j b j on corrected steps and δ f b , j \delta_{\mathrm{fb},j} δ fb , j on abstention steps, each capped below by θ \theta θ as in § 3.4 of the main text. Substituting these budgets termwise in the error recursion gives
η K ≤ a ˉ 2 K η 0 + ∑ j = 1 K a ˉ 2 ( K − j ) [ b j 1 { j ∉ A } + δ f b , j 1 { j ∈ A } ] . \eta_K \le\bar{a}^{2K}\eta_0+\sum_{j=1}^{K}\bar{a}^{2(K-j)}\left[b_j\mathbf{1}_{\{j\notin A\}}+\delta_{\mathrm{fb},j}\mathbf{1}_{\{j\in A\}}\right]. η K ≤ a ˉ 2 K η 0 + j = 1 ∑ K a ˉ 2 ( K − j ) [ b j 1 { j ∈ / A } + δ fb , j 1 { j ∈ A } ] .
Taking suprema, with b ˉ θ = max { θ , b ˉ } \bar{b}^{\theta}=\max\{\theta,\bar{b}\} b ˉ θ = max { θ , b ˉ } and δ ˉ θ = max { θ , δ ˉ } \bar{\delta}^{\theta}=\max\{\theta,\bar{\delta}\} δ ˉ θ = max { θ , δ ˉ } , and separating the exchange term,
lim sup K η K ≤ b ˉ θ 1 − a ˉ 2 + ( δ ˉ θ − b ˉ θ ) lim sup K Λ K , Λ K ≤ 1 − a ˉ 2 A K 1 − a ˉ 2 ( A K = ∣ A ∣ ) . \limsup_{K}\eta_K\le\frac{\bar{b}^{\theta}}{1-\bar{a}^2}+(\bar{\delta}^{\theta}-\bar{b}^{\theta})\limsup_{K}\Lambda_K,\qquad\Lambda_K\le\frac{1-\bar{a}^{2A_K}}{1-\bar{a}^2}\quad(A_K=|A|). K lim sup η K ≤ 1 − a ˉ 2 b ˉ θ + ( δ ˉ θ − b ˉ θ ) K lim sup Λ K , Λ K ≤ 1 − a ˉ 2 1 − a ˉ 2 A K ( A K = ∣ A ∣ ) .
If b k → 0 b_k\to0 b k → 0 and Λ K → 0 \Lambda_K\to0 Λ K → 0 , the bound reduces to the resolution floor θ / ( 1 − a ˉ 2 ) \theta/(1-\bar{a}^2) θ / ( 1 − a ˉ 2 ) . The relevant condition is a vanishing geometric load, not A K = o ( K ) A_K=o(K) A K = o ( K ) : abstentions clustered at the end of the horizon are fully felt, since the geometric kernel has memory of order ( 1 − a ˉ 2 ) − 1 (1-\bar{a}^2)^{-1} ( 1 − a ˉ 2 ) − 1 . Finally, if H k ∗ , − ∉ H a , b H_k^{*,-}\notin\mathcal{H}_{a,b} H k ∗ , − ∈ / H a , b , every output in H a , b \mathcal{H}_{a,b} H a , b lies at W 1 W_1 W 1 distance at least dist W 1 ( H k ∗ , − , H a , b ) > 0 \operatorname{dist}_{W_1}(H_k^{*,-},\mathcal{H}_{a,b})>0 dist W 1 ( H k ∗ , − , H a , b ) > 0 from the ideal law, which is positive because H a , b \mathcal{H}_{a,b} H a , b is closed in W 1 W_1 W 1 ; when this distance exceeds δ f b , k \delta_{\mathrm{fb},k} δ fb , k , abstention is the optimal feasible action. □
Remark (accepted steps). On accepted steps H ^ k ∈ H a , b \widehat{H}_k\in\mathcal{H}_{a,b} H k ∈ H a , b , hence ∫ τ 2 H ^ k ( d τ ) ≤ b 2 \int\tau^2\widehat{H}_k(\mathrm{d}\tau)\le b^2 ∫ τ 2 H k ( d τ ) ≤ b 2 and H ^ k ( { 0 } ) = 0 \widehat{H}_k(\{0\})=0 H k ({ 0 }) = 0 by the definition of the candidate class. This is a regularity property of accepted outputs, not a dynamical-stability statement.
Auxiliary computations
Le Cam bound: d T V ( Bin ( N , λ / N ) , Poi ( λ ) ) ≤ N ( λ / N ) 2 = λ 2 / N d_{\mathrm{TV}}(\operatorname{Bin}(N,\lambda/N),\operatorname{Poi}(\lambda))\le N(\lambda/N)^2=\lambda^2/N d TV ( Bin ( N , λ / N ) , Poi ( λ )) ≤ N ( λ / N ) 2 = λ 2 / N .
Poisson continuity in total variation: d T V ( Poi ( λ ) , Poi ( λ ′ ) ) ≤ ∣ λ − λ ′ ∣ d_{\mathrm{TV}}(\operatorname{Poi}(\lambda),\operatorname{Poi}(\lambda'))\le|\lambda-\lambda'| d TV ( Poi ( λ ) , Poi ( λ ′ )) ≤ ∣ λ − λ ′ ∣ .
Multinomial factorial moments: E [ ( n i 1 ) a 1 ⋯ ( n i r ) a r ] = ( N ) a 1 + ⋯ + a r w i 1 a 1 ⋯ w i r a r \mathbb{E}[(n_{i_1})_{a_1}\cdots(n_{i_r})_{a_r}]=(N)_{a_1+\cdots+a_r}w_{i_1}^{a_1}\cdots w_{i_r}^{a_r} E [( n i 1 ) a 1 ⋯ ( n i r ) a r ] = ( N ) a 1 + ⋯ + a r w i 1 a 1 ⋯ w i r a r for distinct indices.
Linear-form variance: for n ~ ∼ Multinomial ( R ; p ) \tilde{n}\sim\operatorname{Multinomial}(R;p) n ~ ∼ Multinomial ( R ; p ) , Var ( ∑ a i n ~ i ) = R [ ∑ p i a i 2 − ( ∑ p i a i ) 2 ] = \operatorname{Var}(\sum a_i\tilde{n}_i)=R\left[\sum p_i a_i^2-\left(\sum p_i a_i\right)^2\right]= Var ( ∑ a i n ~ i ) = R [ ∑ p i a i 2 − ( ∑ p i a i ) 2 ] =
∑ u i a i 2 − ( ∑ u i a i ) 2 / R with u i = R p i . \sum u_i a_i^2-\left(\sum u_i a_i\right)^2/R \quad\text{with }u_i=Rp_i. ∑ u i a i 2 − ( ∑ u i a i ) 2 / R with u i = R p i .
The maximum-atom rule for ⊠ \boxtimes ⊠ on R ≥ 0 \mathbb{R}_{\ge0} R ≥ 0 and the conventions of the companion fixed-point equation follow [1 ] .
Poisson fourth moment: E M 4 = λ 4 + 6 λ 3 + 7 λ 2 + λ \mathbb{E}M^4=\lambda^4+6\lambda^3+7\lambda^2+\lambda E M 4 = λ 4 + 6 λ 3 + 7 λ 2 + λ for M ∼ Poi ( λ ) M\sim\operatorname{Poi}(\lambda) M ∼ Poi ( λ ) , whence Var ( M 2 ) = 4 λ 3 + 6 λ 2 + λ \operatorname{Var}(M^2)=4\lambda^3+6\lambda^2+\lambda Var ( M 2 ) = 4 λ 3 + 6 λ 2 + λ .
Numerical conditioning on the two-point family
Pipeline. For two-point candidate spectra H = p 1 δ σ 1 + ( 1 − p 1 ) δ σ 2 H=p_1\delta_{\sigma_1}+(1-p_1)\delta_{\sigma_2} H = p 1 δ σ 1 + ( 1 − p 1 ) δ σ 2 , ψ H ( z ) = p 1 σ 1 z 1 − σ 1 z + ( 1 − p 1 ) σ 2 z 1 − σ 2 z \psi_H(z)=p_1\frac{\sigma_1z}{1-\sigma_1z}+(1-p_1)\frac{\sigma_2z}{1-\sigma_2z} ψ H ( z ) = p 1 1 − σ 1 z σ 1 z + ( 1 − p 1 ) 1 − σ 2 z σ 2 z is rational, so χ H = ψ H − 1 \chi_H=\psi_H^{-1} χ H = ψ H − 1 solves a quadratic equation; then S H ( w ) = ( 1 + w ) χ H ( w ) / w S_H(w)=(1+w)\chi_H(w)/w S H ( w ) = ( 1 + w ) χ H ( w ) / w , S M P ( c ) ( w ) = 1 / ( 1 + c w ) S_{\mathrm{MP}(c)}(w)=1/(1+cw) S MP ( c ) ( w ) = 1/ ( 1 + c w ) , and S μ = S H S T S_\mu=S_HS_T S μ = S H S T , with density recovery through the companion transform and Stieltjes inversion. For T = T c ( ν ) T=\mathcal{T}_c(\nu) T = T c ( ν ) the companion transform solves the fixed-point equation of [1 ] with the validated solver.
Computed instance. With d = 900 d=900 d = 900 , paired seeds, d S t d_{\mathrm{St}} d St at bandwidth 0.05 0.05 0.05 , and eight perturbations of H 0 = 0.7 δ 0.5 + 0.3 δ 2.5 H_0=0.7\delta_{0.5}+0.3\delta_{2.5} H 0 = 0.7 δ 0.5 + 0.3 δ 2.5 : for the baseline T = M P ( c ) T=\mathrm{MP}(c) T = MP ( c ) , that is ν = δ 1 \nu=\delta_1 ν = δ 1 , the estimated condition number declines mildly as c c c grows over the range studied, so pure sampling noise never collapses the conditioning. With resampling distortion, T = T c ( MixPoi ( ρ α ) ) T=\mathcal{T}_c(\operatorname{MixPoi}(\rho_\alpha)) T = T c ( MixPoi ( ρ α )) , the estimate is lowest at ( c , α ) = ( 0.75 , 0.3 ) (c,\alpha)=(0.75,0.3) ( c , α ) = ( 0.75 , 0.3 ) , where the zero atom is largest, and stays of order one elsewhere. The individual values of this sweep are not registered in the deviation ledger; they are stated qualitatively here, and no sequence of them enters any theorem.
Map level and pipeline level. The conditioning of the map itself degrades only mildly and tracks the zero-atom mass. The much stronger degradation measured in the experiments arises from the inversion pipeline (discretization, optimizer, and bandwidth) amplifying the ill-conditioning of the map, consistently with the bandwidth dependence of the activation boundary (S8). In short, the ill-conditioning is driven at the map level by the zero-atom mass and amplified at the pipeline level by discretization.
Status. No explicit constant is claimed (S-E). The rigorous content is the positivity of Theorem 6. The computations of this section are numerical evidence on a single computable family: they evaluate closed-form transforms in floating point, without interval enclosures, and they serve to locate the degradation, at the map level or at the pipeline level, rather than to bound κ i n v ( θ ) \kappa_{\mathrm{inv}}^{(\theta)} κ inv ( θ ) . No quantity computed here enters any theorem.
Low-rank weight dependence leaves the spectral law unchanged
Proposition S2. Let X N = Σ N 1 / 2 Z N X_N=\Sigma_N^{1/2}Z_N X N = Σ N 1/2 Z N under (G1)–(G3), and let the weights depend only on a q q q -dimensional projection, w i = ω ( B ⊤ x i ) w_i=\omega(B^\top x_i) w i = ω ( B ⊤ x i ) with B ∈ R d × q B\in\mathbb{R}^{d\times q} B ∈ R d × q , q = q N q=q_N q = q N and q N / d → 0 q_N/d\to0 q N / d → 0 . Then the limiting spectral distribution of the weighted or resampled second-moment matrix equals that of an exogenous-weight model with the same weight law: the dependence enters only through a channel of rank O ( q ) O(q) O ( q ) , and the ESD deviation is O ( q / d ) → 0 O(q/d)\to0 O ( q / d ) → 0 .
Proof. Write x i = m ( u i ) + e i x_i=m(u_i)+e_i x i = m ( u i ) + e i with u i = B ⊤ x i ∈ R q u_i=B^\top x_i\in\mathbb{R}^q u i = B ⊤ x i ∈ R q and m ( u i ) = E [ x i ∣ u i ] m(u_i)=\mathbb{E}[x_i\mid u_i] m ( u i ) = E [ x i ∣ u i ] , where e i e_i e i is independent of u i u_i u i with deterministic conditional covariance Σ c \Sigma_c Σ c (in the Gaussian case; in
general this is the orthogonal decomposition onto the range of B B B ). Condition on U = { u i } U = \{u_i\} U = { u i } , which determines all weights. Then
S w ∣ U = 1 N ∑ i λ i e i e i T + 1 N ∑ i λ i ( m i e i T + e i m i T ) + 1 N ∑ i λ i m i m i T , m i : = m ( u i ) . S_w \mid U = \frac{1}{N}\sum_i \lambda_i e_i e_i^{\mathsf T} + \frac{1}{N}\sum_i \lambda_i(m_i e_i^{\mathsf T} + e_i m_i^{\mathsf T}) + \frac{1}{N}\sum_i \lambda_i m_i m_i^{\mathsf T}, \qquad m_i := m(u_i). S w ∣ U = N 1 i ∑ λ i e i e i T + N 1 i ∑ λ i ( m i e i T + e i m i T ) + N 1 i ∑ λ i m i m i T , m i := m ( u i ) .
(i) Given U U U , the weights are deterministic and the e i e_i e i are i.i.d. with covariance Σ c \Sigma_c Σ c , so the first term is exactly an exogenous-weight model and Theorem 3 applies with the population law H c H_c H c of Σ c \Sigma_c Σ c ; since Σ − Σ c \Sigma-\Sigma_c Σ − Σ c has rank at most q q q by the Schur-complement form, ∣ F H − F H c ∣ ≤ q / d \lvert F^H-F^{H_c}\rvert\le q/d ∣ F H − F H c ∣ ≤ q / d . (ii) The mean term has rank at most q q q , each m i m_i m i lying in the range of B B B . (iii) The cross term equals 1 N ( M Λ E T + E Λ M T ) \frac{1}{N}(M\Lambda E^{\mathsf T}+E\Lambda M^{\mathsf T}) N 1 ( M Λ E T + E Λ M T ) and has rank at most 2 q 2q 2 q . By the ESD rank inequality, sup x ∣ F S w − F S w e x o g ∣ = O ( q / d ) → 0 \sup_x\lvert F^{S_w}-F^{S_w^{\mathrm{exog}}}\rvert=O(q/d)\to0 sup x ∣ F S w − F S w exog ∣ = O ( q / d ) → 0 . The conditional exogeneity required by (G4) is preserved for the resampling step, since counts given ( X , w ) (X,w) ( X , w ) remain distributed according to the scheme with weights depending on U U U only. The moment controls needed are (W2) for the weight law, assumed on ω \omega ω , and E [ λ ∥ m ( u ) ∥ 2 ] < ∞ \mathbb{E}[\lambda\lVert m(u)\rVert^2]<\infty E [ λ ∥ m ( u ) ∥ 2 ] < ∞ . □
Remark. This explains why the mismatch certificate does not fire under low-rank endogenous weights (§ 5.3 of the main text): at the level of the limiting spectral distribution there is nothing to detect. The proposition partially relaxes (G4); general likelihood-driven weights remain out of scope (§ 6.1 of the main text).
Part II. Experimental sections
S1. Count-law checks
The distribution of the count vector is the premise of the spectral-repair argument, and this section checks it. The figure reports the empirical probability mass function of the counts against the limiting laws (the mixed Poisson law for multinomial resampling, the floor-fraction law for residual resampling) for N ∈ { 500 , 2000 } N \in\{500, 2000\} N ∈ { 500 , 2000 } , α ∈ { 1 , 0.3 } \alpha\in\{1, 0.3\} α ∈ { 1 , 0.3 } , and both schemes. The mean of n j n_j n j equals 1.00 identically, as required by ∑ i n i / N = 1 \sum_i n_i/N = 1 ∑ i n i / N = 1 , and the L 1 L^1 L 1 distances between the empirical and theoretical laws are 0.028 to 0.060, the magnitude of the sampling error expected at 2000 draws. Panel (c) places the source of the zero atom, the count-rank identity 1 − ( N p s − 1 ) / d 1 - (Np_s - 1)/d 1 − ( N p s − 1 ) / d , next to its cause, the count law: the zero atom is a consequence of bookkeeping, not a modeling assumption.
Complete comparison for Corollary 2
Figure S2. Complete comparison for Corollary 2. (a) The active-column fraction p s p_s p s is ordered by the convex order and not by r 2 r_2 r 2 ; equal r 2 r_2 r 2 can give different p s p_s p s . (b) Two laws with r 2 = 2 r_2 = 2 r 2 = 2 and equal second moment produce different limiting spectra and zero atoms. (c) The scheme-specific excess over the weighted ensemble: c a 1 2 ca_1^2 c a 1 2 for multinomial resampling and c a 1 2 E π U ca_1^2\mathbb{E}_{\pi}U c a 1 2 E π U for residual resampling.
(1) The active-column fraction p s p_s p s is ordered by the convex order, not by the second moment. The three chains (Gamma with α \alpha α from 100 to 0.3, log-normal with variance from 0.25 to 4, and symmetric two-point with spread from 0 to 1) decrease strictly as predicted, and all 17 laws fall within three standard errors plus 0.002 of the closed-form values; the upper bound $1 - e^{-1}i s a t t a i n e d o n l y b y t h e d e g e n e r a t e l a w . ( 2 ) T h e c o u n t e r e x a m p l e f a m i l y a t is attained only by the degenerate law. (2) The counterexample family at i s a tt ain e d o n l y b y t h e d e g e n er a t e l a w . ( 2 ) T h eco u n t er e x am pl e f ami l y a t r_2 = 2: five laws share the same second moment but differ in active-column fraction (from 0.432 to 0.584), in zero-atom mass at c = 0.75 c = 0.75 c = 0.75 (from 0.220 to 0.425), and in the entire limiting law (pairwise closed-form W 1 W_1 W 1 from 0.030 to 0.185); at c = 0.5 c = 0.5 c = 0.5 the difference becomes qualitative, with one law rank-deficient and two at full rank. This is the numerical evidence that r 2 r_2 r 2 alone is not a strong enough partial order for p s p_s p s . (3) The comparison of residual and multinomial resampling: the multinomial excess over the weighted ensemble is c a 1 2 ca_1^2 c a 1 2 for all 17 laws, and the residual excess matches the closed form c a 1 2 E π [ U ] ca_1^2\mathbb{E}_{\pi}[U] c a 1 2 E π [ U ] pointwise.
With integer-valued weights, residual resampling equals the weighted ensemble exactly at every repetition, as it must.
Failed calibration test and its mechanism. The pre-registered calibration test for the centered statistic, a cross-law regression of the centered second spectral moment on r 2 , N r_{2,N} r 2 , N , fails: the measured slope deviates by about 8% against a 2% tolerance (slope 0.834 against the theoretical 0.909). The post hoc diagnosis, recorded as such, is that the rank-one centering gap grows with the heaviest weight, and heavy-tailed weight laws (for example the log-normal law with variance 4, whose realized r 2 , N r_{2,N} r 2 , N ranges from 3.5 to 26.5) make that gap non-negligible; the uncentered version of the same statistic is unbiased (mean error 0.002, standard deviation 0.066). The linear law of Corollary 2(4) of the main text, which is exact conditionally on the counts, is therefore not refuted; what fails is the use of the centered statistic as a direct calibration under heavy-tailed weights. The evidence for Corollary 2(4) in the main text accordingly rests on items (2) and (3).
Inversion sensitivity
Figure S3. Inversion sensitivity. (a) The fixed regularization schedule γ 0 / N \gamma_0/N γ 0 / N against the scale-free schedule in the strong-anisotropy regime; dashed lines mark the true values. (b) Relative difference in W 1 W_1 W 1 between the two schedules, per experiment and step. (c) Activation counts of the comparative clause under three versions of the discretization-floor estimate, at three bandwidths; version 3 is the one reported.
Five items are reported. (1) The fixed-schedule failure case: a fixed schedule γ N = γ 0 / N \gamma_N = \gamma_0/N γ N = γ 0 / N does not adapt to the scale of H H H , and in the strong-anisotropy regime the legacy rule degraded the fit (error W 1 = 2.51 W_1 = 2.51 W 1 = 2.51 against 0.19 with the scale-free rule; recovered mean 3.41 against the true 5.9; spike mass 0.053 against the true 0.1), with the legacy penalty and the data term of the same order (6.1 × 10 − 5 6.1 \times10^{-5} 6.1 × 1 0 − 5 against 5.2 × 10 − 5 5.2 \times10^{-5} 5.2 × 1 0 − 5 ): a penalty that ignores the problem scale is mis-set by an order of magnitude. (2) The comparison of the two rules: the maximum relative difference is 5.20% at the shock step of EXP-3, while EXP-1 at α = 1 \alpha= 1 α = 1 shows only 0.16% to 0.99%; this is the basis for adopting the scale-free rule throughout. (3) The fallback error against N N N (S4). (4) The comparison of the three plug-in variants (oracle, conditional, realized). (5) The solver validation table (Part III).
S4. Fallback error against N
Figure S4. Fallback error against N N N at c = 0.75 c = 0.75 c = 0.75 . (a) Median δ ^ f b \widehat{\delta}_{\mathrm{fb}} δ fb with interquartile bands and bootstrap slope intervals, which contain zero for both weight profiles. (b) Worst grid-resolution ratio over repetitions; values above 1 indicate that the resolution cap is reached. (c) Dependence on the bandwidth.
This experiment asks whether exceeding the grid ceiling affects the comparative clause of the supervisor. The design fixes c = 0.75 c = 0.75 c = 0.75 , which separates N N N from the aspect ratio since N = d / c N = d/c N = d / c , with N ∈ { 500 , 1000 , 2000 , 4000 } N \in\{500, 1000, 2000, 4000\} N ∈ { 500 , 1000 , 2000 , 4000 } , R = 20 R = 20 R = 20 , three Stieltjes bandwidths (0.03, 0.01, 0.003), and no abstentions. The fallback error does not decay with N N N : all twelve slope confidence intervals contain zero (for the heavy-tailed law the slope is − 0.0095 -0.0095 − 0.0095 with interval [ − 0.0381 , 0.0253 ] [-0.0381, 0.0253] [ − 0.0381 , 0.0253 ] ), and the medians are flat (0.974, 0.909, 0.944, 0.941 across the four values of N N N for the heavy-tailed law). The registered conclusion is therefore that the bias does not decay with N N N and belongs to the intrinsic discretization of the count law, which supplies direct evidence for the absence of a closed-form finite-N N N correction. On the ceiling side, the heavy-tailed law exceeds the ceiling at every N N N tested (exceedance fractions 10/20, 13/20, 17/20, 17/20; worst ratio 2.11), while the light-tailed laws never exceed it. The pre-registered non-monotonicity prediction was not reproduced: the worst ratio rises monotonically with N N N , which indicates that the earlier observation was a per-repetition fluctuation rather than a stable effect of the integer structure.
S5. External baseline: Ledoit–Wolf nonlinear shrinkage
Ledoit–Wolf nonlinear shrinkage [32 ] is implemented as a fifth inverter on the same eigenvalues and the same paired clouds, with 900 paired assertions verified bitwise against the frozen
Figure S5. Ledoit–Wolf nonlinear shrinkage as an external baseline. (a) Median W 1 W_1 W 1 error of each inverter, 900 paired draws. (b) Number of paired draws in which Ledoit–Wolf is closer to H 0 H_0 H 0 than each inverter. (c) W 1 W_1 W 1 error against the mass that Ledoit–Wolf assigns to the common null value.
EXP-1 rows (same particle clouds, same eigenvalues, same W 1 W_1 W 1 convention). The baseline improves on the uncorrected spectrum (better in 842 of 900 cells) but falls short of every structure-aware inverter by a factor of 4.3 to 6.2: its median W 1 W_1 W 1 is 0.320, against 0.067 for the conditional plug-in, 0.074 for the oracle, and 0.052 for the realized plug-in. The mechanism is visible in the data: 854 of 900 cells take the baseline’s own p > n p > n p > n branch, which assigns uniform mass to the null space (median 0.297), exactly where the count-rank identity restores the spectrum. The comparison is not like-for-like: the baseline is model-free and does not know that the distortion is the convolution with T c ( ν ) T_c(\nu) T c ( ν ) , whereas our inverters use that structure, and the gap quantifies the value of the structural knowledge.
Phase diagrams and the supervisor audit table
The phase diagram has two layers. The map level asks how identifiable the inverse problem is, through the median local condition number across the ( c , α ) (c, \alpha) ( c , α ) grid; the pipeline level asks where the supervisor acts, through the activation fraction of the comparative clause. The deployment point ( c , α ) = ( 0.75 , 3 ) (c, \alpha) = (0.75, 3) ( c , α ) = ( 0.75 , 3 ) is marked. Since the positive class of the abstention rule is empty on this deployment (no true positives in 660 steps), no ROC curve can be drawn, and the audit table instead reports the distribution of the supervisor’s own decision ratio B ^ N / δ ^ f b \widehat{B}_N/\widehat{\delta}_{fb} B N / δ f b : median 0.146, maximum 0.824, and no values above one. This is the measurable form of the statement that only a stronger degeneration would have triggered the clause.
Figure S6. Burn-in diagnostics for the Metropolis chains of Table 1 . (a) The Robbins–Monro step-size controller settles before the end of burn-in (dashed). (b) Tail drift ratio of each controller at the end of burn-in, against the pre-stated threshold 0.2. (c) Burn-in length in units of the integrated autocorrelation time, per chain, against the pre-stated floor of five.
Metropolis–Hastings details
This section reports the random-walk Metropolis details: effective sample sizes and integrated autocorrelation times, trace plots, the decay with chain length, the sweep over the ε \varepsilon ε floor, and the burn-in diagnostics. The burn-in budget is thin by the pre-stated reading rules (a drift ratio below 0.2 counts as settled, and a burn-in of at least five mixing times counts as adequate): the median burn-in window is between two and three mixing times, and 10 to 12 of the 12 chains fall below the five-mixing-time floor. The registered value 1.943 for the minimum burn-in window over the maximum mixing time is reproduced. With the adaptation frozen after burn-in, the production segment is a fixed-kernel Metropolis–Hastings chain, to which Theorem 7 applies directly; this is a property of the design, not empirical evidence of convergence.
Activation zone of the comparative clause
This section maps the activation zone of the comparative clause across the ( c , α ) (c,\alpha) ( c , α ) grid (six aspect ratios, four weight profiles, three repetitions) at three Stieltjes bandwidths. At the deployment bandwidth h = 0.03 ξ h i h = 0.03\,\xi_{\mathrm{hi}} h = 0.03 ξ hi the clause activates in 12 of 72 cells, concentrated at mid-to-high c c c , with no activations at c = 0.15 c = 0.15 c = 0.15 and c = 0.30 c = 0.30 c = 0.30 ; the deployment point ( c , α ) = ( 0.75 , 3 ) (c,\alpha) = (0.75, 3) ( c , α ) = ( 0.75 , 3 ) lies inside the boundary with a measured ratio of 0.449 < 1 < 1 < 1 , so the clause is correctly inactive in EXP-3. The activation fractions are 0.167, 0.208, and 0.347 at the three bandwidths, reflecting the greater sensitivity of the discrepancy at smaller bandwidths (§ 2.1 of the main text). Two cells at c = 0.5 c = 0.5 c = 0.5 , α = 1 \alpha= 1 α = 1 required the refinement ladder (the mass-capture guard was triggered, and refinement to finer smoothing restored it), and the corrected ratios are registered in the deviation ledger.
Figure S7. Activation zone of the comparative clause. (a) Median decision ratio B ^ N / δ ^ f b \widehat{B}_N/\widehat{\delta}_{\mathrm{fb}} B N / δ fb on the ( c , α ) (c,\alpha) ( c , α ) grid at the deployment bandwidth; large markers indicate activation. (b) Activated fraction against c c c at three bandwidths.
Out-of-scope stress test (endogenous weights)
This stress test lies outside the scope of Theorems 3 and 4 and is reported as such. Under likelihood-driven endogenous weights the mismatch certificate does not fire, both for a low-dimensional projection, q = 10 q=10 q = 10 , where Proposition S2 shows that the limiting spectral law is unchanged and the inversion error indeed matches the permuted control, and for q = 750 q=750 q = 750 , q / d = 0.5 q/d=0.5 q / d = 0.5 , outside the scope of Proposition S2, where the median inversion error rises by a factor of 1.22. It fires on strongly correlated particles (autocorrelation 0.9, p = 4.4 × 10 − 16 p=4.4 \times10^{-16} p = 4.4 × 1 0 − 16 ), and not at autocorrelation 0.5, where the error rises by a factor of 1.35. The test thus shows the boundary of the theory and the reach of the certificate: it detects the violations that inflate the inversion error severalfold, and misses milder ones.
Passive monitor experiment
The pre-registered prediction (entry M42) was that under a degeneration shock the spectral trajectories would raise an alarm while the effective sample size stayed silent. The measurement contradicts it: the effective sample size drops by a factor of 3.23 at the shock, in synchrony with the zero-atom mass (correlation − 0.987 -0.987 − 0.987 at lag zero, with no detectable lead or lag), and the pairs with equal effective sample size but different spectral damage lie almost entirely on the steady-state noise floor (848 of 851), with only three pairs crossing a shock. By the pre-registered decision rule, the claim is weakened: spectral diagnostics complement the effective sample size rather than replace it, with a weak residual complementarity in the steady regime (the effective sample size explains only 6.8% of the steady-state zero-atom fluctuation). The effective-sample-size blindness shown in [1 ] is thus a static phenomenon, whereas dynamically the effective sample size moves together with the spectral damage. The figure shows the three trajectories with the shock markers.
Figure S8. Passive monitor experiment. (a) ESS, zero-atom mass, and effective dimension relative to their steady-state means; dotted lines mark the weight shocks. (b) Zero-atom mass against ESS; steady and shock steps form two separated clusters on one curve. (c) Shock-to-steady ratios against the pre-registered threshold 1.5 for a silent ESS; the ESS falls by a factor of 3.23, so the prediction fails.
Theory–evidence correspondence
Table S1 records the correspondence between the theoretical objects of the main text and the evidence bearing on them. “Verified” means the printed numbers test the stated object in the stated regime; “trend” means a mechanism is supported but not measured; “estimate” marks a number that is not a certified constant. A label of the form S· refers to a section of this supplement; all other numbers refer to the main text.
Table S1. Theory–evidence correspondence.
Figure S1. Count-law checks. (a) Empirical probability mass function of the counts against the mixed Poisson law, N = 2000 N=2000 N = 2000 , α = 1 \alpha=1 α = 1 . (b) Heavy-tailed weights, α = 0.3 \alpha=0.3 α = 0.3 , on logarithmic axes. (c) Empirical zero-atom share of the centered resampled matrix against the exact count-rank identity 1 − ( # { n j > 0 } − 1 ) / d 1-(\#\{n_j>0\}-1)/d 1 − ( # { n j > 0 } − 1 ) / d (circles) and the limiting value of Corollary 2 (crosses); all points lie on the diagonal.
Part III. Protocols
P1. Solver validation protocol
The forward-map solver passes seven unit tests before any experiment: the correct branch (Im m > 0 \operatorname{Im} m > 0 Im m > 0 ); a fixed-point residual below 3 × 10 − 13 3 \times10^{-13} 3 × 1 0 − 13 at interior and near-edge arguments; the normalization z m ( z ) → − 1 zm(z) \to-1 z m ( z ) → − 1 ; recovery of the Marchenko–Pastur law within the reference tolerance; zero-atom masses consistent with the closed forms; insensitivity to the truncation of the count law; and cross-consistency between the covariance-side and companion-side implementations. Two further tests apply to the accelerated path: backend equivalence (deterministic quantities agree within the registered tolerance class, and chain-level quantities within statistical tolerance) and acceptance of the escalation ladder (each precision rung is checked pointwise, and typed events are exercised on deliberately constructed nonconvergent points). A mass-conservation check records the pre-normalization defect ∣ ∑ j p j − 1 ∣ \left|\sum_j p_j - 1\right| ∑ j p j − 1 in the run manifest, so that normalization cannot silently repair a defective density. Section 4.6 of the main text summarizes this protocol.
Reproducibility protocol
The reviewer’s path is a single command: clone the repository (release tag v1.0-submission) and run python -m srlab run all. Every printed number is regenerated from raw data through the four-level provenance chain (raw data, extraction function, intermediate quantity, printed value), and golden-regression checks compare any rebuilt result with the frozen baselines. The repository contains the full solver, the experiment modules, the deviation ledger with its 328 registered quantities, and the append-only pre-registration chain (entries M1 to M43). Data snapshots are archived with a DOI. Figures are regenerated from saved data only, and the PDF output is bitwise reproducible under a fixed SOURCE_DATE_EPOCH. The machine specification, library versions, and thread policy are recorded for each run in the manifests. Section 5.1 of the main text describes the pre-registration protocol that accompanies it.
Spectrally corrected filtering step (complete specification)
This section reproduces, as a numbered procedure, what Section 4.6 of the main text summarizes in prose. It is the single authoritative version; the main text carries no pseudocode.
Algorithm 1 (Spectrally corrected filtering step). Input: X k ∣ k − 1 X_{k\mid k-1} X k ∣ k − 1 , w k − 1 w_{k-1} w k − 1 , y k y_k y k , g k g_k g k , scheme flag.
Weight update. w k i ∝ w k − 1 i g k ( y k ∣ x k i ) w_k^i \propto w_{k-1}^i g_k(y_k \mid x_k^i) w k i ∝ w k − 1 i g k ( y k ∣ x k i ) , normalized; record λ i = N w k i \lambda_i = Nw_k^i λ i = N w k i and r 2 , N : = 1 N ∑ i λ i 2 r_{2,N} := \frac{1}{N}\sum_i \lambda_i^2 r 2 , N := N 1 ∑ i λ i 2 .
Trigger. If r 2 , N ≤ r 2 ∗ r_{2,N} \le r_2^* r 2 , N ≤ r 2 ∗ , skip steps (3)–(7).
Selection. Draw n n n under the chosen scheme, subject to the integer-boundary protocol: integer parts are stored as integers, R N R_N R N is formed by exact arithmetic, and λ i \lambda_i λ i is never reconstructed from the floating-point product N w i Nw_i N w i .
Spectral estimation. Form μ ^ N \hat{\mu}_N μ ^ N , with atoms reported separately from the density.
Distortion law. Build ν ^ N \hat{\nu}_N ν ^ N and evaluate the companion transform of T ^ N \hat{T}_N T ^ N on the precomputed grid.
Regularized inversion. Solve the Tikhonov problem with γ N = γ r e l / R ^ N \gamma_N = \gamma_{\mathrm{rel}}/\hat{R}_N γ N = γ rel / R ^ N ; record ε ^ m o d e l \hat{\varepsilon}_{\mathrm{model}} ε ^ model and κ ^ i n v \hat{\kappa}_{\mathrm{inv}} κ ^ inv .
Lift. Set M k = U k diag ( h ~ j ) U k T + ε I M_k = U_k\operatorname{diag}(\tilde{h}_j)U_k^{\mathsf{T}} + \varepsilon I M k = U k diag ( h ~ j ) U k T + ε I , with h ~ j \tilde{h}_j h ~ j the ordered quantiles of H ^ γ \hat{H}_{\gamma} H ^ γ .
Rejuvenation. Run L k L_k L k random-walk Metropolis steps targeting π ~ k N \tilde{\pi}_k^N π ~ k N , with the damped transport used only as a proposal mechanism and the full Hastings correction for asymmetric proposals.
Supervisor. Abstain if ε ^ m o d e l > τ \hat{\varepsilon}_{\mathrm{model}} > \tau ε ^ model > τ or B ^ N > δ ^ f b \hat{B}_N > \hat{\delta}_{\mathrm{fb}} B ^ N > δ ^ fb , with η N d i s c \eta_N^{\mathrm{disc}} η N disc subtracted from ε ^ \hat{\varepsilon} ε ^ before amplification; log every trigger and abstention by reason code.