Universal Pasture in Matroid Theory

• Universal Pasture is an algebraic object that encodes matroid and polymatroid representation data through universal mapping properties and cross-ratios.
• It classifies F-matroid structures via residue, weak, and foundation pastures using explicit generators, relations, and effective algorithms based on Tutte groups.
• It provides a framework to assess representability, connecting criteria like regularity and binary properties with the realization spaces of discrete polymatroids.

Universal pasture denotes the algebraic object that represents matroid or polymatroid representation data over pastures or tracts. In the matroid setting, the literature distinguishes the universal pasture $k_M$, which classifies $F$-matroid structures on a fixed matroid $M$, from the foundation $k_M^f$ or $F_M$, which classifies rescaling classes and is generated by cross-ratios. In the discrete polymatroid setting, the universal pasture $P_J$ represents the weak thin Schubert cell of a polymatroid $J$, while its foundation $F_J$ represents the realization space. These constructions are formulated through universal mapping properties, explicit generators-and-relations presentations, and, for matroids, effective algorithms based on Tutte groups and cross-ratio data (Baker et al., 2018, Zhang et al., 2023, Baker et al., 19 Jul 2025).

1. Universal property and categorical role

A pasture is a “field-like” algebraic object whose multiplicative units $P^\times$ form an abelian group and whose addition is encoded by a distinguished set of triples

$$N_P\subset P^3,\qquad (a,b,c)\in N_P \Longleftrightarrow a+b+c=0.$$

A morphism of pastures $F$0 is a monoid map sending $F$1, units to units, $F$2, and preserving additive triples. Fields, hyperfields, and partial fields appear as special cases inside the category of pastures (Zhang et al., 2023, Baker et al., 2018).

For a matroid $F$3, two representation functors are singled out. One writes $F$4 for isomorphism-classes of $F$5-representations of $F$6, and $F$7 for rescaling-equivalence-classes of $F$8-representations of $F$9. The representability theorem states that there is a unique pasture $M$0, the universal pasture, representing $M$1, and a unique pasture $M$2, the foundation, representing $M$3. Equivalently,

$M$4

In particular, $M$5 is initial among pastures $M$6 for which $M$7 admits a $M$8-representation up to rescaling, and every rescaling-class over any $M$9 arises by push-forward along a unique morphism $k_M^f$0 (Zhang et al., 2023).

The moduli-space formulation uses different notation. For a classical matroid $k_M^f$1, the residue pasture $k_M^f$2 is the universal pasture; the weak universal pasture $k_M^f$3 classifies weak $k_M^f$4-matroid structures; and the foundation $k_M^f$5 is the sub-pasture generated by cross-ratios. The inclusions

$k_M^f$6

encode the passage from rescaling classes to weak structures and then to strong structures (Baker et al., 2018).

2. Residue-pasture construction from the moduli space of matroids

Let $k_M^f$7 be a finite set with a fixed total order and let $k_M^f$8 satisfy $k_M^f$9. The moduli space of rank-$F_M$0 matroids on $F_M$1 is the ordered blue scheme

$F_M$2

where $F_M$3 is generated by the Plücker relations

$F_M$4

for each $F_M$5-subset $F_M$6 and $F_M$7-subset $F_M$8. Its $F_M$9-points classify strong $P_J$0-matroids of rank $P_J$1 on $P_J$2 (Baker et al., 2018).

A classical matroid $P_J$3 corresponds to the unique $P_J$4-valued point

$P_J$5

with support-determined image

$P_J$6

where $P_J$7 is the set of bases of $P_J$8. The universal pasture $P_J$9 is the residue idyll at $J$0: $J$1 Here $J$2 denotes the degree-zero part of the naturally graded blueprint, and $J$3 is the pasteurization (Baker et al., 2018).

The universal mapping property is precise: for any idyll $J$4, there is a canonical bijection

$J$5

functorial in $J$6. In the matroid representation-theoretic notation of Chen–Zhang, this is the same universal role assigned to $J$7 (Baker et al., 2018, Zhang et al., 2023).

3. Weak universal pasture, foundation, and cross-ratios

The weak version keeps only the 3-term Plücker relations. The weak matroid scheme $J$8 is defined by

$J$9

The corresponding weak universal pasture is

