SearcharxivSearch

arXiv · 1507.01447

A Proof of the Thue-Siegel Theorem about the Approximation of Algebraic Numbers for Binomial Equations

Abstract

In 1908 Thue (1) showed that algebraic numbers of the special form $\xi =\sqrt[n]{\frac{a}{b}}$ can, for every positive $\epsilon$, only be sharply approximated by finitely many rational numbers $\frac{p}{q}$ with the following inequality holding \[ \left|\xi -\frac{p}{q}\right|\leq q^{-(\frac{n}{2}+1+\epsilon)} .\] The proof uses, if perhaps in a somewhat hidden way, the continued fraction expansion of the binomial series $(1-z)^\omega$. In further work about the approximation of algebraic numbers (2,3) famously Thue used instead a completely different tool, the drawer method of Dirichlet, and showed further that the above statement holds for any algebraic number. Thue's methods were later generalized by Siegel(4,5,6,7) who showed, among other things, that for every algebraic number in the above inequality the exponent $\frac{n}{2}+1+\epsilon$ could be replaced by $\frac{n}{m}+m-1+\epsilon$, where $m$ is some natural number. This note demonstrates a generalization of Thue's methods in (1); Like Thue I restrict myself to the roots $\xi =\sqrt[n]{\frac{a}{b}}$ of the binomial equations. The continued fraction expansion of the binomial series is generalized and algebraic approximation functions are given instead of rational approximation functions. In doing so I proceed exactly as in my work on the exponential function(8). Integrals are set up for the approximation functions; thus the estimates become much easier and you can prove Thue's theorem with Siegel's Exponents for the binomial algebraic equations without difficulty and without use of the pigeonhole principle.

Explore related subjects

Keep this discovery

BibTeXRIS

Kurt Mahler. 2015-06-11. A Proof of the Thue-Siegel Theorem about the Approximation of Algebraic Numbers for Binomial Equations. https://arxiv.org/abs/1507.01447

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

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO