TheoremBase

Moment Toolkit for the Synthetic Copy: Square-Integrable Majorants of the Window Discrepancies of the Copy Clocks and the Fourth Moment of a Weighted Centred Cell-Count Sum

Statement

Adopt the setting and notation of The Synthetic Copy: Independent Cell Structure, Deterministic-Count Clocks, the Copy Measure, and the Smoothed Joint Density of Parameter and Observation Record (as also adopted by The Copy Clocks Have Independent Poisson Increments on the Clock Interval: Law Identity with the Uniform Poisson Path and Applicability of the Window Discrepancy Bound): the probability space (Ω,F,P)(\Omega,\mathcal{F},P) with expectation E\mathbb{E}, the natural numbers N≥1N\ge1, l≥2l\ge2, m≥1m\ge1, l~≥1\tilde{l}\ge1, the real numbers B≥0B\ge0, T>0T>0 and R>0R>0 with R≥NBTR\ge NBT, the transition labels cc, the cells Ic,j=(bj−1c,bjc]I_{c,j}=(b^{c}_{j-1},b^{c}_j] (1≤j≤Jc1\le j\le J_c) of lengths ∣Ic,j∣|I_{c,j}|, indexed by the finite set L\mathsf{L} of pairs q=(c,j)q=(c,j) with dd elements and identified with {1,…,d}\{1,\dots,d\} by the fixed bijection, so that points of Euclidean space Rd\mathbb{R}^d have coordinates indexed by L\mathsf{L}; the cell-count vector K=(Kq)q∈L\mathsf{K}=(\mathsf{K}_q)_{q\in\mathsf{L}}; and the copy clocks P♯=(P♯,c)c\mathsf{P}^{\sharp}=(\mathsf{P}^{\sharp,c})_c, all of whose paths u↦Pu♯,c(ω)u\mapsto\mathsf{P}^{\sharp,c}_u(\omega) are counting paths. Recall N0=N∪{0}\mathbb{N}_0=\mathbb{N}\cup\{0\} from the adopted setting, and write μq=∣Ic,j∣>0\mu_q=|I_{c,j}|>0 for q=(c,j)q=(c,j), μ=(μq)q∈L∈Rd\mu=(\mu_q)_{q\in\mathsf{L}}\in\mathbb{R}^d (the vector of cell lengths; unrelated to the copy measure μ♯\mu^{\sharp}, which is not used here) and μmax⁡=max⁡q∈Lμq\mu_{\max}=\max_{q\in\mathsf{L}}\mu_q. Adopt from Cell-Count Form of a Compensated Counting-Path Functional Along a Time Change: Window-Discrepancy Bounds for the Time-Change and Partial-Cell Errors, for a counting path pp and a real number w≥0w\ge0, the 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 bounded above by p(R)+Rp(R)+R, formed with the present RR; and from Series Formula, Exponential Moments, and Chernoff Tail Bounds for the Poisson Distribution the Chernoff exponent ϖk(x)=min⁡(x24k,x2)\varpi_{k}(x)=\min\bigl(\tfrac{x^{2}}{4k},\tfrac{x}{2}\bigr) (k>0k>0, x>0x>0), as used in Uniform Window Discrepancy Bound for a Counting Process with Poisson Increments on the Integer Grid (the letter ϖ\varpi denotes here this exponent only, never the profile of the copy setting). Write exp⁡\exp for the exponential function, x⋅yx\cdot y for the dot product, t1/2=tt^{1/2}=\sqrt{t} for the nonnegative square root of a real t≥0t\ge0, t1/4=(t1/2)1/2t^{1/4}=(t^{1/2})^{1/2}, 1A\mathbf{1}_A for the indicator of an event AA (claim 1 of Arithmetic, Absolute Values, and Pointwise Limits of Measurable Real-Valued Functions), ⌈w⌉\lceil w\rceil for the least natural number that is ≥w\ge w for a real w≥0w\ge0 (it exists by The Archimedean Property of the Real Numbers and The Natural Numbers Are Well Ordered, and satisfies ⌈w⌉≥1\lceil w\rceil\ge1 since 11 is the least natural number), and F\mathcal{F}-measurable for a real-valued map on Ω\Omega that is measurable with respect to F\mathcal{F} and the Borel σ\sigma-algebra of the real line. Integrable, square-integrable and the mean-square norm ∥X∥2=(E[X2])1/2\lVert X\rVert_2=(\mathbb{E}[X^{2}])^{1/2} on (Ω,F,P)(\Omega,\mathcal{F},P) are as in those definitions. The function w↦⌈w⌉w\mapsto\lceil w\rceil agrees with the usual ceiling except at w=0w=0, where it equals 11. Put

