
TL;DR
This paper introduces a new categorical framework for central stability homology, extending previous work to categories with infinite automorphism groups and linking it to broader stability concepts.
Contribution
It develops a novel categorical approach to central stability homology, applicable to categories with infinite automorphisms, and connects it to existing stability theories.
Findings
Provides a new categorical construction for central stability homology.
Establishes a connection between central stability and homological stability.
Develops a criterion for polynomial functors to be centrally stable.
Abstract
We give a new categorical way to construct the central stability homology of Putman and Sam and explain how it can be used in the context of representation stability and homological stability. In contrast to them, we cover categories with infinite automorphism groups. We also connect central stability homology to Randal-Williams and Wahl's work on homological stability. We also develop a criterion that implies that functors that are polynomial in the sense of Randal-Williams and Wahl are centrally stable in the sense of Putman.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
\newaliascnt
thmautothmcounter
\newaliascntDefautothmcounter
\newaliascntexautothmcounter
\newaliascntexsautothmcounter
\newaliascntlemautothmcounter
\newaliascntpropautothmcounter
\newaliascntcorautothmcounter
\newaliascntremautothmcounter
Central stability homology
Peter Patzt
Institut für Mathematik, Freie Universität Berlin, Germany
(Date: April 2017)
Abstract.
We give a new categorical way to construct the central stability homology of Putman and Sam and explain how it can be used in the context of representation stability and homological stability. In contrast to them, we cover categories with infinite automorphism groups. We also connect central stability homology to Randal-Williams and Wahl’s work on homological stability. We also develop a criterion that implies that functors that are polynomial in the sense of Randal-Williams and Wahl are centrally stable in the sense of Putman.
2010 Mathematics Subject Classification:
55N35 (Primary), 18A25, 20L05, 55T05 (Secondary)
Contents
- 1 Introduction
- 2 Central stability homology
- 3 Stability categories
- 4 Central stability and stability categories
- 5 Central stability and finiteness properties
- 6 Notions of central stability
- 7 Polynomial degree
- 8 Short exact sequences
- 9 Quillen’s argument revisited
1. Introduction
In 1960 Nakaoka [Nak60] proved the pioneering result that for the symmetric groups
[TABLE]
is an isomorphism for all large enough in comparison to . Quillen [Qui70] was able to prove this result, using a new method that has since been generalized in many ways. He was considering a highly connected simplicial complex on which acts and the groups that stabilizes simplices pointwise are isomorphic to for large enough . For the symmetric groups the –dimensional standard simplex works. Randal-Williams and Wahl [RWW15] turned this game around: They construct a semisimplicial set whose –simplices are given by
[TABLE]
such that it is a transitive –set whose stabilizers are . Then they prove that is highly connected. More precisely, let be the category of finite ordered sets (including the empty set) and strictly monotone maps and the category of finite sets and injection. Being a semisimplicial set, is a functor from to the category of sets with
[TABLE]
Because is as an –set the set of injective maps
[TABLE]
this functor factors through the opposite category of :
[TABLE]
The category has taken up a prominent role in the theory of representation stability. Established by Church and Farb in [CF13], representation stability characterizes sequences of representations of or other sequences of groups, that admit a uniform description as a direct sum of irreducible representation once is large enough. For example, the permutation representation is the direct sum of the trivial representation and the standard representation for . The permutation representation can also be realized as an –module, by which we mean a functor from to –vector spaces (and later more generally a functor from to –modules). This can be done by sending a finite set to the finite dimensional vector space with basis . For an –module , we will denote the images of by .
Notions of representation stability
Church and Farb’s original definition [CF13, Def 2.3] was given in terms of irreducible representations. Later Church, Ellenberg and Farb [CEF15] proved that a finitely generated –module is representation stable. Putman [Put15] noticed that for an –module one cannot expect that , because the transposition of acts trivially on the image of in . But he calls an –module centrally stable if is isomorphic to the largest quotient of such that acts trivially on the image of for all large enough. This quotient can be expressed as a coequalizer
[TABLE]
Let be the full subcategory of whose objects all have cardinality at most and denote the inclusion by
[TABLE]
Church, Ellenberg, Farb and Nagpal [CEFN14] then proved that an –module is centrally stable if and only if it is presented in (having a presentation by sums of representable functors from , also see Section 6(a)) for some sufficiently large . Later Putman and Sam [PS14] also gave a categorical concept the name central stability. They call an –module is centrally stable if there is an large enough such that is the left Kan extension of its restriction to :
[TABLE]
In other words, for any –module and any morphism (ie natural transformation)
[TABLE]
between the restrictions, there is a unique morphism which induces . In a more general setup, Djament [Dja16] proves that an –module fulfills this condition if and only if it is presented in and is thereby equivalent to the original definition from [Put15]. Unfortunately the two notions of central stability differ in natural generalizations of the category , we consider later. We compare many different notions in Section 6.
The central stability chain complex
The term central stability chain complex was first coined by Putman [Put15] for a sequence of –representations. He defined it by
[TABLE]
where is the sign representation of . It turns out, that for an –module this chain complex is given by
[TABLE]
where the differential is the alternated sum of face maps
[TABLE]
that is induced by the inclusion of sets. This complex also computes –homology – the derived functor analyzed by Church and Ellenberg [CE16].
There is a related chain complex
[TABLE]
for –modules . It was first mentioned by Church, Ellenberg, Farb and Nagpal [CEFN14] and considered in more detail by Putman and Sam [PS14]. One notes
[TABLE]
To recover Putman’s chain complex (1.1), one factors out the –action. The second complex (1.2) computes what we will call central stability homology of an –module in this paper.
Both complexes are related to the notions of representation stability. For example, the augmentation map
[TABLE]
is surjective for all if and only if is generated in .
A similar connection can be found for central stability. By definition
[TABLE]
if and only if the part
[TABLE]
of (1.2) is exact. Coincidently this is true if and only if the part
[TABLE]
of (1.1) is exact. The remaining parts of the two complexes may very well differ.
Such a generalization was done for both complexes by Putman and Sam [PS14] for modules over complemented categories (see Section 3). is an example of a complemented category.
Let us plug in the constant –module that sends all maps to the identity. We find that (1.2) is the chain complex associated to from above. Whereas (1.1) computes to be the simplicial complex of the standard simplex . Randal-Williams and Wahl [RWW15] gave a general construction of the semisimplicial set for a homogeneous category (see Section 3). is also an example of a homogeneous category. Moreover, they have a general construction of a simplicial complex whose simplicial chain complex is a generalization of (1.1).
Let be a small monoidal category with initial unit and let be a cocomplete category. In Section 2, we give a construction of a functor
[TABLE]
that turns a functor from to into a functor from to augmented semisimplicial objects in . This generalizes Randal-Williams and Wahl’s construction of the augmented semisimplicial set and the augmented semisimplicial module in (1.2). For example plugging in the constant functor
[TABLE]
we get a functor from to augmented semisimplicial sets with
[TABLE]
In our construction functorial dependencies become more visible than in previously existing literature. If is abelian, we denote the associated chain complex for a functor by and its homology by . This is what we call the central stability chain complex and the central stability homology in this paper. When is an –modules it computes to be
[TABLE]
as in (1.2).
Stability categories
[PS14] and [RWW15] generalize by weakly complemented categories (see Section 3) and homogeneous categories (see Section 3), respectively. We will work with a different generalization of that we call stability categories which are both weakly complemented and homogeneous. In Section 3, we define stability groupoids, that are sequences of groups together with a monoidal structure
[TABLE]
and some mild condition (see Section 3). We then use a construction of Quillen, which is also used in [RWW15], to get a category whose objects are the natural numbers and whose homomorphisms are
[TABLE]
We call a stability category if is braided. All examples considered by [PS14] and [RWW15] are covered in this setup:
Examples \theexsauto.
Here is a list of some braided stability groupoids and their stability categories .
- (a)
The symmetric groups is a symmetric stability groupoid and its stability category is a skeleton of . 2. (b)
Fix a commutative ring . The general linear groups is a symmetric stability groupoid and its stability category is a skeleton of whose objects are finitely generated free –modules and its morphisms are given by pairs of a monomorphism and a free complement . 3. (c)
Fix a commutative ring . The symplectic groups is a symmetric stability groupoid and its stability category is a skeleton of whose objects are finitely generated free symplectic –modules and its morphisms are isometries. 4. (d)
The automorphism groups of free groups is a symmetric stability groupoid and its stability category is given by pairs of a monomorphism and a complement . 5. (e)
There is a braided stability groupoid for the braid groups . Its monoidal structure is described in Section 3. 6. (f)
There is a braided stability groupoid for the mapping class groups of connected, oriented surfaces of genus and one boundary component. Its monoidal structure is described in **[RWW15, Sec 5.6]**. A description of the corresponding stability categories of and can also be found in **[RWW15, Sec 5.6]**.
From now on, we call a functor from to the category of –modules for some fixed commutative ring a –module. In Section 4, we compute the central stability complex of a –module very concretely to be isomorphic to
[TABLE]
This complex clearly generalizes (1.2) and (1.3).
The stability category of a braided stability groupoid is monoidal (see [RWW15, Prop 2.6] or Section 3) and has an initial unit [math] as
[TABLE]
That means
[TABLE]
is the functor sending all objects to and all morphisms to the identity on . The connectivity condition on used in [RWW15] can be described by the following condition.
**H3: **
The central stability homology for all and all large enough in comparison to .
All stability categories in Section 1 satisfy H3. Also, Putman and Sam’s [PS14, Thm 3.7] implies H3 for all stability categories that fulfill the noetherian condition that every submodule of a finitely generated –module is again finitely generated. Using H3 in Section 5, we relate resolutions by –modules freely generated in finite ranks (see Section 5) with the central stability homology. We prove a quantitive version of the following theorem as Section 5, where we also consider partial resolutions.
Theorem A**.**
Let be a stability category. Assume H3. Let be a –module, then the following statements are equivalent.
- (a)
There is a resolution
[TABLE]
of by –modules that are freely generated in finite ranks. 2. (b)
The homology
[TABLE]
for all and all large enough in comparison to .
Let denote the full subcategory of whose objects (which are natural numbers) are exactly . Previously it has only been known that for all if and only if is generated in ranks . For , our is what is denoted by in [CEF15]. [CEFN14] and [PS14] have then used a noetherian property of the categories, they worked with, to show that all central stability homology vanishes for large enough . Theorem A explains this phenomenon very clearly. It also makes the existence of free resolutions tangible, when such a noetherian condition is not true. For example for and .
We call a –module centrally stable if for all large enough . This notion and terminology was introduced by Putman [Put15] for sequences of representations of the symmetric groups. Theorem A proves that under the assumption of H3, a –module is centrally stable if and only if is presented in for some sufficiently large . A –module is presented in a full subcategory with finitely many objects if and only if it is the left Kan extension of its restriction along the inclusion. Unfortunately this notion was also dubbed central stability in [PS14] and [CEFN14]. See Section 6 for more clarification on different notion used for central stability.
Polynomial functors
Many interesting examples of –modules satisfy polynomiality conditions. For example the dimensions of the permutation representations grow polynomially (even linearly). In fact [CEF15] proved that, assuming , dimensional growth is eventually polynomial for all finitely generated –modules. In Section 7, we recall the definition of the polynomial degree of a –module from [RWW15]. We say has polynomial degree if it is zero. For we say has polynomial degree if the map
[TABLE]
is always injective and its cokernel is a –module of polynomial degree . For example the constant –module has polynomial degree and the permutation representations have polynomial degree .
We formulate a new condition on stability categories, that involves the cokernel
[TABLE]
of the representable functors .
**H4: **
The central stability homology for all , all and all large enough in comparison to and .
It is easy to check that
[TABLE]
is free (eg see [CEFN14, Prop 2.2]) and thus H4 follows from H3 for (which is equivalent to ). We prove together with Jeremy Miller and Jennifer Wilson [MPW17] that and satisfy H4 if is a PID. In Section 7 we show that the stability category of the braid groups does not satisfy H4. It is unknown whether and satisfy H4. Assuming H4, we can make a statement about the central stability homology of –module with finite polynomial degree.
Theorem B**.**
Let be a stability category. Assume H3 and H4. Let be a –module with finite polynomial degree, then for all and all large enough in comparison to .
We prove a quantified version of this theorem with Section 7. This theorem is the main new ingredient of [MPW17], where we together with Jeremy Miller and Jennifer Wilson prove central stability for the second homology groups of Torelli subgroups of automorphism groups of free groups and mapping class groups as well as certain congruence subgroups of general linear groups.
Stability SES
In Section 8, we consider families of short exact sequences
[TABLE]
that are coming from morphisms of stability groupoids
[TABLE]
We call these families stability SES. For every –module , there is a –module such that
[TABLE]
Examples \theexsauto.
Here is a (very incomplete) list of interesting stability SES’s.
- (a)
The pure braid groups are the kernels in the sequence
[TABLE] 2. (b)
Fix a commutative ring and an ideal . The congruence subgroups are the kernels in the sequence
[TABLE]
where are the images of in . 3. (c)
Fix a commutative ring and an ideal . The congruence subgroups are the kernels in the sequence
[TABLE]
where are the images of in . 4. (d)
The Torelli subgroups of the automorphism groups are the kernels in the sequence
[TABLE] 5. (e)
The Torelli subgroups of the mapping class groups are the kernels in the sequence
[TABLE] 6. (f)
If there is an inclusion of , we can twist to receive a braided stability groupoid , where is the preimage of . Then
[TABLE]
is a stability SES. This has been done by Putman **[Put15]** for (b) and by the author together with Wu **[PW16]** for the Houghton groups. It could also be done for (c), (d), and (e).
Note that in all these examples and are braided, but is not. Assume for the following that and both are braided. The central technical tools of this paper are the following spectral sequences. Let be a –module and , then there are two spectral sequences
[TABLE]
and
[TABLE]
that converge to the same limit. In particular when for all large enough in comparison to , then both spectral sequences converge to zero in each diagonal for large enough .
As an application of this spectral sequence, we prove a generalization of a theorem of Putman and Sam [PS14, Thm 5.13].
Theorem C**.**
Let
[TABLE]
be a stability SES. Assume that , , and are braided. Let be a –module. Assume furthermore:
- (a)
All submodules of finitely generated –modules are finitely generated. (Noetherian condition) 2. (b)
* is a finitely generated –module for all .* 3. (c)
* is a finitely generated –module.* 4. (d)
* for all large enough in comparison to .*
Then is a finitely generated –module for every .
This spectral sequence is also an important tool in [MPW17], where we apply it to the stability SES’s in Section 1 (b), (d), and (e).
Finally in Section 9, we revisit Quillen’s argument for homological stability. We prove a theorem on homological stability with twisted coefficients. Randal-Williams and Wahl [RWW15, Thm A] prove a similar result but require their coefficients to have finite polynomial degree. If we additionally assume H4, our Theorem B implies that our condition is weaker, but in general our ranges are worse than theirs.
Theorem D**.**
Let be a stability category. Assume H3. Let be a –module with
[TABLE]
for all for some and , then the stabilization map
[TABLE]
is an epimorphism for all and an isomorphism for all .
Remark \theremauto.
Notice that Theorem D and Section 7 give criterions to check whether the double cosets
[TABLE]
stabilize with growing and fixed .
Acknowledgement
The author was supported by the Berlin Mathematical School and the Dahlem Research School. The author also wants to thank Aurlien Djament, Daniela Egas Santander, Reiner Hermann, Henning Krause, Daniel Lütgehetmann, Jeremy Miller, Holger Reich, Steven Sam, Elmar Vogt, Nathalie Wahl, Jenny Wilson for helpful conversations. Special thanks to Reiner Hermann and his invitation to NTNU where the idea for this project was born.
2. Central stability homology
Let be a small monoidal category with unit object [math]. In particular,
[TABLE]
is a bifunctor. Let be cocomplete category and the category of functors from to . Then the monoidal structure gives rise to a functor
[TABLE]
by precomposition of . This is the same as giving a functor
[TABLE]
from to the category of endofunctors of . Explicitly it sends an object to the suspension endofunctor
[TABLE]
Because is just the precomposition of , the functor has a left adjoint, namely the left Kan extension along (see [ML98, Cor X.3.2]). We will call its left adjoint the desuspension endofunctor and denote it by . There is an antiequivalence of categories between left and right adjoint endofunctors. (Cf [Kan58, Thm 3.2]) Consequently, there is a functor
[TABLE]
that sends to .
Clearly . Because is the right adjoint of
[TABLE]
Thus is in fact a monoidal functor, where is equipped with the monoidal structure .
Example \theexauto.
Consider the monoidal category (which is not small but has a small skeleton) and the cocomplete category of abelian groups. Then is given by
[TABLE]
for finite sets and and an –module . This –module is isomorphic to
[TABLE]
when and with .
Definition \theDefauto.
Let the augmented semisimplicial category be the category with objects the sets for and morphisms strictly increasing set maps.
[TABLE]
defines a monoidal structure on with the unit , which is additionally initial.
The following theorem describes how behaves universally among all monoidal categories with initial unit object. Let for the remainder of this section be a small monoidal category with initial unit object [math] and denote the initial maps by .
Theorem \thethmauto.
Let be an object in . Then there exists a unique monoidal functor that sends to .
Proof.
Similar to [Wei94, Ex 8.1.6], a functor is given by a sequence of objects and maps such that if then . To be monoidal must be for all . Because is initial, there is exactly one candidate for , which is the initial map . Further the other maps must have the following form.
[TABLE]
One easily checks that this satisfies the condition given. ∎
Definition \theDefauto.
Let an object of . Then we get an augmented semisimplicial object
[TABLE]
This is the same as a functor
[TABLE]
Thus for every functor we get an augmented semisimplicial object in with
[TABLE]
Definition \theDefauto.
Assume is an abelian category, we denote the associated chain complex of by and the homology of this chain complex by . We call this the central stability homology of .
A well known consequence of the Yoneda Lemma is that
[TABLE]
Example \theexauto.
Let us consider and , and let us fix a singleton. Given the representable functor, is given by
[TABLE]
with face maps given by precomposition of the morphisms
[TABLE]
where the hat indicates that is omitted.
Evaluating at , we get the (augmented) semisimplicial set
[TABLE]
from [RWW15, Def 2.1] associated to the homogeneous category .
More generally we can describe for a functor as a colimit. Let be the comma category whose objects are the pairs , then there is a forgetful functor
[TABLE]
Precomposing with this functor we get
[TABLE]
For a morphism in , the natural transformation is given by the functor
[TABLE]
mapping to the composition
[TABLE]
Example \theexauto.
For , and , the central stability homology is given by the semisimplicial –module with
[TABLE]
*where is the complement of the image of and the face maps given by the precomposition of the morphisms above and the inclusion of the complements. *
3. Stability categories
In this section we introduce stability categories that are a specific kind of homogeneous categories (see [RWW15, Def 1.3] or Section 3) and weakly complemented categories (see [PS14] or Section 3).
Definition \theDefauto.
Let be a monoidal groupoid whose monoid of objects is the natural numbers . The automorphism group of the object is denoted . Then is called a stability groupoid if it satisfies the following properties.
- (a)
The monoidal structure
[TABLE]
is injective for all . 2. (b)
The group is trivial. 3. (c)
* for all .*
Definition \theDefauto.
A homomorphism of stability groupoids is a monoidal functor sending to .
Remark \theremauto.
A stability groupoid is given by a sequence of groups and group homomorphisms
[TABLE]
satisfying additional properties that would require spelling out what a monoidal structure is. In notation we will usually suppress the monoidal structure and just write for a stability groupoid.
Similarly a homomorphism of stability groupoids
[TABLE]
is given by a sequence of group homomorphisms
[TABLE]
for which the diagrams
[TABLE]
commute.
Recall that a braiding of a monoidal category is a natural isomorphism between the functors and precomposed with a swap that has some additional conditions. In particular, there are isomorphisms
[TABLE]
for all objects , such that for all morphisms and the diagram
[TABLE]
commutes. For such natural isomorphism to be a braiding one also needs two hexagon identities. (Cf [ML98, Sec XI.1] for details.) If
[TABLE]
the braiding is called a symmetry.
For a stability groupoid , a braiding is given by isomorphisms
[TABLE]
such that
[TABLE]
for all and and
[TABLE]
which amounts to the hexagon identities.
For any monoidal groupoid , Randal-Williams and Wahl [RWW15, Sec 1.1] give a construction originally due to Quillen that yields the category .
Definition \theDefauto.
Let be a monoidal groupoid. The category has the same objects as and its morphisms from to are equivalence classes of pairs where is an object in and is an (iso)morphism in from . Two of these pairs and are equivalent if there is an isomorphism (in ) such that the diagram
[TABLE]
commutes.
Definition \theDefauto.
If is a braided stability groupoid, we call the stability category of .
The following definition is due to Randal-Williams and Wahl [RWW15, Def 1.3].
Definition \theDefauto.
Let be a monoidal category with initial [math]. is called a homogeneous category if it satisfies the following conditions for all objects :
**H1: **
* acts transitively on by postcomposition.*
**H2: **
The map taking to is injective and its image is
[TABLE]
where denotes the initial morphism.
* is called prebraided if its underlying groupoid is braided with a braiding , that satisfies the equation*
[TABLE]
for all objects .
Remark \theremauto.
The condition H2 is not only symmetric for symmetric homogeneous category ; prebraided suffices for this conclusion. Here is the reason. Clearly is also injective and the image lies in
[TABLE]
But assume then for some by H2 and thus
[TABLE]
The stability category of a braided stability groupoid is always a homogeneous category.
Proposition \thepropauto.
Let be a braided (symmetric) stability groupoid, then is a prebraided (symmetric) homogeneous category. And the underlying groupoid of is .
Proof.
In [RWW15, Prop 2.6(i)+(ii)] it is shown that [math] is initial in and that is prebraided. For H1 and H2 the statements [RWW15, Thm 1.8(c)+(d)] apply. For the second statement [RWW15, Prop 2.10] applies. ∎
In [RWW15, Rem 1.4] it is already stated that in every homogeneous category
[TABLE]
For this means
[TABLE]
Because there is cancellation in , the homomorphisms are given by equivalence classes of pairs for some and the above isomorphism is given by
[TABLE]
The composition is then
[TABLE]
for and .
The monoidal structure on is then given by
[TABLE]
for and .
Example \theexauto.
* is a braided stability groupoid with the braiding given by the permutation*
[TABLE]
In fact, the braiding of is a symmetry, wherefore it is also a symmetry on .
An example of a braided stability groupoid that is not symmetric is given by the braid groups . Its braiding is given by the following diagram.
[TABLE]
A stability category of a braided stability groupoid is also a weakly complemented category as defined by Putman and Sam [PS14].
Definition \theDefauto.
Let be a monoidal category with initial [math]. is called a weakly complemented category if it satisfies the following conditions for all objects :
- (a)
All morphisms are monomorphisms. 2. (b)
The map given by
[TABLE]
is injective. 3. (c)
For every morphism there is an object and an isomorphism such that . The pair is uniquely determined up to isomorphisms in the comma category .
Proposition \thepropauto.
Let be a braided stability groupoid, then is a weakly complemented category.
Proof.
Let , ie objects of and . To prove (a), by H1, we only have to show that is a monomorphism. Let such that
[TABLE]
Then there is an automorphism such that
[TABLE]
By definition
[TABLE]
Therefore and must coincide.
Using H1 to prove (b), it is enough to show that for every and the two equations
[TABLE]
imply . Using the second equation we get that
[TABLE]
thus by H2 there is a with . Applying the same trick to the first equation we get
[TABLE]
and therefore the existence of a with . For clearly .
(c) is true by definition of . ∎
For the remainder of this paper we assume that is a braided stability groupoid and thus is its prebraided stability category. Given a functor from to some category , we denote the images by .
Further for the object , we abbreviate by , respectively.
4. Central stability and stability categories
In this section, we explain some basic properties of the functor from Section 2 in the context of stability categories.
Proposition \thepropauto.
Let be objects in . Then the map given by is injective and its image is
[TABLE]
(Because of Section 3, the symmetric version of this statement is also true.)
Proof.
Given two morphisms from , and assume that
[TABLE]
Then there is an automorphism such that
[TABLE]
which implies that
[TABLE]
Because is injective,
[TABLE]
Thus
[TABLE]
and the map
[TABLE]
is injective.
If ,
[TABLE]
Let on the other hand such that
[TABLE]
Then
[TABLE]
whence there is an isomorphism with . Thus
[TABLE]
Proposition \thepropauto.
Let . Then there is an isomorphism
[TABLE]
For a map the corresponding morphism
[TABLE]
is given by
[TABLE]
with . This morphism is independent of the choice of .
Proof.
We know from Section 2 that
[TABLE]
Note that by construction, every morphism factors through an automorphism . Therefore there is a surjection
[TABLE]
There are still some relations, which are given by the precomposition by elements in . Therefore
[TABLE]
together with the (choice-free) maps
[TABLE]
given by
[TABLE]
where and .
To understand the functoriality, we see that
[TABLE]
is given by
[TABLE]
Therefore
[TABLE]
maps to
[TABLE]
via corresponding to . Thus
[TABLE]
where with . ∎
A similar proposition can be made for functors :
Proposition \thepropauto.
Let . Then there is an isomorphism
[TABLE]
For a map the corresponding morphism
[TABLE]
is given by
[TABLE]
with . This morphism is independent of the choice of .
This allows us to describe the face maps of the semisimpicial set for a –set . Recall that
[TABLE]
Then
[TABLE]
is given by
[TABLE]
Example \theexauto.
The functor sends every object to a singleton. Then
[TABLE]
Which is the semisimplicial set from [RWW15, Def 2.1].
Example \theexauto.
We can now pick up Section 2 again. Let . As from Section 3 is a skeleton of , we have
[TABLE]
by sending to
[TABLE]
in the summand corresponding to
[TABLE]
Functors that preserve monomorphisms, such as representable functors, send all maps in to injective set maps. For such functors we can split into a disjoint union.
Proposition \thepropauto.
Let preserve monomorphisms. Then the semisimplicial set splits disjointly
[TABLE]
into augmented semisimplicial sets with
[TABLE]
where is a complement of .
Proof.
Because , the augmented semisimplicial set splits into
[TABLE]
with the preimage of which is
[TABLE]
using Section 4. Because preserves monomorphims, the set map is injective. Thus for every there is at most one with . Therefore can be included into by sending to .
Finally, note that
[TABLE]
5. Central stability and finiteness properties
Definition \theDefauto.
We call a functor from a category to the category of sets a –set and write . A –set is generated in ranks if there is an epimorphism of –sets where is a disjoint union
[TABLE]
of representable functors such that for all .
Fix a ring . We call a functor from a category to the category of –modules a –module and write . A –module is generated in ranks if there is an epimorphism of –modules where is a direct sum
[TABLE]
such that for all .
In both situations we call such a freely generated in ranks .
Remark \theremauto.
For –modules, a similar notion has been called “freely generated” by for example [CEF15]. The –module has a linear right action by . Let be a not necessarily free –module, then
[TABLE]
is a –module. These modules are projective over if and only if is a projective –module. Therefore we will not call these freely generated as [CEF15] do in the case of –modules.
Let be a –set or a –module, then is a sequence of –sets or –representations, respectively, and is –equivariant. The following lemma is a criterion when such a sequence is actually a –set or a –module. This criterion has been observed by Church–Ellenberg–Farb [CEF15, Rmk 3.3.1] for the special case of –modules but the argument easily generalizes as shown in [RWW15, Prop 4.2].
Lemma \thelemauto.
Let be a sequence of –modules or –sets (resp.) and –equivariant maps .
There is a unique –module or –set (resp.) with and if and only if for all and
[TABLE]
where .
We want to connect the central stability homology to generation properties.
Proposition \thepropauto.
Let be a functor to or to . Then is generated in the ranks if and only if the map
[TABLE]
induced by is surjective for all .
Proof.
We give the proof for . For the proof is analogous after linearlizing.
Let . Then for a representable functor
[TABLE]
is given by is surjective because acts transitively on by postcomposition. Let there be an epimorphism
[TABLE]
such that all . The diagram
[TABLE]
commutes because is a natural transformation between endofunctors. This implies the first implication.
Let be a functor for which
[TABLE]
is surjective for all . Let be a disjoint union
[TABLE]
of representable functors with together with a morphism of –sets such that
[TABLE]
is surjective for all . (The Yoneda Lemma lets us find such a .)
Let and assume that is surjective by induction. Then the following commutative diagram show that is surjective.
[TABLE]
The previous proposition says that a –module is generated in finite ranks if and only if is stably zero, ie for all large enough. We next want to generalize this concept. For this we need an additional condition.
Definition \theDefauto.
Let . We define the following condition.
**H3(): **
* for all and all .*
Remark \theremauto.
Note that the condition LH3 in [RWW15, Def 2.2] implies H3() with . For all of Section 1, they prove or gather the following values from existing literature.
[TABLE]
Theorem \thethmauto.
Assume H3(). Let be a –module and with , then the following statements are equivalent.
- (a)
There is a partial resolution
[TABLE]
with that are freely generated in ranks . 2. (b)
The homology
[TABLE]
for all and all .
To prove this theorem we first compute the central stability homology of free –modules. This part is quite technical and can easily be skipped upon the first read. Assuming Section 5, the proof of Section 5 is straight forward.
To compute the central stability homology of free –modules, we investigate . We first introduce the concept of joins and links for augmented semisimplicial sets. We say is a join of the –simplex and the –simplex in a semisimplicial object if
[TABLE]
and let the left- and right-sided link be
[TABLE]
In the –simplices are morphisms from . And for
[TABLE]
Condition (b) of Section 3 implies that is unique if it exists. More generally we write for and if
[TABLE]
Lemma \thelemauto.
Let , then
[TABLE]
and
[TABLE]
Proof.
Assume
[TABLE]
then
[TABLE]
Similarly if
[TABLE]
then
[TABLE]
For the opposite direction apply Section 4 to
[TABLE]
and
[TABLE]
Corollary \thecorauto.
Let , then both
[TABLE]
Proposition \thepropauto.
Assume H3(). Then
[TABLE]
for all and all .
Proof.
From Section 4 we know that is isomorphic to
[TABLE]
with
[TABLE]
where is a complement of . Note that
[TABLE]
that is the set of those morphisms that factor through , is independent of the choice of . Because
[TABLE]
Section 5 gives that , hence
[TABLE]
This means that for every –module freely generated in ranks , for all and . ∎
This proposition suffices to prove Section 5. First we will derive a corollary that the modules described in Section 5 have vanishing central stability homology in the same range as the freely generated –module . Note that in Section 5 (a) implies (b) for any partial resolution with vanishing central stability homology in the same ranges as the that are freely generated in ranks .
Corollary \thecorauto.
Assume H3(). Let be an –module. Then
[TABLE]
for all and all .
Proof.
Let
[TABLE]
be a projective resolution of by –modules. We consider the complex
[TABLE]
and its two spectral sequences. The first spectral sequence
[TABLE]
is given by
[TABLE]
because
[TABLE]
is a free –module.
The second spectral sequence
[TABLE]
that converges to the same limit, computes to
[TABLE]
Therefore the central stability homology of vanishes in the same range as . ∎
Proof of Section 5.
Assume (a). Let and let
[TABLE]
for . Then the long exact sequence of for the short exact sequence
[TABLE]
implies that
[TABLE]
is injective for all and all . Because for all , we know from Section 5 that
[TABLE]
for all . Thus
[TABLE]
is zero for all and because
[TABLE]
for .
Now assume (b). Let by induction
[TABLE]
be a partial resolution such that is freely generated in ranks for all . Let as before and let
[TABLE]
for . We need to prove that is generated in ranks . Similar as before
[TABLE]
is surjective for all and all . Thus
[TABLE]
for all
[TABLE]
Definition \theDefauto.
We call a –modules stably acyclic if for all and all large enough.
We want to conclude this section by giving an example that is by definition stably acyclic, but the existence of the free resolution as in Section 5 is not a priori clear. More generally, in Section 7 we find a condition H4 on such that all –modules with finite polynomial degree (see Section 7) are stably acyclic.
Corollary \thecorauto.
Assume H3(). Let be a –module such that for all . Then there is a resolution
[TABLE]
with that are freely generated in ranks .
6. Notions of central stability
Different notions of central stability have been used in the past. We want to clear this up for stability categories. In the following proposition we prove the equivalence of four conditions. The condition (a) is called “presented in degree ” in [CEF15, CE16]. In [PS14], condition (b) is called “central stability”. And conditions (c) and (d) are used in [CEFN14], although they phrase the colimit over an equivalent category. We will refer to this notion as in (a) by presented in the ranks .
Proposition \thepropauto.
Let be a –module, then the following are equivalent.
- (a)
* is generated and presented in the ranks , ie there are –modules freely generated in the ranks such that*
[TABLE]
is exact. 2. (b)
Let be the full subcategory with the objects . The left Kan extension
[TABLE]
is naturally isomorphic to . 3. (c)
For all there is a natural isomorphism
[TABLE] 4. (d)
For all there is a natural isomorphism
[TABLE]
Proof.
Djament [Dja16, Prop 2.14] proves that (a) and (b) are equivalent in an even more general setting. Gan–Li [GL17, Thm 3.2] gave a different proof with the viewpoint of graded modules over graded nonunital algebra.
The left Kan extension evaluated at can be expressed as the colimit in (c) (see [ML98, Cor X.3.4]):
[TABLE]
This proves that (c) is equivalent to (b).
Finally we want to prove that (c) and (d) are equivalent. First note that
[TABLE]
is just a different way of writing the same colimit. Further there is a natural map
[TABLE]
And because is a full subcategory of there is a map
[TABLE]
and similarly fixing a morphism there is a map
[TABLE]
Let us prove the following claim.
Claim. Let and assume that
[TABLE]
is an isomorphism for all , then
[TABLE]
is an isomorphism.
Proof.
For every morphism which is an object in , we get the following diagram.
[TABLE]
Here is the unique map such that . One checks also checks that . This implies that
[TABLE]
The universal property of the colimits implies that and are inverses. ∎
We now want to finish our proof of the equivalence of (c) and (d) by induction over . For the statements are identical. Now assume that
[TABLE]
for all . Then we can certainly assume
[TABLE]
is an isomorphism for all . The claim then finishes the induction step. ∎
Putman’s [Put15] original notion of central stability for –modules is reflected in condition (c) of the following proposition. In the case of symmetric stability categories, this is equivalent to (a), which we call centrally stable in the ranks .
Proposition \thepropauto.
Let be a –module, then the following are equivalent.
- (a)
* for all .* 2. (b)
V_{n}\cong\operatorname{coeq}\big{(}\operatorname{Ind}^{G_{n}}_{G_{n-2}}V_{n-2}\rightrightarrows\operatorname{Ind}^{G_{n}}_{G_{n-1}}V_{n-1}\big{)}* for all .*
If is symmetric, then the following condition is equivalent to the first two.
- (c)
V_{n}\cong\operatorname{coeq}\big{(}\operatorname{Ind}^{G_{n}}_{G_{n-2}\times\mathfrak{S}_{2}}V_{n-2}\otimes\mathcal{A}_{2}\rightrightarrows\operatorname{Ind}^{G_{n}}_{G_{n-1}}V_{n-1}\big{)}* for all , where and is its sign representation.*
Proof.
Conditions (a) and (b) are equivalent because (b) is equivalent to the sequence
[TABLE]
being exact, which is part of the central stability complex.
To see that (b) and (c) are equivalent, we have to check the image that the images in coincide. Let be the transposition, then both maps are given by
[TABLE]
for . This completes the proof. ∎
With Section 5 we can connect these two notions. Note that the assumption of the theorem can be expressed as follows.
**H3(): **
and generate for all .
Corollary \thecorauto.
Assume H3(). Let be a –module. Then the following are equivalent.
- (a)
* is generated in ranks and presented in ranks .* 2. (b)
* is generated in ranks and centrally stable in the ranks .*
Corollary \thecorauto.
- (a)
A –module is generated in ranks and presented in ranks if and only if it is generated in ranks and centrally stable in the ranks . 2. (b)
Let be a ring with stable rank . A –module is generated in ranks and presented in ranks if and only if it is generated in ranks and centrally stable in the ranks . 3. (c)
Let be a ring with unitary stable rank . A –module is generated in ranks and presented in ranks if and only if it is generated in ranks and centrally stable in the ranks . 4. (d)
A –module is generated in ranks and presented in ranks if and only if it is generated in ranks and centrally stable in the ranks . 5. (e)
A –module is generated in ranks and presented in ranks if and only if it is generated in ranks and centrally stable in the ranks . 6. (f)
A –module is generated in ranks and presented in ranks if and only if it is generated in ranks and centrally stable in the ranks .
7. Polynomial degree
As we defined as the precomposition of , for the next definition we will use defined as the precomposition of . The following definition is an adaptation of van der Kallen’s [vdK80] degree of a coefficient system. Our version is almost identical with [RWW15, Def 4.10].
Definition \theDefauto.
Let be a –module then we define the –modules
[TABLE]
We say has polynomial degree in the ranks if for all . For we say has polynomial degree in the ranks if for all and has polynomial degree in the ranks .
Remark \theremauto.
Assuming that the dimension of is finite for all , having polynomial degree in the ranks implies that the dimension grows polynomially of degree in the ranks .
Lemma \thelemauto.
- (a)
Let
[TABLE]
be an exact sequence of –modules in ranks , i.e.
[TABLE]
is a short exact sequence for all . Then if two of the three –modules have polynomial degrees in ranks , then so does the third. 2. (b)
Assume the base ring is a field. If and are –modules have polynomial degrees and in ranks , respectively, then has polynomial degree in ranks , where is defined by .
Proof.
- (a)
From the snake lemma we get an exact sequence
[TABLE]
for all . If has polynomial degree in ranks ,
[TABLE]
for all . Hence this sequence actually splits into two short exact sequences. If and have finite polynomial degree, then the above sequence still splits into two short exact sequences. The assertion is shown by induction on the degree. 2. (b)
If , also has polynomial degree in ranks . Thus for all large enough . For an induction argument we consider the following commutative diagram.
[TABLE]
Clearly the three columns are exact. By chasing this diagram, we can prove that the top and the bottom row are also exact. Even more,
[TABLE]
is a short exact sequence for all because is injective for all . By induction has polynomial degree in ranks using (a).∎
The following lemma is essentially [PS14, Lem 3.11].
Lemma \thelemauto.
Let be a –module then the map induces the zero map on . This implies that every morphism of that is not an isomorphism induces the zero map on .
Proof.
Let
[TABLE]
be given by the inclusion . Then the following diagram commutes by the calculations from Section 4.
[TABLE]
The exactness of the lower row implies that must be the zero map. Thus surjectivity of implies the assertion. ∎
Proposition \thepropauto.
Let be a –module and . If is generated in ranks , then is generated in ranks .
Proof.
We consider the following diagram.
[TABLE]
The map is the zero map because of Section 7. Thus there is an epimorphism
[TABLE]
This implies that is generated in ranks . Using Section 7 again, we infer that for all . Therefore is generated in ranks by Section 5. ∎
Definition \theDefauto.
Let . We define the following condition.
**H4(): **
* for all and all .*
Remark \theremauto.
Knowing that is stably acyclic for all , one can also follow that is stably acyclic for all .
Proposition \thepropauto.
Let . Assume H3() and H4() with . Let with . If for all and for all and all , then for all and .
Proof.
The case is proved in Section 7.
Let . By induction
[TABLE]
for all for . Section 5 implies the existence of a resolution
[TABLE]
by –modules that are freely generated in ranks , because . If we can prove that is generated in ranks , we are done. Let
[TABLE]
with the convention . Because is exact, the snake lemma gives us the exact sequence
[TABLE]
If , is a submodule of . Therefore there is a long exact sequence
[TABLE]
By the assumption on , we see that
[TABLE]
is surjective for all and all .
If , ie , this method only infers
[TABLE]
is surjective for all . Because for all ,
[TABLE]
for all . Therefore in the same range
[TABLE]
is injective.
Thus the assumption that for all implies
[TABLE]
in the same range because
[TABLE]
and
[TABLE]
By Section 7, is generated in ranks . ∎
A direct consequence of this proposition is Theorem B:
Corollary \thecorauto.
Assume H3() and H4() with . Let , and let be of polynomial degree in ranks , then for all and .
Proof.
For , for all . Then for all . Let and for let
[TABLE]
if and
[TABLE]
if . Then , for all
[TABLE]
and for all
[TABLE]
Therefore by Section 7,
[TABLE]
for all . This proves the case .
Let and define
[TABLE]
By induction for all
[TABLE]
We also have that
[TABLE]
and
[TABLE]
for all
[TABLE]
Thus we can apply Section 7 to get
[TABLE]
for all . This proves the case . ∎
From H3() and a long exact sequence we get that
[TABLE]
is surjective for all and all . With the next proposition we will express in form of the semisimplicial sets that are analyzed in [RWW15].
Proposition \thepropauto.
The augmented semisimplicial set is isomorphic to the disjoint union of augmented semisimplicial sets
[TABLE]
with the embedding of by .
Proof.
From Section 4 we know that is isomorphic to
[TABLE]
with
[TABLE]
where is a complement of . The equation
[TABLE]
and
[TABLE]
together with Section 5 gives that , hence
[TABLE]
Example \theexauto.
Here we want to provide an example of a stability category that satisfies H3() but does not even satisfy H4([math]). We will explain why is not generated in finite ranks. Let which is the coset that is represented by a braid . Now
[TABLE]
which is depicted in the following diagram.
[TABLE]
Our claim, that is not generated in finite ranks, amounts to showing
[TABLE]
This follows because the braid
[TABLE]
is not contained in the LHS.
8. Short exact sequences
In this section will deal with short exact sequences of groups and stability groupoids. We restate some well-known properties of group homology regarding these short exact sequences in the language of modules over stability categories. Most of the arguments of this section have already appeared in [PS14] but we hope that they become more accessible in the language of this paper.
Let
[TABLE]
be a short exact sequence of groups. We want to describe the group homology of as a –module. For this let us first review how an automorphism acts on for some –module (given an –homomorphism , ie .) Let be a free (right) –resolution of the trivial representation . Let be an –homomorphism. (This can always be found and any two are chain homotopic.) Then induces the map
[TABLE]
Note that the RHS is canonically isomorphic to because is a bijection.
Let be an inner automorphism of , say conjugation by . Then and fulfill the above requirements. But then is in fact the identity on .
Let be a free (right) –resolution of the trivial representation . Assume is the restriction of an –module and the conjugation by an element . ( is normal in .) Then and fulfill the above requirements as before. Note that is not the identity on . Summarizing, we have seen that is an –module by
[TABLE]
This induces an –module structure on for every –module .
Now we generalize this concept.
In this section, we deal with multiple stability groupoids .
For the most time we assume that and are braided, in which their stability categories and are monoidal and prebraided, whence it makes sense to take of their central stability complex and homology, which we denote by and , respectively.
Definition \theDefauto.
Let and be homomorphisms of stability groupoids. We call this data a stability SES if
[TABLE]
is a short exact sequence for all .
Proposition \thepropauto.
Let be stability groupoids and a homomorphism of stability groupoids and is surjective for every . Then there is a stability groupoid and a homomorphism of stability groupoids such that
[TABLE]
is a stability SES.
Proof.
Let be the kernel of and the embedding of in . Let be the groupoid formed by these groups and the functor given by all ’s. Because
[TABLE]
we get an injective group homomorphism
[TABLE]
This proves that is a stability groupoid. All other assertions are immediate. ∎
Lemma \thelemauto.
Let
[TABLE]
be a stability SES and a –module. Then for every there is a –module with
[TABLE]
We denote this –module by and abbreviate if .
Proof.
We will use Section 5 for this proof.
We already know that for every we have a sequence of –representations. Let
[TABLE]
be induced by . On the chain complex level this is
[TABLE]
induced by .
That means that
[TABLE]
is induced by the map
[TABLE]
Because for some is a –automorphism of the free resolution , it is homotopic to the identity. By functoriality the homotopy descends to . Therefore induces the identity on . By the following commutative diagram, the action of on is trivial. This finishes the proof by application of Section 5.
[TABLE]
The central technical tool of this section is the following spectral sequence.
Proposition \thepropauto.
Let
[TABLE]
be a stability SES. Assume that , , and are braided. Let be a –module. Then the two spectral sequences constructed from the double complex
[TABLE]
are
[TABLE]
and
[TABLE]
Proof.
The first spectral sequence is given by
[TABLE]
Therefore
[TABLE]
The other spectral sequence is given by
[TABLE]
The differential is induced by the map
[TABLE]
with and .
Then there is a –equivariant isomorphism
[TABLE]
given by
[TABLE]
Therefore
[TABLE]
Because the following diagram commutes, coincides with the differential of .
[TABLE]
is given by
[TABLE]
The idea for this spectral sequence can be found in [PS14]. The following immediate consequence illustrates how it can be used.
Corollary \thecorauto.
Let
[TABLE]
be a stability SES. Assume that , , and are braided. For each , there is a spectral sequence
[TABLE]
that converges to zero for if satisfies H3().
Proof.
The two spectral sequences in Section 8 converge to the same limit. The first will converge to zero for by H3() if we set to be . In particular, the diagonals converge to zero. Thus the same is true for the second spectral sequence. ∎
The proof of Theorem C uses the same methods as Putman and Sam in [PS14, Theorem 5.13].
Proof of Theorem C.
We may use the spectral sequences from Section 8. The first spectral sequence implies that both converge stably to zero, because is stably acyclic. We will now prove the result by induction on .
For note that because
[TABLE]
we get
[TABLE]
Because is right exact it follows that is a finitely generated –module.
Let and assume is finitely generated for all . From the Noetherian condition we get that is stably acyclic for all . Now using the second spectral sequence from Section 8, we infer is stably zero, because the only incoming and outgoing differentials are all stably zero. Section 5 and the assumption that is a finitely generated –module for all implies that is finitely generated. ∎
9. Quillen’s argument revisited
In this section we will solely prove Theorem D from the introduction.
Proof of Theorem D.
We consider the stability SES
[TABLE]
where is the category whose objects are the natural numbers and whose morphisms are only the identity maps. In Section 8, we constructed two spectral sequences for this situation. From the first
[TABLE]
which is zero for , we see that both spectral sequences converge to zero when . The other spectral sequence is given by
[TABLE]
The differentials are easy to understand:
[TABLE]
is zero if is odd and it is if is even. In particular is the stabilization map
[TABLE]
Assume , we want to prove that is surjective. We know that if , in particular when . We want to use induction to show that when and . This would imply that already vanishes and is surjective. If is even, to show that it suffices to show that
[TABLE]
is surjective. By induction this is the case if . If is odd, it suffices to show that
[TABLE]
is injective. By induction this is true if , which is the same condition. We know that
[TABLE]
which is what we need.
Assume , we want to prove that is injective. We know that for , in particular when . Again we prove when and by induction, which implies that and is injective. We already computed that vanishes when . And we calculate
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[CE 16] Thomas Church and Jordan S. Ellenberg. Homology of FI-modules. Preprint, 2016, ar Xiv:1506.01022 v 2 , to appear in Geom. Topol.
- 2[CEF 15] Thomas Church, Jordan S. Ellenberg, and Benson Farb. FI-modules and stability for representations of symmetric groups. Duke Math. J. , 164(9):1833–1910, 2015.
- 3[CEFN 14] Thomas Church, Jordan S. Ellenberg, Benson Farb, and Rohit Nagpal. FI-modules over Noetherian rings. Geom. Topol. , 18(5):2951–2984, 2014.
- 4[CF 13] Thomas Church and Benson Farb. Representation theory and homological stability. Adv. Math. , 245:250–314, 2013.
- 5[Dja 16] Aurélien Djament. Des propriétés de finitude des foncteurs polynomiaux. Fund. Math. , 233(3):197–256, 2016.
- 6[GL 17] Wee Liang Gan and Liping Li. On central stability. Preprint, 2017, ar Xiv:1504.07675 v 5 .
- 7[Kan 58] Daniel M. Kan. Adjoint functors. Trans. Amer. Math. Soc. , 87:294–329, 1958.
- 8[ML 98] Saunders Mac Lane. Categories for the working mathematician , volume 5 of Graduate Texts in Mathematics . Springer-Verlag, New York, second edition, 1998.
