Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1004.5036

On the transcendental Galois extensions

Feng-Wen An
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper the transcendental Galois extensions of a field will be introduced as counterparts to algebraic Galois ones. There exist several types of transcendental Galois extensions of a given field, from the weakest one to the strongest one, such as Galois, tame Galois, strong Galois, and absolute Galois. The four Galois extensions are distinct from each other in general but coincide with each other for cases of algebraic extensions. The transcendental Galois extensions arise from higher relative dimensional Galois covers of arithmetic schemes. In the paper we will obtain several properties of Galois extensions in virtue of conjugation and quasi-galois and will draw a comparison between the Galois extensions. Strong Galois is more accessible. It will be proved that a purely transcendental extension is strong Galois.

Explore related subjects

math.NTmath.ACmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Feng-Wen An. 2010-07-14. On the transcendental Galois extensions. https://arxiv.org/abs/1004.5036

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↗