---
title: Transportation Proof Rule in SPDE Analysis
url: https://www.emergentmind.com/topics/transportation-proof-rule
type: topic
---

# Transportation Proof Rule in SPDE Analysis

Transportation Proof Rule denotes, in its most specific current usage, the abstract mechanism by which a transportation-cost inequality for a reference noise law is transferred to the law of a derived random object through a pathwise translation estimate. In "Transportation cost inequalities for singular SPDEs" [2511.19216], this mechanism is formalized as a generalized transportation-cost transfer for BPHZ random models in the full subcritical regime, and then propagated further to laws of singular SPDE solutions and invariant measures. In a broader literature, closely related transport proofs replace a target law or functional inequality by a transported reference object and then exploit change of variables, couplings, entropy duality, or variational structure to conclude; the common feature is that transport is not merely the subject matter, but the proof engine.

## 1. Formal meaning in the singular-SPDE setting

The paper [2511.19216] starts from a noise law \(P\) on a Banach space \(\Omega\) of distributions, with a dense Cameron–Martin type Hilbert space \(H\subset \Omega\), and cost
\[
c_H(\omega_1,\omega_2)=
\begin{cases}
\|h\|_H^2, & \omega_1-\omega_2=h\in H,\\
+\infty, & \text{otherwise}.
\end{cases}
\]
Its Assumption A requires that the noise is centered, invariant under spacetime shifts, and satisfies the transportation-cost inequality
\[
a_\circ\, \mathcal T_{c_H}(\mathbb Q,P)\le H(\mathbb Q\mid P)
\qquad (\forall \mathbb Q\in \mathsf P(\Omega)).
\]
Under Assumption A, the appendix also yields the spectral gap inequality
\[
\mathbb E[(F-\mathbb E F)^2]\le a_1\,\mathbb E[\|dF\|_{H^*}^2],
\qquad a_1=\frac1{2a_\circ},
\]
for cylindrical \(F\) [2511.19216].

The paper’s key abstraction is Proposition \(\ref{PropGeneralisedTCI}\), described there as a refined contraction principle. If \(M:\Omega\to\mathsf M\) is a random variable into a metric space and there exist an exponent \(r\ge1\) and a random weight \(\mathbb L\in\bigcap_{p<\infty}L^p(P)\) such that for \(P\)-a.e. \(\omega_1,\omega_2\),
\[
c_{\mathsf M}(M(\omega_1),M(\omega_2))
\le
\mathbb L(\omega_2)\max\!\Big(\sqrt{c_H(\omega_1,\omega_2)},
\sqrt{c_H(\omega_1,\omega_2)}^{\,1/r}\Big),
\]
then the law \(P_M=P\circ M^{-1}\) satisfies, for every \(1\le \alpha<2\), an \((\ell_\alpha,c_{\mathsf M}^\alpha)\)-TCI, where \(\ell_\alpha\) is the convex inverse of a concave function of the form
\[
t\mapsto a_\alpha^{-1}\big(t^{\alpha/(2r)}+t^{\alpha/2}\big)
\]
[2511.19216].

In this narrow sense, the Transportation Proof Rule is not a generic slogan. It is an abstract transfer theorem: a TCI for the base noise plus a pointwise translation estimate for a measurable map \(M\) imply a TCI for the pushforward law of \(M\).

## 2. Entropy lifting, coupling, and the transfer mechanism

The proof idea in [2511.19216] is an entropy-lifting plus coupling argument. First, any target law \(\nu\) on \(\mathsf M\) is lifted to a law \(\mathbb Q\) on \(\Omega\) by the entropy-image identity
\[
H(\nu\mid P_M)
=
\inf\{H(\mathbb Q\mid P):\nu=\mathbb Q\circ M^{-1}\}.
\]
Second, the pointwise estimate for \(M\) converts transportation in \(\Omega\) with cost \(c_H\) into transportation in \(\mathsf M\) with cost \(c_{\mathsf M}\). Third, Hölder’s inequality and the noise TCI are applied. Finally, the argument is pushed back down from \(\Omega\) to \(\mathsf M\) [2511.19216].

