--- a/paper/variance-note.md +++ b/paper/variance-note.md @@ -1,7 +1,8 @@ # The exact variance of twin-candidate counts in windows over a primorial period *Working note, research project, 2026-08-13; §7 added 2026-08-15; §§8–11 -restructured 2026-08-28 around the model limit theorem; audited 2026-09-10. +restructured 2026-08-28 around the model limit theorem; audited 2026-09-10 +and 2026-09-19. Companion code: `paper/variance-note-numerics.js`, `research/06-variance-theorem.js`; for §7 `research/natal5-variance.js`, `research/natal-cap-16-fast-variance.js`, @@ -24,8 +25,9 @@ of $A$ in a window of length $L$ whose starting point is uniform on $\mathbb{Z}_P$ (Theorem 2). The formula is verified against brute-force enumeration of every window position at two levels. Two consequences: certified -Chebyshev bounds showing that all but a vanishing fraction of windows of -"zone length" $L = p_{n+1}^2$ contain a twin candidate, and the measurement of +Chebyshev bounds, at each computed level, on the fraction of windows of "zone +length" $L = p_{n+1}^2$ with no twin candidate (below $1.3\times10^{-3}$ at +$p_n = 97$), and the measurement of a strictly sub-Poisson variance whose ratio to the mean follows an empirical scaling law in the window exponent. Section 7 restricts the correlation to two of the three mod-30 houses and evaluates it on the diagonal $L = W = x\#$, @@ -48,8 +50,9 @@ measured at eight exact levels, falling to $1.000471$ at $x = 31$, two of its three lag groups are closed unconditionally, and the third reduces to a statement about $y$-smooth divisors of $C(C^2-4)$, searched in its owning -convention on 2026-08-28 and 29: the machinery is in print and the statement -is not, every located theorem sitting below our divisor range (§10). Section 11 records that the earlier fitted reading +convention on 2026-08-28 and 29 without a matching theorem among the results +inspected, the one candidate chapter still unread at the page (§10). Section 11 +records that the earlier fitted reading $0.611$ is refuted as an inference: a control sequence with a known, different limit passes both halves of the protocol that produced it. @@ -64,8 +67,10 @@ $$|A| \;=\; \prod_{2 < p \le p_n} (p-2), \qquad \delta \;:=\; \frac{|A|}{P} \;=\; \frac{1}{2}\prod_{2 1$ when $p \mid d$, $p(p-3)/(p-2)^2 > 1$ -when $d \equiv \pm 2$, and $p(p-4)/(p-2)^2 = 1 - 4/(p-2)^2 < 1$ generically. +when $d \equiv \pm 2$ and $p \ge 5$ (at $p = 3$ that factor is $0$), and +$p(p-4)/(p-2)^2 = 1 - 4/(p-2)^2 < 1$ generically for $p \ge 5$. $W$ is the finite-level, two-class analogue of the Hardy–Littlewood singular series. @@ -142,7 +148,10 @@ $j - i$ takes each value $d$ with $|d| < L$ exactly $L - |d|$ times, and $J(-d) = J(d)$ (substitute $r \mapsto r + d$). Subtracting $(\mathbb{E}N_L)^2 = \delta^2 L^2 = \sum_{|d| 2L$, above it; the one asymptotic with a friability restriction -over polynomial values, Scourfield 2008, read second-hand through her 2016 -restatement with the chapter itself unread at the page, carries relative error -$O(1/\log x)$ where this step needs $o(1/\ln y)$, one epsilon short. So the -reduction is not claimed as new, and the estimate is not in print at the -precision needed; the same one-logarithm gap is usually the whole difficulty in -divisor problems of this shape. +no theorem among the results inspected gives the weighted, above-range +estimate needed. The located set counts (Tenenbaum's $H_F$, Ford's $H(x,y,z)$) +sit at divisor ranges strictly below the sampling range, while our divisors +satisfy $n > 2L$, above it. Scourfield's 2008 result is a divisor sum, every +divisor $m \le x$ of $f(n)$ counted with weight $1$ over $n \le x$, not a set +count; read second-hand through her 2016 restatement, with the chapter itself +unread at the page and a degree hypothesis unresolved between the two +statements, it carries relative error $O(1/\log x)$ where this step needs +$o(1/\ln y)$, one epsilon short. So the reduction is not claimed as new, and no +absence is asserted while the chapter is unread; the same one-logarithm gap is +usually the whole difficulty in divisor problems of this shape. One route through the exact kernel is already lost. The only split it offers, flat against active, has $\delta\,|{\rm flat}|$ rising on all six levels where @@ -844,10 +875,14 @@ zero, so every absolute-value argument through that split fails before it starts. -**What would falsify Conjecture 1**, and whether the check has run: a level at -which $\delta(X - X_{\rm dec})\ln y$ grows would kill it, and eight exact levels -show it bounded and falling; a proof that the replacement shifts the limit would -kill it, and none exists either way. The tenth level $x = 41$ has been priced +**What would falsify Conjecture 1**, and whether the check has run: the +conjecture asserts $\delta(X - X_{\rm dec}) \to 0$, so it is killed by the +unscaled error staying away from $0$ along an unbounded sequence of levels, or +by a proof that the replacement shifts the limit; growth of the scaled quantity +$\delta(X - X_{\rm dec})\ln y$ at a level would not kill it (an error of size +$1/\sqrt{\ln y}$ grows when scaled and still vanishes), and eight exact levels +show the scaled quantity bounded and falling, which excludes nothing about the +limit; neither killer exists either way. The tenth level $x = 41$ has been priced and declined, and by the registered forecast band it would retire one drift form and separate nothing else.