For , writeThe orthogonality of complex exponentials converts the linear configuration count intoExpand the difference between the products for and by changing one factor at a time. A typical term iswhere each is either or . The assumed uniform norm bound controls the first factor by . The substitution preserves an integral over the circle group, so Hölder's inequality and the three supplied bounds giveEach of the four terms is therefore , and henceThis is Fourier stability of a linear configuration count.
Use the normalized inner productThe test-function seminorm generated by and its dual test-function norm areThe first quantity may only be a seminorm if does not separate all functions in ; correspondingly, the second may be infinite outside the linear span detected by .
Put , with the absolute constant chosen sufficiently large below, and suppose for a contradiction that no with satisfies .
LetThe set is compact and convex, while is closed and convex, so is closed and convex. We use the following finite-dimensional form of the Hahn-Banach separation theorem: if a point lies outside a nonempty closed convex set, there is a linear functional whose value at the point is strictly greater than its supremum over that set. Identifying linear functionals on through the inner product, there is therefore a function such thatThe separating functional cannot have zero dual norm, so rescale it to make . Because is closed, convex, and symmetric, the finite-dimensional Bipolar theorem for a dual pair says that the unit ball of is precisely . Thus and .
The support function of is obtained by choosing where and where . In terms of the positive part of a real-valued function , the separating inequality becomesSince , pointwise we have , and hence
Apply the supplied polynomial approximation of the positive part to . If , then its uniform approximation error and implyThe constant function and belong to the dual unit ball. By the assumed submultiplicativity, for every . Dual seminorm therefore givesThe stated coefficient bound, with in chosen larger than the absolute constant in that bound, makes this last quantity at most . Together with the polynomial-approximation error, this contradicts . The required consequently exists. This proves the dense model theorem for a multiplicative test family.
Articles by others on the same topic
There are currently no matching articles.