Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Chebotarev density theorem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{short description|Describes statistically the splitting of primes in a given Galois extension of Q}} The '''Chebotarev density theorem''' in [[algebraic number theory]] describes statistically the splitting of [[prime number|primes]] in a given [[Galois extension]] ''K'' of the field <math>\mathbb{Q}</math> of [[rational number]]s. Generally speaking, a prime integer will factor into several [[Ideal number|ideal primes]] in the ring of [[algebraic integer]]s 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 {{harv|Tschebotareff|1926}}. A special case that is easier to state says that if ''K'' is an [[algebraic number field]] which is a Galois extension of <math>\mathbb{Q}</math> 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''.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)