Prime ideal theorem

Prime ideal theorem

In mathematics, the prime ideal theorem may be

* the Boolean prime ideal theorem
* the Landau prime ideal theorem on number fields


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Boolean prime ideal theorem — In mathematics, a prime ideal theorem guarantees the existence of certain types of subsets in a given abstract algebra. A common example is the Boolean prime ideal theorem, which states that ideals in a Boolean algebra can be extended to prime… …   Wikipedia

  • Landau prime ideal theorem — In mathematics, the prime ideal theorem of algebraic number theory is the number field generalization of the prime number theorem. It provides an asymptotic formula for counting the number of prime ideals of a number field K , with norm at most X …   Wikipedia

  • Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… …   Wikipedia

  • Prime ideal — In mathematics, a prime ideal is a subset of a ring which shares many important properties of a prime number in the ring of integers. This article only covers ideals of ring theory. Prime ideals in order theory are treated in the article on… …   Wikipedia

  • Ideal (ring theory) — In ring theory, a branch of abstract algebra, an ideal is a special subset of a ring. The ideal concept allows the generalization in an appropriate way of some important properties of integers like even number or multiple of 3 . For instance, in… …   Wikipedia

  • Ideal (order theory) — In mathematical order theory, an ideal is a special subset of a partially ordered set (poset). Although this term historically was derived from the notion of a ring ideal of abstract algebra, it has subsequently been generalized to a different… …   Wikipedia

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

  • Prime geodesic — In mathematics, a prime geodesic on a hyperbolic surface is a primitive closed geodesic, i.e. a geodesic which is a closed curve that traces out its image exactly once. Such geodesics are called prime geodesics because, among other things, they… …   Wikipedia

  • Stone's representation theorem for Boolean algebras — In mathematics, Stone s representation theorem for Boolean algebras states that every Boolean algebra is isomorphic to a field of sets. The theorem is fundamental to the deeper understanding of Boolean algebra that emerged in the first half of… …   Wikipedia

  • Original proof of Gödel's completeness theorem — The proof of Gödel s completeness theorem given by Kurt Gödel in his doctoral dissertation of 1929 (and a rewritten version of the dissertation, published as an article in 1930) is not easy to read today; it uses concepts and formalism that are… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”