How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Finite torus fourier orthogonality and affine change
Statement
For the normalized negative-exponent Fourier transform on , the characters are an orthonormal basis, and For every invertible matrix over , and ,
Facts & Assumptions
Given: the objects and hypotheses in the statement above.
On , , let and . Residue representatives do not affect these values. With inner product , define The norm is . At there is one character, the constant function one. The sign in the exponent is part of this convention. (Finite torus fourier transform).
Proof
For , is if modulo , and otherwise is zero because multiplication by telescopes to . Applying this to each coordinate shows is one for and zero otherwise. At the one character has norm one directly.
There are orthonormal characters in the -dimensional function space, hence they form a basis: linear independence follows by taking inner products, and an independent list of that length spans by elementary elimination. Expansion in this basis gives inversion and, on taking its squared norm, Parseval. The zero coefficient is exactly the normalized sum, establishing both directions of the mean-zero criterion.
Substitute in the defining sum. The exponent becomes . Bijection of this substitution preserves the sum and its normalization, giving the positive phase in the displayed formula. It covers , constant and zero functions, and the singleton torus as well.
Depends on
Used by
Dependency tree · two levels
7 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.