This architecture clarifies what is “transportation” about the rule. The proof does not compute the geometry of \(\mathsf M\) directly. Instead, it transports entropy control from the reference law \(P\) through the measurable map \(M\), provided the map is sufficiently regular with respect to admissible translations by \(H\). The role of the random weight \(\mathbb L\) is to permit nonuniform pathwise control while retaining integrability strong enough for the entropy estimates.

A common misconception is that a transportation proof rule must be a classical contraction principle with a deterministic Lipschitz constant. The proposition in [2511.19216] is explicitly more flexible: the control is Hölder type, the exponent \(r\) may be larger than \(1\), and the prefactor is random but belongs to \(\bigcap_{p<\infty}L^p(P)\). This suggests that the relevant regularity notion is not global Lipschitz continuity on the ambient space, but translation control along the Cameron–Martin directions.

## 3. BPHZ models and the pathwise translation estimate

The main application in [2511.19216] is the extended BPHZ model \(\widetilde{\mathsf M}^{\infty;}\) for general subcritical singular SPDEs in regularity structures, built using a refined regularity-integrability structure and a BPHZ renormalization scheme. The central estimate is Theorem \(\ref{ThmHolderEstimateBPHZ}\):
\[
\big\|\widetilde{\mathsf M}^{\infty;}(\omega+h):\widetilde{\mathsf M}^{\infty;}(\omega)\big\|_{\mathsf M}
\le
\mathbb L(\omega)\max\big(\|h\|_H,\|h\|_H^{1/m}\big),
\]
for some integer \(m=m(\mathbf B)\) and \(\mathbb L\in\bigcap_{p<\infty}L^p(P)\). In the homogeneous model norm \(\|\cdot\|_{\mathsf M_{\mathrm{hom}(V_\varepsilon)}}\), the theorem is stated as
\[
\Omega_0+h\subset\Omega_1,
\]
and for all \(\omega\in\Omega_0\), \(h\in H\),
\[
\big\|\widetilde{\mathsf M}^{\infty;}(\omega+h):\widetilde{\mathsf M}^{\infty;}(\omega)\big\|_{\mathsf M_{\mathrm{hom}(V_\varepsilon)}}
\le
\mathbb L(\omega)\max\big(\|h\|_H,\|h\|_H^{1/m(\mathbf B)}\big).
\]
The random prefactor is controlled by
\[
\mathbb L(\omega)\propto
\left(1+\sup_{\|h\|_H\le1}
\big\|\overline{\mathsf M}^{\infty,h;}(\omega)\big\|_{\mathsf M_{\mathrm{hom}(U_\varepsilon)}}\right)^{1-1/m(\mathbf B)}.
\]

The hypotheses behind the BPHZ construction are equally specific. The law \(P\) is centered and shift-invariant on \(\Omega=C^{r_0,Q}(w_a)\), satisfies Assumption A with \(H=H^{-s_0,Q}(w_b)\), and obeys the no-variance-blowup condition
\[
r_{0,\infty}(\tau)>-\frac{2+d}{2}
\qquad
\forall \tau\in\mathbf B\setminus\{\ocircle\}.
\]
For small \(\varepsilon>0\), large enough weights \(a\), all \(p\in[2,\infty]\), and \(q<\infty\), the paper obtains uniform \(L^q\)-bounds on renormalized models and convergence to a limit model in \(L^q\) [2511.19216].

The proof of the translation estimate is algebraic and combinatorial. For the deterministic renormalized model, shifting the noise by \(j\) yields the binomial formulas
\[
\Pi_x^{\zeta+j,0,\chi}(\tau)
=
\sum_{V\subset \ocircle_\tau}\Pi_x^{\zeta,j,\chi}(D_V\tau),
\]
and
\[
g_{yx}^{\zeta+j,0,\chi}(\sigma)
=
\sum_{V\subset \ocircle_\sigma}g_{yx}^{\zeta,j,\chi}(D_V\sigma).
\]
These identities expand the effect of adding \(h\in H\) to the noise as a sum over subsets of noise leaves. The estimate then follows by counting how many noise leaves are replaced, using homogeneity, and exploiting \(n_\circ(\tau)\le m(\mathbf B)\), which yields the Hölder-type dependence \(\max(\|h\|,\|h\|^{1/m})\) [2511.19216].

