Throughout, functions given by an expression, such as y↦(x,y) or (x,y)↦(y,x), exist as in Sets and Maps: Ordinary Notation (v), sets of rectangles such as {A×B:A∈C, B∈D} are sets of subsets of X×Y as images (Sets and Maps: Ordinary Notation (vii)), and preimages are computed elementwise with Preimages under a Map: Membership, the Preimage Map, Sequences of Preimages, and the Set of Sets with Preimage in a Given Set (ii). Write Rect=Rect(F,G). By definition, F⊗G=σ(Rect), a σ-algebra on X×Y containing Rect (Measurable Rectangles and the Product σ-Algebra (ii), Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (iii)). Every measurability claim into F⊗G below is checked on generators, by Measurable Maps: Generators, Composition, Continuous Maps, Restrictions, and Criteria for Real- and [0,∞]-Valued Maps (i).
Rectangles form a π-system. Every element of Rect is a subset of X×Y by Measurable Rectangles and the Product σ-Algebra (i). For A,A′∈F and B,B′∈G (Rectangles, Sections and the Swap: Set Identities (i)),
(A×B)∩(A′×B′)=(A∩A′)×(B∩B′).
Since A∩A′∈F and B∩B′∈G (Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (ix)), this is again a measurable rectangle, and Rect is a π-system on X×Y (π-System (i)). Moreover X∈F and Y∈G (σ-Algebra and Measurable Space (i)), so X×Y∈Rect. This proves (i).
Projections. Let pr1:X×Y→X and pr2:X×Y→Y be the projections pr1(x,y)=x and pr2(x,y)=y (Projection, Evaluation and Currying Maps (i)). For A∈F and B∈G,
pr1−1(A)=A×Y,pr2−1(B)=X×B,
and both are measurable rectangles, as X∈F and Y∈G; so they lie in F⊗G. By Measurable Map, and the Set of Measurable Maps (i), pr1 is (F⊗G)/F-measurable and pr2 is (F⊗G)/G-measurable. This proves (vi); the argument applies to any two measurable spaces.
Pairings. Let φ:W→X×Y, φ(w)=(g(w),h(w)). Then pr1∘φ=g and pr2∘φ=h. If φ is K/(F⊗G)-measurable, then g and h are measurable as composites of φ with the measurable projections (Measurable Maps: Generators, Composition, Continuous Maps, Restrictions, and Criteria for Real- and [0,∞]-Valued Maps (ii)). Conversely, let g be K/F-measurable and h be K/G-measurable. For A∈F and B∈G,
φ−1(A×B)={w∈W:g(w)∈A, h(w)∈B}=g−1(A)∩h−1(B),
which lies in K, since g−1(A),h−1(B)∈K (Measurable Map, and the Set of Measurable Maps (i), Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (ix)). As F⊗G=σ(Rect), φ is K/(F⊗G)-measurable by Measurable Maps: Generators, Composition, Continuous Maps, Restrictions, and Criteria for Real- and [0,∞]-Valued Maps (i). This proves (vii), again for any two measurable spaces.
Rectangles of generators. Let Rect0={A×B:A∈C, B∈D}. Since C⊆F and D⊆G, we have Rect0⊆Rect, hence σ(Rect0)⊆σ(Rect)=F⊗G (Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (v)). For the reverse inclusion, σ(Rect0) is a σ-algebra on X×Y containing Rect0 (Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (iii)); regard pr1 as a function from the measurable space (X×Y,σ(Rect0)) to (X,F). For A∈C we have pr1−1(A)=A×Y∈Rect0, because Y∈D. Since F=σ(C), pr1 is σ(Rect0)/F-measurable by Measurable Maps: Generators, Composition, Continuous Maps, Restrictions, and Criteria for Real- and [0,∞]-Valued Maps (i), that is,
A×Y=pr1−1(A)∈σ(Rect0)for every A∈F.
In the same way, using X∈C and G=σ(D), X×B∈σ(Rect0) for every B∈G. Hence every measurable rectangle
A×B=(A×Y)∩(X×B)(A∈F, B∈G)
lies in σ(Rect0) (the identity by Rectangles, Sections and the Swap: Set Identities (i), membership by Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (ix)). So Rect⊆σ(Rect0), and F⊗G=σ(Rect)⊆σ(Rect0) by Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (iv). This proves (ii).
Insertions. Fix x∈X and let ix:Y→X×Y, ix(y)=(x,y). For A∈F and B∈G (Rectangles, Sections and the Swap: Set Identities (iii), Rectangles, Sections and the Swap: Set Identities (i)),
ix−1(A×B)=(A×B)x={B,∅,x∈A,x∈/A,
and both B and ∅ lie in G (Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (vi)). By Measurable Maps: Generators, Composition, Continuous Maps, Restrictions, and Criteria for Real- and [0,∞]-Valued Maps (i), ix is G/(F⊗G)-measurable. Likewise, for y∈Y the function iy:X→X×Y, iy(x)=(x,y), satisfies (iy)−1(A×B)=(A×B)y=A if y∈B and =∅ otherwise, so it is F/(F⊗G)-measurable. This proves (iii).
Sections of measurable sets. Let E∈F⊗G, so E⊆X×Y, and let x∈X and y∈Y. By Rectangles, Sections and the Swap: Set Identities (iii),
Ex=ix−1(E),Ey=(iy)−1(E),
and these lie in G and F respectively, by (iii) (and Measurable Map, and the Set of Measurable Maps (i)). This proves (iv).
Sections of measurable functions. For x∈X and y∈Y, fx=f∘ix and fy=f∘iy (Precomposition Commutes with Pointwise Operations, and Sections of Functions Are Precompositions (iv)). By (iii) and Measurable Maps: Generators, Composition, Continuous Maps, Restrictions, and Criteria for Real- and [0,∞]-Valued Maps (ii), fx is G/H-measurable and fy is F/H-measurable. This proves (v).
The swap. Since s(z)=(pr2(z),pr1(z)) for z∈X×Y, and pr2 and pr1 are (F⊗G)/G- and (F⊗G)/F-measurable, the pairing step, applied with (W,K)=(X×Y,F⊗G) and the target (Y×X,G⊗F), shows that s is (F⊗G)/(G⊗F)-measurable. With the roles of the two spaces exchanged, the swap t:Y×X→X×Y, t(y,x)=(x,y), is (G⊗F)/(F⊗G)-measurable, and
t∘s=idX×Y,s∘t=idY×X,
so s is a bijection with inverse t (Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (vii)). Hence, for E⊆X×Y,
s[E]=t−1(E),E=s−1(s[E])
by Images and Preimages under a Bijection and Its Inverse (i) and Images and Preimages under a Bijection and Its Inverse (ii). If E∈F⊗G, then s[E]=t−1(E)∈G⊗F by measurability of t; if s[E]∈G⊗F, then E=s−1(s[E])∈F⊗G by measurability of s. This proves (viii).