Concept

Solvable group

Related concepts (30)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Lattice of subgroups

In mathematics, the lattice of subgroups of a group is the lattice whose elements are the subgroups of , 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. 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.

Dicyclic group

In group theory, a dicyclic group (notation Dicn or Q4n, ) is a particular kind of non-abelian group of order 4n (n > 1). It is an extension of the cyclic group of order 2 by a cyclic group of order 2n, giving the name di-cyclic. In the notation of exact sequences of groups, this extension can be expressed as: More generally, given any finite abelian group with an order-2 element, one can define a dicyclic group.

Polycyclic group

In mathematics, a polycyclic group is a solvable group that satisfies the maximal condition on subgroups (that is, every subgroup is finitely generated). Polycyclic groups are finitely presented, which makes them interesting from a computational point of view. Equivalently, a group G is polycyclic if and only if it admits a subnormal series with cyclic factors, that is a finite set of subgroups, let's say G0, ...

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 .

Fundamental theorem of Galois theory

In mathematics, the fundamental theorem of Galois theory is a result that describes the structure of certain types of field extensions in relation to groups. It was proved by Évariste Galois in his development of Galois theory. In its most basic form, the theorem asserts that given a field extension E/F that is finite and Galois, there is a one-to-one correspondence between its intermediate fields and subgroups of its Galois group. (Intermediate fields are fields K satisfying F ⊆ K ⊆ E; they are also called subextensions of E/F.

Burnside's theorem

In mathematics, Burnside's theorem in group theory states that if G is a finite group of order where p and q are prime numbers, and a and b are non-negative integers, then G is solvable. Hence each non-Abelian finite simple group has order divisible by at least three distinct primes. The theorem was proved by using the representation theory of finite groups. Several special cases of the theorem had previously been proved by Burnside, Jordan, and Frobenius.

Cauchy's theorem (group theory)

In mathematics, specifically group theory, Cauchy's theorem states that if G is a finite group and p is a prime number dividing the order of G (the number of elements in G), then G contains an element of order p. That is, there is x in G such that p is the smallest positive integer with xp = e, where e is the identity element of G. It is named after Augustin-Louis Cauchy, who discovered it in 1845. The theorem is related to Lagrange's theorem, which states that the order of any subgroup of a finite group G divides the order of G.

Composition series

In abstract algebra, a composition series provides a way to break up an algebraic structure, such as a group or a module, into simple pieces. The need for considering composition series in the context of modules arises from the fact that many naturally occurring modules are not semisimple, hence cannot be decomposed into a direct sum of simple modules. A composition series of a module M is a finite increasing filtration of M by submodules such that the successive quotients are simple and serves as a replacement of the direct sum decomposition of M into its simple constituents.

Central series

In mathematics, especially in the fields of group theory and Lie theory, a central series is a kind of normal series of subgroups or Lie subalgebras, expressing the idea that the commutator is nearly trivial. For groups, the existence of a central series means it is a nilpotent group; for matrix rings (considered as Lie algebras), it means that in some basis the ring consists entirely of upper triangular matrices with constant diagonal. This article uses the language of group theory; analogous terms are used for Lie algebras.

Core (group theory)

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. For a group G, the normal core or normal interior of a subgroup H is the largest normal subgroup of G that is contained in H (or equivalently, the intersection of the conjugates of H). More generally, the core of H with respect to a subset S ⊆ G is the intersection of the conjugates of H under S, i.e.