Can we invert these analogous “Dirichlet” series for GCD / LCM convolution? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)$gcd cdot mathrmlcm$ for cyclic ringsGeneralized multiplicative functionsAbsolute Convergence of Dirichelet SeriesHelp with $sum_dmid nτ(d)^2=sum_d mid nτ(d)^3$Dirichlet convolution for dummiesAlternate proof for GCD × LCM = productLadder method for lcm and gcdIs $a+bsqrt3mid a, b in Bbb Z$ Ring?Convergence of $sum_k=1^inftyfracoperatornamerad(k!)operatornamelcm(1,2,ldots,k)$About ideals in a ring which is a $k$ vector space$gcd cdot mathrmlcm$ for cyclic rings

How to answer "Have you ever been terminated?"

Why did the IBM 650 use bi-quinary?

prime numbers and expressing non-prime numbers

Is the Standard Deduction better than Itemized when both are the same amount?

English words in a non-english sci-fi novel

How does debian/ubuntu knows a package has a updated version

How to find out what spells would be useless to a blind NPC spellcaster?

Withdrew £2800, but only £2000 shows as withdrawn on online banking; what are my obligations?

Why do we bend a book to keep it straight?

What is a non-alternating simple group with big order, but relatively few conjugacy classes?

Can an alien society believe that their star system is the universe?

What to do with chalk when deepwater soloing?

How can I make names more distinctive without making them longer?

String `!23` is replaced with `docker` in command line

Can I cast Passwall to drop an enemy into a 20-foot pit?

Apollo command module space walk?

How to run gsettings for another user Ubuntu 18.04.2 LTS

porting install scripts : can rpm replace apt?

In predicate logic, does existential quantification (∃) include universal quantification (∀), i.e. can 'some' imply 'all'?

Extract all GPU name, model and GPU ram

How to align text above triangle figure

What does "fit" mean in this sentence?

Short Story with Cinderella as a Voo-doo Witch

Using et al. for a last / senior author rather than for a first author



Can we invert these analogous “Dirichlet” series for GCD / LCM convolution?



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)$gcd cdot mathrmlcm$ for cyclic ringsGeneralized multiplicative functionsAbsolute Convergence of Dirichelet SeriesHelp with $sum_dmid nτ(d)^2=sum_d mid nτ(d)^3$Dirichlet convolution for dummiesAlternate proof for GCD × LCM = productLadder method for lcm and gcdIs $a+bsqrt3mid a, b in Bbb Z$ Ring?Convergence of $sum_k=1^inftyfracoperatornamerad(k!)operatornamelcm(1,2,ldots,k)$About ideals in a ring which is a $k$ vector space$gcd cdot mathrmlcm$ for cyclic rings










5












$begingroup$


We know that $sum_ab = n f(a) g(b)$ is multiplicative in $n$ if $f, g$ are but what about $sum_textlcm(a,b) = n f(a) g(b)$. It associates because of associativity of $textlcm$. Thanks @darij grinberg who says that this preserves multiplicativity.



Where does it show up?



If the $a,b : BbbN to BbbC$ is multiplicative then consider their natural map into infinite sums of the form $sum_i in BbbN c_i chi_i(n)$ where $chi_i = begincases 1, text if n in (i) \ 0, text if n notin (i)endcases$ where $(i)$ is the ideal in $BbbZ$, and $c_i in BbbC$.



Then the $n$th coefficient of $(acdot 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_textlcm(i,j)=m a(i)b(j)$.




Now take GCD sums:



$$
sum_textgcd(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) = begincases 0, text if (k,n) = 1 \ 1, text if (k,n) gt 1endcases$$
works. It can be expressed as the characteristic map of the set $BbbZ setminus U_k$ where $U_k = $ the units $pmod k$.





Question: When are the series $$sum_iin BbbN c_i chi_i(x), sum_i in BbbN 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.










share|cite|improve this question











$endgroup$







  • 2




    $begingroup$
    Nice problem! You can solve it by direct bijection: If $n$ and $m$ are two coprime positive integers, then there is a bijection from $leftleft(u, vright) mid operatornamelcmleft(u, vright) = nright times leftleft(x, yright) mid operatornamelcmleft(x, yright) = mright$ to $leftleft(p, qright) mid operatornamelcmleft(p, qright) = nmright$ (where all variables are positive integers). The bijection simply sends $left(left(u,vright),left(x,yright)right)$ to $left(ux,vyright)$. Its inverse map sends $left(p,qright)$ to ...
    $endgroup$
    – darij grinberg
    Mar 31 at 4:47







  • 1




    $begingroup$
    ... the pair $left(left(gcdleft(p,nright),gcdleft(q,nright)right),left(gcdleft(p,mright),gcdleft(q,mright)right)right)$.
    $endgroup$
    – darij grinberg
    Mar 31 at 4:48







  • 1




    $begingroup$
    $h(n)=sum_lcm(a,b)=n f(a)g(b) = sum_p^k 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)$
    $endgroup$
    – reuns
    Mar 31 at 15:12











  • $begingroup$
    @darijgrinberg any idea of how it can be applied or what next question I should ask myself as a newbie? 🐸
    $endgroup$
    – I Said Roll Up n Smoke Adjoint
    Apr 1 at 23:51











  • $begingroup$
    @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.
    $endgroup$
    – darij grinberg
    Apr 1 at 23:52
















5












$begingroup$


We know that $sum_ab = n f(a) g(b)$ is multiplicative in $n$ if $f, g$ are but what about $sum_textlcm(a,b) = n f(a) g(b)$. It associates because of associativity of $textlcm$. Thanks @darij grinberg who says that this preserves multiplicativity.



Where does it show up?



If the $a,b : BbbN to BbbC$ is multiplicative then consider their natural map into infinite sums of the form $sum_i in BbbN c_i chi_i(n)$ where $chi_i = begincases 1, text if n in (i) \ 0, text if n notin (i)endcases$ where $(i)$ is the ideal in $BbbZ$, and $c_i in BbbC$.



Then the $n$th coefficient of $(acdot 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_textlcm(i,j)=m a(i)b(j)$.




Now take GCD sums:



$$
sum_textgcd(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) = begincases 0, text if (k,n) = 1 \ 1, text if (k,n) gt 1endcases$$
works. It can be expressed as the characteristic map of the set $BbbZ setminus U_k$ where $U_k = $ the units $pmod k$.





Question: When are the series $$sum_iin BbbN c_i chi_i(x), sum_i in BbbN 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.










share|cite|improve this question











$endgroup$







  • 2




    $begingroup$
    Nice problem! You can solve it by direct bijection: If $n$ and $m$ are two coprime positive integers, then there is a bijection from $leftleft(u, vright) mid operatornamelcmleft(u, vright) = nright times leftleft(x, yright) mid operatornamelcmleft(x, yright) = mright$ to $leftleft(p, qright) mid operatornamelcmleft(p, qright) = nmright$ (where all variables are positive integers). The bijection simply sends $left(left(u,vright),left(x,yright)right)$ to $left(ux,vyright)$. Its inverse map sends $left(p,qright)$ to ...
    $endgroup$
    – darij grinberg
    Mar 31 at 4:47







  • 1




    $begingroup$
    ... the pair $left(left(gcdleft(p,nright),gcdleft(q,nright)right),left(gcdleft(p,mright),gcdleft(q,mright)right)right)$.
    $endgroup$
    – darij grinberg
    Mar 31 at 4:48







  • 1




    $begingroup$
    $h(n)=sum_lcm(a,b)=n f(a)g(b) = sum_p^k 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)$
    $endgroup$
    – reuns
    Mar 31 at 15:12











  • $begingroup$
    @darijgrinberg any idea of how it can be applied or what next question I should ask myself as a newbie? 🐸
    $endgroup$
    – I Said Roll Up n Smoke Adjoint
    Apr 1 at 23:51











  • $begingroup$
    @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.
    $endgroup$
    – darij grinberg
    Apr 1 at 23:52














5












5








5


3



$begingroup$


We know that $sum_ab = n f(a) g(b)$ is multiplicative in $n$ if $f, g$ are but what about $sum_textlcm(a,b) = n f(a) g(b)$. It associates because of associativity of $textlcm$. Thanks @darij grinberg who says that this preserves multiplicativity.



Where does it show up?



If the $a,b : BbbN to BbbC$ is multiplicative then consider their natural map into infinite sums of the form $sum_i in BbbN c_i chi_i(n)$ where $chi_i = begincases 1, text if n in (i) \ 0, text if n notin (i)endcases$ where $(i)$ is the ideal in $BbbZ$, and $c_i in BbbC$.



Then the $n$th coefficient of $(acdot 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_textlcm(i,j)=m a(i)b(j)$.




Now take GCD sums:



$$
sum_textgcd(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) = begincases 0, text if (k,n) = 1 \ 1, text if (k,n) gt 1endcases$$
works. It can be expressed as the characteristic map of the set $BbbZ setminus U_k$ where $U_k = $ the units $pmod k$.





Question: When are the series $$sum_iin BbbN c_i chi_i(x), sum_i in BbbN 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.










share|cite|improve this question











$endgroup$




We know that $sum_ab = n f(a) g(b)$ is multiplicative in $n$ if $f, g$ are but what about $sum_textlcm(a,b) = n f(a) g(b)$. It associates because of associativity of $textlcm$. Thanks @darij grinberg who says that this preserves multiplicativity.



Where does it show up?



If the $a,b : BbbN to BbbC$ is multiplicative then consider their natural map into infinite sums of the form $sum_i in BbbN c_i chi_i(n)$ where $chi_i = begincases 1, text if n in (i) \ 0, text if n notin (i)endcases$ where $(i)$ is the ideal in $BbbZ$, and $c_i in BbbC$.



Then the $n$th coefficient of $(acdot 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_textlcm(i,j)=m a(i)b(j)$.




Now take GCD sums:



$$
sum_textgcd(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) = begincases 0, text if (k,n) = 1 \ 1, text if (k,n) gt 1endcases$$
works. It can be expressed as the characteristic map of the set $BbbZ setminus U_k$ where $U_k = $ the units $pmod k$.





Question: When are the series $$sum_iin BbbN c_i chi_i(x), sum_i in BbbN 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.







abstract-algebra elementary-number-theory ring-theory integers least-common-multiple






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Apr 6 at 0:33







I Said Roll Up n Smoke Adjoint

















asked Mar 31 at 3:19









I Said Roll Up n Smoke AdjointI Said Roll Up n Smoke Adjoint

9,33452659




9,33452659







  • 2




    $begingroup$
    Nice problem! You can solve it by direct bijection: If $n$ and $m$ are two coprime positive integers, then there is a bijection from $leftleft(u, vright) mid operatornamelcmleft(u, vright) = nright times leftleft(x, yright) mid operatornamelcmleft(x, yright) = mright$ to $leftleft(p, qright) mid operatornamelcmleft(p, qright) = nmright$ (where all variables are positive integers). The bijection simply sends $left(left(u,vright),left(x,yright)right)$ to $left(ux,vyright)$. Its inverse map sends $left(p,qright)$ to ...
    $endgroup$
    – darij grinberg
    Mar 31 at 4:47







  • 1




    $begingroup$
    ... the pair $left(left(gcdleft(p,nright),gcdleft(q,nright)right),left(gcdleft(p,mright),gcdleft(q,mright)right)right)$.
    $endgroup$
    – darij grinberg
    Mar 31 at 4:48







  • 1




    $begingroup$
    $h(n)=sum_lcm(a,b)=n f(a)g(b) = sum_p^k 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)$
    $endgroup$
    – reuns
    Mar 31 at 15:12











  • $begingroup$
    @darijgrinberg any idea of how it can be applied or what next question I should ask myself as a newbie? 🐸
    $endgroup$
    – I Said Roll Up n Smoke Adjoint
    Apr 1 at 23:51











  • $begingroup$
    @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.
    $endgroup$
    – darij grinberg
    Apr 1 at 23:52













  • 2




    $begingroup$
    Nice problem! You can solve it by direct bijection: If $n$ and $m$ are two coprime positive integers, then there is a bijection from $leftleft(u, vright) mid operatornamelcmleft(u, vright) = nright times leftleft(x, yright) mid operatornamelcmleft(x, yright) = mright$ to $leftleft(p, qright) mid operatornamelcmleft(p, qright) = nmright$ (where all variables are positive integers). The bijection simply sends $left(left(u,vright),left(x,yright)right)$ to $left(ux,vyright)$. Its inverse map sends $left(p,qright)$ to ...
    $endgroup$
    – darij grinberg
    Mar 31 at 4:47







  • 1




    $begingroup$
    ... the pair $left(left(gcdleft(p,nright),gcdleft(q,nright)right),left(gcdleft(p,mright),gcdleft(q,mright)right)right)$.
    $endgroup$
    – darij grinberg
    Mar 31 at 4:48







  • 1




    $begingroup$
    $h(n)=sum_lcm(a,b)=n f(a)g(b) = sum_p^k 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)$
    $endgroup$
    – reuns
    Mar 31 at 15:12











  • $begingroup$
    @darijgrinberg any idea of how it can be applied or what next question I should ask myself as a newbie? 🐸
    $endgroup$
    – I Said Roll Up n Smoke Adjoint
    Apr 1 at 23:51











  • $begingroup$
    @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.
    $endgroup$
    – darij grinberg
    Apr 1 at 23:52








2




2




$begingroup$
Nice problem! You can solve it by direct bijection: If $n$ and $m$ are two coprime positive integers, then there is a bijection from $leftleft(u, vright) mid operatornamelcmleft(u, vright) = nright times leftleft(x, yright) mid operatornamelcmleft(x, yright) = mright$ to $leftleft(p, qright) mid operatornamelcmleft(p, qright) = nmright$ (where all variables are positive integers). The bijection simply sends $left(left(u,vright),left(x,yright)right)$ to $left(ux,vyright)$. Its inverse map sends $left(p,qright)$ to ...
$endgroup$
– darij grinberg
Mar 31 at 4:47





$begingroup$
Nice problem! You can solve it by direct bijection: If $n$ and $m$ are two coprime positive integers, then there is a bijection from $leftleft(u, vright) mid operatornamelcmleft(u, vright) = nright times leftleft(x, yright) mid operatornamelcmleft(x, yright) = mright$ to $leftleft(p, qright) mid operatornamelcmleft(p, qright) = nmright$ (where all variables are positive integers). The bijection simply sends $left(left(u,vright),left(x,yright)right)$ to $left(ux,vyright)$. Its inverse map sends $left(p,qright)$ to ...
$endgroup$
– darij grinberg
Mar 31 at 4:47





1




1




$begingroup$
... the pair $left(left(gcdleft(p,nright),gcdleft(q,nright)right),left(gcdleft(p,mright),gcdleft(q,mright)right)right)$.
$endgroup$
– darij grinberg
Mar 31 at 4:48





$begingroup$
... the pair $left(left(gcdleft(p,nright),gcdleft(q,nright)right),left(gcdleft(p,mright),gcdleft(q,mright)right)right)$.
$endgroup$
– darij grinberg
Mar 31 at 4:48





1




1




$begingroup$
$h(n)=sum_lcm(a,b)=n f(a)g(b) = sum_p^k 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)$
$endgroup$
– reuns
Mar 31 at 15:12





$begingroup$
$h(n)=sum_lcm(a,b)=n f(a)g(b) = sum_p^k 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)$
$endgroup$
– reuns
Mar 31 at 15:12













$begingroup$
@darijgrinberg any idea of how it can be applied or what next question I should ask myself as a newbie? 🐸
$endgroup$
– I Said Roll Up n Smoke Adjoint
Apr 1 at 23:51





