|
Supersolvable
In mathematics, a group is supersolvable (or supersoluble) if it has an invariant normal series where all the factors are cyclic groups. Supersolvability is stronger than the notion of solvability. Definition Let ''G'' be a group. ''G'' is supersolvable if there exists a normal series :\ = H_0 \triangleleft H_1 \triangleleft \cdots \triangleleft H_ \triangleleft H_s = G such that each quotient group H_/H_i \; is cyclic and each H_i is normal in G. By contrast, for a solvable group the definition requires each quotient to be abelian. In another direction, a polycyclic group must have a subnormal series with each quotient cyclic, but there is no requirement that each H_i be normal in G. As every finite solvable group is polycyclic, this can be seen as one of the key differences between the definitions. For a concrete example, the alternating group on four points, A_4, is solvable but not supersolvable. Basic Properties Some facts about supersolvable groups: * Supersolvabl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Solvable Group
In mathematics, more specifically in the field of group theory, a solvable group or soluble group is a group that can be constructed from abelian groups using extensions. Equivalently, a solvable group is a group whose derived series terminates in the trivial subgroup. Motivation Historically, the word "solvable" arose from Galois theory and the proof of the general unsolvability of quintic equation. Specifically, a polynomial equation is solvable in radicals if and only if the corresponding Galois group is solvable (note this theorem holds only in characteristic 0). This means associated to a polynomial f \in F /math> there is a tower of field extensionsF = F_0 \subseteq F_1 \subseteq F_2 \subseteq \cdots \subseteq F_m=Ksuch that # F_i = F_ alpha_i/math> where \alpha_i^ \in F_, so \alpha_i is a solution to the equation x^ - a where a \in F_ # F_m contains a splitting field for f(x) Example For example, the smallest Galois field extension of \mathbb containing the elemen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Metacyclic Group
In group theory, a metacyclic group is an extension of a cyclic group by a cyclic group. That is, it is a group ''G'' for which there is a short exact sequence :1 \rightarrow K \rightarrow G \rightarrow H \rightarrow 1,\, where ''H'' and ''K'' are cyclic. Equivalently, a metacyclic group is a group ''G'' having a cyclic normal subgroup ''N'', such that the quotient ''G''/''N'' is also cyclic. Properties Metacyclic groups are both supersolvable and metabelian. Examples * Any cyclic group is metacyclic. * The direct product or semidirect product of two cyclic groups is metacyclic. These include the dihedral groups and the quasidihedral groups. * The dicyclic groups are metacyclic. (Note that a dicyclic group is not necessarily a semidirect product of two cyclic groups.) * Every finite group of squarefree order is metacyclic. * More generally every Z-group In mathematics, especially in the area of algebra known as group theory, the term Z-group refers to a number of distinct typ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Monomial Group
In mathematics, in the area of algebra studying the character theory of finite groups, an M-group or monomial group is a finite group whose complex irreducible characters are all monomial, that is, induced from characters of degree 1 . In this section only finite groups are considered. A monomial group is solvable by , presented in textbook in and . Every supersolvable group and every solvable A-group is a monomial group. Factor groups of monomial groups are monomial, but subgroups need not be, since every finite solvable group can be embedded in a monomial group, as shown by and in textbook form in . The symmetric group S_4 is an example of a monomial group that is neither supersolvable nor an A-group. The special linear group In mathematics, the special linear group of degree ''n'' over a field ''F'' is the set of matrices with determinant 1, with the group operations of ordinary matrix multiplication and matrix inversion. This is the normal subgroup of the genera ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Z-group
In mathematics, especially in the area of algebra known as group theory, the term Z-group refers to a number of distinct types of groups: * in the study of finite groups, a Z-group is a finite group whose Sylow subgroups are all cyclic. * in the study of infinite groups, a Z-group is a group which possesses a very general form of central series. * in the study of ordered groups, a Z-group or \mathbb Z-group is a discretely ordered abelian group whose quotient over its minimal convex subgroup is divisible. Such groups are elementarily equivalent to the integers (\mathbb Z,+,<). Z-groups are an alternative presentation of . * occasionally, (Z)-group is used to mean a , a special ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nilpotent Group
In mathematics, specifically group theory, a nilpotent group ''G'' is a group that has an upper central series that terminates with ''G''. Equivalently, its central series is of finite length or its lower central series terminates with . Intuitively, a nilpotent group is a group that is "almost abelian". This idea is motivated by the fact that nilpotent groups are solvable, and for finite nilpotent groups, two elements having relatively prime orders must commute. It is also true that finite nilpotent groups are supersolvable. The concept is credited to work in the 1930s by Russian mathematician Sergei Chernikov. Nilpotent groups arise in Galois theory, as well as in the classification of groups. They also appear prominently in the classification of Lie groups. Analogous terms are used for Lie algebras (using the Lie bracket) including nilpotent, lower central series, and upper central series. Definition The definition uses the idea of a central series for a group. The followi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Representation Theory Of Finite Groups
The representation theory of groups is a part of mathematics which examines how groups act on given structures. Here the focus is in particular on operations of groups on vector spaces. Nevertheless, groups acting on other groups or on sets are also considered. For more details, please refer to the section on permutation representations. Other than a few marked exceptions, only finite groups will be considered in this article. We will also restrict ourselves to vector spaces over fields of characteristic zero. Because the theory of algebraically closed fields of characteristic zero is complete, a theory valid for a special algebraically closed field of characteristic zero is also valid for every other algebraically closed field of characteristic zero. Thus, without loss of generality, we can study vector spaces over \Complex. Representation theory is used in many parts of mathematics, as well as in quantum chemistry and physics. Among other things it is used in algebra to exam ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hall Subgroup
In mathematics, specifically group theory, a Hall subgroup of a finite group ''G'' is a subgroup whose order is coprime to its index. They were introduced by the group theorist . Definitions A Hall divisor (also called a unitary divisor) of an integer ''n'' is a divisor ''d'' of ''n'' such that ''d'' and ''n''/''d'' are coprime. The easiest way to find the Hall divisors is to write the prime power factorization of the number in question and take any subset of the factors. For example, to find the Hall divisors of 60, its prime power factorization is 22 × 3 × 5, so one takes any product of 3, 22 = 4, and 5. Thus, the Hall divisors of 60 are 1, 3, 4, 5, 12, 15, 20, and 60. A Hall subgroup of ''G'' is a subgroup whose order is a Hall divisor of the order of ''G''. In other words, it is a subgroup whose order is coprime to its index. If ''π'' is a set of primes, then a Hall ''π''-subgroup is a subgroup whose order is a product of prim ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Baum's Theorem
eBaum's World is an entertainment website owned by Literally Media. The site was founded in 2001 and features comedy content such as memes, viral videos, images, and other forms of Internet culture. Content is primarily user submitted in exchange for points through a monetary point system "eBones." History of ownership eBaum's World originated in Rochester, New York featuring entertainment media such as videos, Adobe Flash cartoons, and web games. The site was created and owned by Eric "eBaum" Bauman and his father, Neil. In August 2007, eBaum's World was acquired by HandHeld Entertainment, also known as ZVUE Corporation, for $15 million up front, $2.5 million in HandHeld stock, and up to $52.5 million in cash and stock over 3 years. On January 31, 2009, Bauman and the company's staff were terminated by ZVUE and the company moved to the San Francisco ZVUE offices. As of 2016, the Israel-based company Literally Media held a controlling stake of eBaum's World. eBaum's World ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jordan–Dedekind Chain Condition
A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet). An example is given by the power set of a set, partially ordered by inclusion, for which the supremum is the union and the infimum is the intersection. Another example is given by the natural numbers, partially ordered by divisibility, for which the supremum is the least common multiple and the infimum is the greatest common divisor. Lattices can also be characterized as algebraic structures satisfying certain axiomatic identities. Since the two definitions are equivalent, lattice theory draws on both order theory and universal algebra. Semilattices include lattices, which in turn include Heyting and Boolean algebras. These ''lattice-like'' structures all admit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lattice Of Subgroups
In mathematics, the lattice of subgroups of a group G is the lattice whose elements are the subgroups of G, with the partial order relation being set inclusion. In this lattice, the join of two subgroups is the subgroup generated by their union, and the meet of two subgroups is their intersection. Example The dihedral group Dih4 has ten subgroups, counting itself and the trivial subgroup. Five of the eight group elements generate subgroups of order two, and the other two non-identity elements both generate the same cyclic subgroup of order four. In addition, there are two subgroups of the form Z2 × Z2, generated by pairs of order-two elements. The lattice formed by these ten subgroups is shown in the illustration. This example also shows that the lattice of all subgroups of a group is not a modular lattice in general. Indeed, this particular lattice contains the forbidden "pentagon" ''N''5 as a sublattice. Properties For any ''A'', ''B'', and ''C'' subgroups of a g ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Index Of A Subgroup
In mathematics, specifically group theory, the index of a subgroup ''H'' in a group ''G'' is the number of left cosets of ''H'' in ''G'', or equivalently, the number of right cosets of ''H'' in ''G''. The index is denoted , G:H, or :H/math> or (G:H). Because ''G'' is the disjoint union of the left cosets and because each left coset has the same size as ''H'', the index is related to the orders of the two groups by the formula :, G, = , G:H, , H, (interpret the quantities as cardinal numbers if some of them are infinite). Thus the index , G:H, measures the "relative sizes" of ''G'' and ''H''. For example, let G = \Z be the group of integers under addition, and let H = 2\Z be the subgroup consisting of the even integers. Then 2\Z has two cosets in \Z, namely the set of even integers and the set of odd integers, so the index , \Z:2\Z, is 2. More generally, , \Z:n\Z, = n for any positive integer ''n''. When ''G'' is finite, the formula may be written as , G:H, = , G, /, H, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Maximal Subgroup
In mathematics, the term maximal subgroup is used to mean slightly different things in different areas of algebra. In group theory, a maximal subgroup ''H'' of a group ''G'' is a proper subgroup, such that no proper subgroup ''K'' contains ''H'' strictly. In other words, ''H'' is a maximal element of the partially ordered set of subgroups of ''G'' that are not equal to ''G''. Maximal subgroups are of interest because of their direct connection with primitive permutation representations of ''G''. They are also much studied for the purposes of finite group theory: see for example Frattini subgroup, the intersection of the maximal subgroups. In semigroup theory, a maximal subgroup of a semigroup ''S'' is a subgroup (that is, a subsemigroup which forms a group under the semigroup operation) of ''S'' which is not properly contained in another subgroup of ''S''. Notice that, here, there is no requirement that a maximal subgroup be proper, so if ''S'' is in fact a group then its uniq ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Lattice Of Subgroups")