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 analysis, without independent review. The failed-estimate example and the cardinality lift below have complete arguments. The global signed extension in L274 settles linear realizability. The local product-kernel construction remains incomplete, and no positive-semidefinite completion is established. The parity account explains why parity matters, and the degree-four account defines the target relaxation .
What a count-only model supplies
Suppose nonnegative numbers have and . There is a genuine random family of zeros and ones with these means, at most one nonzero value for each , and on every outcome. Here can index regions for the left endpoint of a pair. This realizes the standalone count constraints and has a positive semidefinite covariance.
For an explicit construction, partition consecutively into intervals of lengths . Choose uniformly in and select if contains one of . Each interval has length at most one, so it contains at most one such point, with endpoint coincidences having probability zero. Exactly intervals are selected, and interval is selected with probability . Conditional on selection, assign it label with probability . The case is the empty family.
This supplies no realization by monomials . A four-point monomial appears in three different pairings, and products of these abstract counts need not respect those shared entries or any of the local cardinality identities. Thus the construction cannot be used as a degree-four barrier without a separate realization and positivity argument.
Arbitrarily fine localization also removes the apparent distinction between count positivity and the whole moment matrix. If a region is the singleton , its count at difference is exactly . With all singletons these counts span every distinct-pair monomial. Under the local cardinality identities and , their square positivity implies positivity for every polynomial of degree at most two. Indeed, modulo multiples of , replace
For a quadratic , this gives a pure-pair quadratic with , where has degree at most one. Hence has expectation zero by the identities through degree three. A coarser count covariance remains a useful preliminary test; positivity for every singleton-localized count already asks for the full quadratic-square condition.
The cardinality lift and compatible corrections
Let , and let be the degree- inclusion moments of any law on -subsets. Write for the non-Sidon -sets. For a signed function on -sets define its margin by
L274's proof gives an extension operator from arbitrary data on to signed functions on all triples with zero two-set margins. Set . Then vanishes on forbidden triples and .
For on four-sets, zero two-set margins imply
At a fixed triple , the term occurs times. For each , the sum over of is by its zero margin. These are the remaining three contributions, proving (1).
Put and . For every forbidden triple , its margin is . Thus belongs to
L274 gives an extension from exactly these compatible data to zero-three-margin functions on all four-sets. Hence
clears every forbidden four-set and supplies the margin . Keeping and using and therefore gives a complete signed linear repair. This construction is global; its spatial localization is not controlled.
The same compatibility explains an exact failure of the proposed square kernel inverse. If every column has zero three-set margins, then for any forbidden triple ,
All those are forbidden. This is a nonzero left-null relation in the square matrix . That matrix is necessarily singular. The correction must instead solve on ; L274 proves surjectivity there for . A singular square matrix does not obstruct all repairs.
Any zero-two-margin automatically has , where , by summing each pair margin. For even the lift also has zero parity-signed fourth mass, since
Thus a parity-preserving would keep the alternating square unchanged. For , L274 supplies an explicit Sidon-supported zero-margin trade that restores this square after any global linear completion, also for odd . It does not ensure positivity of other squares.
Why the proposed small-error argument fails
For a non-Sidon support , consider the tentative product kernel
where is supported on nonzero even shifts . If each perturbed label is identifiable and all positions remain distinct, the product's smaller-set margins vanish. One proposed argument for invertibility was that the total absolute mass on non-Sidon supports other than is , so the square matrix is with a contracting error.
Here is an exact counterexample to that estimate for . For any integer with such a kernel, take an interval of length and
The four shift neighborhoods are disjoint and lie inside the interval. For each nonzero in the support of , the set
is non-Sidon, because its first three points remain a progression. Its unique labeled preimage has only the fourth point shifted, so . The are distinct, all differ from , and
The obstruction persists for arbitrarily large , without a boundary or coincident-point issue. A progression constraint uses only three shift variables, so moving the fourth variable does not make that constraint rare. Equation (4) refutes the proposed bound. The singularity above follows separately from the margin relations. Neither conclusion rules out all local repairs.
Two other compatibility obligations remain. When shift neighborhoods overlap, the naive product may put mass on tuples with repeated positions; deleting those tuples need not preserve zero margins. Adjusting each pair separately does not specify a simultaneous kernel for overlapping pairs. Also, summing over labeled perturbations can put extra mass back at the same unordered support through permutations. A usable construction must address these issues and justify its inverse on the actual space of forbidden-support data.
A possible reopening is to localize the compatible inverse supplied by L274, treating progression-containing four-sets jointly with their triple margins. Its existing Euclidean norm bound does not provide the spatial or moment-matrix operator control needed by the smoothing argument. A local construction must preserve the compatibility relations above at every stage.
Spectral information that survives the failed construction
For an interior symmetric kernel , both its total mass and first moment vanish. Consequently for every polynomial of degree at most three: in every monomial of total degree at most three, one variable has degree at most one. This explains why such corrections may have a small effect on smooth count weights. It provides no estimate for the lift, boundary kernels or repeated zeroing.
The exact short-difference covariance has a low-rank polynomial part and two absolute-value kernels. Their coefficients are and when . An interior Fourier heuristic compares the negative form at wavelength with the diagonal slack , suggesting . A common even tent kernel has worst high-frequency cost of order , suggesting . This nonempty heuristic window is useful only with a sufficiently controlled repair. The global signed completion alone does not turn it into a spectral bound for a functional satisfying .
The long-difference block, coupling to position-dependent quadratic statistics, and full matrix positivity all remain open. A positive principal submatrix in a simplified smoothing model would settle none of these compatibility obligations.