How many digits are needed?
Abstract
Let X1,X2,... be the digits in the base-q expansion of a random variable X defined on [0,1) where q2 is an integer. For n=1,2,..., we study the probability distribution Pn of the (scaled) remainder Tn(X)=Σk=n+1∞ Xk qn-k: If X has an absolutely continuous CDF then Pn converges in the total variation metric to the Lebesgue measure μ on the unit interval. Under weak smoothness conditions we establish first a coupling between X and a non-negative integer valued random variable N so that TN(X) follows μ and is independent of (X1,...,XN), and second exponentially fast convergence of Pn and its PDF fn. We discuss how many digits are needed and show examples of our results. The convergence results are extended to the case of a multivariate random variable defined on a unit cube.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.