Denseness in total variation and the class of rational-infinitely divisible distributions
Alexey Khartov
TL;DR
This work investigates the denseness in total variation of the class $\boldsymbol{Q}$ of rational-infinitely divisible distributions, a broad extension of infinite divisibility realized as ratios of characteristic functions with a Lévy–Khinchine type form and signed spectral measures. It provides constructive positive results showing total-variation denseness for absolutely continuous and discrete lattice distributions (and their mixtures), using a key lemma that ensures nonvanishing of certain convex combinations of characteristic functions and convolution with simple perturbation distributions. Conversely, it establishes negative results for discrete non-lattice and, in fact, for the full class $\boldsymbol{Q}$, demonstrating that total variation density fails in these cases via carefully designed counterexamples and zero-avoidance arguments. Overall, the paper delineates when quasi-infinitely divisible laws can approximate targets in the stronger total-variation metric, clarifying both the capabilities and limits of $\boldsymbol{Q}$ in strong probabilistic topologies.
Abstract
We study a new class of so-called rational-infinitely (or quasi-infinitely) divisible probability laws on the real line. The characteristic functions of these distributions are ratios of the characteristic functions of classical infinitely divisible laws and they admit Lévy--Khinchine type representations with ``signed spectral measures''. This class is rather wide and it has a lot of nice properties. For instance, this class is dense in the family of all (univariate) probability laws with respect to weak convergence. In this paper, we consider the questions concerning a denseness of this class with respect to convergence in total variation. The problem is considered separately for different types of probability laws taking into account the supports of the distributions. A series of ``positive'' and ``negative'' results are obtained.
