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 calculation, without independent review. It concerns the genuine, unrotated block law and does not construct Sidon pseudo-moments. Its role in the local-repair question is to identify the covariance terms that any proposed high-frequency estimate must control.
Take blocks of length , independently choosing a uniform -subset in each. Put and for . For , write , where counts pairs at distance inside block , and counts those crossing from block to block . There are terms of the first kind and of the second. Their means are and .
For distinct define
Then the covariance is exactly
For the diagonal use the same and replace by
To verify (1), two internal edges of distinct lengths have a common vertex in placements: equal left or right endpoints contribute , and a right endpoint equaling the other's left contributes . The other placements have four distinct points. Two edges crossing the same boundary have a common endpoint in placements; their other placements use two points in each block. An internal -edge and a crossing -edge with an endpoint in its block share one of its vertices in placements. Finally two edges crossing adjacent boundaries have a common endpoint in placements in their shared block. Subtract the product of means in each case. On the diagonal, identical edges give the extra terms in (3).
Independence eliminates all disjoint-block covariances. There are internal blocks, boundaries, two sides of each boundary for an internal-crossing pair, and adjacent boundary pairs. Including both orders gives (2). Reflection of a block makes the internal-crossing covariance identical on its two sides. This proves the formulas.
The two absolute-value terms
For , expanding the maxima, minima and positive parts in (1) gives
for constants depending only on , with
For example, the coefficients of in are ; those in are . These give the first and third terms of (5); the other two contributions come directly from and . Every remaining expression in (1) is a linear combination of . Thus the polynomial part of the matrix has rank at most two, on the span of the constant and coordinate vectors. Equation (4) concerns off-diagonal entries; a diagonal correction from (3) remains.
If , then
For a direct expansion, write . Then , and . In the terms of order cancel, leaving ; in they leave . This proves (6).
The negative effect of the first kernel has an exact finite-interval form. For real with ,
Express as the number of cuts between and ; each cut contributes , proving (7). The second kernel in (4) is the first composed with reflection . Since reflection commutes with the first kernel, its quadratic form on the zero-sum subspace has absolute value at most the negative of (7), by Cauchy--Schwarz for the positive semidefinite form on that subspace.
Equations (4)--(7) make the interior spectral heuristic concrete. They do not give a high-frequency lower bound for the complete covariance after a Sidon repair. The diagonal, the polynomial part, the long differences, boundary conditions and the unconstructed correction must all be included in such a bound.
The research evidence entry point checks every mean and covariance against a separate complete enumeration of the unrotated sample space at , in exact rational arithmetic. It also checks the two-kernel decomposition at every off-diagonal entry of these matrices. This is finite supplementary evidence; the general identities rest on the counting argument above.