Abstract analytic number theory

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Abstract analytic number theory is a branch of mathematics which takes the ideas and techniques of classical analytic number theory and applies them to a variety of different mathematical fields. The classical prime number theorem serves as a prototypical example, and the emphasis is on abstract asymptotic distribution results. The theory was invented and developed by mathematicians such as John Knopfmacher and Arne Beurling in the twentieth century.

Arithmetic semigroups[edit]

The fundamental notion involved is that of an arithmetic semigroup, which is a commutative monoid G satisfying the following properties:

  • There exists a countable subset (finite or countably infinite) P of G, such that every element a ≠ 1 in G has a unique factorisation of the form
a = p_1^{\alpha_1} p_2^{\alpha_2} \cdots p_r^{\alpha_r}
where the pi are distinct elements of P, the αi are positive integers, r may depend on a, and two factorisations are considered the same if they differ only by the order of the factors indicated. The elements of P are called the primes of G.
  • There exists a real-valued norm mapping |\mbox{ }| on G such that
    1. |1| = 1
    2. |p| > 1 \mbox{ for all } p \in P
    3. |ab| = |a| |b| \mbox{ for all } a,b \in G
    4. The total number N_G(x) of elements a \in G of norm |a| \leq x is finite, for each real x > 0.

Additive number systems[edit]

"Additive number system" redirects here. For food additive numbering, see E number.

An additive number system is an arithmetic semigroup in which the underlying monoid G is free abelian. The norm function may be written additively.[1]

If the norm is integer-valued, we associate counting functions a(n) and p(n) with G where p counts the number of elements of P of norm n, and a counts the number of elements of G of norm n. We let A(x) and P(x) be the corresponding formal power series. We have the fundamental identity[2]

A(x) = \sum_n a(n) x^n = \prod_n (1-x^n)^{-p(n)} \

which formally encodes the unique expression of each element of G as a product of elements of P. The radius of convergence of G is the radius of convergence of the power series A(x).[3]

The fundamental identity has the alternative form[4]

A(x) = \exp\left({ \sum_{m \ge 1} \frac{P(x^m)}{m} }\right) \ .


  • The prototypical example of an arithmetic semigroup is the multiplicative semigroup of positive integers G = Z+ = {1, 2, 3, ...}, with subset of rational primes P = {2, 3, 5, ...}. Here, the norm of an integer is simply |n| = n, so that N_G(x) = \lfloor x \rfloor, the greatest integer not exceeding x.
  • If K is an algebraic number field, i.e. a finite extension of the field of rational numbers Q, then the set G of all nonzero ideals in the ring of integers OK of K forms an arithmetic semigroup with identity element OK and the norm of an ideal I is given by the cardinality of the quotient ring OK/I. In this case, the appropriate generalisation of the prime number theorem is the Landau prime ideal theorem, which describes the asymptotic distribution of the ideals in OK.
  • Various arithmetical categories which satisfy a theorem of Krull-Schmidt type can be considered. In all these cases, the elements of G are isomorphism classes in an appropriate category, and P consists of all isomorphism classes of indecomposable objects, i.e. objects which cannot be decomposed as a direct product of nonzero objects. Some typical examples are the following.

Methods and techniques[edit]

The use of arithmetic functions and zeta functions is extensive. The idea is to extend the various arguments and techniques of arithmetic functions and zeta functions in classical analytic number theory to the context of an arbitrary arithmetic semigroup which may satisfy one or more additional axioms. Such a typical axiom is the following, usually called "Axiom A" in the literature:

  • Axiom A. There exist positive constants A and \delta, and a constant \nu with 0 \le \nu < \delta, such that N_G(x) = Ax^{\delta} + O(x^{\nu}) \mbox { as } x \rightarrow \infin.[5]

For any arithmetic semigroup which satisfies Axiom A, we have the following abstract prime number theorem:[6]

\pi_G(x) \sim \frac{x^{\delta}}{\delta \log x} \mbox { as } x \rightarrow \infin

where πG(x) = total number of elements p in P of norm |p| ≤ x.

Arithmetical formation[edit]

The notion of arithmetical formation provides a generalisation of the ideal class group in algebraic number theory and allows for abstract asymptotic distribution results under constraints. In the case of number fields, for example, this is Chebotarev's density theorem. An arithmetical formation is an arithmetic semigroup G with an equivalence relation ≡ such that the quotient G/≡ is a finite abelian group A. This quotient is the class group of the formation and the equivalence classes are generalised arithmetic progressions or generalised ideal classes. If χ is a character of A then we can define a Dirichlet series

 \sum_{g \in G} \chi([g]) |g|^{-s}

which provides a notion of zeta function for arithmetical semigroup.[7]

See also[edit]


  1. ^ Burris (2001) p.20
  2. ^ Burris (2001) p.26
  3. ^ Burris (2001) p.31
  4. ^ Burris (2001) p.34
  5. ^ Knopfmacher (1990) p.75
  6. ^ Knopfmacher (1990) p.154
  7. ^ Knopfmacher (1990) pp.250–264