Answers are grounded in this paper and cite their sources.
We prove the Gatzweiler-Krattenthaler conjecture on quotients of Gaussian binomial coefficients with a common upper index. The main result concerns two disjoint integer intervals of equal length. If the upper interval contains at least as many multiples of each positive integer as the lower interval, then every subset of the lower interval generates at least its own cardinality of elements in the upper interval under addition. A Dyson transform modulo the least generator gives the count when the interval is long relative to that generator. Short intervals are treated by counting sums between multiples of the extreme generators. A criterion for weighted complete intersections then realizes the polynomial quotient as a Hilbert series. The accompanying Lean formalization verifies the implication from polynomial divisibility to the interval counting theorem. Files: the paper (PDF and LaTeX source) and lean-supplement.zip, which contains the 22 local Lean 4 modules (Lean 4.24.0, mathlib commit f897ebcf72cd16f89ab4577d0c826cd14afaafc7), a README and the rebuild script verify.py. Main declaration: QBinomialPolynomiality.polynomiality_implies_hall. Axioms reported: propext, Classical.choice, Quot.sound.
No takes yet. Share an insight, caveat, or question.
Jason Peng (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: