Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0908.1991

Bigness in compatible systems

Andrew Snowden·Andrew Wiles
View original source ↗Read source document ↗Export metadata ↓

Abstract

Clozel, Harris and Taylor have recently proved a modularity lifting theorem of the following general form: if rho is an l-adic representation of the absolute Galois group of a number field for which the residual representation rho-bar comes from a modular form then so does rho. This theorem has numerous hypotheses; a crucial one is that the image of rho-bar must be "big," a technical condition on subgroups of GL(n). In this paper we investigate this condition in compatible systems. Our main result is that in a sufficiently irreducible compatible system the residual images are big at a density one set of primes. This result should make some of the work of Clozel, Harris and Taylor easier to apply in the setting of compatible systems.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrew Snowden, Andrew Wiles. 2010-04-21. Bigness in compatible systems. https://arxiv.org/abs/0908.1991

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