alphaFeedback

WorksMathematics

Infinite divisibility of hitting times for symmetric stable processes

AI contributions
Not recorded for this paper
View details

Abstract

Let TaT_a be the first hitting time of a nonzero point aa by a symmetric strictly α\alpha-stable Lévy process, where 1<α<21<\alpha<2. We give a computer-assisted classification of its ordinary additive infinite divisibility. There is a unique threshold α∗\alpha_*, with 1.6670659903<α∗<1.66706599151.6670659903<\alpha_*<1.6670659915, such that TaT_a is infinitely divisible if and only if 1<α≤α∗1<\alpha\le\alpha_*. The threshold is characterized by a unique zero contact of the canonical inverse logarithmic-derivative kernel. The proof combines explicit analytic estimates, rigorous interval covers, Gaussian necessary conditions and Rouché's theorem. In particular, a fully analytic argument proves failure of infinite divisibility for every 15/8≤α<215/8\le\alpha<2. Scalar bounds at the two time ends reduce the compact interval computations. The finite computations and their acceptance conditions are supplied as ancillary material.

Introduction

Let X=(Xt)t≥0X=(X_t)_{t\geq0} be a symmetric strictly α\alpha-stable Lévy process, with X0=0X_0=0 and

E[eiξXt]=e−t∣ξ∣α,1<α<2.\mathbb{E}\left[e^{\mathrm{i}\xi X_t}\right]=e^{-t|\xi|^\alpha}, \qquad1<\alpha<2.

For a nonzero real number aa, let

Ta=inf⁡{t>0:Xt=a}T_a=\inf\{t>0:X_t=a\}

be its first hitting time of aa. A probability distribution is called infinitely divisible if, for every integer n≥1n\geq1, it is the distribution of a sum of nn independent identically distributed random variables. Throughout this paper the term refers to addition, and is applied to TaT_a itself.

For background on stable processes and their potential theory we refer to [1, 11]. Explicit distributional descriptions of stable hitting times are also developed in [3].

The distribution of a point-hitting time of a stable process has attracted considerable attention. Yano, Yano and Yor [9] obtained several distributional identities, including a relation with the α\alpha-Cauchy distribution. Letemplier and Simon [4] proved unimodality for the hitting times of general strictly stable processes. In [5 Proposition 4.1(b)], they also proved infinite divisibility of the logarithm of the hitting time, and conjectured, immediately after that proposition, that the hitting time itself is infinitely divisible.

For the symmetric process, this conjecture is related to a question about the random variable CαC_\alpha with density

αsin⁡(π/α)2π(1+∣x∣α),x∈R.\frac{\alpha\sin(\pi/\alpha)}{2\pi(1+|x|^\alpha)}, \qquad x\in\mathbb{R}.

Indeed, if X^\widehat{X} is an independent copy of the normalized symmetric α\alpha-stable process, then

X^Ta=d∣a∣Cα;\widehat{X}_{T_a} \mathrel{\overset{d}{=}} |a|C_\alpha;

see [9 Theorem 5.3, formula (5.12)]. Consequently, infinite divisibility of TaT_a implies infinite divisibility of CαC_\alpha by subordination. Wang [8 Theorem 1.1] proved that CαC_\alpha is infinitely divisible precisely when 1<α≤21<\alpha\le2. As explained on the second page of that paper, this result is consistent with the hitting-time conjecture. The implication used there is one-way, however, and does not settle infinite divisibility of TaT_a.

Here is our main result. The function KαK_\alpha appearing in its statement is defined canonically in Lemma 3.2 by inversion of −Lα′/Lα-L'_\alpha/L_\alpha, where Lα(q)=E[e−qT1]L_\alpha(q)=\mathbb{E}[e^{-qT_1}]. The quantitative parts of the proof use rigorous ball arithmetic; they are stated separately from the analytic lemmas.

Theorem 1.1 (Computer-assisted classification). There is a unique number α∗∈(1,2)\alpha_*\in(1,2) such that, for every a≠0a\ne0,

Ta is infinitely divisible⟺1<α≤α∗.(1)T_a\text{ is infinitely divisible}\qquad\Longleftrightarrow\qquad1<\alpha\le\alpha_*. \tag*{(1)}

More precisely,

1.6670659903<α∗<1.6670659915.(2)1.6670659903<\alpha_*<1.6670659915. \tag*{(2)}

It is the parameter coordinate of the unique solution of

Kα(t)=0,∂tKα(t)=0(3)K_\alpha(t)=0,\qquad\partial_tK_\alpha(t)=0 \tag*{(3)}

in

[1.66706598,1.667066]×[.162799,.162801].[1.66706598,1.667066]\times[.162799,.162801].

For 1<α<α∗1<\alpha<\alpha_*, Kα(t)>0K_\alpha(t)>0 for every t>0t>0. For α=α∗\alpha=\alpha_*, the kernel is nonnegative and has precisely one zero on (0,∞)(0,\infty). In the infinitely divisible range the Lévy measure of T1T_1 is Kα(t) dt/tK_\alpha(t)\,dt/t, with zero drift.

