In mathematics, Galois rings are a type of finite commutative rings which generalize both the finite fields and the rings of integers modulo a prime power. A Galois ring is constructed from the ring similar to how a finite field is constructed from . It is a Galois extension of , when the concept of a Galois extension is generalized beyond the context of fields.
Galois rings were studied by Krull (1924), [1] and independently by Janusz (1966) [2] and by Raghavendran (1969), [3] who both introduced the name Galois ring. They are named after Évariste Galois, similar to Galois fields, which is another name for finite fields. Galois rings have found applications in coding theory, where certain codes are best understood as linear codes over using Galois rings GR(4, r). [4] [5]
A Galois ring is a commutative ring of characteristic pn which has pnr elements, where p is prime and n and r are positive integers. It is usually denoted GR(pn, r). It can be defined as a quotient ring
where is a monic polynomial of degree r which is irreducible modulo p. [6] [7] Up to isomorphism, the ring depends only on p, n, and r and not on the choice of f used in the construction. [8]
The simplest examples of Galois rings are important special cases:
A less trivial example is the Galois ring GR(4, 3). It is of characteristic 4 and has 43 = 64 elements. One way to construct it is , or equivalently, where is a root of the polynomial . Although any monic polynomial of degree 3 which is irreducible modulo 2 could have been used, this choice of f turns out to be convenient because
in , which makes a 7th root of unity in GR(4, 3). The elements of GR(4, 3) can all be written in the form where each of a0, a1, and a2 is in . For example, and . [4]
Every Galois ring GR(pn, r) has a primitive (pr – 1)-th root of unity. It is the equivalence class of x in the quotient when f is chosen to be a primitive polynomial. This means that, in , the polynomial divides and does not divide for all m < pr – 1. Such an f can be computed by starting with a primitive polynomial of degree r over the finite field and using Hensel lifting. [9]
A primitive (pr – 1)-th root of unity can be used to express elements of the Galois ring in a useful form called the p-adic representation. Every element of the Galois ring can be written uniquely as
Every Galois ring is a local ring. The unique maximal ideal is the principal ideal , consisting of all elements which are multiples of p. The residue field is isomorphic to the finite field of order pr. Furthermore, are all the ideals. [6]
The Galois ring GR(pn, r) contains a unique subring isomorphic to GR(pn, s) for every s which divides r. These are the only subrings of GR(pn, r). [10]
The units of a Galois ring R are all the elements which are not multiples of p. The group of units, R×, can be decomposed as a direct product G1×G2, as follows. The subgroup G1 is the group of (pr – 1)-th roots of unity. It is a cyclic group of order pr – 1. The subgroup G2 is 1+pR, consisting of all elements congruent to 1 modulo p. It is a group of order pr(n−1), with the following structure:
This description generalizes the structure of the multiplicative group of integers modulo pn, which is the case r = 1. [11]
Analogous to the automorphisms of the finite field , the automorphism group of the Galois ring GR(pn, r) is a cyclic group of order r. [12] The automorphisms can be described explicitly using the p-adic representation. Specifically, the map
(where each is in the set ) is an automorphism, which is called the generalized Frobenius automorphism. The fixed points of the generalized Frobenius automorphism are the elements of the subring . Iterating the generalized Frobenius automorphism gives all the automorphisms of the Galois ring. [13]
The automorphism group can be thought of as the Galois group of GR(pn, r) over , and the ring GR(pn, r) is a Galois extension of . More generally, whenever r is a multiple of s, GR(pn, r) is a Galois extension of GR(pn, s), with Galois group isomorphic to . [14] [13]
In mathematics, a finite field or Galois field is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers mod p when p is a prime number.
In mathematics, particularly in algebra, a field extension is a pair of fields such that the operations of K are those of L restricted to K. In this case, L is an extension field of K and K is a subfield of L. For example, under the usual notions of addition and multiplication, the complex numbers are an extension field of the real numbers; the real numbers are a subfield of the complex numbers.
In mathematics, in the area of abstract algebra known as Galois theory, the Galois group of a certain type of field extension is a specific group associated with the field extension. The study of field extensions and their relationship to the polynomials that give rise to them via Galois groups is called Galois theory, so named in honor of Évariste Galois who first discovered them.
In mathematics, a reciprocity law is a generalization of the law of quadratic reciprocity to arbitrary monic irreducible polynomials with integer coefficients. Recall that first reciprocity law, quadratic reciprocity, determines when an irreducible polynomial splits into linear terms when reduced mod . That is, it determines for which prime numbers the relation
In mathematics, the adele ring of a global field is a central object of class field theory, a branch of algebraic number theory. It is the restricted product of all the completions of the global field and is an example of a self-dual topological ring.
In mathematics, a differential operator is an operator defined as a function of the differentiation operator. It is helpful, as a matter of notation first, to consider differentiation as an abstract operation that accepts a function and returns another function.
In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates with coefficients in another ring, often a field.
In mathematics, specifically the algebraic theory of fields, a normal basis is a special kind of basis for Galois extensions of finite degree, characterised as forming a single orbit for the Galois group. The normal basis theorem states that any finite Galois extension of fields has a normal basis. In algebraic number theory, the study of the more refined question of the existence of a normal integral basis is part of Galois module theory.
In commutative algebra and field theory, the Frobenius endomorphism is a special endomorphism of commutative rings with prime characteristic p, an important class which includes finite fields. The endomorphism maps every element to its p-th power. In certain contexts it is an automorphism, but this is not true in general.
In mathematics, the Mahler measureof a polynomial with complex coefficients is defined as
In mathematics, the fundamental theorem of Galois theory is a result that describes the structure of certain types of field extensions in relation to groups. It was proved by Évariste Galois in his development of Galois theory.
In field theory, a branch of mathematics, the minimal polynomial of an element α of a field extension is, roughly speaking, the polynomial of lowest degree having coefficients in the field, such that α is a root of the polynomial. If the minimal polynomial of α exists, it is unique. The coefficient of the highest-degree term in the polynomial is required to be 1.
An -superprocess, , within mathematics probability theory is a stochastic process on that is usually constructed as a special limit of near-critical branching diffusions.
Lehmer's conjecture, also known as the Lehmer's Mahler measure problem, is a problem in number theory raised by Derrick Henry Lehmer. The conjecture asserts that there is an absolute constant such that every polynomial with integer coefficients satisfies one of the following properties:
In mathematics, a permutation polynomial is a polynomial that acts as a permutation of the elements of the ring, i.e. the map is a bijection. In case the ring is a finite field, the Dickson polynomials, which are closely related to the Chebyshev polynomials, provide examples. Over a finite field, every function, so in particular every permutation of the elements of that field, can be written as a polynomial function.
In mathematics, the discrete Fourier transform over a ring generalizes the discrete Fourier transform (DFT), of a function whose values are commonly complex numbers, over an arbitrary ring.
In abstract algebra, the Pierce–Birkhoff conjecture asserts that any piecewise-polynomial function can be expressed as a maximum of finite minima of finite collections of polynomials. It was first stated, albeit in non-rigorous and vague wording, in the 1956 paper of Garrett Birkhoff and Richard S. Pierce in which they first introduced f-rings. The modern, rigorous statement of the conjecture was formulated by Melvin Henriksen and John R. Isbell, who worked on the problem in the early 1960s in connection with their work on f-rings. Their formulation is as follows:
In mathematics, the automorphism group of an object X is the group consisting of automorphisms of X under composition of morphisms. For example, if X is a finite-dimensional vector space, then the automorphism group of X is the group of invertible linear transformations from X to itself. If instead X is a group, then its automorphism group is the group consisting of all group automorphisms of X.
In mathematics, the Fuchs relation is a relation between the starting exponents of formal series solutions of certain linear differential equations, so called Fuchsian equations. It is named after Lazarus Immanuel Fuchs.
The Fuchsian theory of linear differential equations, which is named after Lazarus Immanuel Fuchs, provides a characterization of various types of singularities and the relations among them.