Concept

Théorème de densité de Tchebotariov

Chebotarev's density theorem in algebraic number theory describes statistically the splitting of primes in a given Galois extension K of the field of rational numbers. Generally speaking, a prime integer will factor into several ideal primes in the ring of algebraic integers of K. There are only finitely many patterns of splitting that may occur. Although the full description of the splitting of every prime p in a general Galois extension is a major unsolved problem, the Chebotarev density theorem says that the frequency of the occurrence of a given pattern, for all primes p less than a large integer N, tends to a certain limit as N goes to infinity. It was proved by Nikolai Chebotaryov in his thesis in 1922, published in . A special case that is easier to state says that if K is an algebraic number field which is a Galois extension of of degree n, then the prime numbers that completely split in K have density 1/n among all primes. More generally, splitting behavior can be specified by assigning to (almost) every prime number an invariant, its Frobenius element, which is a representative of a well-defined conjugacy class in the Galois group Gal(K/Q). Then the theorem says that the asymptotic distribution of these invariants is uniform over the group, so that a conjugacy class with k elements occurs with frequency asymptotic to k/n. When Carl Friedrich Gauss first introduced the notion of complex integers Z[i], he observed that the ordinary prime numbers may factor further in this new set of integers. In fact, if a prime p is congruent to 1 mod 4, then it factors into a product of two distinct prime gaussian integers, or "splits completely"; if p is congruent to 3 mod 4, then it remains prime, or is "inert"; and if p is 2 then it becomes a product of the square of the prime (1+i) and the invertible gaussian integer -i; we say that 2 "ramifies". For instance, splits completely; is inert; ramifies. From this description, it appears that as one considers larger and larger primes, the frequency of a prime splitting completely approaches 1/2, and likewise for the primes that remain primes in Z[i].

À 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.