# Graham 1978 read from the page raster — and what it does to the declared dependency **Job #2051.** S. Graham, *An asymptotic estimate related to Selberg's sieve*, J. Number Theory **10** (1978) 83–94. DOI `10.1016/0022-314X(78)90043-3` (paywalled). Open copy: Deep Blue (Michigan), item `4e48e4d5-b06c-4218-99ac-b71b875854dd`. ## 0. The retrieval problem, and why the obvious file must not be used Deep Blue serves three bitstreams on that item. One is the paper as a scan (`10570613-6769-4188-9c57-b21e872aba2b`, 396 586 bytes), one is an OCR text layer (`0ed0e5d0-bc76-40ba-a41b-77066cf6cb27`, 10 920 bytes), one is the 2006 deposit licence — **not** the paper. The OCR layer is **not evidence**. The PDF has no fonts: the page is 18 one-bit TIFF strips placed by explicit `cm` matrices, with invisible OCR text on top. That text renders - "Academic Press, Inc." as **"Academic Pray, Inc."** - the Theorem's main term `N log z₁` as **"N 1% 21"** - the Corollary's `N/log(z₂/z₁)` as **"log&z2,)"** - and it drops **every displayed equation**: the Theorem's formula, both cases of the Corollary, and display (5) entirely. Displays are exactly where the content is. So all statements below were read from the **page raster**, rebuilt by stacking the 18 strips in placement order (1706 × 2705 px). ## 1. What the paper says (raster, p. 83–84) Abstract (p. 83): *"Suppose 1 < z₁ < z₂ ⩽ N, and let Λ_i(d) = μ(d) max(log(z_i/d), 0) for i = 1, 2. We show that"* Σ_{1≤n≤N} ( Σ_{d|n} Λ₁(d) )( Σ_{e|n} Λ₂(e) ) = N log z₁ + O(N). **THEOREM** (p. 84): *Let 1 ⩽ z₁ ⩽ z₂ ⩽ N. Then* — the same identity, main term **N log z₁**. *"The supposition z₂ ⩽ N occasions no real loss of generality, since the value of Σ_{d|n} Λ_i(d) is independent of z_i when 1 < n ⩽ z_i."* **Display (5)**, attributed to Barban–Vehov: `Σ_{1≤n≤N} (Σ_{d|n} λ_d)² ⩽ N / log(z₂/z₁)` — an **upper bound**, no main term. **COROLLARY** (p. 84): *Suppose 1 ⩽ z₁ < z₂.* - If **z₂ ⩽ N**: `Σ_{1≤n≤N} (Σ_{d|n} λ_d)² = N/log(z₂/z₁) + O( N/log²(z₂/z₁) )`. - If **z₁ < N < z₂**: `Σ_{1≤n≤N} (Σ_{d|n} λ_d)² = N log(N/z₁)/log²(z₂/z₁) + O( N/log²(z₂/z₁) )`. The two hypotheses were read at **4×**: both are `z₂ ⩽ N` with a single subscript — **not** `z₁z₂ ⩽ N`. The weight is Graham's (4), `λ_d = (Λ₂(d) − Λ₁(d))/log(z₂/z₁)`, i.e. Selberg's m(d) = min(1, log(z₂/d)/log(z₂/z₁))⁺. ## 2. Why the reading is not a guess: the Corollary forces the main term This is the check that makes §1 evidence rather than impression. With `L = log(z₂/z₁)`, Σ(Σλ_d)² = L⁻² [ Σ(ΣΛ₂)² + Σ(ΣΛ₁)² − 2Σ(ΣΛ₁)(ΣΛ₂) ]. Apply the Theorem three times (permissible since z₁ ⩽ z₂ ⩽ N): `Σ(ΣΛ₂)² = N log z₂ + O(N)`, `Σ(ΣΛ₁)² = N log z₁ + O(N)`, `Σ(ΣΛ₁)(ΣΛ₂) = N log z₁ + O(N)`. Numerator `= N(log z₂ − log z₁) = NL`, and `NL/L² = N/L` — **exactly** the printed Corollary. The alternatives fail: - main term `N log z₂` ⇒ numerator `N(log z₁ − log z₂) = −NL` ⇒ `Σ(Σλ_d)² = −N/L` **< 0**; - main term `N log(z₂/z₁)` ⇒ numerator `−2NL` ⇒ `−2N/L` < 0. A sum of squares cannot be negative, so the glyph `z₁` in the Theorem is **forced** by the Corollary printed four lines below it. (This also corrects an earlier claim of mine, made from the OCR, that the Theorem's main term was `N log(z₂/z₁)`.) ## 3. Comparison with An, arXiv:2206.10104v1, eq. (1.1) — from his LaTeX source An's abstract: *"Suppose {λ_d} are Selberg's sieve weights and 1 ⩽ w < y ⩽ x. Graham's estimate on the Barban-Vehov problem shows that"* Σ_{1≤n≤x} (Σ_{d|n} λ_d)² = x/log(y/w) + O( x/log²(y/w) ). (1.1) and in §1: *"our x,w,y correspond to Graham's N,z₁,z₂."* **Verdict: (1.1) is a faithful verbatim quotation of Graham's Corollary, case z₂ ⩽ N.** Main term, error term and range all agree — because An's `y ⩽ x` **is** Graham's `z₂ ⩽ N`, and An himself declares the variable correspondence. The dependency can therefore be **removed**: the primary was read directly and it confirms him. Three things the corpus must not lose in the swap: 1. **(1.1) is the Corollary, not the Theorem.** Graham's two-parameter object — two *different* weights, `Σ(ΣΛ₁(d))(ΣΛ₂(e)) = N log z₁ + O(N)` — is the **THEOREM**, and An never quotes it. A corpus line that attributes the bilinear/two-sequence statement to An's (1.1) is attributing it to the wrong statement. 2. **(1.1) lives only in `z₂ ⩽ N`.** Outside it the Corollary gives `N log(N/z₁)/log²(z₂/z₁)` — a different main term. Silent use of the identity for `z₂ > N` crosses a case boundary that the printed Corollary marks explicitly. 3. **Display (5) is an upper bound** (`⩽ N/log(z₂/z₁)`), and An's LaTeX has that display **commented out** — his source states it only in prose. Do not cite An for (5). ## 4. Evidence on disk - `work/graham-page.py` — rebuilds a page raster from the strips (page index → PNG); prints the band map used to locate blocks (map only, never evidence). - `work/graham-p83.png`, `work/graham-p84.png` — rebuilt rasters (1696 × 2699, 1706 × 2705). - `work/graham-crops.py` / `graham-zooms2.py` / `graham-zooms3.py` — the crop HTML actually read, incl. the 4× and 5× glyph-critical boxes. - `work/graham-p84.html`, `graham-zooms2.html`, `graham-zooms3.html` — self-contained (base64), also visible in this thread's Preview tab. **Method note (reusable):** an image-only primary can be read without trusting any OCR by (i) rebuilding the page raster from the PDF's own strip images, (ii) computing where the target block sits, (iii) rendering a zoom crop as local HTML and reading it as an image. The corpus has now hit OCR-only primaries more than once; this removes the class. ## 5. Second finding: a SERVED document carries the range defect `research/transition-energy-review.md`, row **A9**, checked-hypotheses column, states the import's range as > `Graham range 1<=a=1; N>=z_1` and its decisive-calculation column then claims: *"his (1.1) hypothesis 1<=w