Each result cited is universally quantified over the data in its own statement, and is applied below with the data named at each use.
Conventions. We work in the setting of Probability Measures on a Hilbert Space Transported in the Noise Norm: Standing Notation, with c, γc, μ and ν as in the statement. As in clause 1 of that setting, for z∈X×X we write x=π1(z) and y=π2(z); for u∈X and k∈N, uk=⟨u,ek⟩, and for n∈N and w∈Rn we write wk (1≤k≤n) for the k-th entry of w, so that pn(u)=(u1,…,un) by Borel Probability Measures on a Real Hilbert Space with an Orthonormal Basis: Standing Notation §coordinates. The metric space (X,d) is separable by Borel Probability Measures on a Real Hilbert Space with an Orthonormal Basis: Standing Notation §space, and B(X×X)=B(X)⊗B(X), with π1,π2 Borel, by Borel Sets of a Hilbert Space with an Orthonormal Basis: Coordinates, Determination by Finite-Dimensional Projections, and Pairs §product-sigma. Accordingly Pairings into a Product, the Graph of a Measurable Map, and Couplings Concentrated on a Graph is applied below with (X,B(X)) in place of (Y,Y) and (X,d) in place of (Z,dZ); its projections prY,prZ are then π1,π2, for a map S:X→X its graph is ΓS={z∈X×X: y=S(x)}, and its image measures (id,S)#μ, given by E↦μ((id,S)−1(E)) on B(X)⊗B(X)=B(X×X), are the push-forwards of Borel Probability Measures on a Real Hilbert Space with an Orthonormal Basis: Standing Notation §pushforward. Likewise Measurable Maps into a Hilbert Space with an Orthonormal Basis: Norms, Inner Products and Linear Combinations, Synthesis from Coordinates, Square-Integrability, and Almost-Everywhere Equality is applied with X in place of E, the orthonormal basis (ek)k∈N in place of (fk)k∈N and (X,B(X)) in place of (S,S); measurability of maps X→X there is then Borel measurability, and the coordinate functions of a map v:X→X are x↦⟨v(x),ek⟩. Real-valued functions on X are called Borel when measurable with respect to B(X) and B(R), which is also the Borel σ-algebra of the metric space (R,dR), dR(s,t)=∣s−t∣, by claim 2 of Borel Measurability and Bounded Integration on a Metric Space; and Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions is applied on the measurable space (X,B(X)). For N∈N, SN:X→R is the function SN(u)=∑k=1Nak−1uk2 of The Noise Space is a Real Hilbert Space: Orthonormal Basis, Continuous Embedding, Partial Sums, Closed Balls and Borel Measurability, applied with the noise weights a and the bound aˉ of Probability Measures on a Hilbert Space Transported in the Noise Norm: Standing Notation §weights; in particular 0<ak≤aˉ for every k∈N.
Proof of claim 1.
Step 1 (Head maps). Let π be a noise-optimal coupling of μ and ν. By Noise-Optimal Couplings §optimal, π∈Πa(μ,ν), so by Couplings of Finite Noise Cost and Their Noise Cost §couplings and Couplings of Finite Noise Cost and Their Noise Cost §finite it satisfies π(Da)=1 and ∫X×Xcadπ<∞, and by the definition of a coupling π∈P(X×X) with (π1)#π=μ and (π2)#π=ν. For every n∈N, claim 1 of lem:noise-head-maps-hilbert, applied with c, μ, ν, π and n (its hypotheses are those of the present statement together with the noise-optimality of π), shows that the set An of the Borel maps Tn:X→Rn with (π1,pn∘π2)#π=(id,Tn)#μ is nonempty. Regarding each An as a subset of the set of all maps from X into ⋃m∈NRm, Axiom of Countable Choice gives a sequence (Tn)n∈N with Tn∈An for every n∈N; we fix it. For every n∈N, claim 2 of the same lemma, applied with the same data and this Tn, shows that the set
Gn={z∈X×X: pn(y)=Tn(x)}
belongs to B(X×X) and that π(Gn)=1.
Step 2 (A set of full measure). The set Da belongs to B(X×X) by The Noise Space is a Real Hilbert Space: Orthonormal Basis, Continuous Embedding, Partial Sums, Closed Balls and Borel Measurability §pairs. Put
G=Da∩n∈N⋂Gn,
which belongs to B(X×X) because a σ-algebra is closed under countable intersections (Sigma-Algebra and Measurable Space). Let N1=(X×X)∖Da and Nn+1=(X×X)∖Gn for n∈N. Since π is finite, the rule for differences gives π(N1)=1−π(Da)=0 and π(Nn+1)=1−π(Gn)=0. The complement (X×X)∖G is ⋃m∈NNm, so countable subadditivity gives π((X×X)∖G)≤∑m∈Nπ(Nm)=0, every partial sum being 0; hence π((X×X)∖G)=0 and, by the rule for differences again, π(G)=1.
Step 3 (Coordinates of the head maps). For k∈N define τk:X→R by τk(x)=⟨pk∗(Tk(x)),ek⟩. By Borel Sets of a Hilbert Space with an Orthonormal Basis: Coordinates, Determination by Finite-Dimensional Projections, and Pairs §continuity the map pk∗:(Rk,dE)→(X,d) and the coordinate function u↦uk on X are Borel, and Tk is Borel; so τk is Borel by two applications of claim 4 of Borel Measurability and Bounded Integration on a Metric Space. Moreover, by the same claim of Borel Sets of a Hilbert Space with an Orthonormal Basis: Coordinates, Determination by Finite-Dimensional Projections, and Pairs §continuity, pk(pk∗(w))=w for w∈Rk, and the k-th entry of pk(u) is uk; taking u=pk∗(Tk(x)) we get
τk(x)=(pk(pk∗(Tk(x))))k=(Tk(x))k(x∈X).(1)
Put gk(x)=τk(x)−xk; then gk is Borel by claim 2 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions. For N∈N put
RN(x)=k=1∑Nak−1gk(x)2(x∈X),
a Borel function by claims 2 and 3 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions, with 0≤RN(x)≤RN+1(x), the added term aN+1−1gN+1(x)2 being nonnegative. Let
B=M∈N⋃ N∈N⋂{x∈X: RN(x)≤M},
the natural numbers M being read as real numbers. Each set {x∈X:RN(x)≤M} is the complement of {x∈X:RN(x)>M}, which belongs to B(X) by the criterion of Measure Spaces and the Lebesgue Integral: Standing Notation §measurable (instantiated at the measurable space (X,B(X))); so B∈B(X) by Sigma-Algebra and Measurable Space. Thus x∈B exactly when there is M∈N with RN(x)≤M for every N∈N.
Step 4 (The map T). Let x∈B and choose M∈N as just described. For every N∈N, since 0<ak≤aˉ and ak−1gk(x)2≥0,
k=1∑Ngk(x)2=k=1∑Nakak−1gk(x)2≤aˉk=1∑Nak−1gk(x)2=aˉRN(x)≤aˉM,
so the series ∑k=1∞gk(x)2 of nonnegative terms converges by the criterion for nonnegative terms. Let g^k=1Bgk, which is Borel by claims 1 and 3 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions; thus g^k(x)=gk(x) for x∈B and g^k(x)=0 for x∈/B. For every x∈X the series ∑k=1∞g^k(x)2 converges: for x∈B it is the series just treated, and for x∈/B all its terms are 0. Hence the synthesis claim of lem:measurable-maps-hilbert-valued-2026a, applied to the functions g^k, shows that for every x∈X the series
h(x)=k=1∑∞g^k(x)ek
converges in X, that h:X→X is Borel, and that ⟨h(x),ek⟩=g^k(x) for all x∈X and k∈N. The identity map of X is continuous, hence Borel by claim 3 of Borel Measurability and Bounded Integration on a Metric Space; so
T:X→X,T(x)=x+h(x),
is Borel by the operations claim of the same lemma.
For every x∈X one has T(x)−x=h(x)∈Xa. Indeed, for N∈N,
SN(h(x))=k=1∑Nak−1g^k(x)2,
which equals RN(x)≤M if x∈B (with M chosen for x as above) and equals 0 if x∈/B; so the sequence (SN(h(x)))N∈N is bounded above and h(x)∈Xa by The Noise Space is a Real Hilbert Space: Orthonormal Basis, Continuous Embedding, Partial Sums, Closed Balls and Borel Measurability §partial-sums. Moreover, for x∈B and k∈N, by linearity of the inner product,
⟨T(x),ek⟩=xk+g^k(x)=xk+gk(x)=τk(x).(2)
Step 5 (π is concentrated on the graph of T). Let z∈G, with x=π1(z) and y=π2(z). For every k∈N we have z∈Gk, that is pk(y)=Tk(x), so by (1) τk(x)=(pk(y))k=yk, and therefore
gk(x)=yk−xk=⟨y−x,ek⟩.
Consequently RN(x)=∑k=1Nak−1⟨y−x,ek⟩2=SN(y−x) for every N∈N. Since z∈Da, y−x∈Xa, so by The Noise Space is a Real Hilbert Space: Orthonormal Basis, Continuous Embedding, Partial Sums, Closed Balls and Borel Measurability §partial-sums the sequence (SN(y−x))N∈N is bounded above with least upper bound ∣y−x∣a2. By claim 1 of The Archimedean Property of the Real Numbers there is M∈N with ∣y−x∣a2<M, and then RN(x)≤M for every N∈N; so x∈B. By (2), ⟨T(x),ek⟩=τk(x)=yk, so ⟨T(x)−y,ek⟩=0 for every k∈N, and T(x)−y=0X because (ek)k∈N is an orthonormal basis. Thus y=T(x), that is z∈ΓT; we have shown G⊆ΓT.
Since T is Borel and (X,d) is separable, Pairings into a Product, the Graph of a Measurable Map, and Couplings Concentrated on a Graph §graph-measurable gives ΓT∈B(X)⊗B(X)=B(X×X), and monotonicity gives 1=π(G)≤π(ΓT)≤π(X×X)=1, so π(ΓT)=1.
Step 6 (T is a noise-optimal map inducing π). The measure π is a probability measure on (X×X,B(X)⊗B(X)) with (π1)#π=μ and π(ΓT)=1, and T is Borel; so Pairings into a Product, the Graph of a Measurable Map, and Couplings Concentrated on a Graph §graph, applied with μ, T in place of S, and π, gives
π=(id,T)#μ,ν=(π2)#π=T#μ.
The map (id,T):X→X×X is Borel by Borel Sets of a Hilbert Space with an Orthonormal Basis: Coordinates, Determination by Finite-Dimensional Projections, and Pairs §pairing, and the function ca of The Noise Space is a Real Hilbert Space: Orthonormal Basis, Continuous Embedding, Partial Sums, Closed Balls and Borel Measurability §pairs is Borel and nonnegative with ca((id,T)(x))=na(T(x)−x) for every x∈X, by the definition of ca. Claim 2 of Image Measures, Measures with Densities, and Change of Variables, applied to the measure space (X,B(X),μ), the map (id,T) and the function ca, therefore gives
∫Xna(T(x)−x)μ(dx)=∫Xca∘(id,T)dμ=∫X×Xcad((id,T)#μ)=∫X×Xcadπ<∞,
the final inequality by Step 1. Finally (id,T)#μ=π is noise-optimal. Together with Step 4 (T Borel and T(x)−x∈Xa for every x∈X) and T#μ=ν, this shows that T is a noise-optimal map from μ to ν in the sense of Noise-Optimal Maps and Uniquely Noise-Mapped Pairs §map, and π=(id,T)#μ. This proves claim 1.
Proof of claim 2.
Step 7 (A reference coupling and its map). The ordered pair (μ,ν) is noise-connected 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, so 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 §optimal gives a noise-optimal coupling π0∈Πa(μ,ν); we fix it. By claim 1, applied to π0, we fix a noise-optimal map T0 from μ to ν with π0=(id,T0)#μ. Now let π be an arbitrary noise-optimal coupling of μ and ν; we show π=π0. Write W=Wa(μ,ν), the noise Wasserstein distance, so that ∫X×Xcadπ=Ia(π)=W2 and ∫X×Xcadπ0=Ia(π0)=W2 by Couplings of Finite Noise Cost and Their Noise Cost §cost and Noise-Optimal Couplings §optimal.
Step 8 (An elementary fact about least upper bounds). Let (pm)m∈N and (qm)m∈N be nondecreasing sequences of real numbers, bounded above, with least upper bounds p and q. Then 21(p+q) is the least upper bound of {21(pm+qm):m∈N}. Indeed, it is an upper bound since pm≤p and qm≤q. Given a real ε>0, choose m1,m2∈N with pm1>p−ε and qm2>q−ε, and let m be the larger of m1,m2; by monotonicity pm≥pm1 and qm≥qm2, so 21(pm+qm)>21(p+q)−ε, and no number below 21(p+q) is an upper bound. (†)
Step 9 (The midpoint coupling is noise-optimal). Define πˉ:B(X×X)→[0,∞] by
πˉ(E)=21(π(E)+π0(E))(E∈B(X×X)),
a real number in [0,1] since π,π0∈P(X×X). Then πˉ(∅)=0. Let (Em)m∈N be pairwise disjoint members of B(X×X) with union E. The partial sums Pn=∑m=1nπ(Em) are real and nondecreasing, and Pn=π(⋃m=1nEm)≤1 by finite additivity and monotonicity; so by Measure, Measure Space, and Probability Measure the countable additivity of π says that π(E) is the least upper bound of {Pn:n∈N}. Likewise π0(E) is the least upper bound of the partial sums Qn=∑m=1nπ0(Em). The partial sums of ∑mπˉ(Em) are 21(Pn+Qn), real and bounded above by 1, and by (†) their least upper bound is 21(π(E)+π0(E))=πˉ(E). So πˉ is a measure on B(X×X), that is a Borel measure, with πˉ(X×X)=1; thus πˉ∈P(X×X). For A∈B(X), πˉ(π1−1(A))=21(μ(A)+μ(A))=μ(A) and πˉ(π2−1(A))=21(ν(A)+ν(A))=ν(A), so πˉ∈Π(μ,ν) by Couplings of Two Borel Probability Measures on a Hilbert Space and Their Quadratic Cost §coupling; and πˉ(Da)=21(1+1)=1.
We compute ∫X×Xcadπˉ. By the approximation of nonnegative measurable functions by simple functions, applied on (X×X,B(X×X)) to the nonnegative Borel function ca, there is a sequence (sm)m∈N of nonnegative simple functions with sm≤sm+1≤ca and ca(z) the least upper bound of {sm(z):m∈N} for every z; this sequence does not involve the measure. Let λ be any of π,π0,πˉ, and let s=∑i=1rti1Ai be the standard representation (Simple Function and Its Integral) of a nonnegative simple function s, so that each ti≥0 and Ai∈B(X×X). By claim 1 of Linearity and Monotonicity of the Lebesgue Integral (applied r−1 times to sums and r times to nonnegative multiples) and The Integral of an Indicator Function is the Measure of the Set,
∫X×Xsdλ=i=1∑rtiλ(Ai),
a real number. Since πˉ(Ai)=21(π(Ai)+π0(Ai)), this gives
∫X×Xsmdπˉ=21(∫X×Xsmdπ+∫X×Xsmdπ0)(m∈N).
By the monotonicity part of claim 1 of Linearity and Monotonicity of the Lebesgue Integral, the sequences (∫smdπ)m and (∫smdπ0)m are nondecreasing and bounded above by ∫cadπ=W2 and ∫cadπ0=W2, and by Monotone Convergence Theorem their least upper bounds are ∫cadπ=W2 and ∫cadπ0=W2. By (†) the least upper bound of {∫smdπˉ:m∈N} is 21(W2+W2)=W2, and by Monotone Convergence Theorem applied with πˉ that least upper bound is ∫cadπˉ. Hence
∫X×Xcadπˉ=W2<∞.
Together with πˉ(Da)=1 this shows πˉ∈Πa(μ,ν) with Ia(πˉ)=Wa(μ,ν)2 (Couplings of Finite Noise Cost and Their Noise Cost §finite, Couplings of Finite Noise Cost and Their Noise Cost §cost), so πˉ is noise-optimal by Noise-Optimal Couplings §optimal.
Step 10 (π=π0). By claim 1, applied to πˉ, there is a noise-optimal map Tˉ from μ to ν with πˉ=(id,Tˉ)#μ; we fix it. Its graph ΓTˉ belongs to B(X×X) by Pairings into a Product, the Graph of a Measurable Map, and Couplings Concentrated on a Graph §graph-measurable, and (id,Tˉ)(x)=(x,Tˉ(x))∈ΓTˉ for every x∈X, so πˉ(ΓTˉ)=μ(X)=1 and, by the rule for differences, πˉ(F)=0 for F=(X×X)∖ΓTˉ. Now π(F)≤π(F)+π0(F)=2πˉ(F)=0 and likewise π0(F)≤2πˉ(F)=0, so π(ΓTˉ)=π0(ΓTˉ)=1 by the rule for differences. Since (π1)#π=(π1)#π0=μ, Pairings into a Product, the Graph of a Measurable Map, and Couplings Concentrated on a Graph §graph, applied with μ, Tˉ in place of S, and π, respectively π0, gives
π=(id,Tˉ)#μ=π0.
Step 11 (Conclusion). By Steps 7 and 10, T0 is a noise-optimal map from μ to ν, fixed before π was chosen, and every noise-optimal coupling π of μ and ν equals π0=(id,T0)#μ. By Noise-Optimal Maps and Uniquely Noise-Mapped Pairs §uniquely-mapped, the ordered pair (μ,ν) is uniquely noise-mapped. This proves claim 2.