TheoremBase

Proof of Law Identity between the Reconstructed Record-Frozen Aggregate and the Aggregate Recursion Driven by the Same Control Path

lemmalem:record-frozen-aggregate-copy-law-identity-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
Reason: Proof of the finite-dimensional and path-law identity between the record-frozen aggregate and the aggregate recursion, by induction on the conditioning times and a pi-system argument.

Proof

Throughout, E={1,,l}NE=\{1,\dots,l\}^N, Σ:EGN\Sigma:E\to\mathbb{G}_N and X=(Xt)t[0,T]X=(X_t)_{t\in[0,T]} are as in Forward Equation on the Aggregate Lattice for the Reconstructed Record-Frozen N-Agent Dynamics, so that Σ^tr=Σ(Xt)\hat{\Sigma}^r_t=\Sigma(X_t), and B[0,T]\mathcal{B}_{[0,T]} denotes the trace Borel σ\sigma-algebra on [0,T][0,T], with the analogous notation for other compact intervals. We use freely that two events differing only inside an event of probability zero have the same probability (claims 1 and 2 of Basic Properties of a Measure), and that the preimages of sets under a map commute with complements and countable unions, so that the family of sets whose preimage lies in a given σ\sigma-algebra is a σ\sigma-algebra; consequently a map into a generated σ\sigma-algebra is measurable as soon as the preimages of the generators are measurable.

