Wiki
Wiki

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 N≥55N\ge55, let 0≤k≤N0\le k\le N be an integer, and let ρ\rho be any probability measure on the kk-subsets of {0,…,N−1}\{0,\ldots,N-1\}. There is a real linear functional LL on Boolean-reduced polynomials of degree at most four such that:

  1. LL agrees with Eρ\mathbb E_\rho in degrees at most two;
  2. L(zS)=0L(z_S)=0 for every non-Sidon support SS of size at most four;
  3. L((Z−k)m)=0L((Z-k)m)=0 for every monomial mm of degree at most three, where Z=∑iziZ=\sum_i z_i.

Strong Sidon includes sums with repeated summands. If N≥58N\ge58, LL can also be chosen so that, for A=∑0≤i<j<N(−1)i+jzizjA=\sum_{0\le i<j<N}(-1)^{i+j}z_iz_j,

L((A−L(A))2)=Var⁡ρ(A).(1)L((A-L(A))^2)=\operatorname{Var}_\rho(A). \tag{1}

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 DrD_r have rows indexed by all rr-sets of the interval and columns by all (r+1)(r+1)-sets, with entry 11 for containment and 00 otherwise. Direct intersection counting gives

DrDrT=(N−2r)I+Dr−1TDr−1.(2)D_rD_r^{\mathsf T}=(N-2r)I+D_{r-1}^{\mathsf T}D_{r-1}. \tag{2}

The diagonal on the left is N−rN-r, whereas that of the second term on the right is rr. Off-diagonal entries on either side are one exactly when two rr-sets intersect in r−1r-1 elements. In particular DrDrT⪰(N−2r)ID_rD_r^{\mathsf T}\succeq(N-2r)I.

Write St\mathcal S_t and Nt\mathcal N_t for the strong Sidon and non-Sidon tt-sets. Let BrB_r be the submatrix with rows Sr\mathcal S_r and columns Sr+1\mathcal S_{r+1}, and FrF_r the submatrix with the same rows and columns Nr+1\mathcal N_{r+1}. Restricting (2) to these rows gives

BrBrT⪰(N−2r)I−FrFrT.(3)B_rB_r^{\mathsf T}\succeq(N-2r)I-F_rF_r^{\mathsf T}. \tag{3}

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 x+a=b+cx+a=b+c, choosing which triple element is aa. These exhaust the nontrivial repeated-sum possibilities, because the triple itself is Sidon. Thus each row of F2F_2 has at most 33 ones and each row of F3F_3 has at most 1212 ones. Their columns have at most 33 and 44 ones respectively.

For a zero-one matrix with row degrees at most bb and column degrees at most cc, Cauchy--Schwarz gives ∥FTu∥22≤cb∥u∥22\|F^{\mathsf T}u\|_2^2\le cb\|u\|_2^2. Apply this in (3) to obtain

B2B2T⪰(N−13)I,B3B3T⪰(N−54)I.(4)B_2B_2^{\mathsf T}\succeq(N-13)I,\qquad B_3B_3^{\mathsf T}\succeq(N-54)I. \tag{4}

Both are positive definite for N≥55N\ge55. Hence B2B_2 and B3B_3 have full row rank and the explicit right inverses

Rr=BrT(BrBrT)−1(r=2,3)R_r=B_r^{\mathsf T}(B_rB_r^{\mathsf T})^{-1} \quad(r=2,3)

satisfy BrRr=IB_rR_r=I and ∥R2∥2→2≤(N−13)−1/2\|R_2\|_{2\to2}\le(N-13)^{-1/2}, ∥R3∥2→2≤(N−54)−1/2\|R_3\|_{2\to2}\le(N-54)^{-1/2}. No computation of these large matrices is needed for the argument.

Constructing the functional

Put pt(T)=Pr⁡ρ(T⊆X)p_t(T)=\Pr_\rho(T\subseteq X) for the inclusion moments of the base law. Set g0=p0g_0=p_0, g1=p1g_1=p_1 and g2=p2g_2=p_2. On Sidon triples set

g3=R2((k−2)p2),g_3=R_2((k-2)p_2),

