Concept
Lattice of subgroups
Related concepts (16)
Modular lattice
In the branch of mathematics called order theory, a modular lattice is a lattice that satisfies the following self-dual condition, Modular lawa ≤ b implies a ∨ (x ∧ b) = (a ∨ x) ∧ b where x, a, b are arbitrary elements in the lattice, ≤ is the partial order, and ∨ and ∧ (called join and meet respectively) are the operations of the lattice. This phrasing emphasizes an interpretation in terms of projection onto the sublattice [a, b], a fact known as the diamond isomorphism theorem.
Iwasawa group
NOTOC In mathematics, a group is called an Iwasawa group, M-group or modular group if its lattice of subgroups is modular. Alternatively, a group G is called an Iwasawa group when every subgroup of G is permutable in G . proved that a p-group G is an Iwasawa group if and only if one of the following cases happens: G is a Dedekind group, or G contains an abelian normal subgroup N such that the quotient group G/N is a cyclic group and if q denotes a generator of G/N, then for all n ∈ N, q−1nq = n1+ps where s ≥ 1 in general, but s ≥ 2 for p=2.
Quasinormal subgroup
In mathematics, in the field of group theory, a quasinormal subgroup, or permutable subgroup, is a subgroup of a group that commutes (permutes) with every other subgroup with respect to the product of subgroups. The term quasinormal subgroup was introduced by Øystein Ore in 1937. Two subgroups are said to permute (or commute) if any element from the first subgroup, times an element of the second subgroup, can be written as an element of the second subgroup, times an element of the first subgroup.
Subnormal subgroup
In mathematics, in the field of group theory, a subgroup H of a given group G is a subnormal subgroup of G if there is a finite chain of subgroups of the group, each one normal in the next, beginning at H and ending at G. In notation, is -subnormal in if there are subgroups of such that is normal in for each . A subnormal subgroup is a subgroup that is -subnormal for some positive integer . Some facts about subnormal subgroups: A 1-subnormal subgroup is a proper normal subgroup (and vice versa).
Supersolvable group
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. Let G be a group. G is supersolvable if there exists a normal series such that each quotient group is cyclic and each is normal in . 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 be normal in .
Complemented lattice
In the mathematical discipline of order theory, a complemented lattice is a bounded lattice (with least element 0 and greatest element 1), in which every element a has a complement, i.e. an element b satisfying a ∨ b = 1 and a ∧ b = 0. Complements need not be unique. A relatively complemented lattice is a lattice such that every interval [c, d], viewed as a bounded lattice in its own right, is a complemented lattice. An orthocomplementation on a complemented lattice is an involution that is order-reversing and maps each element to a complement.
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.
Isomorphism theorems
In mathematics, specifically abstract algebra, the isomorphism theorems (also known as Noether's isomorphism theorems) are theorems that describe the relationship between quotients, homomorphisms, and subobjects. Versions of the theorems exist for groups, rings, vector spaces, modules, Lie algebras, and various other algebraic structures. In universal algebra, the isomorphism theorems can be generalized to the context of algebras and congruences.
Trivial group
In mathematics, a trivial group or zero group is a group consisting of a single element. All such groups are isomorphic, so one often speaks of the trivial group. The single element of the trivial group is the identity element and so it is usually denoted as such: or depending on the context. If the group operation is denoted then it is defined by The similarly defined is also a group since its only element is its own inverse, and is hence the same as the trivial group.
Divisor
In mathematics, a divisor of an integer , also called a factor of , is an integer that may be multiplied by some integer to produce . In this case, one also says that is a multiple of An integer is divisible or evenly divisible by another integer if is a divisor of ; this implies dividing by leaves no remainder. An integer n is divisible by a nonzero integer m if there exists an integer k such that . This is written as Other ways of saying the same thing are that m divides n, m is a divisor of n, m is a factor of n, and n is a multiple of m.