pith. sign in

arxiv: 2601.01004 · v5 · pith:IEX43BFZnew · submitted 2026-01-02 · 🧮 math.AC

Toward a unified theory for common affine roots of general sets of multivariate polynomials

Olav Geil This is my paper

Pith reviewed 2026-05-21 15:20 UTC · model grok-4.3

classification 🧮 math.AC
keywords multivariate polynomialscommon rootsfactor theoreminterpolation theoremleading monomialfootprint bounderror-correcting codesdual spaces
0
0 comments X

The pith

Leading monomial size unifies the factor and interpolation theorems for common roots of multivariate polynomials as dual results.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper replaces total degree with the leading monomial as the measure of size for multivariate polynomials. This change lets the footprint bound act as a sharp upper limit on the number of common roots, at least for finite Cartesian product point sets. Methods from error-correcting codes then produce an interpolation polynomial that vanishes on any given finite point set. The factor bound and the interpolation construction turn out to be the same statement expressed in dual vector spaces. A reader would care because this supplies the simple paired relation between root counting and interpolation that the univariate case enjoys but that multivariate theory had lacked.

Core claim

For general multivariate polynomials the right measure for the size of the polynomial should not be the degree, but the leading monomial. In this setting the footprint bound becomes a natural enhancement of the factor theorem providing a bound on the number of common roots of general multivariate polynomials which is sharp for all finite Cartesian product point-sets. By using methods from the theory of error-correcting codes a natural formulation of the interpolation theorem is established to the case of common roots of multivariate polynomials, reducing the two theorems to the same result but for dual spaces.

What carries the argument

Leading monomial as the size measure for a multivariate polynomial, together with the footprint bound and the coding-theoretic construction of an interpolation polynomial in the dual space.

If this is right

  • The footprint bound supplies a sharp count of common roots for every finite Cartesian product when size is taken to be the leading monomial.
  • An interpolation polynomial vanishing on an arbitrary finite point set can be built directly from coding-theory techniques without extra conditions on the base field.
  • The factor theorem and the interpolation theorem become formally dual statements once the size measure is changed to the leading monomial.
  • The same unification framework may be applied to other notions of multiplicity once those notions are expressed in terms of leading monomials.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The dual-space view may let root-counting bounds from algebraic coding theory transfer immediately to questions in computational algebra.
  • Similar dualization might organize statements about ideals or varieties when the monomial order is fixed in advance.
  • The approach suggests that Gröbner-basis algorithms could be re-examined through the same leading-monomial lens to obtain sharper complexity estimates.

Load-bearing premise

The footprint bound stays valid and sharp when polynomial size is measured by leading monomial rather than total degree, and standard coding-theory techniques produce an interpolation polynomial for any finite point set without further restrictions on the field or the arrangement of the points.

What would settle it

A finite Cartesian product point set over a field where the number of common roots exceeds the footprint bound computed from leading monomials, or a finite point set for which no interpolation polynomial of the predicted leading monomial can be constructed by the dual-space coding method.

read the original abstract

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality having all the points as roots (interpolation theorem). Tao noted in [48] that the theory of multivariate polynomials is not yet sufficiently matured to provide similar theorems with an equally simple relation between them. In the present paper we argue that for general multivariate polynomials the right measure for the size of the polynomial should not be the degree, but the leading monomial. In this setting the footprint bound [27] becomes a natural enhancement of the factor theorem providing a bound on the number of common roots of general multivariate polynomials which is sharp for all finite Cartesian product point-sets. As our main contribution, by using methods from the theory of error-correcting codes we establish a natural formulation of the interpolation theorem to the case of common roots of multivariate polynomials. In short the two theorems reduce to the same result, but for dual spaces, establishing the unification requested in [48]. We leave it for further research to possibly establish similar interpolation results taking one or more of the various concepts of multiplicity of multivariate polynomials into account.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 2 minor

Summary. The paper claims that replacing total degree with leading monomial as the size measure for multivariate polynomials yields a natural multivariate factor theorem via the footprint bound (sharp for Cartesian product point sets) and, via error-correcting code techniques, an interpolation theorem for common roots of arbitrary finite sets. These two results are asserted to be dual statements in dual spaces, thereby unifying the theory in the sense requested by Tao in [48].

