Effective Galois theory

1981 ◽  
Vol 46 (2) ◽  
pp. 385-392 ◽  
Author(s):  
Peter La Roche

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 extensionsK⊂Fof the rationals such thatFis abelian,Fis of infinite degree overK, and the Galois group ofFoverK, although of cardinalityc, has only one recursive element (viz. the identity). This indicated the limits of effectiveness for Krull's theory. (The Galois theory offiniteextensions 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.

1976 ◽  
Vol 21 (1) ◽  
pp. 12-15 ◽  
Author(s):  
Don Krakowski

A group will be called full if it is the Galois group of an algebraic closure of a field. In this paper we first investigate full Abelian groups and classify them. Then we examine full groups from the point of view of how we can operate on them and still maintain the property of being full. Of course, by the fundamental theorem of the infinite Galois theory, closed subgroups (with standard profinite topology) of full groups are full. In general, products of full groups are notfull (for example, Z2 × Z2 is not full, by a theorem of Artin and Schreier (1927)); however we produce a set of groups which can always be attached as direct factors to full groups and still retain full groups. For the definition and basic properties of profinite groups we refer the reader to Cassels and Frohlich (1967). It has been shown by Leptin (1955) and independently by the author that profinite groups are Galois groups. The author (1971) has shown that if G is profinite, then G = Gdl(k/L) where L may have any desired characteristic and contains all primitive nth roots of unity, for all n. We will denote by p the pro-p-group which is the inverse limit of cyclic p-groups. (This is the group of p-adic integers).


2005 ◽  
Vol 16 (06) ◽  
pp. 567-593
Author(s):  
T. M. GENDRON ◽  
A. VERJOVSKY

This paper concerns the description of holomorphic extensions of algebraic number fields. After expanding the notion of adele class group to number fields of infinite degree over ℚ, a hyperbolized adele class group [Formula: see text] is assigned to every number field K/ℚ. The projectivization of the Hardy space ℙ𝖧•[K] of graded-holomorphic functions on [Formula: see text] possesses two operations ⊕ and ⊗ giving it the structure of a nonlinear field extension of K. We show that the Galois theory of these nonlinear number fields coincides with their discrete counterparts in that 𝖦𝖺𝗅(ℙ𝖧•[K]/K) = 1 and 𝖦𝖺𝗅(ℙ𝖧•[L]/ℙ𝖧•[K]) ≅ 𝖦𝖺𝗅(L/K) if L/K is Galois. If K ab denotes the maximal abelian extension of K and 𝖢K is the idele class group, it is shown that there are embeddings of 𝖢K into 𝖦𝖺𝗅⊕(ℙ𝖧•[K ab ]/K) and 𝖦𝖺𝗅⊗(ℙ𝖧•[K ab ]/K), the "Galois groups" of automorphisms preserving ⊕ (respectively, ⊗) only.


2014 ◽  
Vol 17 (1) ◽  
pp. 141-158 ◽  
Author(s):  
Claus Fieker ◽  
Jürgen Klüners

AbstractComputational Galois theory, in particular the problem of computing the Galois group of a given polynomial, is a very old problem. Currently, the best algorithmic solution is Stauduhar’s method. Computationally, one of the key challenges in the application of Stauduhar’s method is to find, for a given pair of groups $H<G$, a $G$-relative $H$-invariant, that is a multivariate polynomial $F$ that is $H$-invariant, but not $G$-invariant. While generic, theoretical methods are known to find such $F$, in general they yield impractical answers. We give a general method for computing invariants of large degree which improves on previous known methods, as well as various special invariants that are derived from the structure of the groups. We then apply our new invariants to the task of computing the Galois groups of polynomials over the rational numbers, resulting in the first practical degree independent algorithm.


2021 ◽  
Vol 28 (2) ◽  
Author(s):  
A. Esterov ◽  
L. Lang

AbstractWe introduce a new technique to prove connectivity of subsets of covering spaces (so called inductive connectivity), and apply it to Galois theory of problems of enumerative geometry. As a model example, consider the problem of permuting the roots of a complex polynomial $$f(x) = c_0 + c_1 x^{d_1} + \cdots + c_k x^{d_k}$$ f ( x ) = c 0 + c 1 x d 1 + ⋯ + c k x d k by varying its coefficients. If the GCD of the exponents is d, then the polynomial admits the change of variable $$y=x^d$$ y = x d , and its roots split into necklaces of length d. At best we can expect to permute these necklaces, i.e. the Galois group of f equals the wreath product of the symmetric group over $$d_k/d$$ d k / d elements and $${\mathbb {Z}}/d{\mathbb {Z}}$$ Z / d Z . We study the multidimensional generalization of this equality: the Galois group of a general system of polynomial equations equals the expected wreath product for a large class of systems, but in general this expected equality fails, making the problem of describing such Galois groups unexpectedly rich.


1984 ◽  
Vol 27 (3) ◽  
pp. 313-315 ◽  
Author(s):  
Lou Van Den Dries ◽  
Paulo Ribenboim

AbstractLet K be a field of characteristic 0 and t an indeterminate. It is shown that the absolute Galois group of K(t) is the semi-direct product of a free profinite group with the absolute Galois group of K.


