Multigraded Shifts of Matroidal Ideals

Shamila Bayati

Multigraded Shifts of Matroidal Ideals

T0 review · 0 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

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

Pith's one-line read This paper proves that if I is a matroidal ideal, then the ideal generated by its i-th multigraded shifts is matroidal for every i up to the projective dimension.

desk verdict Correct and useful short paper; the main theorem is new in the cited literature and the proof holds up after fixing a few typos and spelling out Lemma 1.1. read the letter →

arxiv 1908.02109 v1 pith:CJILWIGS submitted 2019-08-06 math.AC math.CO

Shamila Bayati This is my paper · ORCID

classification math.ACmath.CO MSC 13D0213A0205B3505E40

keywords adjacencyidealfreeresolutionslinearquotientsmatroidbasisgraphsmatroidalidealsmultigradedshiftsmonomialmatroids

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

A matroidal ideal is a squarefree monomial ideal whose generator supports form the bases of a matroid. The paper establishes that the ideal $J_{\ell}(I)$ generated by the $\ell$-th multigraded shifts of a matroidal ideal $I$ is again matroidal, for every $\ell$ from $0$ up to the projective dimension of $I$. This matters because multigraded shifts are the monomials indexing the modules in the minimal multigraded free resolution; the result means every syzygy layer of a matroidal ideal is itself governed by a matroid. The route is combinatorial: the first shift ideal is the adjacency ideal of the generator graph, an adjacency ideal of a matroidal ideal is matroidal, and the higher shift ideals are iterated adjacency ideals.

What carries the argument

The central object is the adjacency ideal $A(I)$ of a monomial ideal generated in a single degree: build the graph whose vertices are the minimal generators, joining two when the corresponding bases differ by one pivot step, and let $A(I)$ be generated by the least common multiples of adjacent pairs. When $I$ is matroidal this graph is the matroid basis graph, and the proof operates through basis exchange. Lemma 1.1 is the load-bearing pivot fact: two bases $B_1,B_2$ at distance two with $B_2 = B_1 - (e_1+e_2) + (f_1+f_2)$ have at least two common neighbours whose pivot patterns swap in the required way. Lemma 2.1 uses this to verify the matroid exchange property for $A(I)$, and Theorem 2.2 applies the same verification to iterated adjacency ideals.

What would settle it

Enumerate all matroids on up to six elements; for each matroidal ideal $I$, compute the first shift ideal $J_1(I)$ and check whether its minimal generators satisfy the matroid basis-exchange property, and also test Lemma 1.1 directly on every pair of bases at distance two. A single matroid whose distance-two bases lack the required common neighbours, or a single matroidal ideal whose first multigraded shift ideal is not matroidal, would disprove Theorem 2.2.

Watch

Extended reading notes

Core claim

The central claim is Theorem 2.2: if $I \subseteq k[x_1,\ldots,x_n]$ is a matroidal ideal, then the ideal $J_{\ell}(I)$ generated by the set of $\ell$-th multigraded shifts of $I$ is also a matroidal ideal for every $\ell = 0, \ldots, d$, where $d$ is the projective dimension of $I$. The proof first shows that the adjacency ideal $A(I)$, generated by the least common multiples of pairs of generators at distance one in the basis graph, is matroidal (Lemma 2.1). Theorem 2.2 then uses induction and a common-neighbour fact for matroid basis graphs to show that $J_{\ell}(I)$ is the $\ell$-fold iterated adjacency ideal of $I$ (Corollary 2.3), so every one of these shift ideals is matroidal.

Load-bearing premise

The proof depends on the assertion in Lemma 1.1, cited rather than proved, that two bases of a matroid which differ by exchanging two elements always have two neighbouring bases with the pivot pattern described there; if that geometric fact about matroid basis graphs failed, the exchange argument showing that adjacency ideals are matroidal would have a gap.

Editorial extensions

If this is right

For every $\ell$, the generators of $J_{\ell}(I)$ are the bases of a matroid, so the $\ell$-th module of the minimal multigraded resolution of a matroidal ideal is indexed by a matroid.
$J_{\ell}(I)$ is the $\ell$-fold iterated adjacency ideal of $I$; the multigraded shifts can therefore be computed from the basis graph by repeated least-common-multiple operations, without building the full free resolution.
Every $J_{\ell}(I)$ inherits the defining properties of matroidal ideals: it is squarefree, generated in a single degree, and has linear quotients.
Because each shift ideal is matroidal, the same mapping-cone description of minimal resolutions applies recursively to $J_1(I), J_2(I), \ldots$, so the combinatorial structure of the resolution propagates through all syzygy levels.

Reading between the lines

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

A natural next step is to determine whether the full multigraded resolution, including its differentials, can be reconstructed from the matroid basis graph alone; the paper establishes only that each shift family is matroidal, not the boundary maps.
The motivating non-squarefree case of polymatroidal ideals is left open; testing the same adjacency iteration on small polymatroidal examples would show whether an analogue of Lemma 2.1 holds when generators are not squarefree.
Because iterated adjacency ideals of a matroidal ideal are again matroidal, this gives a method for generating chains of matroidal ideals with controlled resolutions, which could be used to search for matroidal ideals with prescribed Betti numbers.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Desk Editor's Note

read the letter

Short answer: the paper is correct and worth engaging with. The main theorem—multigraded shifts of a matroidal ideal are again matroidal—is new in the cited literature, and the proof introduces a genuinely useful device: the adjacency ideal, which characterizes J_l as the l-fold iterated adjacency ideal. That is a cleaner way to see the structure than what the earlier literature offers.

The argument is mostly explicit and checkable. Lemma 2.1 (the adjacency ideal of a matroidal ideal is matroidal) is the technical core, and the exchange proof works. Theorem 2.2 then runs by induction, showing J_{k+1} = A(J_k) for k ≥ 1. The second inclusion is the delicate part, and it holds up; the case analysis with the basis graph and the symmetric exchange property is sound.

The soft spots are minor. Lemma 1.1 is stated without proof; the paper says it is clear from a Maurer lemma or the symmetric exchange property, which is true—one line with the symmetric exchange gives the two common neighbors—but it should be written out, since later arguments lean on it. There are also two typos: in Lemma 2.1, “d(B,B2)=2” should be “d(B1,B')”, and at the end of Theorem 2.2, the conclusion should be “e_i ∈ set(B')”, not “set(Bi)”. These do not affect correctness but should be fixed. The only real limitation is the novelty check: the author cites only ten references, so if a polymatroidal version of this closure theorem exists elsewhere, the priority claim would need revision. From the manuscript alone, the result is new.

This is a short, focused paper for people working on matroidal or polymatroidal ideals and their Betti numbers. It deserves a serious referee and, with small revisions, publication. Send it to review.

Referee Report

0 major / 5 minor

Summary. The paper proves that if I is a matroidal ideal in a polynomial ring, then the ideal J_l(I) generated by the l-th multigraded shifts of I is again matroidal for every l = 0, ..., proj dim(I). The proof identifies J_l(I) with the l-fold iterated adjacency ideal of I, using the mapping-cone description of minimal free resolutions for ideals with linear quotients. The central technical step is Lemma 2.1, which shows that the adjacency ideal of a matroidal ideal is matroidal; this is proved by explicit exchange arguments in the underlying matroid. Theorem 2.2 then establishes the main statement by induction, and Corollary 2.3 records the iterated-adjacency description.

Significance. If the result holds, it gives a clean structural statement: every syzygy module of a matroidal ideal is represented by a matroid, and the multigraded shifts are obtained by iterating a simple combinatorial operation. The proof is elementary and largely self-contained, relying only on standard matroid exchange properties and the known linear-quotients structure of matroidal ideals. The main theorem is new and should be of interest to researchers in commutative algebra and combinatorial matroid theory. I read the argument in good faith and found no load-bearing defect: the unproved Lemma 1.1 is indeed a one-line consequence of the symmetric exchange property stated in Section 1.2, and the exchange arguments in Lemma 2.1 and Theorem 2.2 are consistent.

minor comments (5)

[§2, proof of Lemma 2.1] The sentence 'Therefore, d(B, B2) = 2' should read 'd(B1, B′) = 2'; the vertex B2 is introduced only in the next sentence, and the distance-two statement concerns B1 and B′.
[§2, proof of Theorem 2.2] In the final line of the proof, 'we have e_i ∈ set(B_i)' should be 'e_i ∈ set(B′)', since the goal in that paragraph is to show that each e_i lies in set(B′) in order to conclude U∪V = B′ + b + e1 + ... + ek ∈ J_{k+1}.
[§2, proof of Lemma 2.1] The handling of the case b = e is implicit: the proof says to proceed with the other presentation B′+e′, but the subsequent argument still uses the letters B and e as if the renamed presentation had been made explicit. It would improve clarity to state explicitly that after replacing (B,e) by (B′,e′) one may assume b ≠ e and then continue with the renamed basis.
[§1.2, Lemma 1.1] Lemma 1.1 is stated without proof and is used in both central proofs. Since it is a short consequence of the symmetric exchange property, a one-sentence proof should be added; for example, applying the symmetric exchange property to B1 and B2 with b1 = e1 yields f such that B1 - e1 + f and B2 - f + e1 are bases, which gives the two common neighbors with the claimed pivot pattern.
[Throughout] The manuscript contains numerous typographical errors and misspellings, for example 'mutligraded', 'combinatoric s', 'c onsider', 'theo ry', and 'materiel'. A careful proofreading pass is needed before publication.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the matroidality of multigraded shifts is proved from exchange axioms and an independent mapping-cone description, with no fitted inputs or self-citations carrying the argument.

full rationale

The paper's central claim, Theorem 2.2, is that if I is matroidal then J_l(I) is matroidal for all l up to proj dim(I). The proof is an induction: J_0(I)=I is matroidal by definition; Lemma 2.1 shows the adjacency ideal A(I) is matroidal using only the matroid exchange property and the symmetric exchange property; Theorem 2.2 then shows J_{k+1}(I) equals the adjacency ideal of J_k(I). The equality J_{k+1}(I)=A(J_k(I)) is not assumed as an input; it is argued directly from the mapping-cone description of minimal multigraded resolutions quoted from Herzog and Takayama, an independent external result. There is no fitted parameter, no quantity is defined in terms of the target conclusion, and no load-bearing citation is to the author's own prior work. The only step stated without a full proof is Lemma 1.1, which the paper attributes to Maurer's matroid basis graph lemma or to the symmetric exchange property; even if that lemma were considered insufficiently justified, that would be a correctness or exposition gap, not circularity, because the lemma is independent of the theorem being proved. Consequently the derivation chain is self-contained with respect to the matroid axioms and an external resolution construction, and no circularity is present.

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

The paper introduces no empirical free parameters and no new objects beyond the defined adjacency ideal, which is part of the proof machinery rather than an unexplained postulate. The proof relies on standard matroid facts, the mapping-cone description of resolutions, and linear-quotients results from the cited literature.

assumptions (4)

standard math The minimal multigraded resolution of an ideal with linear quotients has bases m·x^a indexed by m in G(I) and squarefree x^a with support a subset of set(m) of size i.
Invoked in Section 2 before Lemma 2.1 as [4, Lemma 1.5] to identify J_l(I) with unions B + e1 + ... + e_l; this is the bridge from Betti shifts to matroid bases.
standard math Matroidal ideals have linear quotients with respect to lexicographic order of generators with x1 > ... > xn.
Cited as [7, Theorem 1.3] and used so that set(B) is well-defined and so J_1(I) equals the adjacency ideal A(I).
standard math The symmetric exchange property of matroid bases and the connectedness and common-neighbor properties of matroid basis graphs, in particular Lemma 1.1.
Used throughout Lemma 2.1 and Theorem 2.2; Lemma 1.1 is stated without proof and cited to [6, Lemma 1.4] or the symmetric exchange property.
domain assumption For squarefree monomials of the same degree, the lexicographic order gives a total order on bases, and set(B) consists of elements outside B.
Used in the proof of Theorem 2.2 to conclude v ∈ set(B) from B - t + v ∈ B and v >lex t, and to work with unions B + e_i. This follows from the structure of colon ideals for squarefree monomial ideals.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Multigraded Shifts of Matroidal Ideals." pith.science (2026). https://pith.science/paper/CJILWIGS

@misc{pith2026190802109,
  author       = {Pith},
  title        = {Pith review of: Multigraded Shifts of Matroidal Ideals},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CJILWIGS}},
  note         = {Machine review of arXiv:1908.02109}
}

abstract

In this paper, we show that if $I$ is a matroidal ideal, then the ideal generated by the $i$-th multigraded shifts is also a matroidal ideal for every $i=0,\ldots,\text{pd}(I)$.

Figures

Figures reproduced from arXiv: 1908.02109 by the authors.

**Figure 1.** If b 6= e ′ , then B′ = B1 − (e ′ + c) + (e + b). Therefore, d(B, B2) = 2 because {e ′ , c} and {e, b} are disjoint sets of cardinality two. So by Lemma 1.1, there exist a common neighbor B2 of B1 and B′ by e pivoted in, namely B2 = B1 − e ′ + e or B2 = B1 − c + e. In any case B + e − b + c = B1 ∪ B2 ∈ A(I), as desired. Considering the lexicographical order with respect to x1 > · · · > xn on the squarefree monomial… view at source ↗

**Figure 2.** be two elements of Jk(I) with B, C ∈ B, e1, . . . , ek ∈ set(B), and f1, . . . , fk ∈ set(C). Suppose that d(U, V ) = 1, that is, they are adjacent vertices in the basis graph of Jk(I). We show that U ∪V , corresponding to the monomial lcm(xU , xV ), is indeed a union of an element of D ∈ B and a subset of cardinality k + 1 of set(D), so belongs to Jk+1(I). We have d(U, V ) = 1. Therefore, V = C + f1 + · · · + fk ha… view at source ↗