Significance. If the central claims hold, the work supplies a clean unification of bounding and constructive results for common affine roots of multivariate polynomials, directly responding to the question in [48] and linking algebraic geometry with coding theory. The leading-monomial formulation and duality perspective are potentially valuable for extensions to multiplicities and for applications in which monomial orders are natural.

major comments (3)
  1. [Abstract] Abstract and main result: the assertion that coding-theory methods produce an interpolating polynomial whose leading monomial is exactly the dual of the footprint, for arbitrary finite point sets and without field or geometric restrictions, is not accompanied by an explicit construction or verification that the evaluation map is surjective onto functions on S. For non-Cartesian configurations the cokernel may be nontrivial, so the leading-term condition may fail.
  2. [Section on footprint bound (near the statement of the enhanced factor theorem)] Footprint-bound sharpness claim: the manuscript states that the bound remains sharp when size is measured by leading monomial rather than total degree, yet provides no self-contained argument or explicit check that the prior footprint result of [27] transfers verbatim under this change of measurement for sets that are not Cartesian products.
  3. [Section containing the unification theorem] Duality argument: the reduction of the two theorems to dual statements is presented as immediate once the coding-theoretic interpolation is in place, but the manuscript does not exhibit the precise vector-space duality (including bases and annihilators) that would confirm the leading-monomial prescription survives restriction to the dual.
minor comments (2)
  1. [Introduction] Define the monomial order and the precise notion of leading monomial at the first appearance; the current notation is used before it is fixed.
  2. [Examples section] Add a small concrete example (e.g., three non-collinear points in the plane) that exhibits both the footprint bound and the explicit interpolating polynomial with the predicted leading monomial.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and the constructive major comments. The points raised concern the level of explicit detail provided for the coding-theoretic construction, the self-contained justification of the sharpness claim, and the precise formulation of the duality. We address each comment below and will revise the manuscript accordingly to strengthen the exposition while preserving the core claims.

read point-by-point responses

  1. Referee: [Abstract] Abstract and main result: the assertion that coding-theory methods produce an interpolating polynomial whose leading monomial is exactly the dual of the footprint, for arbitrary finite point sets and without field or geometric restrictions, is not accompanied by an explicit construction or verification that the evaluation map is surjective onto functions on S. For non-Cartesian configurations the cokernel may be nontrivial, so the leading-term condition may fail.

    Authors: The manuscript presents the interpolation result via error-correcting code methods in the section developing the main theorem, where the code is chosen so that its dual generator matrix yields a polynomial whose leading monomial is the dual of the footprint. We acknowledge that the abstract is concise and that an explicit verification of surjectivity would improve clarity. In the revised version we will insert a dedicated lemma proving that the evaluation map from the space of polynomials with leading monomials strictly less than the dual footprint to the functions on an arbitrary finite set S is surjective, using the minimum-distance property of the code; this argument holds over any field and for any finite S without geometric restrictions, showing the cokernel is trivial. revision: yes

  2. Referee: [Section on footprint bound (near the statement of the enhanced factor theorem)] Footprint-bound sharpness claim: the manuscript states that the bound remains sharp when size is measured by leading monomial rather than total degree, yet provides no self-contained argument or explicit check that the prior footprint result of [27] transfers verbatim under this change of measurement for sets that are not Cartesian products.

    Authors: The sharpness statement in the manuscript is restricted to Cartesian product point sets, as already indicated in the abstract. The original proof in [27] is combinatorial and relies on the structure of the leading-term ideal rather than the specific size measure; replacing total degree by leading monomial therefore preserves the argument verbatim for Cartesian products. To make the manuscript self-contained we will add a short subsection that reproduces the key combinatorial steps of the sharpness proof from [27], adapted explicitly to the leading-monomial setting, without requiring the reader to consult the reference for the transfer. revision: yes

  3. Referee: [Section containing the unification theorem] Duality argument: the reduction of the two theorems to dual statements is presented as immediate once the coding-theoretic interpolation is in place, but the manuscript does not exhibit the precise vector-space duality (including bases and annihilators) that would confirm the leading-monomial prescription survives restriction to the dual.

    Authors: The unification rests on the observation that the factor theorem lives in the polynomial ring while the interpolation theorem lives in the dual space of functions on S. We agree that exhibiting the concrete duality would make the reduction fully rigorous. In the revised manuscript we will expand the unification section to specify a monomial basis for the polynomial space, the dual basis of evaluation functionals, and the annihilator of the leading-term ideal; we will then verify directly that the leading-monomial condition on one side corresponds to the dual leading-monomial condition on the other side. revision: yes

