=================================================================== --- a/paper/kk-lower-bound.md version 7 +++ b/paper/kk-lower-bound.md version 8 @@ -3,8 +3,10 @@ **Local exposition for manuscript-binding review, 8 October 2026.** Chris Benjaminsen provided project direction. The three-band construction follows the architecture of Kalmynin and Konyagin and its existing fixed-offset adaptation in the project record. Earlier mathematical sources and contributors retain their credit. This new exposition was prepared by the actual gpt-6.1-sol assistant at high reasoning effort from the frozen Lean sources. It makes no claim to sole authorship or novelty. The original manuscript is preserved byte for byte in `original-manuscript-verbatim.md`. +The preserved contribution record distinguishes historical authorship from this revision. The original project manuscript's Methods and AI disclosure records [return #1093](https://solveathome.org/projects/twin-primes/return/1093) under nielsegberts with model gpt-6-astra (the manuscript names GitHub Copilot CLI), and [return #1730](https://solveathome.org/projects/twin-primes/return/1730) under Benjaminsen with deepseek-v4-flash (the manuscript names Freebuff). It also retains [return #158](https://solveathome.org/projects/twin-primes/return/158) for the historical OCR/source-custody and priced-constant discussion, and the recorded Codex revisions. These are historical credits, not claims that a new Astra or DeepSeek worker performed this source review. The linked [project contribution record](https://solveathome.org/projects/twin-primes/docs/research/RESEARCH-CONTRIBUTIONS-2026-09-27.md) and complete original disclosure remain part of the provenance; no author dates have been reconstructed here. + ## Abstract Let $P(y)=\prod_{p\le y}p$, where the product includes every prime at or below the real cutoff $y$. The integers surviving the two exclusions are @@ -42,9 +44,9 @@ $$ “Largest” means both that some integer start realizes distance $d$ and that every consecutive survivor gap at every integer start has distance at most $d$. The primes in the theorem run up to $y$, even though an auxiliary counting sieve later runs only up to $\sqrt y$. -The formal statements are `PrimaryMain.manuscript_main_goal`, `IntegerMainBinding.integer_maximum_binding`, and `IntegerMainBinding.manuscript_integer_main_goal`. The first uses the finite definition of $G_2$; the second identifies that definition with the integer maximum for every finite prime family; the third combines the two into the literal integer formulation above. The prime-family condition in the second theorem specifies the object under discussion. It supplies no analytic estimate. +The formal statements are `PrimaryMain.manuscript_main_goal`, `IntegerMainBinding.integer_maximum_binding`, and `IntegerMainBinding.manuscript_integer_main_goal`. The first uses the finite definition of $G_2$; the second identifies that definition with the integer maximum for every finite prime family; the third combines the two into the literal integer formulation above. The prime-family condition in the second theorem specifies the object under discussion. It supplies no analytic estimate. The formal parameters are explicitly `(S : Finset Nat)` and `(hS : PrimeFamily S)`, where `PrimeFamily S` means that every member of S is prime. Thus `assumptions: []` in the claim inventory means no additional analytic inputs or custom axioms; it does not erase this defining parameter/domain condition. Intermediate positivity and range hypotheses are discharged by the parameter lemmas before the final eventual claims are used. Here is the identification in detail. The polynomial $n(n+2)$ has the same residue at congruent integer arguments modulo $P_S$. Thus survivor membership is periodic, including at negative arguments. The residue $P_S-1$ survives: both $P_S-1$ and $P_S+1$ are coprime to $P_S$. This also covers the empty family, where $P_S=1$ and every integer survives. Every interval of $P_S$ consecutive positions contains a survivor, so any consecutive gap has distance at most $P_S$. The finite definition considers starts $0\le s