nLab cyclic category

Redirected from "cycle category".
The cyclic category

The cyclic category

1. Idea

The cyclic category (Connes 83, see Cartier 85) typically denoted Λ\Lambda (or sometimes 𝒞\mathcal{C}) is a small category whose presheaves – called cyclic sets or more generally cyclic objects – are somewhere intermediate between simplicial sets and symmetric sets. It strictly contains the simplex category, and has cyclic groups for automorphism groups. Among its virtues, it is a self-dual category.

The cycle category is used for the description of the cyclic structure on Hochschild homology/Hochschild cohomology and accordingly for the description of cyclic homology/cyclic cohomology.

2. Definitions

Multiple descriptions of the cyclic category Λ\Lambda are possible, but a convenient starting point is to consider first a category LL whose objects are natural numbers n0n \geq 0, and where the hom-set L(m,n)L(m, n) consists of increasing functions f:f: \mathbb{Z} \to \mathbb{Z} satisfying the “spiraling property”, that f(i+m+1)=f(i)+n+1f(i + m + 1) = f(i) + n + 1, with composition given by ordinary function composition. The category LL is (equivalent to) the category Λ \Lambda_\infty called the paracyclic category by Nikolaus and Scholze.

Then, define Λ\Lambda to be a quotient category of LL having the same objects, with Λ(m,n)=L(m,n)/\Lambda(m, n) = L(m, n)/\sim where \sim is the equivalence relation for which fgf \sim g means fgf - g is a constant multiple of n+1n+1. Let q:LΛq: L \to \Lambda be the quotient.

Remark 2.1. Notice that fL(m,n)f \in L(m, n) is completely determined by the values f(0),,f(m)f(0), \ldots, f(m). There is a faithful embedding i:ΔLi \colon \Delta \to L which on objects is the identity, where fL(m,n)f \in L(m, n) belongs to the image of ii iff 0f(0)0 \leq f(0) and f(m)nf(m) \leq n. The composite

ΔiLqΛ\Delta \stackrel{i}{\hookrightarrow} L \stackrel{q}{\to} \Lambda

is again faithful, so that the simplex category sits inside Λ\Lambda.

Remark 2.2. Of course the successor function τ:\tau \colon \mathbb{Z} \to \mathbb{Z} gives a function τ nL(n,n)\tau_n \in L(n, n) defined by τ n(i)=i+1\tau_n(i) = i+1, which in turn induces a function q(τ)Λ(n,n)q(\tau) \in \Lambda(n, n) such that q(τ) n+1=1 nq(\tau)^{n+1} = 1_n. In this way, we have inclusions /(n+1)Λ(n,n)\mathbb{Z}/(n+1) \hookrightarrow \Lambda(n, n) of cyclic groups inside Λ\Lambda.

Cyclic objects in a category CC are the contravariant functors Λ opC\Lambda^{\mathrm{op}}\to C, cocyclic objects are the covariant functors ΛC\Lambda\to C. Note that Λ\Lambda itself is, via its inclusion into CatCat, an example of a cocyclic object in CatCat. (Thus, the common term “the cyclic category” to refer to Λ\Lambda is misleading, just like using “the simplicial category” to refer to the simplex category Δ\Delta.)

