Évariste GaloisÉvariste Galois (gælˈwɑː; evaʁist ɡalwa; 25 October 1811 – 31 May 1832) was a French mathematician and political activist. While still in his teens, he was able to determine a necessary and sufficient condition for a polynomial to be solvable by radicals, thereby solving a problem that had been open for 350 years. His work laid the foundations for Galois theory and group theory, two major branches of abstract algebra. He was a staunch republican and was heavily involved in the political turmoil that surrounded the French Revolution of 1830.
Simple extensionIn field theory, a simple extension is a field extension which is generated by the adjunction of a single element, called a primitive element. Simple extensions are well understood and can be completely classified. The primitive element theorem provides a characterization of the finite simple extensions. A field extension L/K is called a simple extension if there exists an element θ in L with This means that every element of L can be expressed as a rational fraction in θ, with coefficients in K; that is, it is produced from θ and elements of K by the field operations +, −, •, / .
Normal extensionIn abstract algebra, a normal extension is an algebraic field extension L/K for which every irreducible polynomial over K which has a root in L, splits into linear factors in L. These are one of the conditions for algebraic extensions to be a Galois extension. Bourbaki calls such an extension a quasi-Galois extension. Let be an algebraic extension (i.e. L is an algebraic extension of K), such that (i.e. L is contained in an algebraic closure of K).
Initial topologyIn general topology and related areas of mathematics, the initial topology (or induced topology or weak topology or limit topology or projective topology) on a set with respect to a family of functions on is the coarsest topology on that makes those functions continuous. The subspace topology and product topology constructions are both special cases of initial topologies. Indeed, the initial topology construction can be viewed as a generalization of these.
Module homomorphismIn algebra, a module homomorphism is a function between modules that preserves the module structures. Explicitly, if M and N are left modules over a ring R, then a function is called an R-module homomorphism or an R-linear map if for any x, y in M and r in R, In other words, f is a group homomorphism (for the underlying additive groups) that commutes with scalar multiplication. If M, N are right R-modules, then the second condition is replaced with The of the zero element under f is called the kernel of f.
Algebra homomorphismIn mathematics, an algebra homomorphism is a homomorphism between two algebras. More precisely, if A and B are algebras over a field (or a ring) K, it is a function such that, for all k in K and x, y in A, one has The first two conditions say that F is a K-linear map, and the last condition says that F preserves the algebra multiplication. So, if the algebras are associative, F is a rng homomorphism, and, if the algebras are rings and F preserves the identity, it is a ring homomorphism.
Ring homomorphismIn ring theory, a branch of abstract algebra, a ring homomorphism is a structure-preserving function between two rings. More explicitly, if R and S are rings, then a ring homomorphism is a function f : R → S such that f is: addition preserving: for all a and b in R, multiplication preserving: for all a and b in R, and unit (multiplicative identity) preserving: Additive inverses and the additive identity are part of the structure too, but it is not necessary to require explicitly that they too are respected, because these conditions are consequences of the three conditions above.
Galois connectionIn mathematics, especially in order theory, a Galois connection is a particular correspondence (typically) between two partially ordered sets (posets). Galois connections find applications in various mathematical theories. They generalize the fundamental theorem of Galois theory about the correspondence between subgroups and subfields, discovered by the French mathematician Évariste Galois. A Galois connection can also be defined on preordered sets or classes; this article presents the common case of posets.
Outer automorphism groupIn mathematics, the outer automorphism group of a group, G, is the quotient, Aut(G) / Inn(G), where Aut(G) is the automorphism group of G and Inn(G) is the subgroup consisting of inner automorphisms. The outer automorphism group is usually denoted Out(G). If Out(G) is trivial and G has a trivial center, then G is said to be complete. An automorphism of a group that is not inner is called an outer automorphism. The cosets of Inn(G) with respect to outer automorphisms are then the elements of Out(G); this is an instance of the fact that quotients of groups are not, in general, (isomorphic to) subgroups.
Subspace topologyIn topology and related areas of mathematics, a subspace of a topological space X is a subset S of X which is equipped with a topology induced from that of X called the subspace topology (or the relative topology, or the induced topology, or the trace topology). Given a topological space and a subset of , the subspace topology on is defined by That is, a subset of is open in the subspace topology if and only if it is the intersection of with an open set in .
Glossary of field theoryField theory is the branch of mathematics in which fields are studied. This is a glossary of some terms of the subject. (See field theory (physics) for the unrelated field theories in physics.) A field is a commutative ring (F,+,*) in which 0≠1 and every nonzero element has a multiplicative inverse. In a field we thus can perform the operations addition, subtraction, multiplication, and division. The non-zero elements of a field F form an abelian group under multiplication; this group is typically denoted by F×; The ring of polynomials in the variable x with coefficients in F is denoted by F[x].
Graph automorphismIn the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge–vertex connectivity. Formally, an automorphism of a graph G = (V, E) is a permutation σ of the vertex set V, such that the pair of vertices (u, v) form an edge if and only if the pair (σ(u), σ(v)) also form an edge. That is, it is a graph isomorphism from G to itself. Automorphisms may be defined in this way both for directed graphs and for undirected graphs.
