scholarly journals A note on Galois groups of algebraic closures

1976 ◽  
Vol 21 (1) ◽  
pp. 12-15 ◽  
Author(s):  
Don Krakowski
Keyword(s):  
Galois Group ◽  
Fundamental Theorem ◽  
Inverse Limit ◽  
Galois Theory ◽  
Algebraic Closure ◽  
Galois Groups ◽  
Point Of View ◽  
Roots Of Unity ◽  
Profinite Groups ◽  
Profinite Topology

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).

Effective Galois theory

1981 ◽  
Vol 46 (2) ◽  
pp. 385-392 ◽  
Author(s):  
Peter La Roche
Keyword(s):  
Galois Group ◽  
Galois Theory ◽  
Galois Groups ◽  
Profinite Group ◽  
Classical Literature ◽  
Profinite Groups ◽  
Algebraic Numbers ◽  
Recursively Enumerable ◽  
Free Profinite Group ◽  
Infinite Degree

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.

Profinite Modules

1973 ◽  
Vol 16 (3) ◽  
pp. 405-415
Author(s):  
Gerard Elie Cohen
Keyword(s):  
Finite Group ◽  
General Theory ◽  
Finite Length ◽  
Finite Groups ◽  
Inverse Limit ◽  
Abelian Groups ◽  
Point Of View ◽  
Inverse Limits ◽  
Profinite Groups ◽  
Inverse Systems

An inverse limit of finite groups has been called in the literature a pro-finite group and we have extensive studies of profinite groups from the cohomological point of view by J. P. Serre. The general theory of non-abelian modules has not yet been developed and therefore we consider a generalization of profinite abelian groups. We study inverse systems of discrete finite length R-modules. Profinite modules are inverse limits of discrete finite length R-modules with the inverse limit topology.

Independence of ℓ \ell -adic representations of geometric Galois groups

2018 ◽  
Vol 2018 (736) ◽  
pp. 69-93 ◽  
Author(s):  
Gebhard Böckle ◽  
Wojciech Gajda ◽  
Sebastian Petersen
Keyword(s):  
Galois Group ◽  
Finite Type ◽  
Algebraic Closure ◽  
Finite Extension ◽  
Field Extension ◽  
Galois Groups ◽  
Closed Field ◽  
Absolute Galois Group ◽  
Arbitrary Characteristic ◽  
Cohomology Modules

AbstractLetkbe an algebraically closed field of arbitrary characteristic, let{K/k}be a finitely generated field extension and letXbe a separated scheme of finite type overK. For each prime{\ell}, the absolute Galois group ofKacts on the{\ell}-adic étale cohomology modules ofX. We prove that this family of representations varying over{\ell}is almost independent in the sense of Serre, i.e., that the fixed fields inside an algebraic closure ofKof the kernels of the representations for all{\ell}become linearly disjoint over a finite extension ofK. In doing this, we also prove a number of interesting facts on the images and on the ramification of this family of representations.

scholarly journals Computation of Galois groups of rational polynomials

2014 ◽  
Vol 17 (1) ◽  
pp. 141-158 ◽  
Author(s):  
Claus Fieker ◽  
Jürgen Klüners
Keyword(s):  
Galois Group ◽  
Galois Theory ◽  
Large Degree ◽  
Rational Numbers ◽  
Galois Groups ◽  
Multivariate Polynomial ◽  
Theoretical Methods ◽  
Algorithmic Solution ◽  
Rational Polynomials ◽  
General Method

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.

scholarly journals Sparse polynomial equations and other enumerative problems whose Galois groups are wreath products

2021 ◽  
Vol 28 (2) ◽  
Author(s):  
A. Esterov ◽  
L. Lang
Keyword(s):  
Galois Group ◽  
Wreath Product ◽  
Galois Theory ◽  
General System ◽  
Wreath Products ◽  
Galois Groups ◽  
Complex Polynomial ◽  
Polynomial Equations ◽  
Sparse Polynomial ◽  
System Of Polynomial Equations

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.

Effective aspects of profinite groups

1981 ◽  
Vol 46 (4) ◽  
pp. 851-863 ◽  
Author(s):  
Rick L. Smith
Keyword(s):  
Finite Groups ◽  
Inverse Limit ◽  
Commutator Subgroup ◽  
Galois Groups ◽  
Profinite Group ◽  
Profinite Groups ◽  
Frattini Subgroup ◽  
A Finite Group ◽  
Work Done ◽  
General Method

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.

Galois theory of Salem polynomials

2009 ◽  
Vol 148 (1) ◽  
pp. 47-54 ◽  
Author(s):  
CHRISTOS CHRISTOPOULOS ◽  
JAMES MCKEE
Keyword(s):  
Unit Circle ◽  
Galois Group ◽  
Galois Theory ◽  
Minimal Polynomial ◽  
Galois Groups ◽  
Cyclotomic Polynomials ◽  
Salem Number ◽  
Extra Structure

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.

A galois theory for the banach algebra of continuous symmetric functions on absolute galois groups

2004 ◽  
Vol 45 (3-4) ◽  
pp. 349-358 ◽  
Author(s):  
Angel Popescu ◽  
Nicolae Popescu ◽  
Alexandru Zaharescu
Keyword(s):  
Banach Algebra ◽  
Symmetric Functions ◽  
Galois Theory ◽  
Galois Groups

scholarly journals On algebraic closure in pseudofinite fields

2012 ◽  
Vol 77 (4) ◽  
pp. 1057-1066 ◽  
Author(s):  
Özlem Beyarslan ◽  
Ehud Hrushovski
Keyword(s):  
Automorphism Group ◽  
Finite Field ◽  
Algebraic Closure ◽  
Roots Of Unity ◽  
Prime Field ◽  
Almost All ◽  
Pseudofinite Fields

AbstractWe study the automorphism group of the algebraic closure of a substructureAof a pseudo-finite fieldF. We show that the behavior of this group, even whenAis large, depends essentially on the roots of unity inF. For almost all completions of the theory of pseudofinite fields, we show that overA, algebraic closure agrees with definable closure, as soon asAcontains the relative algebraic closure of the prime field.

Sign in / Sign up

Export Citation Format

Share Document