Circularity Check

0 steps flagged

Unification via coding-theory duality does not reduce to self-definition or fitted prediction

full rationale

The paper cites the footprint bound from prior work [27] and invokes standard techniques from error-correcting codes to construct an interpolation polynomial whose leading monomial is controlled by the dual space. The central claim is that the factor theorem (footprint bound) and interpolation theorem become dual statements when size is measured by leading monomial rather than total degree. No equation or construction in the manuscript is shown to be equivalent to its own input by definition, nor is a parameter fitted on a subset of data and then relabeled as a prediction. The unification is presented as a new observation obtained by transferring external coding-theory methods, keeping the derivation self-contained against those external benchmarks. Normal citation of prior results does not elevate the circularity score beyond a minor level.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper rests on standard facts from algebra and on one prior combinatorial bound; no new free parameters, invented entities, or ad-hoc axioms are introduced in the abstract.

axioms (2)
  • standard math Univariate factor theorem and interpolation theorem hold over arbitrary fields.
    Invoked as the baseline that the multivariate theory should match.
  • domain assumption The footprint bound of [27] supplies a sharp upper bound on common roots when size is measured by leading monomial.
    Used as the natural enhancement of the factor theorem for Cartesian product sets.

pith-pipeline@v0.9.0 · 5740 in / 1600 out tokens · 47056 ms · 2026-05-21T15:20:06.637692+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

48 extracted references · 48 canonical work pages · 1 internal anchor

  1. [1]

    N. Alon. Combinatorial nullstellensatz.Combin. Probab. Comput., 8(1-2):7–29, 1999

    work page 1999

  2. [2]

    Alon and Z

    N. Alon and Z. Füredi. Covering the cube by affine hyperplanes.European J. Combin., 14(2):79–83, 1993

    work page 1993

  3. [3]

    H. E. Andersen and O. Geil. Evaluation codes from order domain theory.Finite Fields Appl., 14(1):92–123, 2008

    work page 2008

  4. [4]

    A. Baker. Linear forms in the logarithms of algebraic numbers (iv).Mathematika, 15(2):204–216, 1968

    work page 1968

  5. [5]

    Beelen, M

    P. Beelen, M. Datta, and S Ghorpade. Maximum number of common zeros of homogeneous polynomials over finite fields.Proc. Am. Math. Soc., 146(4):1451– 1468, 2018

    work page 2018

  6. [6]

    A. Bishnoi. Anurag’s math blog: The footprint bound, https://anuragbishnoi.wordpress.com/2018/03/25/the-footprint-bound, 2018

    work page 2018

  7. [7]

    Bishnoi, P

    A. Bishnoi, P. L. Clark, A. Potukuchi, and J. R. Schmitt. On zeros of a polyno- mial in a finite grid.Combin. Probab. Comput., 27(3):310–333, 2018

    work page 2018

  8. [8]

    Bombieri

    E. Bombieri. Counting points on curves over finite fields: d’après SA Stepanov. InSéminaire Bourbaki vol. 1972/73 Exposés 418–435, pages 234–241. Springer, 2006. 16

    work page 1972

  9. [9]

    Bras-Amorós and M

    M. Bras-Amorós and M. E. O’Sullivan. Duality for some families of correction capability optimized evaluation codes.Adv. Math. Commun., 2(1):15–33, 2008

    work page 2008

  10. [10]

    D. A. Cox, J. Little, and D. O’Shea.Ideals, varieties, and algorithms: an intro- duction to computational algebraic geometry and commutative algebra. Springer, second edition, 1997

    work page 1997

  11. [11]

    D. A. Cox, J. Little, and D. O’shea.Using algebraic geometry. Springer, second edition, 2004

    work page 2004

  12. [12]

    Datta and S

    M. Datta and S. Ghorpade. Number of solutions of systems of homogeneous polynomial equations over finite fields.Proc. Am. Math. Soc., 145(2):525–541, 2017

    work page 2017

  13. [13]

    Delsarte, J.-M

    P. Delsarte, J.-M. Goethals, and F. J. Mac Williams. On generalized Reed-Muller codes and their relatives.Inf. Control, 16(5):403–442, 1970

    work page 1970

  14. [14]

    Z. Dvir. On the size of Kakeya sets in finite fields.J. Amer. Math. Soc., 22(4):1093–1097, 2009

    work page 2009

  15. [15]

    Z. Dvir. Incidence theorems: Beyond the polynomial method.NSF Award Number 1953807. Directorate for Mathematical and Physical Sciences, 19(1953807):53807, 2020

    work page 2020

  16. [16]

    Z. Dvir, S. Kopparty, S. Saraf, and M. Sudan. Extensions to the method of multiplicities, with applications to Kakeya sets and mergers.SIAM J. Comput., 42(6):2305–2328, 2013

    work page 2013

  17. [17]

    Eisenbud and S

    D. Eisenbud and S. Popescu. The projective geometry of the Gale transform.J. Algebra, 230(1):127–173, 2000

    work page 2000

  18. [18]

    G. L. Feng and T. R. N. Rao. Decoding algebraic-geometric codes up to the designed minimum distance.IEEE Trans. Inform. Theory, 39(1):37–45, 1993

    work page 1993

  19. [19]

    G. L. Feng and T. R. N. Rao. A simple approach for construction of algebraic-geometric codes from affine plane curves.IEEE Trans. Inform. Theory, 40(4):1003–1012, 1994

    work page 1994

  20. [20]

    G. L. Feng and T. R. N. Rao. Improved geometric Goppa codes part I: Basic theory.IEEE Trans. Inform. Theory, 41(6):1678–1693, 1995

    work page 1995

  21. [21]

    G. D. Jr. Forney. Dimension/length profiles and trellis complexity of linear block codes.IEEE Trans. Inform. Theory, 40(6):1741–1752, 1994

    work page 1994

  22. [22]

    O. Geil. Evaluation codes from an affine variety code perspective. InAdvances in algebraic geometry codes, volume 5 ofSer. Coding Theory Cryptol., pages 153–180. World Sci. Publ., Hackensack, NJ, 2008. 17

    work page 2008

  23. [23]

    O. Geil. On multivariate polynomials with many roots over a finite grid.J. Algebra Appl., 20(08):2150136, 2021

    work page 2021

  24. [24]

    O. Geil. Considerate ramp secret sharing.Des. Codes Cryptogr., 94(3):49, 2026

    work page 2026

  25. [25]

    Geil and T

    O. Geil and T. Høholdt. Footprints or generalized Bezout’s theorem.IEEE Trans. Inform. Theory, 46(2):635–641, 2000

    work page 2000

  26. [26]

    Geil and U

    O. Geil and U. Martínez-Peñas. Bounding the number of common zeros of multivariate polynomials and their consecutive derivatives.Combin. Probab. Comput., 28(2):253–279, 2019

    work page 2019

  27. [27]

    O. Geil, R. Matsumoto, and D. Ruano. Feng-Rao decoding of primary codes. Finite Fields Appl., 23:35–52, 2013

    work page 2013

  28. [28]

    Geil and C

    O. Geil and C. Thommesen. On the Feng-Rao bound for generalized Hamming weights. In M. P.C. Fossorier, H. Imai, S. Lin, and A. Poli, editors,Applied Al- gebra, Algebraic Algorithms and Error-Correcting Codes, volume 3857 ofLecture Notes in Comput. Sci., pages 295–306. Springer, 2006

    work page 2006

  29. [29]

    Geil and C

    O. Geil and C. Thomsen. More results on the number of zeros of multiplicity at least r.Discrete Math., 340(5):1028–1038, 2017

    work page 2017

  30. [30]

    Hasse.Zur Theorie der abstrakten elliptischen Funktionenkörper III

    H. Hasse.Zur Theorie der abstrakten elliptischen Funktionenkörper III. Die Struktur des Meromorphismenrings. Die Riemannsche Vermutung.De Gruyter, 1936

    work page 1936

  31. [31]

    T. Høholdt. On (or in) Dick Blahut’s’ footprint’.Codes, Curves and Signals, pages 3–9, 1998

    work page 1998

  32. [32]

    Høholdt, J

    T. Høholdt, J. H. van Lint, and R. Pellikaan. Algebraic geometry codes. In V. S. Pless and W. C. Huffman, editors,Handbook of Coding Theory, volume 1, pages 871–961. Elsevier, Amsterdam, 1998

    work page 1998

  33. [33]

    Kós and L

    G. Kós and L. Rónyai. Alon’s nullstellensatz for multisets.Combinatorica, 32(5):589–605, 2012

    work page 2012

  34. [34]

    Lang and A

    S. Lang and A. Weil. Number of points of varieties in finite fields.Amer. J. Math., 76(4):819–827, 1954

    work page 1954

  35. [35]

    Z. Liu, W. Chen, and Y. Luo. The relative generalized Hamming weight of linear q-ary codes and their subcodes.Des. Codes Cryptogr., 48(2):111–123, 2008

    work page 2008

  36. [36]

    Matsumoto

    R. Matsumoto. Miura’s generalization of one-point AG codes is equivalent to Høholdt, van lint and pellikaan’s.IEICE Trans. Fundamentals, 82(10):2007– 2010, 1999

    work page 2007

  37. [37]

    Maximumnumberofzeroesofpolynomialsonweighted projective spaces over a finite field.ArXiv preprint arXiv:2507.22597, 2025

    J.NardiandR.San-José. Maximumnumberofzeroesofpolynomialsonweighted projective spaces over a finite field.ArXiv preprint arXiv:2507.22597, 2025. 18

    work page internal anchor Pith review arXiv 2025

  38. [38]

    Pellikaan and X.-W

    R. Pellikaan and X.-W. Wu. List decoding of q-ary Reed-Muller codes.IEEE Trans. Inform. Theory, 50(4):679–682, 2004

    work page 2004

  39. [39]

    Pellikaan and X.-W

    R. Pellikaan and X.-W. Wu. List decoding of q-ary Reed-Muller codes. Expanded version of [38].Available from https://ruudp.win.tue.nl/paper/43-exp.pdf, 2004

    work page 2004

  40. [40]

    G. Rote. The generalized combinatorial Lason-Alon-Zippel-Schwartz nullstellen- satz lemma.ArXiv preprint arXiv:2305.10900, 2023

    work page arXiv 2023

  41. [41]

    J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial iden- tities.J. ACM, 27(4):701–717, 1980

    work page 1980

  42. [42]

    Countingpointsoncurvesoverfinitefields

    S.A.Stepanov. Countingpointsoncurvesoverfinitefields. InCodes on Algebraic Curves, pages 143–172. Springer, 1999

    work page 1999

  43. [43]

    Stichtenoth.Algebraic function fields and codes

    H. Stichtenoth.Algebraic function fields and codes. Universitext. Springer- Verlag, Berlin, 1993

    work page 1993

  44. [44]

    T. Tao. Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory.EMS Surv. Math. Sci., 1(1):1–46, 2014

    work page 2014

  45. [45]

    J. A. Thas. Projective geometry over a finite field. InHandbook of incidence geometry, pages 295–347. Elsevier, 1995

    work page 1995

  46. [46]

    M. N. Walsh. The polynomial method over varieties.Inventiones mathematicae, 222(2):469–512, 2020

    work page 2020

  47. [47]

    A. Weil. Numbers of solutions of equations in finite fields.Bull. Amer. Math. Soc., 55:497–508, 1949

    work page 1949

  48. [48]

    R. Zippel. Probabilistic algorithms for sparse polynomials. InInternational symposium on symbolic and algebraic manipulation, pages 216–226. Springer, 1979. 19

    work page 1979