Proofs#
Polar Fourier expansion and Parseval identity#
Let
and let \(f\in L^2(D_R,r\,dr\,d\theta)\). Define
For almost every fixed \(r\), the function \(f(r,\cdot)\) belongs to \(L^2(S^1)\). The Fourier basis is complete, so
in angular \(L^2\), and
Proof#
Since
Fubini’s theorem implies that the inner integral is finite for almost every \(r\). Thus \(f(r,\cdot)\in L^2(S^1)\) for almost every \(r\).
The functions
form a complete orthonormal basis of \(L^2(S^1)\). The coefficients \(\rho_m(r)\) are the corresponding Fourier coefficients. Completeness gives angular \(L^2\) convergence, and Parseval’s identity gives the pointwise-in-\(r\) norm relation above.
Multiplying by \(2\pi r\) and integrating radially gives
Define
Then the total polar power is \(2\pi\sum_mP_m\).
Exact reconstruction error#
Let \(S\subset\mathbb Z\) be a set of retained harmonics and define
Then
Proof#
The omitted field is
Orthogonality of distinct angular harmonics gives
while Parseval gives
Using
and taking the positive square root gives the result.
PETAL2D reports this quantity as a percentage.
Optimal power-ranked truncation#
Suppose admissible selection units have powers
For a complex field, a unit can be one angular channel. For a real field, the admissible units are \(m=0\), conjugate pairs \((m,-m)\), and the even-grid Nyquist singleton when present.
For any fixed number \(K\) of units, retaining the first \(K\) units minimizes the reconstruction error. The first \(K\) that satisfies the requested error tolerance also uses the minimum number of admissible units.
Proof#
The reconstruction-error formula is monotone in retained power. Minimizing the error is equivalent to maximizing
over all admissible sets \(S\) containing \(K\) units.
If a proposed set contains \(Q_a\) and omits a larger \(Q_b\), replacing \(Q_a\) by \(Q_b\) increases retained power. Repeating this exchange produces the set \(\{Q_1,\ldots,Q_K\}\). No other \(K\)-unit set retains more power.
If the first \(K\) ranked units fail the error target, every other \(K\)-unit set retains no more power and must also fail. The first successful ranked value of \(K\) is minimal.
Real-valued fields and conjugate pairs#
If \(f\) is real-valued,
Consequently,
Proof#
Taking the complex conjugate of the coefficient gives
because \(f^*=f\). The right-hand side is \(\rho_{-m}(r)\).
A conjugate pair reconstructs as
which is real. This is why PETAL2D keeps conjugate pairs together for real input.
Rotation covariance#
For an active rotation
the angular coefficients transform as
Therefore
Proof#
Insert the rotated field into the coefficient definition:
Set \(u=\theta-\phi\). Periodicity restores the integration interval to \([0,2\pi)\) and
Hence
Taking the modulus squared removes the phase factor.
Rotational selection rules#
Suppose a field transforms under a rotation by \(2\pi/n\) as
where \(\ell\) is an integer modulo \(n\). Then any nonzero angular coefficient satisfies
The invariant scalar case corresponds to \(\ell=0\).
Proof#
Insert the Fourier expansion:
Uniqueness of Fourier coefficients gives
For \(\rho_m(r)\ne0\),
so \(m-\ell\) is divisible by \(n\).
Discrete angular aliasing#
For
harmonics whose indices differ by an integer multiple of \(N_\theta\) are identical on the sampled angular grid.
Proof#
For any integer \(k\),
The samples cannot distinguish \(m\) from \(m+kN_\theta\). This is the origin of angular aliasing and the Nyquist limit.
Angular-momentum interpretation for a wavefunction#
If the analyzed field is a normalized complex wavefunction,
the fixed-\(m\) subspace is the eigenspace of the planar operator
with eigenvalue \(m\hbar\).
The squared norm of the projection onto this subspace is
Since normalization gives
the angular-momentum probability is
This interpretation applies to the wavefunction itself. A density such as \(|\psi|^2\) does not retain the phase required for the same angular-momentum interpretation.
Translation of the power centroid#
Define
For
and an integration domain translated with the field,
Proof#
Set \(\mathbf u=\mathbf r-\mathbf a\). The denominator is unchanged. The numerator becomes
Dividing by the common denominator gives the result.