and put g3=0g_3=0 on non-Sidon triples. On Sidon four-sets set g4=R3((k−3)g3∣S3)g_4=R_3((k-3)g_3|_{\mathcal S_3}), and put g4=0g_4=0 on the other four-sets. Define L(zT)=g∣T∣(T)L(z_T)=g_{|T|}(T) and extend linearly.

The right-inverse identities say ∂g3=(k−2)g2\partial g_3=(k-2)g_2 on every pair and ∂g4=(k−3)g3\partial g_4=(k-3)g_3 on every Sidon triple, where ∂gt(T)=∑x∉Tgt(T∪{x})\partial g_t(T)=\sum_{x\notin T}g_t(T\cup\{x\}). 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 p0,p1,p2p_0,p_1,p_2. Finally Boolean reduction gives L((Z−k)zT)=∂gt+1(T)−(k−t)gt(T)L((Z-k)z_T)=\partial g_{t+1}(T)-(k-t)g_t(T) for t=∣T∣t=|T|. This proves all three asserted linear properties, for every kk 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

U4={f:N4→R:∑S⊃Tf(S)=0 for every T∈N3}.(5)\mathcal U_4=\left\{f:\mathcal N_4\to\mathbb R: \sum_{S\supset T}f(S)=0\text{ for every }T\in\mathcal N_3\right\}. \tag{5}

The restriction to N4\mathcal N_4 of any function with zero three-set margins lies in U4\mathcal U_4, because every four-set containing a forbidden triple is itself forbidden. Conversely, for N≥55N\ge55 every f∈U4f\in\mathcal U_4 has a zero-margin extension to all four-sets: use ff on forbidden four-sets and −R3F3f-R_3F_3f on Sidon four-sets. Equation (5) handles forbidden triples, and B3R3=IB_3R_3=I handles the remaining triples. Thus (5) is the complete compatibility condition in this range.

For triples, any prescribed ff on N3\mathcal N_3 has a zero-two-margin extension, using −R2F2f-R_2F_2f on Sidon triples. The corrections on the Sidon supports obey

∥R2F2f∥2≤3N−13∥f∥2,∥R3F3f∥2≤48N−54∥f∥2.(6)\|R_2F_2f\|_2\le\frac{3}{\sqrt{N-13}}\|f\|_2, \qquad \|R_3F_3f\|_2\le\sqrt{\frac{48}{N-54}}\|f\|_2. \tag{6}

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 N≥58N\ge58 the interval contains the strong Sidon set

H={0,1,4,9,16,27,40,57}.H=\{0,1,4,9,16,27,40,57\}.

Its 2828 positive differences, all distinct, are

1,3,4,5,7,8,9,11,12,13,15,16,17,18,23,24,26,27,30,31,36,39,40,41,48,53,56,57.1,3,4,5,7,8,9,11,12,13,15,16,17,18,23,24,26,27, 30,31,36,39,40,41,48,53,56,57.

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 (0,1),(4,9),(16,27),(40,57)(0,1),(4,9),(16,27),(40,57), each with an even and an odd member. Define a signed function τ\tau on four-sets by taking one point from each pair and giving the resulting set weight (−1)j(-1)^j when jj of the chosen points are odd; put zero on every other four-set. Its 1616 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

∑∣S∣=4(−1)∑x∈Sxτ(S)=16.(7)\sum_{|S|=4}(-1)^{\sum_{x\in S}x}\tau(S)=16. \tag{7}

Every summand on these supports is one. The degree-four coefficient of A2A^2 is 6(−1)∑x∈Sx6(-1)^{\sum_{x\in S}x}, by its three pairings in two orders. Adding cτc\tau to g4g_4 therefore changes L(A2)L(A^2) by 96c96c, without changing any lower moment, Sidon zero or cardinality identity. Choose

c=EρA2−L(A2)96.c=\frac{\mathbb E_\rho A^2-L(A^2)}{96}.

The resulting functional satisfies (1), since L(A)=EρAL(A)=\mathbb E_\rho A is already fixed. This uses neither evenness of NN nor a special form of ρ\rho.

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-NN lower construction visible.