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

Localization of Categories

Research Depth 97 in the knowledge graph I know this Set as goal
3topics build on this
568prerequisites beneath it
See this on the map →
Equivalence of CategoriesFunctors+1 more2-Categories
localization inverting-morphisms quotient-categories

Core Idea

Localization is the process of formally inverting a class of morphisms in a category to create a new category where those morphisms become isomorphisms. This is analogous to localization in ring theory and allows systematic modification of categorical structure. The resulting localized category admits a universal property characterizing functors that preserve the inverted morphisms.

How It's Best Learned

Study localization in the category of modules, where localizing at a multiplicative set yields the category of localized modules. Understand the universal property and verify that the localization functor is universal. Explore applications to homological algebra and algebraic geometry.

Common Misconceptions

Localization does not always result in a category equivalent to a known category; checking whether a localization is 'nice' requires careful analysis. Also, different classes of morphisms can yield very different localizations.

Explainer

The motivation for localization comes from a familiar algebraic operation. In ring theory, you localize a ring R at a multiplicative set S ⊂ R by formally adding inverses to every element of S, creating the localized ring S⁻¹R where s/1 is invertible for each s ∈ S. The integers localized at powers of 2 give dyadic rationals; the integers localized at all nonzero elements give the rationals. The categorical version does the same thing one dimension up: given a category C and a collection W of morphisms you want to become invertible, the localization C[W⁻¹] is a new category where every morphism in W is an isomorphism, and it is the smallest such category fitting a universal property: any functor F: C → D that sends all morphisms in W to isomorphisms factors uniquely through the localization functor γ: C → C[W⁻¹].

You already understand functors as structure-preserving maps between categories, and equivalences of categories as the "right" notion of sameness (an equivalence need not be a bijection on objects, but pairs of functors F and G with FG ≅ Id and GF ≅ Id). Localization is a way of constructing new categories by declaring some morphisms to be equivalences even when they weren't before. This is different from forming a quotient category (which identifies morphisms) — localization adds formal inverses rather than equating morphisms.

The construction of C[W⁻¹] in full generality is technically demanding. Morphisms in C[W⁻¹] are represented by zig-zags — alternating sequences of forward morphisms from C and backward morphisms that formally invert elements of W. Composition of zig-zags requires concatenation and simplification, and without additional conditions on W, the resulting hom-sets may be proper classes rather than sets, making the localization ill-defined as a category. The classical solution is to require that W be a calculus of fractions: a system of conditions (closure under composition, common-denominator conditions) that ensures zig-zags reduce to left or right fractions of the form s⁻¹f or fs⁻¹, giving well-controlled hom-sets.

The most important application of categorical localization is in homological algebra and algebraic geometry. The derived category of an abelian category is constructed exactly by localizing the category of chain complexes at the class of quasi-isomorphisms — morphisms that induce isomorphisms on all cohomology groups. Two complexes that are quasi-isomorphic may look very different as complexes, but they become isomorphic in the derived category. This identifies the "real" invariants (cohomology) and disregards structural differences that don't affect those invariants. The derived category framework lets you work with resolutions interchangeably with the objects they resolve, which is the algebraic foundation of sheaf theory, algebraic K-theory, and modern homotopy theory.

Understanding localization also illuminates why equivalences of categories are more natural than isomorphisms. An equivalence says there is a functor F: C → D and a functor G: D → C with GF ≅ Id_C and FG ≅ Id_D — but the two categories need not have the same objects or morphisms, just the same "shape" up to invertible natural transformation. Localizations can produce categories equivalent to known ones: for example, localizing the category of topological spaces at the homotopy equivalences gives the homotopy category, which captures topological structure up to continuous deformation. Different choices of W can carve out very different aspects of the same underlying category, making localization a flexible tool for focusing on the invariants that matter for a particular application.

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 ColimitsPullbacks and PushoutsAdjoint FunctorsFree ObjectsProjective Objects and Projective CoversHomological Dimension in CategoriesExact Sequences in CategoriesExt Functors as Derived HomTor Functors as Derived Tensor ProductDerived FunctorsDerived Categories and Derived EquivalencesLocalization of Categories

Longest path: 98 steps · 568 total prerequisite topics

Prerequisites (3)

Leads To (1)