English

The distribution of the cokernel of a polynomial evaluated at a random integral matrix

Number Theory 2023-10-24 v3 Combinatorics Probability

Abstract

Given a prime pp, let P(t)P(t) be a non-constant monic polynomial in tt over the ring Zp\mathbb{Z}_{p} of pp-adic integers. Let XnX_{n} be an n×nn \times n random matrix over Zp\mathbb{Z}_{p} with independent entries that lie in any residue class modulo pp with probability at most 1ϵ1 - \epsilon for a fixed real number 0<ϵ<10 < \epsilon < 1. We prove that as nn \rightarrow \infty, the distribution of the cokernel cok(P(Xn))\mathrm{cok}(P(X_{n})) of P(Xn)P(X_{n}) converges to the distribution given by a finite product of some explicit measures that resemble Cohen--Lenstra measures. For example, the random matrix XnX_{n} can be taken as a Haar-random matrix or a uniformly random (0,1)(0,1)-matrix. We consider the distribution of cok(P(Xn))\mathrm{cok}(P(X_{n})) as a distribution of modules over Zp[t]/(P(t))\mathbb{Z}_{p}[t]/(P(t)), which gives us a clearer formulation in comparison to considering the distribution as that of abelian groups. For the proof, we first reduce our problem into a problem over Z/pkZ\mathbb{Z}/p^{k}\mathbb{Z}, for large enough positive integer kk, in place of Zp\mathbb{Z}_{p}. Then we use a result of Sawin and Wood to reduce our problem into another problem of computing the limit of the expected number of surjective (Z/pkZ)[t]/(P(t))(\mathbb{Z}/p^{k}\mathbb{Z})[t]/(P(t))-linear maps from cok(P(Xn))\mathrm{cok}(P(X_{n})) modulo pkp^{k} to a fixed finite size (Z/pkZ)[t]/(P(t))(\mathbb{Z}/p^{k}\mathbb{Z})[t]/(P(t))-module GG. To estimate the expected number and compute the desired limit, we carefully adopt subtle techniques developed by Wood, which were originally used to compute the asymptotic distribution of the pp-part of the sandpile group of a random graph.

Keywords

Cite

@article{arxiv.2303.09125,
  title  = {The distribution of the cokernel of a polynomial evaluated at a random integral matrix},
  author = {Gilyoung Cheong and Myungjun Yu},
  journal= {arXiv preprint arXiv:2303.09125},
  year   = {2023}
}

Comments

22 pages. Proof of Lemma 5.5 had a subtle error, so we had to make various changes to correct the proof. We made changes to Sections 3.2, 5.3, and 6.2 for definitions of codes and depth; 3.2 has new technique: it explains how to throw away F's that do not contribute to the moment computation. Proof of Lemmas 6.6 and 6.8 have been changed