Step 0 (The copy setting is well posed). By claim 1 of Forward Equation on the Aggregate Lattice for the Reconstructed Record-Frozen N-Agent Dynamics, ara^r is a control path with horizon TT: its values lie in A\mathcal{A} and its components are measurable with respect to B[0,T]\mathcal{B}_{[0,T]}. Hence aa^\sharp is a control path with horizon TT': the preimage under a component of aa^\sharp of a Borel set SS' of the real line is the intersection with [0,T][0,T'] of the preimage under the corresponding component of ara^r, a set of the form S[0,T]S\cap[0,T] with SS Borel, and S[0,T][0,T]=S[0,T]B[0,T]S\cap[0,T]\cap[0,T']=S\cap[0,T']\in\mathcal{B}_{[0,T']}. Thus the setting of Forward Equation for the Aggregate Recursion Driven by Independent Poisson Clocks with a Horizon with horizon TT', control path aa^\sharp, initial point x0x_0, clock horizon R>NBTR>NBT' and P(Ω0)=1P^\sharp(\Omega^\sharp_0)=1 is as required there, and its conclusions are available on [0,T][0,T']; we write qu(y,y)q^\sharp_u(y,y') (u[0,T]u\in[0,T'], yyy\neq y' in GN\mathbb{G}_N) for the rates qq of that lemma and Σtrec,(ω)\Sigma^{\mathrm{rec},\sharp}_t(\omega) for the recursion path. Moreover Σˉ0=x0\bar{\Sigma}^\sharp_0=x_0 on all of Ω\Omega^\sharp: in the aggregate recursion of Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution, θ0=0<T\theta_0=0<T' and x(0)=x0GNx^{(0)}=x_0\in\mathbb{G}_N, so the recursion does not stop at index 00, θ1>θ0\theta_1>\theta_0 by claim 1 of that theorem, and the recursion path satisfies Σ0rec,=x(0)=x0\Sigma^{\mathrm{rec},\sharp}_0=x^{(0)}=x_0; as x0GNx_0\in\mathbb{G}_N, the regularised path satisfies Σˉ0=x0\bar{\Sigma}^\sharp_0=x_0.

Step 1 (The rates agree and solutions restrict). By Forward Equation for the Aggregate Recursion Driven by Independent Poisson Clocks with a Horizon, qu(y,y)=Nyσβ(σ,γ,y,au)q^\sharp_u(y,y')=Ny^{\sigma}\beta(\sigma,\gamma,y,a^\sharp_u) if y=y+1Nvcy'=y+\frac1Nv_c with c=(σ,γ)c=(\sigma,\gamma) and qu(y,y)=0q^\sharp_u(y,y')=0 otherwise, while by Forward Equation on the Aggregate Lattice for the Reconstructed Record-Frozen N-Agent Dynamics the rates qur(y,y)q^r_u(y,y') are given by the same formula with ar(u)a^r(u) in place of aua^\sharp_u; since au=ar(u)a^\sharp_u=a^r(u) for u[0,T]u\in[0,T'], we have qu=qurq^\sharp_u=q^r_u for every u[0,T]u\in[0,T'], and both families have the rate bound l(l1)NBl(l-1)NB by those lemmas. Consequently, for F:GNRF:\mathbb{G}_N\to\mathbb{R}, the operators LuF\mathcal{L}_uF of Uniqueness for the Forward Equation of a Bounded Jump-Rate Family on a Finite Set formed with qrq^r and with qq^\sharp coincide for u[0,T]u\in[0,T']. We claim: if (νu)u[s,T](\nu_u)_{u\in[s,T]} is a solution of the forward equation on [s,T][s,T] for the rates qrq^r (horizon TT), with s<Ts<T', then (νu)u[s,T](\nu_u)_{u\in[s,T']} is a solution of the forward equation on [s,T][s,T'] for the rates qq^\sharp (horizon TT'). Indeed, property (i): the restriction to [s,T][s,T'] of a bounded B[s,T]\mathcal{B}_{[s,T]}-measurable map is bounded and B[s,T]\mathcal{B}_{[s,T']}-measurable, its preimages being the intersections with [s,T][s,T'] of the preimages of the original map, which are of the form S[s,T]S\cap[s,T] with SS Borel; property (ii): for t[s,T]t\in[s,T'] the identity required on [s,T][s,T'] is the identity of property (ii) on [s,T][s,T] at the same tt, the two integrands uνu(LuF)u\mapsto\nu_u(\mathcal{L}_uF) agreeing on [s,t][s,t] because the operators agree for uTu\le T'. Also, if (μu)u[s,T](\mu_u)_{u\in[s,T']} is a solution on [s,T][s,T'] for qq^\sharp and κ0\kappa\ge0 is a real number, then (κμu)u[s,T](\kappa\mu_u)_{u\in[s,T']} is a solution: (i) is preserved under multiplication by a constant (claim 2 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions); for (ii), (κμt)(F)=κμt(F)(\kappa\mu_t)(F)=\kappa\,\mu_t(F) and (κμu)(LuF)=κμu(LuF)(\kappa\mu_u)(\mathcal{L}_uF)=\kappa\,\mu_u(\mathcal{L}_uF) by the definition of the pairing, and [s,t]κμu(LuF)du=κ[s,t]μu(LuF)du\int_{[s,t]}\kappa\,\mu_u(\mathcal{L}_uF)\,du=\kappa\int_{[s,t]}\mu_u(\mathcal{L}_uF)\,du by claim 2 of Linearity and Monotonicity of the Lebesgue Integral, the integrand being integrable on [s,t][s,t] as noted in Uniqueness for the Forward Equation of a Bounded Jump-Rate Family on a Finite Set; so multiplying the identity of (ii) by κ\kappa gives (ii) for (κμu)(\kappa\mu_u).

Step 2 (Events of the two filtrations). For u[0,T]u\in[0,T] and yGNy\in\mathbb{G}_N, {Σ^ur=y}=xE:Σ(x)=y{Xu=x}\{\hat{\Sigma}^r_u=y\}=\bigcup_{x\in E:\,\Sigma(x)=y}\{X_u=x\}, a finite union of members of Fusys,r\mathcal{F}^{\mathrm{sys},r}_u by (D3) of claim 1 of Forward Equation on the Aggregate Lattice for the Reconstructed Record-Frozen N-Agent Dynamics; so {Σ^ur=y}Fusys,rF\{\hat{\Sigma}^r_u=y\}\in\mathcal{F}^{\mathrm{sys},r}_u\subseteq\mathcal{F}, and in particular D0F0sys,rD_0\in\mathcal{F}^{\mathrm{sys},r}_0. Likewise, for u[0,T]u\in[0,T'], {Σˉu=y}FuF\{\bar{\Sigma}^\sharp_u=y\}\in\mathfrak{F}^\sharp_u\subseteq\mathcal{F}^\sharp by (D3) of claim 1 of Forward Equation for the Aggregate Recursion Driven by Independent Poisson Clocks with a Horizon (the state space there being GN\mathbb{G}_N, not the EE of this proof). Since the two families are filtrations, events of Fusys,r\mathcal{F}^{\mathrm{sys},r}_{u} belong to Fusys,r\mathcal{F}^{\mathrm{sys},r}_{u'} for uuu\le u', and likewise for F\mathfrak{F}^\sharp.

Step 3 (Claim 1, by induction). Fix nn, times 0s1<<snT0\le s_1<\dots<s_n\le T' and points x1,,xnGNx_1,\dots,x_n\in\mathbb{G}_N; put s0=0s_0=0 and, for j{0,,n}j\in\{0,\dots,n\},

Dj=D0i=1j{Σ^sir=xi},Dj=i=1j{Σˉsi=xi}(D0=Ω).D_j=D_0\cap\bigcap_{i=1}^{j}\{\hat{\Sigma}^r_{s_i}=x_i\},\qquad D^\sharp_j=\bigcap_{i=1}^{j}\{\bar{\Sigma}^\sharp_{s_i}=x_i\}\quad(D^\sharp_0=\Omega^\sharp).

By Step 2, DjFsjsys,rD_j\in\mathcal{F}^{\mathrm{sys},r}_{s_j} and DjFsjD^\sharp_j\in\mathfrak{F}^\sharp_{s_j} (for j=0j=0 because ΩF0\Omega^\sharp\in\mathfrak{F}^\sharp_0, a σ\sigma-algebra on Ω\Omega^\sharp). We prove by induction on jj the statement

(Hj)P(Dj{Σ^ur=y})=P(D0)P(Dj{Σˉu=y})for all u[sj,T] and yGN.(H_j)\qquad P\bigl(D_j\cap\{\hat{\Sigma}^r_u=y\}\bigr)=P(D_0)\,P^\sharp\bigl(D^\sharp_j\cap\{\bar{\Sigma}^\sharp_u=y\}\bigr)\quad\text{for all }u\in[s_j,T']\text{ and }y\in\mathbb{G}_N .

Let j{0,,n}j\in\{0,\dots,n\} and assume (Hj1)(H_{j-1}) if j1j\ge1. First suppose sj=Ts_j=T' (so j1j\ge1, since s0=0<Ts_0=0<T'); then u=T=sju=T'=s_j, and Dj{Σ^sjr=y}D_j\cap\{\hat{\Sigma}^r_{s_j}=y\} equals Dj1{Σ^sjr=xj}D_{j-1}\cap\{\hat{\Sigma}^r_{s_j}=x_j\} if y=xjy=x_j and is empty otherwise, and likewise Dj{Σˉsj=y}D^\sharp_j\cap\{\bar{\Sigma}^\sharp_{s_j}=y\} equals Dj1{Σˉsj=xj}D^\sharp_{j-1}\cap\{\bar{\Sigma}^\sharp_{s_j}=x_j\} if y=xjy=x_j and is empty otherwise; so (Hj)(H_j) follows from (Hj1)(H_{j-1}) at u=sj[sj1,T]u=s_j\in[s_{j-1},T'] and y=xjy=x_j. Now suppose sj<Ts_j<T'. By claim 2 of Forward Equation on the Aggregate Lattice for the Reconstructed Record-Frozen N-Agent Dynamics with s=sj[0,T)s=s_j\in[0,T) and D=DjD=D_j, the family νu(y)=P(Dj{Σ^ur=y})\nu_u(y)=P(D_j\cap\{\hat{\Sigma}^r_u=y\}), u[sj,T]u\in[s_j,T], is a solution of the forward equation on [sj,T][s_j,T] for the rates qrq^r, hence, by Step 1, (νu)u[sj,T](\nu_u)_{u\in[s_j,T']} is a solution on [sj,T][s_j,T'] for the rates qq^\sharp. By claim 2 of Forward Equation for the Aggregate Recursion Driven by Independent Poisson Clocks with a Horizon (horizon TT') with its time rr equal to sj[0,T)s_j\in[0,T') and D=DjD=D^\sharp_j, the family μu(y)=P(Dj{Σˉu=y})\mu_u(y)=P^\sharp(D^\sharp_j\cap\{\bar{\Sigma}^\sharp_u=y\}), u[sj,T]u\in[s_j,T'], is a solution on [sj,T][s_j,T'] for qq^\sharp, and so is (P(D0)μu)u[sj,T](P(D_0)\mu_u)_{u\in[s_j,T']} by Step 1. The two solutions agree at u=sju=s_j. If j=0j=0: ν0(y)=P(D0{Σ^0r=y})\nu_0(y)=P(D_0\cap\{\hat{\Sigma}^r_0=y\}) equals P(D0)P(D_0) if y=x0y=x_0 and 00 otherwise, while μ0(y)=P(Σˉ0=y)\mu_0(y)=P^\sharp(\bar{\Sigma}^\sharp_0=y) equals 11 if y=x0y=x_0 and 00 otherwise by Step 0. If j1j\ge1: νsj(y)=P(Dj{Σ^sjr=y})\nu_{s_j}(y)=P(D_j\cap\{\hat{\Sigma}^r_{s_j}=y\}) equals P(Dj1{Σ^sjr=xj})P(D_{j-1}\cap\{\hat{\Sigma}^r_{s_j}=x_j\}) if y=xjy=x_j and 00 otherwise, which by (Hj1)(H_{j-1}) at u=sj[sj1,T]u=s_j\in[s_{j-1},T'] equals P(D0)P(Dj1{Σˉsj=xj})=P(D0)P(Dj)P(D_0)P^\sharp(D^\sharp_{j-1}\cap\{\bar{\Sigma}^\sharp_{s_j}=x_j\})=P(D_0)P^\sharp(D^\sharp_j) if y=xjy=x_j and 00 otherwise; and P(D0)μsj(y)=P(D0)P(Dj{Σˉsj=y})P(D_0)\mu_{s_j}(y)=P(D_0)P^\sharp(D^\sharp_j\cap\{\bar{\Sigma}^\sharp_{s_j}=y\}) equals P(D0)P(Dj)P(D_0)P^\sharp(D^\sharp_j) if y=xjy=x_j and 00 otherwise. Hence, by Uniqueness for the Forward Equation of a Bounded Jump-Rate Family on a Finite Set applied on the finite set GN\mathbb{G}_N with horizon TT', time sj[0,T)s_j\in[0,T'), rates qq^\sharp and rate bound l(l1)NBl(l-1)NB, νu=P(D0)μu\nu_u=P(D_0)\mu_u for every u[sj,T]u\in[s_j,T'], which is (Hj)(H_j). This completes the induction. Claim 1 is (Hn)(H_n) at u=snu=s_n and y=xny=x_n: there Dn{Σ^snr=xn}=DnD_n\cap\{\hat{\Sigma}^r_{s_n}=x_n\}=D_n and Dn{Σˉsn=xn}=DnD^\sharp_n\cap\{\bar{\Sigma}^\sharp_{s_n}=x_n\}=D^\sharp_n.

Step 4 (The maps Πr\Pi^r and Π\Pi^\sharp). Let ωΩr\omega\in\Omega^r. By (H1) of claim 1 of Forward Equation on the Aggregate Lattice for the Reconstructed Record-Frozen N-Agent Dynamics, there are a count KK and times 0<t1<<tKT0<t_1<\dots<t_K\le T such that tXt(ω)t\mapsto X_t(\omega) is constant on [0,t1)[0,t_1), on each [ti,ti+1)[t_i,t_{i+1}) and on [tK,T][t_K,T] (on [0,T][0,T] if K=0K=0); the same then holds for tΣ^tr(ω)=Σ(Xt(ω))t\mapsto\hat{\Sigma}^r_t(\omega)=\Sigma(X_t(\omega)). Let kk be the number of indices ii with tiTt_i\le T'. Then the restriction of Σ^r(ω)\hat{\Sigma}^r_\cdot(\omega) to [0,T][0,T'] is constant on [0,t1)[0,t_1) if k1k\ge1, on [ti,ti+1)[t_i,t_{i+1}) for i<ki<k, and on [tk,T][t_k,T'], since [tk,T][tk,tk+1)[t_k,T']\subseteq[t_k,t_{k+1}) when k<Kk<K and [tk,T][tK,T][t_k,T']\subseteq[t_K,T] when k=Kk=K; if k=0k=0 it is constant on [0,T][0,t1)[0,T']\subseteq[0,t_1) (or on [0,T][0,T][0,T']\subseteq[0,T] when K=0K=0). Hence Πr(ω)Path\Pi^r(\omega)\in\mathsf{Path} with the times t1,,tkt_1,\dots,t_k; for ωΩr\omega\notin\Omega^r, Πr(ω)\Pi^r(\omega) is constant, so lies in Path\mathsf{Path} with k=0k=0. For ωΩ0\omega\in\Omega^\sharp_0 the data (P(ω),a,x0)(\mathsf{P}^\sharp(\omega),a^\sharp,x_0) are conflict-free, so by claim 2 of Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution the recursion path tΣtrec,(ω)t\mapsto\Sigma^{\mathrm{rec},\sharp}_t(\omega) is an open-loop aggregate solution on [0,T][0,T']; condition 1 of that definition says precisely that it takes values in GN\mathbb{G}_N and belongs to Path\mathsf{Path}, and Σˉ(ω)=Σrec,(ω)\bar{\Sigma}^\sharp_\cdot(\omega)=\Sigma^{\mathrm{rec},\sharp}_\cdot(\omega) because the path stays in GN\mathbb{G}_N. For ωΩ0\omega\notin\Omega^\sharp_0, Π(ω)\Pi^\sharp(\omega) is constant. Thus both maps take values in Path\mathsf{Path}.

For measurability it suffices, by the remark in the preamble, to consider a generator Z={pPath:p(u)=y}Z=\{p\in\mathsf{Path}:p(u)=y\} with u[0,T]u\in[0,T'] and yGNy\in\mathbb{G}_N. We have {ΠrZ}=(Ωr{Σ^ur=y})((ΩΩr){ωΩ:x0=y})\{\Pi^r\in Z\}=(\Omega^r\cap\{\hat{\Sigma}^r_u=y\})\cup((\Omega\setminus\Omega^r)\cap\{\omega\in\Omega:x_0=y\}), the last set being ΩΩr\Omega\setminus\Omega^r if y=x0y=x_0 and empty otherwise; both pieces lie in F\mathcal{F} by Step 2 and ΩrF\Omega^r\in\mathcal{F}. Likewise {ΠZ}=(Ω0{Σˉu=y})((ΩΩ0){ωΩ:x0=y})F\{\Pi^\sharp\in Z\}=(\Omega^\sharp_0\cap\{\bar{\Sigma}^\sharp_u=y\})\cup((\Omega^\sharp\setminus\Omega^\sharp_0)\cap\{\omega\in\Omega^\sharp:x_0=y\})\in\mathcal{F}^\sharp, since Ω0F\Omega^\sharp_0\in\mathcal{F}^\sharp (claim 4 of Existence, Uniqueness, Causality, and Measurability of the Open-Loop Aggregate Solution, as recalled in Forward Equation for the Aggregate Recursion Driven by Independent Poisson Clocks with a Horizon). Hence Πr\Pi^r and Π\Pi^\sharp are measurable.

Step 5 (Cylinder sets). For k1k\ge1, times 0u1<<ukT0\le u_1<\dots<u_k\le T' and points y1,,ykGNy_1,\dots,y_k\in\mathbb{G}_N let Z(u1,,uk;y1,,yk)={pPath:p(ui)=yi for i=1,,k}Z(u_1,\dots,u_k;y_1,\dots,y_k)=\{p\in\mathsf{Path}:p(u_i)=y_i\text{ for }i=1,\dots,k\} (a cylinder set), and let Z\mathcal{Z} be the family of all cylinder sets together with the empty set. Z\mathcal{Z} is a π\pi-system: it is nonempty, and the intersection of two cylinder sets is either empty (when they prescribe different values at a common time) or the cylinder set on the increasing enumeration of the union of their two time sets with the prescribed values (which agree at common times). The generators of C\mathcal{C} are the cylinder sets with k=1k=1, so C\mathcal{C} is contained in the σ\sigma-algebra generated by Z\mathcal{Z}; conversely every cylinder set is a finite intersection of generators, so ZC\mathcal{Z}\subseteq\mathcal{C} and the σ\sigma-algebra generated by Z\mathcal{Z} is contained in C\mathcal{C} (Generated Sigma-Algebra). Hence C\mathcal{C} is the σ\sigma-algebra generated by Z\mathcal{Z}.

For a cylinder set Z=Z(u1,,uk;y1,,yk)Z=Z(u_1,\dots,u_k;y_1,\dots,y_k) we have {ΠrZ}Ωr=i=1k{Σ^uir=yi}Ωr\{\Pi^r\in Z\}\cap\Omega^r=\bigcap_{i=1}^k\{\hat{\Sigma}^r_{u_i}=y_i\}\cap\Omega^r and {ΠZ}Ω0=i=1k{Σˉui=yi}Ω0\{\Pi^\sharp\in Z\}\cap\Omega^\sharp_0=\bigcap_{i=1}^k\{\bar{\Sigma}^\sharp_{u_i}=y_i\}\cap\Omega^\sharp_0, so that, ΩΩr\Omega\setminus\Omega^r and ΩΩ0\Omega^\sharp\setminus\Omega^\sharp_0 having probability zero,

P(D0{ΠrZ})=P(D0i=1k{Σ^uir=yi})=P(D0)P(i=1k{Σˉui=yi})=P(D0)P(ΠZ),(1)P\bigl(D_0\cap\{\Pi^r\in Z\}\bigr)=P\Bigl(D_0\cap\bigcap_{i=1}^k\{\hat{\Sigma}^r_{u_i}=y_i\}\Bigr)=P(D_0)\,P^\sharp\Bigl(\bigcap_{i=1}^k\{\bar{\Sigma}^\sharp_{u_i}=y_i\}\Bigr)=P(D_0)\,P^\sharp\bigl(\Pi^\sharp\in Z\bigr),\qquad(1)

the middle equality being claim 1 with n=kn=k; (1) holds trivially for Z=Z=\emptyset.

Step 6 (Claim 2). Let P0P_0 be the measure with density 1D0\mathbf{1}_{D_0} with respect to PP on (Ω,F)(\Omega,\mathcal{F}) (claim 3 of that lemma): for AFA\in\mathcal{F}, P0(A)=Ω1A1D0dP=P(AD0)P_0(A)=\int_\Omega\mathbf{1}_A\mathbf{1}_{D_0}\,dP=P(A\cap D_0), the integrand being the nonnegative simple function 1AD0\mathbf{1}_{A\cap D_0}. Let Q=(P0)ΠrQ=(P_0)_{\Pi^r} and Q=(P)ΠQ^\sharp=(P^\sharp)_{\Pi^\sharp} be the image measures on (Path,C)(\mathsf{Path},\mathcal{C}) (claim 1 of that lemma, Πr\Pi^r and Π\Pi^\sharp being measurable by Step 4), so that Q(A)=P(D0{ΠrA})Q(A)=P(D_0\cap\{\Pi^r\in A\}) and Q(A)=P(ΠA)Q^\sharp(A)=P^\sharp(\Pi^\sharp\in A) for ACA\in\mathcal{C}, with Q(Path)=P(D0)Q(\mathsf{Path})=P(D_0) and Q(Path)=1Q^\sharp(\mathsf{Path})=1. Let Q~\tilde{Q} be the measure with density ϱP(D0)\varrho\equiv P(D_0) with respect to QQ^\sharp: Q~(A)=Path1AϱdQ=P(D0)Q(A)\tilde{Q}(A)=\int_{\mathsf{Path}}\mathbf{1}_A\,\varrho\,dQ^\sharp=P(D_0)\,Q^\sharp(A) for ACA\in\mathcal{C}, the integrand being the nonnegative simple function P(D0)1AP(D_0)\mathbf{1}_A. Then QQ and Q~\tilde{Q} are measures on C\mathcal{C} with Q(Path)=P(D0)=Q~(Path)<Q(\mathsf{Path})=P(D_0)=\tilde{Q}(\mathsf{Path})<\infty, and by (1) they agree on the π\pi-system Z\mathcal{Z}, which generates C\mathcal{C} by Step 5. By claim 1 of Uniqueness of Finite Measures on a Generating Pi-System and the Density of the Exponential Law, Q=Q~Q=\tilde{Q}, that is, P(D0{ΠrA})=P(D0)P(ΠA)P(D_0\cap\{\Pi^r\in A\})=P(D_0)P^\sharp(\Pi^\sharp\in A) for every ACA\in\mathcal{C}, the first identity of claim 2.

Finally let Φ:Path[0,]\Phi:\mathsf{Path}\to[0,\infty] be C\mathcal{C}-measurable. The compositions ΦΠr\Phi\circ\Pi^r and ΦΠ\Phi\circ\Pi^\sharp are measurable in the sense of Lebesgue Integral of a Nonnegative Measurable Function, since {ΦΠr>α}={Πr{Φ>α}}\{\Phi\circ\Pi^r>\alpha\}=\{\Pi^r\in\{\Phi>\alpha\}\} and {Φ>α}C\{\Phi>\alpha\}\in\mathcal{C} for every real α\alpha, and likewise for Π\Pi^\sharp. Using successively claim 3 of Image Measures, Measures with Densities, and Change of Variables for P0P_0, claim 2 of that lemma for QQ, the identity Q=Q~Q=\tilde{Q}, claim 3 of that lemma for Q~\tilde{Q}, claim 1 of Linearity and Monotonicity of the Lebesgue Integral with the constant P(D0)[0,)P(D_0)\in[0,\infty), and claim 2 of Image Measures, Measures with Densities, and Change of Variables for QQ^\sharp,

Ω1D0Φ(Πr)dP=ΩΦΠrdP0=PathΦdQ=PathΦdQ~=PathΦϱdQ=P(D0)PathΦdQ=P(D0)ΩΦΠdP,\int_\Omega\mathbf{1}_{D_0}\,\Phi(\Pi^r)\,dP=\int_\Omega\Phi\circ\Pi^r\,dP_0=\int_{\mathsf{Path}}\Phi\,dQ=\int_{\mathsf{Path}}\Phi\,d\tilde{Q}=\int_{\mathsf{Path}}\Phi\,\varrho\,dQ^\sharp=P(D_0)\int_{\mathsf{Path}}\Phi\,dQ^\sharp=P(D_0)\int_{\Omega^\sharp}\Phi\circ\Pi^\sharp\,dP^\sharp ,

which is the second identity of claim 2.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Comments

Loading…