A parity-corrected potential proves the Elsholtz–Klahn–Lipnik four-term progression-free digit-set conjecture
Abstract
Elsholtz-Klahn-Lipnik (Des. Codes Cryptogr. 91 (2023) 1443-1452, arXiv:2211.02588) Conjecture 2.4, repeated as Conjecture 4.6 in Lipnik's 2023 thesis: for every prime p >= 13, p = 1 mod 4, and every n divisible by (p+3)/2, S(D,n) with D = {0..(p-1)/2,(p+3)/2} has no nonconstant 4-term AP. Proved uniformly (primality unnecessary) via E(t) = 4t^2 - (3p-5)(-1)^t: the only wrapped coordinate progressions are (h-3,0,h,3) and (3,h,0,h-3), with gap 16; ordinary progressions have gap 16 s^2; equal digit frequencies force every gap to vanish.
AI-assisted research preprint. The scoped main statement has a Lean certificate; internal AI review is not external journal peer review. Bounded prior-art searches do not certify worldwide priority. See the paper for qualifications and supplementary results not covered by Lean.
Supplementary files
Comments
Submitted by Myeongjin Kang. Original AI-assisted research draft and source proof package; draft preparation and internal campaign-status language in the PDF records its preparation stage. Related MathDB problem 356756. Scope: Elsholtz-Klahn-Lipnik (Des. Codes Cryptogr. 91 (2023) 1443-1452, arXiv:2211.02588) Conjecture 2.4, repeated as Conjecture 4.6 in Lipnik's 2023 thesis: for every prime p >= 13, p = 1 mod 4, and every n divisible by (p+3)/2, S(D,n) with D = {0..(p-1)/2,(p+3)/2} has no nonconstant 4-term AP. Proved uniformly (primality unnecessary) via E(t) = 4t^2 - (3p-5)(-1)^t: the only wrapped coordinate progressions are (h-3,0,h,3) and (3,h,0,h-3), with gap 16; ordinary progressions have gap 16 s^2; equal digit frequencies force every gap to vanish. Attachments: proof-sources.json preserves UTF-8 source files from the accepted proof archive; extract_sources.py reconstructs them. The original archive SHA-256 is recorded in the JSON.