Lambert series

Last updated
Function
S
(
q
)
=
[?]
n
=
1
[?]
q
n
1
-
q
n
{\textstyle S(q)=\sum _{n=1}^{\infty }{\frac {q^{n}}{1-q^{n}}}}
, represented as a Matplotlib plot, using a version of the domain coloring method Cplot Lambert series.png
Function , represented as a Matplotlib plot, using a version of the domain coloring method

In mathematics, a Lambert series, named for Johann Heinrich Lambert, is a series taking the form

Contents

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

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

[2]

Related Lambert series over the Möbius function include the following identities for any prime :

[ citation needed ]

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

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

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

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 \ k12345678
110000000
201000000
3-1-1100000
4-10-110000
5-1-1-1-11000
6001-1-1100
700-10-1-110
810010-1-11

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 \ k12345678
110000000
201000000
311100000
421110000
543211000
653221100
7107532110
8129643211

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

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

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

Related Research Articles

In complex analysis, an entire function, also called an integral function, is a complex-valued function that is holomorphic on the whole complex plane. Typical examples of entire functions are polynomials and the exponential function, and any finite sums, products and compositions of these, such as the trigonometric functions sine and cosine and their hyperbolic counterparts sinh and cosh, as well as derivatives and integrals of entire functions such as the error function. If an entire function has a root at , then , taking the limit value at , is an entire function. On the other hand, the natural logarithm, the reciprocal function, and the square root are all not entire functions, nor can they be continued analytically to an entire function.

In mathematics, the classic Möbius inversion formula is a relation between pairs of arithmetic functions, each defined from the other by sums over divisors. It was introduced into number theory in 1832 by August Ferdinand Möbius.

<span class="mw-page-title-main">Square-free integer</span> Number without repeated prime factors

In mathematics, a square-free integer (or squarefree integer) is an integer which is divisible by no square number other than 1. That is, its prime factorization has exactly one factor for each prime that appears in it. For example, 10 = 2 ⋅ 5 is square-free, but 18 = 2 ⋅ 3 ⋅ 3 is not, because 18 is divisible by 9 = 32. The smallest positive square-free numbers are

The Liouville lambda function, denoted by λ(n) and named after Joseph Liouville, is an important arithmetic function. Its value is +1 if n is the product of an even number of prime numbers, and −1 if it is the product of an odd number of primes.

In the mathematical field of real analysis, the monotone convergence theorem is any of a number of related theorems proving the good convergence behaviour of monotonic sequences, i.e. sequences that are non-increasing, or non-decreasing. In its simplest form, it says that a non-decreasing bounded-above sequence of real numbers converges to its smallest upper bound, its supremum. Likewise, a non-increasing bounded-below sequence converges to its largest lower bound, its infimum. In particular, infinite sums of non-negative numbers converge to the supremum of the partial sums if and only if the partial sums are bounded.

In mathematics, a generating function is a representation of an infinite sequence of numbers as the coefficients of a formal power series. Generating functions are often expressed in closed form, by some expression involving operations on the formal series.

In mathematical analysis, Hölder's inequality, named after Otto Hölder, is a fundamental inequality between integrals and an indispensable tool for the study of Lp spaces.

<span class="mw-page-title-main">Mertens function</span> Summatory function of the Möbius function

In number theory, the Mertens function is defined for all positive integers n as

In probability theory, a Chernoff bound is an exponentially decreasing upper bound on the tail of a random variable based on its moment generating function. The minimum of all such exponential bounds forms the Chernoff or Chernoff-Cramér bound, which may decay faster than exponential. It is especially useful for sums of independent random variables, such as sums of Bernoulli random variables.

In the field of mathematics, norms are defined for elements within a vector space. Specifically, when the vector space comprises matrices, such norms are referred to as matrix norms. Matrix norms differ from vector norms in that they must also interact with matrix multiplication.

In mathematics, the Grothendieck inequality states that there is a universal constant with the following property. If Mij is an n × n matrix with

In number theory, an average order of an arithmetic function is some simpler or better-understood function which takes the same values "on average".

<span class="mw-page-title-main">Anatoly Karatsuba</span> Russian mathematician (1937–2008)

Anatoly Alexeyevich Karatsuba was a Russian mathematician working in the field of analytic number theory, p-adic numbers and Dirichlet series.

In mathematics, a Redheffer matrix, often denoted as studied by Redheffer (1977), is a square (0,1) matrix whose entries aij are 1 if i divides j or if j = 1; otherwise, aij = 0. It is useful in some contexts to express Dirichlet convolution, or convolved divisors sums, in terms of matrix products involving the transpose of the Redheffer matrix.

<span class="mw-page-title-main">Derivative of the exponential map</span> Formula in Lie group theory

In the theory of Lie groups, the exponential map is a map from the Lie algebra g of a Lie group G into G. In case G is a matrix Lie group, the exponential map reduces to the matrix exponential. The exponential map, denoted exp:gG, is analytic and has as such a derivative d/dtexp(X(t)):Tg → TG, where X(t) is a C1 path in the Lie algebra, and a closely related differential dexp:Tg → TG.

In probability theory, a subgaussian distribution, the distribution of a subgaussian random variable, is a probability distribution with strong tail decay. More specifically, the tails of a subgaussian distribution are dominated by the tails of a Gaussian. This property gives subgaussian distributions their name.

In mathematics, a transformation of a sequence's generating function provides a method of converting the generating function for one sequence into a generating function enumerating another. These transformations typically involve integral formulas applied to a sequence generating function or weighted sums over the higher-order derivatives of these functions.

In number theory, the prime omega functions and count the number of prime factors of a natural number Thereby counts each distinct prime factor, whereas the related function counts the total number of prime factors of honoring their multiplicity. That is, if we have a prime factorization of of the form for distinct primes , then the respective prime omega functions are given by and . These prime factor counting functions have many important number theoretic relations.

The purpose of this page is to catalog new, interesting, and useful identities related to number-theoretic divisor sums, i.e., sums of an arithmetic function over the divisors of a natural number , or equivalently the Dirichlet convolution of an arithmetic function with one:

In analytic number theory, a Dirichlet series, or Dirichlet generating function (DGF), of a sequence is a common way of understanding and summing arithmetic functions in a meaningful way. A little known, or at least often forgotten about, way of expressing formulas for arithmetic functions and their summatory functions is to perform an integral transform that inverts the operation of forming the DGF of a sequence. This inversion is analogous to performing an inverse Z-transform to the generating function of a sequence to express formulas for the series coefficients of a given ordinary generating function.

References

  1. "Jupyter Notebook Viewer".
  2. 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.
  3. Weisstein, Eric W. "Lambert Series". MathWorld. Retrieved 22 April 2018.
  4. 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.
  5. 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 .
  6. "A133732". Online Encyclopedia of Integer Sequences. Retrieved 22 April 2018.
  7. 1 2 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.
  8. M. Merca & Schmidt, M. D. (2017). "New Factor Pairs for Factorizations of Lambert Series Generating Functions". arXiv: 1706.02359 [math.CO].
  9. Schmidt, Maxie D. (2017). "Combinatorial Sums and Identities Involving Generalized Divisor Functions with Bounded Divisors". arXiv: 1704.05595 [math.NT].
  10. Schmidt, Maxie D. (2017). "Factorization Theorems for Hadamard Products and Higher-Order Derivatives of Lambert Series Generating Functions". arXiv: 1712.00608 [math.NT].