Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Gluing two Euclidean couplings

Statement

Assume the Axiom of Choice. Let d1,d2,d3≥1, let α be a Borel probability on Rd1×Rd2 and β a Borel probability on Rd2×Rd3, and suppose the second marginal of α and first marginal of β are the same probability ρ on Rd2. There is a Borel probability γ on Rd1×Rd2×Rd3 whose (x,y) marginal is α and whose (y,z) marginal is β.

Statement references

Diagram

In the diagram, X=Rd1, Y=Rd2, and Z=Rd3. It records the required projections from the joint law γ onto the adjacent coordinate pairs. The arrows are pushforwards of γ; the proof below constructs the middle measure explicitly and does not infer existence from the picture.

\begin{tikzpicture}[>=stealth] \node (alpha) at (0,0) {α on X×Y}; \node (gamma) at (3.5,0) {γ on X×Y×Z}; \node (beta) at (7,0) {β on Y×Z}; \draw[->] (gamma) -- node[above] {(x,y)#} (alpha); \draw[->] (gamma) -- node[above] {(y,z)#} (beta); \end{tikzpicture}

The two outer laws have the same middle marginal ρ on Y; the arrows specify that projecting the constructed triple law onto either adjacent pair recovers the corresponding outer law.

Facts & Assumptions

Given: the Axiom of Choice, the two probability measures, and their common middle marginal ρ.

[F1]

Euclidean spaces with their Borel sigma-algebras are standard Borel; finite products have the product Borel sigma-algebra. Standard Borel spaces Finite products of standard Borel spaces are standard Borel Borel sigma-algebra of a product of second-countable spaces

[F2]

Under AC The Axiom of Choice, a probability on a product of standard Borel spaces with second marginal ρ disintegrates as Ky(dx)ρ(dy) for a probability kernel K, with the specified joint law recovered by integrating the kernel. Disintegration of a joint law on standard borel spaces

[F3]

Products of two probability measures exist, have mass one, and assign a rectangle the product of its factor masses. The product measure of two sigma-finite measure spaces For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique

[F4]

The sets measurable for the product sigma-algebra are generated by measurable rectangles, and a pi-system contained in a lambda-system generates a sigma-algebra contained in that lambda-system. The product sigma-algebra and its finite iterates Dynkin's pi-lambda theorem

[F5]

Kernel evaluations on measurable sets are measurable; nonnegative measurable functions can be integrated against a kernel measurably, and sections of product-measurable sets are measurable. Measure kernel and probability kernel Measurability of integration against a kernel Every section of a product-measurable set is measurable

[F6]

Monotone convergence passes increasing nonnegative integrands through integrals; probability measures are countably additive. Monotone convergence for the integral Measures on sigma-algebras

[F7]

If P is a Borel probability law on a Polish space and S is Borel into a Polish space, define S#P(H)=P(S−1(H)); preimages show this is a Borel probability law and that coordinate marginals compose with coordinate projections. Borel probability law on a polish space Measures on sigma-algebras

Proof

1.1givenF1F2F7

Apply [F2] to α with its second coordinate y as conditioning variable, obtaining a probability kernel Ky(dx) with α(A×B)=∫BKy(A)dρ(y). The supplier conditions on the second marginal, so for β first define the coordinate swap S(y,z)=(z,y) and β^=S#β on Rd3×Rd2. By [F7], this is a Borel probability whose second marginal is the common law ρ. Apply [F2] to β^ to obtain a probability kernel Ly(dz) with β^(C×B)=∫BLy(C)dρ(y), equivalently β(B×C)=∫BLy(C)dρ(y). Thus for every Borel A⊆Rd1, B⊆Rd2, and C⊆Rd3 both joint laws are disintegrated over the same conditioning law.

2.1F1F3F4F5step 1.1

For each y, let Qy=Ky⊗Ly, the product probability on Rd1×Rd3. For a rectangle A×C, Qy(A×C)=Ky(A)Ly(C) is measurable in y. The sets D for which y↦Qy(D) is measurable form a lambda-system: the whole space has value one, complements have value 1−Qy(D), and disjoint unions have value the increasing limit of finite sums. Rectangles form a pi-system generating the product Borel sigma-algebra by [F1] and [F4]. Thus [F4] proves measurability for every Borel D. The same lambda-system argument applied to rectangles B×A×C in the variables (y,x,z) shows that y↦Qy(Ey) is measurable for each Borel E⊆Rd2×Rd1×Rd3, where Ey={(x,z):(y,x,z)∈E}.

3.1F3F5F6step 2.1

Define γ~(E)=∫Qy(Ey) dρ(y) on the product Borel sigma-algebra in the coordinate order (y,x,z). It is nonnegative and has total mass one. For disjoint Ej, their sections are disjoint, so countable additivity of Qy followed by monotone convergence [F6] gives γ~(⋃jEj)=∑jγ~(Ej). Hence γ~ is a Borel probability.

4.1F1F2F4F7step 1.1step 3.1∎

For Borel rectangles B×A×Rd3 and B×Rd1×C, the definition and the two identities in step 1.1 give respectively γ~(B×A×Rd3)=∫BKy(A)Ly(Rd3) dρ(y)=α(A×B) and γ~(B×Rd1×C)=∫BLy(C)Ky(Rd1) dρ(y)=β(B×C). Rectangles determine finite Borel measures by [F4], so these identities identify the two pair marginals in coordinate order (y,x,z). Define the Borel coordinate permutation P(y,x,z)=(x,y,z) and set γ=P#γ~, meaning γ(H)=γ~(P−1(H)) for each Borel H; by [F7] this is a Borel probability. The coordinate projections satisfy pr⁡x,y∘P(y,x,z)=(x,y) and pr⁡y,z∘P(y,x,z)=(y,z), hence their pushforwards are exactly α and β.

Depends on

Used by

Dependency tree · two levels

75 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources