Search arXivSearch

arXiv · 2105.11968

Ramification filtration and differential forms

Abstract

Let $L$ be a complete discrete valuation field of prime characteristic $p$ with finite residue field. Denote by $Γ_{L}^{(v)}$ the ramification subgroups of $Γ_{L}=\operatorname{Gal}(L^{sep}/L)$. We consider the category $\operatorname{MΓ}_{L}^{Lie}$ of finite $\mathbb{Z}_p[Γ_{L}]$-modules $H$, satisfying some additional (Lie)-condition on the image of $Γ_L$ in $\operatorname{Aut}_{\mathbb{Z}_p}H$. In the paper it is proved that all information about the images of the ramification subgroups $Γ_L^{(v)}$ can be explicitly extracted from some differential forms $Ω[N]$ on the Fontaine etale $ϕ$-module $M(H)$ associated with $H$. The forms $Ω[N]$ are completely determined by a connection $\nabla $ on $M(H)$. In the case of fields $L$ of mixed characteristic containing a primitive $p$-th root of unity we show that the similar problem for $\mathbb{F}_p[Γ_L]$-modules also admits a solution. In this case we use the field-of-norms functor to construct the coresponding $ϕ$-module together with the action of a cyclic group of order $p$ coming from a cyclic extension of $L$. Then the solution involves the characteristic $p$ part (provided by the field-of-norms functor) and the condition for a "good" lift of a generator of the involved cyclic group of order $p$. Apart from the above differential forms the statement of this condition also uses a power series coming from the $p$-adic period of the formal group $\mathbb{G}_m$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victor Abrashkin. 2022-11-22. Ramification filtration and differential forms. https://arxiv.org/abs/2105.11968

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