The endpoint α=2\alpha=2 is distinct: its hitting time has Laplace transform e−∣a∣qe^{-|a|\sqrt{q}} and is infinitely divisible. Thus infinite divisibility fails on a whole interval approaching 2 from the left and holds again at the Brownian endpoint. There is no contradiction with closure of infinitely divisible laws under weak limits: that closure theorem imposes no such restriction on limits of laws which are not infinitely divisible.

The proof has three parts. First, a finite large-frequency expansion constructs KαK_\alpha without presupposing infinite divisibility, and an exponential-tilting argument proves that infinite divisibility is equivalent to Kα≥0K_\alpha\ge0. Second, analytic estimates at zero and infinity, together with a finite cover by interval enclosures, prove strict positivity below a small critical parameter interval. Inside that interval a strictly convex time section has a minimum that decreases strictly through zero; positivity outside the section identifies this contact with the global boundary. Third, a negative kernel value, Gaussian necessary conditions and zeros of the Laplace transform cover the entire range above the contact. A separate analytic Rouché argument treats the whole interval [15/8,2)[15/8,2).

The finite enclosures concern whole parameter–time rectangles or whole parameter intervals, rather than samples. Appendix B specifies the certificate format, the finite acceptance conditions and the accompanying reproducibility files. The computational proof uses the guarantees of Arb/FLINT ball arithmetic and the explicit analytic truncation bounds established below. It is not a formal proof-assistant verification. No assertion about the classification of nonsymmetric stable processes is made here.

Normalization and the Laplace transform

Let X=(Xt)t≥0X=(X_t)_{t\geq0} be the symmetric strictly α\alpha-stable process starting from zero, normalized by

E[eiξXt]=e−t∣ξ∣α,ξ∈R,t≥0,(4)\mathbb{E}[e^{i\xi X_t}]=e^{-t|\xi|^\alpha},\qquad\xi\in\mathbb{R},\quad t\geq0, \tag*{(4)}

where 1<α<21<\alpha<2. For a≠0a\ne0, put

Ta=inf⁡{t>0:Xt=a},T=T1,Lα(q)=E[e−qT].T_a=\inf\{t>0:X_t=a\},\qquad T=T_1,\qquad L_\alpha(q)=\mathbb{E}[e^{-qT}].

Write β=1/α\beta=1/\alpha and θ=πα/2\theta=\pi\alpha/2. We use the principal branch for all complex powers.

Lemma 2.1. The random variable TaT_a is finite almost surely and

Ta=d∣a∣αT.(5)T_a\mathrel{\mathop=^{\mathrm{d}}}|a|^\alpha T. \tag*{(5)}

For q>0q>0, define

uq(x)=1π∫0∞cos⁡(xξ)q+ξα dξ.u_q(x)=\frac{1}{\pi}\int_0^\infty\frac{\cos(x\xi)}{q+\xi^\alpha}\,\mathrm{d}\xi.

Then

E[e−qTa]=uq(a)uq(0),uq(0)=qβ−1αsin⁡(πβ).(6)\mathbb{E}[e^{-qT_a}]=\frac{u_q(a)}{u_q(0)},\qquad u_q(0)=\frac{q^{\beta-1}}{\alpha\sin(\pi\beta)}. \tag*{(6)}

Proof. The resolvent identity is the standard hitting-time formula; in this normalization it is stated in [9], formula (5.10). The value of uq(0)u_q(0) follows by substituting ξ=qβv\xi=q^\beta v and using

∫0∞(1+vα)−1 dv=παsin⁡(π/α).\int_0^\infty(1+v^\alpha)^{-1}\,\mathrm{d}v=\frac{\pi}{\alpha\sin(\pi/\alpha)}.

Moreover,

0≤uq(0)−uq(a)≤1π∫0∞1−cos⁡(aξ)ξα dξ<∞.0\leq u_q(0)-u_q(a)\leq\frac{1}{\pi}\int_0^\infty\frac{1-\cos(a\xi)}{\xi^\alpha}\,\mathrm{d}\xi<\infty.

Since uq(0)→∞u_q(0)\to\infty as q↓0q\downarrow0, the ratio in (2.3) tends to one. This proves almost sure finiteness. Self-similarity and symmetry give (2.2); see also [9], formula (5.16). □

The normalization entails no loss of generality. If the characteristic exponent is c∣ξ∣αc|\xi|^\alpha with c>0c>0, the corresponding hitting time has law ∣a∣αT/c|a|^\alpha T/c. Multiplication by a positive constant preserves infinite divisibility in both directions.

Lemma 2.2. For Re⁡q>0\operatorname{Re}q>0,

Lα(q)=αsin⁡θsin⁡(πβ)π∫0∞e−qβrrα1+2cos⁡θ rα+r2α dr.(7)L_\alpha(q)=\frac{\alpha\sin\theta\sin(\pi\beta)}{\pi}\int_0^\infty\frac{e^{-q^\beta r}r^\alpha}{1+2\cos\theta\,r^\alpha+r^{2\alpha}}\,\mathrm{d}r. \tag*{(7)}

Proof. First suppose that q>0q>0. Rotation through the first quadrant gives

