TheoremBase

Proof of Cell-Count Form of a Compensated Counting-Path Functional Along a Time Change: Window-Discrepancy Bounds for the Time-Change and Partial-Cell Errors

lemmalem:compensated-counting-functional-cell-count-form-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
Reason: Proof of the cell-count form of the compensated counting-path functional (P7.3).

Proof

Preliminaries on the counting path. By clauses 1 and 2 of Counting Path and Its Jump Times, pp is nondecreasing with p(0)=0p(0)=0 and takes values in {0}N\{0\}\cup\mathbb{N}, so 0p(x)p(R)0\le p(x)\le p(R) for x[0,R]x\in[0,R] and every difference p(u)p(u)(uu)|p(u')-p(u)-(u'-u)| with 0uuR0\le u\le u'\le R is at most p(R)+Rp(R)+R; hence Discw(p)\mathrm{Disc}_w(p) is a well-defined real number (the set is nonempty, containing the value for u=u=0u=u'=0). For a natural number k1k\ge1 let τk=τk(p)[0,]\tau_k=\tau_k(p)\in[0,\infty] be the kk-th jump time of that definition, the greatest lower bound of {t0:p(t)k}\{t\ge0:p(t)\ge k\}. We claim that for x0x\ge0, p(x)kp(x)\ge k if and only if xτkx\ge\tau_k. If p(x)kp(x)\ge k then xx belongs to the set whose greatest lower bound is τk\tau_k, so xτkx\ge\tau_k. Conversely, let xτkx\ge\tau_k (so τk<\tau_k<\infty). For every t>τkt>\tau_k there is, by the definition of the greatest lower bound, some t[τk,t)t'\in[\tau_k,t) with p(t)kp(t')\ge k, hence p(t)p(t)kp(t)\ge p(t')\ge k by monotonicity; by right-continuity (clause 3) p(τk)p(\tau_k) is the greatest lower bound of {p(t):t>τk}\{p(t):t>\tau_k\}, so p(τk)kp(\tau_k)\ge k, and p(x)p(τk)kp(x)\ge p(\tau_k)\ge k.

Claim 1. Let C\mathsf{C}' be measurable. For k1k\ge1 the set {u[0,s]:p(Cu)k}\{u\in[0,s]:p(\mathsf{C}'_u)\ge k\} equals {u:Cuτk}\{u:\mathsf{C}'_u\ge\tau_k\} by the preliminary claim; if τk=+\tau_k=+\infty this set is empty, and otherwise it is the preimage under the measurable map C\mathsf{C}' of the closed set [τk,)[\tau_k,\infty); in both cases it is measurable; so each indicator u1{p(Cu)k}u\mapsto\mathbf{1}\{p(\mathsf{C}'_u)\ge k\} is measurable. Since p(Cu)p(R)p(\mathsf{C}'_u)\le p(R), one has p(Cu)=k=1p(R)1{p(Cu)k}p(\mathsf{C}'_u)=\sum_{k=1}^{p(R)}\mathbf{1}\{p(\mathsf{C}'_u)\ge k\} (an integer nn with 0np(R)0\le n\le p(R) equals the number of k{1,,p(R)}k\in\{1,\dots,p(R)\} with knk\le n), a finite sum of bounded measurable indicator functions, hence bounded measurable by claims 1 and 2 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions. Then uMˉ(Cu)=p(Cu)Cuu\mapsto\bar{M}(\mathsf{C}'_u)=p(\mathsf{C}'_u)-\mathsf{C}'_u is bounded measurable (claim 2 of that lemma), and so is each component of uHuMˉ(Cu)u\mapsto H_u\bar{M}(\mathsf{C}'_u), a product of bounded measurable functions (claim 3 of the same lemma). Likewise {u:Cˉubj}=Cˉ1([bj,))\{u:\bar{\mathsf{C}}_u\ge b_j\}=\bar{\mathsf{C}}^{-1}([b_j,\infty)) is measurable, so u1{bjCˉu}Huu\mapsto\mathbf{1}\{b_j\le\bar{\mathsf{C}}_u\}H_u is bounded measurable.

For the decomposition fix x[0,R]x\in[0,R] and let jj^{-} be the largest index j{0,1,,J}j\in\{0,1,\dots,J\} with bjxb_j\le x (it exists since b0=0xb_0=0\le x). Then 1{bjx}=1\mathbf{1}\{b_j\le x\}=1 exactly for jjj\le j^{-}, and, telescoping with p(b0)=p(0)=0p(b_0)=p(0)=0 and b0=0b_0=0,

j=1J(Kjμj)1{bjx}=j=1j(p(bj)p(bj1)(bjbj1))=p(bj)bj.\sum_{j=1}^{J}(\mathsf{K}_j-\mu_j)\mathbf{1}\{b_j\le x\}=\sum_{j=1}^{j^{-}}\bigl(p(b_j)-p(b_{j-1})-(b_j-b_{j-1})\bigr)=p(b_{j^{-}})-b_{j^{-}} .

