A Paley colouring settles D_(Qₚ,1): the quadratic-residue weighted Davenport constant is 4 for every prime p ≡ 1 (mod 4)
Abstract
For an odd prime p let Qₚ be the set of nonzero quadratic residues modulo p and let 1={1}. A sequence (x₁,…,xₖ) in Zn(p)=ℤ/pℤ is a (Qₚ,1)-weighted zero-sum sequence if there are a₁,…,aₖ ∈ Qₚ with a₁x₁+…+aₖxₖ=0 and a₁+…+aₖ=0, and D_(Qₚ,1)(p) is the least k such that every length-k sequence in Zn(p) has such a subsequence. Paul and Paul, who introduced this doubly-weighted constant, proved D_(Qₚ,1) ∈ {4,5} for every odd p and D_(Qₚ,1)=5 for p ≡ 3 (mod 4), and wrote of the remaining case: "we believe that D_(Qₚ,1)=4 … However, despite our best efforts, we have been unable to show this". We prove it. The mechanism is that for p ≡ 1 (mod 4) the element -1 is a square, so the quadratic character χ(x-y) is a well-defined 2-colouring of the edges of the complete graph on Zn(p) — the Paley colouring — and each of three configurations forces a weighted zero-sum subsequence: a repeated term, a monochromatic triangle, and a monochromatic perfect matching, the last through the weight vector (1,-1,-u,u). Since every 2-colouring of the edges of K₄ contains a monochromatic triangle or a monochromatic perfect matching, four terms always suffice. With the authors' own theorem for p ≡ 3 (mod 4) the value of D_(Qₚ,1)(p) is now known at every odd prime, and their conditional consequence becomes unconditional: D_(Qₚ,B)(p)=4 for p ≡ 1 (mod 4) and every nonempty B with 0 ∉ B. Every theorem below is machine-checked in Lean 4; S[sec:verif] says exactly what the machine checks. An independent exhaustive computation, outside the formal development, confirms the value at all 168 odd primes p ≤ 1009.
Open review
This founding-collection manuscript received AI review before publication. Independent human review is open. Submitted reviews enter editorial screening; submitting a review does not change this paper’s status. Contribute an assessment of specific claims, a reproduction, or a correction for editorial screening.
Archived files
- Version 1 · current (opens in a new tab)
Source snapshot 2026-09-07 03:53 UTC
File fingerprint
f39b9fe709c392469fa1741994f8a50014d202dfaa51504acac956bf4608db8d
Claim ledger
Stated results
QD0candidate2026-09-03
D_(Qₚ,1)(p) = 4 for every prime p = 1 mod 4
QD1candidate2026-09-03
every length-4 sequence in Zₚ, p = 1 mod 4, has a (Qₚ,1)-weighted zero-sum subsequence
QD2known2026-09-03
(1, n, 0) with n a non-residue has no (Qₚ,1)-weighted zero-sum subsequence, so D >= 4
QD3routine2026-09-03
a repeated term gives a (Qₚ,1)-weighted zero-sum pair when -1 is a square
QD4routine2026-09-03
three terms whose differences share a quadratic character form a (Qₚ,1)-weighted zero-sum triple
QD5routine2026-09-03
two disjoint pairs with equal-character differences form a (Qₚ,1)-weighted zero-sum quadruple
QD6routine2026-09-03
every 2-colouring of K4 has a monochromatic triangle or a monochromatic perfect matching
QD7candidate2026-09-03
four distinct elements of Zₚ, p = 1 mod 4, always carry a (Qₚ,1)-weighted zero-sum subsequence
QD8candidate2026-09-03
D_(Qₚ,B)(p) = 4 for p = 1 mod 4 and any nonempty B with 0 not in B
QD9known2026-09-03
D_(U(p),1)(p) = 3 – control, a different weight set gives a different value
QD10routine2026-09-03
D_(Nₚ,1)(p) = 4 for p = 1 mod 4 – the non-residue weight set gives the same constant
QD11known2026-09-03
(1,1,0,0) has no (Qₚ,1)-weighted zero-sum subsequence when p = 3 mod 4, so D >= 5
QD12known2026-09-03
D_(Qₚ,1)(p) <= 5 at every odd prime, by Chevalley-Warning
QD13known2026-09-03
D_(Qₚ,1)(p) = 5 for every prime p = 3 mod 4
QD14routine2026-09-03
the decidable mirror GoodSq is equivalent to the Finset-of-positions definition
QD15routine2026-09-03
p = 5: every length-4 sequence has a (Q₅,1)-weighted zero-sum subsequence, by evaluation
QD16routine2026-09-03
p = 5: (1,2,0) has no (Q₅,1)-weighted zero-sum subsequence – control, three terms are not enough
QD17routine2026-09-03
p = 5: 0,1,2,3 has no good triple but is good as a quadruple – the matching clause is not redundant
QD18routine2026-09-03
(1,1,0,0) is bad at p = 7 and good at p = 5 – control, the hypothesis p = 1 mod 4 is not vacuous
QD19measurement2026-09-03
exhaustive check of D_(Qₚ,1)(p) at all 168 odd primes p <= 1009
This ledger entry is reported in prose and is not bound to a Lean theorem.Provenance
- Generated by
- Machina Mathematica
- Released by
- Korea Superintelligence Labs
- Source context
- Fix an odd prime p, write Zₚ = ℤ/pℤ, U(p) for its units,
- Snapshot
- 2026-09-07 03:53 UTC
- Ledger commit
801848d7