7

We know that $\sum_{ab = n} f(a) g(b)$ is multiplicative in $n$ if $f, g$ are but what about $\sum_{\text{lcm}(a,b) = n} f(a) g(b)$. It associates because of associativity of $\text{lcm}$. Thanks @darij grinberg who says that this preserves multiplicativity.

Where does it show up?

If the $a,b : \Bbb{N} \to \Bbb{C}$ is multiplicative then consider their natural map into infinite sums of the form $\sum_{i \in \Bbb{N}} c_i \chi_i(n)$ where $\chi_i = \begin{cases} 1, \text{ if } n \in (i) \\ 0, \text { if } n \notin (i)\end{cases}$ where $(i)$ is the ideal in $\Bbb{Z}$, and $c_i \in \Bbb{C}$.

Then the $n$th coefficient of $(a\cdot b)(n)\equiv a(n) b(n)$ is the second sum above i.e. the $m$th coefficient of multiplication is $(a \star b)(m) = \sum_{\text{lcm}(i,j)=m} a(i)b(j)$.


Now take GCD sums:

$$ \sum_{\text{gcd}(a,b) = n} f(a) g(b) $$

GCD basis functions:

Whatever the "basis functions" are, they must satsify $\phi_k(n)^2 = \phi_{\gcd(k,k)}(n) = \phi_k(n)$ or can only give values in $\{0, 1\}$ meaning they too are probably "characteristic functions".

$$\phi_k(n) = \begin{cases} 0, \text { if } (k,n) = 1 \\ 1, \text{ if } (k,n) \gt 1\end{cases}$$ works. It can be expressed as the characteristic map of the set $\Bbb{Z} \setminus U_k$ where $U_k = $ the units $\pmod k$.


Question: When are the series $$\sum_{i\in \Bbb{N}} c_i \chi_i(x), \ \ \sum_{i \in \Bbb{N}} c_i \phi_i(x)$$ invertible with respect to pointwise multiplication?

