Quantum and CircuitsReading edition

Rational character-order projectors

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.4 Rational character-order projectors

It is helpful to distinguish the size of an ambient signal from the order of a character. Fix a positive ambient length \(N\). For each divisor \(d\) of \(N\), define

\[ S_d=\{a\in I_N:N/\gcd(a,N)=d\}. \]

The set \(S_d\) contains the labels of characters of exact order \(d\). Put \(D_d=\operatorname{diag}(\mathbf1_{a\in S_d})\) and

\[ P_d^{(N)}=F_ND_dF_N^\dagger. \]

The superscript records the ambient dimension. In particular, the kernel normalization below is \(1/N\), even when \(d<N\).

Theorem QA06: Rational kernels and complete divisor decomposition

For every \(d\mid N\),

\[ \boxed{(P_d^{(N)})_{nm}=\frac1N c_d(n-m).} \]

The matrices have rational entries and satisfy

\[ \begin{aligned} (P_d^{(N)})^\dagger&=P_d^{(N)},\\ P_d^{(N)}P_e^{(N)}&=\delta_{de}P_d^{(N)},\\ \sum_{d\mid N}P_d^{(N)}&=\operatorname{Id}_N,\\ \operatorname{rank}P_d^{(N)}&=\operatorname{tr}P_d^{(N)}=\varphi(d). \end{aligned} \]

Proof

A label in \(S_d\) has the unique form \(a=(N/d)b\), where \(0\le b<d\) and \(\gcd(b,d)=1\). Indeed,

\[ \gcd((N/d)b,N)=(N/d)\gcd(b,d). \]

Direct multiplication therefore gives

\[ \begin{aligned} (F_ND_dF_N^\dagger)_{nm} &=\frac1N\sum_{a\in S_d}\zeta_N^{a(n-m)}\\ &=\frac1N\sum_{b\in U_d}\zeta_d^{b(n-m)} =\frac1N c_d(n-m). \end{aligned} \]

QA04 proves rationality. Each \(D_d\) is a self-adjoint diagonal projector. The sets \(S_d\) partition \(I_N\), because every character has exactly one order dividing \(N\). Hence \(D_dD_e=\delta_{de}D_d\) and \(\sum_{d\mid N}D_d=\operatorname{Id}_N\). Conjugating these identities by the unitary \(F_N\) proves the projector identities. The rank is unchanged under multiplication by invertible matrices, so it equals the number of selected diagonal entries, \(|S_d|=\varphi(d)\). The diagonal kernel entries are all \(c_d(0)/N=\varphi(d)/N\), whose sum is \(\varphi(d)\). \(\square\)

This orthogonal divisor-shell decomposition has established antecedents in Ramanujan subspaces and filter banks [2], [3], [4]. The general theorem above is proved independently in this text. The formal companion certifies the concrete \(N=d=12\) projector and its transport identity, rather than an arbitrary-divisor Lean theorem.

1.4.1 A shift-operator realization and its sign

Let \(A\) be the cyclic shift \((Ax)(n)=x(n-1)\). A Fourier column \(f_a(n)=N^{-1/2}\zeta_N^{na}\) satisfies \(Af_a=\zeta_N^{-a}f_a\). Therefore

\[ E_a=\frac1N\sum_{\ell=0}^{N-1}\zeta_N^{a\ell}A^\ell \]

acts as the identity on \(f_a\) and as zero on every other column, by QA02. Summing \(E_a\) over \(S_d\) gives

\[ P_d^{(N)}=\frac1N\sum_{\ell=0}^{N-1}c_d(\ell)A^\ell. \]

This formula also follows entrywise because \((A^\ell)_{nm}\) is one exactly when \(n-m=\ell\) modulo \(N\). A group-algebra convention with the opposite shift sign writes individual idempotents with the opposite phase sign. The divisor shells are unchanged under \(a\mapsto -a\), and \(c_d(-\ell)=c_d(\ell)\), so the rational shell formula remains the same.

Proposition 21.11 of Stratified Universality for Resolved Representations, gives the rational cyclic order-projector formula in the group algebra. Boundary 21.12 distinguishes it from formal-series coefficient-residue selection [5]. The present shift calculation makes the representation and the sign explicit.

1.4.2 Unions of order classes

If \(\mathcal D\) is any set of divisors of \(N\), then

\[ P_{\mathcal D}=\sum_{d\in\mathcal D}P_d^{(N)} \]

is a rational orthogonal projector of rank \(\sum_{d\in\mathcal D}\varphi(d)\). Its complement is the sum over the remaining divisors. Individual split Fourier projectors can have nonrational entries. Summing complete order classes is a sufficient mechanism for rationality. No converse classification of every rational selector is needed for the present bridge.

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