On the structure and generic non-Cartesianity of polynomials in product spaces

Chun-Yen Shen; Tuyen Trung Truong; Wei-Hsuan Yu

arxiv: 2605.22320 · v1 · pith:N6AS7ORTnew · submitted 2026-05-21 · 🧮 math.AG · math.CO

On the structure and generic non-Cartesianity of polynomials in product spaces

Chun-Yen Shen , Tuyen Trung Truong , Wei-Hsuan Yu This is my paper

Pith reviewed 2026-05-22 02:36 UTC · model grok-4.3

classification 🧮 math.AG math.CO

keywords Cartesian polynomialsproduct spacesZariski densityincidence geometryGröbner basesalgebraic geometry

0 comments

The pith

A generic polynomial of fixed degree on a product of spaces is non-Cartesian.

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

The paper develops a general theory of Cartesian polynomials, which are those that respect the product decomposition of their domain into complex spaces. It proves that for any degree d at least 2, the non-Cartesian polynomials form a Zariski-dense subset in the space of all degree-d polynomials across a wide range of dimensions. This shows that polynomials with Cartesian structure are highly exceptional rather than typical. The authors also provide sufficient criteria for non-Cartesianity and an algorithmic method to decide the property using Gröbner bases and Hilbert's Nullstellensatz. They apply this to incidence geometry to obtain sharp bounds on intersections and construct optimal configurations.

Core claim

For any fixed degree d ≥ 2, the set of Cartesian polynomials is not Zariski-dense in the space of all degree-d polynomials on C^{n1} × ⋯ × C^{nk} for broad ranges of the ni's; hence a generic polynomial is non-Cartesian.

What carries the argument

A Cartesian polynomial is one that respects the product decomposition of the domain, meaning it can be expressed in terms of functions on the individual factors in a specific way; the proof shows its complement is Zariski dense.

If this is right

Cartesian structure is exceptional for polynomials of degree 2 or higher.
Non-Cartesian polynomials can be detected algorithmically via Gröbner bases.
The non-Cartesian condition yields sharp intersection bounds in incidence geometry.
Extremal configurations achieve the optimality of these bounds.

Where Pith is reading between the lines

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

Similar genericity statements could apply to other algebraic properties on product spaces.
The decidability result may help classify polynomials in computational settings.
The incidence-geometry application suggests new constructions for extremal point-line configurations.

Load-bearing premise

The precise definition of a Cartesian polynomial must match the product structure of the domain for the genericity claim to hold.

What would settle it

An explicit construction of a Zariski-dense family of Cartesian polynomials of some fixed degree d ≥ 2 in the relevant dimensions would disprove the genericity of non-Cartesianity.

read the original abstract

We develop a general theory of Cartesian and non-Cartesian polynomials on products of complex spaces $\mathbb{C}^{n_1} \times \cdots \times \mathbb{C}^{n_k}$. We prove that, for any fixed degree $d \ge 2$, a (Zariski) generic polynomial is non-Cartesian in a broad range of dimensions, establishing that Cartesian structure is highly exceptional. We further introduce effective sufficient criteria for a polynomial to be non-Cartesian. Moreover, we show that being (non)-Catersian can be decided algorithmically via Gr\"obner basis methods and quantitative forms of Hilbert's Nullstellensatz. As an application, we connect the non-Cartesian condition to incidence geometry, obtaining sharp intersection bounds and constructing extremal configurations that demonstrate the optimality of these estimates.

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.

Desk Editor's Note private letter to a colleague

The paper shows Cartesian polynomials form a proper Zariski-closed subset for fixed degree d >= 2 on product spaces, with algorithmic tests and an incidence geometry application.

read the letter

The main point is that this work establishes Cartesian polynomials as exceptional rather than typical on products of complex spaces. For any fixed degree d at least 2, the non-Cartesian ones are Zariski-dense in a broad range of dimension tuples, so the special structure is rare in the parameter space of all degree-d polynomials. They give an explicit algebraic definition of the Cartesian condition, sufficient criteria to certify the opposite, and an algorithmic decision procedure via Groebner bases plus effective Nullstellensatz bounds. The incidence-geometry application then yields sharp intersection bounds together with extremal examples that demonstrate optimality. The combination of classification, computability, and concrete bounds is the useful package here. The stress-test note finds no internal gaps in the dimension counts or density argument, and the tools invoked are standard, so the core claims look mechanically sound. One minor soft spot is that the precise definition of Cartesian polynomial needs to be checked against existing notions for multi-homogeneous maps to ensure it is neither too narrow nor too broad for the intended applications. The phrase broad range of dimensions also leaves open exactly which tuples are covered, though the underlying counting appears to work without circularity. This paper is aimed at algebraic geometers who study polynomials on product varieties or who apply algebraic methods to incidence problems. A reader who wants explicit criteria and effective tests for special polynomials would get direct value from the algorithmic sections and the examples. It shows clear engagement with the literature through standard tools and reproducible methods, so it deserves a serious referee. I would recommend sending it out for peer review.