∫0∞eixq+xα dx=i∫0∞e−yq+eiθyα dy.\int_0^\infty\frac{e^{ix}}{q+x^\alpha}\,\mathrm{d}x =i\int_0^\infty\frac{e^{-y}}{q+e^{i\theta}y^\alpha}\,\mathrm{d}y.

There is no pole in this quadrant because θ<π\theta<\pi. The small arc vanishes as its radius tends to zero, and the large arc vanishes because α>1\alpha>1. Taking real parts yields

uq(1)=sin⁡θπ∫0∞e−yyαq2+2qcos⁡θ yα+y2α dy.u_q(1)=\frac{\sin\theta}{\pi}\int_0^\infty\frac{e^{-y}y^\alpha}{q^2+2q\cos\theta\,y^\alpha+y^{2\alpha}}\,\mathrm{d}y.

Substitute y=qβry=q^\beta r and divide by uq(0)u_q(0). Both sides of (2.4) are holomorphic in Re⁡q>0\operatorname{Re}q>0, so the identity extends there by analytic continuation. □

Formula (2.4) is also obtained from the independent-product representation in [4], Section 2.4 and final remark (a). The contour argument above fixes all normalizing constants directly. The formula is for the transform LαL_\alpha; it does not assert that this transform is zero-free in the right half-plane.

The canonical logarithmic-derivative kernel

Throughout the paper, powers and logarithms of complex numbers have their principal values. Put

β=α−1,δ=π(1−α/2),m=α+1,Dδ(z)=1−2cos⁡(δ)z+z2,κα=αsin⁡δsin⁡(π/α)π.(8)\beta=\alpha^{-1},\qquad\delta=\pi(1-\alpha/2),\qquad m=\alpha+1,\qquad D_\delta(z)=1-2\cos(\delta)z+z^2,\qquad\kappa_\alpha=\frac{\alpha\sin\delta\sin(\pi/\alpha)}{\pi}. \tag*{(8)}

Thus 0<δ<π/20<\delta<\pi/2. The transform obtained in Lemma 2.2 is

Lα(q)=κα∫0∞e−qβrrαDδ(rα) dr,ℜq>0.(9)L_\alpha(q)=\kappa_\alpha\int_0^\infty\frac{e^{-q\beta r}r^\alpha}{D_\delta(r^\alpha)}\,\mathrm{d}r,\qquad\Re q>0. \tag*{(9)}

References

  1. [1]J. Bertoin. Lévy Processes. Cambridge Tracts in Mathematics, vol. 121, Cambridge University Press, Cambridge, 1996.
  2. [2]F. Johansson. Arb: Efficient arbitrary-precision midpoint-radius interval arithmetic. IEEE Transactions on Computers 66 (2017), no. 8, 1281–1292. doi:10.1109/TC.2017.2690633.DOI
  3. [3]A. Kuznetsov, A. E. Kyprianou, J. C. Pardo and A. R. Watson. The hitting time of zero for a stable process. Electronic Journal of Probability 19 (2014), no. 30, 1–26. doi:10.1214/EJP.v19-2647.DOI
  4. [4]J. Letemplier and T. Simon. Unimodality of hitting times for stable processes. In Séminaire de Probabilités XLVI, Lecture Notes in Mathematics, vol. 2123, Springer, Cham, 2014, 345–357. doi:10.1007/978-3-319-11970-0_13.DOI
  5. [5]J. Letemplier and T. Simon. On the law of homogeneous stable functionals. ESAIM: Probability and Statistics 23 (2019), 82–111. doi:10.1051/ps/2018028.DOI
  6. [6]K.-i. Sato. Lévy Processes and Infinitely Divisible Distributions. Cambridge Studies in Advanced Mathematics, vol. 68, Cambridge University Press, Cambridge, 1999.
  7. [7]R. L. Schilling, R. Song and Z. Vondraček. Bernstein Functions: Theory and Applications. Second edition, De Gruyter Studies in Mathematics, vol. 37, De Gruyter, Berlin, 2012. doi:10.1515/9783110269338.DOI
  8. [8]M. Wang. Infinite divisibility of α-Cauchy distributions. Electronic Communications in Probability 31 (2026), no. 62, 1–8. doi:10.1214/26-ECP805.DOI
  9. [9]K. Yano, Y. Yano and M. Yor. On laws of the first hitting times of points for one-dimensional symmetric stable Lévy processes. In Séminaire de Probabilités XLII, Lecture Notes in Mathematics, vol. 1979, Springer, Berlin, 2009, 187–227. doi:10.1007/978-3-642-01763-6_8.DOI
  10. [10]M. Wang and S. Yin. Self-decomposability of α-Cauchy distributions. Preprint, 2026. arXiv:2609.18536v1.arxiv.org/abs/2609.18536
  11. [11]V. M. Zolotarev. One-Dimensional Stable Distributions. Translations of Mathematical Monographs, vol. 65, American Mathematical Society, Providence, RI, 1986.DOI

Paper details

vlnc:W_sh6ydcnd
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Mathematics

Not recorded for this paper · View statement →

Looking for related papers…
Contents