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
Definition
Let and let be the complex vector space of all functions , with pointwise addition and scalar multiplication (The vector space of all functions with pointwise operations, and as the case , Vector space over a field). For define
the sum being the finite sum over the finite index set in the additive commutative monoid of (A finite sum in a commutative monoid indexed by an arbitrary finite set). Enumerating the group by its standard representatives gives the equivalent formula
where is complex conjugation (Real and imaginary parts, complex conjugation, and modulus). The two displays agree. By For , every class in has one representative with , so ; while is in bijection with the map is a bijection from the von Neumann natural onto , and the summand depends only on the class ; 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 or of 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, for , follows from the field laws of ( is a field, every element is uniquely , and every nonzero element has inverse ) together with the two elementary laws of a finite sum over a fixed finite index set, and ; 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, , follows from the same two laws together with the fact that complex conjugation is an involutive field automorphism, hence and conjugation commutes with finite sums (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
Positive definiteness. Taking gives by (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive), a sum of nonnegative real numbers, so . For the vanishing clause, reindex by the standard representatives to identify this group sum of the real family with the sequential real sum (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 happens exactly when (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive). Since every class of is for some , this forces .
This is the pairing induced by the counting set function on the finite set , which weights a finite set by its cardinality and therefore gives weight to each point (Counting measure on an arbitrary set). No factor 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 -counting. Taylor's (11.5) weights the function space on by -times counting measure and the space on by counting measure, matching the factor carried by his forward transform (11.1); this page uses the counting pairing on both sides and puts the constant in the transform. Under the identification the two conventions are related by , a relabelling of the same finite sums, not a change of the mathematics.
Depends on
- Real and imaginary parts, complex conjugation, and modulus
- Counting measure on an arbitrary set
- Finite sums and finite products, by recursion
- A finite sum in a commutative monoid indexed by an arbitrary finite set
- The vector space $F^{X}$ of all functions $X \to F$ with pointwise operations, and $F^{n}$ as the case $X = n = \{0, 1, \dots, n-1\}$
- Real and complex inner product spaces, with the inner product linear in the first argument
- The congruence class $[a]_n$ and the quotient set $\mathbb{Z}/n$
- Real and complex inner-product spaces and their induced length
- Vector space over a field
- Conjugation is an involutive real-field automorphism, $z\overline z=|z|^2$, and modulus is definite, multiplicative, and subadditive
- Laws of finite sums and finite products
- Finite commutative-monoid sums are invariant under bijective reindexing, split over disjoint unions, and satisfy the finite Fubini rule
- $\mathbb C=\mathbb R[x]/(x^2+1)$ is a field, every element is uniquely $a+bi$, and every nonzero element has inverse $(a-bi)/(a^2+b^2)$
- For $n\ge 1$, every class in $\mathbb{Z}/n$ has one representative $r$ with $0\le r<n$, so $\lvert\mathbb{Z}/n\rvert=n$; while $\mathbb{Z}/0$ is in bijection with $\mathbb{Z}$
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
- Michael E. Taylor, Fourier Analysis, Distributions, and Constant-Coefficient Linear PDE (author PDF) (standard reference, not scraped)
- Manfred Einsiedler and Thomas Ward, Ergodic Theory with a View Towards Number Theory, Appendix C (course-hosted full text) (standard reference, not scraped)