Hostname: page-component-8448b6f56d-m8qmq Total loading time: 0 Render date: 2024-04-19T11:08:49.088Z Has data issue: false hasContentIssue false
  • English
  • Français

Effective Galois theory

Published online by Cambridge University Press:  12 March 2014

Peter La Roche
Peter La Roche*
Affiliation:
Cornell University, Ithaca, New York 14850
*
Applied Mathematics Division, Department of Scientific and Industrial Research, Wellington, New Zealand
Get access Rights & Permissions [Opens in a new window]

Extract

Krull [4] extended Galois theory to arbitrary normal extensions, in which the Galois groups are precisely the profinite groups (i.e. totally disconnected, compact, Hausdorff groups). Metakides and Nerode [7] produced two recursively presented algebraic extensions K ⊂ F of the rationals such that F is abelian, F is of infinite degree over K, and the Galois group of F over K, although of cardinality c, has only one recursive element (viz. the identity). This indicated the limits of effectiveness for Krull's theory. (The Galois theory of finite extensions is completely effective.) Nerode suggested developing a natural effective version of Krull's theory (done here in §1).

It is evident from the classical literature that the free profinite group on denumerably many generators can be obtained effectively as the Galois group of a recursive extension of the rationals over a subfield. Nerode conjectured that it could be obtained effectively as the Galois group of the algebraic numbers over a suitable subfield (done here in §2). The case of finitely many generators was done non-effectively by Jarden [3]. The author believes that the denumerable case, as presented in §2, is also new classically. Using this result and the effective Krull theory, every “co-recursively enumerable” profinite group is effectively the Galois group of a recursively enumerable field of algebraic numbers over a recursive subfield.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 46 , Issue 2 , June 1981 , pp. 385 - 392
Copyright
Copyright © Association for Symbolic Logic 1981

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

BIBLIOGRAPHY

[1]Fröhlich, A. and Shepherdson, J.C., Effective procedures in field theory, Philosophical Transactions of the Royal Society of London, Series A, vol. 284 (1955), pp. 407–432.Google Scholar
[2]Jacobson, N., Lectures in abstract algebra. III, Van Nostrand, Princeton, New Jersey, 1964.CrossRefGoogle Scholar
[3]Jarden, M., Algebraic extensions of finite corank of Hilbertian fields, Israel Journal of Mathematics, vol. 18 (1974), pp. 279–307.CrossRefGoogle Scholar
[4]Krull, W., Galoissche Theorie unendliche algebraischen Erweiterungen, Mathematische Annalen, vol. 100 (1928), pp. 687–698.CrossRefGoogle Scholar
[5]Lang, S., Diophantine geometry, Interscience Tracts in Pure and Applied Mathematics, no. 11, Interscience Publishers, New York, London, 1962.Google Scholar
[6]Lyndon, R.C. and Schupp, P.E., Combinatorial group theory, Springer-Verlag, Berlin, Heidelberg, New York, 1977.Google Scholar
[7]Metakides, G. and Nerode, A., The effective content of field theory, Annals of Mathematical Logic, vol. 17 (1979), pp. 289–320.CrossRefGoogle Scholar
[8]Rabin, M.O., Computable algebra, general theory and theory of computable fields, Transactions of the American Mathematical Society., vol. 95 (1960), pp. 341–360.Google Scholar
[9]Ribes, L., Introduction to profinite groups and Galois cohomology, Queen's Papers in Pure and Applied Mathematics, no. 24 (1970).Google Scholar
[10]Rogers, H., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[11]Schatz, S., Profinite groups, arithmetic and geometry, Princeton University Press, Princeton, New Jersey, 1972.CrossRefGoogle Scholar