If AA is an abelian category then the category of AA-presheaves on Λ\Lambda is usually called (Connes's) category of cyclic modules in AA.

3. Structure of the cyclic category

To analyze the structure of Λ\Lambda further, we make a series of easy observations. These are largely based on Elmendorf 93.

Proposition 3.1. Every morphism ff of LL, regarded as a functor \mathbb{Z} \to \mathbb{Z}, has a left adjoint f *:f^\ast: \mathbb{Z} \to \mathbb{Z} that is also a morphism of LL. Similarly, every morphism ff of LL has a right adjoint f *f_\ast belonging to LL.

Proof. By the spiraling property of ff, for any jj \in \mathbb{Z} the comma category (jf)(j \downarrow f) as a subset of \mathbb{Z} has a lower bound in \mathbb{Z} and hence is well-ordered. It is also nonempty, and we define f *(j)f^\ast(j) to be the least element of (jf)(j \downarrow f). In other words f *(j)f^\ast(j) is the least ii such that jf(i)j \leq f(i). It is easy to check that f *f^\ast obeys the spiraling property f *(j+n+1)=f *(j)+m+1f^\ast(j+n+1) = f^\ast(j)+m+1, since

f *(j+n+1)f *(j)+m+1 iff j+n+1f(f *(j)+m+1) iff j+n+1f(f *(j))+n+1 iff jf(f *(j)) iff f *(j)f *(j)\array{ f^\ast(j+n+1) \leq f^\ast(j)+m+1 & iff & j+n+1 \leq f(f^\ast(j)+m+1) \\ & iff & j+n+1 \leq f(f^\ast(j))+n+1 \\ & iff & j \leq f(f^\ast(j)) \\ & iff & f^\ast(j) \leq f^\ast(j) }

and

f *(j)+m+1f *(j+n+1) iff f *(j)f *(j+n+1)m1 iff jf(f *(j+n+1)m1) iff jf(f *(j+n+1))n1 iff j+n+1f(f *(j)+n+1) iff f *(j+n+1)f *(j+n+1).\array{ f^\ast(j)+m+1 \leq f^\ast(j+n+1) & iff & f^\ast(j) \leq f^\ast(j+n+1)-m-1 \\ & iff & j \leq f(f^\ast(j+n+1)-m-1) \\ & iff & j \leq f(f^\ast(j+n+1))-n-1 \\ & iff & j + n + 1\leq f(f^\ast(j) + n + 1) \\ & iff & f^\ast(j+n+1) \leq f^\ast(j+n+1). }

Also, since (,)(\mathbb{Z}, \leq) as a category is self-dual, every morphism ff of LL dually has a right adjoint that is a morphism of LL.  ▮

Corollary 3.2. LL is a self-dual category.

Proof. The duality functor L opLL^{op} \to L is the identity on objects and takes f:mnf: m \to n to f *:nmf^\ast: n \to m. It is contravariant since the left adjoint of a composite fgf g is g *f *=(fg) *g^\ast f^\ast = (f g)^\ast. It is an equivalence because its inverse is the right-adjoint mapping, ff *f \mapsto f_\ast.  ▮

Proposition 3.3. Λ\Lambda is a self-dual category.

Proof. If fgf \sim g in L(m,n)L(m, n), then f=τ k(n+1)gf = \tau^{k (n+1)} \circ g for some kk \in \mathbb{Z}. Observe that τ *=τ 1\tau^\ast = \tau^{-1}, so f *=g *τ k(n+1)=τ k(m+1)g *f^\ast = g^\ast \circ \tau^{-k(n+1)} = \tau^{-k(m+1)} \circ g^\ast where the last equation holds because g *:nmg^\ast: n \to m is spiraling. This shows f *g *f^\ast \sim g^\ast, i.e., the self-duality of LL descends to Λ\Lambda.  ▮

Proposition 3.4. For a morphism fL(m,n)f \in L(m, n), we have f *(0)0f^\ast(0) \leq 0 iff 0f(0)0 \leq f(0), and 0f *(0)0 \leq f^\ast(0) iff f(m)f(n)f(m) \leq f(n). Hence f *(0)=0f^\ast(0) = 0 iff (0f(0)0 \leq f(0) and f(m)nf(m) \leq n).

Proof. The first assertion is immediate from the adjunction f *ff^\ast \dashv f. The second follows from the deduction

0f *(0) iff 1<f *(0) iff ¬(f *(0)1) iff ¬(0f(1)) iff f(1)<0 iff f(m)<n+1 iff f(m)n\array{ 0 \leq f^\ast(0) & iff & -1 \lt f^\ast(0) \\ & iff & \neg (f^\ast(0) \leq -1) \\ & iff & \neg (0 \leq f(-1)) \\ & iff & f(-1) \lt 0 \\ & iff & f(m) \lt n+1 \\ & iff & f(m) \leq n }

where the step to the penultimate line used the spiraling property.  ▮

The previous proposition, in conjunction with the self-duality of LL and Remark 2.1, shows that Δ op\Delta^{op} faithfully maps to LL by Δ op(m,n){fL(m,n):f(0)=0}\Delta^{op}(m, n) \cong \{f \in L(m, n): f(0) = 0\}. Passing to the quotient q:LΛq: L \to \Lambda, this description also realizes Δ op\Delta^{op} as sitting inside Λ\Lambda, and the next result is immediate.

Proposition 3.5. Every morphism f:mnf: m \to n in Λ\Lambda may be uniquely decomposed as f=τ n f(0)gf = \tau_n^{f(0)} g where gg belongs to Δ op(m,n)L(m,n)\Delta^{op}(m, n) \subset L(m, n), and the exponent f(0)f(0) is considered modulo n+1n+1.

Proposition 3.6. The cyclic group /(m+1)\mathbb{Z}/(m+1) acts on Δ op(m,n)\Delta^{op}(m, n) via the following formula for fL(m,n),f(0)=0f \in L(m, n), f(0) = 0:

kf=τ f(k)fτ kk \cdot f = \tau^{-f(k)} \circ f \circ \tau^k

or in other words, via (kf)(i)f(k+i)f(k)(k \cdot f)(i) \coloneqq f(k+i) - f(k).

Proof. Clearly kf{gL(m,n):g(0)=0}k \cdot f \in \{g \in L(m, n): g(0) = 0\}. We calculate

j(kf) = τ (kf)(j)(kf)τ j = τ (f(j+k)f(k))τ f(k)fτ kτ j = τ f(j+k)fτ j+k = (j+k)f.\array{ j \cdot (k \cdot f) & = & \tau^{-(k \cdot f)(j)} \circ (k \cdot f) \circ \tau^j \\ & = & \tau^{-(f(j+k) - f(k))} \circ \tau^{-f(k)} \circ f \circ \tau^k \circ \tau^j \\ & = & \tau^{-f(j+k)} \circ f \circ \tau^{j+k} \\ & = & (j + k) \cdot f. }

Moreover, ((m+1)f)(i)=f(i+m+1)f(0+m+1)=f(i)+n+1(f(0)+n+1)=f(i)f(0)=f(i),((m+1)\cdot f)(i) = f(i+m+1)-f(0+m+1) = f(i)+n+1 - (f(0)+n+1) = f(i) - f(0) = f(i), so that the \mathbb{Z}-action (k,f)kf(k, f) \mapsto k \cdot f factors through a /(m+1)\mathbb{Z}/(m+1)-action.  ▮

Proposition 3.7. Every morphism f:mnf: m \to n in Λ\Lambda may be uniquely decomposed as f=hτ m kf = h \tau_m^{-k} where hh belongs to Δ\Delta and kk is unique modulo m+1m+1. The cyclic group /(n+1)\mathbb{Z}/(n+1) acts on Δ(m,n){fL(m,n):0f(0)andf(m)n\Delta(m, n) \cong \{f \in L(m, n): 0 \f(0)\; and\; f(m) \leq n by the formula kf=τ kfτ f *(k)k \cdot f = \tau^{-k} \circ f \circ \tau^{f^\ast(k)}.

Proof. This follows from previous propositions by dualizing. For fL(m,n)f \in L(m, n) we write f *:nmf^\ast: n \to m uniquely in the form τ m kg\tau_m^k g with gΔ op(n,m)g \in \Delta^{op}(n, m), by Proposition 3.5. Taking right adjoints, f=g *τ m kf = g_\ast \tau_m^{-k} where g *Δ(m,n)g_\ast \in \Delta(m, n). We define the action on Δ(m,n)\Delta(m, n) by conjugating the action on Δ op(n,m)\Delta^{op}(n, m) provided by Proposition 3.6, i.e., for fΔ(m,n)f \in \Delta(m, n) we define

kf=(kf *) *=[τ f *(k)f *τ k] *=(τ k) *f * *(τ f *(k)) *=τ kfτ f *(k)k \cdot f = (k \cdot f^\ast)_\ast = [\tau^{-f^\ast(k)} \circ f^\ast \circ \tau^k]_\ast = (\tau^k)_\ast \circ f^\ast_\ast \circ (\tau^{-f^\ast(k)})_\ast = \tau^{-k} \circ f \circ \tau^{f^\ast(k)}

and this conjugation preserves the action axioms.  ▮

Denoting the generator q(τ n)q(\tau_n) of Aut Λ([n])\Aut_\Lambda([n]) also by τ n\tau_n, we saw τ n n+1=id [n]\tau_n^{n+1} = \mathrm{id}_{[n]}. One may read off from the development above a (perhaps more standard, and equivalent) presentation of Λ\Lambda by generators and relations. In addition to the cosimplicial identities between the coboundaries δ i\delta_i and codegeneracies σ j\sigma_j and τ n n+1=id\tau^{n+1}_n = \mathrm{id} there are the following identities:

τ nδ i=δ i1τ n1,1in τ nδ 0=δ n τ nσ i=σ i1τ n1,1in τ mσ 0=σ nτ n+1 2\array{ \tau_n\delta_i = \delta_{i-1}\tau_{n-1},\,\, 1\leq i \leq n\\ \tau_n\delta_0 = \delta_n\\ \tau_n\sigma_i = \sigma_{i-1}\tau_{n-1},\,\, 1\leq i \leq n\\ \tau_m\sigma_0 = \sigma_n\tau_{n+1}^2 }

4. Properties

General

We reiterate the development in the section on structure in summary form:

Theorem 4.1.

  1. Aut Λ([n])=Z/(n+1)Z\Aut_\Lambda([n]) = \mathbf{Z}/(n+1)\mathbf{Z}

  2. Λ([n],[m])=Δ([n],[m])×Z/(n+1)Z\Lambda([n],[m]) = \Delta([n],[m])\times \mathbf{Z}/(n+1)\mathbf{Z} (as a set)

  3. Any morphism ff in Λ([n],[m])\Lambda([n],[m]) can be uniquely written as a composition f=ϕgf = \phi\circ g where ϕΔ([n],[m])\phi\in\Delta([n],[m]) and gAut Λ([n])g\in\Aut_\Lambda([n]).

The generalizations of this theorem are the starting point of the theory of skew-simplicial sets of Krasauskas or equivalently crossed simplicial groups of Loday and Fiedorowicz.

The cyclic category is a generalized Reedy category, as explained here.

Generalized Reedy model structure

The cycle category is a generalized Reedy category (see Berger-Moerdijk 08, example 2.7). Hence “cyclic spaces” carry a generalized Reedy model structure.

6. References

The original definition:

  • Alain Connes, Cohomologie cyclique et foncteurs Ext nExt^n, C.R.A.S. 296 (1983), Série I, 953-958 (pdf, pdf).

  • Pierre Cartier, Section 1.6 of: Homologie cyclique : rapport sur des travaux récents de Connes, Karoubi, Loday, Quillen…, Séminaire Bourbaki: volume 1983/84, exposés 615-632, Astérisque, no. 121-122 (1985), Exposé no. 621 (numdam:SB_1983-1984__26__123_0)

Exposition:

  • Cary Malkiewich, A visual introduction to cyclic sets and cyclotomic spectra, 2015 (pdf)

Textbook account:

See also:

As a generalized Reedy category:

Relation to the paracyclic category:

From a topological perspective

See also

category: category

Last revised on September 20, 2024 at 14:15:37. See the history of this page for a list of all contributions to it.