<?xml version="1.0" encoding="UTF-8"?>

<record version="2" id="9181">
 <title>formula for the convolution inverse of a completely multiplicative function</title>
 <name>FormulaForTheConvolutionInverseOfACompletelyMultiplicativeFunction</name>
 <created>2007-04-14 01:49:13</created>
 <modified>2007-04-15 07:59:03</modified>
 <type>Corollary</type>
<parent id="8022">pointwise multiplication of a completely multiplicative function distibutes over convolution</parent>
 <creator id="1863" name="Wkbj79"/>
 <author id="1863" name="Wkbj79"/>
 <classification>
	<category scheme="msc" code="11A25"/>
 </classification>
 <related>
	<object name="CriterionForAMultiplicativeFunctionToBeCompletelyMultiplicative"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

\usepackage{psfrag}
\usepackage{graphicx}
\usepackage{amsthm}
\usepackage{xypic}

\newtheorem{cor*}{Corollary}
</preamble>
 <content>\PMlinkescapeword{formula}

\begin{cor*}
If $f$ is a completely multiplicative function, then its convolution inverse is $f\mu$, where $\mu$ denotes the M\"{o}bius function.
\end{cor*}

\begin{proof}
Recall the M\"{o}bius inversion formula $1*\mu = \varepsilon$, where $\varepsilon$ denotes the convolution identity function.  Thus, $f(1*\mu) = f\varepsilon$.  Since \PMlinkname{pointwise multiplication of a completely multiplicative function distributes over convolution}{PropertyOfCompletelyMultiplicativeFunctions}, $(f \cdot 1)*(f\mu)=f\varepsilon$.  Note that, for all natural numbers $n$, $f(n)1(n)=f(n) \cdot 1=f(n)$ and $f(n)\varepsilon(n)=\varepsilon(n)$.  Thus, $f*(f \mu)=\varepsilon$.  It follows that $f\mu$ is the convolution inverse of $f$.
\end{proof}</content>
</record>
