Search arXivSearch

arXiv · 2505.02165

Strongly compatible systems associated to semistable abelian varieties

Abstract

We prove a motivic refinement of a result of Weil, Deligne and Raynaud on the existence of strongly compatible systems associated to abelian varieties. More precisely, given an abelian variety $A$ over a number field $\mathrm{E}\subset \mathbb C$, we prove that after replacing $\mathbb E$ by a finite extension, the action of $\mathrm{Gal}(\overline{\mathrm E}/\mathrm E)$ on the $\ell$-adic cohomology $\mathrm H^1_{\mathrm{\acute{e}t}}(A_{\overline{\mathrm E}},\mathbb Q_\ell)$ gives rise to a strongly compatible system of $\ell$-adic representations valued in the Mumford--Tate group $\mathbf G$ of $A$. This involves an independence of $\ell$-statement for the Weil--Deligne representation associated to $A$ at places of semistable reduction, extending previous work of ours at places of good reduction.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mark Kisin, Rong Zhou. 2025-05-04. Strongly compatible systems associated to semistable abelian varieties. https://arxiv.org/abs/2505.02165

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

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT