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 and order of choices. For z∈X×X we write x=π1(z) and y=π2(z) as in Probability Measures on a Hilbert Space Transported in the Noise Norm: Standing Notation §background. The noise weights ak of Probability Measures on a Hilbert Space Transported in the Noise Norm: Standing Notation §weights are positive by Weight Sequences and the Weighted Fisher Information Relative to a Diagonal Gaussian Measure on a Hilbert Space §weights; for v∈Rn let Anv=(a1v1,…,anvn)∈Rn. A noise-optimal coupling lies in Πa(μ,ν) by Noise-Optimal Couplings §optimal, which is contained in Π(μ,ν) by Couplings of Finite Noise Cost and Their Noise Cost §couplings; so (π1)#π=μ and (π2)#π=ν by Couplings of Two Borel Probability Measures on a Hilbert Space and Their Quadratic Cost §coupling. We fix a density f of μ with respect to γc; by The Radon-Nikodym Theorem for a Finite Measure and a Sigma-Finite Measure, and Uniqueness of Densities it is a function f:X→R with f≥0, measurable with respect to B(X), that is, Borel. Let tn=Qn∘π1 and μn=(tn)#π; for A∈B(X), μn(A)=π(π1−1(Qn−1(A)))=μ(Qn−1(A)), so μn=(Qn)#μ. Let ψ=(π1,pn∘π2):X×X→X×Rn; its components are Borel by Borel Sets of a Hilbert Space with an Orthonormal Basis: Coordinates, Determination by Finite-Dimensional Projections, and Pairs §product-sigma, Borel Sets of a Hilbert Space with an Orthonormal Basis: Coordinates, Determination by Finite-Dimensional Projections, and Pairs §continuity and claim 4 of Borel Measurability and Bounded Integration on a Metric Space, so ψ is measurable with respect to B(X×X) and B(X)⊗B(Rn) by Pairings into a Product, the Graph of a Measurable Map, and Couplings Concentrated on a Graph §pairing (with (X×X,B(X×X)), (X,B(X)) and Rn in place of (Ω,O), (Y,Y) and Z). The choices are made in this order: conditional kernels χ and λ (Step 1); the modification χ′ of χ (Step 2); the composite kernel κ (Step 3); the map Tn, defined from χ′ alone (Step 4); and then, only for the verification, a map Sw for each w in a set W (Step 5).
Step 1 (Two conditional kernels). The space X×X is a real Hilbert space by Properties of the Product of Two Real Inner Product Spaces §hilbert, so (X×X,d) is complete by Real Hilbert Space §hilbert, and it is separable by Properties of the Product of Two Real Inner Product Spaces §separable, (X,d) being separable by Borel Probability Measures on a Real Hilbert Space with an Orthonormal Basis: Standing Notation §space, which also gives that (X,d) is complete. The map π1 is Borel by Borel Sets of a Hilbert Space with an Orthonormal Basis: Coordinates, Determination by Finite-Dimensional Projections, and Pairs §product-sigma, and Qn by Borel Sets of a Hilbert Space with an Orthonormal Basis: Coordinates, Determination by Finite-Dimensional Projections, and Pairs §continuity. By Conditional Kernels of a Borel Probability Measure on a Polish Space Given a Borel Map: Existence, Uniqueness and Concentration on the Fibres §existence, applied with (X×X,d), (X,d), π1 and π in place of (Z,d), (Y,dY), q and π (image measure (π1)#π=μ), there is a conditional kernel χ of π given π1; by the same claim, applied with (X,d), (X,d), Qn and μ in place of (Z,d), (Y,dY), q and π (image measure (Qn)#μ=μn), there is a conditional kernel λ of μ given Qn. Write χx=χ(x,⋅) and λw=λ(w,⋅).
Step 2 (A version of χ concentrated on every fibre). By Conditional Kernels of a Borel Probability Measure on a Polish Space Given a Borel Map: Existence, Uniqueness and Concentration on the Fibres §fibres, with the data used for χ in Step 1, the set G={x∈X:χx(π1−1({x}))=1} belongs to B(X) and μ(G)=1, the fibres π1−1({x}) being Borel by the preamble of that corollary; let N1=X∖G, so μ(N1)=1−1=0 by Basic Properties of a Measure §differences. For z0∈X×X let δz0(B)=1 if z0∈B and δz0(B)=0 if z0∈/B, for B∈B(X×X). This is a probability measure: δz0(∅)=0, δz0(X×X)=1, and for a sequence of pairwise disjoint Borel sets Bm the point z0 lies in at most one Bm, so δz0(⋃mBm) and ∑mδz0(Bm) are both 1 if z0 lies in some Bm and both 0 otherwise. Let D:X→X×X, D(x)=(x,x), which is measurable with respect to B(X) and B(X×X) by Borel Sets of a Hilbert Space with an Orthonormal Basis: Coordinates, Determination by Finite-Dimensional Projections, and Pairs §pairing, applied with (X,B(X)) and S=T the identity of X (measurable, since the preimage of each Borel set is that set); then δ(x,x)(B)=1D−1(B)(x). Define
χ′(x,B)=χ(x,B)(x∈G),χ′(x,B)=δ(x,x)(B)(x∈N1),B∈B(X×X).
Each χx′=χ′(x,⋅) is a probability measure on (X×X,B(X×X)), and for fixed B one has χ′(⋅,B)=1Gχ(⋅,B)+1N11D−1(B), which is measurable with respect to B(X) by claims 1, 2 and 3 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions. So χ′ is a probability kernel from (X,B(X)) to (X×X,B(X×X)) (Probability Kernels Between Measurable Spaces §kernel). For A∈B(X) and B∈B(X×X) the functions x↦1A(x)χ(x,B) and x↦1A(x)χ′(x,B) are measurable (same claims) and agree off the μ-null set N1; the first is integrable with integral π(B∩π1−1(A)) because χ is a conditional kernel, so by The Lebesgue Integral and Null Sets: Almost-Everywhere Comparison, Markov's Inequality, and Dominated Convergence Almost Everywhere §comparison the second is integrable with the same integral. Hence χ′ is a conditional kernel of π given π1 (The Conditional Kernel of a Probability Measure Given a Measurable Map §conditional-kernel). Moreover:
(1) For every x∈X and C∈B(X), χx′(π1−1(C))=1C(x). For x∈N1 this holds because (x,x)∈π1−1(C) exactly when x∈C. Let x∈G. If x∈C, then π1−1({x})⊆π1−1(C), so 1=χx(π1−1({x}))≤χx(π1−1(C))≤1 by Basic Properties of a Measure §monotone. If x∈/C, then π1−1(C)⊆(X×X)∖π1−1({x}), a set of χx-measure 1−1=0 by Basic Properties of a Measure §differences, so χx(π1−1(C))=0 by Basic Properties of a Measure §monotone.
Step 3 (A conditional kernel given tn). Apply Conditioning in Two Steps: Composing a Conditional Kernel Given a Map with a Conditional Kernel Given a Function of It §composition with (X×X,d), (X,d), (X,d), π1, Qn and π in place of (Z,dZ), (Y1,d1), (Y2,d2), q, s and π; there ν1=(π1)#π=μ and ν2=(Qn∘π1)#π=μn, and we take the conditional kernel χ′ of π given π1 (Step 2) and the conditional kernel λ of μ given Qn (Step 1) in place of κ and λ. So
κ(w,B)=∫Xχ′(x,B)λw(dx)(w∈X, B∈B(X×X))
defines a probability kernel κ from (X,B(X)) to (X×X,B(X×X)) that is a conditional kernel of π given Qn∘π1=tn. Write κw=κ(w,⋅). The integrand x↦χ′(x,B) is Borel with values in [0,1], so the integral above is also its integral as a nonnegative function, by claim 6(c) of Borel Measurability and Bounded Integration on a Metric Space (λw being a Borel measure of mass 1 on (X,d)); we use this identification below without further comment.
(2) For every w∈X, (π1)#κw=λw. For C∈B(X), by (1) and The Integral of an Indicator Function is the Measure of the Set, κw(π1−1(C))=∫X1Cdλw=λw(C).
Step 4 (The map Tn). For k∈{1,…,n} let ηk:X×X→R, ηk(z)=yk; it is Borel by claim 4 of Borel Measurability and Bounded Integration on a Metric Space, being the composite of π2 (Borel Sets of a Hilbert Space with an Orthonormal Basis: Coordinates, Determination by Finite-Dimensional Projections, and Pairs §product-sigma) with the coordinate x↦xk (Borel Sets of a Hilbert Space with an Orthonormal Basis: Coordinates, Determination by Finite-Dimensional Projections, and Pairs §continuity). The functions ηk+=max(ηk,0) and ηk−=max(−ηk,0) are nonnegative and Borel by claims 1, 2 and 4 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions. By Conditional Kernels of a Borel Probability Measure on a Polish Space Given a Borel Map: Existence, Uniqueness and Concentration on the Fibres §nonnegative, applied with (X×X,d), (X,d), π1, π, the conditional kernel χ′ and ηk+ (respectively ηk−) in place of (Z,d), (Y,dY), q, π, κ and f, the set Nk+ (respectively Nk−) of the x∈X for which ηk+ (respectively ηk−) is not integrable with respect to χx′ belongs to B(X), and the function gk+ (respectively gk−) equal to ∫ηk+dχx′ (respectively ∫ηk−dχx′) off that set and to 0 on it is measurable with respect to B(X). Put
bk=1X∖(Nk+∪Nk−)(gk+−gk−),
measurable by claims 1, 2 and 3 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions, and Tn(x)=(b1(x),…,bn(x)). Then Tn:X→Rn is Borel by claims 2 and 5 of The Borel Sigma-Algebra of a Euclidean Space as a Product, and Measurability of Projections, Sequentially Continuous Maps, and Open and Closed Sets. Let ΓTn={(x,v)∈X×Rn:v=Tn(x)}, which belongs to B(X)⊗B(Rn) by Pairings into a Product, the Graph of a Measurable Map, and Couplings Concentrated on a Graph §graph-measurable (with (X,B(X)), (Rn,dE) and Tn in place of (Y,Y), (Z,dZ) and S; (Rn,dE) is separable by Euclidean Space is a Separable Metric Space §separable), and let Gn={z∈X×X:pn(y)=Tn(x)}. A point z lies in Gn exactly when ψ(z)=(x,pn(y))∈ΓTn, so Gn=ψ−1(ΓTn)∈B(X×X).
(3) Let x∈X and c∈Rn, and suppose that some F∈B(X×X) with χx′(F)=1 satisfies π1(z)=x and pn(π2(z))=c for every z∈F. Then Tn(x)=c and χx′((X×X)∖Gn)=0. Indeed χx′((X×X)∖F)=1−1=0 by Basic Properties of a Measure §differences, and for k≤n we have ηk=ck on F. So ηk+ agrees χx′-almost everywhere with the constant function max(ck,0), which is integrable with respect to χx′, a Borel measure of mass 1 on (X×X,d), with integral max(ck,0) by claim 6(a) of Borel Measurability and Bounded Integration on a Metric Space; by The Lebesgue Integral and Null Sets: Almost-Everywhere Comparison, Markov's Inequality, and Dominated Convergence Almost Everywhere §comparison, ηk+ is integrable with respect to χx′ with integral max(ck,0). Likewise ηk− is integrable with integral max(−ck,0). Hence x∈/Nk+∪Nk− and bk(x)=max(ck,0)−max(−ck,0)=ck. Thus Tn(x)=c, every z∈F satisfies pn(y)=c=Tn(x), so F⊆Gn, and χx′((X×X)∖Gn)≤χx′((X×X)∖F)=0 by Basic Properties of a Measure §monotone.
Step 5 (Fibre maps). 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. Apply Fibrewise Cyclical Monotonicity of a Noise-Optimal Coupling: Given the Tail, the Heads are Cyclically Monotone §monotone with μ, ν, π, n and the conditional kernel κ of π given tn of Step 3; with hn and θw=(hn)#κw as in that lemma, it gives W1∈B(X) with μn(W1)=1 such that suppθw is cyclically monotone for every w∈W1. Apply The Head Given the Tail is Absolutely Continuous for a Measure with a Density Relative to a Diagonal Gaussian Measure §absolutely-continuous with c, γc, μ, f, n and the conditional kernel λ of μ given Qn of Step 1; its νn=(Qn)#μ is μn, so it gives W2∈B(X) with μn(W2)=1 such that (pn)#λw is absolutely continuous for every w∈W2. Let W=W1∩W2∈B(X); as μn(X∖W1)=μn(X∖W2)=0 by Basic Properties of a Measure §differences, Basic Properties of a Measure §subadditivity gives μn(X∖W)=0.
By the definition of hn (its first n components are x1,…,xn and its last n are a1−1y1,…,an−1yn), with the concatenation map ι of Probability Measures on Euclidean Space and Random Vectors: Standing Notation §pairs,
hn(z)=ι(pn(x),(a1−1y1,…,an−1yn))(z∈X×X).
Hence, by Pairs of Euclidean Points: Coordinate Projections, Pairings, the Product Measure on a Euclidean Space, Borel Norm Functions and Finite Sets §projections, the coordinate projections pr1,pr2 of Probability Measures on Euclidean Space and Random Vectors: Standing Notation §pairs satisfy pr1(hn(z))=pn(x) and pr2(hn(z))=(a1−1y1,…,an−1yn). Hence for w∈X and B∈B(Rn), using (2),
θw(pr1−1(B))=κw(hn−1(pr1−1(B)))=κw(π1−1(pn−1(B)))=λw(pn−1(B)),
so (pr1)#θw=(pn)#λw; call it mw. For w∈W, mw is absolutely continuous and suppθw is cyclically monotone, so A Coupling on Euclidean Space with an Absolutely Continuous First Marginal and Cyclically Monotone Support is Induced by a Map §map, applied with n (which satisfies 1≤n) and θw in place of d and θ, gives a Borel map S:Rn→Rn with θw=(id,S)#mw; for each w∈W we choose one such map and call it Sw.
Step 6 (π(Gn)=1). Fix w∈W. By Pairings into a Product, the Graph of a Measurable Map, and Couplings Concentrated on a Graph §graph-measurable, with (Rn,B(Rn)), (Rn,dE) and Sw in place of (Y,Y), (Z,dZ) and S, the graph ΓSw={(u,v):v=Sw(u)} belongs to B(Rn)⊗B(Rn). The map r:Rn+n→Rn×Rn, r(v)=(pr1(v),pr2(v)), is measurable with respect to B(Rn+n) and B(Rn)⊗B(Rn) by Pairings into a Product, the Graph of a Measurable Map, and Couplings Concentrated on a Graph §pairing, its components being Borel by Pairs of Euclidean Points: Coordinate Projections, Pairings, the Product Measure on a Euclidean Space, Borel Norm Functions and Finite Sets §projections. So Γw′=r−1(ΓSw)={v∈Rn+n:pr2(v)=Sw(pr1(v))} belongs to B(Rn+n). For u∈Rn the point (id,Sw)(u)=ι(u,Sw(u)) has pr1-image u and pr2-image Sw(u) by Pairs of Euclidean Points: Coordinate Projections, Pairings, the Product Measure on a Euclidean Space, Borel Norm Functions and Finite Sets §projections, so it lies in Γw′; hence θw(Γw′)=mw(Rn)=1. Let Hw=hn−1(Γw′), which belongs to B(X×X) since hn is Borel (preamble of Fibrewise Cyclical Monotonicity of a Noise-Optimal Coupling: Given the Tail, the Heads are Cyclically Monotone). By Step 5, z∈Hw exactly when ak−1yk=Sw(pn(x))k for k≤n, that is (multiplying by ak>0) when pn(y)=AnSw(pn(x)). Now κw(Hw)=θw(Γw′)=1, so by Basic Properties of a Measure §differences and the formula for κ,
0=κw((X×X)∖Hw)=∫Xχx′((X×X)∖Hw)λw(dx).
The integrand is Borel and nonnegative, so by The Lebesgue Integral and Null Sets: Almost-Everywhere Comparison, Markov's Inequality, and Dominated Convergence Almost Everywhere §vanishing the set Ew={x∈X:χx′((X×X)∖Hw)=0}, which belongs to B(X) as the preimage of {0} under that Borel function, satisfies λw(X∖Ew)=0.
Let x∈Ew and F=Hw∩π1−1({x})∈B(X×X), since {x}∈B(X) (as in Step 2) and π1 is Borel. By (1) with C={x} and Basic Properties of a Measure §differences, χx′((X×X)∖π1−1({x}))=0; since (X×X)∖F is the union of (X×X)∖Hw and (X×X)∖π1−1({x}), Basic Properties of a Measure §subadditivity gives χx′((X×X)∖F)=0, so χx′(F)=1. Every z∈F satisfies π1(z)=x and pn(π2(z))=AnSw(pn(x)). By (3) with c=AnSw(pn(x)), χx′((X×X)∖Gn)=0. Thus the Borel function x↦χx′((X×X)∖Gn), with values in [0,1], vanishes on Ew, and X∖Ew is λw-null; by The Lebesgue Integral and Null Sets: Almost-Everywhere Comparison, Markov's Inequality, and Dominated Convergence Almost Everywhere §null-integral,
κw((X×X)∖Gn)=∫Xχx′((X×X)∖Gn)λw(dx)=0(w∈W).
Finally, since κ is a conditional kernel of π given tn, the identity of The Conditional Kernel of a Probability Measure Given a Measurable Map §conditional-kernel with A=X (so tn−1(A)=X×X and 1A=1) and B=(X×X)∖Gn gives
π((X×X)∖Gn)=∫Xκ(w,(X×X)∖Gn)μn(dw)=0,
by The Lebesgue Integral and Null Sets: Almost-Everywhere Comparison, Markov's Inequality, and Dominated Convergence Almost Everywhere §null-integral, the integrand being Borel with values in [0,1] (so its integral is its integral as a nonnegative function, claim 6(c) of Borel Measurability and Bounded Integration on a Metric Space) and vanishing off the μn-null set X∖W. Hence π(Gn)=1−0=1 by Basic Properties of a Measure §differences.
Step 7 (Claim 1). Let σ=ψ#π, a probability measure on (X×Rn,B(X)⊗B(Rn)) by claim 1 of Image Measures, Measures with Densities, and Change of Variables, and let prX:X×Rn→X be the coordinate projection (called prY in Pairings into a Product, the Graph of a Measurable Map, and Couplings Concentrated on a Graph). For A∈B(X), ψ−1(prX−1(A))=π1−1(A), so σ(prX−1(A))=π(π1−1(A))=μ(A); that is, (prX)#σ=μ. Moreover σ(ΓTn)=π(ψ−1(ΓTn))=π(Gn)=1 by Step 6. By Pairings into a Product, the Graph of a Measurable Map, and Couplings Concentrated on a Graph §graph, applied with (X,B(X)), (Rn,dE) (separable), μ, Tn and σ in place of (Y,Y), (Z,dZ), μ, S and π, we get σ=(id,Tn)#μ, that is, (π1,pn∘π2)#π=(id,Tn)#μ with the Borel map Tn of Step 4. This proves claim 1.
Step 8 (Claim 2). Let Tn now be any Borel map X→Rn as in claim 1, and let Gn={z∈X×X:pn(y)=Tn(x)} and ΓTn its graph, which belongs to B(X)⊗B(Rn) by Pairings into a Product, the Graph of a Measurable Map, and Couplings Concentrated on a Graph §graph-measurable, applied as in Step 4 to this Tn. As in Step 4, z∈Gn exactly when ψ(z)∈ΓTn, so Gn=ψ−1(ΓTn), and (id,Tn)(x)=(x,Tn(x))∈ΓTn for every x∈X, so (id,Tn)−1(ΓTn)=X. Therefore
π(Gn)=(ψ#π)(ΓTn)=((id,Tn)#μ)(ΓTn)=μ(X)=1.
This proves claim 2.