Search arXivSearch

arXiv · 2501.16916

On the Kummer pro-étale cohomology of $\mathbb B_{\operatorname{dR}}$

Abstract

We investigate $p$-adic cohomologies of log rigid analytic varieties over a $p$-adic field. For a log rigid analytic variety $X$ defined over a discretely valued field, we compute the Kummer pro-étale cohomology of $\mathbb{B}_{\mathrm{dR}}^+$ and $\mathbb{B}_{\mathrm{dR}}$. When $X$ is defined over $\mathbb{C}_p$, we introduce a logarithmic ${B}_{\mathrm{dR}}^+$-cohomology theory, serving as a deformation of log de Rham cohomology. Additionally, we establish the log de Rham-étale comparison in this setting and prove the degeneration of both the Hodge-Tate and Hodge-log de Rham spectral sequences when $X$ is proper and log smooth.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xinyu Shao. 2025-06-18. On the Kummer pro-étale cohomology of $\mathbb B_{\operatorname{dR}}$. https://arxiv.org/abs/2501.16916

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