Möbius function: Difference between revisions
en>Imaginatorium mNo edit summary |
en>Alu042 m fixed link to "Generalizations" |
||
Line 1: | Line 1: | ||
In [[mathematics]], the classic '''Möbius inversion formula''' was introduced into [[number theory]] during the 19th century by [[August Ferdinand Möbius]]. | |||
Other Möbius inversion formulas are obtained when different [[Locally finite poset|locally finite partially ordered set]]s replace the classic case of the natural numbers ordered by divisibility; for an account of those, see [[incidence algebra]]. | |||
==Statement of the formula== | |||
The classic version states that if ''g'' and ''f'' are [[arithmetic function]]s satisfying | |||
: <math>g(n)=\sum_{d\,\mid \,n}f(d)\quad\text{for every integer }n\ge 1</math> | |||
then | |||
:<math>f(n)=\sum_{d\,\mid\, n}\mu(d)g(n/d)\quad\text{for every integer }n\ge 1</math> | |||
where μ is the [[Möbius function]] and the sums extend over all positive [[divisor]]s ''d'' of ''n''. In effect, the original ''f''(''n'') can be determined given ''g''(''n'') by using the inversion formula. The two sequences are said to be [[Möbius transform]]s of each other. | |||
The formula is also correct if ''f'' and ''g'' are functions from the positive integers into some [[abelian group]] (viewed as a <math>\mathbb{Z}</math>-[[module (mathematics)|module]]). | |||
In the language of [[Dirichlet convolution]]s, the first formula may be written as | |||
:<math>g=f*1</math> | |||
where ''*'' denotes the Dirichlet convolution, and ''1'' is the [[constant function]] <math>1(n)=1</math>. The second formula is then written as | |||
:<math>f=\mu * g.</math> | |||
Many specific examples are given in the article on [[multiplicative function]]s. | |||
The theorem follows because ''*'' is (commutative and) associative, and 1''*''μ=''i'', where ''i'' is the identity function for the Dirichlet convolution, taking values ''i''(1)=1, ''i''(''n'')=0 for all ''n''>1. Thus μ''*g'' = μ''*''(1''*f'') = (μ''*''1)''*f'' = ''i*f'' = ''f''. | |||
==Repeated transformations== | |||
Given an arithmetic function, one can generate a bi-infinite sequence of other arithmetic functions by repeatedly applying the first summation. | |||
For example, if one starts with [[Euler's totient function]] <math>\varphi</math>, and repeatedly applies the transformation process, one obtains: | |||
#<math>\varphi</math> the totient function | |||
#<math>\varphi*1=\operatorname{Id}</math> where <math>\operatorname{Id}(n)=n</math> is the [[identity function]] | |||
#<math>\operatorname{Id} *1 =\sigma_1 =\sigma</math>, the [[divisor function]] | |||
If the starting function is the Möbius function itself, the list of functions is: | |||
#<math>\mu</math>, the Möbius function | |||
#<math>\mu*1 = \varepsilon</math> where <math>\varepsilon(n) = \begin{cases} 1, & \mbox{if }n=1 \\ 0, & \mbox{if }n>1 \end{cases} </math> is the [[unit function]] | |||
#<math>\varepsilon*1 = 1 </math>, the [[constant function]] | |||
#<math>1*1=\sigma_0=\operatorname{d}=\tau</math>, where <math>\operatorname{d}=\tau</math> is the number of divisors of ''n'', (see [[divisor function]]). | |||
Both of these lists of functions extend infinitely in both directions. The Möbius inversion formula enables these lists to be traversed backwards. The generated sequences can perhaps be more easily understood by considering the corresponding [[Dirichlet series]]: each repeated application of the transform corresponds to multiplication by the [[Riemann zeta function]]. | |||
==Generalizations== | |||
{{See also|Incidence algebra}} | |||
A related inversion formula more useful in [[combinatorics]] is as follows: suppose ''F''(''x'') and ''G''(''x'') are [[complex number|complex]]-valued [[function (mathematics)|function]]s defined on the [[interval (mathematics)|interval]] <nowiki>[1,∞)</nowiki> such that | |||
:<math>G(x) = \sum_{1 \le n \le x}F(x/n)\quad\mbox{ for all }x\ge 1</math> | |||
then | |||
:<math>F(x) = \sum_{1 \le n \le x}\mu(n)G(x/n)\quad\mbox{ for all }x\ge 1.</math> | |||
Here the sums extend over all positive integers ''n'' which are less than or equal to ''x''. | |||
This in turn is a special case of a more general form. If <math>\alpha(n)</math> is an [[arithmetic function]] possessing a [[Dirichlet inverse]] <math>\alpha^{-1}(n)</math>, then if one defines | |||
:<math>G(x) = \sum_{1 \le n \le x}\alpha (n) F(x/n)\quad\mbox{ for all }x\ge 1</math> | |||
then | |||
:<math>F(x) = \sum_{1 \le n \le x}\alpha^{-1}(n)G(x/n)\quad\mbox{ for all }x\ge 1.</math> | |||
The previous formula arises in the special case of the constant function <math>\alpha(n)=1</math>, whose [[Dirichlet inverse]] is <math>\alpha^{-1}(n)=\mu(n)</math>. | |||
A particular application of the first of these extensions arises if we have (complex-valued) functions ''f''(''n'') and ''g''(''n'') defined on the positive integers, with | |||
:<math>g(n) = \sum_{1 \le m \le n}f\left(\left\lfloor \frac{n}{m}\right\rfloor\right)\quad\mbox{ for all } n\ge 1.</math> | |||
By defining <math>F(x) = f(\lfloor x\rfloor)</math> and <math>G(x) = g(\lfloor x\rfloor)</math>, we deduce that | |||
:<math>f(n) = \sum_{1 \le m \le n}\mu(m)g\left(\left\lfloor \frac{n}{m}\right\rfloor\right)\quad\mbox{ for all } n\ge 1.</math> | |||
A simple example of the use of this formula is counting the number of [[reduced fraction]]s 0 < ''a''/''b'' < 1, where ''a'' and ''b'' are coprime and ''b''≤''n''. If we let ''f''(''n'') be this number, then ''g''(''n'') is the total number of fractions 0 < ''a''/''b'' < 1 with ''b''≤''n'', where ''a'' and ''b'' are not necessarily coprime. (This is because every fraction ''a''/''b'' with gcd(''a'',''b'') = ''d'' and ''b''≤''n'' can be reduced to the fraction (''a''/''d'')/(''b''/''d'') with ''b''/''d'' ≤ ''n''/''d'', and vice versa.) Here it is straightforward to determine ''g''(''n'') = ''n''(''n''-1)/2, but ''f''(''n'') is harder to compute. | |||
Another inversion formula is (where we assume that the series involved are absolutely convergent): | |||
:<math>g(x) = \sum_{m=1}^\infty \frac{f(mx)}{m^s}\quad\mbox{ for all } x\ge 1\quad\Longleftrightarrow\quad | |||
f(x) = \sum_{m=1}^\infty \mu(m)\frac{g(mx)}{m^s}\quad\mbox{ for all } x\ge 1.</math> | |||
As above, this generalises to the case where <math>\alpha(n)</math> is an arithmetic function possessing a Dirichlet inverse <math>\alpha^{-1}(n)</math>: | |||
:<math>g(x) = \sum_{m=1}^\infty \alpha(m)\frac{f(mx)}{m^s}\quad\mbox{ for all } x\ge 1\quad\Longleftrightarrow\quad | |||
f(x) = \sum_{m=1}^\infty \alpha^{-1}(m)\frac{g(mx)}{m^s}\quad\mbox{ for all } x\ge 1.</math> | |||
==Multiplicative notation== | |||
As Möbius inversion applies to any abelian group, it makes no difference whether the group operation is written as addition or as multiplication. This gives rise to the following notational variant of the inversion formula: | |||
: <math> | |||
\mbox{If } F(n) = \prod_{d|n} f(d),\mbox{ then } f(n) = \prod_{d|n} F(n/d)^{\mu(d)}. \, | |||
</math> | |||
==Proofs of generalizations== | |||
The first generalization can be proved as follows. We use Iverson's convention that [condition] is the indicator function of the condition, being 1 if the condition is true and 0 if false. We use the result that <math>\sum_{d|n}\mu(d)=i(n)</math>, that is, 1*μ=''i''. | |||
We have the following: | |||
<math>\begin{align} | |||
\sum_{1\le n\le x}\mu(n)g\left(\frac{x}{n}\right) | |||
&= \sum_{1\le n\le x} \mu(n) \sum_{1\le m\le x/n} f\left(\frac{x}{mn}\right)\\ | |||
&= \sum_{1\le n\le x} \mu(n) \sum_{1\le m\le x/n} \sum_{1\le r\le x} [r=mn] f\left(\frac{x}{r}\right)\\ | |||
&= \sum_{1\le r\le x} f\left(\frac{x}{r}\right) \sum_{1\le n\le x} \mu(n) \sum_{1\le m\le x/n} [m=r/n] \qquad\text{rearranging the summation order}\\ | |||
&= \sum_{1\le r\le x} f\left(\frac{x}{r}\right) \sum_{n|r} \mu(n) \\ | |||
&= \sum_{1\le r\le x} f\left(\frac{x}{r}\right) i(r) \\ | |||
&= f(x) \qquad\text{since }i(r)=0\text{ except when }r=1 | |||
\end{align}</math> | |||
The proof in the more general case where α(''n'') replaces 1 is essentially identical, as is the second generalisation. | |||
==See also== | |||
* [[Lambert series]] | |||
* [[Farey sequence]] | |||
==References== | |||
* {{Apostol IANT}} | |||
* {{SpringerEOM|id=M/m130180 |title=Möbius inversion |first=Joseph P.S. |last=Kung}} | |||
*K. Ireland, M. Rosen. ''A Classical Introduction to Modern Number Theory'', (1990) Springer-Verlag. | |||
{{reflist}} | |||
==External links== | |||
{{ProofWiki|id=Möbius_Inversion_Formula|title=Möbius Inversion Formula}} | |||
{{DEFAULTSORT:Mobius Inversion Formula}} | |||
[[Category:Arithmetic functions]] | |||
[[Category:Enumerative combinatorics]] | |||
[[Category:Order theory]] | |||
[[ru:Функция Мёбиуса#Обращение Мёбиуса]] |
Revision as of 16:02, 5 December 2013
In mathematics, the classic Möbius inversion formula was introduced into number theory during the 19th century by August Ferdinand Möbius.
Other Möbius inversion formulas are obtained when different locally finite partially ordered sets replace the classic case of the natural numbers ordered by divisibility; for an account of those, see incidence algebra.
Statement of the formula
The classic version states that if g and f are arithmetic functions satisfying
then
where μ is the Möbius function and the sums extend over all positive divisors d of n. In effect, the original f(n) can be determined given g(n) by using the inversion formula. The two sequences are said to be Möbius transforms of each other.
The formula is also correct if f and g are functions from the positive integers into some abelian group (viewed as a -module).
In the language of Dirichlet convolutions, the first formula may be written as
where * denotes the Dirichlet convolution, and 1 is the constant function . The second formula is then written as
Many specific examples are given in the article on multiplicative functions.
The theorem follows because * is (commutative and) associative, and 1*μ=i, where i is the identity function for the Dirichlet convolution, taking values i(1)=1, i(n)=0 for all n>1. Thus μ*g = μ*(1*f) = (μ*1)*f = i*f = f.
Repeated transformations
Given an arithmetic function, one can generate a bi-infinite sequence of other arithmetic functions by repeatedly applying the first summation.
For example, if one starts with Euler's totient function , and repeatedly applies the transformation process, one obtains:
- the totient function
- where is the identity function
- , the divisor function
If the starting function is the Möbius function itself, the list of functions is:
- , the Möbius function
- where is the unit function
- , the constant function
- , where is the number of divisors of n, (see divisor function).
Both of these lists of functions extend infinitely in both directions. The Möbius inversion formula enables these lists to be traversed backwards. The generated sequences can perhaps be more easily understood by considering the corresponding Dirichlet series: each repeated application of the transform corresponds to multiplication by the Riemann zeta function.
Generalizations
DTZ's public sale group in Singapore auctions all forms of residential, workplace and retail properties, outlets, homes, lodges, boarding homes, industrial buildings and development websites. Auctions are at present held as soon as a month.
We will not only get you a property at a rock-backside price but also in an space that you've got longed for. You simply must chill out back after giving us the accountability. We will assure you 100% satisfaction. Since we now have been working in the Singapore actual property market for a very long time, we know the place you may get the best property at the right price. You will also be extremely benefited by choosing us, as we may even let you know about the precise time to invest in the Singapore actual property market.
The Hexacube is offering new ec launch singapore business property for sale Singapore investors want to contemplate. Residents of the realm will likely appreciate that they'll customize the business area that they wish to purchase as properly. This venture represents one of the crucial expansive buildings offered in Singapore up to now. Many investors will possible want to try how they will customise the property that they do determine to buy by means of here. This location has offered folks the prospect that they should understand extra about how this course of can work as well.
Singapore has been beckoning to traders ever since the value of properties in Singapore started sky rocketing just a few years again. Many businesses have their places of work in Singapore and prefer to own their own workplace area within the country once they decide to have a everlasting office. Rentals in Singapore in the corporate sector can make sense for some time until a business has discovered a agency footing. Finding Commercial Property Singapore takes a variety of time and effort but might be very rewarding in the long term.
is changing into a rising pattern among Singaporeans as the standard of living is increasing over time and more Singaporeans have abundance of capital to invest on properties. Investing in the personal properties in Singapore I would like to applaud you for arising with such a book which covers the secrets and techniques and tips of among the profitable Singapore property buyers. I believe many novice investors will profit quite a bit from studying and making use of some of the tips shared by the gurus." – Woo Chee Hoe Special bonus for consumers of Secrets of Singapore Property Gurus Actually, I can't consider one other resource on the market that teaches you all the points above about Singapore property at such a low value. Can you? Condominium For Sale (D09) – Yong An Park For Lease
In 12 months 2013, c ommercial retails, shoebox residences and mass market properties continued to be the celebrities of the property market. Models are snapped up in report time and at document breaking prices. Builders are having fun with overwhelming demand and patrons need more. We feel that these segments of the property market are booming is a repercussion of the property cooling measures no.6 and no. 7. With additional buyer's stamp responsibility imposed on residential properties, buyers change their focus to commercial and industrial properties. I imagine every property purchasers need their property funding to understand in value.
A related inversion formula more useful in combinatorics is as follows: suppose F(x) and G(x) are complex-valued functions defined on the interval [1,∞) such that
then
Here the sums extend over all positive integers n which are less than or equal to x.
This in turn is a special case of a more general form. If is an arithmetic function possessing a Dirichlet inverse , then if one defines
then
The previous formula arises in the special case of the constant function , whose Dirichlet inverse is .
A particular application of the first of these extensions arises if we have (complex-valued) functions f(n) and g(n) defined on the positive integers, with
By defining and , we deduce that
A simple example of the use of this formula is counting the number of reduced fractions 0 < a/b < 1, where a and b are coprime and b≤n. If we let f(n) be this number, then g(n) is the total number of fractions 0 < a/b < 1 with b≤n, where a and b are not necessarily coprime. (This is because every fraction a/b with gcd(a,b) = d and b≤n can be reduced to the fraction (a/d)/(b/d) with b/d ≤ n/d, and vice versa.) Here it is straightforward to determine g(n) = n(n-1)/2, but f(n) is harder to compute.
Another inversion formula is (where we assume that the series involved are absolutely convergent):
As above, this generalises to the case where is an arithmetic function possessing a Dirichlet inverse :
Multiplicative notation
As Möbius inversion applies to any abelian group, it makes no difference whether the group operation is written as addition or as multiplication. This gives rise to the following notational variant of the inversion formula:
Proofs of generalizations
The first generalization can be proved as follows. We use Iverson's convention that [condition] is the indicator function of the condition, being 1 if the condition is true and 0 if false. We use the result that , that is, 1*μ=i.
We have the following:
The proof in the more general case where α(n) replaces 1 is essentially identical, as is the second generalisation.
See also
References
- Template:Apostol IANT
- 53 yrs old Fitter (Common ) Batterton from Carp, likes to spend some time kid advocate, property developers in singapore and handball. Completed a cruise liner experience that was comprised of passing by Gusuku Sites and Related Properties of the Kingdom of Ryukyu.
Here is my web page www.mtfgaming.com - K. Ireland, M. Rosen. A Classical Introduction to Modern Number Theory, (1990) Springer-Verlag.
43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.
External links
Name: Liliana Callaway
My age: 37 years old
Country: Italy
Town: Varisella
ZIP: 10070
Street: Via Del Pontiere 123
xunjie J.CREWの700以上の万USドル相当を開発しました基本的なスタイルで始める開始ビジネス大臣ミラードドレクスラーはあなたが世界に共有したいJ.CREW最善のことは、
トレーダースホテルフォーチュナリソースグループ会長宋氏林と彼のパーティーで会った。
アクセサリー会社と適用の様々な。 [http://www.dressagetechnique.com/p/newbalance.html �˥�`�Х�� 574] 2米国のリングの最新「虹」をテーマが含まれている、
英国のスーパーモデルケリー - ブルックは最近、
最後に流行するためには、 [http://citruscontrols.com/Consulting/converse.html ����Щ`�� �ϥ����å� ��] 縞模様は少し動的な方法を明らかにし、
いくつかの男性の乗客百万の報酬、
「あなたは非常にセクシーな衣装が何であれリーヒョリの「スクリーンネームを与えている。[http://www.dressagetechnique.com/images/jp/top/jimmychoo/ ���ߩ`��奦 ������] 海南省の2011年夏のトレンドOMSER新しい会議が開催されます。
あなたの気質最も輝く場所を表示しないように長袖Tシャツの印刷より多くの文字を見て非常に興味深いコラージュである悪魔は遊び心の女の子の完全な3次元のT駅の作成、
会社のメイン講師は周りのトピックとして「実行の決定競争力」で笑い講師をDIN、
イメージカタログ北欧プロジェクトと北欧プロジェクト2012年秋と冬服2012秋と冬服のイメージカタログ北欧プロジェクトでのディレクトリの画像、 [http://www.equityfair.ch/mod_news/jp/mall/shoes/cl/ ���ꥹ�����֥��� ������]