Search arXivSearch

arXiv · math/0511591

A remark on transitivity of Galois action on the set of uniquely divisible abelian extensions of the group of algebraic points of an elliptic curve, by $Z^2$

Abstract

We study Galois action on $\Ext^1(E(\bar \Q),\Z^2)$ and interpret our results as partially showing that the notion of a path on a complex elliptic curve $E$ can be characterised algebraically. The proofs show that our results are just concise reformulations of Kummer theory for $E$ as well as the description of Galois action on the Tate module. Namely, we prove (a),(b) below by showing they are equivalent to (c) which is well-known: (a) Absolute Galois group acts transitively on the set of uniquely divisible abelian \EndE-module extensions of $E(\bar\Q)$ of algebraic points of an elliptic curve, by $Λ\cong\Z2$, (b) natural algebraic properties characterise uniquely the Poincare's fundamental groupoid of a complex elliptic curve, restricted to the algebraic points, (c) (Kummer theory) up to finite index, the image of the Galois action on the sequences $(P_i)_{i>0},jP_{ij}=P_i,i,j>0$ of points $P_i\in E^k(\bar\Q)$ is as large as possible with respect to linear relations between the coordinates of the points $P_i$'s. Our original motivations come from model theory; this paper presents results from the author's thesis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Misha Gavrilovich. 2005-11-23. A remark on transitivity of Galois action on the set of uniquely divisible abelian extensions of the group of algebraic points of an elliptic curve, by $Z^2$. https://arxiv.org/abs/math/0511591

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