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

Injective Objects and Injective Envelopes

Research Depth 86 in the knowledge graph I know this Set as goal
15topics build on this
399prerequisites beneath it
See this on the map →
Additive Categories and Direct SumsExt Functors as Derived HomHomological Dimension in Categories
homological-algebra universal-properties extensions

Core Idea

An object I is injective if Hom(−, I) preserves monomorphisms, equivalently, if every morphism A → I extends to a morphism B → I for any monomorphism A → B. Injectives are dual to projectives and generalize divisible groups. Every object embeds into an injective envelope, enabling injective resolutions essential to homology and cohomology theory.

Explainer

From your study of additive categories and abelian groups, you know what it means for a morphism to be a monomorphism (injective on elements, or more generally left-cancellable). An object I is injective if, whenever you have a monomorphism i: A ↪ B and a morphism f: A → I, you can always find an extension f̃: B → I making the triangle commute: f̃ ∘ i = f. Informally: any map from a subobject A into I can be extended to the whole ambient object B. Injective objects are "extensible targets" — they never block extensions.

The canonical example over ℤ is the group ℚ of rational numbers. Given any subgroup A of an abelian group B and a homomorphism f: A → ℚ, you can always extend f to all of B. The key property enabling this is divisibility: for any x ∈ ℚ and non-zero integer n, there exists y ∈ ℚ with ny = x. When you try to extend f to a new element b ∈ B \ A, you need a consistent value for f̃(b). If nb ∈ A for some n (which happens in quotient situations), divisibility ensures you can divide f(nb) by n inside ℚ to define f̃(b) without contradiction. Injective modules over a ring generalize this: over a principal ideal domain, injective modules are exactly the divisible ones.

Injective envelopes capture the idea of the smallest injective object containing a given object. Every object M in a suitable abelian category embeds into an injective envelope I(M): an injective object in which M sits essentially — meaning every nonzero subobject of I(M) meets M non-trivially. The injective envelope is characterized by being both injective and essential over M, and it is unique up to isomorphism. For abelian groups, the injective envelope of ℤ/nℤ is ℤ[1/p₁, ..., 1/pₖ]/ℤ where the pᵢ divide n — the minimal divisible extension.

The payoff is injective resolutions: for any object M, choose an embedding M ↪ I₀ into its injective envelope, then embed the cokernel into another injective I₁, and continue: 0 → M → I₀ → I₁ → I₂ → ⋯. This is an injective resolution — an exact sequence of injective objects. Injective resolutions are the raw material for derived functors: apply Hom(N, −) to the deleted resolution (drop M from the front), take cohomology, and you get the Ext groups Ext^n(N, M). The failure of Hom to be exact on the right — it only preserves exactness at injective objects — is precisely what Ext measures. Without injective objects and their resolutions, cohomological invariants of modules and sheaves would have no computational foundation.

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 ObjectsZero Objects and Zero MorphismsAdditive Categories and Direct SumsInjective Objects and Injective Envelopes

Longest path: 87 steps · 399 total prerequisite topics

Prerequisites (1)

Leads To (2)