Abstract analytic number theory

From Wikipedia, the free encyclopedia

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 John Knopfmacher in the early 1970s.

1 Arithmetical semigroups
2 Examples
3 Methods and techniques
4 Reference

[edit] Arithmetical semigroups

The fundamental notion involved is that of an arithmetical 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 p_i 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 $| |$ on G such that

$| 1 | = 1$
$|p| > 1 \mbox{ for all } p \in P$
$|ab| = |a| |b| \mbox{ for all } a,b \in G$
The total number $N G (x)$ of elements $a \in G$ of norm $|a| \leq x$ is finite, for each real $x > 0$ .

[edit] Examples

The prototypical example of an arithmetical 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 O_K of K forms an arithmetical semigroup with identity element O_K and the norm of an ideal I is given by the cardinality of the quotient ring O_K/I. In this case, the appropriate generalisation of the prime number theorem is the Landau prime ideal theorem, (not to be confused with the Boolean prime ideal theorem) which describes the asymptotic distribution of the ideals in O_K.
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.
- The category of all finite abelian groups under the usual direct product operation and norm mapping $| A | = card(A)$ . The indecomposable objects are the cyclic groups of prime power order.
- The category of all compact simply-connected globally symmetric Riemannian manifolds under the Riemannian product of manifolds and norm mapping $| M | = c dim M$ , where c > 1 is fixed, and dim M denotes the manifold dimension of M. The indecomposable objects are the compact simply-connected irreducible symmetric spaces.
- The category of all pseudometrisable finite topological spaces under the topological sum and norm mapping $| X | = 2 card(X)$ . The indecomposable objects are the connected spaces.

[edit] Methods and techniques

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 arithmetical 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 $δ$ , and a constant $ν$ with $0 \le \nu < \delta$ , such that $N_G(x) = Ax^{\delta} + O(x^{\nu}) \mbox { as } x \rightarrow \infin.$

For any arithmetical semigroup which satisfies Axiom A, we have the following abstract prime number theorem:

$\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.

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.