A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Sheaves and Sheafification

Research Depth 91 in the knowledge graph I know this Set as goal
1topic build on this
530prerequisites beneath it
See this on the map →
PresheavesAdjoint Functors+2 moreIntroduction to Topos Theory
sheaf sheafification gluing condition Grothendieck topology descent local-to-global

Core Idea

A sheaf on a topological space X is a presheaf F: Open(X)op → Set satisfying the gluing condition: whenever an open set U is covered by opens {U_i}, compatible local sections (elements of F(U_i) that agree on overlaps) glue uniquely to a global section in F(U). This local-to-global principle is what distinguishes sheaves from mere presheaves. The sheafification functor L: PSh(X) → Sh(X) is left adjoint to the inclusion Sh(X) → PSh(X), universally enforcing the gluing condition. The concept generalizes to Grothendieck topologies on arbitrary categories, providing the foundation for algebraic geometry and topos theory.

How It's Best Learned

Start with a concrete topological space like the real line. Compare the presheaf of bounded functions (not a sheaf, since a globally unbounded function can be locally bounded on each compact subset) with the sheaf of continuous functions (gluing works). Verify the sheaf axiom explicitly for an open cover. Then apply sheafification to the bounded-functions presheaf and understand what it produces.

Common Misconceptions

Explainer

From your study of presheaves, you know that a presheaf on a topological space X assigns data (a set, group, ring, etc.) to each open set, and provides restriction maps that make the data on larger open sets compatible with the data on smaller ones. A presheaf is purely local in its construction — it says nothing about how local data can be assembled. A sheaf adds exactly one additional requirement: the assembly must work correctly. The gluing condition is precise: if you have an open cover {U_i} of U, and you have compatible sections s_i ∈ F(U_i) (meaning s_i and s_j agree on U_i ∩ U_j for every pair), then there exists a *unique* global section s ∈ F(U) that restricts to each s_i. Uniqueness here is as essential as existence — without it, the "assembly" would be ambiguous.

A concrete example clarifies why some presheaves fail this condition. The presheaf of bounded continuous functions on ℝ assigns to each open set U the set of continuous functions f: U → ℝ with |f| ≤ M for some M depending on U. This is not a sheaf: cover ℝ by the open sets U_n = (−n−1, n+1). The function f(x) = x is continuous and bounded on each U_n (bounded by n+1 on U_n), so it restricts to a section on each piece. These sections are compatible — they all agree on overlaps, since they are all the same function. But f(x) = x is globally unbounded and therefore not a section of the bounded-functions presheaf on all of ℝ. The local sections do not glue to a global one: the gluing condition fails. By contrast, the sheaf of all continuous functions (without a boundedness restriction) satisfies gluing trivially — local continuous functions glue to a global continuous function.

Sheafification takes any presheaf F and produces the "closest" sheaf LF, together with a natural transformation F → LF that is universal among maps from F to sheaves. The construction proceeds in two stages: first separate F (enforce uniqueness of gluing by forcing sections to be determined by their stalks), then glue (enforce existence). The stalk of LF at a point x is the same as the stalk of F at x — sheafification does not change local data, only the global assembly. From your study of adjoints, you can recognize the structure: the sheafification functor L: PSh(X) → Sh(X) is left adjoint to the forgetful inclusion Sh(X) → PSh(X). This means L solves a universal problem: maps from F (a presheaf) to G (a sheaf) correspond bijectively to maps from LF to G. Sheafification is the universal way to force the gluing condition.

The concept generalizes far beyond topological spaces. A Grothendieck topology on an arbitrary category C specifies which families of morphisms count as "covers," replacing the open-cover idea from topology. A sheaf on this site (C with its Grothendieck topology) satisfies a gluing condition phrased in terms of these abstract covers. This is the framework underlying modern algebraic geometry: schemes are built from rings, and the category of rings with a suitable Grothendieck topology (the étale topology, the flat topology, etc.) produces sheaf categories (toposes) rich enough to support cohomological tools. The topos theory you will encounter next is built almost entirely on the sheaf concept generalized to sites.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementCartesian Products and RelationsPartial OrdersBinary RelationsEquivalence RelationsInjective, Surjective, and Bijective FunctionsCategories and MorphismsFunctorsCommutative Diagrams in Category TheoryCommutative Diagrams and CompositionNatural Transformations2-Categories and Weak FunctorsNatural Isomorphisms Between FunctorsIsomorphisms in CategoriesUniversal PropertiesInitial and Terminal ObjectsProducts and CoproductsEqualizers and CoequalizersLimits and ColimitsThe Yoneda LemmaHom-Functors and RepresentabilityYoneda Embedding and Full FaithfulnessPresheaves and Sheaves on CategoriesSheaves and Sheafification

Longest path: 92 steps · 530 total prerequisite topics

Prerequisites (4)

Leads To (1)