$F_J$0

It classifies weak $F_J$1-matroid structures on $F_J$2 (Baker et al., 2018).

The foundation is the sub-idyll of $F_J$3 generated over $F_J$4 by all cross-ratios of $F_J$5. For a weak $F_J$6-matroid $F_J$7 and a quadrangle

$F_J$8

the cross-ratio is

$F_J$9

Each $P^\times$0 is a fundamental element, meaning that it satisfies $P^\times$1. The foundation $P^\times$2 is generated by these cross-ratios, and in Chen–Zhang’s notation the foundation $P^\times$3 represents rescaling classes of matroid representations (Baker et al., 2018, Zhang et al., 2023).

The three universal objects are related as follows:

Object	Description	Universal property
$P^\times$4	residue pasture at $P^\times$5	classifies strong $P^\times$6-matroid structures
$P^\times$7	weak universal pasture from 3-term relations	classifies weak $P^\times$8-matroid structures
$P^\times$9	sub-pasture generated by cross-ratios	classifies rescaling classes of weak $$N_P\subset P^3,\qquad (a,b,c)\in N_P \Longleftrightarrow a+b+c=0.$$0-matroids

At the level of units, one has

$$N_P\subset P^3,\qquad (a,b,c)\in N_P \Longleftrightarrow a+b+c=0.$$1

where $$N_P\subset P^3,\qquad (a,b,c)\in N_P \Longleftrightarrow a+b+c=0.$$2 is the Tutte group and $$N_P\subset P^3,\qquad (a,b,c)\in N_P \Longleftrightarrow a+b+c=0.$$3 is the inner Tutte group, the kernel of the degree map to $$N_P\subset P^3,\qquad (a,b,c)\in N_P \Longleftrightarrow a+b+c=0.$$4 (Baker et al., 2018).

4. Algorithmic computation of the foundation and of morphisms

For a matroid $$N_P\subset P^3,\qquad (a,b,c)\in N_P \Longleftrightarrow a+b+c=0.$$5, Chen–Zhang describe an explicit algorithmic route to the foundation $$N_P\subset P^3,\qquad (a,b,c)\in N_P \Longleftrightarrow a+b+c=0.$$6. The first step is to compute the outer Tutte group $$N_P\subset P^3,\qquad (a,b,c)\in N_P \Longleftrightarrow a+b+c=0.$$7. If $$N_P\subset P^3,\qquad (a,b,c)\in N_P \Longleftrightarrow a+b+c=0.$$8 is the set of bases and $$N_P\subset P^3,\qquad (a,b,c)\in N_P \Longleftrightarrow a+b+c=0.$$9 is a reference basis, one forms the free abelian group

$F$00

subject to $F$01, $F$02, and the cross-ratio relations $F$03 whenever $F$04, $F$05, and all four $F$06-element enlargements are bases. These relations are assembled into a matrix $F$07 over $F$08, with one $F$09-row for $F$10, and

$F$11

The second step computes the inner Tutte group

$F$12

by choosing a spanning forest in the exchange bipartite graph and constructing a second relations-matrix $F$13 so that

$F$14

By Baker–Lorscheid’s theory,

$F$15

so the Smith normal form of $F$16 yields the decomposition $F$17 (Zhang et al., 2023).

The additive structure is then recovered from “hexagons.” Each 3-term relation in a pasture is encoded by a fundamental pair $F$18 with

$F$19

The only new additive relations in the foundation come exactly from modular quadruples of hyperplanes, namely corank-two flats that lie in four hyperplanes. For each corank-2 flat $F$20 and four hyperplanes $F$21, one chooses an independent set $F$22, elements $F$23, forms the relevant cross-ratios, projects them into $F$24, and records the resulting pair $F$25. Declaring $F$26 for all such pairs completes the presentation of $F$27 by generators and hexagons (Zhang et al., 2023).

Once $F$28 is known, all rescaling classes of $F$29-representations are obtained by computing $F$30. Since $F$31 subject to hexagon-constraints, the procedure decomposes $F$32, fixes $F$33 sending $F$34, uses a depth-first search to assign images to generators in $F$35, and then extends to a full homomorphism. If $F$36 is a field, each morphism produces a unique reduced-row-echelon form with respect to a fixed basis $F$37, and the minors $F$38 are read off as entries of a standard $F$39 matrix (Zhang et al., 2023).

