Partial isometry

From formulasearchengine
Revision as of 15:08, 23 January 2014 by en>Noix07
Jump to navigation Jump to search

In mathematics, the Bell series is a formal power series used to study properties of arithmetical functions. Bell series were introduced and developed by Eric Temple Bell.

Given an arithmetic function f and a prime p, define the formal power series fp(x), called the Bell series of f modulo p as:

fp(x)=n=0f(pn)xn.

Two multiplicative functions can be shown to be identical if all of their Bell series are equal; this is sometimes called the uniqueness theorem. Given multiplicative functions f and g, one has f=g if and only if:

fp(x)=gp(x) for all primes p.

Two series may be multiplied (sometimes called the multiplication theorem): For any two arithmetic functions f and g, let h=f*g be their Dirichlet convolution. Then for every prime p, one has:

hp(x)=fp(x)gp(x).

In particular, this makes it trivial to find the Bell series of a Dirichlet inverse.

If f is completely multiplicative, then:

fp(x)=11f(p)x.

Examples

The following is a table of the Bell series of well-known arithmetic functions.

See also

References