Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
This is a complete author-recorded proof of L217. Until the final section, all asymptotic constants are absolute and concern ; that section states its additional parameter dependence. Write , , and . The probability law is the equal-block law of L216, whose difference capacities imply .
We first prove
and
The constant in (1) is less than , whereas the leading constant in (2) is one.
The variance before sampling without replacement
For this calculation allow independent uniform labeled positions in each block, with repetitions. Count a pair of coinciding labels once as a pair of distance zero. Let count pairs at cyclic distance at most , and let count pairs at ordinary distance at most after an independent uniform rotation. Then , where counts the short cyclic pairs which cross the cut. The comparison with sets will remove all repetitions.
More generally, take blocks of length and independent points per block. If denotes their coordinates in , then
with sums over labels. For independent uniform in one block, put and . The kernel
has zero row and column means, and direct summation gives
For example, and each of the two orthogonal one-variable projections has variance , giving (4) by subtraction. The one-variable terms in (3) telescope over the cycle. The residuals on different block boundaries have zero covariance: disjoint ones are independent, and for adjacent ones conditioning on the common block leaves two independent variables of conditional mean zero. Inside one boundary sum, distinct label pairs likewise have zero covariance. Consequently
The variance caused by the cut
We show, uniformly for and ,
Only the block containing the cut and its two neighbors can contribute to . Conditional on the cut, it is a sum of zero-one kernels over pairs of at most independent labeled positions. Decompose each kernel into its mean, two one-variable projections and a residual with zero conditional mean in each variable. This is an orthogonal decomposition: residuals on distinct label pairs have zero covariance, including when they share one label. Each residual has squared norm at most the squared norm of its original zero-one kernel, hence at most one. The total residual variance is therefore .
Scale distances from the cut by , and let . For a labeled position at , the expected number of its partners across the cut is
The triangular term counts all positions across the cut within distance at density . The term subtracts the spurious partner label equal to the chosen label in its own block. The error is uniform: the integer count of allowed positions differs from by a bounded amount.
Let the cut fall at relative position in its block. The three unit blocks around the cut have integrals of equal to
Since , the sum of its within-block variances is
For the discrete grid the same sum is at most , uniformly in : the bounded, piecewise linear functions and have uniformly bounded variation, so their left Riemann sums differ from their integrals by . Equations (7)--(8), with labels in each block, show that the one-variable part of the conditional variance is at most . Together with the residual bound this proves the same bound for .
Its conditional mean differs by from the cut-independent value . Indeed the leading term counts the unordered position pairs across the cut with density . Excluding identical labels subtracts at most times a bounded number of normalized within-block pair counts. Thus the variance of the conditional mean is . The law of total variance proves (6).
Now use and . From (5)--(6) and the triangle inequality for centered norms,
Coupling back to genuine sets
Within each block accept the independent positions in label order. If a position repeats an already accepted one, replace it by a fresh uniform position outside the accepted set. This yields a uniform sample without replacement. Keep the same random rotation. If is the total number of labels replaced, its conditional replacement probability at the th label of a block is . Thus
For the second assertion, conditional expectations of two distinct replacement indicators factor: at the later label its conditional probability is the same deterministic number, regardless of the earlier history. Hence the second moment is at most .
Replacing a point inside its block changes the short-pair count by at most : only labels in that block and its two neighbors can be involved, before or after the replacement. Therefore . Standard deviation is -Lipschitz in (it is distance to the constant random variables), so (9) gives (1). The convention for coincident labels disappears after this coupling.
Repeated differences and the cost of renormalization
For any fixed set of distinct positions, and any rotation, its inclusion probability is a product of factors , where counts its positions in block and . Uniformly in and the rotation,
For these probabilities are positive. In particular the denominators defining are positive, since strong Sidon triples and quadruples exist in the interval.
For , the number of ordered pairs of distinct -edges having four different endpoints is
By (11) their contribution to is , uniformly in . The shared-endpoint terms contribute . Summing over proves (2).
There are non-Sidon triples and non-Sidon quadruples: a triple contains a three-term progression, while a quadruple contains either such a progression or two different pairs of equal sum. Choosing all but one position in the relevant equality determines the last one. Thus, for , the total moment erased at degree is at most
Before zeroing, the total is exactly because the law has fixed cardinality. Consequently
Let merely erase non-Sidon moments, without renormalizing. All coefficients of the Boolean-reduced are nonnegative. Every term in , where , has non-Sidon support and is erased. Hence
The constant and linear-in- terms remain unchanged: and . No positivity of is assumed. By (12), the change from to is at most , using and (1). Combining (1)--(2) and (13),
This is negative for all sufficiently large , proving the claim. The normalizations give the displayed total moments exactly by their definition; they do not supply any missing local identity or repair the negative square.
Admixture with the uniform fixed-size law
Let be uniform on all -subsets of the interval, and put , with . Assume only the necessary capacity . Writing and , the pair formulas give exactly
Thus
The short-pair means differ by . Indeed, set . The uniform pair moment is , so (9) in L216 gives
We also need , including the fixed-cardinality cancellation. View the short pairs as the edges of a graph on the interval. Let be its number of edges, its vertex degrees, , and . Exact counting of two edges by their intersection gives
Here and . To see the latter estimate, all but vertices have degree ; the exceptional degrees are between and , and . Consequently . For the fixed values , with ,
In (16), the leading terms and cancel because . The remainder is
The variance formula for a mixture, (1), and (14)--(17) now yield
For each distinct set of at most four positions, the mixture still has inclusion probability , uniformly in . Thus its repeated-difference mass is still , the normalizing factors are still , and . The zeroing and renormalization estimates (12)--(13) therefore apply with and its own mean. Combining them with (18) gives
for all sufficiently large . This rules out this entire mixture repair subject to its first difference capacity. It does not rule out a nonuniform change of the surviving moments.
A weighted test for every positive excess coefficient
Fix , let be integers at least , and set , , , . In this section samples points per -point block and rotates, and is uniform on all -subsets. These parameters have . Let satisfy . The same pair formulas as above give
and therefore .
Put , and use the cyclic quadratic polynomial
Each unordered short cyclic pair is counted once, since . We will prove
All errors are uniform in ; their constants may depend on the fixed bound in the definition of . Equation (20) and the first capacity prove the final statement of the claim.
The two genuine variances and their means
First allow independent labeled samples in each block, counting a coincidence with weight . On the unit square define
The first kernel counts within-block pairs, and the second counts adjacent blocks. Let denote the kernel after subtracting its two one-variable projections and adding back its mean. The projections needed here are
The two projections of are and ; its mean is , while has mean zero. Direct polynomial integration gives
Consequently
On the discrete -point grid these formulas have errors . This follows by summing the bounded piecewise polynomial kernels on each side of the diagonal; the diagonal and its adjacent cells have total area . The projection identity is exact on that grid: the sum of the within-block row and the two adjacent-block rows is constant in the chosen position. In the full pair statistic their coefficients are , so its one-variable projection is just the negative of the within-block projection. Its total variance is .
The canonical two-variable terms are orthogonal for different label pairs, including pairs sharing one label, exactly as in (4)--(5). There are within-block pairs and adjacent-block pairs. Thus the labeled statistic has variance
The coupling (10) applies because . Moving one label changes the weighted statistic by at most , so the change is . It follows that
For the uniform law, view (19) as a weighted graph on the cycle. Write for . The total edge weight is , the sum of squared edge weights is , and every vertex has weighted degree . The intersection count (16), with weights, is
The leading terms in the parentheses cancel as before, leaving after multiplication by . Also and . Therefore
There is no large mixture-of-means term in this direction. Indeed, the two exact sums
give
The variance formula for a mixture and (22)--(23) hence give
What ordinary Sidon zeroing removes
Every short ordinary repeated-difference term has non-Sidon support. Its total contribution to is
The uniform inclusion estimate (11) holds for the mixture as well. The count proving (2) therefore gives . All other erased terms contribute only in absolute value, including terms with negative weights. Here is a count that accounts for those signs.
For fixed short cyclic lengths , the corresponding ordinary lengths are among and . If two disjoint edges have different ordinary lengths, their union can be non-Sidon only at a bounded number of relative offsets: a collision of their other pairings determines their relative starting point, or one of the four triples is a three-term progression and does the same. There are therefore such configurations, with total moment . Equal ordinary lengths at most are already counted in . Equal lengths have at most ordered edge pairs, giving total . A forbidden three-point support is a progression; for two of its edges to have cyclic length at most , its ordinary step must be at most . These give supports and total moment . All polynomial coefficients in these estimates are bounded in absolute value by a universal constant.
Thus zeroing, with no renormalization, gives the equality with error
As before . To bound the effect despite the signed coefficients, replace every edge weight by its absolute value. The square of that statistic has expectation : count two edges with two, three, or four distinct endpoints and use . It dominates the absolute coefficients of . Renormalization therefore changes (25) by only . Equations (24)--(25) prove (20).
The mixture class here has capacity-feasible examples at every fixed . If is constant, then uniformly for its difference expectation is at most . For it is at most . Every sum expectation is at most . The obstruction is therefore not due to an empty input class. It rules out the specified zeroing and uniform renormalization throughout that class, while leaving general nonuniform completions open.