5. Internal structure, examples, and representation-theoretic criteria

The unit group of a foundation has the form

$F$40

The torsion part $F$41 often encodes binary- or ternary-type behavior. Hyperfields and partial fields sit inside the category of pastures, and the cited examples include the sign hyperfield $F$42, the near-regular partial field

$F$43

the dyadic partial field

$F$44

and

$F$45

Every fundamental pair $F$46 in $F$47 arises from one of four “universal” pastures, and each hexagon of $F$48 is one of these four types (Zhang et al., 2023).

Several classical classification statements are reformulated through foundations. A matroid $F$49 is regular iff its foundation is the regular partial field $F$50. A non-regular matroid is binary iff its foundation is $F$51. Equivalently, the regular case and the binary non-regular case are separated by

$F$52

This yields the classical characterization

$F$53

because orientability is equivalent to the existence of a morphism $F$54 (Baker et al., 2018, Zhang et al., 2023).

Two standard examples illustrate the formalism. For the rank-2 uniform matroid on four points,

$F$55

A pasture morphism $F$56 is equivalent to choosing a fundamental pair $F$57, and therefore

$F$58

Over a field $F$59, $F$60, so $F$61 has exactly $F$62 distinct rescaling classes of $F$63-representations. The same algebraic object is identified in the cited accounts as the near-regular partial field, denoted $F$64 in one presentation and $F$65 in another (Zhang et al., 2023, Baker et al., 19 Jul 2025).

For the Fano matroid $F$66,

$F$67

The resulting pasture is the pasture attached to the finite field $F$68, so

$F$69

Hence $F$70 is representable exactly over fields of characteristic $F$71 (Zhang et al., 2023).

The same framework yields practical criteria. $F$72 is orientable iff $F$73. If $F$74, then no field $F$75 admits a pasture morphism $F$76, so $F$77 is non-representable. Once $F$78 is computed, one obtains the exact number of inequivalent $F$79-representations of $F$80 (Zhang et al., 2023).

6. Universal pastures for discrete polymatroids

Let

$F$81

and let $F$82 be a finite M-convex set, i.e. a discrete polymatroid. For a commutative tract $F$83, a weak $F$84-representation of $F$85 is a map

$F$86

whose support is exactly $F$87, which is alternating, and which satisfies the 3-term Plücker relations

$F$88

whenever all six relevant points lie in $F$89. The weak thin Schubert cell is the quotient

$F$90

by overall rescaling (Baker et al., 19 Jul 2025).

The universal pasture $F$91 is constructed from generators $F$92 and exactly the 3-term Plücker null-relations. One first forms the quotient tract

$F$93

grades it by $F$94, and defines the universal pasture as the degree-zero subtract

$F$95

For every tract $F$96, there is a natural bijection

$F$97

functorial in $F$98 (Baker et al., 19 Jul 2025).

The full universal tract $F$99 is obtained by imposing all higher Plücker relations

$M$00

A theorem states that the natural quotient $M$01 is a bijection on underlying sets, indeed on unit groups. Equivalently,

$M$02

The abstract further states that the canonical bijection between the universal tract and the universal pasture is new even in the case of matroids (Baker et al., 19 Jul 2025).

Inside $M$03, the foundation $M$04 is the subgroup of invertible degree-zero elements. It is generated, as a tract over the Krasner hyperfield $M$05, by cross-ratios attached to non-degenerate $M$06-tuples: $M$07 These cross-ratios satisfy a list of “obvious” multiplicative relations, including symmetries, the relation

$M$08

degenerate relations $M$09 when one of the six points is missing, and 3-term and 4-term cycle relations. These relations suffice to present $M$10 when $M$11 is a matroid; in general they remain a conjecturally complete generating list (Baker et al., 19 Jul 2025).

For $M$12, all cross-ratios coincide with

$M$13

and the single 3-term Plücker relation becomes $M$14. Hence the foundation is identified with the near-regular partial field. The realization space is recovered as

$M$15

making the bijection between $M$16-realizations of $M$17 and morphisms from the foundation manifest (Baker et al., 19 Jul 2025).