TheoremBase

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

Statement

Let R>0R>0 and s>0s>0 be real numbers, let J≥1J\ge1 and l≥1l\ge1 be natural numbers, and let 0=b0<b1<⋯<bJ=R0=b_0<b_1<\dots<b_J=R be real numbers (the cell boundaries), with cell lengths μj=bj−bj−1\mu_j=b_j-b_{j-1} (1≤j≤J1\le j\le J) and μmax⁡=max⁡1≤j≤Jμj\mu_{\max}=\max_{1\le j\le J}\mu_j. Let pp be a counting path. Define its cell counts Kj=p(bj)−p(bj−1)\mathsf{K}_j=p(b_j)-p(b_{j-1}) (1≤j≤J1\le j\le J), its compensated path Mˉ(x)=p(x)−x\bar{M}(x)=p(x)-x (x∈[0,R]x\in[0,R]), and, for a real number w≥0w\ge0, its window discrepancy

Discw(p)=sup⁡{∣p(u′)−p(u)−(u′−u)∣: 0≤u≤u′≤R, u′−u≤w},\mathrm{Disc}_w(p)=\sup\bigl\{|p(u')-p(u)-(u'-u)|:\ 0\le u\le u'\le R,\ u'-u\le w\bigr\},

the least upper bound of a nonempty set of real numbers bounded above by p(R)+Rp(R)+R (the number RR is fixed throughout and suppressed from the notation).

A map from [0,s][0,s] into R\mathbb{R} or into Euclidean space Rl\mathbb{R}^l is measurable when its components are measurable with respect to the trace Borel σ\sigma-algebra on [0,s][0,s] and the Borel σ\sigma-algebra of the real line, and bounded measurable when moreover its components are bounded; ∫[0,s]⋅ du\int_{[0,s]}\cdot\,du is the componentwise Lebesgue integral over the compact interval [0,s][0,s], ∣⋅∣|\cdot| the Euclidean norm, and 1{P}\mathbf{1}\{P\} equals 11 if the condition PP holds and 00 otherwise.

Let w1≥0w_1\ge0 be a real number and let C,Cˉ:[0,s]→[0,R]\mathsf{C},\bar{\mathsf{C}}:[0,s]\to[0,R] be measurable maps with ∣Cu−Cˉu∣≤w1|\mathsf{C}_u-\bar{\mathsf{C}}_u|\le w_1 for every u∈[0,s]u\in[0,s]. Let v∈Rlv\in\mathbb{R}^l and let H:[0,s]→RlH:[0,s]\to\mathbb{R}^l be bounded measurable; put ∥H∥1=∫[0,s]∣Hu∣ du\lVert H\rVert_1=\int_{[0,s]}|H_u|\,du, the integrand being bounded measurable by Norm Bound for a Vector-Valued Lebesgue Integral over a Compact Interval. Products of a real number with a point of Rl\mathbb{R}^l are scalar multiples. For a measurable C′:[0,s]→[0,R]\mathsf{C}':[0,s]\to[0,R] define the compensated functional

Λ(C′)=v Mˉ(Cs′)+∫[0,s]Hu Mˉ(Cu′) du∈Rl\Lambda(\mathsf{C}')=v\,\bar{M}(\mathsf{C}'_s)+\int_{[0,s]}H_u\,\bar{M}(\mathsf{C}'_u)\,du\in\mathbb{R}^l

(defined by claim 1), and define the cell coefficients

αj=v 1{bj≤Cˉs}+∫[0,s]1{bj≤Cˉu} Hu du∈Rl(1≤j≤J).\alpha_j=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\in\mathbb{R}^l\qquad(1\le j\le J).

1. (Measurability and the partial-cell decomposition.) For every measurable C′:[0,s]→[0,R]\mathsf{C}':[0,s]\to[0,R] the map u↦p(Cu′)u\mapsto p(\mathsf{C}'_u) is bounded measurable, so that u↦HuMˉ(Cu′)u\mapsto H_u\bar{M}(\mathsf{C}'_u) is bounded measurable and Λ(C′)\Lambda(\mathsf{C}') is defined; the maps u↦1{bj≤Cˉu}Huu\mapsto\mathbf{1}\{b_j\le\bar{\mathsf{C}}_u\}H_u are bounded measurable, so that the αj\alpha_j are defined. Moreover, for every x∈[0,R]x\in[0,R],

∣Mˉ(x)−∑j=1J(Kj−μj) 1{bj≤x}∣≤Discμmax⁡(p).\Bigl|\bar{M}(x)-\sum_{j=1}^{J}(\mathsf{K}_j-\mu_j)\,\mathbf{1}\{b_j\le x\}\Bigr|\le\mathrm{Disc}_{\mu_{\max}}(p).

2. (Time-change error.) For every u∈[0,s]u\in[0,s], ∣Mˉ(Cu)−Mˉ(Cˉu)∣≤Discw1(p)|\bar{M}(\mathsf{C}_u)-\bar{M}(\bar{\mathsf{C}}_u)|\le\mathrm{Disc}_{w_1}(p), and

∣Λ(C)−Λ(Cˉ)∣≤(∣v∣+∥H∥1) Discw1(p).|\Lambda(\mathsf{C})-\Lambda(\bar{\mathsf{C}})|\le\bigl(|v|+\lVert H\rVert_1\bigr)\,\mathrm{Disc}_{w_1}(p).

3. (Cell-count form.)

∣Λ(Cˉ)−∑j=1J(Kj−μj) αj∣≤(∣v∣+∥H∥1) Discμmax⁡(p).\Bigl|\Lambda(\bar{\mathsf{C}})-\sum_{j=1}^{J}(\mathsf{K}_j-\mu_j)\,\alpha_j\Bigr|\le\bigl(|v|+\lVert H\rVert_1\bigr)\,\mathrm{Disc}_{\mu_{\max}}(p).

4. (Combined bound.)

∣Λ(C)−∑j=1J(Kj−μj) αj∣≤(∣v∣+∥H∥1)(Discw1(p)+Discμmax⁡(p)).\Bigl|\Lambda(\mathsf{C})-\sum_{j=1}^{J}(\mathsf{K}_j-\mu_j)\,\alpha_j\Bigr|\le\bigl(|v|+\lVert H\rVert_1\bigr)\bigl(\mathrm{Disc}_{w_1}(p)+\mathrm{Disc}_{\mu_{\max}}(p)\bigr).

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…