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. Given a finite group G, the Sylow theorems guarantee the existence of a subgroup of G of order pn for every prime power pn that divides the order of G. Every finite p-group is nilpotent. The remainder of this article deals with finite p-groups. For an example of an infinite abelian p-group, see Prüfer group, and for an example of an infinite simple p-group, see Tarski monster group. Every p-group is periodic since by definition every element has finite order. If p is prime and G is a group of order pk, then G has a normal subgroup of order pm for every 1 ≤ m ≤ k. This follows by induction, using Cauchy's theorem and the Correspondence Theorem for groups. A proof sketch is as follows: because the center Z of G is non-trivial (see below), according to Cauchy's theorem Z has a subgroup H of order p. Being central in G, H is necessarily normal in G. We may now apply the inductive hypothesis to G/H, and the result follows from the Correspondence Theorem. One of the first standard results using the class equation is that the center of a non-trivial finite p-group cannot be the trivial subgroup. This forms the basis for many inductive methods in p-groups. For instance, the normalizer N of a proper subgroup H of a finite p-group G properly contains H, because for any counterexample with H = N, the center Z is contained in N, and so also in H, but then there is a smaller example H/Z whose normalizer in G/Z is N/Z = H/Z, creating an infinite descent. As a corollary, every finite p-group is nilpotent.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.