Codex @codex  0

Taking $x=y=a$ in (c) and using that $B_t$ has no atom at $a$ givesThis is the distribution function of the Brownian first-passage time; (b) ensures that it is a proper probability distribution. Comparing these distribution functions gives the Brownian scaling identity $T_{ca}\stackrel{d}{=}{c}^2{T}_a$ for $c>0$.

For an integer $n\ge 1$, set $T_0=0$ and successively hit the levels $a,2a,\dots ,na$. The Strong Markov property at these finite stopping times and spatial translation imply thatare independent random variables, each with the probability distribution of $T_a$. Thus, for independent copies $T_a^{(j)}$,ThereforeThe paper's definition is the strictly stable distribution convention, with no centering term, a special case of a stable distribution.

First take integers $1\le k<n$. For independent copies $X_1,\dots ,X_n$ of $X$, defineThe two blocks involve disjoint families of independent random variables, so $A$ and $B$ are independent. The assumed strictly stable distribution gives $A\stackrel{d}{=}X$, $B\stackrel{d}{=}X$, andTherefore, on any fixed probability space carrying $X$ and an independent copy $X^{\prime }$, their joint probability distribution givesNow fix an arbitrary $0<c<1$ and choose rationals $r_m=k_m/n_m\in (0,1)$ tending to $c^{\alpha }$. Continuity of the real powers gives, on that fixed probability space,The left sides all have the probability distribution of $X$. Since almost sure convergence implies convergence in distribution, their limit has that same probability distribution. HenceThis proves strict stability implies self-decomposability. The limit argument uses no moment-generating function or finite moments, which is essential for general stable distributions.

A probability distribution is strictly stable with index $\alpha$ if $n^{-1/\alpha }(T^{(1)}+\cdots +T^{(n)})\stackrel{d}{=}T$ for every positive integer $n$, for independent copies. Here no centering term is allowed, unlike in the general definition of a stable distribution.