For the counting-measure Lp norm, define
This is the set of Lp almost periods of with exponent and error .
Put , , and use normalized Fourier analysis on a finite abelian group. If denotes unnormalized convolution and , then
by the Parseval identity.
Sample characters independently, choosing with probability , and attach the phase of to the sampled character. The Marcinkiewicz–Zygmund inequality, followed by averaging over , shows that some sampled Fourier sum satisfies
This is the sampling argument recorded in the finite-field character approximation principle.
Let be the intersection of the kernels of the sampled characters. It is a vector subspace of codimension at most , and for every . The triangle inequality therefore gives
Returning from normalized convolution and normalized norm to and the counting norm multiplies the right side by . Hence
for every , proving the finite-field convolution almost-periodicity theorem.
Let and choose
Apply part b with its error parameter replaced by a sufficiently small absolute multiple of . This produces a vector subspace of codimension
with the evident harmless modification when .
For , , and , Hölder's inequality gives
Since by the choice of , the bound from part b is at most
after absorbing the absolute factor into the chosen error parameter. This is the required uniform estimate for .
The sum over all of the threefold-convolution representation function is . Some therefore satisfies
Use part c with . There is a vector subspace of codimension such that, for every ,
Positivity means that has a representation as a sum of three elements of . Thus
which is the desired translate of a low-codimension subspace.

Articles by others on the same topic (0)

There are currently no matching articles.