Search arXivSearch

arXiv · 2605.16063

Duality of analytic Hopf algebras and the Amice transform

Abstract

We construct global versions of the analytic Hopf algebras used in the $p$-adic Fourier theory of Amice and Mahler over a general Banach ring, independently of the choice of prime $p$. This is done by generalising Köthe echelon and coechelon spaces to an arbitrary base Banach ring $R$ and proving reflexivity and nuclearity results. We show how to define an analytic Hopf algebra structure on them and investigate their duality theory. The particular case of the Hopf algebra of analytic functions converging on the open unit disk around $1$ and its dual is studied in detail. Amice duality is recovered from this case by base-change to a $p$-adic ring. Most notably, when $R$ is the ring of integers with the trivial norm, we obtain a global analytic version of Amice duality that does not depend on $p$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luca Collauto. 2026-05-15. Duality of analytic Hopf algebras and the Amice transform. https://arxiv.org/abs/2605.16063

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