Reprice the completion identity's removed dual class before importing an l2 operator bound

Investment state: active. This describes research progress; claims have separate evidence grades.

Contribution to the goal

The note research/structured-dispersion-estimate.md section 9 records that the completion identity supplies coprimality of the physical variable m with the modulus c, not the dual restrictions (t,c)=1 (Corollary 8.1) or (t,r,c)=1 (Theorem 7.1), and that the recorded operator-window curves of returns #760-#765 are therefore conditional on an interface that has not been supplied. This route's contribution is to price that interface instead of restating it: measure the exact size of the dual class the unit-only restriction removes, on the completed array itself, and decide whether the removed class is bounded by the recorded short-window pricing or forces a repricing of the (m,q) arrangement at the target box. Success would not lower the 407/400 target-box exponent by itself, but it would move the whole group of recorded window figures from 'conditional accounting' to either 'applicable at this interface' or 'must be replaced', which is exactly the gap the outcome record names (returns #714, #758, #762-#765; OUTCOMES 'Structured dispersion estimate'). Conjectural link: a bounded removed class would also bound the error of using unit-only dual frequencies in the Perron-separated domain of section 6, since the separated sums meet the same completed array.

Prior work and proposed difference

Prior art — job #10091, route 270 (online search record and the exact remaining gap)

What was searched, and when

Searched the open web on 2026-10-25 (Google via the agent search tool) for: (i) the statistic itself — sums of Ramanujan sums over residue classes, unit-restricted dual frequencies, "removed dual class", "completion identity", "structured dispersion estimate"; (ii) the inequality of obligation (ii), sum_{t mod g, gcd(m0+ht,g)=1} c_g(t).

Hits and their relevance:

What the record already contained (read, not re-derived)

#3544 (origin), #3564 (pricing to c <= 300), #5070 and #5093 (step checks), #5103 (accepted, measured; c <= 2000, envelope 1.158666, family to p = 293, Lemma S), review #1773 (defects 1-6: P1 is an inequality; |S| <= g suffices only for non-unit m, unit m needs 0 <= S <= 2g; argmax tie-breaks are float-noise dependent; P3 pre-registered but run only to c <= 300), #5118 (applicability screening naming exactly these extensions as unrun transfer), #5185 / #5689 (lane upkeeps folding the c <= 2000 result), #5398 and #5841 (route step checks that cite #5103 and pass it by).

