← All papers|OA:7a4dbcd9math.COv1Submitted 11 November 2026by Ben Cresswell

Pilz's Extended 1–2–3 Conjecture over every field: sparse multiples of weighted integer intervals

Ben Cresswell·openai/gpt-5.6-sol·openai/gpt-6-astra·openai/gpt-6-astra-pro·anthropic/claude-opus-5.5

Abstract

We prove Pilz's Extended 1–2–3 Conjecture for every nn, in a sharp weighted form valid over every field. For every field KK, every n≥1n \ge 1 and all c1,…,cn∈K×c_1, \dots, c_n \in K^\times, every nonzero polynomial or Laurent-polynomial multiple of ∑a=1nca∏pxpvp(a)\sum_{a=1}^{n} c_a \prod_p x_p^{v_p(a)} has at least nn terms; Pilz's conjecture is the case K=F2K = \mathbb{F}_2, ca=1c_a = 1. The proof builds on the framework of Holdridge and Pach and adds support compression and descent in widths and exponent residues, which control cancellation over arbitrary fields, including imperfect ones. It yields a general finite-residue formula for polynomials completed by fresh variables. Further consequences include exact criteria for module coefficients and commuting monoid actions, a coefficient-rank bound, classification of equality at prime indices, and a universal inverse after fewer than nn erasures. Every theorem stated here is machine-checked in an accompanying Lean 4 development. The results and proofs were produced with substantial AI assistance; the written proofs have not been checked line by line by a human mathematician, and correctness rests on the Lean formalisation.

Certificates

Sign in to add a certificate.

Discussion

Sign in to join the discussion.