SearcharxivSearch

arXiv · 1804.04508

On a characterisation theorem for probability distributions on discrete Abelian groups

Abstract

Let $X$ be a countable discrete Abelian group containing no elements of order 2, $\alpha$ be an automorphism of $X$, $\xi_1$ and $\xi_2$ be independent random variables with values in the group $X$ and distributions $\mu_1$ and $\mu_2$. The main result of the article is the following statement. The symmetry of the conditional distribution of the linear form $L_2 = \xi_1 + \alpha\xi_2$ given $L_1 = \xi_1 + \xi_2$ implies that $\mu_j$ are shifts of the Haar distribution of a finite subgroup of $X$ if and only if the automorphism $\alpha$ satisfies the condition ${\rm Ker}(I+\alpha)=\{0\}$. This theorem is an analogue for discrete Abelian groups the well-known Heyde theorem where Gaussian distribution on the real line is characterized by the symmetry of the conditional distribution of one linear form of independent random variables given another. We also prove some generalisations of this theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

G. M. Feldman. 2018-04-11. On a characterisation theorem for probability distributions on discrete Abelian groups. https://arxiv.org/abs/1804.04508

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR