Sylow theorems | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

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. For a prime number , a Sylow p-subgroup (sometimes p-Sylow subgroup) of a group is a maximal -subgroup of , i.e., a subgroup of that is a p-group (meaning its cardinality is a power of or equivalently, the order of every group element is a power of ) that is not a proper subgroup of any other -subgroup of . The set of all Sylow -subgroups for a given prime is sometimes written . The Sylow theorems assert a partial converse to Lagrange's theorem. Lagrange's theorem states that for any finite group the order (number of elements) of every subgroup of divides the order of . The Sylow theorems state that for every prime factor of the order of a finite group , there exists a Sylow -subgroup of of order , the highest power of that divides the order of . Moreover, every subgroup of order is a Sylow -subgroup of , and the Sylow -subgroups of a group (for a given prime ) are conjugate to each other. Furthermore, the number of Sylow -subgroups of a group for a given prime is congruent to 1 (mod ). The Sylow theorems are a powerful statement about the structure of groups in general, but are also powerful in applications of finite group theory. This is because they give a method for using the prime decomposition of the cardinality of a finite group to give statements about the structure of its subgroups: essentially, it gives a technique to transport basic number-theoretic information about a group to its group structure. From this observation, classifying finite groups becomes a game of finding which combinations/constructions of groups of smaller order can be applied to construct a group.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (3)

Related people (1)

Related concepts (44)

Related courses (14)

Related lectures (107)

MATH-506: Topology IV.b - cohomology rings

Singular cohomology is defined by dualizing the singular chain complex for spaces. We will study its basic properties, see how it acquires a multiplicative structure and becomes a graded commutative a

MATH-310: Algebra

Study basic concepts of modern algebra: groups, rings, fields.

MATH-211: Group Theory

Après une introduction à la théorie des catégories, nous appliquerons la théorie générale au cas particulier des groupes, ce qui nous permettra de bien mettre en perspective des notions telles que quo

Let G be a finite group and R be a commutative ring. The Mackey algebra μR(G) shares a lot of properties with the group algebra RG however, there are some differences. For example, the group algebra i

Elsevier2015

This dissertation is concerned with modular representation theory of finite groups, and more precisely, with the study of classes of representations, which we shall term relative endotrivial modules.

EPFL2012

Actions de relations d'équivalence sur les champs d'espaces métriques CAT(0)

Philippe Paul Antoine Henry

This work is dedicated to the study of Borel equivalence relations acting on Borel fields of CAT(0) metric spaces over a standard probability space. In this new framework we get similar results to som

EPFL2010

In abstract algebra, a finite group is a group whose underlying set is finite. Finite groups often arise when considering symmetry of mathematical or physical objects, when those objects admit just a finite number of structure-preserving transformations. Important examples of finite groups include cyclic groups and permutation groups. The study of finite groups has been an integral part of group theory since it arose in the 19th century.

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. Abelian p-groups are also called p-primary or simply primary. A finite group is a p-group if and only if its order (the number of its elements) is a power of p.

Abelian Groups: Fourth Property

Explores the fourth property of p-Sylow subgroups in abelian groups.

A Tool for Demonstrating Properties: Lemme 3.4

Focuses on demonstrating properties using Lemma 3.4 in group theory.

Properties of Sylow Subgroups

Covers the second and third properties of p-Sylow subgroups and their automorphisms.