Proof of `A small Fourier decoding set independent of side conditions` (1st statement)
groundedproofs/Lax323828Proofs/FourierDecoding.lean · lax-323828
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The counting bound applies because Parseval gives total squared mass one.