The relative entropy of primes in arithmetic progressions is really small

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Cowan, Alex
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910921788489728
author Cowan, Alex
author_facet Cowan, Alex
contents Fix a modulus $q$. One would expect the number of primes in each invertible residue class mod $q$ to be multinomially distributed, i.e. for each $p \,\mathrm{mod}\, q$ to behave like an independent random variable uniform on $(\mathbb{Z}/q\mathbb{Z})^\times$. Using techniques from data science, we discover overwhelming evidence to the contrary: primes are much more uniformly distributed than iid uniform random variables. This phenomenon was previously unknown, and there is no clear theoretical explanation for it. To demonstrate that our test statistic of choice, the KL divergence, is indeed extreme, we prove new bounds for the left tail of the relative entropy of the uniform multinomial using the method of types.
format Preprint
id arxiv_https___arxiv_org_abs_2504_20691
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle The relative entropy of primes in arithmetic progressions is really small
Cowan, Alex
Number Theory
Information Theory
Probability
Statistics Theory
Fix a modulus $q$. One would expect the number of primes in each invertible residue class mod $q$ to be multinomially distributed, i.e. for each $p \,\mathrm{mod}\, q$ to behave like an independent random variable uniform on $(\mathbb{Z}/q\mathbb{Z})^\times$. Using techniques from data science, we discover overwhelming evidence to the contrary: primes are much more uniformly distributed than iid uniform random variables. This phenomenon was previously unknown, and there is no clear theoretical explanation for it. To demonstrate that our test statistic of choice, the KL divergence, is indeed extreme, we prove new bounds for the left tail of the relative entropy of the uniform multinomial using the method of types.
title The relative entropy of primes in arithmetic progressions is really small
topic Number Theory
Information Theory
Probability
Statistics Theory
url https://arxiv.org/abs/2504.20691