## 4. From model laws to solution laws and invariant measures

Once the pathwise translation estimate is available, the generalized transfer proposition is applied to
\[
M=\widetilde{\mathsf M}^{\infty;}.
\]
The resulting corollary states that for every \(1\le\alpha<2\), the law \(\widetilde P^{\infty;}\) of the BPHZ model satisfies an \((\ell_\alpha,\|\cdot\|^\alpha)\)-transportation-cost inequality. Taking \(\alpha=1\) and combining with Gozlan’s entropy–integrability theorem yields the Gaussian tail estimate
\[
\mathbb E\Big[\exp\big(\kappa_3\|\widetilde{\mathsf M}^{\infty;}\|_{\mathsf M}^2\big)\Big]<\infty
\]
[2511.19216].

The solution-level transfer requires an a priori estimate controlled by the model. If a singular SPDE solution \(u\) is globally well-posed and
\[
g(\|u\|_E)\le 1+\|\widetilde{\mathsf M}^{\infty;}\|_{\mathsf M},
\]
with \(g\) continuous, concave, strictly increasing, and \(g(0)=0\), then the law of \(u\) satisfies an \((a\underline\ell,\,g(\|\cdot-\cdot\|_E))\)-TCI with \(\underline\ell(t)=t^2\). If the SPDE generates a Feller process and a coming down from infinity estimate
\[
g(\|u(1;u_0)\|_{C^\gamma})\le 1+\|\widetilde{\mathsf M}^{\infty;}\|_{\mathsf M}
\]
holds, then the process has an invariant measure \(\mu\), and \(\mu\) satisfies the same kind of TCI. The proof uses time-shift invariance of the noise, uniform exponential integrability of \(g(\|u(t)\|)^2\), tightness of Cesàro averages, and Gozlan’s equivalence between TCI and exponential integrability [2511.19216].

A flagship application is the \(\Phi^4_{4-\nu}\) model on \(\mathbb T^4\),
\[
(\partial_t-\Delta)u=-u^3+(-\Delta)^{-\nu}\zeta,
\qquad \nu>\kappa>0,\ \nu\notin\mathbb Q.
\]
This dynamics has a unique invariant probability measure, called the \(\Phi^4_{4-\nu}\) measure. The paper proves that there exists \(a>0\) such that this measure satisfies an \((a\underline\ell,c_\nu)\)-TCI, where
\[
\underline\ell(t)=t^2,
\qquad
c_\nu(v_1,v_2)=\|v_2-v_1\|_{C^{-1-\kappa+\nu}^{1/p(\nu)}}.
\]
The derivation uses the BPHZ translation estimate, the a priori polynomial bound from Chandra–Moinat–Weber, and the invariant-measure theorem [2511.19216].

## 5. Broader transport-proof patterns in adjacent literatures

