Contranormal subgroup

Last updated

In mathematics, in the field of group theory, a contranormal subgroup is a subgroup whose normal closure in the group is the whole group. [1] Clearly, a contranormal subgroup can be normal only if it is the whole group.

Some facts:

Related Research Articles

<span class="mw-page-title-main">Abelian group</span> Commutative group (mathematics)

In mathematics, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, the group operation is commutative. With addition as an operation, the integers and the real numbers form abelian groups, and the concept of an abelian group may be viewed as a generalization of these examples. Abelian groups are named after early 19th century mathematician Niels Henrik Abel.

<span class="texhtml mvar" style="font-style:italic;">p</span>-group Group in which the order of every element is a power of p

In mathematics, specifically group theory, given a prime number p, a p-group is a group in which the order of every element is a power of p. That is, for each element g of a p-group G, there exists a nonnegative integer n such that the product of pn copies of g, and not fewer, is equal to the identity element. The orders of different elements may be different powers of p.

<span class="mw-page-title-main">Subgroup</span> Subset of a group that forms a group itself

In group theory, a branch of mathematics, given a group G under a binary operation ∗, a subset H of G is called a subgroup of G if H also forms a group under the operation ∗. More precisely, H is a subgroup of G if the restriction of ∗ to H × H is a group operation on H. This is often denoted HG, read as "H is a subgroup of G".

<span class="mw-page-title-main">Simple group</span> Group without normal subgroups other than the trivial group and itself

In mathematics, a simple group is a nontrivial group whose only normal subgroups are the trivial group and the group itself. A group that is not simple can be broken into two smaller groups, namely a nontrivial normal subgroup and the corresponding quotient group. This process can be repeated, and for finite groups one eventually arrives at uniquely determined simple groups, by the Jordan–Hölder theorem.

<span class="mw-page-title-main">Cyclic group</span> Mathematical group that can be generated as the set of powers of a single element

In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted Cn, 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.

<span class="mw-page-title-main">Sylow theorems</span> Theorems that help decompose a finite group based on prime factors of its order

In mathematics, specifically in the field of finite group theory, the Sylow theorems are a collection of theorems named after the Norwegian mathematician Peter Ludwig Sylow that give detailed information about the number of subgroups of fixed order that a given finite group contains. The Sylow theorems form a fundamental part of finite group theory and have very important applications in the classification of finite simple groups.

<span class="mw-page-title-main">Generating set of a group</span> Abstract algebra concept

In abstract algebra, a generating set of a group is a subset of the group set such that every element of the group can be expressed as a combination of finitely many elements of the subset and their inverses.

<span class="mw-page-title-main">Nilpotent group</span> Group that has an upper central series terminating with G

In mathematics, specifically group theory, a nilpotent groupG 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 {1}.

<span class="mw-page-title-main">Burnside problem</span> If G is a finitely generated group with exponent n, is G necessarily finite?

The Burnside problem asks whether a finitely generated group in which every element has finite order must necessarily be a finite group. It was posed by William Burnside in 1902, making it one of the oldest questions in group theory and was influential in the development of combinatorial group theory. It is known to have a negative answer in general, as Evgeny Golod and Igor Shafarevich provided a counter-example in 1964. The problem has many refinements and variants that differ in the additional conditions imposed on the orders of the group elements, some of which are still open questions.

<span class="mw-page-title-main">Glossary of group theory</span>

A group is a set together with an associative operation which admits an identity element and such that every element has an inverse.

<span class="mw-page-title-main">Discrete group</span>

In mathematics, a topological group G is called a discrete group if there is no limit point in it. Equivalently, the group G is discrete if and only if its identity is isolated.

In group theory, a branch of mathematics, a core is any of certain special normal subgroups of a group. The two most common types are the normal core of a subgroup and the p-core of a group.

<span class="mw-page-title-main">Finitely generated group</span>

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 of finitely many elements of S and of inverses of such elements.

In mathematics, especially in the area of algebra known as group theory, the Fitting subgroupF of a finite group G, named after Hans Fitting, is the unique largest normal nilpotent subgroup of G. Intuitively, it represents the smallest subgroup which "controls" the structure of G when G is solvable. When G is not solvable, a similar role is played by the generalized Fitting subgroupF*, which is generated by the Fitting subgroup and the components of G.

<span class="mw-page-title-main">Frobenius group</span>

In mathematics, a Frobenius group is a transitive permutation group on a finite set, such that no non-trivial element fixes more than one point and some non-trivial element fixes a point. They are named after F. G. Frobenius.

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 mathematics, specifically group theory, an abnormal subgroup is a subgroup H of a group G such that for all x in G, x lies in the subgroup generated by H and Hx, where Hx denotes the conjugate subgroup xHx−1.

In mathematics, a group is supersolvable if it has an invariant normal series where all the factors are cyclic groups. Supersolvability is stronger than the notion of solvability.

In mathematics, specifically in the area of algebra known as group theory, the Fitting length measures how far a solvable group is from being nilpotent. The concept is named after Hans Fitting, due to his investigations of nilpotent normal subgroups.

In mathematical group theory, a normal p-complement of a finite group for a prime p is a normal subgroup of order coprime to p and index a power of p. In other words the group is a semidirect product of the normal p-complement and any Sylow p-subgroup. A group is called p-nilpotent if it has a normal p-complement.

References

  1. Rose 1968 , p. 97

Bibliography