$begingroup$
@darijgrinberg any idea of how it can be applied or what next question I should ask myself as a newbie? 🐸
$endgroup$
– I Said Roll Up n Smoke Adjoint
Apr 1 at 23:51













$begingroup$
@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.
$endgroup$
– darij grinberg
Apr 1 at 23:52





$begingroup$
@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.
$endgroup$
– darij grinberg
Apr 1 at 23:52











2 Answers
2






active

oldest

votes


















4












$begingroup$

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 $mathbbC$-algebra of all arithmetic functions (i.e., functions from $left1,2,3,ldotsright$ to $mathbbC$).


  • Let $star$ be the Dirichlet convolution on $A$; this is the binary operation on $A$ defined by $left(f star gright)left(nright) = sumlimits_d mid n fleft(dright) gleft(dfracndright) = sumlimits_substackd geq 1; e geq 1; \ de = n fleft(dright) gleft(eright)$ for every two arithmetic functions $f$ and $g$ and every positive integer $n$.


  • Let $widetildestar$ be the "lcm"-convolution on $A$; this is the binary operation on $A$ defined by $left(f widetildestar gright)left(nright) = sumlimits_substackd geq 1; e geq 1; \ operatornamelcmleft(d, eright) = n fleft(dright) gleft(eright)$ 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 gright) left(nright) = fleft(nright) gleft(nright)$ 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 $Fleft(nright) = sumlimits_d mid n fleft(dright)$. (Note that $F$ can also be described as $underline1 star f$, where $underline1$ is the arithmetic function that is constantly $1$.) Then, $D$ is an isomorphism from the $mathbbC$-algebra $left(A, widetildestarright)$ to the $mathbbC$-algebra $left(A, cdotright)$.




The map $F$ and its inverse both preserve multiplicativity (in fact, $F$ is Dirichlet convolution with the multiplicative function $underline1$, whereas its inverse $F^-1$ is Dirichlet convolution with the multiplicative Möbius function $mu$); thus, it is easy to see that the $widetildestar$ 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 $mathbbC$-algebras $left(A, widetildestarright)$ and $left(A, cdotright)$ are mutually isomorphic, but they are not isomorphic to the $mathbbC$-algebra $left(A, starright)$. Indeed, the former two algebras are isomorphic to the direct product $prod_n geq 1 mathbbC$ 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 $fleft(dright) neq 0$ and a minimal $e geq 1$ such that $gleft(eright) neq 0$; then, $left(f star gright) left(deright) = fleft(dright) gleft(eright) 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 # gright)left(nright) = sumlimits_substackd geq 1; e geq 1; \ gcdleft(d, eright) = n fleft(dright) gleft(eright)$ 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 $leftn geq 1 mid fleft(nright) neq 0right$ 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 $mathbbC$-algebra. Note that $left(A_0, starright)$ and $left(A_0, cdotright)$ and $left(A_0, widetildestarright)$ are nonunital $mathbbC$-algebras as well. Moreover, the two nonunital $mathbbC$-algebras $left(A_0, cdotright)$ 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 $Fleft(nright) = sumlimits_n mid d fleft(dright)$ (where the sum ranges over all positive multiples $d$ of $n$). Then, $U$ is an isomorphism from the nonunital $mathbbC$-algebra $left(A_0, #right)$ to the nonunital $mathbbC$-algebra $left(A_0, cdotright)$.