The exact remaining gap after this run

  1. Obligation (i), the M1 bound max_{r,m}|D| <= (1+eps)c: measured to c = 4000 (envelope 1.170497) and on the family to c = 17465 (1.1785816), unproved. What is new is that the extremal is a one-parameter family: c = 5*7*p with g = p, h = 35 fixed, r = p throughout the top ten and the family maximum.
  2. Obligation (ii) is now proved (see the report), so no further census of the M2 side is needed: the statement holds for all g, and P1 holds for all c.
  3. The 1.2 crossing is not decided, and no fit decides it. Both two-parameter fits to the c <= 4000 envelope put the crossing inside [5.5e3, 6.6e3]; measured family points at c = 1.6e4 .. 1.7465e4 are already below 1.2, so the constant-exponent (and constant-log-slope) models are refuted on their own extrapolation range. The next useful object is the exact extremal value at h = 35, not a third fit.
  4. Unowned, unrelated to this step: the weighted S_h table of route 396 (#5876/#5904) — untouched here.

Non-claims

No citation here is treated as proved because it was found online; the two facts used in the proof (Ramanujan multiplicativity, orthogonality of c_q over a complete residue system) are standard and are also re-verified numerically by the instrument. Nothing in this run is a literature claim.

Central uncertainty

The weakest unproved assumption is that the exact census ratio (removed class) / (full completed value) is bounded as the modulus grows: the census is finite (c<=120, c<=60 on the (t,r,c)=1 side) and for c>24 it probes only four m values, so a bounded finite ratio is not a bound. Second, that the sizing of the removed class is the right proxy for the operator interface at all: a priced window figure could still absorb the removed class through a correlation between the completed weight and S(t,r;c) rather than through its size alone, which section 9 explicitly allows.

Next experiment

Is the M1 removed-class maximum always attained at h = c/g = 35, i.e. at c = 35p with g = p and r = p (or 2p), and what is the exact value of |D| there as a function of p?

Fix h = 35, g = p, c = 35p. In the coefficient form D(m) = c[m unit] - sum_{y in U} c_c(y-m) zeta_c^{r ybar}, take r = p and fold the sum over the classes of y mod p: every y = m mod p contributes at the single position e* = g*(r' * mbar mod h), so |D| reduces to one Ramanujan-sum-at-a-shifted-argument. Derive that value in closed form in p, check it against the 95 published family values and the c <= 4000 census rows (all of which already carry their argmax and factorisation), then extend the same pruned search over r = kp only to p in (500, 2000] (c <= 70000) with the exhaustive c <= 4000 result as the validation set for the pruning.

Required evidence

Unaccepted premises remain conditional.

Evidence behind continued investment

These investigations led to the current experiment. Their claims retain their own evidence grades.

Investigation history

Instrument. route270_ext.py imports route270_ek.py verbatim (sha256 cedbe6c1cfb83a109224f4a15e77e9c0189b60da6e764ecae5272abe488e7e98, the attachment of #5103) and adds sections G (gates), T (obligation (ii)), E (census to 4000), F (family to p=499), H (fits, crossing, clause). Reference copies of #5103's own p2_m1_ek.jsonl (99e69e2d…) and family_ext_ek.json (9dcc5b3d…) are hash-checked, so the gates compare against published bytes, not against my numbers.

Gates (all pass). Every one of #5103's 1999 |D| values reproduced to 1e-9; envelope 1.158666188918276 at c = 1855; |D|(1855,106,106) = 2149.325780443402; global slope +0.0115 +- 0.0007; window slopes +0.0884, +0.0116, +0.0055 on [2,64], [65,150], [151,300]; family ratios at p = 23, 53, 293; family exponents +0.0589 +- 0.0039 and +0.0330 +- 0.0020.

Obligation (ii): proved, then verified. S = sum_{t mod g, gcd(m0+ht,g)=1} c_g(t) = (-1)^k prod_{p|g, p|m0}(p-1) when g is squarefree and gcd(g,h)=1, S = 0 otherwise; |S| &lt;= phi(g) &lt;= g, equality iff g = 1. Verification: closed form vs brute force on 39 950 triples (g &lt;= 80, h &lt;= 20, gcd(m0,h)=1), 0 mismatches, max |S| = 78; the bound on 33 884 sampled triples (g &lt;= 200, h &lt;= 30), 0 violations. Lemma S as an exact identity l1(D2) = |-h S + c[m unit]| on all 73 809 (c,r,m) with c &lt;= 60, 0 mismatches; 5 410 equality cases l1 = c, every one with g = 1 or unit m and S = 0. So P1 is a theorem with known equality cases, not a census.

M1 census, c &lt;= 4000 (p2_m1_ext.jsonl, 3999 rows, keys c, num_max, ratio, arg, factors, near_ties, distinct_maxima).

Family c = 5*7*p, p &lt;= 499 (95 moduli, family_ext500_ext.json). max 1.1785816012913881 at p = 499 (c = 17465, (r,m) = (499,5988)); no value &gt;= 1.19. Exponents: +0.0589 +- 0.0039 (p &lt;= 53), +0.0330 +- 0.0020 (p &lt;= 293), +0.0261 +- 0.0016 (p &lt;= 500, log-log rms 1.81e-2); log-linear +0.0288 +- 0.0017.

Fits and the crossing (fits_ext.json). Envelope c in [2,4000]: power a*c^theta with a = 0.870937, theta = +0.036982 +- 0.000213, rms 1.33e-2; implied 1.2 crossing c* = 5.81e3, band [5.53e3, 6.10e3] (theta +- se) and [5.57e3, 6.06e3] (a +- se). Log model a + b log c: a = 0.848472, b = +0.040164 +- 0.000180, rms 1.12e-2; crossing 6.33e3, band [6.08e3, 6.58e3]. Both are contradicted by measured family points above c = 1.7e4 (1.1786 &lt; 1.2), so no crossing is established; the drift exponent falls with range.

Served clause. Part 1 (envelope at c &lt;= 4000 below 1.2): holds, 1.170497. Part 2 (theta(4000-range) &lt; theta(2000-range), measured on the family): holds, +0.0261 &lt; +0.0330.

Controls. control_ext.out: 11 single mutations (the nine of #5103 plus two for the new claims), each caught by name, each exit 1; the four #3564 anchors still pass inside every control run.

Cost. 0.4 CPU-h total (0.2 for the two censuses and the checks; ~0.2 wasted by a first attempt that parallelised over 24 workers on a one-CPU quota, killed and replaced by one resumable process).

Limits. Finite census only; |D| is a float64 magnitude (extremals re-checked at 50 digits, no comparison in the census is decided by a difference below 1e-9). No asymptotic claim; the task-box 407/400 exponent is untouched.

Custody. Route 270 served 2026-10-25T19:58Z: state active, revision 5, last_return_id 5103, next_job_id null, updated_at 2026-10-20T21:45:58.706Z == #5103's created_at. Served next_step is plain-== to #5103.research.next_step; canonical sorted-key compact-separator sha256 e94482365f44b5afe332aeb5535dfafe77adfe68028c211dc0a77aca74a8f6a6 (default separators hash differently — #5070's recorded trap). Events, newest first: 2019 #5103 progress, 2014 #5093 promising, 2002 #5070 promising, 1518 #3564 promising, 1514 #3544 proposed — no route-270 event after #5103. Jobs: 11950 assigned, 10091 expired (the step's own pursuit, never returned), 10060/10016 returned, 7347 accepted, 7304 returned.

Clause ledger.

clause on record answered
C1 M1 census to every c in (2000, 4000] #5103 stops at c &lt;= 2000 (1999 moduli, max 1.158666 at c = 1855, ` D
C2 family c = 5*7*p, p &lt;= 500 #5103's post-hoc family stops at p &lt;= 293 (c &lt;= 10255, ratio 1.176918) no
C3 argmax (r,m) + factorisation per modulus c &lt;= 2000 only; review #1773 defect 6: tie-break is float-noise dependent ((53,53) vs (106,106)) no
C4 two-model fit + implied 1.2 crossing band only a global slope +0.0115 +- 0.0007 and two post-hoc family slopes +0.0589 (p &lt;= 53) / +0.0330 (wider) no
C5 nine mutation controls first route270_ek.py --corrupt 1..9; control_ek.out 9/9 exit 1 (#5103) — reusable instrument, not run at the new range instrument only
C6 attack ` S <= g, S = sum_{t mod g, gcd(m0+h*t,g)=1} c_g(t)`

The correction on record (#1773, defect 3). |S| &lt;= g "suffices only for non-unit m. For unit m the value is |c - h S|, and S = -g would give 2c. P1 needs 0 &lt;= S &lt;= 2g there." Observed: unit m has S/g in [0,1], no negative S; non-unit m has max |S|/g = 0.9995. The pursued obligation is therefore the pair (|S| &lt;= g for non-unit m; 0 &lt;= S &lt;= 2g for unit m); neither is proved.

Census of every return after #5103. 615 records parsed with ids in 5104..5925 (207 ids never existed; existing span 5106..5901, so no id above the span was left unread). Citers of #5103 — #5118, #5185, #5266, #5398, #5841 — all fetched and classified: applicability screening, lane upkeep v17, direction #558 parity obstruction, route 287 step check ("c ≤ 2000 census, no windowed ladder"), route 337 step check (lists #5103 with cpu 0). Marker sweep over the 615: family token 5*7*p in #5118, #5185, #5689 (screener, upkeep v17, upkeep v31); (2000,4000]/c &lt;= 4000 in #5876 only — a direction return on Möbius correlations where the bracket is an interval of n, not a modulus range; two-model fit: none; family endpoint p = 499 / c = 17465: none; 0 &lt;= S &lt;= 2g: #5118 only, quoting the review. unclassified_hits == [].

What this supports. promising, not known: nothing on record executes C1–C4, and C6 is only stated (with a correction) plus census-verified below c = 2000. Not needs_capability: #5103's own instrument, its nine controls and its output formats are on the record and fit the step's budget.

Price. #5103 measures 172 s of single-core M1 sweep for c &lt;= 2000; doubling the range is ~4× the work (≈11 min) plus the sparse family up to c = 17465. Estimate, not a measurement here.

  1. The (t,r,c)=1 class is a single coefficient, so l1 is the modulus. Exact identities: with g = gcd(r,c), h = c/g, a2(c,g,h*n') = h*c_g(n') (Ramanujan collapse), and every unit y with h | (y-m) has ybar = mbar mod h, so all contributions of D2(m) land on one basis vector zeta_c^{e*}. Hence l1(D2) = |D2(m)|, an integer: exact, and immune to cancellation. Verified on every (c,r,m), c &lt;= 60 (8899 cases by the closed form |-h*S + c*[m unit]|, 0 mismatches; 73 809 cases by the array instrument, 0 mismatches).
  2. P1 holds on every c &lt;= 2000 (the correction #5070 asked for: inequality, no m=0 attainment): 1999 moduli, no l1_max &gt; c, equality on 785 (39.3 %), max l1/c = 1.000000. The M2 restriction needs no new input on this range and needs none for a structural reason.
  3. The step's "decisive weighted test" is empty on this side. With one nonzero coefficient there is no interference, so no weight profile can carry the removed class by correlation instead of by size. #5070's F3 was a wording problem on the record; here it is an impossibility, and it is the useful half of the answer: on the (t,r,c)=1 side, pricing by size is the only pricing there is.
  4. On the unit-dual side the falsifiers do not fire, but the constant is not constant. Envelope 1.158666 &lt; 1.2 at c = 1855; [1800,2000] slope +0.0126 +- 0.0666 &lt;= 0.02. The global slope is +0.0115 +- 0.0007 (16 sigma positive) and is carried by the family c = 5*7*p, whose ratio climbs 1.1296 (805) -&gt; 1.1587 (1855). Post-hoc, the family reaches 1.176918 at c = 10255 without crossing 1.2, and its exponent falls from +0.0589 (p<=53) to +0.0330 (p<=293) — so a naive extrapolation of the drift (mine, made before the extension) failed. The removed class is Theta(main term) with a slowly rising constant; a window figure must price an error of the same order as the main term and slightly larger, and no crossing is predicted yet.
  5. The literal step is infeasible as written and the substitution is measured. Its cost is Theta(sum c^2 phi(c)) ~ 2.4e12 coefficient updates (>= 20 h at the ~`3e7/s measured here) plus a c x caccumulator per chunk. One FFT correlation per(c,r)` plus the collapse make the M2 census 5 s and the full M1 sweep 172 s; both substitutions are re-derived against the direct instrument and against #3564's four anchors before any number above is used.
  6. What is not claimed. No bound as c -&gt; infinity; the target box stays 407/400; obligation (ii) is now the exact one-variable inequality |sum_{t mod g, gcd(m0+h*t,g)=1} c_g(t)| &lt;= g, verified but not proved; obligation (i) is measured only; the profile experiment of F3 was not run because the #760-#765 weight sequence is not available here.

Read-and-compare only: cpu_hours 0, no experiment, no computation reproduced. Reuses #5070's conclusions; the only new candidate compared is #5073.

(1) Step unchanged. Served route 270 (2026-10-20): state active, revision 3 (bumped from 2 with no new event after #5070's own recording), origin 3544, last_return_id 5070, next_job_id absent. Route events: 2002 (#5070, promising - that check's own return event), 1518 (#3564, promising), 1514 (#3544, proposed); no route-270 event after #5070's own. The served next_step object is exactly equal to #3564.research.next_step (plain == and canonical sorted-key equality on the fetched bytes); canonical sorted-key compact sha256 458dd8206cafaf0efc93bae0e0ddb43f05848b884a6b2e803f53f52fbdce9fc1, the same value #5070 recorded (trap: default separators hash to be0e1c4f... - compact is the recorded convention). Contrast: the changed input that triggered this check, #5073, reports that route 269's served step does NOT reproduce #3566's recorded next_step_sha256 under any of the nine serialization variants it tested - route 270 has no such defect.

(2) Still unanswered. Reusing #5070: no route-270 return after #3564 except the step check #5070 itself; pursuit #7347 expired with no return; #3564's citers (#3584, a Q-transition-signed-estimate return, and #5070 itself) do not touch the object; the c<=2000 census with pre-registered P1/P2 has never been run. All still hold on the current record.

(3) #5073 compared and set aside. #5073 (job 10020, route 269 step check, recorded, author_rung heuristic) is a read-and-compare check of route 269's own l2-operator-import step (setter #3566): it finds that step not executed but mis-located (three of four load-bearing terms point at the wrong paper sections; its F2 identifies Lemma 2.7 - a BFI bilinear average with structure restrictions - as the machinery past BV, not a BV level barrier) and recommends re-scoping before pursuit. Its cites.returns are [3566, 3527, 3514] - route 269 returns only. Searched for this route's object, its report contains zero occurrences of 270, 3564, 3544, completion identity, Z[zeta, dual class, l1, or 2000: it runs no census, prices no dual class, states no P1/P2 prediction. Contextual relevance only: route 270's contribution defers the #760-#765 operator import ('before importing an l2 operator bound'), and #5073's re-scoping recommendation on that import step is a caution for whoever prices it downstream; it does not answer whether the record answers THIS step. It does not.

(4) Verdict. outcome promising, the #3564 step copied exactly as next_step (the served object, byte-exact). Carried forward from #5070's wording findings, which travel with the step for the pursuing run: (F1) P1's equality clause is already false on the record's own range (l1_max = c on only 23 of 59 tested c; every prime p gives p-1; smallest counterexample c=2) while P1's falsifier never fires - what the record supports is the inequality l1 <= c; (F2) 'attained at m = 0' is false on 42 of 59 tested c and misattributes #3564's strict-inequality lemma (|D(0)| = |c_c(r)| <= c, worst 0.993289); (F3) the step's weighted test as worded re-measures the size ratio (b)/(a) (checked exactly on 16,607 cases), so separating size pricing from correlation pricing needs a non-uniform weight profile the step does not specify. The brief's three-way rule mandates the exact copy for promising and #5070 recorded the same verbatim step, so the step is copied unchanged with these cautions on the record. The 407/400 target box and the route's central uncertainty (a finite census is not a bound) are unchanged and open.

Exact, all c &lt;= 300, every r, every m (4005 (c,r) pairs, 8.8e5 (r,m) cells; exact integer coefficient vectors in Z[zeta_c], each numeric modulus reported next to its rigorous integer l1 bracket):

What this changes: the pre-registered failure branch (a removed class growing like a positive power of c) is not met — on the largest window the ratio exponent is consistent with 0 — so §9's interface requirement is payable at this range, not "must be replaced". But the size is Theta(c), i.e. a constant close to 1 relative to the completed value: a recorded window figure can carry the removed class only if it prices an error of the same order as the main term, which is a concrete constraint on the #760-#765 import rather than a formal caution. On the (t,r,c)=1 side the restriction is rigorously dominated on the tested range, and structurally cheap.

Two exact lemmas (proofs, not fits), both verified exactly: (1) at the m=0 slice D(0) = -mu(c) * c_c(r), so |D(0)| = |c_c(r)| &lt;= c there — the non-coprime-m slice can never exceed the main term (worst observed 0.993289); (2) if gcd(r,c)=1 the (t,r,c)=1 weight collapses to c*[c|n], hence G2_unit = G and D2 ≡ 0 — the M2 removed class lives entirely on gcd(r,c)&gt;1.

Instrument checks: #3544's census reproduced exactly (1228/25780 probes/315/7260; M2 728 of 1830); the exact cyclotomic zero test agrees with the numeric detector on all 38023 (c,r,m) with c&lt;=48; both worst cases re-evaluated at 50 digits. Depends on return #3544 (the §9 correction and its census).

Open: a finite census is not a bound as c -&gt; infinity (the route's central uncertainty, unchanged); and sizing is a proxy — a window figure could absorb the removed class through a correlation of the completed weight with S(t,r;c) rather than through its size. The target box stays 407/400; no exponent moves.

Rung: measured (finite, exact). Every number below is re-derived by check_bm.py from the note's own definitions; the served validator is reproduced unchanged.

Reproduction of the served validator

Independent second implementation: check_bm.py — 37/37, exit 0, 8.5 s

Exact integers / Fraction / exact Z[zeta_c] (no floats in any test). --corrupt 1..6 each exit 1.

Section 9 — exact coverage the served validator lacks

In Z[zeta_12]: (m,c)=(5,12)=1; S(2,2;12) != 0 (it is -2); S(t,2;12)=0 for every unit t; the unit-dual projection at m=5 is exactly zero; the full value is e_12(10) != 0. Completion identity recomputed from the definition of S(t,r;c) for all (c,r,m), c&lt;=24: 4900 cases, 0 mismatches.

New measurement: the dual-frequency class removed by completion

Exact Z[zeta_c] values (Ramanujan-sum form for the projections; zero tests by reduction mod Phi_c); G(m)=1_{(m,c)=1}e_c(r mbar), G_unit(m)=(1/c)sum_{(t,c)=1}S(t,r;c)e_c(-tm).

Scope. Finite; c&lt;=120 (M1) and c&lt;=60 (M2); for c&gt;24 only four m-probes, so "empty" means empty on the probes. Toy scale establishes nothing about majorant sizes, the window curves of returns #762-#765, or any exponent. The target box stays 407/400; the 7/400 deficit and the global signed margin are unchanged and OPEN.

Reproduction

work/check_bm.py, work/check_bm.out, work/check_bm.control.out, work/validator_served.out, work/validator_served.js, work/PREREGISTRATION_bm.md.