Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
This is Plasma AI's author-recorded proof of L274, without independent review. It establishes signed linear realizability and an optional parity-square constraint. Its global Euclidean norm bounds do not assert spatial localization or positive semidefiniteness.
Statement. Let , let be an integer, and let be any probability measure on the -subsets of . There is a real linear functional on Boolean-reduced polynomials of degree at most four such that:
- agrees with in degrees at most two;
- for every non-Sidon support of size at most four;
- for every monomial of degree at most three, where .
Strong Sidon includes sums with repeated summands. If , can also be chosen so that, for ,
Neither the signed moments nor their moment matrix are asserted to be nonnegative. No bound for the size of an actual Sidon set follows.
Incidence matrices with forbidden extensions deleted
Let have rows indexed by all -sets of the interval and columns by all -sets, with entry for containment and otherwise. Direct intersection counting gives
The diagonal on the left is , whereas that of the second term on the right is . Off-diagonal entries on either side are one exactly when two -sets intersect in elements. In particular .
Write and for the strong Sidon and non-Sidon -sets. Let be the submatrix with rows and columns , and the submatrix with the same rows and columns . Restricting (2) to these rows gives
A pair has at most three forbidden third points: the midpoint and the two extensions to a three-term progression. A Sidon triple has at most twelve forbidden fourth points. Nine come from adjoining a progression point to one of its three pairs; three come from , choosing which triple element is . These exhaust the nontrivial repeated-sum possibilities, because the triple itself is Sidon. Thus each row of has at most ones and each row of has at most ones. Their columns have at most and ones respectively.
For a zero-one matrix with row degrees at most and column degrees at most , Cauchy--Schwarz gives . Apply this in (3) to obtain
Both are positive definite for . Hence and have full row rank and the explicit right inverses
satisfy and , . No computation of these large matrices is needed for the argument.
Constructing the functional
Put for the inclusion moments of the base law. Set , and . On Sidon triples set
and put on non-Sidon triples. On Sidon four-sets set , and put on the other four-sets. Define and extend linearly.
The right-inverse identities say on every pair and on every Sidon triple, where . For a forbidden triple, the latter margin is zero automatically: no Sidon four-set contains it. The identities in degrees zero and one already hold for . Finally Boolean reduction gives for . This proves all three asserted linear properties, for every in the stated range.
The exact compatibility subspace for fourth moments
The same argument identifies the obstruction to the square inverse used in the tentative local construction. Define
The restriction to of any function with zero three-set margins lies in , because every four-set containing a forbidden triple is itself forbidden. Conversely, for every has a zero-margin extension to all four-sets: use on forbidden four-sets and on Sidon four-sets. Equation (5) handles forbidden triples, and handles the remaining triples. Thus (5) is the complete compatibility condition in this range.
For triples, any prescribed on has a zero-two-margin extension, using on Sidon triples. The corrections on the Sidon supports obey
These give a global alternative to local kernels. A square matrix indexed by all forbidden four-sets, each of whose columns has zero three-set margins, is necessarily singular. For each forbidden triple its column entries over all containing four-sets sum to zero, a nonzero left-null relation. A right inverse is possible on the compatible space (5), rather than on the whole space of forbidden four-set data.
Restoring the parity square
For the interval contains the strong Sidon set
Its positive differences, all distinct, are
Distinct positive differences imply strong Sidonicity: a nontrivial equality of two sums would repeat a positive difference, including the case of a three-term progression.
Pair its elements as , each with an even and an odd member. Define a signed function on four-sets by taking one point from each pair and giving the resulting set weight when of the chosen points are odd; put zero on every other four-set. Its supports are Sidon. Every three-set margin is zero: if a triple selects one point from each of three pairs, its two extensions in the last pair cancel, and every other triple has no extension in the support. Furthermore
Every summand on these supports is one. The degree-four coefficient of is , by its three pairings in two orders. Adding to therefore changes by , without changing any lower moment, Sidon zero or cardinality identity. Choose
The resulting functional satisfies (1), since is already fixed. This uses neither evenness of nor a special form of .
The trade restores just this square. Its effect on every other matrix direction must still be assessed before any positive-semidefinite completion is claimed. Likewise (6) controls Euclidean norms of moment vectors, not the eigenvalues of the full quadratic moment matrix. The extremal proof sketch keeps those positivity gaps and the separate all- lower construction visible.