|
Subnormal Series
In mathematics, specifically group theory, a subgroup series of a group G is a chain of subgroups: :1 = A_0 \leq A_1 \leq \cdots \leq A_n = G where 1 is the trivial subgroup. Subgroup series can simplify the study of a group to the study of simpler subgroups and their relations, and several subgroup series can be invariantly defined and are important invariants of groups. A subgroup series is used in the subgroup method. Subgroup series are a special example of the use of filtrations in abstract algebra. Definition Normal series, subnormal series A subnormal series (also normal series, normal tower, subinvariant series, or just series) of a group ''G'' is a sequence of subgroups, each a normal subgroup of the next one. In a standard notation :1 = A_0\triangleleft A_1\triangleleft \cdots \triangleleft A_n = G. There is no requirement made that ''A''''i'' be a normal subgroup of ''G'', only a normal subgroup of ''A''''i'' +1. The quotient groups ''A''''i'' +1/''A'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ascending Chain Condition
In mathematics, the ascending chain condition (ACC) and descending chain condition (DCC) are finiteness properties satisfied by some algebraic structures, most importantly ideals in certain commutative rings.Jacobson (2009), p. 142 and 147 These conditions played an important role in the development of the structure theory of commutative rings in the works of David Hilbert, Emmy Noether, and Emil Artin. The conditions themselves can be stated in an abstract form, so that they make sense for any partially ordered set. This point of view is useful in abstract algebraic dimension theory due to Gabriel and Rentschler. Definition A partially ordered set (poset) ''P'' is said to satisfy the ascending chain condition (ACC) if no infinite strictly ascending sequence :a_1 < a_2 < a_3 < \cdots of elements of ''P'' exists. Equivalently,Proof: first, a strictly increasing sequence cannot stabilize, obviously. Conversely, suppose there is a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Free Group
In mathematics, the free group ''F''''S'' over a given set ''S'' consists of all words that can be built from members of ''S'', considering two words to be different unless their equality follows from the group axioms (e.g. ''st'' = ''suu''−1''t'', but ''s'' ≠ ''t''−1 for ''s'',''t'',''u'' ∈ ''S''). The members of ''S'' are called generators of ''F''''S'', and the number of generators is the rank of the free group. An arbitrary group ''G'' is called free if it is isomorphic to ''F''''S'' for some subset ''S'' of ''G'', that is, if there is a subset ''S'' of ''G'' such that every element of ''G'' can be written in exactly one way as a product of finitely many elements of ''S'' and their inverses (disregarding trivial variations such as ''st'' = ''suu''−1''t''). A related but different notion is a free abelian group; both notions are particular instances of a free object from universal algebra. As such, free groups are defined by their universal property. History Free ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finitely Generated Group
In algebra, a finitely generated group is a group ''G'' that has some finite generating set ''S'' so that every element of ''G'' can be written as the combination (under the group operation) of finitely many elements of ''S'' and of inverses of such elements. By definition, every finite group is finitely generated, since ''S'' can be taken to be ''G'' itself. Every infinite finitely generated group must be countable but countable groups need not be finitely generated. The additive group of rational numbers Q is an example of a countable group that is not finitely generated. Examples * Every quotient of a finitely generated group ''G'' is finitely generated; the quotient group is generated by the images of the generators of ''G'' under the canonical projection. * A subgroup of a finitely generated group need not be finitely generated. * A group that is generated by a single element is called cyclic. Every infinite cyclic group is isomorphic to the additive group of the integers ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Extension
In mathematics, a group extension is a general means of describing a group in terms of a particular normal subgroup and quotient group. If Q and N are two groups, then G is an extension of Q by N if there is a short exact sequence :1\to N\;\overset\;G\;\overset\;Q \to 1. If G is an extension of Q by N, then G is a group, \iota(N) is a normal subgroup of G and the quotient group G/\iota(N) is isomorphic to the group Q. Group extensions arise in the context of the extension problem, where the groups Q and N are known and the properties of G are to be determined. Note that the phrasing "G is an extension of N by Q" is also used by some. Since any finite group G possesses a maximal normal subgroup N with simple factor group G/N, all finite groups may be constructed as a series of extensions with finite simple groups. This fact was a motivation for completing the classification of finite simple groups. An extension is called a central extension if the subgroup N lies in the center o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Image (mathematics)
In mathematics, the image of a function is the set of all output values it may produce. More generally, evaluating a given function f at each element of a given subset A of its domain produces a set, called the "image of A under (or through) f". Similarly, the inverse image (or preimage) of a given subset B of the codomain of f, is the set of all elements of the domain that map to the members of B. Image and inverse image may also be defined for general binary relations, not just functions. Definition The word "image" is used in three related ways. In these definitions, f : X \to Y is a function from the set X to the set Y. Image of an element If x is a member of X, then the image of x under f, denoted f(x), is the value of f when applied to x. f(x) is alternatively known as the output of f for argument x. Given y, the function f is said to "" or "" if there exists some x in the function's domain such that f(x) = y. Similarly, given a set S, f is said to "" if there exi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Homomorphism
In mathematics, given two groups, (''G'', ∗) and (''H'', ·), a group homomorphism from (''G'', ∗) to (''H'', ·) is a function ''h'' : ''G'' → ''H'' such that for all ''u'' and ''v'' in ''G'' it holds that : h(u*v) = h(u) \cdot h(v) where the group operation on the left side of the equation is that of ''G'' and on the right side that of ''H''. From this property, one can deduce that ''h'' maps the identity element ''eG'' of ''G'' to the identity element ''eH'' of ''H'', : h(e_G) = e_H and it also maps inverses to inverses in the sense that : h\left(u^\right) = h(u)^. \, Hence one can say that ''h'' "is compatible with the group structure". Older notations for the homomorphism ''h''(''x'') may be ''x''''h'' or ''x''''h'', though this may be confused as an index or a general subscript. In automata theory, sometimes homomorphisms are written to the right of their arguments without parentheses, so that ''h''(''x'') becomes simply xh. In areas of mathematics where one ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prüfer Group
In mathematics, specifically in group theory, the Prüfer ''p''-group or the ''p''-quasicyclic group or ''p''∞-group, Z(''p''∞), for a prime number ''p'' is the unique ''p''-group in which every element has ''p'' different ''p''-th roots. The Prüfer ''p''-groups are countable abelian groups that are important in the classification of infinite abelian groups: they (along with the group of rational numbers) form the smallest building blocks of all divisible groups. The groups are named after Heinz Prüfer, a German mathematician of the early 20th century. Constructions of Z(''p''∞) The Prüfer ''p''-group may be identified with the subgroup of the circle group, U(1), consisting of all ''p''''n''-th roots of unity as ''n'' ranges over all non-negative integers: :\mathbf(p^\infty)=\ = \.\; The group operation here is the multiplication of complex numbers. There is a presentation :\mathbf(p^\infty) = \langle\, g_1, g_2, g_3, \ldots \mid g_1^p = 1, g_2^p = g_1, g_3^p = g_ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ring (mathematics)
In mathematics, rings are algebraic structures that generalize fields: multiplication need not be commutative and multiplicative inverses need not exist. In other words, a ''ring'' is a set equipped with two binary operations satisfying properties analogous to those of addition and multiplication of integers. Ring elements may be numbers such as integers or complex numbers, but they may also be non-numerical objects such as polynomials, square matrices, functions, and power series. Formally, a ''ring'' is an abelian group whose operation is called ''addition'', with a second binary operation called ''multiplication'' that is associative, is distributive over the addition operation, and has a multiplicative identity element. (Some authors use the term " " with a missing i to refer to the more general structure that omits this last requirement; see .) Whether a ring is commutative (that is, whether the order in which two elements are multiplied might change the result) has ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Infinite Cyclic Group
In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted C''n'', that is generated by a single element. That is, it is a set of invertible elements with a single associative binary operation, and it contains an element ''g'' such that every other element of the group may be obtained by repeatedly applying the group operation to ''g'' or its inverse. Each element can be written as an integer power of ''g'' in multiplicative notation, or as an integer multiple of ''g'' in additive notation. This element ''g'' is called a ''generator'' of the group. Every infinite cyclic group is isomorphic to the additive group of Z, the integers. Every finite cyclic group of order ''n'' is isomorphic to the additive group of Z/''n''Z, the integers modulo ''n''. Every cyclic group is an abelian group (meaning that its group operation is commutative), and every finitely generated abelian group is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Empty Set
In mathematics, the empty set is the unique set having no elements; its size or cardinality (count of elements in a set) is zero. Some axiomatic set theories ensure that the empty set exists by including an axiom of empty set, while in other theories, its existence can be deduced. Many possible properties of sets are vacuously true for the empty set. Any set other than the empty set is called non-empty. In some textbooks and popularizations, the empty set is referred to as the "null set". However, null set is a distinct notion within the context of measure theory, in which it describes a set of measure zero (which is not necessarily empty). The empty set may also be called the void set. Notation Common notations for the empty set include "", "\emptyset", and "∅". The latter two symbols were introduced by the Bourbaki group (specifically André Weil) in 1939, inspired by the letter Ø in the Danish and Norwegian alphabets. In the past, "0" was occasionally used as a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Artinian Ring
In mathematics, specifically abstract algebra, an Artinian ring (sometimes Artin ring) is a ring that satisfies the descending chain condition on (one-sided) ideals; that is, there is no infinite descending sequence of ideals. Artinian rings are named after Emil Artin, who first discovered that the descending chain condition for ideals simultaneously generalizes finite rings and rings that are finite-dimensional vector spaces over fields. The definition of Artinian rings may be restated by interchanging the descending chain condition with an equivalent notion: the minimum condition. Precisely, a ring is left Artinian if it satisfies the descending chain condition on left ideals, right Artinian if it satisfies the descending chain condition on right ideals, and Artinian or two-sided Artinian if it is both left and right Artinian. For commutative rings the left and right definitions coincide, but in general they are distinct from each other. The Artin–Wedderburn theorem charact ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