Referee Report

0 major / 3 minor

Summary. The manuscript develops a general theory of Cartesian and non-Cartesian polynomials on products of complex affine spaces C^{n_1} × ⋯ × C^{n_k}. It proves that for any fixed degree d ≥ 2, in a broad range of dimensions, the Cartesian polynomials form a proper Zariski-closed subset of the space of all degree-d polynomials, so that a Zariski-generic polynomial is non-Cartesian. The paper supplies effective sufficient criteria for non-Cartesianity and shows that membership can be decided algorithmically via Gröbner bases and quantitative forms of Hilbert's Nullstellensatz. As an application, it derives sharp intersection bounds in incidence geometry and constructs extremal configurations demonstrating optimality.

Significance. If the central claims hold, the result that Cartesian structure is highly exceptional (Zariski-dense complement) is a substantive contribution to algebraic geometry on product spaces. The explicit algebraic definition of the Cartesian condition, combined with Gröbner-basis decidability and effective Nullstellensatz bounds, supplies a concrete algorithmic tool; these strengths should be highlighted. The incidence-geometry application, yielding sharp bounds together with matching extremal examples, further strengthens the work by linking the algebraic criterion to geometric incidence questions.

minor comments (3)

The abstract contains the typographical error 'non-Cat ersian'; this should be corrected to 'non-Cartesian'.
The precise range of dimension tuples (n_1, …, n_k) for which the genericity statement holds should be stated explicitly in the introduction or the statement of the main theorem, rather than described only as 'a broad range'.
Notation for the ambient space of degree-d polynomials on the product should be introduced once and used consistently; occasional shifts between coordinate-wise and multi-index descriptions can be clarified.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and accurate summary of our manuscript, the assessment of its significance, and the recommendation for minor revision. No specific major comments or points requiring clarification were listed in the report.

Circularity Check

0 steps flagged

No significant circularity; derivation relies on standard algebraic tools

full rationale

