Split Grothendieck rings of rooted trees and skew shapes via monoid representations
David Beers, Matt Szczesny

TL;DR
This paper explores the algebraic structures of rooted trees and skew shapes through monoid representations, revealing connections to Grothendieck rings and graph theory over the field with one element.
Contribution
It introduces a novel interpretation of ring structures on rooted trees and skew shapes via monoid representations and their Grothendieck rings, linking to graph adjacency matrices.
Findings
Ring structures derived from smash product on monoid representations.
Interpretation of Grothendieck rings over the field with one element.
Analysis of base-change homomorphisms and Jordan decompositions.
Abstract
We study commutative ring structures on the integral span of rooted trees and -dimensional skew shapes. The multiplication in these rings arises from the smash product operation on monoid representations in pointed sets. We interpret these as Grothendieck rings of indecomposable monoid representations over - the "field" of one element. We also study the base-change homomorphism from -modules to -modules for a field containing all roots of unity, and interpret the result in terms of Jordan decompositions of adjacency matrices of certain graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Split Grothendieck rings of rooted trees and skew shapes via monoid representations.
David Beers and Matt Szczesny
DEPARTMENT OF MATHEMATICS AND STATISTICS, BOSTON UNIVERSITY, 111 CUMMINGTON MALL, BOSTON
DEPARTMENT OF MATHEMATICS AND STATISTICS, BOSTON UNIVERSITY, 111 CUMMINGTON MALL, BOSTON
Abstract.
We study commutative ring structures on the integral span of rooted trees and -dimensional skew shapes. The multiplication in these rings arises from the smash product operation on monoid representations in pointed sets. We interpret these as Grothendieck rings of indecomposable monoid representations over - the ”field” of one element. We also study the base-change homomorphism from -modules to -modules for a field containing all roots of unity, and interpret the result in terms of Jordan decompositions of adjacency matrices of certain graphs.
1. Introduction
In this paper we consider commutative ring structures on the integral spans of rooted trees and –dimensional skew shapes. The product in these rings arises by first interpreting the corresponding combinatorial structure as a representation of a monoid in pointed sets, and then using the smash product, which defines a symmetric monoidal structure on the category of such representations. We proceed to explain the construction in greater detail.
To a monoid , one may associate a category of ”representations of over the field of one element”, whose objects are finite pointed sets with an action of . The terminology comes from the general yoga of , where pointed sets are viewed as vector spaces over , and monoids are viewed as non-additive analogues of algebras (see [1, 7]). Given , their categorical coproduct is given by the wedge sum and the product by the Cartesian product (equipped with diagonal -action). One may also consider a reduced version of the Cartesian product – the smash product , with –action , which while not a categorical product, defines a symmetric monoidal structure on . and are compatible in the sense that
[TABLE]
In certain cases, objects of have a pleasant interpretation in terms of familiar combinatorial structures. For example, when , the free monoid on one generator , we may associate to a graph which encodes the action of on . The vertices of correspond to the non-zero elements of (where the basepoint plays the role of zero), and the directed edges join to . The possible connected graphs arising this way, corresponding to indecomposable representations, are easily seen to be of two types - rooted trees and wheels:
Rooted tree
Wheel
Given indecomposable (corresponding to a tree or wheel), one can ask how can be computed from and . We give the answer in Section 3.1, in the form of a simple algorithm, and show that corresponds to the tensor product of graphs in the sense of [11].
In a similar vein, –dimensional skew shapes can be interpreted as representations of - the free commutative monoid on generators . We illustrate this for , where the shape
\vphantom{1}\smash{\bullet}$$\vphantom{1}\smash{\bullet}
determines a module over the the free commutative monoid on two generators , whose non-zero elements correspond to the boxes in the diagram. acts by moving one box to the right, and by moving one box up, until the edge of the diagram is reached, and by [math] beyond that. Connected skew shapes yield indecomposable representations of , and we may once again ask how to decompose into , where are connected skew shapes. The answer is given in Section 4.1, where we prove the following theorem:
Theorem 1.1**.**
If and -dimensional skew shapes, then
[TABLE]
In other words, the are those skew shapes that occur in the intersection of one shape with a translate of the other.
Our results may be phrased in a more structured way as follows. Given a monoid , and a monoidal sub-category , we may consider the split Grothendieck ring . Elements of may be identified with formal integer linear combinations of isomorphism classes of , subject to the relations
[TABLE]
with multiplication induced by the smash product. In our examples, consists of integer linear combinations of trees/wheels or skew shapes. The results of this paper amount to an explicit combinatorial description of the product in .
Structures over may be based-changed to those over a field (or any commutative ring) . We denote this functor . is the monoid algebra , and for , the -module spanned over by elements of . is a -bialgebra, and so its category of modules monoidal. The functor is monoidal, and so induces a ring homomorphism
[TABLE]
We study this homomorphism in Section 3.2 in the simple case of the monoid , in which case generators of can be identified with Jordan blocks. Understanding in this case reduces to computing the Jordan form of the adjacency matrices of the trees/wheels above. We show the image of is spanned by nilpotent Jordan blocks and cyclotomic diagonal matrices.
1.1. Outline of paper
Section 2 recalls basic facts regarding monoids and the category , and define the split Grothendieck ring . In Section 3.1 we consider the example of - the free monoid on one generator, and identify the product in with the graph tensor product of trees/wheels. In Section 3.2 we consider the base-change homomorphism and describe its image in terms of the Jordan decomposition of the adjacency matrix of the corresponding graph. Section 4.1 is devoted to the example of - the free commutative monoid on generators, and a certain subcategory of corresponding to -dimensional skew shapes. We give an explicit description of the product in in terms of intersections of skew shapes.
Acknowledgements: This paper emerged from an undergraduate research project at Boston University completed by the first author with the second as faculty mentor. We gratefully acknowledge the generous support of the BU UROP program during the research and writing phase of this project. The second author is supported by a Simons Foundation Collaboration Grant.
2. Monoids and their modules
A monoid will be an associative semigroup with identity and zero (i.e. the absorbing element). We require
[TABLE]
Monoid homomorphisms are required to respect the multiplication as well as the special elements .
Example 2.1*.*
Let with
[TABLE]
We call the field with one element.
Example 2.2*.*
Let
[TABLE]
the set of monomials in , with the usual multiplication. We will often write elements of in multiindex notation as , in which case the multiplication is written as
[TABLE]
We identify with . has a natural -grading obtained by setting - the th standard basis vector in .
and are both commutative monoids.
2.1. The category
Definition 2.3**.**
Let be a monoid. An -module is a pointed set (with denoting the basepoint), equipped with an action of . More explicitly, an -module structure on is given by a map
[TABLE]
satisfying
[TABLE]
A morphism of -modules is given by a pointed map compatible with the action of , i.e. . The -module is said to be finite if is a finite set, in which case we define its dimension to be (we do not count the basepoint, since it is the analogue of [math]). We say that is an –submodule if it is a (necessarily pointed) subset of preserved by the action of . always posses the module , which will be referred to as the zero module, as well as the trivial module , on which all non-zero elements of act by the identity (this arises via the augmentation homomorphism sending all non-zero elements to ).
Note: This structure is called an -act in [6] and an -set in [1].
We denote by the category of finite -modules. It is the analogue of the category of a finite-dimensional representations of an algebra. Note that for , is a monoid (in general non-commutative). An -module is simply a pointed set, and will be referred to as a vector space over . Thus, an -module structure on amounts to a monoid homomorphism .
Given a morphism in , we define the image of to be
[TABLE]
For and an –submodule , the quotient of by , denoted is the -module
[TABLE]
i.e. the pointed set obtained by identifying all elements of with the base-point, equipped with the induced –action.
We recall some properties of , following [6, 1, 9], where we refer the reader for details:
- (1)
For , 2. (2)
The trivial -module [math] is an initial, terminal, and hence zero object of . 3. (3)
Every morphism in has a kernel . 4. (4)
Every morphism in has a cokernel . 5. (5)
The co-product of a finite collection in exists, and is given by the wedge product
[TABLE]
where is the equivalence relation identifying the basepoints. We will denote the co-product of by
[TABLE] 6. (6)
The product of a finite collection in exists, and is given by the Cartesian product , equipped with the diagonal –action. It is clearly associative. It is however not compatible with the coproduct in the sense that . 7. (7)
The category possesses a reduced version of the Cartesian product , called the smash product. , where and are identified with the –submodules and of respectively. The smash product inherits the associativity from the Cartesian product, and is compatible with the co-product - i.e.
[TABLE]
It defines a symmetric monoidal structure on , with unit (i.e. ). 8. (8)
possesses small limits and co-limits. 9. (9)
Given in and , there is an inclusion-preserving correspondence between flags in and –submodules of given by sending to . The inverse correspondence is given by sending to , where is the canonical projection. This correspondence has the property that if , then .
These properties suggest that has many of the properties of an abelian category, without being additive. It is an example of a quasi-exact and belian category in the sense of Deitmar [4] and a proto-abelian category in the sense of Dyckerhoff-Kapranov [5]. Let denote the set of isomorphism classes in , and by the isomorphism class of .
We will regard as a symmetric monoidal category with respect to and unit .
Definition 2.4**.**
- (1)
We say that is indecomposable if it cannot be written as for non-zero . 2. (2)
We say is irreducible or simple if it contains no proper sub-modules (i.e those different from [math] and ).
It is clear that every irreducible module is indecomposable. We have the following analogue of the Krull-Schmidt theorem ([9]):
Proposition 2.5**.**
Every can be uniquely decomposed (up to reordering) as a direct sum of indecomposable -modules.
Remark 2.6*.*
Suppose is the decomposition of an -module into indecomposables, and is a submodule. It then immediately follows that .
2.2. Monoid algebras
In this section, we recall a few facts regarding monoid algebras following [8]. Let be a field. The monoid algebra consists of linear combinations of non-zero elements of with coefficients in . I.e.
[TABLE]
with product induced from the product in , extended –linearly. is a bialgebra, with co-product
[TABLE]
determined by
[TABLE]
The category of -modules is therefore symmetric monoidal under the operation of tensoring over .
There is a base-change functor:
[TABLE]
to the category of –modules defined by setting
[TABLE]
i.e. the free –module on the non-zero elements of , with the -action induced from the –action on . It sends to its unique –linear extension in .
We will find the following elementary observation useful:
Proposition 2.7**.**
The functor is monoidal.
As a consequence, we have that for ,
[TABLE]
as -modules.
2.3. The split Grothendieck ring
Definition 2.8**.**
The split Grothendieck ring of , denoted is the –linear span of isomorphism classes in modulo the relation . I.e.
[TABLE]
where is the ideal generated by all differences , with product induced by . Since by Prop 2.5 every module is a direct sum of indecomposable ones, we can also describe as the -linear span of indecomposable -modules:
[TABLE]
with the product of two isomorphism classes of indecomposables given by
[TABLE]
We note that is a commutative ring with identity the isomorphism class of the trivial -module.
More generally, if is a subcategory of closed under and , we may consider , where the span in 2 is restricted to the indecomposable modules in .
The following is an immediate consequence of the of the functor being monoidal:
Proposition 2.9**.**
There is a ring homormorphism
[TABLE]
3. Rooted trees, wheels, and the monoid
In this section we study the ring in the case where , the free monoid on one generator, and the corresponding base-change homomorphism
[TABLE]
for a field . Recall that finite-dimensional -modules correspond to pairs where is a finite-dimensional vector space over , and . The indecomposable -modules thus correspond to Jordan blocks. It follows by analogy that the study of finite -modules amounts to studying ”linear algebra over ”, and the indecomposable -modules are the corresponding Jordan blocks over .
Given , we may associate to it a graph which encodes the action of on . The vertices of correspond bijectively to the non-zero elements of , and the directed edges join to . We will make no distinction between and the corresponding vertex of when the context is clear.
The possible connected graphs arising as , corresponding to indecomposable -modules, were classified in [9] and are easily seen to be of two types:
Rooted tree
Wheel
We call the first type a rooted tree and the second a wheel. Rooted trees correspond to indecomposable -modules where acts nilpotently, in the sense that for sufficently large . We call such a module nilpotent.
We will use the following terminology when discussing the graphs
- •
We call a vertex with no outgoing edges a root. It is drawn at the top. A connected can have at most one root.
- •
If is nilpotent, hence a tree, then the depth of a vertex , denoted is the number of edges in the unique path connecting to the root. The only vertex of depth zero is the root. In general, is the smallest power of that annihilates .
- •
The height of a rooted tree is the maximal depth of any of its vertices. The tree in the above example has height .
- •
A cycle of length is a sequence of distinct elements , such that and .
- •
A chain of length is a sequence of distinct elements , such that , but .
Wheels contain a single directed cycle, possibly with trees attached. A wheel is easily seen to arise from a -module where for some for every .
We begin with the problem of computing the product in in terms of the graphs above.
3.1. Products in
Given a -module , and , we define
[TABLE]
At the level of the graph , corresponds to the vertices connected to via directed edge. Recall that for and , . In particular, iff or . The following observations are immediate:
Proposition 3.1**.**
Let be indecomposable.
- (1)
* is nilpotent iff at least one of is nilpotent.* 2. (2)
If are nilpotent, and , then . 3. (3)
If is nilpotent, and is not, then for , . 4. (4)
, and corresponds to a root in the corresponding component of . 5. (5)
For ,
[TABLE]
I.e. . 6. (6)
**
We proceed to examine the three cases where each of is a rooted tree/wheel.
- •
If are both rooted trees, then consists of rooted trees whose roots correspond to pairs where at least one of is a root. Each component has height , and at least one component where the inequality is sharp.
- •
If is a tree and is a wheel, then consists of rooted trees whose roots correspond to pairs where is the root of . Each component has height .
- •
If are both wheels containing cycles of length , then in both and , and so on . Each connected component of is therefore a wheel, and contains a unique cycle. If is part of a cycle, then
[TABLE]
for some , which implies that and . It follows that (resp. ) is itself part of a cycle in (resp. ). Moreover, must be a multiple of and . Since the length of the cycle containing is the least such that equation 3 holds, it follows that .
To summarize, have thus shown that each connected component of contains a (necessarily unique) cycle of length , and that occurs in a cycle iff do as well. Since there are such pairs, it follows that has connected components.
We note that each connected component of is determined recursively by property above. For instance, if at least one of is a rooted tree, we may begin with a vertex or corresponding to a root in and build the rest of the component using . The same approach works if both graphs are wheels, though there is no preferred choice for the starting vertex.
Example 3.2*.*
The two trees and yield the forest pictured below, with connected components, each of which has height .
Example 3.3*.*
The tree and the wheel yield the forest pictured below, with connected components, each of which has height .
Example 3.4*.*
The two wheels and yield pictured below, with wheels, each with a cycle of vertices.
Example 3.5*.*
The two wheels and yield pictured below, which consists of a single wheel as . This wheel contains a cycle of vertices.
We end this section by collecting a couple of observations regarding the structure of .
- (1)
is a -graded commutative ring, with for . 2. (2)
[TABLE]
is a graded ideal.The quotient
[TABLE]
can be naturally identified with the integral span of wheels, with product given by .
3.2. The homomorphism
In this subsection we study the ring homomorphism where is an field containing all roots of unity. For , is the isomorphism class of the -module with basis , and -action extended -linearly from . In what follows, we will denote by and the linear transformation by . Fixing an ordering of the non-zero elements of produces a basis for , and the matrix of in this basis is the adjacency matrix of .
The isomorphism classes of indecomposable -modules correspond to Jordan blocks with eigenvalue :
{\lambda}$${1}$${0}$${1}$${0}$${\lambda}$$\left.\vbox{\hrule height=27.03168pt,depth=27.03168pt,width=0.0pt}\right]$$\left[\vbox{\hrule height=27.03168pt,depth=27.03168pt,width=0.0pt}\right.
Describing thus amounts to decomposing , or equivalently the adjacency matrix , into Jordan blocks. It is clearly sufficient to consider the case where is connected.
Ladder
Simple cycle
The Jordan forms of when is a ladder tree of height or a simple cycle of length are easily seen to be the matrices and :
{0}$${1}$${0}$${1}$${0}$${0}$$\left.\vbox{\hrule height=26.53168pt,depth=26.53168pt,width=0.0pt}\right]$$\left[\vbox{\hrule height=26.53168pt,depth=26.53168pt,width=0.0pt}\right.$$J_{n}(0)=
{\zeta}$${0}$${0}$${\zeta^{n}}$$\left.\vbox{\hrule height=23.02368pt,depth=23.02368pt,width=0.0pt}\right]$$\left[\vbox{\hrule height=23.02368pt,depth=23.02368pt,width=0.0pt}\right.$$D_{n}=
with
For more general directed graphs arising as , this problem is solved in [2]. We proceed to recall the solution given there, specialized to our setup.
Definition 3.6**.**
A partition of is a collection of disjoint chains and cycles whose union is . A proper partition of is a partition satisfying the following two additional properties:
- (1)
Each cycle in is equal to one of . 2. (2)
For each , if is the graph obtained from by deleting all of the vertices in , then is a chain of maximal length in .
It is easy to see that proper partitions of exist, and can be obtained as follows. Each connected component of has at most one (and necessarily unique) cycle - take these to be , Upon deleting the , we are left with a forest of rooted trees. We now look for the longest chain in this forest, delete it, and repeat, obtaining .
Example 3.7*.*
In the graph below,
12345678910
a proper partition is given by , where , , , and .
The following theorem describes the Jordan form of .
Theorem 3.8** ([2]).**
Let be a proper partition of into chains of length and cycles of length . Then
[TABLE]
We are now able to characterize the image of the homorphism :
Theorem 3.9**.**
The image of is the subring of generated by , .
We note one final consequence of the fact that is monoidal. By the above discussion, may be identified with the adjacency matrix of . It follows that
[TABLE]
In other words, , where on the right denotes the Kronecker product of matrices. This is the defining property of the tensor product graph (see [11]). To summarize,
Proposition 3.10**.**
For , .
4. Skew shapes and the monoids
In this section we consider a subcategory (originally introduced in [10]) consisting of -dimensional skew shapes. Our goal is to give an explicit description of the product in the ring .
4.1. Skew shapes and -modules
has a natural partial order where for
[TABLE]
[TABLE]
Definition 4.1**.**
An n-dimensional skew shape is a finite convex sub-poset . is connected iff the corresponding poset is. We consider two skew shapes to be equivalent iff they are isomorphic as posets. If are connected, then they are equivalent iff is a translation of , i.e. if there exists such that .
The condition that is connected is easily seen to be equivalent to the condition that any two elements of can be connected via a lattice path lying in . The name skew shape is motivated by the fact that for , a connected skew shape in the above sense corresponds (non-uniquely) to a difference of two Young diagrams in French notation.
Example 4.2*.*
Let , and
[TABLE]
(up to translation by Then corresponds to the connected skew Young diagram
Let be a skew shape. We may attach to a -module with underlying set
[TABLE]
and action of defined by
[TABLE]
In particular, if , [math] otherwise, where is the th standard basis vector. is a graded -module with respect to its -grading, in which - the th standard basis vector.
Example 4.3*.*
Let as in Example 4.2. (resp. ) act on the -module by moving one box to the right (resp. one box up) until reaching the edge of the diagram, and [math] beyond that. A minimal set of generators for is indicated by the black dots:
\vphantom{1}\smash{\bullet}$$\vphantom{1}\smash{\bullet}
We may consider the subcategory consisting of -modules satisfying the following two conditions:
- (1)
admits a –grading. 2. (2)
For , ,
[TABLE]
The following proposition follows from results in [10]:
Proposition 4.4**.**
* forms a full monoidal subcategory of . If is indecomposable, then for a connected skew shape .*
In other words, given connected skew shapes , the -module is isomorphic to , where are connected skew shapes.
Lemma 4.5**.**
If with chosen embeddings in , and , then
[TABLE]
is also an dimensional skew shape, possibly empty.
Proof.
As is a skew shape, so is . Hence, it suffices to show the intersection of skew shapes is a skew shape, that is, is a skew shape.
It is immediate that is a finite poset of . Further, if and , then as both and are convex, . Hence, is convex and therefore a skew shape. ∎
Theorem 4.6**.**
If with chosen embeddings in then
[TABLE]
Remark 4.7*.*
Since are finite embedded skew shapes, the intersection is empty for all but finitely many . Moreover, by Lemma 4.5, the right hand side is an object in .
Proof.
We will use the notation to denote an element occurring in the -th summand in . Define
[TABLE]
by
[TABLE]
We proceed to show that is an isomorphism of -modules. is clearly injective, and sends [math] to [math]. Moreover, if is nonzero, then for some nonzero , hence . is therefore a bijection.
It remains to check that is morphism of -modules, or equivalently that for .
Suppose is a non-zero element in the domain of . If , then either or , or equivalently, either or . Thus and so .
Otherwise, and so it follows that . Meanwhile, . As , , we have , and so . Hence
[TABLE]
This completes the proof. ∎
Remark 4.8*.*
The situation can be visualized as follows. For two embedded skew shapes and , the connected component of the skew shape in containing some point is the intersection of with the the unique translate of that makes and coincide . Below is an example of , and their intersection in red for .
Example 4.9*.*
Suppose the we have the following skew shapes and in dimensions.
To find the collection of skew shapes occurring in we observe the nontrivial intersections of and under translation are given below with regions of intersection in red, and regions of nonintersection in yellow.
It follows that decomposes into indecomposable modules corresponding to the following skew shapes with the indicated multiplicities:
8
2
2
Note that we further decomposed the disconnected skew shape
into its connected components.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Chu C.; Lorscheid O.; Santhanam R. Sheaves and K-theory for F 1-schemes. Adv. Math. 229, no. 4,2239-2286, 2012.
- 2[2] Cardon, David A.; Tuckfield, Bradford The Jordan canonical form for a class of zero-one matrices. Linear Algebra Appl. 435 (2011), no. 11, 2942?2954.
- 3[3] Deitmar, A. Schemes over 𝔽 1 subscript 𝔽 1 \mathbb{F}_{1} . Number fields and function fields—two parallel worlds, 87–100, Progr. Math., 239, Birkhäuser Boston, Boston, MA, 2005.
- 4[4] Deitmar, A. Belian categories. Far East J. Math. Sci. (FJMS) 70 (2012), no. 1, 1?46.
- 5[5] Dyckerhoff, T. ; Kapranov, M. Higher Segal Spaces I. Preprint ar Xiv: 1212.3563
- 6[6] Kilp, Mati; Knauer, Ulrich ; Mikhalev, Alexander V. Monoids, acts and categories. With applications to wreath products and graphs. A handbook for students and researchers. de Gruyter Expositions in Mathematics, 29. Walter de Gruyter & Co., Berlin, 2000.
- 7[7] Lorscheid, O. 𝔽 1 subscript 𝔽 1 \mathbb{F}_{1} for everyone. Jahresber. Dtsch. Math.-Ver. 120(2), 83-116, 2018.
- 8[8] Steinberg, Benjamin Representation theory of finite monoids. Universitext. Springer, Cham, 2016.
