#!/usr/bin/env python3 # -*- coding: utf-8 -*- """Revision 4 of research/SEARCH-CONVENTIONS.md for the object of return #153. One base, one row. Supersedes ALL THREE prior rows on the same served base (returns #1087, #1089, #1090), because this pass corrects their central claim: Graham's paper was read in the PRIMARY (page raster), and it says something the three earlier rows could not see -- the paper's THEOREM is the two-weight bilinear statement with main term N log z1, while the single-weight square that An (1.1) quotes is the COROLLARY and holds only for z2 <= N. The base sha guard is the one inherited from make_rev_searchconv3.py: a stale local copy must never become a revision. """ import difflib import hashlib import os import sys sys.stdout.reconfigure(encoding="utf-8", errors="replace") RUN = os.path.dirname(os.path.dirname(os.path.abspath(__file__))) BASE = os.path.join(RUN, "evidence", "docs", "research__SEARCH-CONVENTIONS.md") REV = os.path.join(RUN, "artifacts", "rev4-SEARCH-CONVENTIONS.md") DIFF = os.path.join(RUN, "artifacts", "rev4-SEARCH-CONVENTIONS.diff") BASE_SHA = "6160114056b5978f277959993d05a7693cc3c333bbe1becc57c4e3ed03db4b25" ANCHOR = ("| mu(n/s) restricted to s dividing n, and its shifted cofactor product | F_s, K_H, J_H | " "bounded multiplicative functions with modified Euler factors on arithmetic progressions |") ROW = ( "| the smooth/rough split of the global factor identity, its divisor-profile weight `F`, its paid " "prime-power exceptional term, and its negative-sign rule on regular composites | `G_i`, `F_i(s_i)`, " "`H_W`, `E_W`; the factorisation `n = s_W(n)*t_W(n)`; the pair-trigger majorant; `C_W` | smooth-weight " "Vaughan identity; the divisor sum of a Barban-Vehov/Selberg sieve weight; Mobius inversion of a " "divisor weight | **for the WEIGHT `F`: \"Barban-Vehov problem\", \"Graham estimate\", \"Selberg sieve " "weights mean square\", the object `Sigma_{n<=N}(Sigma_{d\\|n} lambda_d)^2`** (the row beside this one " "owns the *corner energy*; do not merge them); for the IDENTITY: **\"weighted Vaughan identity\"**, " "**\"smooth truncation\"**, **\"sieve-weighted Vaughan identity\"**, **\"Type I / Type II " "decomposition\"**; for the sign side: **\"Lambda = mu * log\"**, **\"parity problem\"** | " "`global-factor-signs.md` section 1 (4)-(5), section 2 (6)-(7), section 3 (10)-(11), id " "`Q-global-factor-signs`. **`F` is OWNED, and Graham bounds `F` ALONE**: Graham, *An asymptotic " "estimate related to Selberg's sieve*, **J. Number Theory 10(1) (1978) 83-94**. **Read in the PRIMARY " "2026-09-19 (page raster; Deep Blue item `4e48e4d5-b06c-4218-99ac-b71b875854dd`), no longer through a " "secondary**: his **THEOREM** (p. 84) is the **two-weight bilinear** statement " "`Sigma_{1<=n<=N}(Sigma_{d\\|n} A1(d))(Sigma_{e\\|n} A2(e)) = N log z1 + O(N)`, " "`Ai(d) = mu(d) max(log(zi/d), 0)`, `1 <= z1 <= z2 <= N` -- main term the **SMALLER** cutoff `z1`; his " "**COROLLARY** is the single-weight square in **two cases**: `z2 <= N` gives " "`Sigma(Sigma lambda_d)^2 = N/log(z2/z1) + O(N/log^2(z2/z1))`, while **`z1 < N < z2` gives " "`N log(N/z1)/log^2(z2/z1) + O(N/log^2(z2/z1))` -- that second case is a FRONTIER: the identity is " "NOT available past `z2 <= N`**; and display (5) is Barban-Vehov's **upper bound** " "`Sigma(Sigma lambda_d)^2 <= N/log(z2/z1)`. **An, arXiv:2206.10104v1 (1.1), is the COROLLARY CASE 1 " "verbatim** (`x/log(y/w) + O(x/log^2(y/w))`, his declared `1 <= w < y <= x` being exactly `z2 <= N`, " "his own note giving `x,w,y` = `N,z1,z2`) -- faithful, but it is **not** the Theorem: cite An for the " "one-weight square only, never for the two-weight form. *(Two retrieval traps: Sedunova's bibkey for " "this paper is literally `Michigan1978` while the journal is JNT; and Deep Blue's OCR text layer must " "not be used -- it prints \"Academic Press\" as \"Academic Pray\", the main term `N log z1` as " "\"N 1% 21\", and DROPS every displayed equation, so read that scan as an image.)* **The pairing of " "the rough `Lambda` with `F` is NOT in that line: it is DERIVED-IN-CORPUS and is the `lambda_1` term " "of the weighted Vaughan identity.** Exact in `Z[log p]` at every `n <= 600`: " "`(Lambda*F)(n) = Sigma_{d\\|n} mu(d)rho(d)log(n/d)`, which is Sedunova section 2's " "`lambda_1(n) = Sigma_{d\\|n} mu(d)eta(d)log(n/d)`; restricted to `r > W` it is exactly " "`corner-coefficient-energy.md` section 3 **(9)** -- **that note already carries the pairing, the " "Graham import (its (10)-(11)) and a section-1 row of its own, so nothing here is re-derived**. " "**The identity (4) itself is NOT in print**: Sedunova section 2, Lemma (Weighted Vaughan identity), " "and Srivastav section 2, Lemma (Sieve-weighted Vaughan identity) -- both read in the TeX source -- " "truncate by the **magnitude** of the divisor and of `Lambda`'s argument; Srivastav factorises the " "**weight** (`1*h = (1*theta')(1*lambda)`, `U1 = U, R = 1` giving classical Vaughan), and his " "`Lambda = 1_P*log + Lambda'`, paid `Sigma Lambda' << sqrt M`, is the classical proper-prime-power " "separation, not our `E_W`. **Same type, different object; no novelty claim.** MathSciNet/zbMATH " "unreached. |" ) def sha(path): with open(path, "rb") as fh: return hashlib.sha256(fh.read()).hexdigest() def main(): got = sha(BASE) if got != BASE_SHA: raise SystemExit("base sha %s != served %s; refusing to build" % (got, BASE_SHA)) text = open(BASE, encoding="utf-8").read() lines = text.split("\n") hits = [i for i, ln in enumerate(lines) if ln.startswith(ANCHOR)] if len(hits) != 1: raise SystemExit("anchor found %d times, expected 1" % len(hits)) at = hits[0] + 1 if lines[at].strip() != "": raise SystemExit("expected a blank line after the anchor, found %r" % lines[at]) bare = [m.start() for m in __import__("re").finditer(r"(?", sum(1 for l in out if l.startswith("| "))) print("diff : +%d/-%d row chars %d" % (added, removed, len(ROW))) if __name__ == "__main__": main()