bibkey: perellipintzsalerno1984shortintervals authors: A. Perelli, J. Pintz and S. Salerno year: 1984 title: Bombieri’s theorem in short intervals doi: null url: https://www.numdam.org/item/ASNSP_1984_4_11_4_529_0/ claim: Theorem on printed p.530 and estimate (2) on p.529 give a uniform fixed-modulus short-interval estimate, including modulus 3; splitting longer intervals into blocks and removing prime powers supplies the actual Fibonacci affine tail’s cumulative mass calibration. The original theorem is a literature input, not a Lean-verified result here. strata_touched: [] license: citation-only triage: anchor
Fixed modulus in a uniform short-interval theorem
Perelli, Pintz and Salerno, Bombieri’s theorem in short intervals, Annali della Scuola Normale Superiore di Pisa, Classe di Scienze, series 4, 11 (1984), no.4, 529–539. The Numdam record links the original scan. Estimate (2), its parameter definitions and the theorem were read directly on printed pp.529–530. This verifies the cited statement and its scope; it is not an independent audit of the complete proof or a Lean proof of that theorem.
The paper defines
Estimate (2) is
where is fixed, and . Here denotes the exponent printed as in the paper; it is not the Chebyshev function. The theorem on p.530 states that (1) holds for
The constants and the logarithmic exponent may depend on the fixed parameters. The theorem is unconditional. Its maximum is over every stated starting point, every short length, and every reduced residue class. It is neither an almost-all statement nor only an ordinary-prime count.
Choose and . Then , so fixed is included eventually. Every term in the modulus sum is nonnegative, and ; therefore (1) supplies
uniformly for and .
Longer tails and the prime-only function
Put
For , split into at most adjacent blocks of length at most . If the first start is exactly , first remove a segment of length at most one; its error is , and all subsequent starts are strictly larger than . Apply (3) with to each remaining block and add the errors. This gives an error for the von Mangoldt sum, together with the harmless initial-segment error.
Remove prime powers only after the blocks have been combined. Their total contribution over the whole interval is at most
Thus
This is a paper application of the cited theorem and elementary telescoping and prime-power bounds. The prime-power loss is charged once, rather than once per block. The lower endpoint is strict, exactly as in the displayed theta difference.
At , set . Formula (4) gives nonnegative functions such that
One may take, for a sufficiently large fixed and all sufficiently large ,
In particular, if , the supremum of the error in (5) over is . This supplies the specified mod-3 short-edge law used in FIB §307. It fills a literature-input gap; it does not improve a prime-distribution theorem.
The actual source implications are in FIB §309: finite normalized removed mass forces a corresponding width and first distance moment, and those inputs feed the already defined centered Robin response. This paragraph identifies a consumer rather than treating the source application as a new prime estimate. The exact Lean transport uses the cumulative calibration as an explicit hypothesis; the PPS theorem and the analytic derivation of (5) are not Lean-verified here. No drift rate, common-baseline sign or RH conclusion follows from (1)–(5).