The two isomorphic nonunital rings $left(A_0, #right)$ and $left(A_0, cdotright)$ have no unity, while the two rings $left(A_0, widetildestarright)$ and $left(A_0, starright)$ 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, widetildestarright)$ and $left(A_0, starright)$ are not isomorphic either. Indeed, the ring $left(A_0, starright)$ is an integral domain (being a subring of the integral domain $left(A, starright)$), whereas the ring $left(A_0, widetildestarright)$ 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_pqright) widetildestar e_q = 0$ but $e_p - e_pq neq 0$ and $e_q neq 0$).






share|cite|improve this answer











$endgroup$












  • $begingroup$
    When looking at modular forms there are 5 more natural operations : additive convolution, $cdot $ on the $log $ side, Hecke algebra, Galois action, reductions $bmod mathfrakp$
    $endgroup$
    – reuns
    Apr 3 at 1:47











  • $begingroup$
    @reuns: Can you restate these in terms of arithmetic functions?
    $endgroup$
    – darij grinberg
    Apr 3 at 3:37


















1












$begingroup$

About Darij Grinberg's isomorphism :




  • $f star g(n) = sum_ nf(d)g(n/d)$



    $f, widetildestar, 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,widetildestar),
    (A,cdot)$
    on the vector space of complex valued sequences



  • $1_n=a, widetildestar, 1_m=b(k) =1_ lcm(a,b ) =k $ and $1 star 1_ lcm(a,b )=n(k) = sum_ k 1_lcm(a,b )=d =1_ lcm(a,b ) = 1_k 1_b = (1 star 1_n=a(k))cdot(1 star 1_n=b(k))$


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


  • If $f,g$ are multiplicative then so is $mu star ((1,widetildestar,f)cdot (1,widetildestar , g)) = f ,widetildestar, 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)^mm ( underbracef 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 frac1m! ( underbraceg 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







share|cite|improve this answer











$endgroup$












  • $begingroup$
    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$?
    $endgroup$
    – I Said Roll Up n Smoke Adjoint
    Apr 4 at 5:20












Your Answer








StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3169021%2fcan-we-invert-these-analogous-dirichlet-series-for-gcd-lcm-convolution%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes









4












$begingroup$

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 $mathbbC$-algebra of all arithmetic functions (i.e., functions from $left1,2,3,ldotsright$ to $mathbbC$).


  • Let $star$ be the Dirichlet convolution on $A$; this is the binary operation on $A$ defined by $left(f star gright)left(nright) = sumlimits_d mid n fleft(dright) gleft(dfracndright) = sumlimits_substackd geq 1; e geq 1; \ de = n fleft(dright) gleft(eright)$ for every two arithmetic functions $f$ and $g$ and every positive integer $n$.


  • Let $widetildestar$ be the "lcm"-convolution on $A$; this is the binary operation on $A$ defined by $left(f widetildestar gright)left(nright) = sumlimits_substackd geq 1; e geq 1; \ operatornamelcmleft(d, eright) = n fleft(dright) gleft(eright)$ 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 gright) left(nright) = fleft(nright) gleft(nright)$ 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 $Fleft(nright) = sumlimits_d mid n fleft(dright)$. (Note that $F$ can also be described as $underline1 star f$, where $underline1$ is the arithmetic function that is constantly $1$.) Then, $D$ is an isomorphism from the $mathbbC$-algebra $left(A, widetildestarright)$ to the $mathbbC$-algebra $left(A, cdotright)$.




The map $F$ and its inverse both preserve multiplicativity (in fact, $F$ is Dirichlet convolution with the multiplicative function $underline1$, whereas its inverse $F^-1$ is Dirichlet convolution with the multiplicative Möbius function $mu$); thus, it is easy to see that the $widetildestar$ 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 $mathbbC$-algebras $left(A, widetildestarright)$ and $left(A, cdotright)$ are mutually isomorphic, but they are not isomorphic to the $mathbbC$-algebra $left(A, starright)$. Indeed, the former two algebras are isomorphic to the direct product $prod_n geq 1 mathbbC$ 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 $fleft(dright) neq 0$ and a minimal $e geq 1$ such that $gleft(eright) neq 0$; then, $left(f star gright) left(deright) = fleft(dright) gleft(eright) 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 # gright)left(nright) = sumlimits_substackd geq 1; e geq 1; \ gcdleft(d, eright) = n fleft(dright) gleft(eright)$ 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 $leftn geq 1 mid fleft(nright) neq 0right$ 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 $mathbbC$-algebra. Note that $left(A_0, starright)$ and $left(A_0, cdotright)$ and $left(A_0, widetildestarright)$ are nonunital $mathbbC$-algebras as well. Moreover, the two nonunital $mathbbC$-algebras $left(A_0, cdotright)$ 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 $Fleft(nright) = sumlimits_n mid d fleft(dright)$ (where the sum ranges over all positive multiples $d$ of $n$). Then, $U$ is an isomorphism from the nonunital $mathbbC$-algebra $left(A_0, #right)$ to the nonunital $mathbbC$-algebra $left(A_0, cdotright)$.




The two isomorphic nonunital rings $left(A_0, #right)$ and $left(A_0, cdotright)$ have no unity, while the two rings $left(A_0, widetildestarright)$ and $left(A_0, starright)$ 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, widetildestarright)$ and $left(A_0, starright)$ are not isomorphic either. Indeed, the ring $left(A_0, starright)$ is an integral domain (being a subring of the integral domain $left(A, starright)$), whereas the ring $left(A_0, widetildestarright)$ 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_pqright) widetildestar e_q = 0$ but $e_p - e_pq neq 0$ and $e_q neq 0$).






share|cite|improve this answer











$endgroup$












  • $begingroup$
    When looking at modular forms there are 5 more natural operations : additive convolution, $cdot $ on the $log $ side, Hecke algebra, Galois action, reductions $bmod mathfrakp$
    $endgroup$
    – reuns
    Apr 3 at 1:47











  • $begingroup$
    @reuns: Can you restate these in terms of arithmetic functions?
    $endgroup$
    – darij grinberg
    Apr 3 at 3:37















4












$begingroup$

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 $mathbbC$-algebra of all arithmetic functions (i.e., functions from $left1,2,3,ldotsright$ to $mathbbC$).


  • Let $star$ be the Dirichlet convolution on $A$; this is the binary operation on $A$ defined by $left(f star gright)left(nright) = sumlimits_d mid n fleft(dright) gleft(dfracndright) = sumlimits_substackd geq 1; e geq 1; \ de = n fleft(dright) gleft(eright)$ for every two arithmetic functions $f$ and $g$ and every positive integer $n$.


  • Let $widetildestar$ be the "lcm"-convolution on $A$; this is the binary operation on $A$ defined by $left(f widetildestar gright)left(nright) = sumlimits_substackd geq 1; e geq 1; \ operatornamelcmleft(d, eright) = n fleft(dright) gleft(eright)$ 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 gright) left(nright) = fleft(nright) gleft(nright)$ 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 $Fleft(nright) = sumlimits_d mid n fleft(dright)$. (Note that $F$ can also be described as $underline1 star f$, where $underline1$ is the arithmetic function that is constantly $1$.) Then, $D$ is an isomorphism from the $mathbbC$-algebra $left(A, widetildestarright)$ to the $mathbbC$-algebra $left(A, cdotright)$.




The map $F$ and its inverse both preserve multiplicativity (in fact, $F$ is Dirichlet convolution with the multiplicative function $underline1$, whereas its inverse $F^-1$ is Dirichlet convolution with the multiplicative Möbius function $mu$); thus, it is easy to see that the $widetildestar$ 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 $mathbbC$-algebras $left(A, widetildestarright)$ and $left(A, cdotright)$ are mutually isomorphic, but they are not isomorphic to the $mathbbC$-algebra $left(A, starright)$. Indeed, the former two algebras are isomorphic to the direct product $prod_n geq 1 mathbbC$ 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 $fleft(dright) neq 0$ and a minimal $e geq 1$ such that $gleft(eright) neq 0$; then, $left(f star gright) left(deright) = fleft(dright) gleft(eright) 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 # gright)left(nright) = sumlimits_substackd geq 1; e geq 1; \ gcdleft(d, eright) = n fleft(dright) gleft(eright)$ 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 $leftn geq 1 mid fleft(nright) neq 0right$ 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 $mathbbC$-algebra. Note that $left(A_0, starright)$ and $left(A_0, cdotright)$ and $left(A_0, widetildestarright)$ are nonunital $mathbbC$-algebras as well. Moreover, the two nonunital $mathbbC$-algebras $left(A_0, cdotright)$ 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 $Fleft(nright) = sumlimits_n mid d fleft(dright)$ (where the sum ranges over all positive multiples $d$ of $n$). Then, $U$ is an isomorphism from the nonunital $mathbbC$-algebra $left(A_0, #right)$ to the nonunital $mathbbC$-algebra $left(A_0, cdotright)$.




The two isomorphic nonunital rings $left(A_0, #right)$ and $left(A_0, cdotright)$ have no unity, while the two rings $left(A_0, widetildestarright)$ and $left(A_0, starright)$ 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, widetildestarright)$ and $left(A_0, starright)$ are not isomorphic either. Indeed, the ring $left(A_0, starright)$ is an integral domain (being a subring of the integral domain $left(A, starright)$), whereas the ring $left(A_0, widetildestarright)$ 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_pqright) widetildestar e_q = 0$ but $e_p - e_pq neq 0$ and $e_q neq 0$).






share|cite|improve this answer











$endgroup$












  • $begingroup$
    When looking at modular forms there are 5 more natural operations : additive convolution, $cdot $ on the $log $ side, Hecke algebra, Galois action, reductions $bmod mathfrakp$
    $endgroup$
    – reuns
    Apr 3 at 1:47











  • $begingroup$
    @reuns: Can you restate these in terms of arithmetic functions?
    $endgroup$
    – darij grinberg
    Apr 3 at 3:37













4












4








4





$begingroup$

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 $mathbbC$-algebra of all arithmetic functions (i.e., functions from $left1,2,3,ldotsright$ to $mathbbC$).


  • Let $star$ be the Dirichlet convolution on $A$; this is the binary operation on $A$ defined by $left(f star gright)left(nright) = sumlimits_d mid n fleft(dright) gleft(dfracndright) = sumlimits_substackd geq 1; e geq 1; \ de = n fleft(dright) gleft(eright)$ for every two arithmetic functions $f$ and $g$ and every positive integer $n$.


  • Let $widetildestar$ be the "lcm"-convolution on $A$; this is the binary operation on $A$ defined by $left(f widetildestar gright)left(nright) = sumlimits_substackd geq 1; e geq 1; \ operatornamelcmleft(d, eright) = n fleft(dright) gleft(eright)$ 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 gright) left(nright) = fleft(nright) gleft(nright)$ 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 $Fleft(nright) = sumlimits_d mid n fleft(dright)$. (Note that $F$ can also be described as $underline1 star f$, where $underline1$ is the arithmetic function that is constantly $1$.) Then, $D$ is an isomorphism from the $mathbbC$-algebra $left(A, widetildestarright)$ to the $mathbbC$-algebra $left(A, cdotright)$.




The map $F$ and its inverse both preserve multiplicativity (in fact, $F$ is Dirichlet convolution with the multiplicative function $underline1$, whereas its inverse $F^-1$ is Dirichlet convolution with the multiplicative Möbius function $mu$); thus, it is easy to see that the $widetildestar$ 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 $mathbbC$-algebras $left(A, widetildestarright)$ and $left(A, cdotright)$ are mutually isomorphic, but they are not isomorphic to the $mathbbC$-algebra $left(A, starright)$. Indeed, the former two algebras are isomorphic to the direct product $prod_n geq 1 mathbbC$ 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 $fleft(dright) neq 0$ and a minimal $e geq 1$ such that $gleft(eright) neq 0$; then, $left(f star gright) left(deright) = fleft(dright) gleft(eright) 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 # gright)left(nright) = sumlimits_substackd geq 1; e geq 1; \ gcdleft(d, eright) = n fleft(dright) gleft(eright)$ 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 $leftn geq 1 mid fleft(nright) neq 0right$ 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 $mathbbC$-algebra. Note that $left(A_0, starright)$ and $left(A_0, cdotright)$ and $left(A_0, widetildestarright)$ are nonunital $mathbbC$-algebras as well. Moreover, the two nonunital $mathbbC$-algebras $left(A_0, cdotright)$ 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 $Fleft(nright) = sumlimits_n mid d fleft(dright)$ (where the sum ranges over all positive multiples $d$ of $n$). Then, $U$ is an isomorphism from the nonunital $mathbbC$-algebra $left(A_0, #right)$ to the nonunital $mathbbC$-algebra $left(A_0, cdotright)$.




The two isomorphic nonunital rings $left(A_0, #right)$ and $left(A_0, cdotright)$ have no unity, while the two rings $left(A_0, widetildestarright)$ and $left(A_0, starright)$ 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, widetildestarright)$ and $left(A_0, starright)$ are not isomorphic either. Indeed, the ring $left(A_0, starright)$ is an integral domain (being a subring of the integral domain $left(A, starright)$), whereas the ring $left(A_0, widetildestarright)$ 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_pqright) widetildestar e_q = 0$ but $e_p - e_pq neq 0$ and $e_q neq 0$).






share|cite|improve this answer











$endgroup$



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 $mathbbC$-algebra of all arithmetic functions (i.e., functions from $left1,2,3,ldotsright$ to $mathbbC$).


  • Let $star$ be the Dirichlet convolution on $A$; this is the binary operation on $A$ defined by $left(f star gright)left(nright) = sumlimits_d mid n fleft(dright) gleft(dfracndright) = sumlimits_substackd geq 1; e geq 1; \ de = n fleft(dright) gleft(eright)$ for every two arithmetic functions $f$ and $g$ and every positive integer $n$.


  • Let $widetildestar$ be the "lcm"-convolution on $A$; this is the binary operation on $A$ defined by $left(f widetildestar gright)left(nright) = sumlimits_substackd geq 1; e geq 1; \ operatornamelcmleft(d, eright) = n fleft(dright) gleft(eright)$ 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 gright) left(nright) = fleft(nright) gleft(nright)$ 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 $Fleft(nright) = sumlimits_d mid n fleft(dright)$. (Note that $F$ can also be described as $underline1 star f$, where $underline1$ is the arithmetic function that is constantly $1$.) Then, $D$ is an isomorphism from the $mathbbC$-algebra $left(A, widetildestarright)$ to the $mathbbC$-algebra $left(A, cdotright)$.




The map $F$ and its inverse both preserve multiplicativity (in fact, $F$ is Dirichlet convolution with the multiplicative function $underline1$, whereas its inverse $F^-1$ is Dirichlet convolution with the multiplicative Möbius function $mu$); thus, it is easy to see that the $widetildestar$ 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 $mathbbC$-algebras $left(A, widetildestarright)$ and $left(A, cdotright)$ are mutually isomorphic, but they are not isomorphic to the $mathbbC$-algebra $left(A, starright)$. Indeed, the former two algebras are isomorphic to the direct product $prod_n geq 1 mathbbC$ 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 $fleft(dright) neq 0$ and a minimal $e geq 1$ such that $gleft(eright) neq 0$; then, $left(f star gright) left(deright) = fleft(dright) gleft(eright) 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 # gright)left(nright) = sumlimits_substackd geq 1; e geq 1; \ gcdleft(d, eright) = n fleft(dright) gleft(eright)$ 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 $leftn geq 1 mid fleft(nright) neq 0right$ 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 $mathbbC$-algebra. Note that $left(A_0, starright)$ and $left(A_0, cdotright)$ and $left(A_0, widetildestarright)$ are nonunital $mathbbC$-algebras as well. Moreover, the two nonunital $mathbbC$-algebras $left(A_0, cdotright)$ 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 $Fleft(nright) = sumlimits_n mid d fleft(dright)$ (where the sum ranges over all positive multiples $d$ of $n$). Then, $U$ is an isomorphism from the nonunital $mathbbC$-algebra $left(A_0, #right)$ to the nonunital $mathbbC$-algebra $left(A_0, cdotright)$.




The two isomorphic nonunital rings $left(A_0, #right)$ and $left(A_0, cdotright)$ have no unity, while the two rings $left(A_0, widetildestarright)$ and $left(A_0, starright)$ 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, widetildestarright)$ and $left(A_0, starright)$ are not isomorphic either. Indeed, the ring $left(A_0, starright)$ is an integral domain (being a subring of the integral domain $left(A, starright)$), whereas the ring $left(A_0, widetildestarright)$ 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_pqright) widetildestar e_q = 0$ but $e_p - e_pq neq 0$ and $e_q neq 0$).







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Apr 2 at 0:47

























answered Apr 2 at 0:04









darij grinbergdarij grinberg

11.5k33168




11.5k33168











  • $begingroup$
    When looking at modular forms there are 5 more natural operations : additive convolution, $cdot $ on the $log $ side, Hecke algebra, Galois action, reductions $bmod mathfrakp$
    $endgroup$
    – reuns
    Apr 3 at 1:47











  • $begingroup$
    @reuns: Can you restate these in terms of arithmetic functions?
    $endgroup$
    – darij grinberg
    Apr 3 at 3:37
















  • $begingroup$
    When looking at modular forms there are 5 more natural operations : additive convolution, $cdot $ on the $log $ side, Hecke algebra, Galois action, reductions $bmod mathfrakp$
    $endgroup$
    – reuns
    Apr 3 at 1:47











  • $begingroup$
    @reuns: Can you restate these in terms of arithmetic functions?
    $endgroup$
    – darij grinberg
    Apr 3 at 3:37















$begingroup$
When looking at modular forms there are 5 more natural operations : additive convolution, $cdot $ on the $log $ side, Hecke algebra, Galois action, reductions $bmod mathfrakp$
$endgroup$
– reuns
Apr 3 at 1:47





$begingroup$
When looking at modular forms there are 5 more natural operations : additive convolution, $cdot $ on the $log $ side, Hecke algebra, Galois action, reductions $bmod mathfrakp$
$endgroup$
– reuns
Apr 3 at 1:47













$begingroup$
@reuns: Can you restate these in terms of arithmetic functions?
$endgroup$
– darij grinberg
Apr 3 at 3:37




$begingroup$
@reuns: Can you restate these in terms of arithmetic functions?
$endgroup$
– darij grinberg
Apr 3 at 3:37











1












$begingroup$

About Darij Grinberg's isomorphism :




  • $f star g(n) = sum_ nf(d)g(n/d)$



    $f, widetildestar, 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,widetildestar),
    (A,cdot)$
    on the vector space of complex valued sequences



  • $1_n=a, widetildestar, 1_m=b(k) =1_ lcm(a,b ) =k $ and $1 star 1_ lcm(a,b )=n(k) = sum_ k 1_lcm(a,b )=d =1_ lcm(a,b ) = 1_k 1_b = (1 star 1_n=a(k))cdot(1 star 1_n=b(k))$


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


  • If $f,g$ are multiplicative then so is $mu star ((1,widetildestar,f)cdot (1,widetildestar , g)) = f ,widetildestar, 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)^mm ( underbracef 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 frac1m! ( underbraceg 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







share|cite|improve this answer











$endgroup$












  • $begingroup$
    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$?
    $endgroup$
    – I Said Roll Up n Smoke Adjoint
    Apr 4 at 5:20
















1












$begingroup$

About Darij Grinberg's isomorphism :




  • $f star g(n) = sum_ nf(d)g(n/d)$



    $f, widetildestar, 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,widetildestar),
    (A,cdot)$
    on the vector space of complex valued sequences



  • $1_n=a, widetildestar, 1_m=b(k) =1_ lcm(a,b ) =k $ and $1 star 1_ lcm(a,b )=n(k) = sum_ k 1_lcm(a,b )=d =1_ lcm(a,b ) = 1_k 1_b = (1 star 1_n=a(k))cdot(1 star 1_n=b(k))$


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


  • If $f,g$ are multiplicative then so is $mu star ((1,widetildestar,f)cdot (1,widetildestar , g)) = f ,widetildestar, 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)^mm ( underbracef 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 frac1m! ( underbraceg 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







share|cite|improve this answer











$endgroup$












  • $begingroup$
    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$?
    $endgroup$
    – I Said Roll Up n Smoke Adjoint
    Apr 4 at 5:20














1












1








1





$begingroup$

About Darij Grinberg's isomorphism :




  • $f star g(n) = sum_ nf(d)g(n/d)$



    $f, widetildestar, 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,widetildestar),
    (A,cdot)$
    on the vector space of complex valued sequences



  • $1_n=a, widetildestar, 1_m=b(k) =1_ lcm(a,b ) =k $ and $1 star 1_ lcm(a,b )=n(k) = sum_ k 1_lcm(a,b )=d =1_ lcm(a,b ) = 1_k 1_b = (1 star 1_n=a(k))cdot(1 star 1_n=b(k))$


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


  • If $f,g$ are multiplicative then so is $mu star ((1,widetildestar,f)cdot (1,widetildestar , g)) = f ,widetildestar, 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)^mm ( underbracef 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 frac1m! ( underbraceg 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







share|cite|improve this answer











$endgroup$



About Darij Grinberg's isomorphism :




  • $f star g(n) = sum_ nf(d)g(n/d)$



    $f, widetildestar, 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,widetildestar),
    (A,cdot)$
    on the vector space of complex valued sequences



  • $1_n=a, widetildestar, 1_m=b(k) =1_ lcm(a,b ) =k $ and $1 star 1_ lcm(a,b )=n(k) = sum_ k 1_lcm(a,b )=d =1_ lcm(a,b ) = 1_k 1_b = (1 star 1_n=a(k))cdot(1 star 1_n=b(k))$


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


  • If $f,g$ are multiplicative then so is $mu star ((1,widetildestar,f)cdot (1,widetildestar , g)) = f ,widetildestar, 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)^mm ( underbracef 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 frac1m! ( underbraceg 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








share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Apr 2 at 1:27

























answered Apr 2 at 1:04









reunsreuns

20.9k21354




20.9k21354











  • $begingroup$
    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$?
    $endgroup$
    – I Said Roll Up n Smoke Adjoint
    Apr 4 at 5:20

















  • $begingroup$
    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$?
    $endgroup$
    – I Said Roll Up n Smoke Adjoint
    Apr 4 at 5:20
















$begingroup$
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$?
$endgroup$
– I Said Roll Up n Smoke Adjoint
Apr 4 at 5:20





$begingroup$
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$?
$endgroup$
– I Said Roll Up n Smoke Adjoint
Apr 4 at 5:20


















draft saved

draft discarded
















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3169021%2fcan-we-invert-these-analogous-dirichlet-series-for-gcd-lcm-convolution%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