Next Article in Journal
Differential Geometry of Submanifolds in Complex Space Forms Involving δ-Invariants
Previous Article in Journal
Statistical Feature Construction for Forecasting Accuracy Increase and Its Applications in Neural Network Based Analysis
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Augmented Simplicial Combinatorics through Category Theory: Cones, Suspensions and Joins

by
José Manuel García-Calcines
1,*,†,‡,
Luis Javier Hernández-Paricio
2,‡,§ and
María Teresa Rivas-Rodríguez
2,‡,§
1
Department de Matemáticas, Estadística e I.O., Facultad de Ciencias (Sección de Matemáticas), Campus de Anchieta, University of La Laguna, 38200 La Laguna, Spain
2
Department de Matemáticas y Computación, Facultad de Ciencia y Tecnología, University of La Rioja, 26006 Logroño, Spain
*
Author to whom correspondence should be addressed.
Current address: Avda. Astrofísico Fco. Sánchez, s/n., Aptado. 456, 38200 La Laguna, Spain.
These authors contributed equally to this work.
§
Current address: C/Madre de Dios 53, Edificio CCT, 26006 Logroño, Spain.
Mathematics 2022, 10(4), 590; https://doi.org/10.3390/math10040590
Submission received: 23 December 2021 / Revised: 9 February 2022 / Accepted: 10 February 2022 / Published: 14 February 2022

Abstract

:
In this work, we analyze the combinatorial properties of the category of augmented semi-simplicial sets. We consider various monoidal structures induced by the co-product, the product, and the join operator in this category. In addition, we also consider monoidal structures on augmented sequences of integers induced by the sum and product of integers and by the join of augmented sequences. The cardinal functor that associates to each finite set X its cardinal | X | induces the sequential cardinal that associates to each augmented semi-simplicial finite set X an augmented sequence | X | n of non-negative integers. We prove that the sequential cardinal functor is monoidal for the corresponding monoidal structures. This allows us to easily calculate the number of simplices of cones and suspensions of an augmented semi-simplicial set as well as other augmented semi-simplicial sets which are built by joins. In this way, the monoidal structures of the augmented sequences of numbers may be thought of as an algebraization of the augmented semi-simplicial sets that allows us to do a simpler study of the combinatorics of the augmented semi-simplicial finite sets.

1. Introduction

The main objectives of this work are framed in the study of the combinatorics of augmented semi-simplicial sets. We can highlight, among others, the following targets:
  • The study of some properties about the combinatorics of the faces in semi-simplicial complexes (polyhedra)
  • The analysis of the numerical sequences (sequential cardinals) arising from the combinatorial structure of semi-simplicial complexes.
  • The development of some semi-simplicial constructions and the search for methods for counting the number of their faces.
  • The study of relationships between such semi-simplicial constructions and their associated numerical sequences.
We are considering two kind of mathematical objects:
(i)
Augmented semi-simplicial and co-semi-simplicial objects,
(ii)
Augmented integer sequences and matrices.
As far as simplicial objects are concerned, we have focused on what we have called Γ + o p -sets, or augmented semi-simplicial sets. Using this category has its advantages and drawbacks. On the one hand, we point out that the significant information is given in the combinatorics of non-degenerated simplices so that fewer data are necessary for their coding. Nevertheless, the use of degenerated simplices would allow one to represent simplicially a greater number of continuous maps. Another feature in our study is considering augmented semi-simplicial objects. This slight modification makes both the structures and formulas we are using symmetric and much more reduced, so that it helps facilitate their computation. For notions related with semi-simplicial sets, we refer the reader to [1,2,3,4,5] and for a study of the realization of semi-simplicial sets [6]. For category models related with homotopy theory of simplicial sets and topological spaces, see [7].
As basic combinatorial elements, we are considering the following ones:
(bc) Binomial coefficients ( If q > p , take p q = 0 ):
p q = p ! q ! ( p q ) ! = p ( p 1 ) ( p q + 1 ) ( p q ) !
which give the number of strictly increasing maps from the ordered set with q elements { 1 < < q } to the ordered set of p elements { 1 < < p } . These numbers occur as coefficients in Newton’s binomial formula
( a + b ) p = q = 0 p p q a p q b q
and the coefficients in Pascal’s triangle
1 1 1 2 2 1 1 3 3 1 1 4 6 4 1 1 5 10 10 5 1
which can also represented by the matrix
0 1 2 3 4 5 6 0 | 0 0 0 0 0 0 0 0 0 1 | 1 0 1 1 0 0 0 0 0 0 2 | 2 0 2 1 2 2 0 0 0 0 0 3 | 3 0 3 1 3 2 3 3 0 0 0 0 4 | 4 0 4 1 4 2 4 3 4 4 0 0 0 5 | 5 0 5 1 5 2 5 3 5 4 5 5 0 0 6 |
In order to write this work, we have examined some results about binomial numbers in the following references: [8,9,10,11,12].
(gc) Numbers associated with certain geometric configurations: Consider integers d 0 and n 1 . The d-dimensional n-th triangular number T n d is inductively defined as follows:
T n 0 = 1 , i f d = 0 T n d = i = 1 n T i d 1 , i f d 1 .
These numbers are contained in the family of regular polytope numbers, see [13].
When you consider other combinatorial subjects on semi-simplicial sets, there are many connections with the standard families of sequences and matrices of numbers as Stirling [14], and chain-power-set numbers [15]. For more information about these types of numbers, we refer the reader to [16,17]. Nevertheless, in order to write a shorter paper, we have focused on analyzing some relations between semi-simplicial finite sets and binomial and triangular numbers.
In this work, we study a new version of join construction for augmented semi-simplicial sets which has similar properties to the one developed by P. Ehlers and T. Porter [18] for augmented simplicial sets. However, one important novelty of our work is that we endow the category of augmented semi-simplicial finite sets with a categorical semi-ring structure (i.e., a bimonoidal category structure) that admits a right action of augmented co-semi-simplicial objects in the category of semi-simplicial finite sets. This structural enrichment permits an interesting study of the combinatorial properties of the join operations and constructions obtained by actions. The categorical semi-rings used in this paper are also called bimonoidal categories [19]. Recent results on these categorical structures can be seen in [20,21]. Our paper gives interesting new applications of these structures to the study of combinatorial problems of augmented semi-simplicial finite sets.
In the algebraic context, we consider categories of augmented sequences of integers with a categorical ring structure that admits actions of certain augmented matrices. This action is defined by using the inverse matrix of the matrix associated with binomial transformations.
The sequential cardinal functor, denoted by | · | , applies a semi-simplicial finite set X to the sequence | X | n : = | X n | , where X n denotes the set of n-simplices of X and | X n | is its cardinal. The main results of this paper ensure, on the one hand, that the sequential cardinal functor is a homomorphism of categorical semi-rings (Theorem 4) and, on the other hand, that the sequential cardinal functor is compatible with action operators (Theorem 5, Corollary 6). These results allows us to easily count the number of simplices of a semi-simplicial finite set built through join and action operations.
A (augmented) simplicial complex is a family of subsets of a finite set F, Σ P ( F ) , such that, if σ Σ and σ σ ( σ σ ), then σ Σ . We note that a (augmented) simplicial complex Σ has a canonical structure of (augmented) semi-simplicial set Σ , where Σ k = { σ Σ | | σ | = k + 1 } , k 0 ( k 1 ). The f-vector of a (augmented) simplicial complex f = f ( Σ ) = ( f 0 , f n ) ( f = f ( Σ ) = ( f 1 , f 0 , f n ) ) of a (augmented) simplicial complex is given by f k = | Σ | k . Therefore, the notion of f-vector is obtained as a restriction of sequential cardinal (given in the present work) to augmented simplicial complexes. For a study of the main properties of f-vectors and their associated h-vectors, we refer the reader to [22] and for recent advances on the study of f-vectors: [23,24,25]. In our work, instead of studying realization problems, we prove new results for semi-simplicial finite sets by taking the sequential cardinal and obtaining new properties related to join and action operations on augmented semi-simplicial finite sets.
At the end of the work, we give a concrete example of calculations associated with constructions given by joins and actions induced by the dunce cap. These calculations are done by using the inverse matrix of augmented binomial numbers and the augmented matrix of triangular numbers (Corollaries 12 and 13).

2. Categorical Preliminaries: Presheaves and Monoidal Categories

2.1. Extension of a Small Category to a Cocomplete One Using Presheaves

We will denote as Sets the category of sets.
Given a small category C , we can consider its opposite category C o p . Then, the usual functor category Sets C o p has as objects functors X : C o p Sets and as arrows X X all natural transformations f : X X between such functors. The category Sets C op is usually called category of presheaves on C .
For a given object c in C , we can consider Y ( c ) , the presheaf on C defined as the contravariant Hom-functor Y ( c ) ( ) : = Hom C ( , c ) . This construction gives rise to the well-known Yoneda embedding
Y : C Sets C op , c Hom C ( , c ) .
By an embedding in this setting, we mean a full and faithful functor. Any presheaf which is isomorphic to a presheaf of the form Y ( c ) is called representable. The Yoneda lemma is well known, asserting that, for any presheaf, X, there exists a bijection between the natural transformations Y ( c ) X and the elements of X ( c ) :
Nat ( Y ( c ) , X ) X ( c ) , α α c ( 1 c ) .
Associated with X Sets C o p , we have the so-called category of elements of X, denoted by C X . Its objects are all pairs ( c , x ) , where c is an object in C and x X ( c ) ; a morphism ( c , x ) ( c , x ) in C X consists of a morphism φ : c c in C such that X ( φ ) ( x ) = x . Observe that we have a projection functor
π X : C X C , ( c , x ) c .
The proof of the following theorem can be found in [26].
Theorem 1.
Let Z : C E be a functor from a small category C to a cocomplete category E . Then, the functor S i n g Z : E Sets C o p given by
S i n g Z ( Y ) ( c ) : = H o m E ( Z ( c ) , Y )
admits a left adjoint functor L Z : Sets C o p E , defined for each presheaf X as
L Z ( X ) : = c o l i m ( C X π X C Z E )
The functor L Z preserves colimits and makes commutative the following diagramMathematics 10 00590 i001
In other words, L Z is an extension of Z that preserves colimits. Moreover L Z is, up to natural isomorphism, the only extension of Z preserving all colimits.
Remark 1.
Observe that, actually, we have a functor:
Sets C o p × E C E , ( X , Z ) L Z ( X ) .
As a particular case, taking E = Sets C o p and Z = Y the Yoneda embedding, we have that the functor S i n g Z : Sets C o p Sets C o p is naturally isomorphic to the identity functor (by the Yoneda lemma). Therefore, L Z must be also naturally isomorphic to the identity functor so we obtain the following corollary:
Corollary 1.
Every presheaf X on C is, up to natural isomorphism, a colimit of representable presheaves:
X c o l i m ( C X π X C Y Sets C o p ) .
We also observe that, as a consequence of Theorem 1 above with E = Sets C o p , one has certain suitable induced functors. Such functors will receive the name of action functors:
Definition 1.
The action functors are the following:
1.
( ) ˜ ( ) : Sets C o p × ( Sets C o p ) C Sets C o p
X ˜ Y : = L Y ( X ) .
2.
( ) ˜ ( ) : ( Sets C o p ) C × ( Sets C o p ) C ( Sets C o p ) C
( Y ˜ Z ) ( c ) : = Y ( c ) ˜ Z = L Z ( Y ( c ) ) .
Given X Sets C o p and Y , Z ( Sets C o p ) C , the object X ˜ Y Sets C o p is said to be the (right) action of Y on X. Similarly, Y ˜ Z ( Sets C o p ) C is said to be the (right) action of Z on Y.
Remark 2.
If X Sets C o p and Y , Z ( Sets C o p ) C , then it follows that
( X ˜ Y ) ˜ Z X ˜ ( Y ˜ Z ) .
This formula inspires the name given: “action functors”.

2.2. Monoidal Categories

