On Arratia's coupling and the Dirichlet law for the factors of a random integer

TL;DR

This paper constructs a coupling between a uniformly random integer's prime factorization and a Poisson-Dirichlet process, proving a conjecture and providing a probabilistic proof of the Dirichlet law with improved error bounds.

Contribution

It establishes a coupling matching prime factors with Poisson-Dirichlet variables, confirming Arratia's 2002 conjecture and refining the probabilistic proof of the Dirichlet law for integer factorizations.

Findings

Existence of a coupling with expected log difference bounded by a constant

Confirmation of Arratia's conjecture from 2002

Improved error term in the probabilistic proof of the Dirichlet law

Abstract

Let $x \ge 2$, let $N_x$ be an integer chosen uniformly at random from the set $\mathbb Z \cap [1, x]$, and let $(V_1, V_2, \ldots)$ be a Poisson--Dirichlet process of parameter $1$. We prove that there exists a coupling of these two random objects such that $$ \mathbb E \, \sum_{i \ge 1} |\log P_i- V_i\log x| \asymp 1, $$ where the implied constants are absolute and $N_x = P_1P_2 \cdots$ is the unique factorization of $N_x$ into primes or ones with the $P_i$'s being non-increasing. This establishes a 2002 conjecture of Arratia arXiv:1305.0941 who constructed a coupling for which the left-hand side in the above estimate is $\ll \log\!\log x$, and who also proved that the left-hand side is $\ge 1-o(1)$ for all couplings. In addition, we use our refined coupling to give a probabilistic proof of the Dirichlet law for the average distribution of the integer factorization into $k$ parts proved in 2023 by Leung arXiv:2206.14728 and we improve on its error term.