For the counting-measure Lp norm, defineThis 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 , thenby 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 satisfiesThis 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 givesReturning from normalized convolution and normalized norm to and the counting norm multiplies the right side by . Hencefor every , proving the finite-field convolution almost-periodicity theorem.
Let and chooseApply part b with its error parameter replaced by a sufficiently small absolute multiple of . This produces a vector subspace of codimensionwith the evident harmless modification when .
For , , and , Hölder's inequality givesSince by the choice of , the bound from part b is at mostafter 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 satisfiesUse 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 . Thuswhich is the desired translate of a low-codimension subspace.
Articles by others on the same topic
There are currently no matching articles.