The manuscript defines the Cartesian condition explicitly via an algebraic criterion on the product space, then applies Gröbner bases and effective Nullstellensatz bounds to exhibit a nonempty Zariski-open set of non-Cartesian degree-d polynomials. These steps invoke only classical, externally verifiable machinery (Zariski topology, Hilbert's Nullstellensatz, Gröbner algorithms) whose correctness does not depend on any result internal to the paper. No parameter is fitted to data and then relabeled as a prediction, no self-citation supplies a load-bearing uniqueness theorem, and the genericity statement follows directly from the dimension-counting and incidence arguments without reducing to a tautology or renaming of prior inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 2 invented entities

The work rests on standard algebraic-geometry axioms (Zariski topology for genericity, effectiveness of Groebner bases and quantitative Nullstellensatz) and introduces the new concepts of Cartesian and non-Cartesian polynomials as classification tools. No numerical free parameters appear; the invented entities are definitional rather than postulated physical objects.

axioms (2)

standard math Zariski topology on the coefficient space of polynomials of fixed degree
Used to define the notion of generic polynomial.
standard math Effectiveness of Groebner bases and quantitative forms of Hilbert's Nullstellensatz
Invoked for algorithmic decidability of the Cartesian property.

invented entities (2)

Cartesian polynomial no independent evidence
purpose: Classify polynomials that respect the product decomposition of the domain
New definition introduced to capture structure-preserving polynomials on product spaces.
non-Cartesian polynomial no independent evidence
purpose: Identify polynomials that entangle variables across product factors
Complement to the Cartesian case; central to the genericity statement.

pith-pipeline@v0.9.0 · 5678 in / 1595 out tokens · 68982 ms · 2026-05-22T02:36:42.414142+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

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

IndisputableMonolith/Foundation/AbsoluteFloorClosure.lean absolute_floor_iff_bare_distinguishability unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 1.4 (Generic non-Cartesianity). Let d≥2. Then a Zariski generic polynomial F∈C[x,y,z,t] of degree at most d is non-Cartesian.
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We show that being (non)-Cartesian can be decided algorithmically via Gröbner basis methods and quantitative forms of Hilbert’s Nullstellensatz.

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

20 extracted references · 20 canonical work pages

[1]

Barakat and M

M. Barakat and M. Lange-Hegermann, An algorithmic approach to Chevalley’s theorem on images of rational morphisms between affine varieties,Mathematics of Computation, 91(333):451–490, 2021

work page 2021
[2]

W. D. Brownawell, Bounds for the degrees in the Nullstellensatz,Annals of Mathematics, 126(3):577– 591, 1987

work page 1987
[3]

Bukh and J

B. Bukh and J. Tsimerman, Sum-product estimates for rational functions,Proceedings of the London Mathematical Society, 104(1):1–26, 2012

work page 2012
[4]

D. Cox, J. Little, and D. O’Shea,Ideals, Varieties, and Algorithms: An Introduction to Computa- tional Algebraic Geometry and Commutative Algebra, Springer, New York, 4th edition, 2015

work page 2015
[5]

Eisenbud,Commutative Algebra with a View Toward Algebraic Geometry, Springer, New York, 1995

D. Eisenbud,Commutative Algebra with a View Toward Algebraic Geometry, Springer, New York, 1995

work page 1995
[6]

Elekes and L

G. Elekes and L. R´ onyai, A combinatorial problem on polynomials and rational functions,Journal of Combinatorial Theory, Series A, 89(1):1–20, 2000. 38 SHEN, TRUONG, AND YU

work page 2000
[7]

Guth and N

L. Guth and N. H. Katz, On the Erd˝ os distinct distances problem in the plane,Annals of Mathe- matics, 181(1):155–190, 2015

work page 2015
[8]

Hartshorne,Algebraic Geometry, Springer, New York, 1977

R. Hartshorne,Algebraic Geometry, Springer, New York, 1977

work page 1977
[9]

Kaplan, J

H. Kaplan, J. Matouˇ sek, and M. Sharir, Simple proofs of classical theorems in discrete geometry via the Guth–Katz polynomial partitioning technique,Discrete & Computational Geometry, 48(3):499– 517, 2012

work page 2012
[10]

Koll´ ar, Sharp effective Nullstellensatz,Journal of the American Mathematical Society, 1(4):963– 975, 1988

J. Koll´ ar, Sharp effective Nullstellensatz,Journal of the American Mathematical Society, 1(4):963– 975, 1988

work page 1988
[11]

H. N. Mojarrad, T. Pham, C. Valculescu, and F. de Zeeuw, Schwartz–Zippel bounds for two- dimensional products,Discrete Analysis, 2017:20, 1–20, 2017

work page 2017
[12]

Pach and M

J. Pach and M. Sharir, On the number of incidences between points and curves,Combinatorics, Probability and Computing, 7(1):121–127, 1998

work page 1998
[13]

O. E. Raz, M. Sharir, and F. de Zeeuw, Polynomials vanishing on Cartesian products: The Elekes– Szab´ o theorem revisited,Duke Mathematical Journal, 165(18):3517–3566, 2016

work page 2016
[14]

Sharir and N

M. Sharir and N. Solomon, Incidences between points and lines inR 4,Discrete & Computational Geometry, 57(3):702–756, 2017

work page 2017
[15]

Sharir and J

M. Sharir and J. Zahl, Cutting algebraic curves into pseudo-segments and applications,Journal of Combinatorial Theory, Series A, 150:1–35, 2017

work page 2017
[16]

Solymosi and T

J. Solymosi and T. Tao, An incidence theorem in higher dimensions,Discrete & Computational Geometry, 48(2):255–280, 2012

work page 2012
[17]

Solymosi and F

J. Solymosi and F. de Zeeuw, Incidence bounds for complex algebraic curves on Cartesian products, inNew Trends in Intuitive Geometry, Bolyai Society Mathematical Studies, vol. 27, Springer, Berlin, 2018, pp. 385–405

work page 2018
[18]

Sombra, A sparse effective nullstellensatz, inAdvances in Applied Mathematics, 22 (2): 271–295, 1999

M. Sombra, A sparse effective nullstellensatz, inAdvances in Applied Mathematics, 22 (2): 271–295, 1999

work page 1999
[19]

Tao and V

T. Tao and V. Vu,Additive Combinatorics, Cambridge University Press, Cambridge, 2006

work page 2006
[20]

Zahl, An improved bound on the number of point-surface incidences in three dimensions,Contri- butions to Discrete Mathematics, 8(1):100–121, 2013

J. Zahl, An improved bound on the number of point-surface incidences in three dimensions,Contri- butions to Discrete Mathematics, 8(1):100–121, 2013. Department of Mathematics, National Taiwan University, Taiwan Email address:cyshen@math.ntu.edu.tw Department of Mathematics, University of Oslo, Norway Email address:tuyentt@math.uio.no Department of Mathem...

work page 2013

[1] [1]

Barakat and M

M. Barakat and M. Lange-Hegermann, An algorithmic approach to Chevalley’s theorem on images of rational morphisms between affine varieties,Mathematics of Computation, 91(333):451–490, 2021

work page 2021

[2] [2]

W. D. Brownawell, Bounds for the degrees in the Nullstellensatz,Annals of Mathematics, 126(3):577– 591, 1987

work page 1987

[3] [3]

Bukh and J

B. Bukh and J. Tsimerman, Sum-product estimates for rational functions,Proceedings of the London Mathematical Society, 104(1):1–26, 2012

work page 2012

[4] [4]

D. Cox, J. Little, and D. O’Shea,Ideals, Varieties, and Algorithms: An Introduction to Computa- tional Algebraic Geometry and Commutative Algebra, Springer, New York, 4th edition, 2015

work page 2015

[5] [5]

Eisenbud,Commutative Algebra with a View Toward Algebraic Geometry, Springer, New York, 1995

D. Eisenbud,Commutative Algebra with a View Toward Algebraic Geometry, Springer, New York, 1995

work page 1995

[6] [6]

Elekes and L

G. Elekes and L. R´ onyai, A combinatorial problem on polynomials and rational functions,Journal of Combinatorial Theory, Series A, 89(1):1–20, 2000. 38 SHEN, TRUONG, AND YU

work page 2000

[7] [7]

Guth and N

L. Guth and N. H. Katz, On the Erd˝ os distinct distances problem in the plane,Annals of Mathe- matics, 181(1):155–190, 2015

work page 2015

[8] [8]

Hartshorne,Algebraic Geometry, Springer, New York, 1977

R. Hartshorne,Algebraic Geometry, Springer, New York, 1977

work page 1977

[9] [9]

Kaplan, J

H. Kaplan, J. Matouˇ sek, and M. Sharir, Simple proofs of classical theorems in discrete geometry via the Guth–Katz polynomial partitioning technique,Discrete & Computational Geometry, 48(3):499– 517, 2012

work page 2012

[10] [10]

Koll´ ar, Sharp effective Nullstellensatz,Journal of the American Mathematical Society, 1(4):963– 975, 1988

J. Koll´ ar, Sharp effective Nullstellensatz,Journal of the American Mathematical Society, 1(4):963– 975, 1988

work page 1988

[11] [11]

H. N. Mojarrad, T. Pham, C. Valculescu, and F. de Zeeuw, Schwartz–Zippel bounds for two- dimensional products,Discrete Analysis, 2017:20, 1–20, 2017

work page 2017

[12] [12]

Pach and M

J. Pach and M. Sharir, On the number of incidences between points and curves,Combinatorics, Probability and Computing, 7(1):121–127, 1998

work page 1998

[13] [13]

O. E. Raz, M. Sharir, and F. de Zeeuw, Polynomials vanishing on Cartesian products: The Elekes– Szab´ o theorem revisited,Duke Mathematical Journal, 165(18):3517–3566, 2016

work page 2016

[14] [14]

Sharir and N

M. Sharir and N. Solomon, Incidences between points and lines inR 4,Discrete & Computational Geometry, 57(3):702–756, 2017

work page 2017

[15] [15]

Sharir and J

M. Sharir and J. Zahl, Cutting algebraic curves into pseudo-segments and applications,Journal of Combinatorial Theory, Series A, 150:1–35, 2017

work page 2017

[16] [16]

Solymosi and T

J. Solymosi and T. Tao, An incidence theorem in higher dimensions,Discrete & Computational Geometry, 48(2):255–280, 2012

work page 2012

[17] [17]

Solymosi and F

J. Solymosi and F. de Zeeuw, Incidence bounds for complex algebraic curves on Cartesian products, inNew Trends in Intuitive Geometry, Bolyai Society Mathematical Studies, vol. 27, Springer, Berlin, 2018, pp. 385–405

work page 2018

[18] [18]

Sombra, A sparse effective nullstellensatz, inAdvances in Applied Mathematics, 22 (2): 271–295, 1999

M. Sombra, A sparse effective nullstellensatz, inAdvances in Applied Mathematics, 22 (2): 271–295, 1999

work page 1999

[19] [19]

Tao and V

T. Tao and V. Vu,Additive Combinatorics, Cambridge University Press, Cambridge, 2006

work page 2006

[20] [20]

Zahl, An improved bound on the number of point-surface incidences in three dimensions,Contri- butions to Discrete Mathematics, 8(1):100–121, 2013

J. Zahl, An improved bound on the number of point-surface incidences in three dimensions,Contri- butions to Discrete Mathematics, 8(1):100–121, 2013. Department of Mathematics, National Taiwan University, Taiwan Email address:cyshen@math.ntu.edu.tw Department of Mathematics, University of Oslo, Norway Email address:tuyentt@math.uio.no Department of Mathem...

work page 2013