The first series always converges (it's always a finite sum), while the second series might not converge, so assume that it converges if you need to.

  • 2
    Nice problem! You can solve it by direct bijection: If $n$ and $m$ are two coprime positive integers, then there is a bijection from $\left{\left(u, v\right) \mid \operatorname{lcm}\left(u, v\right) = n\right} \times \left{\left(x, y\right) \mid \operatorname{lcm}\left(x, y\right) = m\right}$ to $\left{\left(p, q\right) \mid \operatorname{lcm}\left(p, q\right) = nm\right}$ (where all variables are positive integers). The bijection simply sends $\left(\left(u,v\right),\left(x,y\right)\right)$ to $\left(ux,vy\right)$. Its inverse map sends $\left(p,q\right)$ to ... – darij grinberg Mar 31 '19 at 04:47
  • 1
    ... the pair $\left(\left(\gcd\left(p,n\right),\gcd\left(q,n\right)\right),\left(\gcd\left(p,m\right),\gcd\left(q,m\right)\right)\right)$. – darij grinberg Mar 31 '19 at 04:48
  • 1
    $h(n)=\sum_{lcm(a,b)=n} f(a)g(b) = \sum_{p^k | n} h(p^k)$ and $h(p^k) = g(p^k)\sum_{j=0}^k f(p^j)+f(p^k)\sum_{j=0}^k g(p^j)$. About your question 2 if $f,g$ are completely multiplicative then $\sum_{gcd(a,b)=n} f(a)g(b)= f(n)g(n)\sum_{gcd(a,b)=1} f(a)g(b)$ – reuns Mar 31 '19 at 15:12
  • @darijgrinberg any idea of how it can be applied or what next question I should ask myself as a newbie? – Daniel Donnelly Apr 01 '19 at 23:51
  • @BananaCats: I've stopped extending the comment above because I'm currently writing a longer answer (that said, it probably will not directly answer your question). Some 15 more minutes. – darij grinberg Apr 01 '19 at 23:52
  • @darijgrinberg please include in it what would a better question be to ask instead of the inverse one. Is there anything more interesting about the LCM convolution than the regular multiplication one? – Daniel Donnelly Apr 01 '19 at 23:54
  • I don't understand what you mean by "basis functions", by the way. – darij grinberg Apr 02 '19 at 00:15
  • @darijgrinberg the functions $\chi_k(n)$ are linearly independent. – Daniel Donnelly Apr 02 '19 at 01:40
  • Yes, but what exactly should the $\phi_k$ satisfy? – darij grinberg Apr 02 '19 at 17:19

2 Answers2

7

This is probably not an answer to your current question, but for what it's worth:

I have written up a proof of the fact that the lcm-convolution of two multiplicative arithmetic functions is multiplicative (and I don't mean the proof I outlined in my comments; it's a different, cleaner proof). But I've also discovered that this is a result of von Sterneck and Lehmer from the $\leq$1930s. See Theorem 2.10.4 in my 18.781 (Spring 2016): Floor and arithmetic functions and references therein. The main vehicle of the proof is Theorem 2.10.5, which can be restated as follows:

Notations.

  • Let $A$ be the $\mathbb{C}$-algebra of all arithmetic functions (i.e., functions from $\left\{1,2,3,\ldots\right\}$ to $\mathbb{C}$).

  • Let $\star$ be the Dirichlet convolution on $A$; this is the binary operation on $A$ defined by $\left(f \star g\right)\left(n\right) = \sum\limits_{d \mid n} f\left(d\right) g\left(\dfrac{n}{d}\right) = \sum\limits_{\substack{d \geq 1;\ e \geq 1; \\ de = n}} f\left(d\right) g\left(e\right)$ for every two arithmetic functions $f$ and $g$ and every positive integer $n$.

  • Let $\widetilde{\star}$ be the "lcm"-convolution on $A$; this is the binary operation on $A$ defined by $\left(f \widetilde{\star} g\right)\left(n\right) = \sum\limits_{\substack{d \geq 1;\ e \geq 1; \\ \operatorname{lcm}\left(d, e\right) = n}} f\left(d\right) g\left(e\right)$ for every two arithmetic functions $f$ and $g$ and every positive integer $n$.

  • Let $\cdot$ be the pointwise product on $A$; this is the binary operation on $A$ defined by $\left(f \cdot g\right) \left(n\right) = f\left(n\right) g\left(n\right)$ for every two arithmetic functions $f$ and $g$ and every positive integer $n$.

Theorem A. Let $D$ be the map that sends each arithmetic function $f$ to the arithmetic function $F$ defined by $F\left(n\right) = \sum\limits_{d \mid n} f\left(d\right)$. (Note that $F$ can also be described as $\underline{1} \star f$, where $\underline{1}$ is the arithmetic function that is constantly $1$.) Then, $D$ is an isomorphism from the $\mathbb{C}$-algebra $\left(A, \widetilde{\star}\right)$ to the $\mathbb{C}$-algebra $\left(A, \cdot\right)$.

The map $F$ and its inverse both preserve multiplicativity (in fact, $F$ is Dirichlet convolution with the multiplicative function $\underline{1}$, whereas its inverse $F^{-1}$ is Dirichlet convolution with the multiplicative Möbius function $\mu$); thus, it is easy to see that the $\widetilde{\star}$ operation preserves multiplicativity. I don't say the word "isomorphism" in my note, since it is written for a pre-abstract-algebra audience, but what I do is a fairly transparent back-and-force argument using $F$ and $F^{-1}$.

Note that the $\mathbb{C}$-algebras $\left(A, \widetilde{\star}\right)$ and $\left(A, \cdot\right)$ are mutually isomorphic, but they are not isomorphic to the $\mathbb{C}$-algebra $\left(A, \star\right)$. Indeed, the former two algebras are isomorphic to the direct product $\prod_{n \geq 1} \mathbb{C}$ and thus are not integral domains, whereas the latter algebra is an integral domain (this can be proven by the same argument that one uses to show that formal power series over an integral domain form an integral domain: namely, if $f \in A$ and $g \in A$ are both nonzero, then we can pick a minimal $d \geq 1$ such that $f\left(d\right) \neq 0$ and a minimal $e \geq 1$ such that $g\left(e\right) \neq 0$; then, $\left(f \star g\right) \left(de\right) = f\left(d\right) g\left(e\right) \neq 0$ and thus $f \star g \neq 0$).

Now, you are trying to define a "gcd-convolution" on $A$, which should be a binary operation $\#$ satisfying $\left(f \# g\right)\left(n\right) = \sum\limits_{\substack{d \geq 1;\ e \geq 1; \\ \gcd\left(d, e\right) = n}} f\left(d\right) g\left(e\right)$ for every two arithmetic functions $f$ and $g$ and every positive integer $n$ for which the sum converges. As you have noticed, the sum does not always converge, and it is not clear what kind of convergence is the right kind to ask for. I wouldn't be surprised that if you allow conditional convergence, the $\#$ convolution won't even be associative.

The easiest way to avoid convergence questions is to restrict yourself to finitely supported arithmetic functions -- i.e., arithmetic functions $f$ for which the set $\left\{n \geq 1 \mid f\left(n\right) \neq 0\right\}$ is finite. It is easy to see that if $f$ and $g$ are two finitely supported arithmetic functions, then the arithmetic function $f \# g$ is well-defined and also finitely supported. Thus, if $A_0$ denotes the subspace of $A$ consisting of all finitely supported arithmetic functions, then $\left(A_0, \#\right)$ is a nonunital $\mathbb{C}$-algebra. Note that $\left(A_0, \star\right)$ and $\left(A_0, \cdot\right)$ and $\left(A_0, \widetilde{\star}\right)$ are nonunital $\mathbb{C}$-algebras as well. Moreover, the two nonunital $\mathbb{C}$-algebras $\left(A_0, \cdot\right)$ and $\left(A_0, \#\right)$ are isomorphic:

Theorem B. Let $U$ be the map that sends each arithmetic function $f \in A_0$ to the arithmetic function $F$ defined by $F\left(n\right) = \sum\limits_{n \mid d} f\left(d\right)$ (where the sum ranges over all positive multiples $d$ of $n$). Then, $U$ is an isomorphism from the nonunital $\mathbb{C}$-algebra $\left(A_0, \#\right)$ to the nonunital $\mathbb{C}$-algebra $\left(A_0, \cdot\right)$.

The two isomorphic nonunital rings $\left(A_0, \#\right)$ and $\left(A_0, \cdot\right)$ have no unity, while the two rings $\left(A_0, \widetilde{\star}\right)$ and $\left(A_0, \star\right)$ have a unity (namely, in both cases, the arithmetic function $\varepsilon$ that sends $1$ to $1$ and all larger integers to $0$). Thus, the two former rings are not isomorphic to any of the latter. Moreover, the two latter rings $\left(A_0, \widetilde{\star}\right)$ and $\left(A_0, \star\right)$ are not isomorphic either. Indeed, the ring $\left(A_0, \star\right)$ is an integral domain (being a subring of the integral domain $\left(A, \star\right)$), whereas the ring $\left(A_0, \widetilde{\star}\right)$ is not (for example: pick two distinct primes $p$ and $q$; now, for each positive integer $h$, let $e_h \in A_0$ be the arithmetic function sending $h$ to $1$ and all other positive integers to $0$; then $\left(e_p - e_{pq}\right) \widetilde{\star} e_q = 0$ but $e_p - e_{pq} \neq 0$ and $e_q \neq 0$).

  • When looking at modular forms there are 5 more natural operations : additive convolution, $\cdot $ on the $\log $ side, Hecke algebra, Galois action, reductions $\bmod \mathfrak{p}$ – reuns Apr 03 '19 at 01:47
  • @reuns: Can you restate these in terms of arithmetic functions? – darij grinberg Apr 03 '19 at 03:37
2

About Darij Grinberg's isomorphism :

  • $f \star g(n) = \sum_{d | n}f(d)g(n/d)$

    $f\, \widetilde{\star}\, g(n) = \sum_{lcm(a,b)=n} f(a)g(b)$

    $f \cdot g(n)=f(n)g(n)$ giving three algebras $(A,\star),(A,\widetilde{\star}), (A,\cdot)$ on the vector space of complex valued sequences

  • $1_{n=a}\, \widetilde{\star}\, 1_{m=b}(k) =1_{ lcm(a,b ) =k} $ and $1 \star 1_{ lcm(a,b )=n}(k) = \sum_{d | k} 1_{lcm(a,b )=d} =1_{ lcm(a,b )|k} = 1_{a|k} 1_{b | k} = (1 \star 1_{n=a}(k))\cdot(1 \star 1_{n=b}(k))$

  • Together with the distributivity of $\widetilde{\star}$ it means $f \mapsto 1 \star f$ is an algebra isomorphism $(A,\widetilde{\star}) \to (A,\cdot)$

  • If $f,g$ are multiplicative then so is $\mu \star ((1\,\widetilde{\star}\,f)\cdot (1\,\widetilde{\star} \, g)) = f \,\widetilde{\star}\, g$

  • Let $A_1 = \{ f \in A, f(1)=1\}$ and $A_0 = \{ f \in A, f(1)=0\}$ then $1_{n=1}+f \mapsto \log(1_{n=1}+f) = \sum_{m =1}^\infty \frac{(-1)^m}{m} ( \underbrace{f \star \ldots \star f}_m)$ is a group isomorphism $(A_1,\star) \to (A_0,+)$ with inverse $g \mapsto \exp(g) = 1_{n=1}+\sum_{m =1}^\infty \frac{1}{m!} ( \underbrace{g \star \ldots \star g}_m)$

  • In $(A,.)$ any $\pm 1$ valued sequence is of multiplicative order $2$ while in $(A_0,+)$ thus in $(A,\star)$ no element other than $\pm 1$ is of multiplicative order $2$

    Thus $(A,\star),(A,\cdot)$ can't be isomorphic

reuns
  • 79,880
  • That's neat how you can take a series like that. I didn't know, but now I do! Say since $\chi_k$ are linearly independent, does that mean you can invert the infinite matrix where the columns are $\chi_k(n)$ for row $n$? – Daniel Donnelly Apr 04 '19 at 05:20
  • I believe in the 4th bullet point, the two convolutions on the LHS of the equal sign should be Dirichlet convolutions rather than lcm-convolutions. At least I hope that is the case and that I'm not completely misunderstanding something :) – user2860104 Jan 08 '24 at 09:24