TheoremBase

The First-Order Structure Condition at Uniquely Noise-Mapped Pairs

A first-order operator satisfies the structure condition at uniquely noise-mapped pairs if the difference of its shifts, evaluated at two score-domain measures with momenta given by alpha times their optimal displacements towards each other, is bounded below by moduli of alpha times the squared noise distance plus 1/alpha and of delta times the penalties.

Statement

In the setting of First-Order Equations on the Noise Wasserstein Space Relative to a Noise Penalty Pair: Standing Notation, let (D,DΣ,E,Σ)(\mathcal{D},\mathcal{D}_{\Sigma},\mathcal{E},\Sigma) be a noise penalty pair on Pρa\mathcal{P}^{a}_{\rho} and let FF be a first-order equation operator over DΣ\mathcal{D}_{\Sigma}, with δ\delta-shifts Fδ−F^{-}_{\delta} and Fδ+F^{+}_{\delta} relative to that pair. For μ,ν∈Pρa\mu,\nu\in\mathcal{P}^{a}_{\rho} and a noise-optimal map SS from μ\mu to ν\nu, the displacement S−idS-\mathrm{id} is an element of L2(μ;Xa)L^{2}(\mu;X^{a}) by Noise-Optimal Maps and Uniquely Noise-Mapped Pairs §map, and we write id−S=−(S−id)\mathrm{id}-S=-(S-\mathrm{id}) in that vector space. α−1\alpha^{-1} denotes the multiplicative inverse of a positive α∈R\alpha\in\mathbb{R}, and ∣s∣|s| the absolute value of s∈Rs\in\mathbb{R}.

1. (Structure pair at a level) Let R∈RR\in\mathbb{R} be positive, let ω1\omega_{1} be a modulus of continuity, and let ω2\omega_{2} be a function with values in R\mathbb{R} on the set of all pairs (t,α)(t,\alpha) of real numbers with 0≤t0\le t and 1<α1<\alpha, such that for every real α>1\alpha>1 the function on the set of nonnegative reals with value ω2(t,α)\omega_{2}(t,\alpha) at tt is a modulus of continuity. We say that (ω1,ω2)(\omega_{1},\omega_{2}) is a structure pair for FF at RR if

−ω1(α Wa(μ,ν)2+α−1)−ω2(δ (∣E(μ)∣+∣E(ν)∣+1), α) ≤ Fδ−(μ,r,α(id−S))−Fδ+(ν,r,α(S′−id))-\omega_{1}\bigl(\alpha\,W_{a}(\mu,\nu)^{2}+\alpha^{-1}\bigr)-\omega_{2}\bigl(\delta\,(|\mathcal{E}(\mu)|+|\mathcal{E}(\nu)|+1),\,\alpha\bigr)\ \le\ F^{-}_{\delta}\bigl(\mu,r,\alpha(\mathrm{id}-S)\bigr)-F^{+}_{\delta}\bigl(\nu,r,\alpha(S'-\mathrm{id})\bigr)

whenever α,δ∈R\alpha,\delta\in\mathbb{R} satisfy 1<α1<\alpha and 0<δ<10<\delta<1; μ,ν∈DΣ\mu,\nu\in\mathcal{D}_{\Sigma} are such that both ordered pairs (μ,ν)(\mu,\nu) and (ν,μ)(\nu,\mu) are uniquely noise-mapped, SS is a noise-optimal map from μ\mu to ν\nu and S′S' a noise-optimal map from ν\nu to μ\mu, and

δ (∣E(μ)∣+∣E(ν)∣) ≤ R;\delta\,\bigl(|\mathcal{E}(\mu)|+|\mathcal{E}(\nu)|\bigr)\ \le\ R ;

and r∈Rr\in\mathbb{R} satisfies −R≤r≤R-R\le r\le R. Here Wa(μ,ν)W_{a}(\mu,\nu) is a nonnegative real number and E(μ)\mathcal{E}(\mu), E(ν)\mathcal{E}(\nu) are defined, because μ,ν∈DΣ⊆D⊆Pρa\mu,\nu\in\mathcal{D}_{\Sigma}\subseteq\mathcal{D}\subseteq\mathcal{P}^{a}_{\rho} by Noise Penalty Pairs on the Noise Wasserstein Space: the Penalty, Its Score, and Their Domains §pair and by The Noise Wasserstein Distance is a Metric on the Measures Noise-Connected to the Reference Measure: Existence of Noise-Optimal Couplings, Comparison with the Quadratic Wasserstein Distance and Lower Semicontinuity §connected and The Noise Wasserstein Distance is a Metric on the Measures Noise-Connected to the Reference Measure: Existence of Noise-Optimal Couplings, Comparison with the Quadratic Wasserstein Distance and Lower Semicontinuity §metric. The arguments of the two moduli are nonnegative: α Wa(μ,ν)2+α−1\alpha\,W_{a}(\mu,\nu)^{2}+\alpha^{-1} is the sum of a product of nonnegative reals and a positive multiplicative inverse, and δ (∣E(μ)∣+∣E(ν)∣+1)\delta\,(|\mathcal{E}(\mu)|+|\mathcal{E}(\nu)|+1) is the product of the positive real δ\delta with a sum of two nonnegative absolute values and 11, hence positive.

2. (The structure condition) The operator FF satisfies the first-order structure condition at uniquely noise-mapped pairs if for every positive R∈RR\in\mathbb{R} there is a structure pair for FF at RR.

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…