SH02-FSB — Formal stabilization over arbitrary neighborhood sets

Original programme text: CC0 1.0 Universal. This reading proves the displayed formal and derived comparison statements used in local sheaf duality. Basic category and derived-functor foundations remain explicit prerequisites; this scoped source repair does not certify all surrounding SH-01 foundations.

A neighborhood calculation often becomes constant only after transition maps have discarded temporary terms. The right notion of stabilization records those maps. This lesson first constructs that formal notion, then separates it from the derived inverse limit of an actual module diagram. The distinction allows the neighborhood set to be arbitrarily large and directed.

SH02-FSB-SETUP — Indices, categories, and the two contracts

All indexing sets are small, nonempty directed partially ordered sets. An inverse system in a locally small category 𝒞\mathcal C is a functor A:Iop→𝒞A:I^{\mathrm{op}}\to\mathcal C; write aji:Aj→Aia_{ji}:A_j\to A_i for j≄ij\geq i. A direct system is a functor I→𝒞I\to\mathcal C. We use a fixed universe for these sets and a larger universe when forming functor categories. The categories needed below are Mod⁥(k)\operatorname{Mod}(k) and the ordinary derived category D(k)D(k), where kk is a unital commutative ring. The categorical and inverse-limit results in this lesson do not require finite global dimension.

The formal calculus through SH02-FSB-FUNCTORS supports SH02-CB-IMP-PRO-CALCULUS. The derived module-diagram calculation in SH02-FSB-COFINALITY and SH02-FSB-PRISM supports SH02-CB-IMP-DERIVED-COFINALITY. Basic categories, complexes, projective or injective resolutions, and the derived functors they define remain prerequisite material. The proofs below identify the resolutions and comparison maps needed here.

SH02-FSB-HOM — Formal maps and constant objects

For inverse systems A:Iop→𝒞A:I^{\mathrm{op}}\to\mathcal C and B:Jop→𝒞B:J^{\mathrm{op}}\to\mathcal C, define

Hom⁡Pro⁡(𝒞)(A,B)=lim←j∈Jlim→i∈IHom⁡𝒞(Ai,Bj). \operatorname{Hom}_{\operatorname{Pro}(\mathcal C)}(A,B) =\underset{\leftarrow}{\lim}_{j\in J}\underset{\rightarrow}{\lim}_{i\in I} \operatorname{Hom}_{\mathcal C}(A_i,B_j).

