Lambert series: Difference between revisions
Synapse554 (talk | contribs) m Formatting in figure caption |
|||
(35 intermediate revisions by 25 users not shown) | |||
Line 1: | Line 1: | ||
{{short description|Mathematical term}} |
|||
{{For|generalized Lambert series|Appell–Lerch sum}} |
{{For|generalized Lambert series|Appell–Lerch sum}} |
||
[[File:Lambert |
[[File:Cplot Lambert series.png|thumb|right|360px|Function <math display="inline">S(q)=\sum_{n=1}^\infty \frac {q^n}{1-q^n}</math>, represented as a [[Matplotlib]] plot, using a version of the [[domain coloring]] method<ref>{{Cite web | url=http://nbviewer.ipython.org/github/empet/Math/blob/master/DomainColoring.ipynb | title=Jupyter Notebook Viewer}}</ref>]] |
||
In [[mathematics]], a '''Lambert series''', named for [[Johann Heinrich Lambert]], is a [[Series (mathematics)|series]] taking |
In [[mathematics]], a '''Lambert series''', named for [[Johann Heinrich Lambert]], is a [[Series (mathematics)|series]] taking the form |
||
:<math>S(q)=\sum_{n=1}^\infty a_n \frac {q^n}{1-q^n}.</math> |
:<math>S(q)=\sum_{n=1}^\infty a_n \frac {q^n}{1-q^n}.</math> |
||
Line 22: | Line 23: | ||
where <math>\sigma_0(n)=d(n)</math> is the number of positive [[divisor function|divisors]] of the number ''n''. |
where <math>\sigma_0(n)=d(n)</math> is the number of positive [[divisor function|divisors]] of the number ''n''. |
||
For the higher order [[divisor function| |
For the higher order [[divisor function|sum-of-divisor functions]], one has |
||
:<math>\sum_{n=1}^\infty q^n \sigma_\alpha(n) = \sum_{n=1}^\infty \frac{n^\alpha q^n}{1-q^n}</math> |
:<math>\sum_{n=1}^\infty q^n \sigma_\alpha(n) = \sum_{n=1}^\infty \frac{n^\alpha q^n}{1-q^n}</math> |
||
Line 29: | Line 30: | ||
:<math>\sigma_\alpha(n) = (\textrm{Id}_\alpha*1)(n) = \sum_{d\mid n} d^\alpha \,</math> |
:<math>\sigma_\alpha(n) = (\textrm{Id}_\alpha*1)(n) = \sum_{d\mid n} d^\alpha \,</math> |
||
is the divisor function. |
is the divisor function. In particular, for <math>\alpha = 1</math>, the Lambert series one gets is |
||
:<math>q \frac{F'(q)}{F(q)}</math> |
|||
Lambert series in which the ''a''<sub>''n''</sub> are [[trigonometric function]]s, for example, ''a''<sub>''n''</sub> = sin(2''n'' ''x''), can be evaluated by various combinations of the [[logarithmic derivative]]s of Jacobi [[theta function]]s. |
|||
which is (up to the factor of <math>q</math>) the logarithmic derivative of the usual generating function for [[partition number]]s |
|||
⚫ | |||
:<math>F(q) := \frac{1}{\phi(q)} = \sum_{k=0}^\infty p(k) q^k = \prod_{n=1}^\infty \frac{1}{1-q^n}.</math> |
|||
Additional Lambert series related to the previous identity include those for the variants of the |
|||
⚫ | |||
:<ref>See the forum post [https://mathoverflow.net/q/98174 here] (or the article {{arXiv|1112.4911}}) and the conclusions section of {{ArXiv|1712.00611}} by Merca and Schmidt (2018) for usage of these two less standard Lambert series for the Moebius function in practical applications.</ref> |
|||
:<math>\sum_{n=1}^\infty \mu(n)\,\frac{q^n}{1-q^n} = q.</math> |
:<math>\sum_{n=1}^\infty \mu(n)\,\frac{q^n}{1-q^n} = q.</math> |
||
Related Lambert series over the [[Möbius function]] include the following identities for any |
|||
prime <math>\alpha \in \mathbb{Z}^{+}</math>: |
|||
:<math> |
|||
\sum_{n \geq 1} \frac{\mu(n) q^n}{1+q^n} = q-2q^2 |
|||
</math> |
|||
:<math> |
|||
\sum_{n \geq 1} \frac{\mu(\alpha n) q^n}{1-q^n} = -\sum_{n \geq 0} q^{\alpha^n}. |
|||
</math> {{Citation needed|date=May 2024}} |
|||
The proof of the first identity above follows from a multi-section (or bisection) identity of these |
|||
Lambert series generating functions in the following form where we denote |
|||
<math>L_{f}(q) := q</math> to be the Lambert series generating function of the arithmetic function ''f'': |
|||
:<math> |
|||
\begin{align} |
|||
\sum_{n \geq 1} \frac{f(n) q^n}{1+q^n} & = \sum_{n \geq 1} \frac{f(n)q^{n}}{1-q^{n}} - |
|||
\sum_{n \geq 1} \frac{2 f(n) q^{2n}}{1-q^{2n}} \\ |
|||
& = |
|||
L_f(q) - 2 \cdot L_f(q^2). |
|||
\end{align} |
|||
</math> |
|||
For [[Euler's totient function]] <math>\varphi(n)</math>: |
For [[Euler's totient function]] <math>\varphi(n)</math>: |
||
:<math>\sum_{n=1}^\infty \varphi(n)\,\frac{q^n}{1-q^n} = \frac{q}{(1-q)^2}.</math> |
:<math>\sum_{n=1}^\infty \varphi(n)\,\frac{q^n}{1-q^n} = \frac{q}{(1-q)^2}.</math> |
||
For [[Von Mangoldt function]] <math>\Lambda(n)</math>: |
|||
:<math>\sum_{n=1}^\infty \Lambda(n)\,\frac{q^n}{1-q^n} = \sum_{n=1}^{\infty} \log(n)q^n</math> |
|||
For [[Liouville's function]] <math>\lambda(n)</math>: |
For [[Liouville's function]] <math>\lambda(n)</math>: |
||
Line 45: | Line 79: | ||
\sum_{n=1}^\infty q^{n^2}</math> |
\sum_{n=1}^\infty q^{n^2}</math> |
||
with the sum on the right similar to the [[Ramanujan theta function]], or [[Jacobi theta function]] <math>\vartheta_3(q)</math>. |
with the sum on the right similar to the [[Ramanujan theta function]], or [[Jacobi theta function]] <math>\vartheta_3(q)</math>. Note that Lambert series in which the ''a''<sub>''n''</sub> are [[trigonometric function]]s, for example, ''a''<sub>''n''</sub> = sin(2''n'' ''x''), can be evaluated by various combinations of the [[logarithmic derivative]]s of Jacobi [[theta function]]s. |
||
Generally speaking, we can extend the previous generating function expansion by letting <math>\chi_m(n)</math> denote the characteristic function of the <math>m^{th}</math> powers, <math>n = k^m \in \mathbb{Z}^{+}</math>, for positive natural numbers <math>m > 2</math> and defining the generalized ''m''-Liouville lambda function to be the arithmetic function satisfying <math>\chi_m(n) := (1 \ast \lambda_m)(n)</math>. This definition of <math>\lambda_m(n)</math> clearly implies that <math>\lambda_m(n) = \sum_{d^m|n} \mu\left(\frac{n}{d^m}\right)</math>, which in turn shows that |
|||
:<math>\sum_{n \geq 1} \frac{\lambda_m(n) q^n}{1-q^n} = \sum_{n \geq 1} q^{n^m},\ \text{ for } m \geq 2.</math> |
|||
We also have a slightly more generalized Lambert series expansion generating the [[sum of squares function]] <math>r_2(n)</math> in the form of |
We also have a slightly more generalized Lambert series expansion generating the [[sum of squares function]] <math>r_2(n)</math> in the form of |
||
<ref>{{cite web|last1=Weisstein|first1=Eric W.|title=Lambert Series|url=http://mathworld.wolfram.com/LambertSeries.html|website=MathWorld| |
<ref>{{cite web|last1=Weisstein|first1=Eric W.|title=Lambert Series|url=http://mathworld.wolfram.com/LambertSeries.html|website=MathWorld|access-date=22 April 2018}}</ref> |
||
:<math>\sum_{n=1}^{\infty} \frac{4 \cdot (-1)^{n+1} q^{2n+1}}{1-q^{2n+1}} = \sum_{m=1}^{\infty} r_2(m) q^m.</math> |
:<math>\sum_{n=1}^{\infty} \frac{4 \cdot (-1)^{n+1} q^{2n+1}}{1-q^{2n+1}} = \sum_{m=1}^{\infty} r_2(m) q^m.</math> |
||
In general, if we write the Lambert series over <math>f(n)</math> which generates the arithmetic functions <math>g(m) = (f \ast 1)(m)</math>, the next pairs of functions correspond to other well-known convolutions expressed by their Lambert series generating functions in the forms of |
In general, if we write the Lambert series over <math>f(n)</math> which generates the arithmetic functions <math>g(m) = (f \ast 1)(m)</math>, the next pairs of functions correspond to other well-known convolutions expressed by their Lambert series generating functions in the forms of |
||
:<math>(f, g) = (\mu, \varepsilon), (\varphi, \operatorname{Id}_1), (\lambda, \chi_{\operatorname{sq}}), (\Lambda, \log), |
:<math>(f, g) = (\mu, \varepsilon), (\varphi, \operatorname{Id}_1), (\lambda, \chi_{\operatorname{sq}}), (\Lambda, \log), |
||
(|\mu|, 2^{\omega}), (J_t, \operatorname{Id}_t), (d^3, (d \ast 1)^2), </math> |
(|\mu|, 2^{\omega}), (J_t, \operatorname{Id}_t), (d^3, (d \ast 1)^2), </math> |
||
where <math>\varepsilon(n) = \delta_{n,1}</math> is the multiplicative identity for [[Dirichlet |
where <math>\varepsilon(n) = \delta_{n,1}</math> is the multiplicative identity for [[Dirichlet convolution]]s, <math>\operatorname{Id}_k(n) = n^k</math> is the [[identity function]] for <math>k^{th}</math> powers, <math>\chi_{\operatorname{sq}}</math> denotes the characteristic function for the squares, <math>\omega(n)</math> which counts the number of distinct prime factors of <math>n</math> (see [[prime omega function]]), <math>J_t</math> is [[Jordan's totient function]], and <math>d(n) = \sigma_0(n)</math> is the [[divisor function]] (see [[Dirichlet convolution#Examples|Dirichlet convolutions]]). |
||
The conventional use of the letter ''q'' in the summations is a historical usage, referring to its origins in the theory of elliptic curves and theta functions, as the [[nome (mathematics)|nome]]. |
|||
==Alternate form== |
==Alternate form== |
||
Line 82: | Line 125: | ||
==Factorization theorems== |
==Factorization theorems== |
||
A somewhat newer construction recently published over |
A somewhat newer construction recently published over 2017–2018 relates to so-termed ''Lambert series factorization theorems'' of the form<ref>{{cite journal|last1=Merca|first1=Mircea|title=The Lambert series factorization theorem|journal=The Ramanujan Journal|date=13 January 2017|volume=44|issue=2|pages=417–435|doi=10.1007/s11139-016-9856-3|s2cid=125286799}}</ref> |
||
:<math>\sum_{n \geq 1} \frac{a_n q^n}{1\pm q^n} = \frac{1}{(\mp q; q)_{\infty}} \sum_{n \geq 1} \left((s_o(n, k) \pm s_e(n, k)) a_k\right) q^n, </math> |
:<math>\sum_{n \geq 1} \frac{a_n q^n}{1\pm q^n} = \frac{1}{(\mp q; q)_{\infty}} \sum_{n \geq 1} \left((s_o(n, k) \pm s_e(n, k)) a_k\right) q^n, </math> |
||
where <math>s_o(n, k) \pm s_e(n, k) = [q^n] (\mp q; q)_{\infty} \frac{q^k}{1 \pm q^k}</math> is the respective sum or difference of the |
where <math>s_o(n, k) \pm s_e(n, k) = [q^n] (\mp q; q)_{\infty} \frac{q^k}{1 \pm q^k}</math> is the respective sum or difference of the |
||
restricted partition functions <math>s_{e/o}(n, k)</math> which denote the number of <math>k</math>'s in all partitions of <math>n</math> into an ''even'' (respectively, ''odd'') number of distinct parts. Let <math>s_{n,k} := s_e(n, k) - s_o(n, k) = [q^n] (q; q)_{\infty} \frac{q^k}{1-q^k}</math> denote the invertible lower triangular sequence whose first few values are shown in the table below. |
restricted partition functions <math>s_{e/o}(n, k)</math> which denote the number of <math>k</math>'s in all partitions of <math>n</math> into an ''even'' (respectively, ''odd'') number of distinct parts. Let <math>s_{n,k} := s_e(n, k) - s_o(n, k) = [q^n] (q; q)_{\infty} \frac{q^k}{1-q^k}</math> denote the invertible lower triangular sequence whose first few values are shown in the table below. |
||
{| class="wikitable" |
{| class="wikitable" |
||
Line 110: | Line 153: | ||
|} |
|} |
||
Another characteristic form of the Lambert series factorization theorem expansions is given by |
Another characteristic form of the Lambert series factorization theorem expansions is given by<ref>{{cite journal|author=Merca, M.|author2=Schmidt, M. D.|name-list-style=amp|title=Generating Special Arithmetic Functions by Lambert Series Factorizations|journal=Contributions to Discrete Mathematics|date=2019|volume=14|issue=1|pages=31–45|doi=10.11575/cdm.v14i1.62425|doi-access=free|arxiv=1706.00393|bibcode=2017arXiv170600393M}}</ref> |
||
:<math>L_f(q) := \sum_{n \geq 1} \frac{f(n) q^n}{1-q^n} = \frac{1}{(q; q)_{\infty}} \sum_{n \geq 1} \left(s_{n,k} f(k)\right) q^n, </math> |
:<math>L_f(q) := \sum_{n \geq 1} \frac{f(n) q^n}{1-q^n} = \frac{1}{(q; q)_{\infty}} \sum_{n \geq 1} \left(s_{n,k} f(k)\right) q^n, </math> |
||
where <math>(q; q)_{\infty}</math> is the (infinite) [[q-Pochhammer symbol]]. The invertible matrix products on the right-hand-side of the previous equation correspond to inverse matrix products whose lower triangular entries are given in terms of the [[ |
where <math>(q; q)_{\infty}</math> is the (infinite) [[q-Pochhammer symbol]]. The invertible matrix products on the right-hand-side of the previous equation correspond to inverse matrix products whose lower triangular entries are given in terms of the [[Partition (number theory)|partition function]] and the [[Möbius function]] by the [[divisor sums]] |
||
:<math>s_{n,k}^{(-1)} = \sum_{d|n} p(d-k) \mu\left(\frac{n}{d}\right)</math> |
:<math>s_{n,k}^{(-1)} = \sum_{d|n} p(d-k) \mu\left(\frac{n}{d}\right)</math> |
||
The next table lists the first several rows of these corresponding inverse matrices |
The next table lists the first several rows of these corresponding inverse matrices.<ref>{{cite web|title=A133732|url=https://oeis.org/A133732|website=Online Encyclopedia of Integer Sequences|access-date=22 April 2018}}</ref> |
||
{| class="wikitable" |
{| class="wikitable" |
||
Line 141: | Line 184: | ||
|} |
|} |
||
We let <math>G_j := \frac{1}{2} \left\lceil \frac{j}{2} \right\rceil \left\lceil \frac{3j+1}{2} \right\rceil</math> denote the sequence of interleaved [[pentagonal numbers]], i.e., so that the [[pentagonal number theorem]] is expanded in the form of |
We let <math>G_j := \frac{1}{2} \left\lceil \frac{j}{2} \right\rceil \left\lceil \frac{3j+1}{2} \right\rceil</math> denote the sequence of interleaved [[pentagonal numbers]], i.e., so that the [[pentagonal number theorem]] is expanded in the form of |
||
:<math>(q; q)_{\infty} = \sum_{n \geq 0} (-1)^{\left\lceil \frac{n}{2} \right\rceil} q^{G_n}. </math> |
:<math>(q; q)_{\infty} = \sum_{n \geq 0} (-1)^{\left\lceil \frac{n}{2} \right\rceil} q^{G_n}. </math> |
||
Then for any Lambert series <math>L_f(q)</math> generating the sequence of <math>g(n) = (f \ast 1)(n)</math>, we have the corresponding inversion relation of the factorization theorem expanded above given by |
Then for any Lambert series <math>L_f(q)</math> generating the sequence of <math>g(n) = (f \ast 1)(n)</math>, we have the corresponding inversion relation of the factorization theorem expanded above given by<ref name="SCHMIDT_ACTA">{{cite journal|last1=Schmidt|first1=Maxie D.|title=New Recurrence Relations and Matrix Equations for Arithmetic Functions Generated by Lambert Series|journal=Acta Arithmetica|date=8 December 2017|volume=181|issue=4|pages=355–367|doi=10.4064/aa170217-4-8|arxiv=1701.06257|bibcode=2017arXiv170106257S|s2cid=119130467}}</ref> |
||
:<math>f(n) = \sum_{k=1}^n \sum_{d|n} p(d-k) \mu(n/d) \times \sum_{j: k-G_j > 0} (-1)^{\left\lceil \frac{j}{2} \right\rceil} b(k-G_j).</math> |
:<math>f(n) = \sum_{k=1}^n \sum_{d|n} p(d-k) \mu(n/d) \times \sum_{j: k-G_j > 0} (-1)^{\left\lceil \frac{j}{2} \right\rceil} b(k-G_j).</math> |
||
This work on Lambert series factorization theorems is extended in |
This work on Lambert series factorization theorems is extended in<ref>{{cite arXiv|author=M. Merca|author2=Schmidt, M. D.|name-list-style=amp|title=New Factor Pairs for Factorizations of Lambert Series Generating Functions|eprint=1706.02359|class=math.CO|year=2017}}</ref> to more general expansions of the form |
||
:<math>\sum_{n \geq 1} \frac{a_n q^n}{1-q^n} = \frac{1}{C(q)} \sum_{n \geq 1} \left(\sum_{k=1}^n s_{n,k}(\gamma) \widetilde{a}_k(\gamma)\right) q^n, </math> |
:<math>\sum_{n \geq 1} \frac{a_n q^n}{1-q^n} = \frac{1}{C(q)} \sum_{n \geq 1} \left(\sum_{k=1}^n s_{n,k}(\gamma) \widetilde{a}_k(\gamma)\right) q^n, </math> |
||
where <math>C(q)</math> is any (partition-related) reciprocal generating function, <math>\gamma(n)</math> is any [[arithmetic function]], and where the |
where <math>C(q)</math> is any (partition-related) reciprocal generating function, <math>\gamma(n)</math> is any [[arithmetic function]], and where the |
||
modified coefficients are expanded by |
modified coefficients are expanded by |
||
:<math>\widetilde{a}_k(\gamma) = \sum_{d|k} \sum_{r| \frac{k}{d}} a_d \gamma(r). </math> |
:<math>\widetilde{a}_k(\gamma) = \sum_{d|k} \sum_{r| \frac{k}{d}} a_d \gamma(r). </math> |
||
The corresponding inverse matrices in the above expansion satisfy |
The corresponding inverse matrices in the above expansion satisfy |
||
:<math>s_{n,k}^{(-1)}(\gamma) = \sum_{d|n} [q^{d-k}] \frac{1}{C(q)} \gamma\left(\frac{n}{d}\right), </math> |
:<math>s_{n,k}^{(-1)}(\gamma) = \sum_{d|n} [q^{d-k}] \frac{1}{C(q)} \gamma\left(\frac{n}{d}\right), </math> |
||
so that as in the first variant of the Lambert factorization theorem above we obtain an inversion relation for the right-hand-side coefficients of the form |
so that as in the first variant of the Lambert factorization theorem above we obtain an inversion relation for the right-hand-side coefficients of the form |
||
:<math>\widetilde{a}_k(\gamma) = \sum_{k=1}^{n} s_{n,k}^{(-1)}(\gamma) \times [q^k]\left(\sum_{d=1}^k \frac{a_d q^ |
:<math>\widetilde{a}_k(\gamma) = \sum_{k=1}^{n} s_{n,k}^{(-1)}(\gamma) \times [q^k]\left(\sum_{d=1}^k \frac{a_d q^d}{1-q^d} C(q)\right).</math> |
||
==Recurrence relations== |
==Recurrence relations== |
||
Line 172: | Line 215: | ||
:<math>\Sigma_f(x) := \sum_{1 \leq n \leq x} g_f(n). </math> |
:<math>\Sigma_f(x) := \sum_{1 \leq n \leq x} g_f(n). </math> |
||
We also adopt the notation from the [[ |
We also adopt the notation from the [[Lambert series#Factorization theorems|previous section]] that |
||
:<math>s_{n,k} = [q^n] (q; q)_{\infty} \frac{q^k}{1-q^k}, </math> |
:<math>s_{n,k} = [q^n] (q; q)_{\infty} \frac{q^k}{1-q^k}, </math> |
||
where <math>(q; q)_{\infty}</math> is the infinite [[q-Pochhammer symbol]]. Then we have the following recurrence relations for involving these functions and the [[pentagonal numbers]] proved in |
where <math>(q; q)_{\infty}</math> is the infinite [[q-Pochhammer symbol]]. Then we have the following recurrence relations for involving these functions and the [[pentagonal numbers]] proved in:<ref name="SCHMIDT_ACTA" /> |
||
:<math>g_f(n+1) = \sum_{b = \pm 1} \sum_{k=1}^{\left\lfloor \frac{\sqrt{24n+1}-b}{6}\right\rfloor} |
:<math>g_f(n+1) = \sum_{b = \pm 1} \sum_{k=1}^{\left\lfloor \frac{\sqrt{24n+1}-b}{6}\right\rfloor} |
||
(-1)^{k+1} g_f\left(n+1-\frac{k(3k+b)}{2}\right) + |
(-1)^{k+1} g_f\left(n+1-\frac{k(3k+b)}{2}\right) + |
||
\sum_{k=1}^{n+1} s_{n+1,k} f(k), </math> |
\sum_{k=1}^{n+1} s_{n+1,k} f(k), </math> |
||
:<math>\Sigma_f(x+1) = \sum_{b = \pm 1} \sum_{k=1}^{\left\lfloor \frac{\sqrt{ |
:<math>\Sigma_f(x+1) = \sum_{b = \pm 1} \sum_{k=1}^{\left\lfloor \frac{\sqrt{24x+1}-b}{6}\right\rfloor} |
||
(-1)^{k+1} \Sigma_f\left(n+1-\frac{k(3k+b)}{2}\right) + |
(-1)^{k+1} \Sigma_f\left(n+1-\frac{k(3k+b)}{2}\right) + |
||
\sum_{n=0}^x \sum_{k=1}^{n+1} s_{n+1,k} f(k). </math> |
\sum_{n=0}^x \sum_{k=1}^{n+1} s_{n+1,k} f(k). </math> |
||
Line 187: | Line 230: | ||
==Derivatives== |
==Derivatives== |
||
Derivatives of a Lambert series can be obtained by differentiation of the series termwise with respect to <math>q</math>. We have the following identities for the termwise <math>s^{th}</math> derivatives of a Lambert series for any <math>s \geq 1</math> |
Derivatives of a Lambert series can be obtained by differentiation of the series termwise with respect to <math>q</math>. We have the following identities for the termwise <math>s^{th}</math> derivatives of a Lambert series for any <math>s \geq 1</math><ref>{{cite arXiv|last1=Schmidt|first1=Maxie D.|title=Combinatorial Sums and Identities Involving Generalized Divisor Functions with Bounded Divisors|date=2017|eprint=1704.05595|class=math.NT}}</ref><ref>{{cite arXiv|last1=Schmidt|first1=Maxie D.|title=Factorization Theorems for Hadamard Products and Higher-Order Derivatives of Lambert Series Generating Functions|date=2017|eprint=1712.00608|class=math.NT}}</ref> |
||
:<math>q^s \cdot D^{(s)}\left[\frac{q^i}{1-q^i}\right] = \sum_{m=0}^s \sum_{k=0}^m \left[\begin{matrix} s \\ m\end{matrix}\right] |
:<math>q^s \cdot D^{(s)}\left[\frac{q^i}{1-q^i}\right] = \sum_{m=0}^s \sum_{k=0}^m \left[\begin{matrix} s \\ m\end{matrix}\right] |
||
Line 195: | Line 238: | ||
where the bracketed triangular coefficients in the previous equations denote the [[Stirling number|Stirling numbers of the first and second kinds]]. |
where the bracketed triangular coefficients in the previous equations denote the [[Stirling number|Stirling numbers of the first and second kinds]]. |
||
We also have the next identity for extracting the individual coefficients of the terms implicit to the previous expansions given in the form of |
We also have the next identity for extracting the individual coefficients of the terms implicit to the previous expansions given in the form of |
||
:<math>[q^n]\left(\sum_{i \geq t} \frac{a_i q^{mi}}{(1-q^i)^{k+1}}\right) = \sum_{\begin{matrix} d|n \\ t \leq d \leq \left\lfloor \frac{n}{m} \right\rfloor\end{matrix}} |
:<math>[q^n]\left(\sum_{i \geq t} \frac{a_i q^{mi}}{(1-q^i)^{k+1}}\right) = \sum_{\begin{matrix} d|n \\ t \leq d \leq \left\lfloor \frac{n}{m} \right\rfloor\end{matrix}} |
||
\binom{\frac{n}{d}-m+k}{k} a_d. </math> |
\binom{\frac{n}{d}-m+k}{k} a_d. </math> |
||
Now if we define the functions <math>A_t(n)</math> for any <math>n,t \geq 1</math> by |
Now if we define the functions <math>A_t(n)</math> for any <math>n,t \geq 1</math> by |
||
:<math>A_t(n) := \sum_{\begin{matrix} 0 \leq k \leq m \leq t \\ 0 \leq r \leq t\end{matrix}} \sum_{d|n} \left[\begin{matrix} t \\ m\end{matrix}\right] |
:<math>A_t(n) := \sum_{\begin{matrix} 0 \leq k \leq m \leq t \\ 0 \leq r \leq t\end{matrix}} \sum_{d|n} \left[\begin{matrix} t \\ m\end{matrix}\right] |
||
\left\{\begin{matrix} m \\ k\end{matrix}\right\} \binom{t-k}{r} \binom{\frac{n}{d}-1-r+k}{k} (-1)^{t-k-r} k! d^m \cdot a_d \cdot |
\left\{\begin{matrix} m \\ k\end{matrix}\right\} \binom{t-k}{r} \binom{\frac{n}{d}-1-r+k}{k} (-1)^{t-k-r} k! d^m \cdot a_d \cdot |
||
\left[t \leq d \leq \left\lfloor \frac{n}{r+1} \right\rfloor\right]_{\delta}, </math> |
\left[t \leq d \leq \left\lfloor \frac{n}{r+1} \right\rfloor\right]_{\delta}, </math> |
||
where <math>[\cdot]_{\delta}</math> denotes [[Iverson's convention]], then we have the coefficients for the <math>t^{th}</math> derivatives of a Lambert series |
where <math>[\cdot]_{\delta}</math> denotes [[Iverson's convention]], then we have the coefficients for the <math>t^{th}</math> derivatives of a Lambert series |
||
given by |
given by |
||
:<math>\begin{align} |
:<math>\begin{align} |
||
Line 215: | Line 258: | ||
</math> |
</math> |
||
Of course, by a typical argument purely by operations on formal power series we also have that |
Of course, by a typical argument purely by operations on formal [[power series]] we also have that |
||
:<math>[q^n]\left(q^t \cdot D^{(t)}\left[\sum_{i \geq 1} \frac{f(i) q^i}{1-q^i}\right]\right) = \frac{n!}{(n-t)!} \cdot (f \ast 1)(n). </math> |
:<math>[q^n]\left(q^t \cdot D^{(t)}\left[\sum_{i \geq 1} \frac{f(i) q^i}{1-q^i}\right]\right) = \frac{n!}{(n-t)!} \cdot (f \ast 1)(n). </math> |
||
Line 237: | Line 280: | ||
* {{Apostol IANT}} |
* {{Apostol IANT}} |
||
* {{springer|title=Lambert series|id=p/l057340}} |
* {{springer|title=Lambert series|id=p/l057340}} |
||
* {{ |
* {{MathWorld|urlname=LambertSeries|title=Lambert Series}} |
||
* {{cite arXiv|last=Schmidt|first=Maxie Dion|date=2020-04-06|title=A catalog of interesting and useful Lambert series identities|class=math.NT|eprint=2004.02976}} |
|||
[[Category:Analytic number theory]] |
[[Category:Analytic number theory]] |
Latest revision as of 22:08, 25 August 2024
In mathematics, a Lambert series, named for Johann Heinrich Lambert, is a series taking the form
It can be resummed formally by expanding the denominator:
where the coefficients of the new series are given by the Dirichlet convolution of an with the constant function 1(n) = 1:
This series may be inverted by means of the Möbius inversion formula, and is an example of a Möbius transform.
Examples
[edit]Since this last sum is a typical number-theoretic sum, almost any natural multiplicative function will be exactly summable when used in a Lambert series. Thus, for example, one has
where is the number of positive divisors of the number n.
For the higher order sum-of-divisor functions, one has
where is any complex number and
is the divisor function. In particular, for , the Lambert series one gets is
which is (up to the factor of ) the logarithmic derivative of the usual generating function for partition numbers
Additional Lambert series related to the previous identity include those for the variants of the Möbius function given below
Related Lambert series over the Möbius function include the following identities for any prime :
The proof of the first identity above follows from a multi-section (or bisection) identity of these Lambert series generating functions in the following form where we denote to be the Lambert series generating function of the arithmetic function f:
For Euler's totient function :
For Von Mangoldt function :
For Liouville's function :
with the sum on the right similar to the Ramanujan theta function, or Jacobi theta function . Note that Lambert series in which the an are trigonometric functions, for example, an = sin(2n x), can be evaluated by various combinations of the logarithmic derivatives of Jacobi theta functions.
Generally speaking, we can extend the previous generating function expansion by letting denote the characteristic function of the powers, , for positive natural numbers and defining the generalized m-Liouville lambda function to be the arithmetic function satisfying . This definition of clearly implies that , which in turn shows that
We also have a slightly more generalized Lambert series expansion generating the sum of squares function in the form of [3]
In general, if we write the Lambert series over which generates the arithmetic functions , the next pairs of functions correspond to other well-known convolutions expressed by their Lambert series generating functions in the forms of
where is the multiplicative identity for Dirichlet convolutions, is the identity function for powers, denotes the characteristic function for the squares, which counts the number of distinct prime factors of (see prime omega function), is Jordan's totient function, and is the divisor function (see Dirichlet convolutions).
The conventional use of the letter q in the summations is a historical usage, referring to its origins in the theory of elliptic curves and theta functions, as the nome.
Alternate form
[edit]Substituting one obtains another common form for the series, as
where
as before. Examples of Lambert series in this form, with , occur in expressions for the Riemann zeta function for odd integer values; see Zeta constants for details.
Current usage
[edit]In the literature we find Lambert series applied to a wide variety of sums. For example, since is a polylogarithm function, we may refer to any sum of the form
as a Lambert series, assuming that the parameters are suitably restricted. Thus
which holds for all complex q not on the unit circle, would be considered a Lambert series identity. This identity follows in a straightforward fashion from some identities published by the Indian mathematician S. Ramanujan. A very thorough exploration of Ramanujan's works can be found in the works by Bruce Berndt.
Factorization theorems
[edit]A somewhat newer construction recently published over 2017–2018 relates to so-termed Lambert series factorization theorems of the form[4]
where is the respective sum or difference of the restricted partition functions which denote the number of 's in all partitions of into an even (respectively, odd) number of distinct parts. Let denote the invertible lower triangular sequence whose first few values are shown in the table below.
n \ k | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
---|---|---|---|---|---|---|---|---|
1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
2 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
3 | -1 | -1 | 1 | 0 | 0 | 0 | 0 | 0 |
4 | -1 | 0 | -1 | 1 | 0 | 0 | 0 | 0 |
5 | -1 | -1 | -1 | -1 | 1 | 0 | 0 | 0 |
6 | 0 | 0 | 1 | -1 | -1 | 1 | 0 | 0 |
7 | 0 | 0 | -1 | 0 | -1 | -1 | 1 | 0 |
8 | 1 | 0 | 0 | 1 | 0 | -1 | -1 | 1 |
Another characteristic form of the Lambert series factorization theorem expansions is given by[5]
where is the (infinite) q-Pochhammer symbol. The invertible matrix products on the right-hand-side of the previous equation correspond to inverse matrix products whose lower triangular entries are given in terms of the partition function and the Möbius function by the divisor sums
The next table lists the first several rows of these corresponding inverse matrices.[6]
n \ k | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
---|---|---|---|---|---|---|---|---|
1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
2 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
3 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 |
4 | 2 | 1 | 1 | 1 | 0 | 0 | 0 | 0 |
5 | 4 | 3 | 2 | 1 | 1 | 0 | 0 | 0 |
6 | 5 | 3 | 2 | 2 | 1 | 1 | 0 | 0 |
7 | 10 | 7 | 5 | 3 | 2 | 1 | 1 | 0 |
8 | 12 | 9 | 6 | 4 | 3 | 2 | 1 | 1 |
We let denote the sequence of interleaved pentagonal numbers, i.e., so that the pentagonal number theorem is expanded in the form of
Then for any Lambert series generating the sequence of , we have the corresponding inversion relation of the factorization theorem expanded above given by[7]
This work on Lambert series factorization theorems is extended in[8] to more general expansions of the form
where is any (partition-related) reciprocal generating function, is any arithmetic function, and where the modified coefficients are expanded by
The corresponding inverse matrices in the above expansion satisfy
so that as in the first variant of the Lambert factorization theorem above we obtain an inversion relation for the right-hand-side coefficients of the form
Recurrence relations
[edit]Within this section we define the following functions for natural numbers :
We also adopt the notation from the previous section that
where is the infinite q-Pochhammer symbol. Then we have the following recurrence relations for involving these functions and the pentagonal numbers proved in:[7]
Derivatives
[edit]Derivatives of a Lambert series can be obtained by differentiation of the series termwise with respect to . We have the following identities for the termwise derivatives of a Lambert series for any [9][10]
where the bracketed triangular coefficients in the previous equations denote the Stirling numbers of the first and second kinds. We also have the next identity for extracting the individual coefficients of the terms implicit to the previous expansions given in the form of
Now if we define the functions for any by
where denotes Iverson's convention, then we have the coefficients for the derivatives of a Lambert series given by
Of course, by a typical argument purely by operations on formal power series we also have that
See also
[edit]References
[edit]- ^ "Jupyter Notebook Viewer".
- ^ See the forum post here (or the article arXiv:1112.4911) and the conclusions section of arXiv:1712.00611 by Merca and Schmidt (2018) for usage of these two less standard Lambert series for the Moebius function in practical applications.
- ^ Weisstein, Eric W. "Lambert Series". MathWorld. Retrieved 22 April 2018.
- ^ Merca, Mircea (13 January 2017). "The Lambert series factorization theorem". The Ramanujan Journal. 44 (2): 417–435. doi:10.1007/s11139-016-9856-3. S2CID 125286799.
- ^ Merca, M. & Schmidt, M. D. (2019). "Generating Special Arithmetic Functions by Lambert Series Factorizations". Contributions to Discrete Mathematics. 14 (1): 31–45. arXiv:1706.00393. Bibcode:2017arXiv170600393M. doi:10.11575/cdm.v14i1.62425.
- ^ "A133732". Online Encyclopedia of Integer Sequences. Retrieved 22 April 2018.
- ^ a b Schmidt, Maxie D. (8 December 2017). "New Recurrence Relations and Matrix Equations for Arithmetic Functions Generated by Lambert Series". Acta Arithmetica. 181 (4): 355–367. arXiv:1701.06257. Bibcode:2017arXiv170106257S. doi:10.4064/aa170217-4-8. S2CID 119130467.
- ^ M. Merca & Schmidt, M. D. (2017). "New Factor Pairs for Factorizations of Lambert Series Generating Functions". arXiv:1706.02359 [math.CO].
- ^ Schmidt, Maxie D. (2017). "Combinatorial Sums and Identities Involving Generalized Divisor Functions with Bounded Divisors". arXiv:1704.05595 [math.NT].
- ^ Schmidt, Maxie D. (2017). "Factorization Theorems for Hadamard Products and Higher-Order Derivatives of Lambert Series Generating Functions". arXiv:1712.00608 [math.NT].
- Berry, Michael V. (2010). Functions of Number Theory. CAMBRIDGE UNIVERSITY PRESS. pp. 637–641. ISBN 978-0-521-19225-5.
- Lambert, Preston A. (1904). "Expansions of algebraic functions at singular points". Proc. Am. Philos. Soc. 43 (176): 164–172. JSTOR 983503.
- Apostol, Tom M. (1976), Introduction to analytic number theory, Undergraduate Texts in Mathematics, New York-Heidelberg: Springer-Verlag, ISBN 978-0-387-90163-3, MR 0434929, Zbl 0335.10001
- "Lambert series", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
- Weisstein, Eric W. "Lambert Series". MathWorld.
- Schmidt, Maxie Dion (2020-04-06). "A catalog of interesting and useful Lambert series identities". arXiv:2004.02976 [math.NT].