M4(R)=(8 (4096+17R4))1/4.\mathsf{M}_4(R)=\bigl(8\,(4096+17R^{4})\bigr)^{1/4}.

1. (Square-integrable majorant of one window discrepancy.) Assume that RR is a natural number. Let cc be a transition label, let w≥0w\ge0 and x>0x>0 be real numbers, and put n=⌈w⌉\mathsf{n}=\lceil w\rceil. Then there is an event Gw,xc∈FG^{c}_{w,x}\in\mathcal{F} with

P(Ω∖Gw,xc)≤2 (R+1)(n+3)exp⁡(−ϖn+2(x))P\bigl(\Omega\setminus G^{c}_{w,x}\bigr)\le2\,(R+1)(\mathsf{n}+3)\exp\bigl(-\varpi_{\mathsf{n}+2}(x)\bigr)

such that the map

Ξw,xc=(x+2) 1Gw,xc+(PR♯,c+R)1Ω∖Gw,xc:Ω→[0,∞)\Xi^{c}_{w,x}=(x+2)\,\mathbf{1}_{G^{c}_{w,x}}+\bigl(\mathsf{P}^{\sharp,c}_R+R\bigr)\mathbf{1}_{\Omega\setminus G^{c}_{w,x}}:\Omega\to[0,\infty)

is F\mathcal{F}-measurable and square-integrable, satisfies Discw(P♯,c(ω))≤Ξw,xc(ω)\mathrm{Disc}_{w}\bigl(\mathsf{P}^{\sharp,c}(\omega)\bigr)\le\Xi^{c}_{w,x}(\omega) for every ω∈Ω\omega\in\Omega (where P♯,c(ω)\mathsf{P}^{\sharp,c}(\omega) is the counting path u↦Pu♯,c(ω)u\mapsto\mathsf{P}^{\sharp,c}_u(\omega)), and

∥Ξw,xc∥2≤x+2+M4(R) (2 (R+1)(n+3)exp⁡(−ϖn+2(x)))1/4.\bigl\lVert\Xi^{c}_{w,x}\bigr\rVert_2\le x+2+\mathsf{M}_4(R)\,\Bigl(2\,(R+1)(\mathsf{n}+3)\exp\bigl(-\varpi_{\mathsf{n}+2}(x)\bigr)\Bigr)^{1/4}.

Moreover PR♯,c\mathsf{P}^{\sharp,c}_R has the Poisson distribution with parameter RR, and E[(PR♯,c+R)4]≤M4(R)4\mathbb{E}\bigl[(\mathsf{P}^{\sharp,c}_R+R)^{4}\bigr]\le\mathsf{M}_4(R)^{4}.

2. (Majorant of a sum of two window discrepancies.) Assume that RR is a natural number, let w1≥0w_1\ge0, w2≥0w_2\ge0, x1>0x_1>0 and x2>0x_2>0 be real numbers, and for every transition label cc and i∈{1,2}i\in\{1,2\} let Gwi,xicG^{c}_{w_i,x_i} be an event as furnished by claim 1 (for the data cc, wiw_i, xix_i) and Ξwi,xic\Xi^{c}_{w_i,x_i} the corresponding map; put Ξc=Ξw1,x1c+Ξw2,x2c\Xi^{c}=\Xi^{c}_{w_1,x_1}+\Xi^{c}_{w_2,x_2}. Then, for every such choice, each Ξc:Ω→[0,∞)\Xi^{c}:\Omega\to[0,\infty) is F\mathcal{F}-measurable and square-integrable, Discw1(P♯,c(ω))+Discw2(P♯,c(ω))≤Ξc(ω)\mathrm{Disc}_{w_1}(\mathsf{P}^{\sharp,c}(\omega))+\mathrm{Disc}_{w_2}(\mathsf{P}^{\sharp,c}(\omega))\le\Xi^{c}(\omega) for every ω∈Ω\omega\in\Omega, and

