Also P(Vi∈/(0,R])=1−ν(0,R]((0,R])=0 and P(Uij∈/Ij)=0. The complement of Ω0 is, by definition, the union of countably many events each of probability 0, so it is an event of probability 0 by countable subadditivity, and P(Ω0)=1.
Step 2: claim 2. By the preliminaries, each pu, pu(y) and Cj is a random variable with values in N0 (a sum of indicators); and p0=∑i≤K1{Vi≤0} and p0(y)=∑j∑i≤yj1{Uij≤0} vanish on Ω0, where all points are positive. For 0≤s<u≤R, 1{Vi≤u}−1{Vi≤s}=1{Vi∈(s,u]}, giving the increment formula. Now let 0≤u0<⋯<ur≤R and apply Thinning: Cell Counts of a Poisson Number of Independent Points to K (Poisson with parameter μ=R), the probability measure ν=ν(0,R], the variables Vi and the pairwise disjoint Borel sets Aq=(uq−1,uq], 1≤q≤r: the cell counts of that lemma are exactly puq−puq−1, and by its claim 3 they are independent with Poisson distributions with parameters Rν(0,R](Aq)=Rλ(Aq)/R=uq−uq−1. Taking uq=bq (0≤q≤J) gives Cj=pbj−pbj−1 (the same thinning count with Aj=Ij), independence of C1,…,CJ, and Cj Poisson with parameter ∣Ij∣; by claim 2 of Thinning: Cell Counts of a Poisson Number of Independent Points, P(C=y)=∏jpoi∣Ij∣(yj), which is positive since exp>0 and ∣Ij∣>0.
The case y=0. On Ω0, ∑jCj=K (every Vi with i≤K lies in exactly one cell), so Ω0∩{C=0}=Ω0∩{K=0}, on which p is the zero path; and p(0) is the zero path everywhere (empty sums). Hence E[F(p)1{C=0}]=F(0)P(K=0)=F(0)exp(−R), while P(C=0)E[F(p(0))]=∏jexp(−∣Ij∣)F(0)=exp(−R)F(0) by claim 2 and the functional equation of exp (Basic Properties of the Exponential Function), where 0 denotes the zero path. So the claim holds for y=0; from now on let n=∑jyj≥1.
Patterns. Fix y∈N0J with n=∑jyj≥1. Let Σy be the (finite, nonempty) set of maps σ:{1,…,n}→{1,…,J} with exactly yj indices mapped to j for every j. On Ω0∩{K=n}, every Vi with i≤n lies in exactly one cell, say Iσ(i), and then Cj=#{i≤n:σ(i)=j}; hence Ω0∩{C=y}=Ω0∩{K=n}∩⋃σ∈ΣyEσ, where Eσ=⋂i=1n{Vi∈Iσ(i)}, the union being disjoint since the cells are disjoint. As P(Ω0)=1 and K=K with probability 1,
Integrating out K and the cell indicators. Fix σ∈Σy and first let F be bounded. The finite family (V1,…,Vn,K) is independent with distributions ν(0,R] (n times) and the Poisson law PoiR, and φ(v,k)=F(Πn(v))1{k=n}∏i1Iσ(i)(vi) is jointly Borel (the projection (v,k)↦v is measurable from Bn+1=Bn⊗B(R) to Bn, preimages being the rectangles A×R, and products of measurable functions are measurable) and bounded, so by claim 2 of Joint Distribution, Expectations, and Block Independence for Independent Random Variables and Tonelli (integrating the last coordinate k first),
The measure with density ∏i1Iσ(i)(vi) with respect to ν(0,R]⊗n (claim 3 of Image Measures, Measures with Densities, and Change of Variables) and the measure cσνIσ(1)⊗⋯⊗νIσ(n) with cσ=∏i=1n(∣Iσ(i)∣/R) are finite measures on Bn that agree on every Borel rectangle B1×⋯×Bn (both give ∏iν(0,R](Iσ(i)∩Bi)=∏i(∣Iσ(i)∣/R)νIσ(i)(Bi) by the preliminaries and the rectangle values of product measures, Existence and Uniqueness of the Product Measure), in particular on Rn; Borel rectangles form a π-system generating Bn, so the two measures coincide by claim 1 of Uniqueness of Finite Measures on a Generating Pi-System and the Density of the Exponential Law, and integrals of nonnegative measurable functions against them agree. Hence the last integral equals cσ∫F(Πn(v))d(νIσ(1)⊗⋯⊗νIσ(n))(v). For i≤n let rσ(i) be the number of indices i′≤i with σ(i′)=σ(i), and put Wi=Urσ(i)σ(i); the map i↦(σ(i),rσ(i)) is a bijection from {1,…,n} onto {(j,i′):1≤j≤J,1≤i′≤yj}, so W1,…,Wn are distinct members of the independent family, hence independent, with distributions νIσ(i), and by claim 2 of Joint Distribution, Expectations, and Block Independence for Independent Random Variables again the last integral equals E[F(Πn(W1,…,Wn))]. Finally, reindexing the finite sum along that bijection (claim 2 of Properties of a Sum over a Finite Index Set) gives Πn(W1,…,Wn)(u)=∑i≤n1{Urσ(i)σ(i)≤u}=∑j∑i′≤yj1{Ui′j≤u}=pu(y) pointwise on Ω. Altogether, for bounded F,
E[F(p)1{C=y}]=P(K=n)(σ∈Σy∑cσ)E[F(p(y))].(3.2)
Taking F≡1 in (3.2) gives P(C=y)=P(K=n)∑σcσ, and substituting this back yields the claim for bounded F. For general F:R[0,R]→[0,∞] apply the bounded case to min(F,M), M∈N, and let M→∞ on both sides by the monotone convergence theorem.
Step 4: claim 4. Splitting the inner sum over i≤yj0+m at i=yj0 (Splitting a Finite Sum at an Index when yj0≥1; trivially when yj0=0, the first block being empty) gives the displayed identity for every ω and u. On Ω0 the points Uij0 with yj0<i≤yj0+m lie in Ij0 and all the Ui′j are pairwise distinct, by claim 1, which gives the remaining assertions. ■