Hall's Universal Group
   HOME
*





Hall's Universal Group
In algebra, Hall's universal group is a countable locally finite group, say ''U'', which is uniquely characterized by the following properties. * Every finite group ''G'' admits a monomorphism to ''U''. * All such monomorphisms are conjugate by inner automorphisms of ''U''. It was defined by Philip Hall in 1959,Hall, P. ''Some constructions for locally finite groups.'' J. London Math. Soc. 34 (1959) 305--319. and has the universal property that ''all countable locally finite groups'' embed into it. Construction Take any group \Gamma_0 of order \geq 3 . Denote by \Gamma_1 the group S_ of permutations of elements of \Gamma_0 , by \Gamma_2 the group : S_= S_ \, and so on. Since a group acts faithfully on itself by permutations : x\mapsto gx \, according to Cayley's theorem, this gives a chain of monomorphisms :\Gamma_0 \hookrightarrow \Gamma_1 \hookrightarrow \Gamma_2 \hookrightarrow \cdots . \, A direct limit In mathematics, a direct limit is a way t ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Algebra
Algebra () is one of the broad areas of mathematics. Roughly speaking, algebra is the study of mathematical symbols and the rules for manipulating these symbols in formulas; it is a unifying thread of almost all of mathematics. Elementary algebra deals with the manipulation of variables (commonly represented by Roman letters) as if they were numbers and is therefore essential in all applications of mathematics. Abstract algebra is the name given, mostly in education, to the study of algebraic structures such as groups, rings, and fields (the term is no more in common use outside educational context). Linear algebra, which deals with linear equations and linear mappings, is used for modern presentations of geometry, and has many practical applications (in weather forecasting, for example). There are many areas of mathematics that belong to algebra, some having "algebra" in their name, such as commutative algebra, and some not, such as Galois theory. The word ''algebra'' is ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Locally Finite Group
In mathematics, in the field of group theory, a locally finite group is a type of group that can be studied in ways analogous to a finite group. Sylow subgroups, Carter subgroups, and abelian subgroups of locally finite groups have been studied. The concept is credited to work in the 1930s by Russian mathematician Sergei Chernikov. Definition and first consequences A locally finite group is a group for which every finitely generated subgroup is finite. Since the cyclic subgroups of a locally finite group are finitely generated hence finite, every element has finite order, and so the group is periodic. Examples and non-examples Examples: * Every finite group is locally finite * Every infinite direct sum of finite groups is locally finite (Although the direct product may not be.) * Omega-categorical groups * The Prüfer groups are locally finite abelian groups * Every Hamiltonian group is locally finite * Every periodic solvable group is locally finite . * Every subgroup o ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Monomorphism
In the context of abstract algebra or universal algebra, a monomorphism is an injective homomorphism. A monomorphism from to is often denoted with the notation X\hookrightarrow Y. In the more general setting of category theory, a monomorphism (also called a monic morphism or a mono) is a left-cancellative morphism. That is, an arrow such that for all objects and all morphisms , : f \circ g_1 = f \circ g_2 \implies g_1 = g_2. Monomorphisms are a categorical generalization of injective functions (also called "one-to-one functions"); in some categories the notions coincide, but monomorphisms are more general, as in the examples below. The categorical dual of a monomorphism is an epimorphism, that is, a monomorphism in a category ''C'' is an epimorphism in the dual category ''C''op. Every section is a monomorphism, and every retraction is an epimorphism. Relation to invertibility Left-invertible morphisms are necessarily monic: if ''l'' is a left inverse for ''f'' (meaning ' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Inner Automorphism
In abstract algebra an inner automorphism is an automorphism of a group, ring, or algebra given by the conjugation action of a fixed element, called the ''conjugating element''. They can be realized via simple operations from within the group itself, hence the adjective "inner". These inner automorphisms form a subgroup of the automorphism group, and the quotient of the automorphism group by this subgroup is defined as the outer automorphism group. Definition If is a group and is an element of (alternatively, if is a ring, and is a unit), then the function :\begin \varphi_g\colon G&\to G \\ \varphi_g(x)&:= g^xg \end is called (right) conjugation by (see also conjugacy class). This function is an endomorphism of : for all x_1,x_2\in G, :\varphi_g(x_1 x_2) = g^ x_1 x_2g = \left(g^ x_1 g\right)\left(g^ x_2 g\right) = \varphi_g(x_1)\varphi_g(x_2), where the second equality is given by the insertion of the identity between x_1 and x_2. Furthermore, it has a left and ri ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Philip Hall
Philip Hall FRS (11 April 1904 – 30 December 1982), was an English mathematician. His major work was on group theory, notably on finite groups and solvable groups. Biography He was educated first at Christ's Hospital, where he won the Thompson Gold Medal for mathematics, and later at King's College, Cambridge. He was elected a Fellow of the Royal Society in 1951 and awarded its Sylvester Medal in 1961. He was President of the London Mathematical Society in 1955–1957, and awarded its Berwick Prize in 1958 and De Morgan Medal in 1965. Publications * * * See also * Abstract clone * Commutator collecting process * Isoclinism of groups * Regular p-group * Three subgroups lemma * Hall algebra, and Hall polynomials * Hall subgroup * Hall–Higman theorem * Hall–Littlewood polynomial * Hall's universal group * Hall's marriage theorem * Hall word * Hall–Witt identity * Irwin–Hall distribution * Zappa–Szép product In mathematics, especially group theory, the Zap ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Permutation
In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or process of changing the linear order of an ordered set. Permutations differ from combinations, which are selections of some members of a set regardless of order. For example, written as tuples, there are six permutations of the set , namely (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1). These are all the possible orderings of this three-element set. Anagrams of words whose letters are different are also permutations: the letters are already ordered in the original word, and the anagram is a reordering of the letters. The study of permutations of finite sets is an important topic in the fields of combinatorics and group theory. Permutations are used in almost every branch of mathematics, and in many other fields of scie ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Cayley's Theorem
In group theory, Cayley's theorem, named in honour of Arthur Cayley, states that every group is isomorphic to a subgroup of a symmetric group. More specifically, is isomorphic to a subgroup of the symmetric group \operatorname(G) whose elements are the permutations of the underlying set of . Explicitly, * for each g \in G, the left-multiplication-by- map \ell_g \colon G \to G sending each element to is a permutation of , and * the map G \to \operatorname(G) sending each element to \ell_g is an injective homomorphism, so it defines an isomorphism from onto a subgroup of \operatorname(G). The homomorphism G \to \operatorname(G) can also be understood as arising from the left translation action of on the underlying set . When is finite, \operatorname(G) is finite too. The proof of Cayley's theorem in this case shows that if is a finite group of order , then is isomorphic to a subgroup of the standard symmetric group S_n. But might also be isomorphic to a subgroup o ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Direct Limit
In mathematics, a direct limit is a way to construct a (typically large) object from many (typically smaller) objects that are put together in a specific way. These objects may be groups, rings, vector spaces or in general objects from any category. The way they are put together is specified by a system of homomorphisms (group homomorphism, ring homomorphism, or in general morphisms in the category) between those smaller objects. The direct limit of the objects A_i, where i ranges over some directed set I, is denoted by \varinjlim A_i . (This is a slight abuse of notation as it suppresses the system of homomorphisms that is crucial for the structure of the limit.) Direct limits are a special case of the concept of colimit in category theory. Direct limits are dual to inverse limits, which are also a special case of limits in category theory. Formal definition We will first give the definition for algebraic structures like groups and modules, and then the general definition ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Symmetric Group
In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group \mathrm_n defined over a finite set of n symbols consists of the permutations that can be performed on the n symbols. Since there are n! (n factorial) such permutation operations, the order (number of elements) of the symmetric group \mathrm_n is n!. Although symmetric groups can be defined on infinite sets, this article focuses on the finite symmetric groups: their applications, their elements, their conjugacy classes, a finite presentation, their subgroups, their automorphism groups, and their representation theory. For the remainder of this article, "symmetric group" will mean a symmetric group on a finite set. The symmetric group is important to diverse areas of mathematics such as Galois theory, invariant theory, the representatio ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Infinite Group Theory
In abstract algebra, group theory studies the algebraic structures known as groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as rings, fields, and vector spaces, can all be seen as groups endowed with additional operations and axioms. Groups recur throughout mathematics, and the methods of group theory have influenced many parts of algebra. Linear algebraic groups and Lie groups are two branches of group theory that have experienced advances and have become subject areas in their own right. Various physical systems, such as crystals and the hydrogen atom, and three of the four known fundamental forces in the universe, may be modelled by symmetry groups. Thus group theory and the closely related representation theory have many important applications in physics, chemistry, and materials science. Group theory is also central to public key cryptography. The early history of group theory dates from the 19th century. One ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]