The extraction (orthogonality) identity
Statement
For every finite , integer and , , where is the number of ordered -tuples from summing to .
Why is it true?
This is what lets us replace a purely combinatorial counting problem by a question about the size of an analytic integral: if we can show the integral is positive, a representation must exist.
Proof sketch
First note the orthogonality relation if , and if : writing , for this is a full number of periods of a sine/cosine wave over , which integrates to ; for the integrand is the constant .
Now expand the -th power of the generating function: , a finite sum over all ordered -tuples from , grouped by the exponent .
Multiply both sides by and integrate term by term over (legitimate because the sum is finite, so integration and summation commute): .
By the orthogonality relation, each summand on the right is exactly when and otherwise. So the whole sum collapses to exactly the count of tuples with , i.e. . This proves the identity exactly, with no approximation involved: it is an identity, not an asymptotic.
Topics that use this theorem
Step-by-step proofs
No step-by-step proof yet for this theorem.
References
- G. H. Hardy, S. Ramanujan (1918). Asymptotic formulae in combinatory analysis · DOI:10.1112/plms/s2-17.1.75
- J. Bourgain, C. Demeter, L. Guth (2016). Proof of the main conjecture in Vinogradov's Mean Value Theorem for degrees higher than three · DOI:10.4007/annals.2016.184.2.7 · arXiv:1512.01565
- B. Green, T. Tao (2008). The primes contain arbitrarily long arithmetic progressions · DOI:10.4007/annals.2008.167.481 · arXiv:math/0404188