1981 ◽  
Vol 46 (4) ◽  
pp. 851-863 ◽  
Author(s):  
Rick L. Smith

Profinite groups are Galois groups. The effective study of infinite Galois groups was initiated by Metakides and Nerode [8] and further developed by LaRoche [5]. In this paper we study profinite groups without considering Galois extensions of fields. The Artin method of representing a finite group as a Galois group has been generalized (effectively!) by Waterhouse [14] to profinite groups. Thus, there is no loss of relevance in our approach.The fundamental notions of a co-r.e. profinite group, recursively profinite group, and the degree of a co-r.e. profinite group are defined in §1. In this section we prove that every co-r.e. profinite group can be effectively represented as an inverse limit of finite groups. The degree invariant is shown to behave very well with respect to open subgroups and quotients. The work done in this section is basic to the rest of the paper.The commutator subgroup, the Frattini subgroup, thep-Sylow subgroups, and the center of a profinite group are essential in the study of profinite groups. It is only natural to ask if these subgroups are effective. The following question exemplifies our approach to this problem: Is the center a co-r.e. profinite group? Theorem 2 provides a general method for answering this type of question negatively. Examples 3,4 and 5 are all applications of this theorem.


1985 ◽  
Vol 50 (2) ◽  
pp. 468-475 ◽  
Author(s):  
Lou van den Dries ◽  
Rick L. Smith

A field K is regularly closed if every absolutely irreducible affine variety defined over K has K-rational points. This notion was first isolated by Ax [A] in his work on the elementary theory of finite fields. Later Jarden [J2] and Jarden and Kiehne [JK] extended this in different directions. One of the primary results in this area is that the elementary properties of a regularly closed field K with a free Galois group (on either finitely or countably many generators) are determined by the set of integer polynomials in one indeterminate with a zero in K. The method of proof employed in [J1], [J2] and [JK] is unusual for algebra since it is a measure-theoretic argument. In this brief summary we have not made any attempt at completeness. We refer the reader to the recent paper of Cherlin, van den Dries, and Macintyre [CDM] and to the forthcoming book by Fried and Jarden [FJ] for a more thorough discussion of the latest results. We would like to thank Moshe Jarden, Angus Macintyre, and Zoe Chatzidakis for their comments on an earlier version of this paper.A countable field K is ω-free if the absolute Galois group , where is the algebraic closure of K and is the free profinite group on ℵ0 generators.


Author(s):  
CHRISTOS CHRISTOPOULOS ◽  
JAMES MCKEE

AbstractLet f(x) ∈ [x] be a monic irreducible reciprocal polynomial of degree 2d with roots r1, 1/r1, r2, 1/r2, . . ., rd, 1/rd. The corresponding trace polynomial g(x) of degree d is the polynomial whose roots are r1 + 1/r1, . . ., rd + 1/rd. If the Galois groups of f and g are Gf and Gg respectively, then Gg ≅ Gf/N, where N is isomorphic to a subgroup of C2d. In a naive sense, the generic case is Gf ≅ C2d ⋊ Sd, with N ≅ C2d and Gg ≅ Sd. When f(x) has extra structure this may be reflected in the Galois group, and it is not always true even that Gf ≅ N ⋊ Gg. For example, for cyclotomic polynomials f(x) = Φn(x) it is known that Gf ≅ N ⋊ Gg if and only if n is divisible either by 4 or by some prime congruent to 3 modulo 4.In this paper we deal with irreducible reciprocal monic polynomials f(x) ∈ [x] that are ‘close’ to being cyclotomic, in that there is one pair of real positive reciprocal roots and all other roots lie on the unit circle. With the further restriction that f(x) has degree at least 4, this means that f(x) is the minimal polynomial of a Salem number. We show that in this case one always has Gf ≅ N ⋊ Gg, and moreover that N ≅ C2d or C2d−1, with the latter only possible if d is odd.


1976 ◽  
Vol 21 (1) ◽  
pp. 16-18
Author(s):  
Don Krakowski

Profinite groups (that is, compact totally disconnected topological groups) have been characterized as Galois groups in Krakowski (1971) and Leptin (1955). They can, in fact, be realized as groups of permutations on sets of transcendentals where every transcendental has a finite orbit under the group action and the fixed field is generated by the invariant rational functions on these orbits. If G = {G←x ¦ α∈A} we define the cardinality of G as ¦ G¦ = ¦A¦. In this paper we construct, for every cardinal number c and profinite group G with ¦G¦ ≦ c two universal fields kc and Kc so that G ≃ Gal (KcKG) and G ≃ (KGKc) for fields KG and kG which depend on G. See Cassels and Frohlich (1967) for a description of the basic properties of profinite groups.


1987 ◽  
Vol 101 (2) ◽  
pp. 197-206 ◽  
Author(s):  
Wolfgang Herfort ◽  
Luis Ribes

If F is a free profinite group, it is well known that the closed subgroups of F need not be free profinite; however, if p is a prime number, every closed subgroup of a free pro-p-group is free pio-p (cf. [2, 8, 7]). In this paper we show that there is an analogous contrast regarding the closed subgroups of free products in the category of profinite groups, and the closed subgroups of free products in the category of pro-p-groups, at least for (topologically) finitely generated subgroups.


Sign in / Sign up

Export Citation Format

Share Document