Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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.

The counting inner product on CZ/NZ

Definition

Let N≥1 and let CZ/N be the complex vector space of all functions Z/NZ→C, with pointwise addition and scalar multiplication (The vector space FX of all functions X→F with pointwise operations, and Fn as the case X=n={0,1,…,n−1}, Vector space over a field). For f,g∈CZ/N define

⟨f,g⟩:=∑x∈Z/Nf(x) g(x)‾,

the sum being the finite sum over the finite index set Z/NZ in the additive commutative monoid of C (A finite sum in a commutative monoid indexed by an arbitrary finite set). Enumerating the group by its standard representatives gives the equivalent formula

⟨f,g⟩=∑x=0N−1f([x]N) g([x]N)‾,

where z‾ is complex conjugation (Real and imaginary parts, complex conjugation, and modulus). The two displays agree. By For n≥1, every class in Z/n has one representative r with 0≤r<n, so ∣Z/n∣=n; while Z/0 is in bijection with Z the map x↦[x]N is a bijection from the von Neumann natural N={0,…,N−1} onto Z/NZ, and the summand f(x)g(x)‾ depends only on the class x; a finite commutative-monoid sum is unchanged by reindexing along a bijection (Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule, part 1), so the second display is a rewrite of the first. No representative of a class is ever selected: every application of f or of g is an evaluation at a class.

The pairing is an inner product in the sense of Real and complex inner product spaces, with the inner product linear in the first argument and Real and complex inner-product spaces and their induced length, with the linear-first convention fixed there. Linearity in the first argument, ⟨af1+bf2,g⟩=a⟨f1,g⟩+b⟨f2,g⟩ for a,b∈C, follows from the field laws of C (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2)) together with the two elementary laws of a finite sum over a fixed finite index set, ∑x(ux+vx)=∑xux+∑xvx and ∑xc ux=c∑xux; each of these laws is proved from the recursion clauses of A finite sum in a commutative monoid indexed by an arbitrary finite set by induction on an enumeration of the index set. Conjugate symmetry, ⟨f,g⟩=⟨g,f⟩‾, follows from the same two laws together with the fact that complex conjugation is an involutive field automorphism, hence g(x)f(x)‾‾=g(x)‾ f(x) and conjugation commutes with finite sums (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

Positive definiteness. Taking g=f gives ⟨f,f⟩=∑x∣f(x)∣2 by zz‾=∣z∣2 (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive), a sum of nonnegative real numbers, so ⟨f,f⟩≥0. For the vanishing clause, reindex by the standard representatives to identify this group sum of the real family x↦∣f(x)∣2 with the sequential real sum ∑x=0N−1∣f([x]N)∣2 (Finite sums and finite products, by recursion, Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule); by claim 4 of Laws of finite sums and finite products a finite sum of nonnegative reals vanishes only if every term vanishes, and ∣f([x]N)∣2=0 happens exactly when f([x]N)=0 (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive). Since every class of Z/NZ is [x]N for some 0≤x<N, this forces f=0.

This is the pairing induced by the counting set function on the finite set Z/NZ, which weights a finite set by its cardinality and therefore gives weight 1 to each point (Counting measure on an arbitrary set). No factor 1/N is inserted anywhere in the definition; a normalisation constant is carried by the transform, not by the pairing.

Remarks

  • Why the counting normalisation and not (1/N)-counting. Taylor's (11.5) weights the function space on Γn by (1/n)-times counting measure and the space on Zn by counting measure, matching the factor 1/n carried by his forward transform (11.1); this page uses the counting pairing on both sides and puts the constant N−1/2 in the transform. Under the identification ωj↔[j]N the two conventions are related by f#=N−1/2FNf, a relabelling of the same finite sums, not a change of the mathematics.

Depends on

Used by

Dependency tree · two levels

59 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.

Sources