∥Ξc∥2≤x1+x2+4+M4(R)∑i=12(2 (R+1)(⌈wi⌉+3)exp⁡(−ϖ⌈wi⌉+2(xi)))1/4.\lVert\Xi^{c}\rVert_2\le x_1+x_2+4+\mathsf{M}_4(R)\sum_{i=1}^{2}\Bigl(2\,(R+1)(\lceil w_i\rceil+3)\exp\bigl(-\varpi_{\lceil w_i\rceil+2}(x_i)\bigr)\Bigr)^{1/4}.

Consequently, in any instance of the setting and of the hypotheses other than (DM) of Mean-Square Assembly of the Estimand Linearisation on the Synthetic Copy: Approximation of the Recentred Copy Endpoint by an Affine Function of the Parameter whose probability space, copy clocks, clock horizon RR (a natural number), cells and bijection of L\mathsf{L} with {1,…,d}\{1,\dots,d\} are the present ones, hypothesis (DM) of that lemma holds for the family (Ξc)c(\Xi^{c})_{c} formed with w1=wclkw_1=\mathsf{w}^{\mathrm{clk}} (the clock tolerance of that lemma, a real number ≥0\ge0) and w2=μmax⁡w_2=\mu_{\max}, whatever the event GG of that instance.

3. (Second and fourth moments of a weighted centred cell-count sum.) The cell counts Kq\mathsf{K}_q (q∈Lq\in\mathsf{L}) are independent, and Kq\mathsf{K}_q has the Poisson distribution with parameter μq\mu_q. For every α=(αq)q∈L∈Rd\alpha=(\alpha_q)_{q\in\mathsf{L}}\in\mathbb{R}^d the random variable α⋅(K−μ)=∑q∈Lαq(Kq−μq)\alpha\cdot(\mathsf{K}-\mu)=\sum_{q\in\mathsf{L}}\alpha_q(\mathsf{K}_q-\mu_q) has an integrable fourth power, and

E[α⋅(K−μ)]=0,E[(α⋅(K−μ))2]=∑q∈Lαq2μq,E[(α⋅(K−μ))4]≤3(∑q∈Lαq2μq)2+∑q∈Lαq4μq.\mathbb{E}\bigl[\alpha\cdot(\mathsf{K}-\mu)\bigr]=0,\qquad \mathbb{E}\bigl[(\alpha\cdot(\mathsf{K}-\mu))^{2}\bigr]=\sum_{q\in\mathsf{L}}\alpha_q^{2}\mu_q,\qquad \mathbb{E}\bigl[(\alpha\cdot(\mathsf{K}-\mu))^{4}\bigr]\le3\Bigl(\sum_{q\in\mathsf{L}}\alpha_q^{2}\mu_q\Bigr)^{2}+\sum_{q\in\mathsf{L}}\alpha_q^{4}\mu_q .

Consequently, in any instance of the setting and of the hypotheses other than (FM) and (DM) of Mean-Square Assembly of the Estimand Linearisation on the Synthetic Copy: Approximation of the Recentred Copy Endpoint by an Affine Function of the Parameter whose probability space, cell-count vector, cells and bijection of L\mathsf{L} with {1,…,d}\{1,\dots,d\} are the present ones, the quantity k4\mathsf{k}_4 of that lemma satisfies k44≤3(∑qαq2μq)2+∑qαq4μq\mathsf{k}_4^{4}\le3(\sum_q\alpha_q^{2}\mu_q)^{2}+\sum_q\alpha_q^{4}\mu_q for its vector α∈Rd\alpha\in\mathbb{R}^d of cell coefficients.

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…