Effective results in number theory

Short description: Theorems whose content is effectively computable

For historical reasons and in order to have application to the solution of Diophantine equations, results in number theory have been scrutinised more than in other branches of mathematics to see if their content is effectively computable[citation needed]. Where it is asserted that some list of integers is finite, the question is whether in principle the list could be printed out after a machine computation.

## Contents

* 1 Littlewood's result
* 2 Later work
* 3 Theoretical issues
* 4 References
* 5 External links

## Littlewood's result

An early example of an ineffective result was J. E. Littlewood's theorem of 1914,[1] that in the prime number theorem the differences of both ψ(x) and π(x) with their asymptotic estimates change sign infinitely often.Cite error: Closing `</ref>` missing for `<ref>` tag

* The 1935 result on the Siegel zero[2]
* The Siegel–Walfisz theorem based on the Siegel zero.

The concrete information that was left theoretically incomplete included lower bounds for class numbers (ideal class groups for some families of number fields grow); and bounds for the best rational approximations to algebraic numbers in terms of denominators. These latter could be read quite directly as results on Diophantine equations, after the work of Axel Thue. The result used for Liouville numbers in the proof is effective in the way it applies the mean value theorem: but improvements (to what is now the Thue–Siegel–Roth theorem) were not.

## Later work

Later results, particularly of Alan Baker, changed the position. Qualitatively speaking, Baker's theorems look weaker, but they have explicit constants and can actually be applied, in conjunction with machine computation, to prove that lists of solutions (suspected to be complete) are actually the entire solution set.

## Theoretical issues

The difficulties here were met by radically different proof techniques, taking much more care about proofs by contradiction. The logic involved is closer to proof theory than to that of computability theory and computable functions. It is rather loosely conjectured that the difficulties may lie in the realm of computational complexity theory. Ineffective results are still being proved in the shape A or B, where we have no way of telling which.

## References

1. ↑ Littlewood, J. E. (1914). "Sur la distribution des nombres premiers". Comptes Rendus 158: 1869–1872.
2. ↑ *Hazewinkel, Michiel, ed. (2001), "Diophantine approximation, problems of effective", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4, https://www.encyclopediaofmath.org/index.php?title=Diophantine_approximation,_problems_of_effective – comments on the ineffectiveness of the bound.

## External links

* Hazewinkel, Michiel, ed. (2001), "Diophantine approximations", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4, https://www.encyclopediaofmath.org/index.php?title=Diophantine_approximations

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Effective results in number theory. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Effective_results_in_number_theory&oldid=221768"