Search arXivSearch

arXiv · 2503.19226

On the Bloch-Kato conjecture for some four-dimensional symplectic Galois representations

Abstract

The Bloch-Kato conjecture predicts a far-reaching connection between orders of vanishing of $L$-functions and the ranks of Selmer groups of $p$-adic Galois representations. In this article, we consider the four-dimensional, symplectic Galois representations arising from automorphic representations $π$ of $\mathrm{GSp}_4(\mathbb A_{\mathbb Q})$ with trivial central character and with the lowest cohomological archimedean weight. Under mild technical conditions, we prove that the Selmer group vanishes when the central value $L(π,\mathrm{spin},1/2)$ is nonzero. In the spirit of bipartite Euler systems, we bound the Selmer group by using level-raising congruences to construct ramified Galois cohomology classes. The relation to $L$-values comes via the $\mathrm{GSpin}_3\hookrightarrow \mathrm{GSpin}_5$ periods on a compact inner form of $\mathrm{GSp}_4$. We also prove a result towards the rank-one case: if the $π$-isotypic part of the Abel-Jacobi image of any of Kudla's one-cycles on the Siegel threefold is nonzero, it generates the full Selmer group. These cycles are linear combinations of embedded quaternionic Shimura curves, and under the conjectural arithmetic Rallis inner product formula, their heights are related to $L'(π,\mathrm{spin},1/2)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Naomi Sweeting. 2025-03-28. On the Bloch-Kato conjecture for some four-dimensional symplectic Galois representations. https://arxiv.org/abs/2503.19226

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