Outside the singular-SPDE setting, transport proofs have a wider methodological meaning. In "Optimal Transportation to the Entropy-Power Inequality" [1701.08534], the entropy-power inequality is proved by choosing Gaussian reference variables \(X^*,Y^*\), transporting them to \(X,Y\) through increasing maps \(T,U\), invoking the entropy change-of-variables formula
\[
h(T(X))=h(X)+\mathbb E[\log T'(X)],
\]
and combining a rotation trick with concavity of \(\log\). In that setting, the proof rule is: transport to a Gaussian equality case, rewrite entropy differences through Jacobians, and conclude by Jensen.

In "Transportation Proof of an inequality by Anantharam, Jog and Nair" [1901.10893], the transport device is Brenier’s map from block-Gaussian sources. The key lemma lower-bounds \(h(AX)\) by a determinant expression involving \(A(\nabla T)^2A^T\), and the final inequality is obtained by optimizing over positive definite block matrices. Here the proof rule is again transfer from a Gaussian reference law, but through Jacobians of convex-gradient maps rather than through couplings on path space.

In "Transport Proofs Of Some Discrete Variants Of The Prékopa-Leindler Inequality" [1905.04038], smooth Jacobian arguments are unavailable. The replacement is monotone coupling plus entropy duality. On \(\mathbb Z\), compactly supported laws \(\nu_0,\nu_1\) are coupled monotonically, pushed through midpoint maps
\[
m_-(x,y)=\left\lfloor\frac{x+y}{2}\right\rfloor,
\qquad
m_+(x,y)=\left\lceil\frac{x+y}{2}\right\rceil,
\]
and shown to satisfy
\[
H(\nu_-|m)+H(\nu_+|m)\le H(\nu_0|m)+H(\nu_1|m).
\]
Combined with the entropy variational formula, this yields the Klartag–Lehec inequality and, by reduction and tensorization, the Four Functions Theorem. The transport proof rule here is explicitly coupling-and-entropy rather than Jacobian-based.

Two further examples show the same structural theme under different technical realizations. In the variational proof of partial regularity for optimal transport maps [1704.05339], the argument goes through the Benamou–Brenier formulation, harmonic approximation, and Campanato iteration: if the transport cost is small, the Eulerian velocity field is close to the gradient of a harmonic function, and this is translated back to the map. In the stochastic heat equation setting [1910.04934], a \(T_2\) inequality on path space is derived by Girsanov’s theorem, a coupling of perturbed and unperturbed solutions, a new uniform-metric moment estimate for the stochastic convolution, and Gronwall’s lemma. These examples suggest that “transportation proof rule” can designate either a formal transfer theorem, as in [2511.19216], or a broader proof schema in which transport converts a nonlinear statement into a controllable reference comparison.

## 6. Scope, structural features, and recurrent misunderstandings

Several features recur across these sources. First, the reference object is usually simpler than the target: a Gaussian law in entropy inequalities, the base noise law in singular SPDEs, a monotone coupling in discrete midpoint inequalities, or a low-excess harmonic approximation in variational regularity theory. Second, the decisive estimate is rarely a direct bound on the target quantity. It is a transport identity or transport inequality: an entropy-image identity, a Jacobian formula, a monotone-coupling entropy convexity bound, or a pathwise translation estimate. Third, the conclusion is typically obtained after pushing the problem through this intermediate structure.

A common misunderstanding is to identify transport proofs exclusively with optimal maps of Monge type. The cited literature does not support that restriction. Some proofs do use Brenier or monotone rearrangement maps [1701.08534, 1901.10893, 1105.4037], but others rely on couplings [1905.04038], dynamic Eulerian competitors [1704.05339], or Girsanov couplings on stochastic path space [1910.04934]. Conversely, not every proof involving optimal transport geometry is a transportation proof rule in the narrow sense of [2511.19216]; there, the phrase refers to an abstract extended contraction principle transferring TCI from noise to model law.

The singular-SPDE formulation is distinctive because it isolates a reusable chain of implications:
1. centered, shift-invariant noise satisfying a TCI on \(\Omega\) with respect to \(c_H\);
2. spectral gap and exponential-integrability consequences for the noise;
3. BPHZ construction under no variance blowup;
4. pathwise translation control for the renormalized model;
5. generalized TCI transfer to the model law;
6. TCI and Gaussian tails for the model norm;
7. TCI for solution laws and invariant measures, including \(\Phi^4_{4-\delta}\) on \(\mathbb T^4\) [2511.19216].

In that sense, Transportation Proof Rule names both a proposition and a style of reasoning. Its precise technical content depends on context, but the unifying principle is stable: transport furnishes the comparison mechanism that converts entropy, regularity, or cost information at a reference level into a structural statement for a more complicated law or map.

Source: https://www.emergentmind.com/topics/transportation-proof-rule