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 is a functor ; write for . A direct system is a functor . We use a fixed universe for these sets and a larger universe when forming functor categories. The categories needed below are and the ordinary derived category , where 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 and , define
The inner colimit uses precomposition by when . Consequently a component at target is represented by a map , and two representatives agree precisely when their composites from some common later 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 the covariant functor
A formal map defines a natural transformation : represent an element of by , choose a representative of , and compose. Refining either representative gives the same class, by the compatibility just stated. Conversely, evaluate a natural transformation at the class of in . 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
The constant-system functor is fully faithful: substituting two one-object systems in the formula gives . 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 is represented by when there is a specified isomorphism . It is equivalent to give a compatible cone , an index , and a map such that
Indeed, the cone is precisely a map , and a map is represented by one such . The first identity says ; the eventual identities say 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 , applying to this isomorphism gives
Thus 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 . The corresponding representative characterizations are Stacks, Tag 05PZ and its ind version, Tag 05PY.
If has a zero object, then
The identity of is zero exactly when its component at each 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 cofinal here when, for every , the upper comma set
is nonempty and directed. For maps between directed sets, nonemptiness already implies the directed condition: is upward closed in . 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 and its restriction . To check it, for each choose and use . Different choices become equal at a common upper index. This defines . In the other direction, the component at target is represented by . Both composites equal the identity after a further transition, so they are inverse formal maps. Their definition also shows naturality in 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 be a finite category admitting a degree function on its objects that strictly increases along every nonidentity arrow. Suppose a diagram is given, with each vertex represented by a specified directed system . There is a directed set , cofinal maps , and a diagram 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 and, for every arrow , a map
representing the prescribed formal component at target . 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 , 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 , 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 without changing its already chosen targets.
Order levels by coordinatewise increase, requiring in addition that every square made from an arrow 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 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 is order preserving; its upper comma set above any prescribed is nonempty and directed by the same construction. Hence is cofinal. The transition squares built into the order make every a natural transformation of the reindexed systems. The required equations already hold at every level. This proves the proposition.
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 , the level maps and equations lie in . This does not assert that arbitrary diagrams in lift to strictly commuting chain maps. In the application below, applying gives actual module maps and actual equations, which is all that is needed.
The acyclicity condition on matters. Let every term of an inverse sequence be a nonzero module , 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 be a strict morphism of inverse module systems on one directed set , and suppose its formal pro-morphism is invertible. For each there are and a map satisfying
To prove this, represent the component of the formal inverse at by . The equation , at target , holds after restricting to some later term. The equation , at target , similarly holds after restricting the composite . A common later index makes both equalities hold, and has the required properties.
Now kills , because it factors through . Also induces zero on , because it factors through . 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 , the Hom formula gives
To verify the first equality, apply to each kernel and then take . 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 and take . 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 induces functors on ind- and pro-categories by applying to all terms and all representatives of morphisms. Eventual equality remains equality after applying , 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 is sent to a specified formal isomorphism . This is also Stacks, Tag 05SH.
A contravariant functor instead gives
Indeed, a representative becomes , and the Hom formulas have exactly these reversed source and target indices. After the dual-sections adjunction identifies the terms, this explains why 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 be an inverse module system and let be order preserving. If every is nonempty and directed, restriction induces a natural isomorphism
This isomorphism is the derived restriction of compatible families. It respects composition of indexing maps.
Proof. Work in the abelian diagram category , whose exact sequences are objectwise exact. For define the free representable diagram
Its transition maps between nonzero terms are identities. The map sending a natural transformation to its value on gives . Hence 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 to evaluation at sends a module to the diagram with value at when , and zero otherwise. Embed each into an injective module . Adjunction gives a monomorphism
at its component is the chosen embedding of . Each 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
Repeated indices are allowed. The boundary is the alternating sum of vertex deletions. Deleting the first vertex uses ; the other faces keep the coefficient diagram. The augmentation sends each generator to . The face identities give . At , this is the free augmented chain complex of the poset . Prepending its initial element gives a contraction, including the augmentation degree. Thus is a projective resolution.
Since , this resolution computes the derived limit. Explicitly, for an injective resolution , the first-quadrant bicomplex computes by projectivity and 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
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 . The construction here proves the required case and identifies its maps.
Now form another augmented complex in :
At its augmented chain complex is the nerve complex of . To prove exactness, an augmented cycle involves only finitely many vertices. Choose above those vertices. On chains using vertices at most , appending with sign in degree , and sending the augmentation generator to , gives . 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 is another projective resolution.
There is a specified augmented chain map
using the identity on . Allowing repeated vertices makes the formula valid for any order-preserving . It commutes with every face and induces the identity on .
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 have been constructed, the required degree- boundary lands in the cycles at degree ; 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 , subtract the already constructed homotopy term, observe that the remainder lands in cycles, and lift through degree . Applying this to both composites produces the two homotopies.
Applying to therefore gives a cochain homotopy equivalence. Under the displayed cochain models it is precisely
This is natural in , restricts compatible families in degree zero, and satisfies on the complexes themselves. It is the claimed natural derived comparison.
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 be order preserving and suppose for every . Transitions define a map of diagrams
Then, without any cofinality assumption on or ,
To prove the equality for the actual comparison maps, define, for ,
Every index string is increasing, and every term lies in . This defines a homotopy with
The verification is the prism boundary calculation, which can be seen before applying Hom. A string with coefficient is sent to
A deletion strictly before or after the change from to 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- string, with coefficient map , and minus the all- string. Applying Hom gives the displayed formula. In degree zero it reads
which fixes the sign and the direction of . This proves the identity in as well as its cochain realization.
In particular, if satisfies and is the transition map, then is homotopic to the identity. If every component of is zero, the homotopy shows
Thus this particular derived-limit complex is contractible. This conclusion needs no separate cofinality assertion about .
SH02-FSB-NET â Applying the bridge to a pro-zero net
Theorem. If an inverse module system is pro-zero, then for every . A formal pro-isomorphism of inverse module systems consequently induces an isomorphism on all derived inverse limits.
Proof. Let
with . This is directed. The point has at most predecessors, and every strict predecessor has smaller . Construct by induction on that nonnegative integer. At a point , choose, for each strict predecessor , an index that kills the map into . Choose above the finite set consisting of and all these . At choose any element of . Choices at the same rank do not depend on one another.
The map is order preserving, since the killing indices dominate the previous chosen indices. Moreover every transition for is zero. For any , the point lies in , and is upward closed and directed. Therefore SH02-FSB-COFINALITY applies to .
Put and . Each point is a strict predecessor of its shift, so the transition map is zero. SH02-FSB-PRISM contracts , and the cofinality isomorphism gives . No countable cofinal subset has been chosen.
For a strict pro-isomorphism , SH02-FSB-INVERSE makes its levelwise kernel and cokernel pro-zero. The two exact diagram sequences using , together with the long exact sequences of right derived limits, prove that 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.
A constant module system has . Its cochain model is Hom from the augmented free nerve chains of into . Those chains resolve : every finite augmented cycle can be coned to a common upper bound. Since and all chain modules are projective, the comparison-lifting argument in SH02-FSB-COFINALITY makes this resolution homotopy equivalent to 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 be locally compact Hausdorff, let , and let . For this compatibility argument a common lower bound is enough. Compact neighborhoods of are ordered by shrinking. Their intersection is , 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 for the constant sheaf on the closed set extended to , and use the restriction map when . These sheaves form a direct system with
At its stalk is always ; 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 . The complexes
and their support-inclusion maps form an actual diagram of complexes with a common lower bound. They compute . The product bicomplex for this diagram is
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
is an augmented resolution, with the first face given by 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 in each degree. Injectivity makes every augmented row exact, and
After shifting the common lower bound to zero this is a first-quadrant bicomplex. Its augmentation consequently gives a canonical quasi-isomorphism
The map into its degree-zero components comes from , 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
Its convergence uses the common lower bound, not a bound on the cardinality of the neighborhood set. If the formal support pro-system in is represented by , applying the functor makes its module system pro-isomorphic to . SH02-FSB-NET and the constant-system calculation show that the spectral sequence has only the column.
There is a precise map to the representative even though a general object of has not been given a derived-limit realization. The support inclusions give a formal cone
Compose it with the specified representing isomorphism to . Full faithfulness of the constant embedding makes this an actual morphism in . 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 .
To connect this diagram with compactly supported sections on open neighborhoods, choose , with open and compact. Proper-support extension and support inclusion give
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 . Exact filtered colimits identify with . A specified ind representative gives an actual map by composing this cocone with . Applying 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 with the inclusion transitions, and assume . 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 in and fix . Determine the formal system obtained by applying . The answer is an ind-system represented by , by SH02-FSB-FUNCTORS. This conclusion needs no perfectness hypothesis. Perfectness is needed for a later replacement of this Hom by , 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.