Existence, Penalty Bounds and the Least Penalty at a Maximiser of the Wasserstein-Doubled Difference
lemmaAnalysisPDElem:w2-doubling-maximiser-wasserstein-2026aFor a Wasserstein-coercive penalty pair, without any probability space: the penalty attains a least value, the Wasserstein-doubled difference of the delta-envelopes attains its supremum, the penalty and second moment are bounded at a near-maximiser independently of the doubling strength, and the penalised distance vanishes along a doubling sequence.
In the setting of The Intrinsic Calculus on the Wasserstein Space: Standing Notation, let be a Wasserstein-coercive penalty pair on . The set contains the nonempty by Penalty Pairs on the Wasserstein Space: the Penalty, Its Score, and Their Domains §pair and Penalty Pairs on the Wasserstein Space: the Penalty, Its Score, and Their Domains §nonempty; fix , and fix with for every , as provided by Basic Properties of a Wasserstein-Coercive Penalty Pair §bounded-below.
Let be positive and let be such that is upper semicontinuous and lower semicontinuous on relative to in , and such that and for every and some . By Basic Properties of a Wasserstein-Coercive Penalty Pair §envelopes the -envelope of and the -envelope of relative to the penalty pair are defined and satisfy and on .
For positive let be the function with value
let be the supremum of its values, and put
Let be the natural power; the letter , a dimension in Wasserstein Spaces, Random Vectors, Vector Fields and Symmetric Matrices in Every Dimension: Standing Notation, is not used here. Then the following hold.
1. (A maximiser exists)¶ For every positive the supremum is a real number and there is with .
2. (The penalty is bounded at a near-maximiser)¶ Let be positive, let be nonnegative and let satisfy . Then and , and if is as in Basic Properties of a Wasserstein-Coercive Penalty Pair §moment for the level then and . Neither bound depends on .
3. (The penalised distance vanishes along a doubling sequence)¶ Let be positive and let for . For each let satisfy . Then the sequence whose -th term is
converges to ; in particular so does the sequence whose -th term is .
4. (The penalty attains a least value)¶ There is with for every .
Loading…
Prerequisites
No prerequisites tracked.
Dependents
No dependents yet.
Dependent proofs
No dependent proofs yet.
No relations recorded yet.