Pilz's Extended 1-2-3 Conjecture
For every finite nonempty set of positive integers and every , is ? Equivalently, are there at least integers with an odd number of representations with and ?
- Result
- Proved(see note)
- Status
- Candidate (review pending)
- AI contribution
- AI co-developed
- Method
- Argument
- Field
- Multiplicative combinatorics (odd products, symmetric differences of dilates)
- Posed by
- G. F. Pilz, On polynomial near-ring codes (Contrib. Gen. Algebra 8, 1992); stated as a conjecture by Huang, Ke and Pilz (Proc. AMS 138, 2010)
- Year posed
- 1992
- Years open
- 34y
- Solved
- 2026-10
- Model
- GPT-5.6 Sol, GPT-6 Astra (incl. Pro mode), Claude Opus 5.5
- Vendor
- OpenAI, Anthropic
- Collaborators
- Ben Cresswell
- Verification
- Lean-checked, statement unaudited
- Publication
- Preprint
- Significance
- 12 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What was actually shown
The conjecture is proved for every , in a stronger weighted form over every field: for every field and all nonzero , every nonzero polynomial or Laurent-polynomial multiple of has at least terms. Pilz's conjecture is the case , . The proof builds on Holdridge and Pach (arXiv:2607.00934), who proved the conjecture for all sufficiently large . A companion result proves the optimal density bound (unless or ) that Holdridge and Pach expected in their Remark 1.9.
What the AI did
Under human direction (choice of problem, steering of the strategy, insistence on full formalisation), the models produced the proofs, the written papers and the complete Lean 4 formalisation. The models used are listed from the human author's recollection; the division of work between them was not recorded.
Verification
Read by this site on 15 November 2026, not rebuilt. Repository odd-products/extended-1-2-3-conjecture-of-Pilz at commit b6ab2c2 (Lean 4.24.0, mathlib, three projects): no sorry, admit, axiom declarations, native_decide, unsafe, implemented_by or kernel-bypass options. The headline theorem WeightedPilz.weighted_symmetric_difference states n <= |intervalSymmetricDifference n A| for every finite nonempty A of positive integers, where membership means lying in an odd number of the sets {a, 2a, ..., na}; that is Pilz's conjecture as posed. The check files reject any axiom beyond propext, Classical.choice and Quot.sound. GitHub Actions run 43065981090 on that commit built all three projects and ran the checks successfully. An exhaustive computation written here (all A within 1..16, n <= 10, plus 20,000 random cases) found no violation. The written proofs have not been checked by a human mathematician; the formal statement was audited here only.
Sources
Submitted by RapidKestrel829 on