Swap differences of powers: a conjecture of Fill and Janson on nonnegative coefficients, and two cases of their root conjecture
Abstract
In an appendix to their study of positive autocorrelation at unit lag for stationary random walk Metropolis–Hastings, Fill and Janson introduce the two-variable polynomial h(t,a;r) &= [1+(3+a)t]ʳ([1+(2+a)t]ʳ⁺¹-[1+at]ʳ⁺¹) &qquad()- [1+(1+a)t]ʳ([1+(4+a)t]ʳ⁺¹-[1+(2+a)t]ʳ⁺¹), prove that it is nonnegative for real r ≥ 1 and real a,t ≥ 0 by a Jensen argument, and then conjecture, "in passing", a considerable strengthening: that for fixed r ∈ ℕ the polynomial h(t,a;r) in (t,a) has nonnegative coefficients. We prove that conjecture, for every r ∈ ℕ. The proof rests on the observation that with P=1+(1+a)t and Q=1+(3+a)t the four inner brackets of h are exactly P ± t and Q ± t, so that h is the swap difference Qʳ((P+t)ʳ⁺¹-(P-t)ʳ⁺¹)-Pʳ((Q+t)ʳ⁺¹-(Q-t)ʳ⁺¹), together with a polynomial identity, valid over any commutative ring, that writes such a swap difference as a sum of products of P, Q, y and Q-P with nonnegative integer scalars. Since Q-P=2t here, positivity is termwise: there is no inequality and no analysis in the argument. What we actually prove is the abstract statement — if P, Q, y and Q-P all have nonnegative coefficients then so does the swap difference — of which Fill and Janson's conjecture is one instance, and we show by explicit counterexamples that neither the exponent balance (r,r+1) nor the hypothesis on Q-P can be dropped. We also settle the first two cases of Fill and Janson's second conjecture, on the roots of g(k;r)=g(k+1;r) with g(k;r)=(2k-1)ʳ/Σ_(i ≤ k)iʳ: the case k=1 has r=1 as its unique real root, and the case k=2 has a unique real root, which lies strictly between 2 and 3. Finally we close six of the thirteen inequalities on which Fill and Janson's own proof of s(r)=max_(k ≤ k₀(r))g(k;r) rests through what they describe as "the clear indication from a plot", and we do so on all of (1,∞). Every theorem below has been formally verified in Lean 4 against Mathlib.
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
98d572bb98ef88f69390b60970a1deaba9a298d9f6a08b42e1749c3f0b066d2e
Claim ledger
Stated results
FJ1candidate2026-09-03
Fill and Janson's Conjecture Conj:strong!: for every natural r the polynomial h(t, a; r) has nonnegative coefficients
FJ2routine2026-09-03
The swap identity: over any commutative ring, Qʳ((P+y)ʳ⁺¹-(P-y)ʳ⁺¹) - Pʳ((Q+y)ʳ⁺¹-(Q-y)ʳ⁺¹) = sum_(m<=r) (1-(-1)ᵐ⁺¹) C(r+1,m+1) yᵐ⁺¹ (PQ)ʳ⁻ᵐ (Q-P) sum_(i<m) Qⁱ Pᵐ⁻¹⁻ⁱ
FJ3candidate2026-09-03
The abstract positivity theorem: if P, Q, y and Q - P all have nonnegative coefficients then so does the swap difference; Fill-Janson's conjecture is the instance P = 1+(1+a)t, Q = 1+(3+a)t, y = t
FJ4routine2026-09-03
Structure of h: h(.,.;0) = h(.,.;1) = 0; h(t,a;2) = 8 t⁴ (1 + 2t + at); and t⁴ divides h(.,.;r) for every r
FJ5routine2026-09-03
Negative controls: the (r, r+1) exponent balance and the hypothesis that Q - P has nonnegative coefficients are both essential, h(.,.;2) is not zero, and coefficientwise nonnegativity is strictly stronger than nonnegativity on the positive orthant
FJ6routine2026-09-03
Fill-Janson Conjecture Conj:Kr at k = 1: g(1;r) = g(2;r) holds for exactly one real r, namely r = 1
FJ7candidate2026-09-03
Fill-Janson Conjecture Conj:Kr at k = 2: g(2;r) = g(3;r) holds for exactly one real r, and that root lies strictly between 2 and 3
FJ8measurement2026-09-03
Measured price of the two plot-based gaps the source itself flags in its proof of s(r) = max_(k <= k₀(r)) g(k;r)
This ledger entry is reported in prose and is not bound to a Lean theorem.FJ9routine2026-09-03
Six of the thirteen inequalities of the plot-based gap the source flags on [1.043, 2.198) – the pairs (1,0), (2,0), (3,0), (3,1), (4,0), (5,0) – proved for every r > 1
Provenance
- Generated by
- Machina Mathematica
- Released by
- Korea Superintelligence Labs
- Source context
- James Allen Fill and Svante Janson, *Positive autocorrelation at unit lag for stationary random walk Metropolis-Hastings in ℝᵈ*, arXiv:2601.19323v1 (math.PR / math.ST, 52 pages, posted 2026-01-27). The live version on 2026-09-03 is still v1 — checked against the arXiv API, and against Janson's own paper list (www2.math.uu.se/ svantejs/papers/, entry [400]), which carries no journal reference and no "proved by" annotation for it.
- Snapshot
- 2026-09-07 03:53 UTC
- Ledger commit
801848d7