(Q1) Generator criterion and projections. If ϕ:(X,G)→Y is a map into a set carrying the σ-algebra generated by a family E, and ϕ−1(E)∈G for all E∈E, then ϕ is measurable: the sets A⊆Y with ϕ−1(A)∈G form a σ-algebra containing E, hence containing the generated σ-algebra by Intersections of Sigma-Algebras and Minimality of the Generated Sigma-Algebra. A product σ-algebra is generated by its measurable rectangles, so the coordinate projections of a product are measurable, and a map into a product is measurable as soon as the preimages of rectangles are measurable. In particular the maps (ω,θ,r)↦ω, ↦θ, ↦r, ↦(ω,θ), ↦(θ,r) and ↦(r,ω) on Ω♯ are measurable from F♯ to F, Bd, R, F⊗Bd, Bd⊗R and R⊗F respectively: the preimage of a rectangle is in each case a set of the form A×B×C′ with A∈F, B∈Bd, C′∈R, which lies in F♯=(F⊗Bd)⊗R as the rectangle (A×B)×C′. Compositions of measurable maps are measurable.
(Q2) Countable sums under the expectation. If Zn:Ω→[0,∞] (n∈N) are F-measurable, then ∑nZn (a pointwise least upper bound of the partial sums) is measurable and E[∑nZn]=∑nE[Zn]: the partial sums increase to the sum, their expectations are the partial sums of the right side by Linearity and Monotonicity of the Lebesgue Integral, and Monotone Convergence Theorem gives the identity. The same holds for integrals with respect to any measure.
Step 1 (claim 1).Independence. Enumerate the driving family by a bijection with N (independence of a family is unaffected by reindexing, being a condition on finite subfamilies by Independence of Events and of Random Variables). The σ-algebras V and U are generated by disjoint subfamilies, so they are independent by Grouping Lemma for Independent Random Variables; likewise the family (Gc)c is independent, and so is (Uc)c.
Factorisation. Let Z:Ω→[0,∞] be U-measurable. For n∈N put Zn=min(Z,n), a bounded U-measurable random variable: for a real a, {Zn>a}={Z>a}∈U if a<n and {Zn>a}=∅ if a≥n, and the sets (a,∞) generate the Borel σ-algebra (Borel Sigma-Algebra on the Real Line). The indicator 1{K=y} is V-measurable, so 1{K=y} and Zn are independent random variables by Grouping Lemma for Independent Random Variables (its final assertion, applied to the generating subfamilies of V and U), both with finite expectation; Expectation of a Product of Independent Random Variables gives E[1{K=y}Zn]=P(K=y)E[Zn]. As n→∞, Zn and 1{K=y}Zn increase pointwise to Z and 1{K=y}Z, and Monotone Convergence Theorem applied to both sides yields the identity in [0,∞].
Step 2 (claim 2).Deterministic-count clocks. Fix y and c. Off Ω0U the path of P(y),c is identically 0, a counting path. On Ω0U it is u↦∑q=1n1{Wq≤u}, where W1,…,Wn (n=∑jyc,j) are the points Uic,j with 1≤j≤Jc, 1≤i≤yc,j, which are pairwise distinct and lie in (0,R]. We verify Counting Path and Its Jump Times: the value at 0 is 0 because every Wq>0; the values are in N0; the path is nondecreasing because each summand is; for right-continuity at u≥0, let δ>0 be smaller than every Wq−u with Wq>u (or δ=1 if there is none), then every summand, hence the sum, is constant on [u,u+δ), so the value at u is the greatest lower bound over (u,∞) of a nondecreasing path; for the unit-jump condition at t>0, the least upper bound over [0,t) is the number of Wq<t, the value at t is the number of Wq≤t, and their difference is the number of Wq equal to t, at most 1 by distinctness; at t=0 the difference is 0−0=0. Each Pu(y),c is a finite sum of products of indicators of members of U (claims 1 to 3 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions), hence U-measurable. On Ω0U and for u∈[0,R] the defining sum is exactly the deterministic-count path puc,(yc,⋅) of Uniform Representation of the Rate-One Poisson Counting Path on a Bounded Interval: Distinct Points, Poisson Increments, Conditional Law Given the Cell Counts, and Point Insertion.
Insertion. For c=c0 the defining sums for y and y+mec0,j0 coincide. For c=c0, the sum for y+mec0,j0 contains the additional terms i=yc0,j0+1,…,yc0,j0+m of the cell j0, which gives the displayed identity; on Ω0U the inserted points lie in Ic0,j0 and are distinct from each other and from all other points Ui′c0,j by the definition of Ω0U.
Copy clocks. For every ω and u, Pu♯,c(ω)=∑y∈N0L1{K(ω)=y}Pu(y),c(ω), a countable sum with exactly one nonzero term, hence the pointwise limit of F-measurable partial sums along the enumeration of (Q3); so Pu♯,c is F-measurable by claim 5 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions. Its path at ω is the path of P(K(ω)),c at ω, a counting path.
The reference measure.P is finite and λd is σ-finite, so P⊗λd exists by Existence and Uniqueness of the Product Measure and is σ-finite; ρ is σ-finite (Step 5(b) below, which uses nothing from this step), so (P⊗λd)⊗ρ exists and is σ-finite. By claim 3 of Image Measures, Measures with Densities, and Change of Variables (the density q♯ being finite-valued), μ♯ is a measure on F♯ and ∫Ω♯Hdμ♯=∫Ω♯Hq♯d((P⊗λd)⊗ρ) for every F♯-measurable H:Ω♯→[0,∞].
Step 5 (claim 5).(a) The count mass function.S is the image of N0L under the injective map y↦y/N, hence countable by (Q3). p takes values in [0,1] and is positive exactly on S (Step 1). Since p vanishes off S, every finite partial sum of p over a finite set F⊆Rd equals the partial sum over F∩S, so the two least upper bounds in Sum of a Nonnegative Function over an Arbitrary Set agree: ∑x∈Rdp(x)=∑x∈Sp(x)=∑yP(K=y)=1 by (Q3) and Step 1; so p is a discrete probability mass function with support S. For x∈Rd, ∥x∥2=∑(c,j)xc,j2≤(∑(c,j)∣xc,j∣)2, so ∥x∥≤∑(c,j)∣xc,j∣, and for x=y/N∈S all coordinates are nonnegative. Hence, by (Q3) and (Q2),
∑x∈Sp(x)∥x∥≤N1∑(c,j)∈L∑yP(K=y)yc,j=N1∑(c,j)∈LE[∑y1{K=y}yc,j]=N1∑(c,j)∈LE[Kc,j]=N1∑c∑j=1Jc∣Ic,j∣=Nl(l−1)R,
since ∑j∣Ic,j∣=bJcc−b0c=R for each of the l(l−1) labels.
(d) The identity for g. Fix (θ,r). For every ω, exactly one term of ∑y1{K(ω)=y}φη(θ−y/N)ℓ(y),ω(r) is nonzero, namely the one with y=K(ω), and it equals φη(θ−K(ω)/N)ℓ♯,ω(r) by claim 3. For each y the map ω↦ℓ(y),ω(r) is U-measurable, being the section at r of an R⊗U-measurable map (the sets E⊆R×Ω whose section at r lies in U form a σ-algebra containing the measurable rectangles, hence containing R⊗U by Intersections of Sigma-Algebras and Minimality of the Generated Sigma-Algebra, and the preimage of a Borel set under the section is the section of the preimage). Hence, by (Q2) and the factorisation of claim 1,
E[φη(θ−K/N)ℓ♯,⋅(r)]=∑yφη(θ−y/N)E[1{K=y}ℓ(y),⋅(r)]=∑yP(K=y)φη(θ−y/N)E[ℓ(y),⋅(r)]=∑x∈Sp(x)φη(θ−x)f(x,r)=g(θ,r),
the last step being the reindexing x=y/N of (Q3).
(e) The joint density. Let F:Rd×R→[0,∞] be Bd⊗R-measurable. Then F(Θ,D)=F∘π with π(ω,θ,r)=(θ,r) is F♯-measurable by (Q1), and by Step 4, ∫Ω♯F(Θ,D)dμ♯=∫Ω♯F(θ,r)q♯(ω,θ,r)d((P⊗λd)⊗ρ). By Tonelli on (Ω×Rd)×R this equals ∫R(∫Ω×RdF(θ,r)q♯(ω,θ,r)d(P⊗λd)(ω,θ))ρ(dr), and for fixed r the inner integrand is F⊗Bd-measurable (section clause), so by Tonelli on Ω×Rd, integrating first over ω, the inner integral equals
∫RdF(θ,r)(∫Ωφη(θ−K(ω)/N)ℓ♯,ω(r)P(dω))λd(dθ)=∫RdF(θ,r)g(θ,r)λd(dθ)
by (d) (for fixed θ the constant F(θ,r) comes out of the ω-integral by Linearity and Monotonicity of the Lebesgue Integral, or trivially if F(θ,r)=∞ and both sides are read in [0,∞] with 0⋅∞=0). Finally, g is B(Rd)⊗R-measurable by claim 1 of Gaussian Smoothing of a Kernel-Weighted Discrete Family with Countable Support: Joint Density, van Trees Regularity, and the Symmetrised Directional Score Bound, so Fg is measurable and Tonelli on Rd×R turns the iterated integral ∫R∫RdFgdλddρ into ∫Rd×RFgd(λd⊗ρ). ■