Finite rank kernel varieties: A variant of Hilbert's Nullstellensatz for graphons and applications to Hadamard matrices

Madelyn Andersen

REVIEW 1 major objections 1 minor 2 references

Finite rank kernel varieties: A variant of Hilbert's Nullstellensatz for graphons and applications to Hadamard matrices

T0 review · 1 major / 1 minor · reviewed 2026-05-24 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Finite-rank graphons turn homomorphism density conditions into polynomial equations that obey a weaker Nullstellensatz.

desk verdict The paper builds a polynomial representation for finite-rank graphons that lets a weak Nullstellensatz apply to homomorphism-density zero sets, but the epimorphism step lacks visible verification that it preserves ideal structure. read the letter →

arxiv 2112.03885 v3 pith:H7G7OVJ4 submitted 2021-12-07 math.AG math.CO

Madelyn Andersen This is my paper

classification math.AGmath.CO

keywords graphonsquantumgraphshomomorphismdensityHilbert'sNullstellensatzkernelvarietiesZariskitopologyfiniterankalgebraicgeometry

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper establishes that graphons of finite rank admit a polynomial representation under which sets defined by vanishing homomorphism densities behave like algebraic varieties. An epimorphism from quantum graphs to a permutation-invariant subring of the complex polynomial ring converts these density conditions into polynomial equations. For finite-rank cases the resulting zero sets are closed in the Zariski topology and satisfy a weaker form of Hilbert's Nullstellensatz. This creates explicit links between graphon theory and algebraic geometry that allow algebraic tools to address questions about graphons.

What carries the argument

The epimorphism from quantum graphs to the permutation-invariant subring of the complex polynomial ring, which converts homomorphism-density vanishing conditions into polynomial equations for finite-rank graphons.

What would settle it

A concrete finite-rank graphon together with a quantum graph g such that the set of graphons W satisfying t(g,W)=0 fails to be Zariski closed would falsify the claim.

Watch

Extended reading notes

Core claim

Using a polynomial representation of graphs, the authors construct an epimorphism from the space of quantum graphs to a permutation-invariant subring of the complex polynomial ring. When graphons have finite rank, the analog of the ideal inverse in algebraic geometry becomes an ideal in this representation. Algebraic kernel sets defined via kernel varieties are therefore closed under the Zariski topology, and a weaker version of Hilbert's Nullstellensatz applies directly to kernel zero-sets with respect to homomorphism density.

Load-bearing premise

The epimorphism from the space of quantum graphs to the permutation-invariant subring preserves the algebraic structure needed for finite-rank kernel zero-sets to correspond to ideals.

Editorial extensions

If this is right

Algebraic kernel sets are closed under the Zariski topology.
A weaker version of Hilbert's Nullstellensatz applies to kernel zero-sets with respect to homomorphism density.
Finite-rank kernels produce several direct ties between algebraic geometry and graphon theory.
The polynomial representation supports applications involving Hadamard matrices.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The same mapping could be used to test whether specific homomorphism-density conditions define varieties for concrete finite-rank examples.
If the weaker Nullstellensatz yields effective ideal membership tests, it may decide certain extremal questions about graphons algebraically.
The framework suggests examining whether known sequences of finite-rank graphons arising from Hadamard matrices produce new algebraic identities.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Desk Editor's Note

read the letter

The main point is that this paper gives a polynomial model for quantum graphs and shows that, when the graphon has finite rank, the zero sets defined by t(g, W) = 0 behave like algebraic varieties under a weaker Nullstellensatz. They construct an epimorphism from the space of quantum graphs onto a permutation-invariant subring of C[x_ij] and then argue that the kernel varieties are Zariski closed in this setting. That is the concrete new piece: a direct algebraic-geometry translation that works inside the finite-rank case. The setup is clean enough that it could be useful for importing tools into graphon problems or for combinatorial constructions that stay within finite rank. The title flags applications to Hadamard matrices, which fits the finite-rank focus. The paper does a reasonable job spelling out the representation and the resulting ties to algebraic geometry without overclaiming the scope. The soft spot is exactly the one the stress-test note flags. The abstract states that the epimorphism turns the analog of the ideal inverse into an actual ideal and that the zero loci match, but it supplies no explicit check that the map respects multiplication or that vanishing of t(g, W) implies membership in the generated ideal. Without that intertwining, the variety correspondence does not follow. Since only the abstract is in view here, the derivations cannot be inspected, so the central claim remains unverified on the page. The Hadamard-matrix part is also not developed in the abstract, so that claim sits on thin evidence for now. This is for readers already working at the graphon-algebraic geometry boundary or combinatorialists who want to test whether finite-rank restrictions let AG methods produce new examples. A serious referee should see it because the claims are specific and the finite-rank restriction makes them checkable; the work is coherent on its own terms even if the key compatibility step needs more detail.

Referee Report

1 major / 1 minor

Summary. The paper constructs an epimorphism from the space of quantum graphs to a permutation-invariant subring of the complex polynomial ring ℂ[x_ij]. For finite-rank graphons it claims that kernel zero-sets defined by vanishing homomorphism densities t(g, W) = 0 correspond to ideals in this representation, that these sets are Zariski-closed, and that a weaker form of Hilbert's Nullstellensatz holds for them; connections to algebraic geometry are explored and applications to Hadamard matrices are indicated.

Significance. If the epimorphism intertwines the homomorphism-density evaluation with the polynomial ideal structure for finite-rank kernels, the work would supply an algebraic-geometry toolkit for studying graphon varieties in the finite-rank case, potentially allowing Zariski topology and ideal-theoretic methods to be applied directly to homomorphism-density problems.

major comments (1)

[Abstract] Abstract, paragraph on the polynomial representation: the claim that the epimorphism φ maps the kernel of t(·,W) for finite-rank W onto an ideal I ⊂ R with V(I) recovering the zero loci is load-bearing for the weaker Nullstellensatz, yet the abstract supplies no verification that φ(t(g,W)) = 0 implies membership in the generated ideal or that the Zariski-closed sets coincide with the homomorphism-density loci once measurable functions are replaced by finite-rank polynomial representatives.

minor comments (1)

[Abstract] The sentence 'A graphon variety is the a set of all graphons' contains a repeated article.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their comments. We address the single major comment below.

read point-by-point responses

Referee: [Abstract] Abstract, paragraph on the polynomial representation: the claim that the epimorphism φ maps the kernel of t(·,W) for finite-rank W onto an ideal I ⊂ R with V(I) recovering the zero loci is load-bearing for the weaker Nullstellensatz, yet the abstract supplies no verification that φ(t(g,W)) = 0 implies membership in the generated ideal or that the Zariski-closed sets coincide with the homomorphism-density loci once measurable functions are replaced by finite-rank polynomial representatives.

Authors: The abstract is a high-level summary and does not contain proofs. The epimorphism φ from quantum graphs to the permutation-invariant polynomial subring is constructed in Section 2. For finite-rank graphons, the fact that φ maps the kernel of t(·,W) onto an ideal I, together with the identification of the homomorphism-density zero loci with the Zariski variety V(I), is proved in Theorems 3.5 and 4.2; the weaker Nullstellensatz is Corollary 4.7. We will revise the abstract to include explicit references to these results. revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: claims rest on explicit construction and demonstration without reduction to inputs

full rationale

The abstract describes a method of representing graphs as polynomials to construct an epimorphism, followed by a demonstration that finite-rank kernel zero-sets correspond to ideals in the polynomial representation, enabling a weaker Nullstellensatz. No equations, self-citations, or fitted parameters are visible that would make any prediction or result equivalent to its inputs by construction. The derivation chain as stated is self-contained and does not exhibit any of the enumerated circular patterns.

Assumptions & free parameters 0 free parameters · 2 assumptions · 0 invented entities

The abstract invokes standard definitions of graphons, homomorphism densities, and quantum graphs without introducing new free parameters or invented entities visible at this level of detail.

assumptions (2)

domain assumption Graphons are symmetric measurable functions arising from sequences of graphs
Standard background assumption in graphon theory stated in the first sentence of the abstract.
domain assumption Homomorphism density t(g, W) is well-defined for quantum graphs g and graphons W
Implicit in the definition of graphon varieties in the abstract.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Finite rank kernel varieties: A variant of Hilbert's Nullstellensatz for graphons and applications to Hadamard matrices." pith.science (2026). https://pith.science/paper/H7G7OVJ4

@misc{pith2026211203885,
  author       = {Pith},
  title        = {Pith review of: Finite rank kernel varieties: A variant of Hilbert's Nullstellensatz for graphons and applications to Hadamard matrices},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/H7G7OVJ4}},
  note         = {Machine review of arXiv:2112.03885}
}

abstract

Graphons are symmetric measurable functions that arise from a sequence of graphs. A graphon variety is the a set of all graphons defined by a condition of the form $t(g, W) = 0$ for a fixed quantum graph $g$, where $t(.,.)$ is the homomorphism density and a quantum graph is a formal linear combination of multigraphs. Using a method of representing graphs as polynomials, we construct an epimorphism from the space of quantum graphs to a subring of the complex polynomial ring that is invariant under permutations of variables. When graphons are of finite rank, we demonstrate that an analog of the "ideal" inverse in Algebraic Geometry is an ideal in our polynomial representation. Defining an algebraic kernel set using kernel varieties, we demonstrate that we can call such sets closed under the Zariski Topology. We determine several ties to Algebraic Geometry as a result of utilizing finite rank kernels and discover that a weaker version of Hilbert's Nullstellensatz applies to kernel zero-sets with respect to homomorphism density. Throughout, we examine the connection between Algebraic Geometry and Graphon Theory.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

2 extracted references · 2 canonical work pages

[1]

(1990).Abstract and concrete cate- gories: The joy of cats

Ad´ amek, J., Herrlich, H., & Strecker, G. (1990).Abstract and concrete cate- gories: The joy of cats . Wiley. https://books.google.com/books?id= KwTvAAAAMAAJ Athreya, S., den Hollander, F., & R¨ ollin, A. (2019). Graphon-valued stochas- tic processes from population genetics. Aurell, A., Carmona, R., & Lauriere, M. (2021). Stochastic graphon games: Ii. t...

work page doi:10.1016/j.aim.2008.07.008 1990
[2]

Ferber, A., Jain, V., & Zhao, Y. (2018). On the number of hadamard matrices via anti-concentration. Gao, S., Caines, P. E., & Huang, M. (2021). Lqg graphon mean ﬁeld games: Analysis via graphon invariant subspaces. Gao, S., Tchuendom, R. F., & Caines, P. E. (2021). Linear quadratic graphon ﬁeld games. Communications in Information and Systems , 21 (3), 34...

work page doi:10.4310/cis.2021.v21.n3.a2 2018

Pith tools

Reviewed May 24, 2026 · model on record in the stance chip above.

[1] [1]

(1990).Abstract and concrete cate- gories: The joy of cats

Ad´ amek, J., Herrlich, H., & Strecker, G. (1990).Abstract and concrete cate- gories: The joy of cats . Wiley. https://books.google.com/books?id= KwTvAAAAMAAJ Athreya, S., den Hollander, F., & R¨ ollin, A. (2019). Graphon-valued stochas- tic processes from population genetics. Aurell, A., Carmona, R., & Lauriere, M. (2021). Stochastic graphon games: Ii. t...

work page doi:10.1016/j.aim.2008.07.008 1990

[2] [2]

Ferber, A., Jain, V., & Zhao, Y. (2018). On the number of hadamard matrices via anti-concentration. Gao, S., Caines, P. E., & Huang, M. (2021). Lqg graphon mean ﬁeld games: Analysis via graphon invariant subspaces. Gao, S., Tchuendom, R. F., & Caines, P. E. (2021). Linear quadratic graphon ﬁeld games. Communications in Information and Systems , 21 (3), 34...

work page doi:10.4310/cis.2021.v21.n3.a2 2018