In this subsection, we include the definition of monoidal category and that of functors between monoidal categories. For a more complete study on the notions and properties related to monoidal categories, we recommend reading the volumes by Niles Johnson and Donald Yau [19].
Definition 2.
A monoidal category is a category C equipped with:
(1) 
a functor : C × C C out of the product category of C with itself, called the tensor product,
(2) 
an object I called the unit object or tensor unit, and
(3) 
three natural isomorphisms:
The associator α, with components
α A , B , C : ( A B ) C A ( B C ) ;
The left unitor λ and the right unitor ρ, with components
λ A : I A A , ρ A : A I A ,
such that the following diagrams are commutative (coherence diagrams):
Pentagon identity:Mathematics 10 00590 i002
Triangle identity:Mathematics 10 00590 i003
By a strict monoidal category, we mean a monoidal category in which the natural isomorphisms α , λ , ρ are identities. In this case, the pentagon and triangle diagrams commute automatically.
Definition 3.
A symmetric monoidal category is a monoidal category ( C , , I ) having a natural transformation s (it is necessarily a natural isomorphism) called the braiding, with components s A , B : A B B A , making commutative the following kind of diagram:Mathematics 10 00590 i004
That is, s A , B 1 = s B , A . Moreover, we also demand that the braiding and the associator obey the hexagon identity:Mathematics 10 00590 i005
If, in addition, the monoidal category is strict, we will say that C is a strict symmetric monoidal category.
Definition 4.
A functor F : C C between monoidal categories is said to be 2-monoidal if it is equipped with a natural isomorphism Φ with components Φ A , B : F ( A ) F ( B ) F ( A B ) , such that the following diagram commutes for any objects A , B , C in C :Mathematics 10 00590 i006
We say that F is ( 2 , 0 ) -monoidal (or just monoidal in classical terminology) if, in addition, there exists an isomorphism ϕ : I F ( I ) satisfying that the following diagrams are commutative for any object A in C :Mathematics 10 00590 i007
Finally, a 2-monoidal (or ( 2 , 0 ) -monoidal) functor F : C C between symmetric monoidal categories is said to be symmetric if it satisfies the following commutative diagram, for any objects A , B in C :Mathematics 10 00590 i008
Remark 3.
In this paper, we use the terminology of categorical semi-ring for the notion of a symmetric bimonoidal category given in Definition 2.1.1 in [27], see also [19,28]. Moreover, some of the examples we are studying are a particular case that has the structure of a distributive symmetric monoidal category given in Definition 2.3.1 in [19]. For general information about monoidal categories, we refer the reader to [29,30,31]. Some interesting relations between monoidal categories and classifying spaces are given in [32] and, for new advances in the study of monoidal categories, you can see [33,34,35].
In the following paragraphs, we include the notion of a free strict monoidal category generated by a category.
For any given category C , the free monoidal category over C , denoted as Free ( C ) , is given as follows:
  • Its objects are finite sequences ( A 1 , , A n ) of objects in C . The empty sequence is also considered, and it is taken as the unit object I.
  • Consider two objects ( A 1 , , A m ) and ( B 1 , , B n ) in Free ( C ) . If m = n , then a morphism ( A 1 , , A n ) f ( B 1 , , B n ) consists of a sequence f = ( f 1 , . . . , f n ) where f i : A i B i is a morphism in C , for all i { 1 , . . . , n } . If n m , then there are no morphisms between ( A 1 , , A m ) and ( B 1 , , B n ) .
The tensor product of two finite sequences A = ( A 1 , , A m ) and B = ( B 1 , , B n ) is defined as their concatenation
A B : = ( A 1 , A m , B 1 , B n )
Analogously, the tensor product of two morphisms in Free ( C ) is given by the corresponding concatenation of morphisms in C . One can straightforwardly check that Free ( C ) is a strict monoidal category. In addition, observe that we have a canonical functor
i n : C Free ( C ) ,
which is, actually, a full embedding.
Any monoidal category that is isomorphic (in the monoidal sense) to a free monoidal category will be also called free monoidal category.
The free monoidal category Free ( C ) has the following universal property:
Proposition 1.
Let F : C D be a functor between a category C and a strict monoidal category D = ( D , D , I D ) . Then, there exists a ( 2 , 0 ) -monoidal functor, which is unique up to isomorphism, making commutative the following triangle:Mathematics 10 00590 i009
Proof. 
The functor is defined as ext ( F ) ( I ) : = I D and ext ( F ) ( A ) : = F ( A ) , for every object A in C . In addition, ext ( F ) ( A 1 , A 2 ) : = F ( A 1 ) D F ( A 2 ) for every object ( A 1 , A 2 ) of length 2. Now, if ext ( F ) is defined for sequences of objects of length n 1 , then we may inductively define
ext ( F ) ( A 1 , , A n ) : = ext ( F ) ( A 1 , . . . , A n 1 ) D F ( A n ) .
F is similarly defined for morphisms. The rest of the proof is lengthy but straightforward. □
Remark 4.
In the context of monoidal categories, it is interesting to take into account the following result, whose proof can be found in [36]:
MacLane’s Theorem.Given a monoidal category C , there exist a strict monoidal category C together with a monoidal equivalence F : C C . Similarly, given a braided (resp. symmetric) monoidal category C , there exist a strict braided (resp. symmetric) monoidal category C with a braided (resp. symmetric) monoidal equivalence F : C C .

2.3. Extending Monoidal Structures to Presheaves

