Search arXivSearch

arXiv · 1604.05821

Generalized Kuga-Satake theory and good reduction properties of Galois representations

Abstract

In previous work we described when a single geometric representation, valued in a linear algebraic group, of the Galois group of a number field lifts through a central torus quotient to a geometric representation. In this paper we prove a much sharper result for systems of l-adic representations, such as the l-adic realizations of a motive, having common "good reduction" properties. Namely, such systems admit geometric lifts with good reduction outside a common finite set of primes. The method yields new proofs of theorems of Tate (the original result on lifting projective representations over number fields) and Wintenberger (an analogue of our main result in the setting of lifting through a central isogeny).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stefan Patrikis. 2016-04-20. Generalized Kuga-Satake theory and good reduction properties of Galois representations. https://doi.org/10.2140/ant.2017.11.2397

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