Sharp FCLT in Wasserstein-1
- The paper establishes that the scaled integrals of stationary Gaussian processes converge to Brownian motion with an optimal rate of O(k⁻¹/²√ln k) in the Wasserstein-1 metric.
- It employs coupling techniques, duality with 1-Lipschitz test functions, and Gaussian supremum bounds to derive matching upper and lower bounds.
- The result highlights improved convergence properties in Wasserstein-1 compared to the Lévy–Prokhorov and bounded-Lipschitz metrics, emphasizing metric-dependent effects in functional convergence.
A sharp functional central limit theorem (FCLT) in the Wasserstein-1 metric quantifies the rate at which scaled integrals and Donsker-type interpolations of stationary Gaussian processes converge in law to Brownian motion, under the topology induced by the 1-Wasserstein distance on the space of continuous functions equipped with the uniform norm. Unlike the classical finitely-dimensional CLT, the FCLT for such processes is nontrivial, and precise convergence rates reveal subtle metric-dependent phenomena that distinguish Wasserstein-1 from the Lévy–Prokhorov and bounded-Lipschitz metrics. Notably, the convergence rate in the 1-Wasserstein metric (“”) is shown to be , a rate that is slightly faster than the best known results for the Lévy–Prokhorov distance, establishing the exact sharp order for functional convergence in this metric (Lototsky, 2022).
1. Wasserstein-1 Metric on Path Space
Given a complete separable metric space , specifically with the uniform norm , the 1-Wasserstein distance between Borel probability measures and on is defined by both the dual (Kantorovich–Rubinstein) and primal (optimal coupling) representations: where 0 and 1 is the set of all couplings. In this context, the bounded-Lipschitz metric 2 and the Lévy–Prokhorov metric 3 satisfy
4
Thus, convergence in 5 implies weak convergence, and the rate in 6 controls the rate in 7.
2. Model Classes and Process Interpolations
The FCLT analysis considers two stationary Gaussian input models:
- Continuous-time Ornstein–Uhlenbeck: 8, stationary law 9, covariance 0.
- Discrete-time AR(1): 1, 2, with 3 ensuring 4, 5.
For 6, the scaled partial integrals or Donsker–interpolated processes are defined by
- 7
- 8
Let 9 be the law of 0 and 1 that of standard Brownian motion 2 on 3.
3. Sharp Rates in the Functional Central Limit Theorem
The primary result is an exact match of upper and lower bounds on the rate for 4:
- Continuous-time case: There exist constants 5 so that for all 6,
7
- Discrete-time AR(1) case: For 8, there exist 9 with analogous bounds.
Thus, the 0 convergence rate is 1. By contrast, in the Lévy–Prokhorov metric, the fastest achievable rate is 2, so convergence in 3 is improved by a factor of 4.
4. Proof Outline and Key Technical Lemmas
The upper bound follows by a combination of coupling, duality arguments, and bounds on the maximum of Gaussian processes:
- Gordin-type decomposition: The scaled processes can be coupled to Brownian motion 5 as 6.
- Duality with Lipschitz test functions: For any 7-Lipschitz 8,
9
- Gaussian-supremum theory: Using the Fernique–Sudakov and Borell–TIS inequalities, 0.
For the lower bound, a specifically chosen 1-Lipschitz test function 2 exploiting the Gaussian maximal inequality yields a matching lower order, confirming the optimality of the bound.
5. Relations with Other Metrics
3 convergence is strictly stronger than convergence in the bounded-Lipschitz (4) and Lévy–Prokhorov (5) metrics, yet the sharpness of the convergence rate may fail in 6. Table 1 summarizes the best known rates:
| Metric | Convergence Rate | Sharpness Proven? |
|---|---|---|
| Wasserstein-1 (7) | 8 | Yes |
| Lévy–Prokhorov (9) | 0 | Yes |
| 1-Wasserstein | 2 | Yes |
A plausible implication is that 3 is sensitive to the sup-norm geometry of 4, resulting in log-improved convergence rates over 5 and 6, but the 7-Wasserstein rate does not require the logarithmic correction.
6. Extensions and Corollaries
The rate 8 for 9 convergence extends:
- To path spaces 0 under 1, up to a constant factor depending on 2.
- To additive-noise ODEs of the form 3 (with 4 Lipschitz), yielding 5 where 6 solves the analogous SDE driven by Brownian motion.
- Under martingale-difference or mixing hypotheses, Gordin’s decomposition with Gaussian-supremum techniques can yield analogous rates for certain non-Gaussian inputs.
7. Optimality and Limit Cases
The 7 factor is intrinsic to the 8 with sup-norm case, reflecting the slow divergence of Gaussian maxima over expanding time intervals. In weaker topologies (such as 9 or fractional-Sobolev norms), this logarithmic term can be eliminated, resulting in pure 0 rates. A plausible implication is that the metric governing convergence has a decisive effect on the attainable rates in infinite-dimensional settings. Extending sharp FCLT rates to non-stationary or heavy-tailed Gaussian processes, or to Gaussian processes indexed by higher-dimensional parameter spaces, remains an open frontier (Lototsky, 2022).