Consider C = ( C , , I ) a small monoidal category. We will see that the monoidal structure on C can be extended to the category of presheaves Sets C o p . Indeed, first of all, observe that we have a diagram given by two rectangles Mathematics 10 00590 i010 where × ¯ : Sets C o p × Sets C o p Sets ( C × C ) o p is the natural functor induced by the product of sets: ( X × ¯ Y ) ( c , c ) : = X ( c ) × Y ( c ) ; and the functor L Y is the colimit-preserving extension of the composite functor Z : = Y : C × C Sets C o p given after using Theorem 1. Composing these two rectangles and denoting as ˜ the composite L Y × ¯ , we obtain a commutative diagram: Mathematics 10 00590 i011
Moreover, we can also consider the Yoneda object I ˜ : = Y ( I ) .
Theorem 2. 
( Sets C o p , ˜ , I ˜ ) is a monoidal category and the Yoneda embedding, Y : ( C , , I ) ( Sets C o p , ˜ , I ˜ ) , is ( 2 , 0 ) -monoidal.
Proof. 
In order to prove that ( Sets C o p , ˜ , I ˜ ) is a monoidal category one has just to take into account that any presheaf on C is naturally isomorphic to a colimit of representable presheaves (see Corollary 1) and that ( C , , I ) is monoidal. We leave the details to the reader. The Yoneda embedding is ( 2 , 0 ) -monoidal by the above commutative diagram relating ⊗ and ˜ ; moreover, I ˜ = Y ( I ) by definition. □
Now, we want to extend Theorem 1 for the special case E = Sets C o p when we consider monoidal structures. In order to do this, we need some previous results. Assume I and J are small categories and X : I Sets , Y : J Sets functors. Then, the existence of a natural isomorphism is well known:
colim i I X i × colim j J Y j colim ( i , j ) I × J ( X i × Y j ) .
By how the functor × ¯ : Sets C o p × Sets C o p Sets ( C × C ) o p is defined, it is straightforward to check that this property also holds when we have functors X : I Sets C o p and Y : J Sets C o p :
( colim i I X i ) × ¯ ( colim j J Y j ) colim ( i , j ) I × J ( X i × ¯ Y j ) .
Indeed, for any object ( c , c ) in the product category C × C , we have
[ ( colim i I X i ) × ¯ ( colim j J Y j ) ] ( c , c ) ( colim i I X i ) ( c ) × ( colim j J Y j ) ( c ) c o l i m i I X i ( c ) × c o l i m j J Y j ( c ) c o l i m ( i , j ) I × J ( X i ( c ) × Y j ( c ) ) c o l i m ( i , j ) I × J ( ( X i × ¯ Y j ) ( c , c ) ) [ c o l i m ( i , j ) I × J ( ( X i × ¯ Y j ) ] ( c , c ) .
For more results related to Theorem 2, we refer the reader to [37,38].
Taking into account this latter natural isomorphism, we have the following result:
Proposition 2.
Consider I , J small categories and functors X : I Sets C o p , Y : J Sets C o p . Then, there exists a natural isomorphism
( colim i I X i ) ˜ ( colim j J Y j ) colim ( i , j ) I × J ( X i ˜ Y j ) .
Proof. 
Considering the previous comments and taking into account that the functor L Y : Sets ( C × C ) o p Sets C o p preserves colimits, we have:
( colim i I X i ) ˜ ( colim j J Y j ) = L Y ( ( colim i I X i ) × ¯ ( colim j J Y j ) ) L Y ( colim ( i , j ) I × J ( X i × ¯ Y j ) ) colim ( i , j ) I × J ( L Y ( X i × ¯ Y j ) ) colim ( i , j ) I × J ( X i ˜ Y j ) .
Remember that, by using Theorem 1 when E = Sets C o p , for any given functor Z : C Sets C o p , there exists a colimit preserving functor L Z : Sets C o p Sets C o p such that L Z Y = Z . When Z is ( 2 , 0 ) -monoidal, we can say more about L Z .
Theorem 3.
Let Z : C Sets C o p be a ( 2 , 0 ) -monoidal functor. Then, the colimit-preserving functor L Z : Sets C o p Sets C o p , which makes commutative the diagramMathematics 10 00590 i012is ( 2 , 0 ) -monoidal. Moreover, up to isomorphism, it is the unique colimit preserving functor making this diagram commutative.
Proof. 
Consider X and Y presheaves over C . We know by Corollary 1 that, up to natural isomorphism, any presheaf is the colimit of representable presheaves. Therefore, we can suppose that
X colim i I Y ( c i ) and Y colim j J Y ( c j ) .
Therefore,
L Z ( X ˜ Y ) L Z ( ( colim i I Y ( c i ) ) ˜ ( colim j J Y ( c j ) ) ) L Z ( colim ( i , j ) I × J ( Y ( c i ) ˜ Y ( c j ) ) ) colim ( i , j ) I × J L Z ( Y ( c i ) ˜ Y ( c j ) ) colim ( i , j ) I × J L Z ( Y ( c i c j ) ) colim ( i , j ) I × J Z ( c i c j ) colim ( i , j ) I × J ( Z ( c i ) ˜ Z ( c j ) ) ( colim i I Z ( c i ) ) ˜ ( colim j J Z ( c j ) ) ( colim i I L Z ( Y ( c i ) ) ) ˜ ( colim j J L Z ( Y ( c j ) ) ) L Z ( colim i I Y ( c i ) ) ˜ L Z ( colim j J Y ( c j ) ) L Z ( X ) ˜ L Z ( Y ) .
Moreover, L Z ( I ˜ ) = L Z ( Y ( I ) ) = Z ( I ) I ˜ . Checking that the coherence diagrams are indeed commutative is lengthy but straightforward. □
Remark 5.
Observe that Theorem 3 above can be easily generalized for any ( 2 , 0 ) -monoidal functor Z : C E , where E = ( E , E , I E ) is a monoidal cocomplete category satisfying the additional condition that, for any two diagrams X : I E , Y : J E , there exists a natural isomorphism
( colim i I X i ) E ( colim j J Y j ) colim ( i , j ) I × J ( X i E Y j ) .
We have an extension functor L Z : Sets C o p E that is ( 2 , 0 ) -monoidal. Moreover, up to isomorphism, L Z is the unique colimit preserving functor making the following diagram commutativeMathematics 10 00590 i013

3. Augmented Semi-Simplicial Sets

In this section, we will deal with the combinatorial objects we are interested in for this work, the augmented semi-simplicial sets. As we are about to see, the category of augmented semi-simplicial sets is defined as the category of presheaves on a certain small category.

3.1. Basic Notions and Results

Consider the small category Γ whose objects are non-empty totally ordered sets [ p ] = { 0 < < p } for p 0 and whose morphisms are the strictly increasing maps [ p ] [ q ] . We can add the empty set = [ 1 ] to this category together with all the strictly increasing maps. The new augmented category will be denoted by Γ + .
We can consider Sets Γ + o p and Sets Γ + , the presheaf categories on Γ + and on Γ + o p , respectively. Taking E = Sets Γ + o p , C = Γ + , and considering the notation X ˜ Y for L Y ( X ) given in Definition 1 we have the following action functors:
Sets Γ + o p × ( Sets Γ + o p ) Γ + Sets Γ + o p , ( X , Y ) X ˜ Y ,
( Sets Γ + o p ) Γ + × ( Sets Γ + o p ) Γ + ( Sets Γ + o p ) Γ + , ( Y , Z ) Y ˜ Z .
We obviously have the corresponding Yoneda embeddings:
Y : Γ + Sets Γ + o p , Y o p : Γ + o p Sets Γ + .
For any object [ n ] in Γ + , we will denote as Γ + [ n ] the representable presheaf
Γ + [ n ] : = Y ( [ n ] ) = Hom Γ + ( , [ n ] ) Sets Γ + o p .
Analogously, we will consider the notation
Γ + o p [ n ] : = Y o p ( [ n ] ) = Hom Γ + ( [ n ] , ) Sets Γ + .
Definition 5.
Any presheaf on Γ +
X : Γ + o p Sets
will be called augmented semi-simplicial set or Γ + o p -set. Analogously, any presheaf on Γ + o p , Z : Γ + Sets , will be called augmented co-semi-simplicial set or Γ + -set.
We point out that giving an augmented semi-simplicial set X Sets Γ + o p is equivalent to giving a collection of sets { X n } n 1 together with a collection of set maps d i n : X n X n 1 ( n 0 and 0 i n ) satisfying
d i n d j n + 1 = d j 1 n d i n + 1 , i f i < j .
Moreover, giving an arrow f : X X ¯ in Sets Γ + o p (i.e., a natural transformation) is equivalent to giving a collection of set maps { f n : X n X ¯ n } n 1 such that
f n 1 d i n = d ¯ i n 1 f n ,
for n 0 and 0 i n .
There is a similar description for the category of augmented co-semi-simplicial sets by just reversing the arrows in the above representation.
In this work, we also consider the subcategory of finite sets Sets fin and the corresponding category of presheaves ( Sets fin ) Γ + o p .
A semi-simplicial set X Sets Γ + o p is said to have finite dimension if there is k N + such that X i = for every i > k . Given a non-empty finite dimensional semi-simplicial set X, we denote
dim ( X ) : = min { k | X i = for all i > k , i N + }
For the empty semi-simplicial set, we set dim ( ) : =
The subcategory of finite dimensional semi-simplicial sets is denoted by ( Sets Γ + o p ) fd . A semi-simplicial set X Sets Γ + o p is said to be finite if it has finite dimension and for every i N + , X i is a finite set. The subcategory of finite semi-simplicial sets is denoted by ( Sets Γ + o p ) fin .

3.2. Products and Coproducts

The usual product × and coproduct ⊔ of sets induce, in a natural way, two symmetric monoidal category structures in Sets with unit objects the singleton 1 and the empty set , respectively.
Given X , Y Sets Γ + op , we have the product X × Y and the coproduct X Y , which are straightforwardly induced by the corresponding coproduct and product in Sets . For any given set A Sets , we can consider the constant Γ + o p -set, Γ + A , defined as ( Γ + A ) k = A , for all k 1 . In particular, we are interested in the constant Γ + o p -sets, Γ + and Γ + 1 . It is plain to check the following natural isomorphisms:
X ( Y Z ) ( X Y ) Z ,
Γ + X X X Γ + ,
X × ( Y × Z ) ( X × Y ) × Z ,
Γ + 1 × X X X × Γ + 1 ,
X × Y Y × X , X Y Y X .
Note that the subcategory Sets fin is closed by finite sums and products and that , 1 are finite sets.
Therefore, we obtain the following result:
Proposition 3.
The sum and the product induce the following structures:
(i) 
( Sets Γ + o p , , Γ + ) and ( Sets Γ + o p , × , Γ + 1 ) are symmetric monoidal categories.
(ii) 
( ( Sets fin ) Γ + o p , , Γ + ) and ( ( Sets fin ) Γ + o p , × , Γ + 1 ) are symmetric monoidal categories.
(iii) 
the canonical inclusions
( ( Sets fin ) Γ + o p , , Γ + ) ( Sets Γ + o p , , Γ + )
( ( Sets fin ) Γ + o p , × , Γ + 1 ) ( Sets Γ + o p , × , Γ + 1 )
are ( 2 , 0 ) -monoidal functors.
Moreover, we also have the natural isomorphism relating the two tensor products:
X × ( Y Z ) ( X × Y ) ( X × Z ) .
We also observe that, for every [ n ] Γ + , one has the evaluation functor
e v n : Sets Γ + o p Sets , X X n
that preserves the (co)product, and the units. In particular, we can consider ( 2 , 0 ) -monoidal functors
e v n : ( Sets Γ + o p , , Γ + ) ( Sets , , ) ,
e v n : ( Sets Γ + o p , × , Γ + 1 ) ( Sets , × , 1 ) .
Remark 6.
It is obvious that Γ + ( Sets Γ + o p ) fin . Therefore, ( ( Sets Γ + o p ) fin , , Γ + ) is a symmetric monoidal category. On the other hand, Γ + 1 ( Sets Γ + o p ) fin , indicating that ( ( Sets Γ + o p ) fin , × , Γ + 1 ) is not a monoidal category. However, taking the full subcategory ( Sets Γ + o p ) fin { Γ + 1 } , one has that ( ( Sets Γ + o p ) fin { Γ + 1 } , × , Γ + 1 ) is a monoidal category.

3.3. Join, Cone, and Suspension Constructions in Augmented Semi-Simplicial Sets

Now, we will consider special constructions in Γ + o p -sets, or augmented semi-simplicial sets. We first observe that the small category Γ + has a symmetric monoidal category structure induced by the coproduct (actually, the ordinal sum)
[ p ] [ q ] : = [ p + q + 1 ]
having [ 1 ] as a unit object.
We define the join of Γ + o p -sets as the natural extension of this ordinal sum to Sets Γ + o p (see Section 2.3). We obtain the join functor
: Sets Γ + o p × Sets Γ + o p Sets Γ + o p .
It is immediate to check that, for any pair of Γ + o p -sets, X , Y , their join is given as
( X Y ) m : = p + q = m 1 X p × Y q
where p and q run over the integers that are greater than or equal to 1 . In particular, ( X Y ) 1 = X 1 × Y 1 , ( X Y ) 0 = ( X 1 × Y 0 ) ( X 0 × Y 1 ) , ( X Y ) 1 = ( X 1 × Y 1 ) ( X 0 × Y 0 ) ( X 1 × Y 1 ) and so on.
Moreover, the operators d i X Y of X Y are naturally defined from the operators d k X and d l Y of X and Y, respectively. The definition of ⊞ on morphisms is straightforward.
For any pair X , Y Sets Γ + o p , we have that the functors
X ( ) , ( ) Y : Sets Γ + o p Sets Γ + o p
preserve colimits. Furthermore, if X , Y , Z Sets Γ + o p , then there exist canonical natural isomorphisms
X ( Y Z ) ( X Y ) Z ,
Γ + [ 1 ] X X X Γ + [ 1 ] ,
X Y Y X .
Corollary 2.
The category Sets Γ + o p , together with the join functor ⊞, the unit object Γ + [ 1 ] , and the natural isomorphisms above, is a symmetric monoidal category. Moreover, the Yoneda embedding
Y : ( Γ + , , [ 1 ] ) ( Sets Γ + o p , , Γ + [ 1 ] )
is ( 2 , 0 ) -monoidal.
Proof. 
This is a direct consequence of Theorem 2. □
Remark 7.
Note that ( ( Sets Γ + o p ) fin , , Γ + [ 1 ] ) is a monoidal subcategory of ( ( Sets fin ) Γ + o p , , Γ + [ 1 ] ) , which is a monoidal subcategory of ( Sets Γ + o p , , Γ + [ 1 ] ) . If X , Y ( Sets Γ + o p ) fin , one has that:
dim ( X Y ) = ( dim ( X ) + 1 ) + ( dim ( Y ) + 1 ) 1 = dim ( X ) + dim ( Y ) + 1 .
Corollary 3.
Given n , m N + , the following isomorphism holds true
Γ + [ n ] Γ + [ m ] Γ + [ n + m + 1 ] .
We have the left-cone functor  C o n l : = Γ + [ 0 ] ( ) and the right-cone functor  C o n r : = ( ) Γ + [ 0 ] :
C o n l , C o n r : Sets Γ + o p Sets Γ + o p
C o n l ( X ) = Γ + [ 0 ] X ,
C o n r ( X ) = X Γ + [ 0 ] .
These functors make the following squares commutative: Mathematics 10 00590 i014
Corollary 4.
C o n l and C o n r satisfy
C o n l ( Γ + [ k ] ) = Γ + [ k + 1 ] = C o n r ( Γ + [ k ] )
for all k 1 .
Now, consider the augmented 0-sphere
S + [ 0 ] = Γ + [ 1 ] { ι 1 }
where ι 1 denotes the identity of [ 1 ] Γ + .
Then, as a particular case of the join construction, and similarly to the case of the cones, we have the augmented left-suspension functor S u s l = S + [ 0 ] ( ) and the augmented right-suspension functor S u s r = ( ) S + [ 0 ] (see Figure 1, Figure 2):
S u s l , S u s r : Sets Γ + o p Sets Γ + o p
S u s l ( X ) = S + [ 0 ] X
S u s r ( X ) = X S + [ 0 ]

3.4. Action Functors and Triangle Products

We can consider Sets Γ + o p and Sets Γ + , the presheaf categories on Γ + and Γ + o p , respectively. Remember that taking E = Sets Γ + o p , C = Γ + , and, considering the notation X ˜ Y given in Definition 1, we have the action functors:
Sets Γ + o p × ( Sets Γ + o p ) Γ + Sets Γ + o p , ( X , Y ) X ˜ Y
( Sets Γ + o p ) Γ + × ( Sets Γ + o p ) Γ + ( Sets Γ + o p ) Γ + , ( Y , Z ) Y ˜ Z
We observe that the cylinder and the barycentric subdivision of a semi-simplicial set can be obtained by using action functors and some particular co-semi-simplical objects Z ( Sets Γ + o p ) Γ + .
Remark 8.
If Γ + | [ 1 ] , [ 0 ] denotes the full subcategory of Γ + whose objects are [ 1 ] and [ 0 ] , then it is plain to check that, up to isomorphism, Γ + together with the coproduct (ordinal sum) is isomorphic to the free monoidal category over Γ + | [ 1 ] , [ 0 ] . This fact will be crucial for the next reasoning.
Let C be any category. Then, in order to consider a functor F : Γ + | [ 1 ] , [ 0 ] C , one has just to give a morphism f : X 1 X 0 in C . Moreover, if C = ( C , , I ) is monoidal, one can take the particular case X 1 I . The following result is a consequence of Remark 8 and Proposition 1.
Corollary 5.
Let C = ( C , , I ) be a monoidal category and F : Γ + | [ 1 ] , [ 0 ] C the functor given by a morphism f : I X . Then, there exists a ( 2 , 0 ) -monoidal functor extending F:Mathematics 10 00590 i015which is given by ext ( F ) [ n ] = 0 n X , ext ( F ) [ 1 ] = I and ext ( F ) ( [ 1 ] [ 0 ] ) = f . Moreover, ext ( F ) : ( Γ + , , [ 1 ] ) ( C , , I ) is, up to isomorphism, the unique ( 2 , 0 ) -monoidal extension of F .
Definition 6.
Let C = ( C , , I ) be a monoidal category, f : I X a morphism in C and F : Γ + | [ 1 ] , [ 0 ] C the functor induced by f. Then, the ( 2 , 0 ) -monoidal extension ext ( F ) : ( Γ + , , [ 1 ] ) ( C , , I ) is said to be the co-semi-simplicial extension of f and it is denoted by f X ( = ext ( F ) ). When there is a unique morphism f from I to X, we can use the notation X , deleting f in f X , and we say the X is the co-semi-simplicial extension of X.
Definition 7.
Let Z : Γ + Sets Γ + o p be a functor. If X Sets Γ + o p , then the object X ˜ Z is said to be the tilde-triangle product of X and Z. If f : Γ + [ 1 ] Y is a morphism in Sets Γ + o p , then X f Y : = X ˜ ( f Y ) is said to be the f-triangle product of X and Y. When there is a unique morphism f from Γ + [ 1 ] to Y, X f Y is simply denoted as X Y , and it is said to be the triangle product of X and Y.
The following result is a direct consequence of Theorem 3. We recall again that we are using the particular notation ( ) ˜ Z for the construction L Z ( ) :
Corollary 6.
Let Z : ( Γ + , , [ 1 ] ) ( Sets Γ + o p , , Γ + [ 1 ] ) be a ( 2 , 0 ) -monoidal functor. Then, the colimit-preserving functor ( ) ˜ Z : Sets Γ + o p Sets Γ + o p , which makes commutative the diagramMathematics 10 00590 i016
is ( 2 , 0 ) -monoidal. In particular, for all X , Y Sets Γ + o p , we have
( X Y ) ˜ Z ( X ˜ Z ) ( Y ˜ Z ) .
Moreover, up to isomorphism, it is the unique colimit preserving functor making this diagram commutative.
Remark 9.
The monoidal category ( ( Sets Γ + o p ) fin , , Γ + [ 1 ] ) is a monoidal subcategoy of ( ( Sets fin ) Γ + o p , , Γ + [ 1 ] ) which is, in turn, a monoidal subcategoy of ( Sets Γ + o p , , Γ + [ 1 ] ) . Observe that:
(i) 
if Z : ( Γ + , , [ 1 ] ) ( ( Sets fin ) Γ + o p , , Γ + [ 1 ] ) is a ( 2 , 0 ) -monoidal functor, then we obtain ( ) ˜ Z : ( Sets fin ) Γ + o p ( Sets fin ) Γ + o p a ( 2 , 0 ) -monoidal functor.
(ii) 
if Z : ( Γ + , , [ 1 ] ) ( ( Sets Γ + o p ) fin , , Γ + [ 1 ] ) is a ( 2 , 0 ) -monoidal functor, then we also obtain that ( ) ˜ Z : ( Sets Γ + o p ) fin ( Sets Γ + o p ) fin is a ( 2 , 0 ) -monoidal functor.

4. Augmented Integer Sequences and Matrices

Once we have analyzed some nice categorical and combinatorial properties of the category of augmented semi-simplicial sets, we study the second kind of mathematical objects in this work: augmented integer sequences (and matrices). The connection between these two different worlds will become clear in the next section through the cardinal functor.

4.1. The Categories Z , N + , Z and Some Functor Categories

We know that the set of integer numbers Z admits the structure of a discrete category. However, we can also consider it as a groupoid Z where the cardinal | Hom Z ( n , m ) | = 1 and the unique morphism from n to m can be denoted as m n : n m , for every pair of integers n , m . The sum of integers can be easily extended to a functor
+ : Z × Z Z , ( n , m ) n + m .
Taking + as a tensor product and 0 as a unit object, it is immediate to check that ( Z , + , 0 ) has the structure of a strict symmetric monoidal category and also of a strict categorical group.
Remark 10.
By a categorical group, we mean a monoidal category C which is also a groupoid and there exists a functor ( ) * : C C together with natural isomorphisms m, n and with components m A : A A * I , n A : A * A I satisfying that, for every object A, the following diagram is commutative:Mathematics 10 00590 i017
Roughly speaking, every object is invertible, up to natural isomorphism, with respect to the tensor product. In addition, if C is strict as a monoidal category and the natural isomorphisms m, n are identities, then we have that C is a strict categorical group.
It is plain to check that, given any small category J , the functor category Z J has an induced strict symmetric monoidal category structure (in addition, it is a strict symmetric categorical group). We shall consider ( Z J ) fin the full subcategory of Z J consisting of functors c : J Z such that there exists a finite set of objects F c satisfying that c ( j ) = 0 for all j J F c .
Now, if N denotes that the set of natural numbers (0 is also included as a natural number), take the discrete category N + = N { 1 } . This category can be considered as a subcategory of both Γ + and Γ + o p through the (inclusion) functor n [ n ] . Observe that the category N + is self-dual, that is, N + = N + o p .
Given a functor c ( Z N + o p ) fin with c 0 , we will call dimension of c the integer
dim ( c ) : = min { k | c i = 0 f o r a l l i > k , i N + }
and, for c = 0 , we take
dim ( c ) : =
Taking into account that N + o p is a discrete category, we have that the Yoneda embedding Y : N + Sets N + o p associated with N + (note that this functor is a restriction of the Yoneda functor Y : Γ + Sets Γ + o p ) induces, by applying the cardinal operator to the corresponding hom-sets, a functor y : N + Z N + o p satisfying y ( n ) ( j ) = δ n , j , for all n , j N + . Here, δ n , j denotes the Kronecker delta
δ n , j = 1 , n = j 0 , n j
Therefore, y ( n ) ( Z N + o p ) fin and dim ( y ( n ) ) = n , for all n N + . This way, we actually have a functor
y : N + ( Z N + o p ) fin .
In the following result, we may think that the monoidal category C is Z . Thus, we will keep the notation + for the tensor product and 0 for the unit.
Proposition 4.
Let ( C , + , 0 ) be a strict symmetric categorical group. If Z : N + C is any functor, then there exists, up to natural isomorphism, a unique ( 2 , 0 ) -monoidal functor
( ) · Z : ( Z N + o p ) fin C , c c · Z
making the following diagram commutative:Mathematics 10 00590 i018
Proof. 
Given any integer λ Z and any object a C , we can define, in a natural way, another object λ a C (similarly a λ ) given from the tensor product + in ( C , + , 0 ) and the existence of the inverse object. Namely,
λ a : = a + + a λ t i m e s , if λ > 0 0 , if λ = 0 a * + + a * λ t i m e s , if λ < 0
Now, consider a functor c ( Z N + o p ) fin . If we denote c k = c ( k ) Z and Z k : = Z ( k ) C , then we define
( ( ) · Z ) ( c ) = c · Z : = k N + c k Z k ,
which is well defined since it is a finite sum. Note that, if c 0 , we have
( ( ) · Z ) ( c ) = c · Z = k = 1 dim ( c ) c k Z k .
In addition, ( ) · Z is accordingly defined for morphisms so that we obtain a functor. A straightforward inspection proves that such a functor makes the diagram commutative, and it is ( 2 , 0 ) -monoidal. Moreover, it is unique up to natural isomorphism, satisfying these properties. □
Remark 11.
We point out that the functor
( ) · Z : ( ( Z N + o p ) fin , + , 0 ) ( C , + , 0 )
is always ( 2 , 0 ) -monoidal regardless of whether the functor Z is ( 2 , 0 ) -monoidal or not. This means that ( ( Z N + o p ) fin , + , 0 ) is the free (strict) symmetric categorical group in the discrete category N + .
Remark 12.
We have a dual version of Proposition 4. If we take a functor Z : N + o p C , then there exists, up to natural isomorphism, a unique ( 2 , 0 ) -monoidal functor Z · ( ) : ( Z N + ) fin C , c Z · c , which is an extension of Z.
Definition 8.
An augmented integer sequence is a functor
a : N + o p Z .
More generally, given any category C , we call augmented sequence in C any functor a : N + o p C . We will denote an augmented sequence a by means of a row matrix
a = ( a 1 a 0 a 1 a 2 ) .
However, in some cases, this row matrix will be denoted by (using commas): a = ( a 1 , a 0 , a 1 , a 2 , ) .
Analogously, an augmented integer co-sequence is a functor b : N + Z . More generally, for a given category C , an augmented co-sequence in C is a functor b : N + C . We will denote an augmented co-sequence b by means of a column matrix
b = b 1 b 0 b 1
or b = ( b 1 b 0 b 1 ) T , where T denotes the transposition operator.
Remark 13.
Observe that, in the definition above, we have given two different names to the same mathematical object (remember that N + is self-dual). Nevertheless, associated with each name, we are using a different notation, which will be crucial when we consider matrix products later on.
Definition 9.
An augmented integer matrix is a functor U : N + × N + o p Z . In general, given a category C , an augmented matrix with entries in C is just a functor U : N + × N + o p C . An augmented matrix U will be denoted by its usual form
U = U 1 , 1 U 1 , 0 U 1 , 1 U 0 , 1 U 0 , 0 U 0 , 1 U 1 , 1 U 1 , 0 U 1 , 1
Remark 14.
For any given categories A , B , C , there are canonical isomorphisms A × B B × A and C A × B ( C A ) B . Therefore, we have induced isomorphisms
( C N + ) N + o p C N + × N + o p C N + o p × N + ( C N + o p ) N + .
As a consequence, any augmented matrix U : N + × N + o p C may be considered as an object in any of the categories above.
Definition 10.
Let ( C , + , 0 ) be a strict symmetric categorical group. The following functors will be called dot-products:
( ) · ( ) : ( Z N + o p ) fin × C N + C , ( c , Z ) c · Z : = k N + c k Z k
( ) · ( ) : C N + o p × ( Z N + ) fin C , ( Y , b ) Y · b : = k N + Y k b k
Remark 15.
If ( C , + , 0 ) is a strict symmetric categorical group and we consider the subcategory ( C N + ) fin of those functors Z : N + C satisfying that there is k N + with Z l = 0 for l k ( ( C N + o p ) fin is analogously defined), then we also have natural dot-products:
( ) · ( ) : Z N + o p × ( C N + ) fin C , ( c , Z ) c · Z : = k N + c k Z k
( ) · ( ) : ( C N + o p ) fin × Z N + C , ( Y , b ) Y · b : = k N + Y k b k
In this case, the functors ( ) · Z : ( Z N + o p , + , 0 ) ( C , + , 0 ) , Y · ( ) : ( Z N + o p , + , 0 ) ( C , + , 0 ) are also ( 2 , 0 ) -monoidal.

4.2. Multiplication (Dot-Product) of Augmented Matrices

Now, we see how matrix multiplication is induced by the categorical group structure. Consider ( C , + , 0 ) = ( Z , + , 0 ) ; if a ( Z N + o p ) fin and b : N + C is any functor, then we have that they are of the form
a = ( a 1 , a 0 , a 1 , a n , 0 , 0 , 0 , ) and b = ( b 1 , b 0 , b 1 , b 2 , b 3 , ) T
Therefore, a · b = i = 1 + a i b i is well defined and we have an induced bifunctor
( ) · ( ) : ( Z N + o p ) fin × Z N + Z , ( a , b ) a · b
Similarly, we have a bifunctor
( ) · ( ) : Z N + o p × ( Z N + ) fin Z , ( c , d ) c · d .
Taking into account the transposition isomorphism ( ) T : Z N + o p Z N + , we have that the composition induced by the identity on the first variable and the transposition on the second variable induces the scalar (or inner) product:
, : ( Z N + o p ) fin × ( Z N + o p ) fin Z .
Namely, if a = ( a 1 , a 0 , a 1 , a n , 0 ) and b = ( b 1 , b 0 , b 1 , b m , 0 ) , then
a , b = a · b T = i = 1 min { n , m } a i b i .
It is easy to check that one has the following canonical extended bifunctors of the dot-product:
( ) · ( ) : ( Z N + o p ) fin × ( Z N + o p ) N + Z N + o p , ( a , B ) a · B ,
( ) · ( ) : Z N + o p × ( ( Z N + ) fin ) N + o p Z N + o p , ( a , B ) a · B ,
( ) · ( ) : ( Z N + o p ) N + × ( Z N + ) fin Z N + , ( A , b ) A · b ,
( ) · ( ) : ( ( Z N + o p ) fin ) N + × Z N + Z N + , ( A , b ) A · b ,
( a · B ) j = k N + a k B k , j , ( A · b ) i = k N + A i , k b k .
( ) · ( ) : ( ( Z N + o p ) fin ) N + × ( Z N + ) N + o p Z N + N + o p , ( A , B ) A · B ,
( ) · ( ) : ( Z N + o p ) N + × ( Z N + ) fin N + o p ( Z N + o p ) N + , ( A , B ) A · B ,
( A · B ) i , j = k N + A i , k B k , j .

4.3. Join of Numerical Augmented Sequences: Cone and Suspension

We note that Z N + o p has the structure of a ring ( Z N + o p , + , × ) , which is induced by the ring structure of ( Z , + , × ) by pointwise operation. That is, for all a , b Z N + o p , their sum and product are given as
( a + b ) i = a i + b i , ( a × b ) i = a i × b i , i N + .
For a , b Z , we will also use the notation a × b = a b .
However, we may consider a new symmetric monoidal structure on Z N + o p . This is given by the join product:
Definition 11.
The join product of a , b Z N + o p , denoted as a b , is given by the following formula:
( a b ) m : = p + q = m 1 a p b q , p , q N + .
In this case, the unit object is given as 1 1 where ( 1 1 ) i = δ 1 , i is the Kronecker delta. In this work, for k N + , 1 k will denote the augmented sequence given by ( 1 k ) i = δ k , i .
Proposition 5.
The category Z N + o p equipped with the join product ⊞ and the unit object 1 1 has the structure of a strict symmetric monoidal category. Moreover, the induced functor y : ( N + , , [ 1 ] ) ( Z N + o p , , 1 1 ) is ( 2 , 0 ) -monoidal.
Remark 16.
It is an obvious fact that ( ( Z N + o p ) fin , , 1 1 ) is a monoidal subcategory of ( Z N + o p , , 1 1 ) . If a , b ( Z N + o p ) fin , then, by our definition of dimension, one has:
dim ( a b ) = ( dim ( a ) + 1 ) + ( dim ( b ) + 1 ) 1 = dim ( a ) + dim ( b ) + 1 .
If a , b Z N + o p are fixed, then we easily obtain functors
a ( ) , ( ) b : Z N + o p Z N + o p
given by c a c and c c b , respectively.
Now, for each k Z , we define an operator in the category Z N + o p (actually, a functor)
D k : Z N + o p Z N + o p , c D k ( c )
as follows: given c Z N + o p and i N + ,
  • If k 0 , then ( D k ( c ) ) i = c i + k ,
  • If k 0 , then:
    ( D k ( c ) ) i = c i + k , i f i + k 1 , 0 , i f i + k < 1 .
Definition 12.
For a given b Z N + o p , we define R ( b ) ( Z N + ) fin N + o p , the shifting of b, by the formula ( R ( b ) ) i = D ( i + 1 ) ( b ) , for all i N + . We may also see it as the matrix
R ( b ) = D 0 ( b ) D 1 ( b ) D 2 ( b )
This construction naturally gives rise to a functor
R : Z N + o p ( Z N + ) fin N + o p
which satisfies, in a natural way, the commutativity given in the next result.
Proposition 6.
The diagramMathematics 10 00590 i019
is commutative. In other words, given a , b Z N + o p , we have the equalities
a b = a · R ( b ) = b · R ( a ) .
Now, we present an interesting construction: the cone of a sequence.
Definition 13.
We define the cone of c Z N + o p as the sequence c o n ( c ) Z N + o p defined as c o n ( c ) : = c + D 1 ( c ) . That is to say,
c o n ( c ) i = c i + c i 1 , if i 0 c 1 , if i = 1 .
Manifestly, we obtain the cone functor  c o n : Z N + o p Z N + o p . Taking into account the results above, the next consequence is straightforward to check.
Proposition 7.
Consider c = c o n ( 1 1 ) = 1 1 + 1 0 Z N + o p . Then, the cone functor is related to the join and the dot product through the following formula:
c o n ( b ) = c b = b c = b · R ( c ) .
Remark 17.
Iterating the cone functor and bearing in mind the identity c o n ( b ) = b · R ( c ) , which is given in the result above, we obtain that c o n k ( b ) = b · ( R ( c ) ) k ( k 0 ). This way, c o n k ( b ) is completely determined by the sequence of matrices ( R ( c ) ) 0 = id , ( R ( c ) ) 1 = R ( c ) , ( R ( c ) ) 2 , …
R ( c ) = 1 1 0 0 0 0 1 1 0 0 0 0 1 1 0 , ( R ( c ) ) 2 = 1 2 1 0 0 0 1 2 1 0 0 0 1 2 1 ,
It is also simple to check that the cone functor has an inverse functor
c o n 1 : Z N + o p Z N + o p , c o n 1 ( b ) = b · R ( c ) 1 ,
where
R ( c ) 1 = 1 1 1 1 1 1 1 0 1 1 1 1 1 1 0 0 1 1 1 1 1 0 0 0 1 1 1 1 0 0 0 0 1 1 1 0 0 0 0 0 1 1 0 0 0 0 0 0 1
is the inverse of R ( c ) .
Consequently, the inverse of the cone functor may be expressed by the equation
( c o n 1 ( b ) ) k = i = 1 k ( 1 ) k i b i
where b Z N + o p and k N + .
Next, we define the Euler q-characteristic of any c ( Z N + o p ) fin .
Definition 14.
Consider a sequence c ( Z N + o p ) fin and a rational number q Q . Then, if c 0 , the Euler q-characteristic of c is the rational number defined as
E q ( c ) = i = 1 dim ( c ) ( q ) i c i .
When c = 0 , we take E q ( c ) = 0 .
Remark 18.
If c 0 and q = 1 , then we obtain sum ( c ) , the sum of all elements of c :
E 1 ( c ) = i = 1 dim ( c ) c i = sum ( c ) .
When q = 1 , we have the Euler characteristic:
E 1 ( c ) = i = 1 dim ( c ) ( 1 ) i c i = E ( c ) ,
and, for q = 1 2 , we obtain
E 1 2 ( c ) = i = 1 dim ( c ) ( 1 ) i 2 i c i .
Remark 19.
We have that E 1 ( c o n ( c ) ) = 0 for c ( Z N + o p ) fin . Now, if ( Z N + o p ) fin , 1 denotes the full subcategory of ( Z N + o p ) fin consisting of those sequences c ( Z N + o p ) fin with Euler characteristics equal to zero, then the (restricted) cone functor c o n : ( Z N + o p ) fin ( Z N + o p ) fin , 1 is an isomorphism. Its inverse functor
c o n 1 : ( Z N + o p ) fin , 1 ( Z N + o p ) fin
can be given for b 0 by the expressions (see the formula above for the inverse ( c o n 1 ( b ) ) k )
( c o n 1 ( b ) ) k = i = k dim ( b ) 1 ( 1 ) i k b i + 1 = i = 1 k ( 1 ) i + k b i
since E 1 ( b ) = 0 .
Note that a finite augmented sequence not satisfying the Euler characteristic condition is the cone of an infinite-dimensional augmented sequence. For instance,
c o n ( ( 1 , 1 , 1 , 1 , 1 , 1 , ) ) = ( 1 , 0 , 0 , 0 , )
where the first sequence contains negative integers.
We are also interested in the suspension of a sequence.
Definition 15.
The suspension of a sequence c Z N + o p c is the sequence sus ( c ) Z N + o p defined as sus ( c ) : = c + 2 D 1 ( c ) . In other words,
( sus ( c ) ) i = c i + 2 c i 1 , i f i 0 c 1 , i f i = 1 .
There is an obvious induced suspension functor  sus : Z N + o p Z N + o p , which is straightforwardly related to the join and the dot product.
Proposition 8.
Consider s = sus ( 1 1 ) = 1 1 + 2 0 Z N + o p . Then, the suspension functor sus : Z N + o p Z N + o p is related to the join and the dot product through the formula
sus ( b ) = s b = b s = b · R ( s ) .
Remark 20.
Taking the iteration of the suspension functor and the relation given in the result above, we obtain that sus k ( b ) = b · ( R ( s ) ) k ( k 0 ). That is, as in the case of the cone, the iteration of the suspension is completely determined by the sequence of matrices ( R ( s ) ) 0 = id , ( R ( s ) ) 1 = R ( s ) , ( R ( s ) ) 2 , …
R ( s ) = 1 2 0 0 0 0 1 2 0 0 0 0 1 2 0 , ( R ( s ) ) 2 = 1 4 4 0 0 0 1 4 4 0 0 0 1 4 4 ,
The suspension functor has an inverse functor
sus 1 : Z N + o p Z N + o p , sus 1 ( b ) = b · ( R ( s ) ) 1 ,
where
( R ( s ) ) 1 = 1 2 4 8 16 32 64 0 1 2 4 8 16 32 0 0 1 2 4 8 16 0 0 0 1 2 4 8 0 0 0 0 1 2 4 0 0 0 0 0 1 2 0 0 0 0 0 0 1
Hence, one has
( sus 1 ( b ) ) k = i = 1 k ( 2 ) k i b i
for any b Z N + o p and k N + .
Remark 21.
We want to mention that E 1 2 ( sus ( c ) ) = 0 for any c ( Z N + o p ) fin . Consider ( Z N + o p ) fin , 1 2 the full subcategory of ( Z N + o p ) fin consisting of those sequences having a Euler 1 2 -characteristic equal to zero. Then, the (restricted) suspension functor sus : ( Z N + o p ) fin ( Z N + o p ) fin , 1 2 is an isomorphism. Taking into account that E 1 2 ( b ) = 0 , for b ( Z N + o p ) fin , 1 2 , the functor
sus 1 : ( Z N + o p ) fin , 1 2 ( Z N + o p ) fin
can also be expressed as
( sus 1 ( b ) ) k = i = 1 k ( 2 ) k i b i = i = k dim ( b ) 1 ( 1 ) i k ( 1 2 ) i k + 1 b i + 1 = i = k dim ( b ) 1 ( 1 ) i + k 2 k i 1 b i + 1
for b 0 .
Like the case of the cone functor, a finite augmented sequence not satisfying a Euler 1 2 -characteristic condition is the suspension of an infinite-dimensional augmented sequence. For instance,
sus ( ( 1 , 1 , 1 , 2 , 4 , 8 , 16 , , ( 2 ) n 2 , , ) ) = ( 1 , 3 , 3 , 0 , )
where the first sequence contains negative integers.

4.4. Actions of Augmented Matrices on Augmented Sequences of Integers

To finish this section, we consider actions of sequences and matrices. We first establish the augmented binomial matrix bin ( ( Z N + o p ) fin ) N + defined as
bin i , j = i + 1 j + 1 , i , j N +
and its inverse matrix bin 1 ( ( Z N + o p ) fin ) N + given as
bin i , j 1 = ( 1 ) i j i + 1 j + 1 , i , j N + .
Definition 16.
Given a sequence a ( Z N + o p ) fin and a matrix B ( Z N + o p ) N + , the action of B on a is defined by the formula
a ˜ B : = ( a · bin 1 ) · B .
The resulting sequence a ˜ B is also said to be the tilde-triangle product of a and B. This construction gives rise to an action functor
( ) ˜ ( ) : ( Z N + o p ) fin × ( Z N + o p ) N + Z N + o p .
We point out that we also have the identity a ˜ bin = ( a · bin 1 ) · bin = a .
Let N + | { 1 , 0 } denote the full subcategory of the discrete category N + whose objects are 1 and 0. Then, it is plain to check that, up to isomorphism, N + together with the coproduct
p q : = p + q + 1 ,
is isomorphic to the free monoidal category over N + | { 1 , 0 } .
If C is any category, then, in order to consider a functor F : N + | { 1 , 0 } C , it is only needed to give two objects X 1 , X 0 in C . Moreover, if C = ( C , , I ) is monoidal, one can consider the particular case X 1 I . The following result is a direct consequence of Proposition 1.
Corollary 7.
Let C = ( C , , I ) be a monoidal category and X C . Then, there exists a ( 2 , 0 ) -monoidal functor extending F : N + | { 1 , 0 } C , F ( 1 ) = I , F ( 0 ) = X :Mathematics 10 00590 i020which is given by ext ( F ) ( n ) = 0 n X , for n 0 , and ext ( F ) ( 1 ) = I . Moreover, ext ( F ) : ( N + , , 1 ) ( C , , I ) is, up to isomorphism, the unique ( 2 , 0 ) -monoidal extension of F .
Specializing C = ( C , , I ) = ( Z N + o p , , 1 1 ) and b Z N + o p , we obtain the notion of augmented matrix extension of b:
Definition 17.
Consider the functor F : N + | { 1 , 0 } Z N + o p , F ( 1 ) = 1 1 F ( 0 ) = b . The ( 2 , 0 ) -monoidal extension ext ( F ) : ( N + , , 1 ) ( Z N + o p , , 1 1 ) is said to be the augmented matrix extension of b, and it is denoted as
b = ext ( F ) ( Z N + o p ) N + .
Finally, the notion of augmented matrix extension will raise the one of the triangle product:
Definition 18.
Given sequences a ( Z N + o p ) fin and b Z N + o p ,
a b : = a ˜ ( b )
is said to be the triangle product of a and b.
Note that a b = a ˜ ( b ) = ( a · bin 1 ) · ( b ) Z N + o p .

5. Comparing Monoidal Categories Arising from Γ + op -Sets and Numerical Sequences

Now, we are ready to compare the category of augmented semi-simplicial finite sets and the category of augmented integer sequences. The key point is the sequential cardinal functor which applies every finite augmented semi-simplicial set to the sequence constituted by the cardinal of the set of n-simplices. This sequential cardinal functor preserves the corresponding monoidal structures. Moreover, as we will see, it preserves certain categorical semi-ring structures.

5.1. The Monoidal Categories ( ( Sets fin ) Γ + o p , , Γ + ) and ( Z N + o p , + , 0 ) as Well as ( ( Sets fin ) Γ + o p , × , Γ + 1 ) and ( Z N + o p , × , 1 )

Recall that Sets fin is the category of finite sets and maps between them. Given any functor X : Γ + o p Sets fin , we may consider the diagram Mathematics 10 00590 i021 where in denotes the inclusion functor and | | denotes the functor giving the cardinal of any finite set.
Definition 19.
The sequential cardinal of a Γ + o p - finite set, X ( Sets fin ) Γ + o p , is defined as the augmented sequence:
| X | : N + o p Z
given by the composite | X | : = | | X in . To put it another way,
| X | n : = | X n | , n N + .
We observe that there is an induced functor | | : ( Sets fin ) Γ + o p Z N + o p where, for morphisms f : X Y , is defined as | f | : = | Y | | X | ; that is, | f | n = | Y | n | X | n , n N + .
On the one hand, in Section 3.2, we have seen that ( ( Sets fin ) Γ + o p , , Γ + ) and ( ( Sets fin ) Γ + o p , × , Γ + 1 ) are monoidal categories. On the other hand, in Section 4.3, we have seen that the ring structure ( Z , + , × ) induces the ring structure ( Z N + o p , + , × ) and the monoidal structures ( Z N + o p , + , 0 ) , ( Z N + o p , × , 1 ) .
Proposition 9.
The functor | | : ( Sets fin ) Γ + o p Z N + o p preserves the monoidal structures induced by coproducts and products:
| | : ( ( Sets fin ) Γ + o p , , Γ + ) ( Z N + o p , + , 0 )
| | : ( ( Sets fin ) Γ + o p , × , Γ + 1 ) ( Z N + o p , × , 1 ) .
Proof. 
It is straightforward to check the identities:
| X Y | = | X | + | Y | , | X × Y | = | X | × | Y |
| Γ + | = 0 , | Γ + 1 | = 1
which are left to the reader. □
Definition 20.
Associated with the Γ + o p -sets, Γ + [ n ] and S + [ n 1 ] = Γ + [ n ] { ι n } , where ι n is the identity of [ n ] Γ + , we consider the sequential cardinals:
γ + [ n ] = | Γ + [ n ] | , s + [ n 1 ] = | S + [ n 1 ] | .
We note that γ + [ 0 ] = c and s + [ 0 ] = s
Remark 22.
For every n N + , the sequential cardinal γ + [ n ] applied to Γ + [ n ] is given by the binomial coefficients:
| Γ + [ n ] | = ( | Γ + [ n ] 1 | , | Γ + [ n ] 0 | , | Γ [ n ] 1 | , , | Γ + [ [ n ] n | , | | , | | , ) = n + 1 0 , n + 1 1 , n + 1 2 , , n + 1 n + 1 , 0 , 0 , .

5.2. The Monoidal Categories ( ( Sets fin ) Γ + o p , , Γ + [ 1 ] ) and ( Z N + o p , , 1 1 )

In this subsection, we consider ( ( Sets fin ) Γ + o p , , Γ + [ 1 ] ) , which is a monoidal subcategory of ( ( Sets ) Γ + o p , , Γ + [ 1 ] ) . The sequential cardinal functor preserves the monoidal structure:
Theorem 4.
The sequential cardinal functor
| · | : ( ( Sets fin ) Γ + o p , , Γ + [ 1 ] ) ( Z N + o p , , 1 1 )
is ( 2 , 0 ) -monoidal, that is, the following holds true:
| X Y | = | X | | Y | , | Γ + [ 1 ] | = 1 1
for all X , Y ( Sets fin ) Γ + o p .
Proof. 
From the join definition, we have that
( X Y ) m = p + q = m 1 X p × Y q ,
where 1 p and 1 q . Therefore, the equality | X Y | = | X | | Y | follows taking into account Definition 11. Namely:
| X Y | m = | ( X Y ) m | = | p + q = m 1 X p × Y q | = p + q = m 1 | X p × Y q | = p + q = m 1 | X | p × | Y | q = ( | X | | Y | ) m .
The cone functors, for semi-simplicial sets and for augmented sequences, are related through the sequential cardinal functor:
Proposition 10.
The following diagrams are commutative:Mathematics 10 00590 i022
Moreover, as γ + [ 0 ] = | Γ + [ 0 ] | = c , we have γ + [ n ] = | Γ + [ n ] | = n + 1 c (the ( n + 1 ) -fold join of c with itself).
Proof. 
By the definition of a left-cone functor, we have that
| Con l ( X ) | = | Γ + [ 0 ] X | = | Γ + [ 0 ] | | X | = c | X | = c o n ( | X | ) .
Here, we have used Theorem 4 and Proposition 7. The commutativity of the right diagram is analogously verified. The rest of the proof is straightforwardly taking into account the formula Γ + [ n ] Γ + [ m ] Γ + [ n + m + 1 ] and that | X Y | = | X | | Y | .
Definition 21.
Consider a finite semi-simplicial set X ( Sets Γ + o p ) fin and a rational number q Q . Then, the Euler q-characteristic of X is the rational number defined for X as
E q ( X ) = i = 1 dim ( X ) ( q ) i | X | i
and E q ( ) = 0 .
Corollary 8.
If X ( Sets Γ + o p ) fin is, up to isomorphism, the (left or right) cone of some Y ( Sets Γ + o p ) fin , then E 1 ( X ) = 0 and for k N + such that 1 k dim ( X ) , i = 1 k ( 1 ) k i | X | i 0 .
Proof. 
If X Con l ( Y ) , then | X | = | Con l ( Y ) | = c o n ( | Y | ) and therefore E 1 ( X ) = E 1 ( | X | ) = E 1 ( c o n ( | Y | ) ) = 0 (see Remark 19). Note also that | Y | = c o n 1 ( | X | ) and | Y | k 0 . By Remark 17, | Y | k = ( c o n 1 ( | X | ) ) k = i = 1 k ( 1 ) k i | X | i 0 . □
Note that the cardinal functor | · | : Sets fin Z induces a canonical functor | · | : ( ( Sets fin ) Γ + o p ) Γ + ( Z N + o p ) N , Z | Z | , where | Z | = | · | Z in is the composite
N + [ r ] in Γ + [ r ] ( . 4 ) Z ( Sets fin ) Γ + o p [ r ] ( . 7 ) | · | Z N + o p .
Definition 22.
The augmented Pascal matrix is defined as the augmented co-sequence given by the composite:
N + [ r ] in Γ + [ r ] ( . 4 ) Y ( Sets fin ) Γ + o p [ r ] ( . 7 ) | · | Z N + o p .
Note that | · | Y in = bin (given in Section 4.4).
Corollary 9.
The functor
| · | : ( ( Sets fin ) Γ + o p ) Γ + ( Z N + o p ) N
carries the Yoneda augmented semi-cosimplicial set Y : Γ + Sets Γ + o p , matricially represented as
Y = Γ + [ 1 ] Γ + [ 0 ]
to the augmented Pascal matrix, where each row is the cone of the previous one.
| Y | = | Γ + [ 1 ] | | Γ + [ 0 ] | = γ + [ 1 ] γ + [ 0 ] = bin
Remark 23.
Observe that iterating the cone construction to | Γ + [ 1 ] | = 1 1 generates, in a natural way, the well-known Pascal triangle:
1 0 1 2 3 4 5 6 γ + [ 1 ] = | Γ + [ 1 ] | 1 0 0 0 0 0 0 0 γ + [ 1 ] γ + [ 0 ] = | Γ + [ 0 ] | 1 1 0 0 0 0 0 0 c o n γ + [ 1 ] γ + [ 1 ] = | Γ + [ 1 ] | 1 2 1 0 0 0 0 0 c o n 2 γ + [ 1 ] γ + [ 2 ] = | Γ + [ 2 ] | 1 3 3 1 0 0 0 0 c o n 3 γ + [ 1 ] γ + [ 3 ] = | Γ + [ 3 ] | 1 4 6 4 1 0 0 0 c o n 4 γ + [ 1 ] γ + [ 4 ] = | Γ + [ 4 ] | 1 5 10 10 5 1 0 0 c o n 5 γ + [ 1 ] γ + [ 5 ] = | Γ + [ 5 ] | 1 6 15 20 15 6 1 0 c o n 6 γ + [ 1 ] γ + [ 6 ] = | Γ + [ 6 ] | 1 7 21 35 35 21 7 1 c o n 7 γ + [ 1 ]
The suspension functors for semi-simplicial sets and for augmented sequences of integers are related as follows:
Proposition 11.
The following diagrams are commutative:Mathematics 10 00590 i023
Moreover, | S + [ 0 ] | = s = s + [ 0 ] .
Below we have obtained, coming from S 0 = S + [ 0 ] , the iteration of the suspension construction:
1 0 1 2 3 4 5 | S 0 | 1 2 0 0 0 0 0 s | Sus l ( S 0 ) | 1 4 4 0 0 0 0 sus ( s ) | Sus l 2 ( S 0 ) | 1 6 12 8 0 0 0 sus 2 ( s ) | Sus l 3 ( S 0 ) | 1 8 24 32 16 0 0 sus 3 ( s ) | Sus l 4 ( S 0 ) | 1 10 40 80 80 32 0 sus 4 ( s ) | Sus l 5 ( S 0 ) | 1 12 60 160 240 192 64 sus 5 ( s )
For each n N + , we may consider an operator an n : Z N + o p Z N + o p , defined as
( an n ( c ) ) i = ( 1 δ n , i ) c i .
Note that s + [ n ] = an n + 1 ( γ + [ n + 1 ] ) . Therefore, one has:
1 0 1 2 3 4 5 s + [ 1 ] = | S + [ 1 ] | 1 0 0 0 0 0 0 an 0 γ + [ 0 ] s + [ 0 ] = | S + [ 0 ] | 1 2 0 0 0 0 0 an 1 γ + [ 1 ] s + [ 1 ] = | S + [ 1 ] | 1 3 3 0 0 0 0 an 2 γ + [ 2 ] s + [ 2 ] = | S + [ 2 ] | 1 4 6 4 0 0 0 an 3 γ + [ 3 ] s + [ 3 ] = | S + [ 3 ] | 1 5 10 10 5 0 0 an 4 γ + [ 4 ] s + [ 4 ] = | S + [ 4 ] | 1 6 15 20 15 6 0 an 5 γ + [ 5 ]
which is obtained by removing the first row and the principal diagonal in the augmented Pascal matrix.
For the suspension functor, the analogous of Corollary 8 is the following result:
Corollary 10.
Let X be a finite semi-simplicial set ( X ( Sets Γ + o p ) fin ). If X is the suspension of some Y ( Sets Γ + o p ) fin , then E 1 2 ( X ) = 0 and for k N + such that 1 k dim ( X ) , i = 1 k ( 2 ) k i | X | i 0 .

5.3. The Categorical Semi-Rings ( Sets Γ + o p , , , Γ + , Γ + [ 1 ] ) and ( Z N + o p , + , , 0 , 1 1 )

As we have earlier commented, in this paper, by a categorical semi-ring, we will mean a symmetric bimonoidal category. This is just a category C equipped with two symmetric monoidal category structures:
  • ( C , , 0 , ) the additive structure
  • ( C , , I ) the multiplicative structure
together with
(i) 
natural isomorphisms 0 A 0 A 0 , which are called left multiplicative zero and right multiplicative zero, respectively.
(ii) 
natural monomorphisms
A ( B C ) ( A B ) ( A C )
( A B ) C ( A C ) ( B C )
called the left distributivity morphism and the right distributivity morphism, respectively.
This structure must satisfy Laplaza’s axioms (see Definition 2.1.1 in [27] and [19,28]).
A functor F : C C between categorical semi-rings (or symmetric bimonoidal categories) is said to be a functor of categorical semi-rings if it is a symmetric bimonoidal functor, that is,
  • F is a symmetric ( 2 , 0 ) -monoidal functor (recall from Definition 4) from the additive structure of C to the additive structure of C .
  • F is a symmetric ( 2 , 0 ) -monoidal functor from the multiplicative structure of C to the multiplicative structure of C .
These are required to make the following two diagrams in C commutative for all objects A , B , C :
Multiplicative zero:Mathematics 10 00590 i024
Distributivity:Mathematics 10 00590 i025
The next result gives a functor of categorical semi-rings:
Proposition 12.
The sequential cardinal functor
| · | : ( ( Sets fin ) Γ + o p , , , Γ + , Γ + [ 1 ] ) ( Z N + o p , + , , 0 , 1 1 )
is a functor of categorical semi-rings such that the following diagram is commutativeMathematics 10 00590 i026
Proof. 
Consider the monoidal category ( Z N + o p , , 1 1 ) . The finite sequences 1 1 = γ + [ 1 ] = | Γ + [ 1 ] | , 1 1 + 1 0 = γ + [ 0 ] = | Γ + [ 0 ] | determine a unique morphism, γ + [ 1 ] γ + [ 0 ] , in Z N + o p . Applying Proposition 1, we obtain a (symmetric) ( 2 , 0 ) -monoidal functor ( Γ + , , [ 1 ] ) ( Z N + o p , , 1 1 ) given, up to isomorphism, by [ n ] γ + [ n ] Mathematics 10 00590 i027
Taking into account Remark 5, one has a commutative diagram Mathematics 10 00590 i028 where ( ) ˜ γ + : ( ( Sets fin ) Γ + o p , , Γ + [ 1 ] ) ( Z N + o p , , 1 1 ) is a ( 2 , 0 ) -monoidal functor.
Since, by Theorem 4, we also have the (symmetric) ( 2 , 0 ) -monoidal functor
| · | : ( ( Sets fin ) Γ + o p , , Γ + [ 1 ] ) ( Z N + o p , , 1 1 )
such that | Y ( [ n ] ) | = γ + ( n ) , it follows that ( ) ˜ γ + = | · | . As it preserves coproducts it is, actually, a functor of categorical semi-rings:
| · | : ( ( Sets fin ) Γ + o p , , , Γ + , Γ + [ 1 ] ) ( Z N + o p , + , , 0 , 1 1 )
We leave the rest of the proof to the reader. □

5.4. Comparing Actions and Triangle Products

To finish this section, we establish an important result asserting that, under mild restrictions, the sequential cardinal functor carries the action to the triangle product. We need a previous definition.
Definition 23.
A functor Z : Γ + Sets Γ + o p is said to be regular if Z ( φ ) is injective (on each dimension) for every morphism φ in Γ + . We shall denote as ( Sets Γ + o p ) reg Γ + the full subcategory of ( Sets Γ + o p ) Γ + consisting of regular functors.
Theorem 5.
The following diagram is commutative:Mathematics 10 00590 i029
In other words, if X ( Sets fin ) Γ + o p and Z ( ( Sets fin ) Γ + o p ) reg , then
| X ˜ Z | = | X | ˜ | Z | .
Moreover, if we specialize Z : = Γ + [ ] , then | X ˜ Γ + [ ] | = | X | ˜ | Γ + [ ] | = | X | .
Proof. 
If Z : Γ + Sets Γ + o p is regular, then we consider
Z ˘ ( [ 1 ] ) : = Z ( [ 1 ] ) Z ˘ ( [ p ] ) : = Z ( [ p ] ) ( i = 0 p ( φ i ) * ( Z ( [ p 1 ] ) ) , p 0
From this construction, one can easily check that
| Z ( [ p ] ) | = k = 1 p p + 1 k + 1 | Z ˘ ( [ k ] ) | ,
where | Z ( [ p ] ) | , | Z ˘ ( [ k ] ) | Z N + o p . Therefore, we have the following product of matrices:
| Z | = bin · | Z ˘ | .
Finally, from the definition of X ˜ Z , we obtain
| X ˜ Z | = | X | · | Z ˘ | = | X | · ( bin 1 · | Z | ) = | X | ˜ | Z | .
  □

6. Example: Functors and Triangle-Products Induced by the Dunce Cap

To finish our study, we provide a striking result coming from the example of the dunce cap.

6.1. Augmented Triangular Numbers

Definition 24.
Let d 0 be an integer. For n 1 , we consider T n d , the n-th triangular number of dimension d, inductively defined as
T n 0 = 1 , T n d = i = 1 n T i d 1 , d 1 .
We refer the reader to Theorem 1.3 in [13] for a proof of the following result ( d 1 , n 1 ):
T n d = 1 d ! n ( n + 1 ) ( n + d 1 ) .
We complete the matrix of triangular numbers for dimension −1 to obtain the augmented matrix tri ( Z N + o p ) N + of triangular numbers tri i , j , i , j N +
tri i , j = δ 1 , j , if i = 1 T j + 2 i , if i 0 .
Note that, for i 1 , j 1 , one has that tri i , j = T j + 2 i = ( j + 2 ) ( j + 3 ) ( j + 1 + i ) i ! = j + 1 + i i = bin i + j , i 1 . Then, it is easy to check that, for i , j N + , i 0 , we also have:
tri i , j = bin i + j , i 1 .
We give some values of the matrix tri:
tri i j 1 0 1 2 3 4 5 6 6 8 1 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 2 3 4 5 6 7 8 9 10 2 1 3 6 10 15 21 28 36 45 55 3 1 4 10 20 35 56 84 120 165 220 4 1 5 15 35 70 126 210 330 495 715 5 1 6 21 56 126 252 462 792 1287 2002 6 1 7 28 84 210 462 924 1716 3003 5005 7 1 8 36 120 330 792 1716 3432 6435 11400 8 1 9 45 165 495 1287 3003 6435 12870 14400

6.2. Triangular Numbers and Co-Semi-Simplicial Object Induced by the Dunce Cap

Associated with the dunce cap Γ + 1 , which is the final object in the category Sets Γ + o p , we can consider the unique augmented semi-simplicial map
f : Γ + [ 1 ] Γ + 1 .
Corollary 11.
Let Γ ˜ + 1 : Γ + | [ 1 ] , [ 0 ] Sets Γ + o p the functor induced by the map f : Γ + [ 1 ] Γ + 1 . Then, there exists an extensionMathematics 10 00590 i030
given as
( Γ + 1 ) ( [ 1 ] ) = Γ + [ 1 ] , n = 1 ( Γ + 1 ) ( [ n ] ) = 0 n Γ + 1 , n 0 ( Γ + 1 ) ( [ 1 ] [ 0 ] ) = f .
Moreover, Γ + 1 : ( Γ + , , [ 1 ] ) ( Sets Γ + o p , , Γ + [ 1 ] ) is, up to isomorphism, the unique ( 2 , 0 ) -monoidal extension.
Remark 24.
If we consider ( Γ + 1 ) ( [ n ] ) = 0 n Γ + 1 ( Sets fin ) Γ + o p , then we have that
| ( Γ + 1 ) ( [ 1 ] ) | = ( 1 , 0 , 0 , ) ,
| ( Γ + 1 ) ( [ 0 ] ) | = ( 1 , 1 , 1 , ) .
Observe that | ( Γ + 1 ) ( [ 0 ] ) | j = T j + 2 0 for j N + ,
| ( Γ + 1 ) ( [ 1 ] ) | = ( 1 , 2 , 3 , 4 , ) .
Then, we have that | ( Γ + 1 ) ( [ 1 ] ) | j = T j + 2 1 for j N + . In general, for d 0 , we have:
| ( Γ + 1 ) ( [ d ] ) | j = T j + 2 d , j N + .
Therefore, for any i , j N + ,
| ( Γ + 1 ) ( [ i ] ) | j = tri i , j .

6.3. Functors of Categorical Semi-Rings Induced by the Dunce Cup

We can construct functors of categorical semi-rings using triangular products:
Corollary 12.
The dunce cup Γ + 1 ( Sets fin ) Γ + o p induces the functor of categorical semi-rings:
( ) Γ + 1 : ( ( Sets fin ) Γ + o p , , , Γ + , Γ + [ 1 ] ) ( ( Sets fin ) Γ + o p , , , Γ + , Γ + [ 1 ] )
such that, if X ( Sets fin ) Γ + o p
X Γ + 1 = X ˜ ( Γ + 1 ) .
In particular, for every X , Y ( Sets fin ) Γ + o p , we have the canonical isomorphism:
( X Y ) Γ + 1 ( X Γ + 1 ) ( Y Γ + 1 ) .
Proof. 
This is just a consequence of Corollaries 6 and 11. □
Remark 25.
Observe that we can compute the sequential cardinal | X ( Γ + 1 ) | by means of the matricial product
| X ˜ ( Γ + 1 ) | = | X | · bin 1 · tri
Corollary 13.
The dunce cup Γ + 1 induces the functor of categorical semi-rings:
| ( ) Γ + 1 | : ( ( Sets fin ) Γ + op , , , Γ + , Γ + [ 1 ] ) ( Z N + o p , + , , 0 , 1 1 ) ,
X | X Γ + 1 | = | X ˜ ( Γ + 1 ) | = | X | · bin 1 · tri
Proof. 
It suffices to apply Corollary 12, Proposition 12 and Theorem 5. □
Example 1.
For the augmented semi-simplicial sets X = S + [ 1 ] , Y = S + [ 2 ] , we have the cardinal augmented sequences | X | = ( 1 , 3 , 3 , 0 , ) and | Y | = ( 1 , 4 , 6 , 4 , 0 , ) . Using the formula | X Y | = | X | | Y | , we obtain the sequence
| X Y | = ( 1 , 7 , 21 , 34 , 30 , 12 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 )
Now, using the formula | Z ˜ ( Γ + 1 ) | = ( | Z | · bin 1 ) · tri , one has the sequences
| X ˜ ( Γ + 1 ) | = ( 1 , 3 , 6 , 9 , 12 , 15 , 18 , 21 , 24 , 27 , 30 , 33 , 36 , 39 , 42 , 45 , ) | Y ˜ ( Γ + 1 ) | = ( 1 , 4 , 10 , 20 , 34 , 52 , 74 , 100 , 130 , 164 , 202 , 244 , 290 , 340 , 394 , ) | ( X Y ) ˜ ( Γ + 1 ) | = ( 1 , 7 , 28 , 83 , 202 , 427 , 812 , 1423 , 2338 , 3647 , 5452 , 7867 , )
On another note, one can check that computing the join of augmented sequences | X ˜ ( Γ + 1 ) | , | Y ˜ ( Γ + 1 ) | , we also have:
| X ˜ ( Γ + 1 ) | | Y ˜ ( Γ + 1 ) | = ( 1 , 7 , 28 , 83 , 202 , 427 , 812 , 1423 , 2338 , 3647 , 5452 , 7867 , )
We point out that | Y ˜ ( Γ + 1 ) | = A 005893 , where A 005893 is the notation used in the encyclopedia of integer numbers (see [16,39]) to denote the number of points on the surface of a tetrahedron. However, the integer sequence | ( X Y ) ˜ ( Γ + 1 ) | does not appear in this encyclopedia.

7. Conclusions and Future Work

Our main conclusion is that there is a nice relationship between augmented semi-simplicial finite sets and augmented sequences of integers. The categorical structure of semi-simplicial sets can be enriched with operations induced by finite coproduts, finite products, joins, and actions of some co-semi-simplicial objects and the space of augmented sequences admits some ring structures, and augmented matrices of integers can be used to transform augmented sequences. The sequential cardinal functor can be considered as an algebraization of the geometric objects given by augmented semi-simplicial finite sets into algebraic structures associated with augmented sequences.
In this paper, we have seen how the binomial numbers are connected with the Yoneda embedding and the iteration of the join operation on the final object of the category of semi-simplicial finite sets are connected with triangular numbers.
The authors have a project consisting of analyzing more properties of this algebraization process; in particular, we can see how the subdivision and the cylinder construction for semi-simplicial sets can be obtained by taking some actions of adequate co-semi-simplical objects and how the sequential cardinal of a subdivision can be computed using chain-power numbers and Stirling numbers (see [14,40]).
A different interesting objective will be to construct a categorical semi-ring (or symmetric bimonoidal category structure)
( ( Sets fin ) Γ + o p , , , Γ + [ 1 ] , Γ + [ 0 ] )
verifying the following properties:
  • If X , Y ( Sets fin ) Γ + o p and dim ( X ) , dim ( Y ) are finite, then
    dim ( X Y ) = ( dim ( X ) + 1 ) ( dim ( Y ) + 1 ) 1 .
  • If X , Y , Z ( Sets fin ) Γ + o p , then
    ( X Y ) Z ( X Z ) ( Y Z ) .

Author Contributions

Investigation, J.M.G.-C., L.J.H.-P. and M.T.R.-R. All authors have contributed equally in this research paper. All authors have read and agreed to the published version of the manuscript.

Funding

This research has been funded by the project PID2020-118753GB-I00 of the Spanish Ministerio de Ciencia e Innovación, the University of La Rioja, and the University of La Laguna.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Eilenberg, S.; Zilber, J.A. Semi-Simplicial Complexes and Singular Homology. Ann. Math. 1950, 51, 499–513. [Google Scholar] [CrossRef]
  2. Buoncristiano, C.R.S.; Sanderson, B.J. A Geometric Approach to Homology Theory; London Mathematical Society Lecture Note Series; Cambridge University Press: Cambridge, UK, 1976; Volume 18. [Google Scholar]
  3. Friedman, G. Survey Article: An elementary illustrated introduction to simplicial sets. Rocky Mt. J. Math. 2012, 42, 353–423. [Google Scholar] [CrossRef]
  4. Verity, D. Weak complicial sets, a simplicial weak omega-category theory. Part I: Basic homotopy theory. arXiv 2006, arXiv:math/0604414v3. [Google Scholar]
  5. CooperativeWork. Collaborative nLab: Semi-Simplicial Object. Available online: https://ncatlab.org/nlab/history/semi-simplicial (accessed on 23 December 2021).
  6. Ebert, J.; Randal-Williams, O. Semisimplicial spaces. Algebr. Geom. Topol. 2019, 19, 2099–2150. [Google Scholar] [CrossRef] [Green Version]
  7. Gabriel, M.Z.P. Calculus of Fractions and Homotopy Theory; Springer: Berlin/Heidelberg, Germany, 1995. [Google Scholar]
  8. Graham, R.L.; Knuth, D.E.; Patashnik, O. Concrete Mathematics; Addison-Wesley: Boston, MA, USA, 1990. [Google Scholar]
  9. Greene, D.H.; Knuth, D.E. Mathematics for the Analysis of Algorithms, 3rd ed.; Birkhäuser: Boston, MA, USA, 1990. [Google Scholar]
  10. Donaghey, R. Binomial self-inverse sequences and tangent coefficients. J. Comb. Theory Ser. A 1976, 21, 155–163. [Google Scholar] [CrossRef] [Green Version]
  11. Donaghey, R.; Shapiro, L.W. Motzkin numbers. J. Comb. Theory Ser. A 1977, 23, 291–301. [Google Scholar] [CrossRef] [Green Version]
  12. Riordan, J. Combinatorial Identities; Wiley: New York, NY, USA, 1968. [Google Scholar]
  13. Kim, H.K. On Regular Polytope Numbers. Proc. Am. Math. Soc. 2003, 131, 65–75. [Google Scholar] [CrossRef]
  14. Comtet, L. Advanced Combinatorics: The Art of Finite and Infinite Expansion; D. Reidel Pub. Co.: Dordrecht, The Netherlands; Boston, MA, USA, 1974. [Google Scholar]
  15. Nelsen, R.B.; Schmidt, H. Chains in Power Sets. Math. Mag. 1991, 64, 23–31. [Google Scholar] [CrossRef]
  16. Sloane, N.J.A.; Plouffe, S. The Encyclopedia of Integer Sequences; Academic Press: Cambridge, MA, USA, 1995. [Google Scholar]
  17. Biggs, N.L. Discrete Mathematics; Clarendon Press: Oxford, UK, 1985. [Google Scholar]
  18. Ehlers, P.; Porter, T. Joins for (augmented) simplicial sets. J. Pure Appl. Algebra 2000, 145, 37–44. [Google Scholar] [CrossRef] [Green Version]
  19. Johnson, N.; Yau, D. Bimonoidal Categories, En-Monoidal Categories, and Algebraic K-Theory. arXiv 2021, arXiv:2107.10526. [Google Scholar]
  20. Elgueta, J. The groupoid of finite sets is biinitial in the 2-category of rig categories. J. Pure Appl. Algebra 2021, 225, 106738. [Google Scholar] [CrossRef]
  21. Yau, D. 2Dimensional Categories; Oxford University Press: Oxford, UK, 2021. [Google Scholar]
  22. Björner, A. Face Number of Complexes and Polytopes. In Proceedings of the International Congress Mathematicians, Berkeley, CA, USA, 3–11 August 1986. [Google Scholar]
  23. Codenotti, G.; Katthän, L.; Sanyal, R. On f- and h-vectors of relative simplicial complexes. Algebr. Comb. 2019, 2, 343–353. [Google Scholar] [CrossRef]
  24. Athanasiadis, C.A. Face numbers of uniform triangulations of simplicial complexes. arXiv 2021, arXiv:2003.13372. [Google Scholar] [CrossRef]
  25. Nevo, E. Complexity yardsticks for f-vectors of polytopes and spheres. arXiv 2019, arXiv:1908.09628. [Google Scholar] [CrossRef] [Green Version]
  26. Lane, S.M.; Moerdijk, I. Sheaves in Geometry and Logic: A First Introduction to Topos Theory; Springer: New York, NY, USA, 1992. [Google Scholar]
  27. Laplaza, M. Coherence for distributivity. In Coherence in Categories; Lecture Notes in Mathematics; Kelly, G., Laplaza, M., Lewis, G., Lane, S.M., Eds.; Springer: Berlin/Heidelberg, Germany, 1972; Volume 281, pp. 29–65. [Google Scholar]
  28. Laplaza, M. A new result of coherence for distributivity. In Coherence in Categories; Lecture Notes in Mathematics; Kelly, G., Laplaza, M., Lewis, G., Lane, S.M., Eds.; Springer: Berlin/Heidelberg, Germany, 1972; Volume 281, pp. 214–235. [Google Scholar]
  29. Joyal, A.; Street, R. Braided Tensor Categories. Adv. Math. 1993, 102, 20–78. [Google Scholar] [CrossRef] [Green Version]
  30. MacLane, S. Categories for the Working Mathematician; Graduate Texts in Mathematics; Springer: New York, NY, USA, 1971; Volume 5, pp. i–ix, 1–262. [Google Scholar]
  31. Kelly, G.M. Basic Concepts of Enriched Category Theory. Repr. Theory Appl. Categ. 2005, 14, 1–18. [Google Scholar]
  32. Carrasco, P.; Cegarra, A.; Garzón, A. Classifying spaces for braided monoidal categories and lax diagrams of bicategories. Adv. Math. 2021, 226, 419–483. [Google Scholar] [CrossRef] [Green Version]
  33. Cegarra, A.M. Nonabelian cocycles and the spectrum of a symmetric monoidal category. Turk. J. Math. 2020, 44, 50–84. [Google Scholar] [CrossRef]
  34. Kong, L.; Yuan, W.; Zhang, Z.H.; Zheng, H. Enriched monoidal categories I: Centers. arXiv 2021, arXiv:2104.03121. [Google Scholar]
  35. Dell, Z. A Characterization of Braided Enriched Monoidal Categories. arXiv 2021, arXiv:2104.07747. [Google Scholar]
  36. Trujillo, L. A Coherent Proof of Mac Lane’s Coherence Theorem. Bachelor’s Thesis, Harvey Mudd College, Claremont, CA, USA, 2020. [Google Scholar]
  37. CooperativeWork. Collaborative Wiki nLab: Day Convolution. 2020. Available online: https://ncatlab.org/nlab/show/Day+convolution (accessed on 23 December 2021).
  38. Milewski, B. Free Monoidal Functors. 2018. Available online: https://bartoszmilewski.com/2018/05/16/free-monoidal-functors-categorically/ (accessed on 23 December 2021).
  39. CooperativeWork. The Online Encyclopedia of Integer Sequences. 2021. Available online: https://oeis.org (accessed on 23 December 2021).
  40. Schader, M. Hierarchical Analysis: Classification with Ordinal Object Dissimilarities. Metrika 1980, 27, 127–132. [Google Scholar] [CrossRef]
Figure 1. The join S + [ 0 ] S + [ 0 ] S + [ 0 ] .
Figure 1. The join S + [ 0 ] S + [ 0 ] S + [ 0 ] .
Mathematics 10 00590 g001
Figure 2. The join S + [ 0 ] S + [ 0 ] S + [ 0 ] S + [ 0 ] .
Figure 2. The join S + [ 0 ] S + [ 0 ] S + [ 0 ] S + [ 0 ] .
Mathematics 10 00590 g002
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

García-Calcines, J.M.; Hernández-Paricio, L.J.; Rivas-Rodríguez, M.T. Augmented Simplicial Combinatorics through Category Theory: Cones, Suspensions and Joins. Mathematics 2022, 10, 590. https://doi.org/10.3390/math10040590

AMA Style

García-Calcines JM, Hernández-Paricio LJ, Rivas-Rodríguez MT. Augmented Simplicial Combinatorics through Category Theory: Cones, Suspensions and Joins. Mathematics. 2022; 10(4):590. https://doi.org/10.3390/math10040590

Chicago/Turabian Style

García-Calcines, José Manuel, Luis Javier Hernández-Paricio, and María Teresa Rivas-Rodríguez. 2022. "Augmented Simplicial Combinatorics through Category Theory: Cones, Suspensions and Joins" Mathematics 10, no. 4: 590. https://doi.org/10.3390/math10040590

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop