Partial isometry: Difference between revisions
en>John of Reading m Typo and General fixing, replaced: concides → coincides using AWB |
en>Noix07 No edit summary |
||
Line 1: | Line 1: | ||
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]] <math>f</math> and a [[Prime number|prime]] <math>p</math>, define the formal power series <math>f_p(x)</math>, called the Bell series of <math>f</math> modulo <math>p</math> as: | |||
:<math>f_p(x)=\sum_{n=0}^\infty f(p^n)x^n.</math> | |||
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 function]]s <math>f</math> and <math>g</math>, one has <math>f=g</math> [[if and only if]]: | |||
:<math>f_p(x)=g_p(x)</math> for all primes <math>p</math>. | |||
Two series may be multiplied (sometimes called the ''multiplication theorem''): For any two [[arithmetic function]]s <math>f</math> and <math>g</math>, let <math>h=f*g</math> be their [[Dirichlet convolution]]. Then for every prime <math>p</math>, one has: | |||
:<math>h_p(x)=f_p(x) g_p(x).\,</math> | |||
In particular, this makes it trivial to find the Bell series of a [[Dirichlet convolution|Dirichlet inverse]]. | |||
If <math>f</math> is [[completely multiplicative]], then: | |||
:<math>f_p(x)=\frac{1}{1-f(p)x}.</math> | |||
==Examples== | |||
The following is a table of the Bell series of well-known arithmetic functions. | |||
* The [[Möbius function]] <math>\mu</math> has <math>\mu_p(x)=1-x.</math> | |||
* [[Eulers phi function|Euler's Totient]] <math>\varphi</math> has <math>\varphi_p(x)=\frac{1-x}{1-px}.</math> | |||
* The multiplicative identity of the [[Dirichlet convolution]] <math>\delta</math> has <math>\delta_p(x)=1.</math> | |||
* The [[Liouville function]] <math>\lambda</math> has <math>\lambda_p(x)=\frac{1}{1+x}.</math> | |||
* The power function Id<sub>k</sub> has <math>(\textrm{Id}_k)_p(x)=\frac{1}{1-p^kx}.</math> Here, Id<sub>k</sub> is the completely multiplicative function <math>\operatorname{Id}_k(n)=n^k</math>. | |||
* The [[divisor function]] <math>\sigma_k</math> has <math>(\sigma_k)_p(x)=\frac{1}{1-(1+p^k) x+p^kx^2}.</math> | |||
==See also== | |||
* [[Bell numbers]] | |||
==References== | |||
* {{Apostol IANT}} | |||
[[Category:Arithmetic functions]] | |||
[[Category:Mathematical series]] |
Revision as of 15:08, 23 January 2014
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 and a prime , define the formal power series , called the Bell series of modulo as:
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 and , one has if and only if:
Two series may be multiplied (sometimes called the multiplication theorem): For any two arithmetic functions and , let be their Dirichlet convolution. Then for every prime , one has:
In particular, this makes it trivial to find the Bell series of a Dirichlet inverse.
If is completely multiplicative, then:
Examples
The following is a table of the Bell series of well-known arithmetic functions.
- The Möbius function has
- Euler's Totient has
- The multiplicative identity of the Dirichlet convolution has
- The Liouville function has
- The power function Idk has Here, Idk is the completely multiplicative function .
- The divisor function has