A Categorical Approach to Möbius Inversion via Derived Functors
Abstract
We develop a cohomological approach to Möbius inversion using derived functors in the enriched categorical setting. For a poset and a closed symmetric monoidal abelian category , we define Möbius cohomology as the derived functors of an enriched hom functor on the category of -modules. We prove that the Euler characteristic of our cohomology theory recovers the classical Möbius inversion, providing a natural categorification. As a key application, we prove a categorical version of Rota’s Galois Connection. Our approach unifies classical ideas from combinatorics with homological algebra.
1 Introduction
Möbius inversion is a fundamental principle in combinatorics, generalizing the classical inclusion-exclusion principle to partially ordered sets. Originally emerging from number theory in the 19th century, the concept was later vastly generalized by Gian-Carlo Rota [14], who recognized its deeper structural role in combinatorics. At its core, Möbius inversion provides a systematic way to recover local information from global summaries. Given a function from a finite poset to a commutative ring , its upper Möbius inversion is the unique function such that for all ,
Dually, its lower Möbius inversion is the unique function such that for all ,
Our entry into Möbius inversion stems from its fundamental role in persistent homology, a key tool in topological data analysis [12, 8]. In pursuit of generalizations, Patel and Skraba developed Möbius homology for poset modules (functors valued in an abelian category ) [13]. Their theory associates a homology object to every and index such that its Euler characteristic recovers the lower Möbius inversion of the dimension function . They construct these homology objects via a simplicial cosheaf over the order complex of .
In this paper, we develop a cohomological approach to Möbius inversion through derived functors. Rather than dualizing the construction of Patel and Skraba to simplicial sheaves, we provide a more general and functorial perspective through enriched hom functors. Specifically, given a point , we define the indicator module . When is closed monoidal, we show that the set of natural transformations forms an object of (Definition 3.5). The functor is left-exact, and we define its right-derived functors as our Möbius cohomology objects.
This derived functor approach offers several key advantages. First, it generalizes naturally to handle cohomology for arbitrary spreads and modules, extending beyond the traditional scope of Möbius inversion. Second, it reveals connections with classical homological algebra, allowing us to leverage established theoretical machinery. Our framework culminates in a categorical version of Rota’s Galois Connection Theorem, expressed as an enriched adjunction.
Previous Work
The study of the total cohomology of -modules using derived functors has a rich history, with foundational contributions by Deheuvels [5]. Baclawski made significant advances in understanding the homological aspects of posets through two key papers. His 1975 work [1] developed a homological interpretation of Whitney numbers of geometric lattices, while his 1977 paper [2] established deep connections between Galois connections and spectral sequences. While this body of work laid important groundwork, the explicit connection to Möbius inversions remained unexplored until the recent work of Patel and Skraba [13].
A parallel development in the categorical treatment of Möbius inversion emerged through the work of Leroux [9], who introduced the concept of Möbius categories. This framework was significantly expanded by Content, Lemay, and Leroux [3], who developed a comprehensive categorical setting for Möbius inversion. While their work established important functorial properties of incidence algebras and Möbius functions, it did not pursue the homological aspects that we develop here.
Our investigation originates from questions in persistent homology, a fundamental tool in topological data analysis. While we do not explicitly address persistent homology in this paper, the discussion of persistent homology in [13] dualizes to our setting. In this context, our Möbius cohomology theory shares important connections with recent work by Oudot and Scoccola [11] on bigraded Betti numbers.
Recent work by Gülen and McCleary [7] demonstrated how Rota’s Galois connection theorem reveals the functorial character of Möbius inversion. Our Theorem 6.6 substantially generalizes their observation, providing a comprehensive categorical framework that unifies the combinatorial and functorial perspectives on Möbius inversion.
Our contributions
The main contributions of this paper are:
-
1.
We develop a cohomological theory for Möbius inversion using derived functors in the enriched categorical setting (Section 5). We prove that the Euler characteristic of our cohomology theory coincides with the classical Möbius inversion (Theorem 5.7), providing a natural categorification while simultaneously offering a more general framework for studying poset modules.
-
2.
We establish an explicit formula for computing Möbius cohomology using the standard cofree resolution (Section 4). Specifically, we show that applying to the standard cofree resolution (Equation 2) yields a cochain complex (Equation 5) whose cohomology groups recover Möbius cohomology. This formula reveals how our derived functor approach recovers the construction using sheaves on the order complex.
- 3.
-
4.
We demonstrate that our derived functor approach unifies various perspectives on Möbius inversion through several key isomorphisms (Proposition 3.8, Proposition 4.8, and Theorem 6.10), connecting classical combinatorial methods, homological algebra, and categorical techniques in a single coherent framework.
Throughout, we have made an effort to keep the exposition self-contained, providing background material and motivation for key concepts in Section 2. This makes the paper accessible to readers with a basic understanding of category theory and homological algebra.
Outline
The paper is organized as follows. Section 2 establishes the categorical preliminaries, including key concepts from homological algebra and enriched category theory. Section 3 introduces poset modules and develops the fundamental constructions needed for our cohomology theory. Section 4 defines derived hom functors and explores their properties in the context of poset modules. Section 5 introduces Möbius cohomology and establishes its relationship to classical Möbius inversion. Finally, Section 6 examines Galois connections between posets and proves our categorical version of Rota’s theorem.
2 Categorical Preliminaries
In this section, we introduce the key categorical concepts, constructions, and notation used throughout the paper. These preliminaries provide the necessary framework for later sections, focusing on abelian and monoidal categories, ends, and basic homological algebra. For a deeper study, see [10, 16].
2.1 Adjunctions
For a category , we denote by the set of morphisms from to . Recall that an adjunction between two categories and consists of a pair of functors and , together with natural isomorphisms of sets . In this situation, we say is left adjoint to and is right adjoint to , denoted . An important property of left adjoints is that they are cocontinuous, while right adjoints are continuous, meaning left adjoints preserve colimits and right adjoints preserve limits.
2.2 Abelian Categories
A category is preadditive if for every set there is an abelian group structure, and composition is bilinear, i.e.,
A functor between preadditive categories is additive if for all objects , the induced map is a group homomorphism.
A biproduct of objects in a preadditive category is an object with morphisms and satisfying:
In this case, is a product, and is a coproduct. A preadditive category is additive if it admits all finite biproducts.
A preadditive category is abelian if it has a zero object, all binary biproducts, kernels and cokernels, and every monomorphism and epimorphism is normal. Functors between abelian categories are typically additive, and if , both and are automatically additive.
Exactness is central in abelian categories. An additive functor between abelian categories is:
-
•
left-exact if it preserves exactness of sequences of the form
-
•
right-exact if it preserves exactness of sequences of the form
A functor is exact if it is both left-exact and right-exact. If , then is automatically right-exact and is left-exact.
2.3 Closed Monoidal Categories
A monoidal category consists of a category , a bifunctor (called the tensor product), an object (the unit object), and natural isomorphisms:
These isomorphisms satisfy certain coherence conditions (see [10, VII]). A monoidal category is symmetric if there is a natural isomorphism that satisfies its own coherence conditions. A (symmetric) monoidal category is closed if for each , the functor has a right adjoint. This right adjoint is denoted and is called the internal hom.
Proposition 2.1:
For any closed symmetric monoidal category and for all objects in , we have
Proof.
For any , we have . The result follows now from the Yoneda lemma. ∎
2.4 Abelian Symmetric Monoidal Categories
We will focus on categories that are both abelian and closed symmetric monoidal. A key compatibility condition between the abelian and monoidal structures is that the tensor product must be additive in both variables. When the monoidal structure is closed, this compatibility condition is automatically satisfied because biproducts serve as both limits and colimits, and the tensor product is left adjoint to the internal hom functor.
Henceforth, is a small, complete, abelian, and closed symmetric monoidal category.
2.5 Ends
Fix a functor . A wedge of , denoted , is an object together with maps such that for every , the diagram
commutes. The end of , denoted , is the universal wedge, meaning any wedge factors uniquely through it. That is, if is any wedge of , then there is a unique map satisfying , for all objects .
The end of an ordinary functor , denoted , is defined by taking the end of the composition , where denotes the projection functor onto the second factor. In this case, the end reduces to the limit of .
Given functors , the set of natural transformations from to is given (up to isomorphism) by the formula
(1) |
This formula and generalizations of it are central to our constructions. If is a closed category, then we can replace in the formula above by to make an object of (see Definition 3.5 below).
2.6 Injective Resolutions
An object in is called injective if, for every monomorphism and any morphism , there exists a morphism making the following diagram commute:
Arbitrary products of injective objects are injective. Moreover, in an abelian category, finite direct sums (i.e., biproducts) of injective objects remain injective since finite sums coincide with products. However, arbitrary direct sums do not necessarily preserve injectivity.
An abelian category is said to have enough injectives if every object admits a monomorphism into an injective object .
An injective resolution of an object in is an exact sequence
where each is an injective object in .
If has enough injectives, every object admits an injective resolution via the standard construction. Begin by embedding into an injective object , and successively embed each cokernel into a new injective object as follows:
2.7 Grothendieck Ring
The Grothendieck ring of a category , denoted , is the free abelian group generated by the isomorphism classes of objects in , subject to the relation for every short exact sequence in . The ring structure on is induced by the monoidal structure of , where the product is given by , with denoting the tensor product in . The resulting ring is commutative and unital, with the class of the unit object acting as the multiplicative identity: . The multiplication is both commutative and associative, reflecting the symmetric monoidal structure of .
3 Poset Modules
In this section, we introduce poset modules, which are functors from a poset (viewed as a category) to the target category . We establish key definitions and notation that will be used throughout the paper, focusing on constructions such as cofree modules, enriched hom-objects, tensor products, and injective resolutions.
3.1 First Constructions
We begin by defining posets and their interpretation as categories, along with the notion of -modules. Principal cofree modules and cofree modules are introduced as building blocks for working with -modules.
Definition 3.1:
A poset consists of a set equipped with a binary relation that is reflexive, antisymmetric, and transitive. A poset can be regarded as a category, where the objects are the elements of and where there is a morphism whenever .
Henceforth, we assume all posets are finite.
Definition 3.2:
A -module valued in a category is a functor . Let denote the category of -modules, with morphisms given by natural transformations. Denote by the set of morphisms from to .
Definition 3.3:
For and , define the -module by
The map is the identity on if , and otherwise. Such -modules are called principal cofree modules.
Definition 3.4:
A -module is cofree if it is isomorphic to a product of principal cofree modules, i.e., if for objects .
Having introduced principal cofree modules, we now shift our focus to enriched hom-objects and tensor product constructions for -modules.
3.2 Enriched Hom
This subsection defines enriched hom-objects and describes how the symmetric monoidal structure extends from the base category to the category of -modules. We introduce tensor products of -modules and establish an adjunction between the enriched hom functor and the tensor product functor.
If is an abelian category, then the category of -modules, , is also abelian. Moreover, if is a symmetric monoidal category, then inherits a symmetric monoidal structure as follows: for two -modules and , their tensor product is given by the composition
The unit -module, denoted , assigns the object to each element of , with identity morphisms acting between them. The coherence conditions for this structure follow directly from those in .
While we do not require to be closed, we do require it to be enriched over . Specifically, for each -module , there must be a functor
that is right adjoint to a functor of the form , for each object .
Definition 3.5:
Define the enriched hom-object between two -modules and as
This assignment extends, by the universal property of the end, to a functor
Before proving the enriched hom adjunction, we introduce constant -modules. For an object , denote by as the -constant -module. That is , for all , all the morphisms are set to the identity morphism on .
Definition 3.6:
Define the tensor product as the functor induced by sending every object to the tensor product of -modules .
Proposition 3.7:
The tensor product is left-adjoint to the enriched-hom . That is, for every object and -modules and , there is a natural isomorphism of sets
Proof.
For each and , we have
by definition of and by (1) | ||||
by the hom-tensor adjunction in | ||||
since commutes with limits | ||||
These isomorphisms are natural in , , and which completes the proof. ∎
Proposition 3.8:
If is a cofree -module and is any -module, then
Proof.
Since the functor is a right adjoint, it preserves limits, and in particular, it commutes with products. Therefore, it suffices to demonstrate that for every object and element , there is an isomorphism
Consider the case where . For each pair in , examine the following commutative diagram:
Here, for each , the morphism is defined by
It is straightforward to verify that this diagram commutes for every in . Consequently, the collection forms a wedge for the functor .
Now, let be any other such wedge with morphisms for each . In particular, there is a morphism corresponding to . It can be checked that for every , the following equality holds: This demonstrates that the morphisms uniquely factor through . Therefore, is the universal wedge. ∎
3.3 Injective Resolutions
We define principal injective modules and elementary injective modules, which are necessary for constructing injective resolutions for -modules. This section parallels the theory of injective resolutions in the underlying abelian category.
Definition 3.9:
For an injective object and , define the -module by:
The map is the identity on for , and otherwise. Such -modules are called principal injective -modules.
Definition 3.10:
A -module is called an elementary injective -module if it is isomorphic to a product of principal injective -modules. That is, , where each is an injective object in .
Clearly, principal injective modules are principal cofree modules, and elementary injective modules are cofree. With the concept of elementary injective modules in hand, we now establish that every elementary injective module is injective in the category of -modules.
Proposition 3.11:
Every elementary injective -module is injective in .
Proof.
Since products of injective objects are injective, it suffices to prove the proposition for a principal injective module . Let and be -modules, a monomorphism, and any morphism. We construct a map of -modules such that . Since is injective, there exists a map in such that the diagram
commutes. Define by setting and then extending to all of as follows:
It is straightforward to verify that is a natural transformation and that . ∎
3.4 Enough Injectives
We show that if the base category has enough injectives, then the category of -modules inherits this property, enabling us to construct injective resolutions for all -modules.
Proposition 3.12:
If has enough injectives, then the category has enough injectives.
Proof.
We show that has enough injectives by constructing, for a fixed -module , an injective -module and a monomorphism .
Since has enough injectives, for each , there exists an injective object and a monomorphism . Set
By Proposition 3.11, is an elementary injective -module and hence is injective.
For each , define a map by
It is straightforward to verify that each is a natural transformation. Note that is a monomorphism. Finally, the desired map is obtained using the universal property of the product. ∎
By Proposition 3.12, every -module admits a monomorphism into an elementary injective module, leading to the following corollary.
Corollary 3.13:
If is an abelian category with enough injectives, then every -module has an injective resolution by elementary injective -modules.
4 Derived Hom Functors
In this section, we introduce the Ext-functor as a derived functor of the enriched hom. Next, we introduce cofree resolutions as a computational tool. Finally, we explore the Euler characteristic of Ext-functors.
4.1 Ext Functors and Injective Resolutions
This subsection introduces Ext-functors, which arise as derived functors of the enriched hom.
Recall Proposition 3.7: for a fixed -module , the tensor product functor
is left adjoint to the enriched hom functor
This adjunction makes a left-exact functor between the two abelian categories.
Now, let be a second -module. Consider an injective resolution
and apply the functor to obtain the following cochain complex in :
The cohomology objects of this complex, denoted by , are the higher derived functors of the enriched hom and are commonly referred to as Ext-functors. These are denoted by
We are particularly interested in the Ext-functor for a specific class of indicator -modules , which we now describe.
Definition 4.1:
A subposet is called a spread if, for all in and for all in , we have . Define the -module as follows:
Additionally, the morphism is the identity morphism for in and zero otherwise.
Corollary 4.2:
For a spread and a cofree -module , we have
Henceforth, all Ext-functors will be of the form , where is a spread.
4.2 Standard Cofree Resolutions and Ext Calculations
This subsection focuses on calculating Ext-functors using cofree resolutions. While injective resolutions are theoretically useful for defining the Ext-functor, cofree resolutions offer computational advantages, particularly for explicit calculations.
A cofree resolution of a -module is an exact sequence in :
where each is a cofree -module. A specific cofree resolution, called the standard cofree resolution, is particularly useful for computations.
Definition 4.3:
The order complex of a poset , denoted by , is a simplicial complex whose -simplices are chains consisting of distinct elements of . A simplex is a face of a simplex , written , if is a subchain of .
We use to indicate that . For a simplex , we denote as and as . If , then and .
Definition 4.4:
The standard cofree resolution of a -module is the exact sequence:
(2) |
Define as
For , define the map
as
The universal property of the product induces the full coboundary morphism .
The canonical monomorphism is defined as follows. For a -simplex (i.e., an element ), define the component
as
The universal property of the product induces the full monomorphism .
Proposition 4.5 ([5]):
The standard cofree resolution of a -module is exact.
Now consider an elementary cofree -module . Since has enough injectives, admits an injective resolution:
which induces an injective resolution of the elementary -module:
Applying the functor , and using Propositions 3.8 and 2.1, we obtain, assuming , the following acyclic cochain complex:
(3) |
If , the resulting chain complex is zero. Thus, for all . In other words, elementary cofree -modules, and hence cofree -modules in general, are -acyclic, leading to the following proposition.
Proposition 4.6:
[6, Theorem III.6.16] Let be the standard cofree resolution of a -module , and let be any injective resolution of . For all spreads , the two cochain complexes
and
are quasi-isomorphic, i.e., their cohomology objects are isomorphic.
4.3 Euler Characteristic of Ext-Functors
Having established how Ext-functors are computed using cofree resolutions, we now define the Euler characteristic as an element of the Grothendieck ring.
Definition 4.7:
The Euler characteristic of the Ext-functor is defined as:
The following proposition gives an explicit formula for computing .
Proposition 4.8:
For a spread and a -module , the Euler characteristic is given by:
Proof.
We compute the Euler characteristic by analyzing the cochain complex:
(4) |
For each degree , let
yielding the short exact sequence:
By Corollary 4.2, the middle term can be expressed as:
Thus, in the Grothendieck ring:
Since the cohomology of Equation (4) computes the Ext-functors , we have the following short exact sequence:
which gives:
Using the fact that , we obtain:
5 Möbius Cohomology
In this section, we introduce Möbius cohomology as a special case of Ext-cohomology that applies to indicator modules associated with individual elements of a poset. The discussion concludes with an overview of Möbius inversions and how Möbius cohomology serves as its categorification.
5.1 Definition
We begin by specializing the notion of indicator modules to singleton sets. For any element , the set is a spread, allowing us to define its indicator module in the same way as for more general indicator -modules. For simplicity, we denote the -module by .
Definition 5.1:
The Möbius cohomology of a -module at is given by the Ext-functor:
5.2 Background: Möbius Inversion
This subsection introduces the classical combinatorial tool of Möbius inversion, which, in the next subsection, is connected to Möbius cohomology through the Euler characteristic.
For any pair in a poset , the interval between them is defined as:
Let denote the set of all intervals in .
The -incidence algebra of , denoted , consists of functions with operations of scaling, addition, and multiplication. Multiplication is given by:
The multiplicative identity in this algebra is:
The zeta function, denoted by , assigns the value to every interval: . The inverse of , denoted , is known as the Möbius function.
Lemma 5.3 (Philip Hall’s Theorem, Prop 3.8.5 [15]):
For in , let denote the number of chains of length from to . Then:
Definition 5.4:
Let be a finite poset, and let be a unital commutative ring. The (upper) Möbius inversion of a function is defined as:
(6) |
The Möbius inversion is the unique -valued function on satisfying the following identity for all :
Note that the set of all functions forms an -module. Möbius inversion can then be viewed as a module homomorphism . We will also write when we wish to emphasize the poset over which the Möbius inversion is being taken.
Remark 5.5:
While our focus is on the upper Möbius inversion, which sums over elements greater than or equal to a given element , there is an alternative form known as the lower Möbius inversion. Specifically, for a function , the lower inversion is defined as:
Although this form is not required in our framework, it plays a dual role to the upper inversion.
5.3 Euler Characteristic of Möbius Cohomology
We now examine the relationship between Möbius cohomology and Möbius inversion through the Euler characteristic.
Definition 5.6:
The dimension function of a -module is the function given by:
Theorem 5.7:
For any -module and , the Möbius inversion of the dimension function equals the Euler characteristic of the Möbius cohomology:
Remark 5.8:
The lower Möbius inversion arises naturally in the decategorification of Möbius homology. This reflects the duality between homology and cohomology: while Möbius cohomology decategorifies to the upper inversion, Möbius homology decategorifies to the lower inversion.
6 Galois Connections
This section examines Galois connections, which are adjunctions between posets. We begin by defining the fundamental functors between poset modules that arise from monotone functions, followed by a discussion of the adjoint functors induced by Galois connections. The central focus of this section is Theorem 6.6, which serves as a categorification of Rota’s classical theorem on Galois connections and Möbius functions. We then review Rota’s classical theorem before demonstrating how it is categorified by our theorem.
6.1 Adjoint Functors from Monotone Functions
In this subsection, we explore the functors that naturally arise from monotone functions between posets. These functors—pushforward, pushforward with open supports, and pullback—allow us to transfer structure between categories of modules over different posets.
Let be a monotone function between two posets. A function is monotone if in implies in . A monotone function generates three distinct but related functors:
-
•
The pushforward functor sends a -module to the -module , where
-
•
The pushforward with open supports functor sends a -module to the -module , where
-
•
The pullback functor sends a -module to the -module , where
The relationships among these functors are summarized in the following diagram:
Proposition 6.1:
[4, Theorems 3.14 and 3.15] For every monotone function , the following adjunctions hold:
Since right adjoints are left-exact, and left adjoints are right-exact, the following properties hold:
-
•
is left-exact.
-
•
is exact (both left-exact and right-exact).
-
•
is right-exact.
6.2 Galois Connections and Functorial Equality
In this subsection, we explore how Galois connections induce equalities of functors.
Definition 6.2:
A Galois connection between two posets and consists of two monotone functions and such that:
for all and . We write and refer to as the left adjoint and as the right adjoint.
Proposition 6.3:
For a Galois connection , the following functorial equalities hold:
Proof.
For and , we have:
Similarly, for and , we obtain:
6.3 Categorical Galois Connection Theorem
Galois connections naturally give rise to an enriched adjunction leading us to the main theorem of this section.
Given a Galois connection , Propositions 6.1 and 6.3 establish the following adjunctions:
Thus, we have the following natural isomorphisms:
for all and .
In what follows, we extend these adjunctions to the enriched hom setting, formalized in Theorem 6.6. To do so, we first establish the necessary and sufficient conditions under which an adjunction between functors extends to the enriched hom.
Lemma 6.4:
Let be a pair of adjoint functors with . Then
for all and if and only if
for all . Moreover, the first isomorphism is natural in and if and only if the second is natural in .
Proof.
Assume that for all and . Then for any and , we have:
by Proposition 3.7 | ||||
by assumption | ||||
Since was arbitrary, by the Yoneda lemma, we have . These isomorphisms are natural in and , assuming the isomorphism is natural. Hence, the isomorphism is natural in .
Conversely, suppose for all . For every object , we have:
by Proposition 3.7 | ||||
by assumption | ||||
By the Yoneda lemma, we conclude that . All of these isomorphisms are natural in and , provided that is natural in . This completes the proof. ∎
Next, we verify that pullbacks and pushforwards with open supports satisfy the conditions of the preceding lemma.
Lemma 6.5:
Let be a monotone function between posets. Then and for all and . Moreover, these isomorphisms are natural in and .
Proof.
By Proposition 3.7, the tensor product is a left-adjoint and therefore commute with colimits. Let us verify the isomorphism . For each , we have
by definition of | ||||
since commutes with colimts | ||||
by definition of . |
Each of these isomorphisms is natural in and , so we obtain an isomorphism of -modules, natural in .
Next, we verify the isomorphism . For each , we have:
Thus, and are pointwise equal. Moreover, the internal maps of both -modules are the same, so we in fact have the equality , which is trivially natural in . ∎
Theorem 6.6 (Categorical Rota’s Galois Connection Theorem):
Let be a Galois connection. Then:
for all and .
6.4 Background: Rota’s Theorem
In this subsection, we review Rota’s original theorem, which establishes a fundamental relationship between Möbius functions on two posets connected by a Galois connection.
Theorem 6.7 (Rota’s Galois Connection Theorem [14]):
Let be a Galois connection. For all and , the following equality holds:
This theorem connects the Möbius functions and associated with the respective posets and . We now present an equivalent result using Möbius inversions.
Given a monotone function , we define two key operations:
-
•
The pushforward of a function is given by:
-
•
The pullback of a function is defined by:
Note that the pushforward and pullback gives rise to -module homomorphisms and , respectively.
We now introduce an equivalent result to Rota’s theorem, which highlights how these pushforward and pullback operations interact with Möbius inversions. This alternative formulation was first observed by Aziz Gülen and Alex McCleary for the dual setting of lower Möbius inversions [7].
Theorem 6.8:
For a Galois connection , the following identity holds:
Proof.
Let be an arbitrary function. For each , we have
since | ||||
By uniqueness of the Möbius inversion, it follows that . Since this is true for every , the result follows. ∎
The equivalence between Theorem 6.8 and Theorem 6.7 can be demonstrated by applying the Möbius inversion formula to a specific case. Choose and , and let be the function defined by:
Evaluating both sides of the identity in Theorem 6.8 using this function, we obtain, for all and :
Thus, Rota’s Galois connection theorem is equivalent to the statement for all . Since and are -module homomorphism, and since is generated by functions of the form , the preceding statement is true if and only if .
6.5 Euler Characteristic and Rota’s Theorem
We now prove in Theorem 6.10 how Theorem 6.6 decategorifies to Theorem 6.8 via the Euler characteristic of the Ext-functor.
The following corollary is an immediate consequence of Theorem 6.6.
Corollary 6.9:
Let be a Galois connection, let , and let . Then,
Theorem 6.10:
Let be a Galois connection and let . Then, for ,
(7) |
where is the dimension function of .
References
- Bac [75] Kenneth Baclawski. Whitney numbers of geometric lattices. Advances in Mathematics, 16:125–138, 1975.
- Bac [77] Kenneth Baclawski. Galois connections and the Leray spectral sequence. Advances in Mathematics, 25(2):191–215, 1977.
- CLL [80] Mireille Content, François Lemay, and Pierre Leroux. Catégories de Möbius et fonctorialité: un cadre général pour l’inversion de Möbius. Journal of Combinatorial Theory, Series A, 28(2):169–190, 1980.
- Cur [18] Justin Michael Curry. Dualities between cellular sheaves and cosheaves. Journal of Pure and Applied Algebra, 222(4):966–993, 2018.
- Deh [62] R. Deheuvels. Homologie des ensembles ordonnés et des espaces topologiques. Bulletin de la Société Mathématique de France, 90:261–321, 1962.
- GM [03] I. Gelfand and M. Manin. Methods of Homological Algebra. Springer Monographs in Mathematics. Springer-Verlag, Berlin, 2nd edition, 2003.
- GM [22] Aziz Burak Gülen and Alexander McCleary. Galois connections in persistent homology. arXiv, July 2022.
- KM [23] Woojin Kim and Facundo Mémoli. Persistence over posets. Notices of the American Mathematical Society, 70(8), September 2023.
- Ler [75] Pierre Leroux. Les catégories de Möbius. Cahiers de Topologie et Géométrie Différentielle Catégoriques, 16(3):280–282, 1975.
- ML [98] Saunders Mac Lane. Categories for the Working Mathematician. Springer, 2nd edition, 1998.
- OS [24] Steve Oudot and Luis Scoccola. On the stability of multigraded Betti numbers and Hilbert functions. SIAM Journal on Applied Algebra and Geometry, 8(1):54–88, 2024.
- Pat [18] Amit Patel. Generalized persistence diagrams. Journal of Applied and Computational Topology, 1(3-4):397–419, 2018.
- PS [23] Amit Patel and Primoz Skraba. Möbius homology. arXiv preprint arXiv:2307.01040, 2023.
- Rot [64] Gian-Carlo Rota. On the foundations of combinatorial theory I. Theory of Möbius functions. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, 2(4):340–368, 1964.
- Sta [11] Richard P. Stanley. Enumerative Combinatorics, volume 1 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2nd edition, 2011.
- Wei [94] Charles A. Weibel. An Introduction to Homological Algebra. Cambridge University Press, 1994.