Quantum and CircuitsReading edition

Coprimality becomes an integer signal

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

Start reading

Resources & source

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

1.3 Coprimality becomes an integer signal

Let

\[ U_q=\{a\in I_q:\gcd(a,q)=1\}, \qquad \varphi(q)=|U_q|. \]

The Ramanujan sum is

\[ c_q(n)=\sum_{a\in U_q}\zeta_q^{an}, \qquad n\in\mathbb Z. \]

It adds the primitive \(q\)th-root phases selected by QA01. Its definition is complex, but its value is an integer. That integrality is the step that makes the sample-coordinate projector rational. Ramanujan sums and their divisor formulas are classical arithmetic constructions [1].

Theorem QA04: Möbius formula and integrality

Let \(\mu\) be the Möbius function, with \(\mu(1)=1\). For every positive \(q\) and every integer \(n\),

\[ \boxed{c_q(n)=\sum_{d\mid\gcd(q,n)}d\,\mu(q/d)\in\mathbb Z.} \]

In particular \(c_q\) has period \(q\), is real-valued, satisfies \(c_q(-n)=c_q(n)\), and has \(c_q(0)=\varphi(q)\).

Proof

For a positive integer \(g\),

\[ \sum_{d\mid g}\mu(d) =\begin{cases}1,&g=1,\\0,&g>1.\end{cases} \]

To see this, only squarefree divisors contribute. If \(g\) has \(r\) distinct prime factors, the sum is \((1-1)^r\), with value one when \(r=0\). Therefore

\[ \mathbf1_{\gcd(a,q)=1}=\sum_{d\mid\gcd(a,q)}\mu(d). \]

Substitute this into the phase sum over all \(a\in I_q\), exchange the finite sums, and write \(a=db\) in the terms where \(d\mid a\):

\[ \begin{aligned} c_q(n) &=\sum_{d\mid q}\mu(d) \sum_{b=0}^{q/d-1}e^{2\pi ibn/(q/d)}\\ &=\sum_{\substack{d\mid q\\(q/d)\mid n}}\mu(d)\frac qd. \end{aligned} \]

The second equality is QA02. Replacing \(q/d\) by \(e\) gives the displayed divisor sum. It is an integer. Periodicity follows already from the phase definition. The divisor formula is unchanged by \(n\mapsto -n\), so \(c_q(-n)=c_q(n)\). At \(n=0\), every selected phase is one, giving \(c_q(0)=|U_q|\). \(\square\)

At \(q=1\), \(U_1=\{0\}\) because \(\gcd(0,1)=1\). The phase sum and the divisor formula both give \(c_1(n)=1\). This boundary case is included in the proofs even though the inherited arithmetic regression range begins at modulus two.

Theorem QA05: Exact spectral support and energy

Over one period,

\[ \boxed{\widehat{c_q}(k)=q\,\mathbf1_{k\in U_q},\qquad k\in I_q.} \]

Moreover,

\[ \sum_{n=0}^{q-1}|c_q(n)|^2=q\varphi(q). \]

Proof

Substitute the phase definition and exchange two finite sums:

\[ \widehat{c_q}(k) =\sum_{a\in U_q}\sum_{n=0}^{q-1}\zeta_q^{(a-k)n}. \]

QA02 makes the inner sum \(q\) exactly when \(a=k\), and zero otherwise. The energy identity follows from QA03:

\[ \|c_q\|^2 =\frac1q\sum_k|\widehat{c_q}(k)|^2 =\frac1q\varphi(q)q^2. \]

\(\square\)

The selector has been recovered by an identity. A numerical spectrum can illustrate the result, but neither a tolerance nor a peak-finding rule defines the arithmetic support.

Source and conversion record

Source SHA-256: 27e2a58abc6b464edd826fc32131936fb714ba184eff04b2000abed701f087e3

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Quantum and Circuits

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index