The inner colimit uses precomposition by aiâ€Čia_{i'i} when iâ€Č≄ii'\geq i. Consequently a component at target jj is represented by a map Ai→BjA_i\to B_j, and two representatives agree precisely when their composites from some common later Aiâ€ČA_{i'} agree. A formal map is a family of such classes compatible with every target transition. A finite number of equalities can always be witnessed after one further source index, by directedness.

Here is a construction that verifies composition rather than presuming it. Associate to AA the covariant functor

LA(W)=lim→iHom⁡𝒞(Ai,W). L_A(W)=\underset{\rightarrow}{\lim}_i\operatorname{Hom}_{\mathcal C}(A_i,W).

A formal map f:A→Bf:A\to B defines a natural transformation LB→LAL_B\to L_A: represent an element of LB(W)L_B(W) by Bj→WB_j\to W, choose a representative Ai→BjA_i\to B_j of fjf_j, and compose. Refining either representative gives the same class, by the compatibility just stated. Conversely, evaluate a natural transformation at the class of idBj\mathrm{id}_{B_j} in LB(Bj)L_B(B_j). These operations are inverse. Composition and identities of natural transformations therefore make the displayed Hom sets into a category. This also proves associativity without selecting simultaneous representatives for infinitely many components.

For direct systems, the dual construction gives

Hom⁡Ind⁡(𝒞)(A,B)=lim←ilim→jHom⁡𝒞(Ai,Bj),Ind⁡(𝒞)=Pro⁡(𝒞op)op. \operatorname{Hom}_{\operatorname{Ind}(\mathcal C)}(A,B) =\underset{\leftarrow}{\lim}_i\underset{\rightarrow}{\lim}_j \operatorname{Hom}_{\mathcal C}(A_i,B_j), \qquad \operatorname{Ind}(\mathcal C) =\operatorname{Pro}(\mathcal C^{\mathrm{op}})^{\mathrm{op}}.

The constant-system functor c:𝒞→Pro⁡(𝒞)c:\mathcal C\to\operatorname{Pro}(\mathcal C) is fully faithful: substituting two one-object systems in the formula gives Hom⁡(cP,cQ)=Hom⁡𝒞(P,Q)\operatorname{Hom}(cP,cQ)=\operatorname{Hom}_{\mathcal C}(P,Q). The same is true for ind-objects. These are the conventions of Stacks, Tag 05PW and Tag 05PX; the construction above supplies the composition details used here.

SH02-FSB-REPRESENTED — What a representative actually supplies

A pro-system AA is represented by Q∈𝒞Q\in\mathcal C when there is a specified isomorphism cQ≃AcQ\simeq A. It is equivalent to give a compatible cone pi:Q→Aip_i:Q\to A_i, an index i0i_0, and a map q:Ai0→Qq:A_{i_0}\to Q such that

qpi0=idQ,aℓj=pjqaℓi0for some ℓ≄j,i0 for each j. q p_{i_0}=\mathrm{id}_Q, \qquad a_{\ell j}=p_jq a_{\ell i_0} \quad\text{for some }\ell\geq j,i_0\text{ for each }j.

Indeed, the cone is precisely a map p:cQ→Ap:cQ\to A, and a map A→cQA\to cQ is represented by one such qq. The first identity says qp=idcQqp=\mathrm{id}_{cQ}; the eventual identities say pq=idApq=\mathrm{id}_A by the Hom formula. This proves both directions of the criterion. Taking opposites gives its ind version, with a cocone and eventual equalities after advancing the target index.

For any T∈𝒞T\in\mathcal C, applying Hom⁡Pro⁡(𝒞)(cT,−)\operatorname{Hom}_{\operatorname{Pro}(\mathcal C)}(cT,-) to this isomorphism gives

Hom⁡𝒞(T,Q)≃lim←iHom⁡𝒞(T,Ai). \operatorname{Hom}_{\mathcal C}(T,Q) \simeq\underset{\leftarrow}{\lim}_i\operatorname{Hom}_{\mathcal C}(T,A_i).

Thus QQ is also the ordinary categorical limit with the displayed cone. Dually an ind representative is the ordinary categorical colimit. The converse is false: merely being an ordinary limit does not produce the eventual inverse qq. The corresponding representative characterizations are Stacks, Tag 05PZ and its ind version, Tag 05PY.

If 𝒞\mathcal C has a zero object, then

A≃0 in Pro⁥(𝒞)âŸșfor every i some j≄i has aji=0. A\simeq0\text{ in }\operatorname{Pro}(\mathcal C) \quad\Longleftrightarrow\quad \text{for every }i\text{ some }j\geq i\text{ has }a_{ji}=0.

The identity of AA is zero exactly when its component at each AiA_i becomes zero in the inner colimit. This is the displayed criterion. A zero identity makes the unique maps to and from the zero object inverse, proving the assertion. In the ind case the criterion is that every source term is killed by some later transition.

SH02-FSB-REINDEX — Cofinal changes preserve the formal object

Call an order-preserving map ϕ:J→I\phi:J\to I cofinal here when, for every i∈Ii\in I, the upper comma set

Ji={j∈J:i≀ϕ(j)} J_i=\{j\in J:i\leq\phi(j)\}

is nonempty and directed. For maps between directed sets, nonemptiness already implies the directed condition: JiJ_i is upward closed in JJ. We retain both words to identify the exact indexing condition used later in the derived proof.

The transition maps give a canonical formal isomorphism between AA and its restriction ϕ*A\phi^*A. To check it, for each ii choose j∈Jij\in J_i and use Aϕ(j)→AiA_{\phi(j)}\to A_i. Different choices become equal at a common upper index. This defines ϕ*A→A\phi^*A\to A. In the other direction, the component at target jj is represented by idAϕ(j)\mathrm{id}_{A_{\phi(j)}}. Both composites equal the identity after a further transition, so they are inverse formal maps. Their definition also shows naturality in AA and compatibility with successive reindexings. This is the directed-set instance of the ordinary cofinality statement Stacks, Tag 04E7, applied also to opposite categories. No derived inverse-limit assertion has yet been used.

SH02-FSB-STRICT — Finite acyclic diagrams can be made levelwise

Proposition. Let DD be a finite category admitting a degree function on its objects that strictly increases along every nonidentity arrow. Suppose a diagram D→Pro⁡(𝒞)D\to\operatorname{Pro}(\mathcal C) is given, with each vertex vv represented by a specified directed system Av:Ivop→𝒞A^v:I_v^{\mathrm{op}}\to\mathcal C. There is a directed set RR, cofinal maps rv:R→Ivr_v:R\to I_v, and a diagram D→𝒞RopD\to\mathcal C^{R^{\mathrm{op}}} whose formal image is the given diagram. In particular this applies to a single morphism, composable morphisms, parallel maps with a prescribed equality, and finite commutative squares.

Proof. A level consists of indices iv∈Ivi_v\in I_v and, for every arrow α:v→w\alpha:v\to w, a map

fα:Aivv⟶Aiww f_\alpha:A^v_{i_v}\longrightarrow A^w_{i_w}

representing the prescribed formal component at target iwi_w. Require identity and composition equations at that level. Levels exist with arbitrarily prescribed lower bounds on their indices. Choose the vertices in decreasing degree. When choosing ivi_v, all targets of its nonidentity arrows have already been fixed. Each of the finitely many formal components has a representative, and directedness supplies a common source index above their indices and the prescribed bound. For each composable pair starting at vv, the proposed composite and the proposed map for the composite arrow represent the same formal component. A further source index makes that equality hold. There are finitely many such equations. This finishes the construction at vv without changing its already chosen targets.

Order levels by coordinatewise increase, requiring in addition that every square made from an arrow fαf_\alpha and the original transition maps commute. This is a partial order. Any two levels have an upper level: repeat the decreasing-degree construction above, demanding indices above those of both old levels and demanding commutativity with both old arrow maps. Each new demand is equality between two representatives of the same formal component at a fixed old target. It is therefore achieved by a further source index. There are finitely many demands at each vertex. The same construction works while imposing an additional lower bound at any vertex.

Let RR be this set of levels. It is small because the index sets and the relevant Hom sets are small, and it is directed by the preceding construction. Each projection rvr_v is order preserving; its upper comma set above any prescribed ivi_v is nonempty and directed by the same construction. Hence rvr_v is cofinal. The transition squares built into the order make every fαf_\alpha a natural transformation of the reindexed systems. The required equations already hold at every level. This proves the proposition. ▫\square

To impose equality between two given parallel formal maps, apply the construction to the diagram in which those arrows are identified; finite lists of compatible composition equations are handled the same way. Taking opposites proves the ind version. With 𝒞=D(k)\mathcal C=D(k), the level maps and equations lie in D(k)D(k). This does not assert that arbitrary diagrams in D(k)D(k) lift to strictly commuting chain maps. In the application below, applying HqH^q gives actual module maps and actual equations, which is all that is needed.

The acyclicity condition on DD matters. Let every term of an inverse sequence be a nonzero module MM, with zero transition maps between distinct indices. This system is formally zero. Its formal isomorphism to the constant zero system has inverse equations, but no cofinal reindexing can turn its terms into modules isomorphic to zero. Thus one cannot require arbitrary inverse equations to hold levelwise. The next argument uses their correct eventual form.

SH02-FSB-INVERSE — Kernels and cokernels of a pro-isomorphism

Let f:A→Bf:A\to B be a strict morphism of inverse module systems on one directed set II, and suppose its formal pro-morphism is invertible. For each ii there are j≄ij\geq i and a map g:Bj→Aig:B_j\to A_i satisfying

gfj=aji,fig=bji. g f_j=a_{ji},\qquad f_i g=b_{ji}.

To prove this, represent the component of the formal inverse at AiA_i by g0:Bℓ→Aig_0:B_\ell\to A_i. The equation fg=idBfg=\mathrm{id}_B, at target BiB_i, holds after restricting BℓB_\ell to some later term. The equation gf=idAgf=\mathrm{id}_A, at target AiA_i, similarly holds after restricting the composite Aℓ→fℓBℓ→g0AiA_\ell\xrightarrow{f_\ell}B_\ell\xrightarrow{g_0}A_i. A common later index j≄i,ℓj\geq i,\ell makes both equalities hold, and g=g0bjℓg=g_0b_{j\ell} has the required properties.

Now ajia_{ji} kills ker⁡(fj)\ker(f_j), because it factors through fjf_j. Also bjib_{ji} induces zero on coker⁡(fj)→coker⁡(fi)\operatorname{coker}(f_j)\to\operatorname{coker}(f_i), because it factors through fif_i. The levelwise kernel and cokernel systems are therefore pro-zero. This proof uses kernels and cokernels in modules, not an assertion about kernels in a derived category.

For clarity, levelwise kernels and cokernels of any strict module-system morphism also have the formal universal properties. For an arbitrary pro-system ZZ, the Hom formula gives

Hom⁥Pro(Z,{ker⁥fi})=ker⁥(Hom⁥Pro(Z,A)⟶Hom⁥Pro(Z,B)),Hom⁥Pro({coker⁥fi},Z)=ker⁥(Hom⁥Pro(B,Z)⟶Hom⁥Pro(A,Z)). \begin{aligned} \operatorname{Hom}_{\mathrm{Pro}}(Z,\{\ker f_i\}) &=\ker\bigl(\operatorname{Hom}_{\mathrm{Pro}}(Z,A) \longrightarrow\operatorname{Hom}_{\mathrm{Pro}}(Z,B)\bigr),\\ \operatorname{Hom}_{\mathrm{Pro}}(\{\operatorname{coker}f_i\},Z) &=\ker\bigl(\operatorname{Hom}_{\mathrm{Pro}}(B,Z) \longrightarrow\operatorname{Hom}_{\mathrm{Pro}}(A,Z)\bigr). \end{aligned}

To verify the first equality, apply Hom⁡(Zj,−)\operatorname{Hom}(Z_j,-) to each kernel and then take lim←ilim→j\underset{\leftarrow}{\lim}_i\underset{\rightarrow}{\lim}_j. A filtered colimit commutes with this kernel: a class mapping to zero is represented by a map whose composite becomes zero at some later index, and two resulting kernel representatives become equal after a further index. Ordinary limits preserve kernels because the compatibility and zero equations can be imposed together. For the second equality use Hom⁡(coker⁡fi,Zj)=ker⁡(Hom⁡(Bi,Zj)→Hom⁡(Ai,Zj))\operatorname{Hom}(\operatorname{coker}f_i,Z_j)=\ker(\operatorname{Hom}(B_i,Z_j)\to\operatorname{Hom}(A_i,Z_j)) and take lim←jlim→i\underset{\leftarrow}{\lim}_j\underset{\rightarrow}{\lim}_i. The same representative argument applies. These natural identities are exactly the kernel and cokernel universal properties; they do not presume an abelian-category theorem about all pro-objects.

SH02-FSB-FUNCTORS — Applying a functor to the formal system

Every covariant functor T:𝒞→ℰT:\mathcal C\to\mathcal E induces functors on ind- and pro-categories by applying TT to all terms and all representatives of morphisms. Eventual equality remains equality after applying TT, and the description of composition in SH02-FSB-HOM shows functoriality. Natural transformations of functors extend termwise and preserve the same compositions. In particular, a specified formal isomorphism A≃cQA\simeq cQ is sent to a specified formal isomorphism TA≃c(TQ)TA\simeq c(TQ). This is also Stacks, Tag 05SH.

A contravariant functor T:𝒞op→ℰT:\mathcal C^{\mathrm{op}}\to\mathcal E instead gives

Pro⁥(𝒞)op⟶Ind⁥(ℰ),Ind⁥(𝒞)op⟶Pro⁥(ℰ). \operatorname{Pro}(\mathcal C)^{\mathrm{op}} \longrightarrow\operatorname{Ind}(\mathcal E), \qquad \operatorname{Ind}(\mathcal C)^{\mathrm{op}} \longrightarrow\operatorname{Pro}(\mathcal E).

Indeed, a representative Ai→BjA_i\to B_j becomes T(Bj)→T(Ai)T(B_j)\to T(A_i), and the Hom formulas have exactly these reversed source and target indices. After the dual-sections adjunction identifies the terms, this explains why RHom⁡k(−,k)R\operatorname{Hom}_k(-,k) converts a represented compact-support pro-system into a represented ordinary-section ind-system. That sheaf-theoretic identification is SH02-EX-DUAL-SECTIONS. The formal argument makes no claim that this functor commutes with an arbitrary ordinary or derived inverse limit.

SH02-FSB-COFINALITY — A resolution for the derived comparison

Theorem. Let A:Iop→Mod⁥(k)A:I^{\mathrm{op}}\to\operatorname{Mod}(k) be an inverse module system and let ϕ:J→I\phi:J\to I be order preserving. If every Ji={j:i≀ϕ(j)}J_i=\{j:i\leq\phi(j)\} is nonempty and directed, restriction induces a natural isomorphism

rϕ(A):Rlim←IA→∌Rlim←Jϕ*A. r_\phi(A):R\underset{\leftarrow}{\lim}_I A \xrightarrow{\sim}R\underset{\leftarrow}{\lim}_J\phi^*A.

This isomorphism is the derived restriction of compatible families. It respects composition of indexing maps.

Proof. Work in the abelian diagram category 𝒜I=Fun⁡(Iop,Mod⁡(k))\mathcal A_I=\operatorname{Fun}(I^{\mathrm{op}},\operatorname{Mod}(k)), whose exact sequences are objectwise exact. For i∈Ii\in I define the free representable diagram

Pi(h)=k[Hom⁥I(h,i)]={kh≀i,0h≰i. P_i(h)=k[\operatorname{Hom}_I(h,i)] =\begin{cases}k&h\leq i,\\0&h\nleq i.\end{cases}

Its transition maps between nonzero terms are identities. The map sending a natural transformation to its value on 1∈Pi(i)1\in P_i(i) gives Hom⁡𝒜I(Pi,A)=Ai\operatorname{Hom}_{\mathcal A_I}(P_i,A)=A_i. Hence PiP_i is projective. Direct sums of these objects are projective, because products of surjections of modules are surjective. We use the usual axiom of choice here.

For completeness this diagram category has enough injectives. The right adjoint EiE_i to evaluation at ii sends a module MM to the diagram with value MM at hh when i≀hi\leq h, and zero otherwise. Embed each AiA_i into an injective module QiQ_i. Adjunction gives a monomorphism

A⟶∏iEi(Qi): A\longrightarrow\prod_i E_i(Q_i):

at hh its i=hi=h component is the chosen embedding of AhA_h. Each Ei(Qi)E_i(Q_i) is injective because evaluation is exact, and a product of injectives is injective because its Hom functor is a product of exact functors. This constructs the resolutions defining the right derived inverse limit.

Consider the augmented chain complex in 𝒜I\mathcal A_I

PnI=⚁i0≀⋯≀inPi0(n≄0),P0I⟶ck. P^I_n=\bigoplus_{i_0\leq\cdots\leq i_n}P_{i_0} \quad(n\geq0), \qquad P^I_0\longrightarrow c k.

Repeated indices are allowed. The boundary is the alternating sum of vertex deletions. Deleting the first vertex uses Pi0→Pi1P_{i_0}\to P_{i_1}; the other faces keep the coefficient diagram. The augmentation sends each generator to 11. The face identities give ∂2=0\partial^2=0. At hh, this is the free augmented chain complex of the poset {i:h≀i}\{i:h\leq i\}. Prepending its initial element hh gives a contraction, including the augmentation degree. Thus P‱I→ckP^I_\bullet\to c k is a projective resolution.

Since lim←IA=Hom⁡𝒜I(ck,A)\underset{\leftarrow}{\lim}_I A=\operatorname{Hom}_{\mathcal A_I}(c k,A), this resolution computes the derived limit. Explicitly, for an injective resolution A→Q‱A\to Q^\bullet, the first-quadrant bicomplex Hom⁡(PpI,Qq)\operatorname{Hom}(P^I_p,Q^q) computes Hom⁡(P‱I,A)\operatorname{Hom}(P^I_\bullet,A) by projectivity and lim←IQ‱\underset{\leftarrow}{\lim}_I Q^\bullet by injectivity. There are finitely many terms in each total degree, so the two calculations identify the same derived object.

The resulting cochain model is

Cn(I,A)=∏i0≀⋯≀inAi0,(dc)i0,
,in+1=ai1i0ci1,
,in+1+∑r=1n+1(−1)rci0,
,ir̂,
,in+1. \begin{aligned} C^n(I,A)&=\prod_{i_0\leq\cdots\leq i_n}A_{i_0},\\ (dc)_{i_0,\ldots,i_{n+1}} &=a_{i_1i_0}c_{i_1,\ldots,i_{n+1}} +\sum_{r=1}^{n+1}(-1)^r c_{i_0,\ldots,\widehat{i_r},\ldots,i_{n+1}}. \end{aligned}

In degree zero its cycles are the compatible families. This agrees with the product construction in Stacks, Tag 08RZ; the module Ext version in Tag 08S0 applies with the first coefficient diagram equal to the objectwise projective module kk. The construction here proves the required case and identifies its maps.

Now form another augmented complex in 𝒜I\mathcal A_I:

Qnϕ=⚁j0≀⋯≀jnPϕ(j0). Q^\phi_n=\bigoplus_{j_0\leq\cdots\leq j_n}P_{\phi(j_0)}.

At ii its augmented chain complex is the nerve complex of JiJ_i. To prove exactness, an augmented cycle involves only finitely many vertices. Choose b∈Jib\in J_i above those vertices. On chains using vertices at most bb, appending bb with sign (−1)n+1(-1)^{n+1} in degree nn, and sending the augmentation generator to [b][b], gives ∂h+h∂=id\partial h+h\partial=\mathrm{id}. Therefore every such cycle bounds. Nonemptiness gives surjectivity of the augmentation. This finite-support argument proves exactness even when there is no single upper bound for all vertices. Thus Qâ€ąÏ•â†’ckQ^\phi_\bullet\to c k is another projective resolution.

There is a specified augmented chain map

Fϕ:Qâ€ąÏ•âŸ¶P‱I,[j0,
,jn]⟌[ϕ(j0),
,ϕ(jn)], F_\phi:Q^\phi_\bullet\longrightarrow P^I_\bullet, \qquad [j_0,\ldots,j_n]\longmapsto [\phi(j_0),\ldots,\phi(j_n)],

using the identity on Pϕ(j0)P_{\phi(j_0)}. Allowing repeated vertices makes the formula valid for any order-preserving ϕ\phi. It commutes with every face and induces the identity on ckc k.

An augmented map between projective resolutions that induces the identity is a chain homotopy equivalence. Here are the lifting details. Lift a map in degree zero through the other augmentation. Once degrees below nn have been constructed, the required degree-nn boundary lands in the cycles at degree n−1n-1; exactness and projectivity lift it through the next boundary. This constructs a reverse chain map. Two lifts of the same augmentation are homotopic: their difference in degree zero lifts through the degree-one boundary; at degree nn, subtract the already constructed homotopy term, observe that the remainder lands in cycles, and lift through degree n+1n+1. Applying this to both composites produces the two homotopies.

Applying Hom⁡𝒜I(−,A)\operatorname{Hom}_{\mathcal A_I}(-,A) to FϕF_\phi therefore gives a cochain homotopy equivalence. Under the displayed cochain models it is precisely

(rϕc)j0,
,jn=cϕ(j0),
,ϕ(jn). (r_\phi c)_{j_0,\ldots,j_n} =c_{\phi(j_0),\ldots,\phi(j_n)}.

This is natural in AA, restricts compatible families in degree zero, and satisfies rϕψ=rψrϕr_{\phi\psi}=r_\psi r_\phi on the complexes themselves. It is the claimed natural derived comparison. ▫\square

The ordinary initiality theorem, Stacks, Tag 002R, concerns ordinary limits. The two projective resolutions above supply the additional derived assertion under the stated upper-comma condition.

SH02-FSB-PRISM — The comparison for a natural change of index

Let u,v:J→Iu,v:J\to I be order preserving and suppose u(j)≀v(j)u(j)\leq v(j) for every jj. Transitions define a map of diagrams

t:v*A⟶u*A,tj=av(j),u(j). t:v^*A\longrightarrow u^*A, \qquad t_j=a_{v(j),u(j)}.

Then, without any cofinality assumption on uu or vv,

Rlim←J(t)rv=ru. R\underset{\leftarrow}{\lim}_J(t)\,r_v=r_u.

To prove the equality for the actual comparison maps, define, for n≄1n\geq1,

(Hnc)j0,
,jn−1=∑r=0n−1(−1)rcu(j0),
,u(jr),v(jr),
,v(jn−1),H0=0. (H^nc)_{j_0,\ldots,j_{n-1}} =\sum_{r=0}^{n-1}(-1)^r c_{u(j_0),\ldots,u(j_r),v(j_r),\ldots,v(j_{n-1})}, \qquad H^0=0.

Every index string is increasing, and every term lies in Au(j0)A_{u(j_0)}. This defines a homotopy with

dH+Hd=C(t)rv−ru. dH+Hd=C(t)r_v-r_u.

The verification is the prism boundary calculation, which can be seen before applying Hom. A string [j0,
,jn][j_0,\ldots,j_n] with coefficient Pu(j0)P_{u(j_0)} is sent to

∑r=0n(−1)r[u(j0),
,u(jr),v(jr),
,v(jn)]. \sum_{r=0}^n(-1)^r [u(j_0),\ldots,u(j_r),v(j_r),\ldots,v(j_n)].

A deletion strictly before or after the change from uu to vv cancels with the term obtained by first deleting the corresponding source vertex. The two faces at adjacent change positions cancel each other. The only outer faces left are the all-vv string, with coefficient map Pu(j0)→Pv(j0)P_{u(j_0)}\to P_{v(j_0)}, and minus the all-uu string. Applying Hom gives the displayed formula. In degree zero it reads

(H1dc)j=av(j),u(j)cv(j)−cu(j), (H^1dc)_j=a_{v(j),u(j)}c_{v(j)}-c_{u(j)},

which fixes the sign and the direction of tt. This proves the identity in D(k)D(k) as well as its cochain realization.

In particular, if s:J→Js:J\to J satisfies id≀s\mathrm{id}\leq s and z:s*B→Bz:s^*B\to B is the transition map, then C(z)rsC(z)r_s is homotopic to the identity. If every component of zz is zero, the homotopy shows

d(−H)+(−H)d=idC(J,B). d(-H)+(-H)d=\mathrm{id}_{C(J,B)}.

Thus this particular derived-limit complex is contractible. This conclusion needs no separate cofinality assertion about ss.

SH02-FSB-NET — Applying the bridge to a pro-zero net

Theorem. If an inverse module system AA is pro-zero, then Rplim←IA=0R^p\underset{\leftarrow}{\lim}_I A=0 for every p≄0p\geq0. A formal pro-isomorphism of inverse module systems consequently induces an isomorphism on all derived inverse limits.

Proof. Let

J={(S,n):S⊂I finite,n∈ℕ},(S,n)≀(T,m)âŸșS⊆T,n≀m, J=\{(S,n):S\subset I\text{ finite},\ n\in\mathbb N\}, \qquad (S,n)\leq(T,m)\Longleftrightarrow S\subseteq T, n\leq m,

with 0∈ℕ0\in\mathbb N. This is directed. The point (S,n)(S,n) has at most 2|S|(n+1)2^{|S|}(n+1) predecessors, and every strict predecessor has smaller |S|+n|S|+n. Construct ϕ:J→I\phi:J\to I by induction on that nonnegative integer. At a point p=(S,n)p=(S,n), choose, for each strict predecessor qq, an index Îșq≄ϕ(q)\kappa_q\geq\phi(q) that kills the map into Aϕ(q)A_{\phi(q)}. Choose ϕ(p)\phi(p) above the finite set consisting of SS and all these Îșq\kappa_q. At (⌀,0)(\varnothing,0) choose any element of II. Choices at the same rank do not depend on one another.

The map ϕ\phi is order preserving, since the killing indices dominate the previous chosen indices. Moreover every transition Aϕ(p)→Aϕ(q)A_{\phi(p)}\to A_{\phi(q)} for q<pq<p is zero. For any i∈Ii\in I, the point ({i},0)(\{i\},0) lies in JiJ_i, and JiJ_i is upward closed and directed. Therefore SH02-FSB-COFINALITY applies to ϕ\phi.

Put B=ϕ*AB=\phi^*A and s(S,n)=(S,n+1)s(S,n)=(S,n+1). Each point is a strict predecessor of its shift, so the transition map s*B→Bs^*B\to B is zero. SH02-FSB-PRISM contracts C(J,B)C(J,B), and the cofinality isomorphism gives Rlim←IA=0R\underset{\leftarrow}{\lim}_I A=0. No countable cofinal subset has been chosen.

For a strict pro-isomorphism ff, SH02-FSB-INVERSE makes its levelwise kernel and cokernel pro-zero. The two exact diagram sequences using im⁥f\operatorname{im}f, together with the long exact sequences of right derived limits, prove that Rlim←(f)R\underset{\leftarrow}{\lim}(f) is an isomorphism. A general formal morphism has a level representative after SH02-FSB-STRICT. Reindexing the source and target gives its derived map by composing this level map with the inverse cofinality comparisons. Two representations of the same formal map admit a common refinement on which their maps agree: apply the finite construction with that equality imposed. The formulas in SH02-FSB-COFINALITY and SH02-FSB-PRISM identify their induced maps. The same finite construction for two composable maps proves compatibility with composition. Thus the derived map depends only on the formal morphism, and the assertion for pro-isomorphisms follows. ▫\square

A constant module system cMcM has Rlim←IcM≃MR\underset{\leftarrow}{\lim}_I cM\simeq M. Its cochain model is Hom from the augmented free nerve chains of II into MM. Those chains resolve kk: every finite augmented cycle can be coned to a common upper bound. Since kk and all chain modules are projective, the comparison-lifting argument in SH02-FSB-COFINALITY makes this resolution homotopy equivalent to kk in degree zero. Applying Hom proves the asserted cohomology in all degrees.

This proves the complete arbitrary-directed step used in SH02-CB-NET-ACYCLICITY. The finite-predecessor construction there is valid; the resolution and prism above provide its missing explicit categorical support. Surjective transitions are a different condition. For arbitrary directed systems they need not force higher inverse limits to vanish, as shown by Stacks, Tag 0ANX.

SH02-FSB-COSTALK — What the sheaf argument needs from this bridge

We now specify how these facts enter SH02-CB-COSTALK-CONTINUITY. Let XX be locally compact Hausdorff, let x∈Xx\in X, and let F∈Db(kX)F\in D^b(k_X). For this compatibility argument a common lower bound is enough. Compact neighborhoods KK of xx are ordered by shrinking. Their intersection is {x}\{x\}, and they form a directed set; neither assertion uses a countable basis.

The sheaf foundations used here are exact filtered colimits and stalks, Theorems 2.1 and 3.1, injective resolutions, Theorems 2.3 and 4.1, and the closed-support adjunction and its derived construction. Write kKk_K for the constant sheaf on the closed set KK extended to XX, and use the restriction map kK→kLk_K\to k_L when L⊂KL\subset K. These sheaves form a direct system with

lim→KkK=k{x}. \underset{\rightarrow}{\lim}_K k_K=k_{\{x\}}.

At xx its stalk is always kk; a different point is excluded by some compact neighborhood. Exactness of filtered colimits makes this an exact derived-colimit calculation as well.

Choose one bounded-below injective sheaf resolution F→I‱F\to I^\bullet. The complexes

AK‱=Hom⁡kX(kK,I‱)=ΓK(X;I‱) A_K^\bullet=\operatorname{Hom}_{k_X}(k_K,I^\bullet) =\Gamma_K(X;I^\bullet)

and their support-inclusion maps form an actual diagram of complexes with a common lower bound. They compute RΓK(X;F)R\Gamma_K(X;F). The product bicomplex for this diagram is

Cp,q=∏K0≀⋯≀KpAK0q,D=dindex+(−1)pdcomplex. C^{p,q}=\prod_{K_0\leq\cdots\leq K_p}A_{K_0}^q, \qquad D=d_{\mathrm{index}}+(-1)^p d_{\mathrm{complex}}.

It computes the derived inverse limit of the strict complex diagram by the resolution proof above. We can also identify it directly with the costalk. The direct-sum complex

Lp=⚁K0≀⋯≀KpkK0⟶k{x} L_p=\bigoplus_{K_0\leq\cdots\leq K_p}k_{K_0} \longrightarrow k_{\{x\}}

is an augmented resolution, with the first face given by kK0→kK1k_{K_0}\to k_{K_1} and the other faces by deletion. Here is a stalkwise verification. Any positive-degree cycle has finite support; a common later index supplies the coning argument for the finite diagram. In degree zero, an element in the kernel of the augmentation is a finite sum whose images add to zero in the filtered colimit. After one later index the sum already vanishes; coning there expresses it as a boundary. The augmentation is onto on stalks. Thus the augmented sheaf complex is exact.

Apply Hom⁡kX(−,Iq)\operatorname{Hom}_{k_X}(-,I^q) in each degree. Injectivity makes every augmented row exact, and

Hom⁥kX(Lp,Iq)=Cp,q. \operatorname{Hom}_{k_X}(L_p,I^q)=C^{p,q}.

After shifting the common lower bound to zero this is a first-quadrant bicomplex. Its augmentation consequently gives a canonical quasi-isomorphism

RΓ{x}(X;F)→∌Rlim←KRΓK(X;F). R\Gamma_{\{x\}}(X;F) \xrightarrow{\sim} R\underset{\leftarrow}{\lim}_K R\Gamma_K(X;F).

The map into its degree-zero components comes from kK→k{x}k_K\to k_{\{x\}}, hence is the actual inclusion of supports. This identifies the comparison map, not merely the resulting cohomology groups.

Exactness of products of modules identifies vertical cohomology in the same bicomplex. The first-quadrant spectral sequence is therefore

Rplim←KHKq(X;F)âŸčH{x}p+q(X;F). R^p\underset{\leftarrow}{\lim}_K H^q_K(X;F) \Longrightarrow H^{p+q}_{\{x\}}(X;F).

Its convergence uses the common lower bound, not a bound on the cardinality of the neighborhood set. If the formal support pro-system in D(k)D(k) is represented by QQ, applying the functor HqH^q makes its module system pro-isomorphic to cHq(Q)cH^q(Q). SH02-FSB-NET and the constant-system calculation show that the spectral sequence has only the p=0p=0 column.

There is a precise map to the representative even though a general object of Pro⁥(D(k))\operatorname{Pro}(D(k)) has not been given a derived-limit realization. The support inclusions give a formal cone

cRΓ{x}(X;F)⟶{RΓK(X;F)}. cR\Gamma_{\{x\}}(X;F)\longrightarrow\{R\Gamma_K(X;F)\}.

Compose it with the specified representing isomorphism to cQcQ. Full faithfulness of the constant embedding makes this an actual morphism RΓ{x}(X;F)→QR\Gamma_{\{x\}}(X;F)\to Q in D(k)D(k). Its map on cohomology is the edge comparison just identified followed by the represented-system identification of the ordinary limit. It is an isomorphism in every degree, hence an isomorphism in D(k)D(k).

To connect this diagram with compactly supported sections on open neighborhoods, choose x∈V⊂K⊂Ux\in V\subset K\subset U, with V,UV,U open and KK compact. Proper-support extension and support inclusion give

RΓc(V;F)⟶RΓK(X;F)⟶RΓc(U;F). R\Gamma_c(V;F)\longrightarrow R\Gamma_K(X;F) \longrightarrow R\Gamma_c(U;F).

Such a triple can be inserted inside every prescribed neighborhood, by local compactness and the Hausdorff separation property. The composites are the original extension maps. Refining two triples inside their intersection proves that the resulting formal maps are independent of the choices and inverse to each other. Thus the two pro-systems have the same representative, and the cone above is the compact-support compatibility map used in CB. These are the proper-support extension maps already specified by that course contract.

For ordinary sections, the germ maps from the same injective resolution give a compatible cocone to FxF_x. Exact filtered colimits identify lim→UHq(U;F)\underset{\rightarrow}{\lim}_U H^q(U;F) with Hq(Fx)H^q(F_x). A specified ind representative PP gives an actual map P→FxP\to F_x by composing this cocone with cP≃{RΓ(U;F)}cP\simeq\{R\Gamma(U;F)\}. Applying HqH^q and SH02-FSB-REPRESENTED shows that this map is an isomorphism in every degree. This completes both compatibility statements with their original maps.

SH02-FSB-CHECKS — Two tests for the boundary of the argument

1. An ordinary zero limit. Let An=⚁m≄nkA_n=\bigoplus_{m\geq n}k with the inclusion transitions, and assume k≠0k\ne0. Its inverse limit is zero: a compatible element would lie in every tail of the direct sum. Nevertheless no transition map is zero, so SH02-FSB-REPRESENTED shows that the formal pro-object is nonzero. This explains why a calculation of the ordinary limit cannot replace formal stabilization.

2. Changing coefficients. Suppose A≃cQA\simeq cQ in Pro⁡(D(k))\operatorname{Pro}(D(k)) and fix M∈D(k)M\in D(k). Determine the formal system obtained by applying RHom⁡k(−,M)R\operatorname{Hom}_k(-,M). The answer is an ind-system represented by RHom⁡k(Q,M)R\operatorname{Hom}_k(Q,M), by SH02-FSB-FUNCTORS. This conclusion needs no perfectness hypothesis. Perfectness is needed for a later replacement of this Hom by Q∹⊗LMQ^\vee\otimes^L M, and that separate statement is proved in SH02-CB-PERFECT. No interchange with an ordinary inverse limit occurs in this calculation.

SH02-FSB-REFERENCES — Scope of the supporting sources

The formal definitions and representative facts were compared with the native Stacks source at revision a04446e57ec1. Tags 05PW and 05PX specify the two Hom formulas; Tags 05PY and 05PZ characterize essentially constant systems; Tag 05SH records functorial preservation. The proof above supplies composition through natural transformations and the actual eventual inverse, including both identities. These are stronger data than the mere existence of an ordinary limit.

The ordinary cofinality statements in Tag 04E7 and Tag 002R have omitted proofs in that revision. SH02-FSB-REINDEX supplies the required directed-set comparison explicitly. Their ordinary-limit statements do not supply the derived comparison: SH02-FSB-COFINALITY constructs its projective resolution and comparison map, while SH02-FSB-PRISM gives the contraction needed for pro-zero systems without a countable-cofinality assumption.

Tag 08RZ uses product cochains on strings of composable arrows to compute category cohomology. Tag 08S0 describes the related Ext cochains under pointwise projective or injective hypotheses. Our proof uses the explicitly defined free representable module diagrams, their augmentation and the contraction of the upper comma sets, then proves the sheaf compatibility maps in the compact-neighborhood application below.

For a warning about arbitrary indexing, Tag 0ANX gives a surjective directed system with vanishing ordinary limit and nonzero first derived limit. The tail example in SH02-FSB-CHECKS has a different purpose: its transition maps are injective, and its elementary calculation separates an ordinary zero limit from a formally zero object. Neither example permits an unproved interchange of a derived functor with an inverse limit.

The application here is the exact neighborhood-system contract in SH02-CB-IMP-PRO-CALCULUS and SH02-CB-IMP-DERIVED-COFINALITY, with the actual compact-support and ordinary-section maps proved above. The prose and expanded arguments are independently written under CC0. Linked Stacks sources retain their own GFDL terms. No source chapter is incorporated, and the finite strictification, arbitrary-directed comparison and sheaf applications are not attributed wholesale to the shorter cited Stacks statements.