Hence Mˉ(x)j(Kjμj)1{bjx}=p(x)p(bj)(xbj)\bar{M}(x)-\sum_j(\mathsf{K}_j-\mu_j)\mathbf{1}\{b_j\le x\}=p(x)-p(b_{j^{-}})-(x-b_{j^{-}}). If j=Jj^{-}=J then x=bJ=Rx=b_J=R and this vanishes. Otherwise bjx<bj+1b_{j^{-}}\le x<b_{j^{-}+1}, so 0xbj<μj+1μmax0\le x-b_{j^{-}}<\mu_{j^{-}+1}\le\mu_{\max}, and the window [bj,x][b_{j^{-}},x] has length at most μmax\mu_{\max}; by the definition of the window discrepancy the absolute value is at most Discμmax(p)\mathrm{Disc}_{\mu_{\max}}(p).

Claim 2. Fix u[0,s]u\in[0,s] and let xxx\le x' be the two numbers Cu\mathsf{C}_u, Cˉu\bar{\mathsf{C}}_u in increasing order; then xxw1x'-x\le w_1 and Mˉ(x)Mˉ(x)=p(x)p(x)(xx)\bar{M}(x')-\bar{M}(x)=p(x')-p(x)-(x'-x), whose absolute value is at most Discw1(p)\mathrm{Disc}_{w_1}(p) by definition. Consequently

Λ(C)Λ(Cˉ)=v(Mˉ(Cs)Mˉ(Cˉs))+[0,s]Hu(Mˉ(Cu)Mˉ(Cˉu))du\Lambda(\mathsf{C})-\Lambda(\bar{\mathsf{C}})=v\bigl(\bar{M}(\mathsf{C}_s)-\bar{M}(\bar{\mathsf{C}}_s)\bigr)+\int_{[0,s]}H_u\bigl(\bar{M}(\mathsf{C}_u)-\bar{M}(\bar{\mathsf{C}}_u)\bigr)\,du

by linearity of the integral, and by the triangle inequality, Norm Bound for a Vector-Valued Lebesgue Integral over a Compact Interval and monotonicity, its norm is at most vDiscw1(p)+[0,s]HuDiscw1(p)du=(v+H1)Discw1(p)|v|\,\mathrm{Disc}_{w_1}(p)+\int_{[0,s]}|H_u|\,\mathrm{Disc}_{w_1}(p)\,du=(|v|+\lVert H\rVert_1)\,\mathrm{Disc}_{w_1}(p).

Claim 3. For x[0,R]x\in[0,R] write r(x)=Mˉ(x)j(Kjμj)1{bjx}\mathrm{r}(x)=\bar{M}(x)-\sum_{j}(\mathsf{K}_j-\mu_j)\mathbf{1}\{b_j\le x\}, so that r(x)Discμmax(p)|\mathrm{r}(x)|\le\mathrm{Disc}_{\mu_{\max}}(p) by claim 1. The map ur(Cˉu)u\mapsto\mathrm{r}(\bar{\mathsf{C}}_u) is bounded measurable, being Mˉ(Cˉu)\bar{M}(\bar{\mathsf{C}}_u) minus a finite linear combination of the measurable indicators of claim 1. Substituting Mˉ(Cˉu)=j(Kjμj)1{bjCˉu}+r(Cˉu)\bar{M}(\bar{\mathsf{C}}_u)=\sum_j(\mathsf{K}_j-\mu_j)\mathbf{1}\{b_j\le\bar{\mathsf{C}}_u\}+\mathrm{r}(\bar{\mathsf{C}}_u) into Λ(Cˉ)\Lambda(\bar{\mathsf{C}}) and using linearity of the integral for the finite sum,

Λ(Cˉ)=j=1J(Kjμj)(v1{bjCˉs}+[0,s]1{bjCˉu}Hudu)+vr(Cˉs)+[0,s]Hur(Cˉu)du,\Lambda(\bar{\mathsf{C}})=\sum_{j=1}^{J}(\mathsf{K}_j-\mu_j)\Bigl(v\,\mathbf{1}\{b_j\le\bar{\mathsf{C}}_s\}+\int_{[0,s]}\mathbf{1}\{b_j\le\bar{\mathsf{C}}_u\}H_u\,du\Bigr)+v\,\mathrm{r}(\bar{\mathsf{C}}_s)+\int_{[0,s]}H_u\,\mathrm{r}(\bar{\mathsf{C}}_u)\,du ,

and the first sum is j(Kjμj)αj\sum_j(\mathsf{K}_j-\mu_j)\alpha_j. The remaining two terms have norm at most vDiscμmax(p)+H1Discμmax(p)|v|\,\mathrm{Disc}_{\mu_{\max}}(p)+\lVert H\rVert_1\,\mathrm{Disc}_{\mu_{\max}}(p) by the same argument as in claim 2.

Claim 4. Combine claims 2 and 3 with the triangle inequality.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Comments

Loading…