Pith. sign in

REVIEW 1 major objections 3 minor 14 references

Matroid correspondence

T0 review · 1 major / 3 minor · reviewed 2026-08-02 · deepseek-v4-flash

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

Pith's one-line read The paper introduces matroid correspondences—a single functorial construction that produces deletion, contraction, free extension, truncation, intersection, union, and pullback—and shows they preserve representability and match Lorentzian o

desk verdict Fresh organizing framework for matroid/polymatroid operations; the matroid half is solid, but the polymatroid contraction theorem (6.4(4)) has a typo that swaps contraction for deletion. read the letter →

arxiv 2607.13783 v1 pith:WFH56EK6 submitted 2026-07-15 math.CO math.ACmath.AG

Colin Crowley , Changxin Ding , Haoxi Hu , Arvind Kumar , Jonathan Montaño , Thai Thanh Nguyen , Anna Shapiro , Noah Solomon
show 2 more authors
Botong Wang Juliet Whidden
This is my paper · ORCID
classification math.COmath.ACmath.AG MSC 05B3552B40
keywords matroidcorrespondencespolymatroidsquotientsLorentzianpolynomialsalgebraicrepresentabilityalgebraicitymultisymmetriclift
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

This paper introduces a matroid correspondence: a matroid $C$ on the disjoint union of two ground sets determines a functor $C^*$ that sends each matroid $M$ on the first ground set to the matroid $((M \oplus B) \cap C) \setminus E_1$ on the second. The authors show that this single construction realizes deletion, contraction, free extension, truncation, intersection, union, pullback, and constant maps as special cases, and that it preserves representability and algebraicity when $C$ does. The same mechanism works for polymatroids, commuting with multisymmetric lifts. For a linear operator with Lorentzian symbol and nonzero image, the support of the operator's output equals the polymatroid correspondence of the input's support. The picture gives a uniform combinatorial analogue of algebraic correspondences, with the caveat that zero-image operators produce a correspondence of larger-than-expected rank.

What carries the argument

The matroid correspondence $C^*$ (Definition 1.1): direct-sum the input matroid with a boolean matroid, intersect with the correspondence matroid $C$, then delete the input ground set. The poset-category structure—where morphisms are matroid quotients, meaning every flat of the target is a flat of the source—and the composition formula (Proposition 2.6) carry the functoriality and make the construction a combinatorial analogue of the product of algebraic correspondences.

What would settle it

Run the basis computation for the zero linear operator: the correspondence $C^*(P)$ will be nonempty while the operator's image is empty, exhibiting the rank discrepancy the paper itself flags. Separately, try to find a matroid quotient $M \twoheadrightarrow N$ and a matroid $C$ such that $C^*(M)$ is not a quotient of $C^*(N)$; Proposition 2.3 rules this out, so any such example would refute the functoriality claim.

Watch

Extended reading notes

Core claim

The central claim is that matroid correspondences, defined as $C^*(M) = ((M \oplus B_{E_2}) \cap C) \setminus E_1$ for a matroid $C$ on $E_1 \sqcup E_2$, are functors between poset categories of matroids whose morphisms are matroid quotients. This one construction subsumes the standard matroid operations of deletion, contraction, free extension, truncation, intersection, union, pullback, and constant maps, and it preserves representability over infinite fields and algebraicity over any field. In the polymatroid setting, the correspondence commutes with multisymmetric lift and, when a linear operator with Lorentzian symbol has nonzero image, the support of the operator's output is exactly the polymatroid correspondence of the

Load-bearing premise

The link to linear operators holds only when the operator's image is nonzero; in the zero-image case the correspondence produces a polymatroid of strictly larger rank than the (empty) output, so the support-matching theorem does not cover that case.

Editorial extensions

If this is right

  • Standard matroid operations—deletion, contraction, free extension, truncation, intersection, union, pullback, and constant maps—are all instances of one functorial construction, so results proved for correspondences apply to all of them at once.
  • If the correspondence matroid is algebraic or representable over a field, then every matroid in its image is algebraic or representable (representability requires an infinite field).
  • Polymatroid correspondences commute with multisymmetric lifts, making them compatible with polarization of volume polynomials.
  • For a linear operator with Lorentzian symbol and nonzero image, the support of the output equals the polymatroid correspondence of the support of the input, connecting algebraic operators to purely combinatorial transformations.
  • Not every rank-preserving, weak-map-preserving functor that fixes uniform matroids is a correspondence—the class of correspondences is strictly smaller, as shown by an explicit functor that cannot arise in this way.

Reading between the lines

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

  • The zero-image caveat suggests that a variant with an explicit rank parameter—perhaps a 'relative' correspondence—could remove the rank discrepancy and match algebraic correspondences even when the operator vanishes.
  • The composition formula for correspondences parallels the product of algebraic correspondences, hinting that intersection-theoretic identities (for example, projection formulas) may have matroid analogues worth making explicit.
  • Because the construction relies only on matroid intersection and deletion, it likely extends to valuated matroids or flag matroids, giving analogous functors in tropical or higher-rank settings.
  • The delta-matroid remark points to a natural next step: a delta-matroid correspondence defined via delta-matroid union and contraction could realize operations that reverse the quotient direction, such as duality.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

1 major / 3 minor

Summary. The paper introduces matroid/polymatroid correspondences as categorical constructions: a matroid C on E1∪E2 defines a functor C^* from Mat(E1) to Mat(E2) by (M⊕B_{E2})∩C then deletion of E1. It proves functoriality (Prop. 2.3), composition of correspondences (Prop. 2.6), and preservation of representability/algebraicity (Props. 2.5, 5.6, 6.3). It realizes deletion, contraction, free extension, truncation, intersection, union, pullback, and constant maps as correspondences (Thm. 3.1, Cor. 3.2, Thm. 3.3), and extends the construction to caged polymatroids (Sec. 6), including compatibility with multisymmetric lifts (Prop. 6.2) and a relation to supports of linear operators with Lorentzian symbols (Thm. 7.3). The paper is concise and mostly elementary, with the main conceptual contribution being a combinatorial analogue of algebraic correspondences.

Significance. If the main results are correct, the framework gives a uniform way to encode many standard matroid operations as functors between poset categories, with a meaningful dictionary to Lorentzian polynomials and linear operators. The functoriality proof and the composition formula are self-contained and the preservation statements are useful. The paper is honest about the zero-image limitation in the Lorentzian correspondence, and the connection in Section 7 is a natural formal dictionary. However, the polymatroid generalization currently contains a concrete false statement in the contraction correspondence, so the significance is contingent on correcting that part and supplying the missing verification.

major comments (1)
  1. [Introduction, zero-image caveat] The paper acknowledges that zero-image operators are not captured and instead produce a polymatroid of larger rank. This is a real limitation of the claimed analogy, and it is good that it is stated, but the discussion in the introduction could mention that Theorem 7.3 only applies in the nonvanishing case and that the larger-rank phenomenon is not studied further.
minor comments (3)
  1. [Theorem 6.4(4)] There is a typo in the cage in item (4): 'α_N' should presumably be 'α_n'.
  2. [Definition 1.1 / Section 4] The paper uses 'matroid intersection' in the sense of the dual of matroid union (as in [GHM25, Definition 5.10]), not the common-independent-set intersection, which is not generally a matroid. This should be stated explicitly at first use to avoid confusion.
  3. [Section 7, proof of Theorem 7.3] The step identifying Supp(sym(T)^*(f y^β)) with the cap product should be expanded to mention nonnegativity of coefficients and the effect of setting x=0; as written it is a gap in the proof.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity; the core functor construction is self-contained and the Section 7 operator match is a compatibility statement, not a circular prediction.

full rationale

The paper's central construction (Definition 1.1, Proposition 2.3) is self-contained: C*(M) is defined directly, and functoriality is proved from standard quotient facts. The examples in Theorems 3.1 and 3.3 are verified by direct basis computations, not by assuming the target functors. Preservation of representability and algebraicity uses standard external results (Piff–Welsh, Oxley, [GHM+'25, Theorem 5.11]); the latter citation overlaps with an author of the present paper, but it is a specific, parameter-free theorem with its own proof, so it is independent support rather than a circularity. Section 7 (Theorem 7.3) is explicitly a compatibility/relation statement: C is defined from the support of sym(T), and Lemma 7.1 reconstructs T from its symbol, so the equality Q = C*(P) follows by tracking supports. This is a definition-level match by design, not an empirical prediction derived from external data, and it would be circular only if the paper claimed to predict the operator's behavior from information independent of the operator. The paper also honestly acknowledges the zero-image mismatch with algebraic correspondences, which is a limitation rather than a covert circular step. A separate correctness concern, noted but not counted as circularity: in Theorem 6.4 the proof is omitted and the bases given for 'contraction' (4) are identical to those for 'deletion' (3), which appears to make the stated (P/e)^* assertion false as written; that is a mathematical error, not a circularity in the derivation chain.

Assumptions & free parameters 0 free parameters · 7 assumptions · 1 invented entities

No numerical free parameters or fitted constants appear; the paper is a pure construction. The load-bearing inputs are standard matroid facts and several cited theorems about algebraic matroids, Lorentzian polynomials, and multisymmetric lifts, all stated as assumptions.

assumptions (7)
  • standard math Matroid intersection and union of two matroids on the same ground set are matroids and preserve matroid quotients (Lemmas 2.1 and 2.2).
    Used in Proposition 2.3 to prove C* is a functor.
  • standard math Duality reverses matroid quotients: N* -> M* when M -> N [Oxl11, Proposition 7.3.1].
    Used in Lemma 2.2(2) to reduce intersection preservation to union preservation.
  • domain assumption Piff-Welsh theorem: intersection of representable matroids over an infinite field is representable, and representability is preserved under duality [Oxl11, p.435 Ex.9, Cor.2.2.9].
    Used in Proposition 2.5(2) to show C* preserves representable matroids, with the infinite-field hypothesis stated.
  • domain assumption [GHM'25, Theorem 5.11]: intersection of two algebraic matroids over a field is algebraic.
    Used in Propositions 2.5(1), 5.6, and 6.3 to prove preservation of algebraic matroids and polymatroids.
  • domain assumption [BH20, Theorem 3.10] and [GHM'25, Proposition 5.4]: supports of Lorentzian/volume polynomials are polymatroids/algebraic polymatroids and conversely.
    Bridges Section 5/7: defines P, Q, and C from supports of polynomials.
  • domain assumption [CSW25, Theorem/Definition 2.6]: bijection between caged polymatroids and multisymmetric matroids; [EL24, p.4226]: polysymmetric operations commute with the lift.
    Used in Proposition 6.2 and Corollary 5.5 for the polymatroid correspondence and algebraicity transfer.
  • domain assumption Every weak map is a composition of rank-preserving weak maps and truncations [Luc75, Proposition 4.8(a)].
    Used in Proposition 3.4(2) to extend weak-map preservation from rank-preserving weak maps to all weak maps.
invented entities (1)
  • matroid/polymatroid correspondence C*
    purpose: A functorial bridge between matroid (or polymatroid) poset categories, combinatorial analogue of algebraic correspondences and of symbols of linear operators.
    This is a new mathematical definition, not an empirical entity. Its validation is internal theorem-proving and consistency with known operations; no external falsifiable prediction is offered.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Matroid correspondence." pith.science (2026). https://pith.science/paper/WFH56EK6

@misc{pith2026260713783,
  author       = {Pith},
  title        = {Pith review of: Matroid correspondence},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WFH56EK6}},
  note         = {Machine review of arXiv:2607.13783}
}
read the original abstract

Motivated by algebraic correspondences and linear operators associated with volume and Lorentzian polynomials, we introduce matroid correspondences and their polymatroid analogues. A matroid correspondence defines a functor between poset categories of matroids whose morphisms are matroid quotients, and various standard functors, including deletion, contraction, free extension, truncation, intersection, union, and pullback, arise in this way. We show that these correspondences preserve representability and algebraicity under natural hypotheses. In the polymatroid setting, we establish compatibility with multisymmetric lifts. Finally, we relate this construction to the supports of linear operators with Lorentzian symbols.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

14 extracted references · 2 linked inside Pith

  1. [1]

    Lorentzian polynomials

    Petter Br\"and\'en and June Huh. Lorentzian polynomials. Ann. of Math. (2) , 192(3):821--891, 2020

    2020

  2. [2]

    Representation theory for polymatroids

    Matthew Baker, June Huh, Donggyu Kim, Mario Kummer, and Oliver Lorscheid. Representation theory for polymatroids. arXiv preprint:2507.14718 , 2025

    arXiv 2025

  3. [3]

    Matchings and -matroids

    Andr\'e Bouchet. Matchings and -matroids. volume 24, pages 55--62. 1989. First Montreal Conference on Combinatorics and Computer Science, 1987

    1989

  4. [4]

    When are multidegrees positive? Adv

    Federico Castillo, Yairon Cid-Ruiz, Binglin Li, Jonathan Monta\ no, and Naizhen Zhang. When are multidegrees positive? Adv. Math. , 374:107382, 34, 2020

    2020

  5. [5]

    The B ergman fan of a polymatroid

    Colin Crowley, June Huh, Matt Larson, Connor Simpson, and Botong Wang. The B ergman fan of a polymatroid. Trans. Amer. Math. Soc. , 379(5):3239--3256, 2026

    2026

  6. [6]

    Combinatorial flats and S chubert varieties of subspace arrangements

    Colin Crowley, Connor Simpson, and Botong Wang. Combinatorial flats and S chubert varieties of subspace arrangements. Algebr. Comb. , 8(5):1285--1312, 2025

    2025

  7. [7]

    Logarithmic concavity for morphisms of matroids

    Christopher Eur and June Huh. Logarithmic concavity for morphisms of matroids. Adv. Math. , 367:107094, 19, 2020

    2020

  8. [8]

    Intersection theory of polymatroids

    Christopher Eur and Matt Larson. Intersection theory of polymatroids. Int. Math. Res. Not. IMRN , (5):4207--4241, 2024

    2024

Show all 14 references
  1. [9]

    Intersection Theory , volume 2 of Ergebnisse der Mathematik und ihrer Grenzgebiete

    William Fulton. Intersection Theory , volume 2 of Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge. A Series of Modern Surveys in Mathematics [Results in Mathematics and Related Areas. 3rd Series. A Series of Modern Surveys in Mathematics] . Springer-Verlag, Berlin, ...

    1998

  2. [10]

    Linear operators preserving volume polynomials

    Lukas Grund, June Huh, Mateusz Michałek, Hendrik Süss, and Botong Wang. Linear operators preserving volume polynomials. arXiv preprint:2506.22415 , 2025

    2025 arXiv

  3. [11]

    Realizations of homology classes and projection areas

    Daoji Huang, June Huh, Mateusz Michałek, Botong Wang, and Shouda Wang. Realizations of homology classes and projection areas. arXiv preprint:2505.08881 , 2025

    2025 arXiv

  4. [12]

    Weak maps of combinatorial geometries

    Dean Lucas. Weak maps of combinatorial geometries. Trans. Amer. Math. Soc. , 206:247--279, 1975

    1975

  5. [13]

    Matroid Theory , volume 21 of Oxford Graduate Texts in Mathematics

    James Oxley. Matroid Theory , volume 21 of Oxford Graduate Texts in Mathematics . Oxford University Press, Oxford, second edition, 2011

    2011

  6. [14]

    Theory of Matroids , volume 26 of Encyclopedia of Mathematics and its Applications

    Neil White, editor. Theory of Matroids , volume 26 of Encyclopedia of Mathematics and its Applications . Cambridge University Press, Cambridge, 1986

    1986

Pith tools

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