PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
[parent] Hermite's theorem (Corollary)

The following is a corollary of Minkowski's theorem on ideal classes, which is a corollary of Minkowski's theorem on lattices.

Definition 1   Let $S=\{p_1,\ldots,p_r\}$ be a set of rational primes $p_i \in \Ints$ . We say that a number field $K$ is unramified outside $S$ if any prime not in $S$ is unramified in $K$ . In other words, if $p$ is ramified in $K$ , then $p\in S$ . In other words, the only primes that divide the discriminant of $K$ are elements of $S$ .
Corollary 1 (Hermite's Theorem)   Let $S=\{p_1,\ldots,p_r\}$ be a set of rational primes $p_i \in \Ints$ and let $N\in \Nats$ be arbitrary. There is only a finite number of fields $K$ which are unramified outside $S$ and bounded degree $[K:\Rats]\leq N$ .




"Hermite's theorem" is owned by alozano.
(view preamble | get metadata)

View style:

Also defines:  unramified outside a set of primes

This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: degree, bounded, fields, number, finite, theorem, discriminant, divide, prime, unramified, number field, rational primes, Minkowski's theorem, Minkowski's theorem on ideal classes
There is 1 reference to this entry.

This is version 2 of Hermite's theorem, born on 2005-02-24, modified 2006-09-26.
Object id is 6820, canonical name is HermitesTheorem.
Accessed 2969 times total.

Classification:
AMS MSC11H06 (Number theory :: Geometry of numbers :: Lattices and convex bodies)
 11R29 (Number theory :: Algebraic number theory: global fields :: Class numbers, class groups, discriminants)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)