**Figure 3.** neighbor B′−v+ei in B for which ei pivoted in. On the other hand, ei >lex ti >lex v. Hence also in this case, we have ei ∈ set(Bi). By the argument applied in proof of Theorem 2.2, we have the following result. Corollary 2.3. Let I be a matroidal ideal. Then Jℓ(I) is obtained by taking ℓ times iterated adjacency ideals starting from I. References [1] H. Chiang-Hsieh, Some arithmetic properties of matroidal ideals, C… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

10 extracted references · 10 canonical work pages

[1]

Chiang-Hsieh, Some arithmetic properties of matroidal ideals , Commun

H. Chiang-Hsieh, Some arithmetic properties of matroidal ideals , Commun. Algebra 38(2010), Iss. 3, 944-952

work page 2010
[2]

Conca, J

A. Conca, J. Herzog, Castelnuovo-Mumford regularity of products of ideals , Collect. Math. 54 (2003) 137-152

work page 2003
[3]

Herzog, T

J. Herzog, T. Hibi, Monomial ideals ,. Graduate Texts in Mathematics, 260. Springer-Verlag London, Ltd., London, 2011

work page 2011
[4]

Herzog, Y

J. Herzog, Y. Takayama, Resolutions by mapping cones , The Roos Festschrift volume 4, Ho- mology, Homotopy and Applications, (2002), no. 2, part 2, 277–29 4

work page 2002
[5]

Johnsen, J

T. Johnsen, J. Roksvold, H. Verdure, Betti numbers associated to the facet ideal of a matroid , Bull Braz Math Soc, New Series 45 (2014), Iss. 4, 727-744

work page 2014
[6]

Maurer, Matroid base graphs

S.B. Maurer, Matroid base graphs. I, J. Combinatorial Theory (B), 14 (1973), 216–240

work page 1973
[7]

Mohammadi, S

F. Mohammadi, S. Moradi, Weakly polymatroidal ideals with applications to vertex co ver ideals, Osaka J. Math. 47 (2010), no. 3, 627-636

work page 2010
[8]

Novik, A

I. Novik, A. Postnikov, B. Sturmfels, Syzygies of oriented matroids , Duke Math. J., 111 (2002), no. 2, 287-317

work page 2002

Show all 10 references

[9]

J. G. Oxley; Matroid Theory, Oxford University Press, PSA, 2006

2006
[10]

A. B. Tchernev, Representations of matroids and free resolutions for multi graded modules , Advances in Math. 208 (2007), Iss. 1, 75–134. F aculty of Mathematics and Computer Science, Amirkabir Uni versity of Tech- nology (Tehran Polytechnic), Tehran 15914, Iran School of Math...

2007

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [1]

Chiang-Hsieh, Some arithmetic properties of matroidal ideals , Commun

H. Chiang-Hsieh, Some arithmetic properties of matroidal ideals , Commun. Algebra 38(2010), Iss. 3, 944-952

work page 2010

[2] [2]

Conca, J

A. Conca, J. Herzog, Castelnuovo-Mumford regularity of products of ideals , Collect. Math. 54 (2003) 137-152

work page 2003

[3] [3]

Herzog, T

J. Herzog, T. Hibi, Monomial ideals ,. Graduate Texts in Mathematics, 260. Springer-Verlag London, Ltd., London, 2011

work page 2011

[4] [4]

Herzog, Y

J. Herzog, Y. Takayama, Resolutions by mapping cones , The Roos Festschrift volume 4, Ho- mology, Homotopy and Applications, (2002), no. 2, part 2, 277–29 4

work page 2002

[5] [5]

Johnsen, J

T. Johnsen, J. Roksvold, H. Verdure, Betti numbers associated to the facet ideal of a matroid , Bull Braz Math Soc, New Series 45 (2014), Iss. 4, 727-744

work page 2014

[6] [6]

Maurer, Matroid base graphs

S.B. Maurer, Matroid base graphs. I, J. Combinatorial Theory (B), 14 (1973), 216–240

work page 1973

[7] [7]

Mohammadi, S

F. Mohammadi, S. Moradi, Weakly polymatroidal ideals with applications to vertex co ver ideals, Osaka J. Math. 47 (2010), no. 3, 627-636

work page 2010

[8] [8]

Novik, A

I. Novik, A. Postnikov, B. Sturmfels, Syzygies of oriented matroids , Duke Math. J., 111 (2002), no. 2, 287-317

work page 2002