How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Closed Monoidal Categories and the Internal Hom
1 · Prerequisites
- Adjunctions Units and Counits
- Binary Operations, Monoids, Groups and Subgroups
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Chains, Antichains, Sperner and Dilworth
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Homomorphisms and the Isomorphism Theorems
- Limits and Colimits
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monoidal Categories and Monoidal Functors
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Set Theory Beyond Choice: Recorded, Not Proved Here
- Suprema and Infima
- Tensor Products of Modules
- The ZFC Axioms and the Basic Set Constructions
- Universal Properties, Representables and the Yoneda Lemma
2 · Summary
This page keeps three boundaries explicit. Closedness is extra structure on a monoidal category, not a default consequence of having a tensor product; in a non-symmetric setting the left and right closures are different constructions; and the subobject-classifier block stops at the classifier and its represented subobject functor, without turning the page into a topos survey.
The positive spine runs from biclosed monoidal categories to cartesian closed categories, locally cartesian closed categories, and the basic classifier examples in Set and presheaf categories. The companion examples page computes the adjunctions and classifiers on small concrete inputs.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Left-closed, right-closed, and biclosed monoidal categories
Definition
Let be a monoidal category (Monoidal category).
- It is right closed when for every object the functor has a right adjoint in the sense of Adjunction by unit, counit, and the triangle identities. A chosen right adjoint is written .
- It is left closed when for every object the functor has a right adjoint. A chosen right adjoint is written .
- It is biclosed when it is both left closed and right closed.
Thus a right-closed structure gives natural bijections
and a left-closed structure gives natural bijections
This page keeps the two closures separate unless a symmetry is supplied later.
The internal hom is unique up to a unique adjunction-compatible natural isomorphism
Statement
Fix an object in a monoidal category. Any two chosen right adjoints to are related by a unique natural isomorphism compatible with their adjunction units and counits, and the analogous assertion holds for two chosen right adjoints to . Hence each internal-hom construction, together with its adjunction data, is unique up to a unique adjunction-compatible natural isomorphism.
Facts & Assumptions
Given: An object in a monoidal category, together with two chosen right adjoints to or two chosen right adjoints to .
Right-closed and left-closed mean exactly that the corresponding tensor functor has a right adjoint (Left-closed, right-closed, and biclosed monoidal categories).
Two right adjoints to the same functor are uniquely naturally isomorphic in a way compatible with the adjunction data (Adjoints are unique up to a unique natural isomorphism compatible with the adjunction data).
Proof
If are two chosen right adjoints to , then they are two right adjoints to the same functor. By [L2] there is a unique natural isomorphism compatible with the adjunction units and counits.
By [L1], a right internal hom in the variable is precisely such a right adjoint . Therefore any two choices of , equipped with their adjunction data, are related by the unique natural isomorphism compatible with those units and counits.
The same argument with the functor proves the corresponding adjunction-compatible uniqueness for the left internal hom .
So both internal-hom constructions, with their adjunction data fixed, are unique up to a unique compatible natural isomorphism.
The internal hom and its evaluation morphism
Definition
Assume is right closed. For objects , the right internal hom is the value at of the chosen right adjoint to (Left-closed, right-closed, and biclosed monoidal categories).
The evaluation morphism
is the counit component at of the adjunction . For every object , the adjunction yields the transposition bijection
which sends a morphism to its adjunct and sends to its inverse transpose in the sense of Adjuncts and transposition under an adjunction.
If is left closed, the left internal hom and its evaluation map
are defined dually from the adjunction .
A supplied symmetry identifies the left and right internal homs
Statement
Let be a monoidal category, fix an object , and suppose there is a natural isomorphism
natural in (Natural isomorphism). If has a right adjoint , then has a right adjoint uniquely naturally isomorphic to . In particular, in a symmetric monoidal category the left and right internal homs of agree up to unique natural isomorphism.
Facts & Assumptions
Given: A monoidal category, an object , a natural isomorphism , and a chosen right adjoint to .
The evaluation-transpose bijection for is (The internal hom and its evaluation morphism).
Right adjoints to a fixed functor are unique up to unique natural isomorphism (The internal hom is unique up to a unique adjunction-compatible natural isomorphism).
A natural isomorphism is, in particular, a natural family of isomorphisms (Natural isomorphism).
Proof
For each , compose the bijection of [L1] with precomposition by . This gives a natural bijection .
The bijection in step 1.1 says exactly that is also a right adjoint to the functor . Hence a left internal hom for exists and may be chosen to be .
Any other chosen right adjoint to is uniquely naturally isomorphic to by [L2]. Therefore the supplied symmetry identifies the left and right internal homs, and a genuine symmetric monoidal structure gives this conclusion for every .
In a biclosed monoidal category tensor is cocontinuous in each variable
Statement
Let be a biclosed monoidal category. For every object , the functors and preserve every colimit that exists in .
Facts & Assumptions
Given: A biclosed monoidal category and an object .
Biclosed means that and are left adjoints for every (Left-closed, right-closed, and biclosed monoidal categories).
Every left adjoint preserves all colimits that exist in its domain (Left adjoints preserve every colimit that exists).
Proof
Since is biclosed, the functor has a right adjoint and is therefore a left adjoint by [L1].
Likewise has a right adjoint and is a left adjoint.
Apply [L2] to step 1.1 to conclude that preserves every colimit that exists in .
Apply [L2] to step 1.2 to conclude that preserves every colimit that exists in .
Hence tensoring with a fixed object is cocontinuous in each variable.
The internal hom preserves limits in the covariant variable and sends colimits to limits in the contravariant variable
Statement
In a biclosed monoidal category, for each fixed object the functor preserves all limits that exist. For each fixed object , the contravariant functor preserves limits in ; equivalently, it sends colimits in to limits in .
Facts & Assumptions
Given: A biclosed monoidal category.
For each fixed , the right internal hom is right adjoint to (The internal hom and its evaluation morphism).
Right adjoints preserve all limits that exist in their domain (Right adjoints preserve every limit that exists).
In a biclosed monoidal category, tensoring with a fixed object preserves every colimit that exists (In a biclosed monoidal category tensor is cocontinuous in each variable).
Proof
Fix . By [L1], the functor is a right adjoint, so [L2] implies that it preserves every limit that exists in .
Fix . For a morphism , define to be the transpose of
The transposition bijection of [L1] makes this assignment contravariantly functorial in . [given, L1, construct]
Let be a colimit cocone in , and fix an object . By [L3], the functor preserves this colimit, so maps are naturally the same as compatible families of maps .
Apply the transposition bijection of [L1] to the maps in step 2.1. A map is the same as a map , and a compatible family is the same as a compatible family with respect to the morphisms from step 1.2. Therefore maps are naturally in bijection with cones from to the diagram , so is a limit of that diagram.
Hence the contravariant functor sends colimits in to limits in , equivalently preserves limits in . Combining this with step 1.1 proves the claim.
The internal-hom composition morphism
Statement
In a right-closed monoidal category there is a natural morphism
obtained by transposing the double evaluation map. For every object there is also a unit morphism
and these satisfy the associativity and unit laws for composition.
Facts & Assumptions
Given: A right-closed monoidal category.
The evaluation morphism and the transpose bijection are part of the internal-hom data (The internal hom and its evaluation morphism).
Proof
Consider the composite . Transposing it across the adjunction gives a unique morphism .
Transpose the left unitor across the same adjunction to obtain .
To compare the two composites , tensor each with and postcompose with . Both have the same transpose, namely the triple evaluation map , so the transposition bijection of [L1] forces the two composites to be equal.
The left and right unit laws are proved the same way: after tensoring with and evaluating, both candidate composites have transpose . Hence the transposition bijection identifies them, so is a unit for .
Therefore the internal hom carries a natural composition morphism and objectwise unit morphisms satisfying associativity and the unit laws.
The tensor unit is an internal-hom unit
Statement
In a right-closed monoidal category there is a natural isomorphism for every object . Consequently there is a natural bijection
Facts & Assumptions
Given: A right-closed monoidal category.
The right internal hom is right adjoint to , with transposition bijection (The internal hom and its evaluation morphism).
Right adjoints to a fixed functor are unique up to unique natural isomorphism (The internal hom is unique up to a unique adjunction-compatible natural isomorphism).
Proof
The right unitor gives natural isomorphisms . Applying the transposition bijection of [L1] with therefore gives natural bijections . So the identity functor is also a right adjoint to . Since is another right adjoint to the same functor, [L2] gives naturally in .
Apply the transposition bijection of [L1] with . Because , this gives . Rewriting the bijection in the opposite direction yields the displayed form.
Thus the tensor unit recovers the external hom-set from the internal hom.
Exponential object
Definition
Let be a category with binary products (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations). For objects , an exponential object of by is an object together with an evaluation morphism
such that for every object and every morphism there is a unique morphism
with
If exponential objects are chosen for every object and these choices are assembled functorially, their universal properties say equivalently that is right adjoint to ; in particular its value at is . The existence of the single exponential alone does not assert that this right adjoint exists on every object.
Cartesian closed category
Definition
A category is cartesian closed when:
- has finite products; and
- for each object , the functor has a right adjoint.
Writing that right adjoint as , the object is the exponential object of by in the sense of Exponential object. Since a category with finite products is canonically monoidal under the cartesian product (A category with finite products is monoidal), a cartesian closed category is exactly a cartesian monoidal category whose tensor product is closed.
Set is cartesian closed
Statement
The category is cartesian closed. For sets , an exponential object of by is the function set with evaluation .
Facts & Assumptions
Given: Sets .
A cartesian closed category has finite products and exponentials, equivalently a right adjoint to each product functor (Cartesian closed category).
has all small limits, hence in particular finite products (Set has all small limits, realized as compatible tuples in a set-indexed product).
In , currying gives a natural bijection (Currying gives the adjunction in ).
Proof
By [L2], has finite products.
Let be the set of functions , and let send to . By [L3], every map corresponds naturally and bijectively to a map . This is exactly the universal property of an exponential object.
Step 1.1 gives the finite-product part of [L1], and step 1.2 gives the right adjoint to for each . Therefore is cartesian closed.
The category of small categories is cartesian closed
Statement
The category of small categories is cartesian closed. For small categories , the exponential object of by is the functor category .
Facts & Assumptions
Given: Small categories .
is cartesian monoidal, so it has finite products (Set, Cat, and every complete category are cartesian monoidal).
For small source and locally small target, the functor category exists and is locally small; if both are small, then it is small (Functor category , If is small and is locally small then is locally small; if both are small it is small).
A cartesian closed category is one with finite products and a right adjoint to each functor (Cartesian closed category).
Proof
By [L1], has the finite products required in [L3]. By [L2], the functor category is again a small category.
A functor determines a functor by on objects and similarly on morphisms. Conversely, a functor determines by evaluation, . These assignments are inverse and natural in .
Step 1.2 is exactly the adjunction . Thus has right adjoint . With step 1.1, [L3] now gives that is cartesian closed.
A presheaf category on a small category is cartesian closed
Statement
Let be a small category and let . Then is cartesian closed. For presheaves , one exponential object is the presheaf defined by
with restriction along given by precomposition with .
Facts & Assumptions
Given: A small category and presheaves on .
The Yoneda embedding sends to the representable presheaf (The Yoneda assignment and the small-source Yoneda functor, traditionally called the Yoneda embedding).
For any presheaf , natural transformations are naturally in bijection with elements of (For a presheaf , naturally in and ).
In , currying gives (Currying gives the adjunction in ).
Products of presheaves are computed pointwise, and the presheaf category is locally small because is small (For small source and index categories, chosen target limits and colimits compute the corresponding functor-category limits and colimits pointwise, If is small and is locally small then is locally small; if both are small it is small).
A cartesian closed category has finite products and exponentials (Cartesian closed category).
Proof
By [L4], binary products in are computed pointwise, so is the presheaf with . The assignment with restriction by precomposition along is therefore a presheaf .
Given , define by sending to the element of corresponding under [L2] to the natural transformation , evaluated at . Conversely, given , use [L2] and the set-level currying of [L3] objectwise to define ; naturality in is exactly the restriction rule from step 1.1.
The two constructions of step 2.1 are inverse because Yoneda identifies a natural transformation out of with its value at , and the set-level currying and uncurrying in [L3] are inverse. Hence naturally in .
Step 3.1 shows that has right adjoint , while [L4] gives the finite products. Therefore [L5] implies that is cartesian closed.
Currying and uncurrying are mutually inverse
Statement
In a cartesian closed category, currying and uncurrying for the adjunction are mutually inverse. Equivalently, for every and ,
Repeated currying is associative after the canonical reassociation of products.
Facts & Assumptions
Given: A cartesian closed category and objects .
Cartesian closed means that the cartesian product is a closed monoidal tensor, so has right adjoint (Cartesian closed category, A category with finite products is monoidal).
The internal-hom adjunction comes with evaluation and inverse transposition operations (The internal hom and its evaluation morphism).
Internal hom composition is obtained by transposing iterated evaluation and is compatible with reassociation (The internal-hom composition morphism).
Proof
By [L1] and [L2], currying is the transpose map , and uncurrying is its inverse transpose. For any adjunction, transpose followed by inverse transpose and inverse transpose followed by transpose are the identity.
Therefore and .
For a morphism , first curry in the -variable and then in the -variable. The resulting map is the transpose of the same iterated evaluation map that produces after reassociating products. By [L3], these coincide under the canonical internal-hom composition isomorphism.
So currying and uncurrying are mutually inverse, and repeated currying is associative up to the canonical reassociation.
In a cartesian closed category, any initial object is strict
Statement
Let be a cartesian closed category and let be an initial object. Then is strict: every morphism is an isomorphism.
Facts & Assumptions
Given: A cartesian closed category , an initial object , an object , and a morphism .
In a cartesian closed category, the functor is a left adjoint for every (Cartesian closed category).
Left adjoints preserve colimits, hence preserve initial objects (Left adjoints preserve every colimit that exists).
An initial object has exactly one endomorphism and exactly one map into any target (Initial object, terminal object, and zero object).
Proof
By [L1] and [L2], the functor preserves the initial object, so is initial. Hence there is an isomorphism .
The pair induces a morphism . Let , where is the first projection. Then .
The composite is the unique endomorphism of the initial object, so by [L3] it equals . Thus is a two-sided inverse to , and is an isomorphism.
Therefore the initial object is strict.
A cartesian closed preorder has relative implications
Statement
Let be a preorder regarded as a category. If is cartesian closed, then for every there is an element such that for every ,
where is the binary product in the preorder.
Facts & Assumptions
Given: A cartesian closed preorder and elements .
A preorder can be regarded as a category with at most one morphism between two objects (A preorder is a category with at most one morphism between any two objects, and its functors are exactly monotone maps).
In a cartesian closed category, the product functor has right adjoint (Cartesian closed category).
Binary products satisfy the usual universal property; in a preorder they are meets (Products and coproducts as limits and colimits of discrete diagrams, including their existence-and-uniqueness equations).
Proof
By [L1], the inequality is the same as the existence of a morphism in the associated thin category. By [L3], the product is exactly the meet .
Let denote the exponential object given by [L2]. The adjunction gives . Since each hom-set in a preorder is either empty or a singleton, this bijection says precisely that iff .
Therefore every cartesian closed preorder has the stated relative implication operation.
Slice categories, composition, and pullback along a morphism
Definition
For an object of a category , the slice category has objects arrows and morphisms commuting triangles, as in Comma category, slice category, and coslice category.
For a morphism , postcomposition with defines a functor
If chosen pullbacks along are supplied, they define the pullback functor
sending to a chosen pullback square
and sending a morphism in to the unique induced morphism between the chosen pullbacks (Pullbacks and pushouts as limits and colimits of cospans and spans). For composable base maps , the universal property supplies a canonical natural isomorphism
Likewise . Thus arbitrary pullback choices are contravariantly pseudofunctorial in the base. Literal functorial equalities in the sense of Covariant functor, identity functor, composite functor, and contravariant functor require coherent split choices and do not follow merely from choosing each pullback separately.
Locally cartesian closed category
Definition
A category is locally cartesian closed when, for every object , the slice category is cartesian closed in the sense of Cartesian closed category. The slice categories and their pullback functors are those of Slice categories, composition, and pullback along a morphism.
Slices of a locally cartesian closed category are locally cartesian closed
Statement
If is locally cartesian closed, then for every object the slice category is locally cartesian closed.
Facts & Assumptions
Given: A locally cartesian closed category , an object , and an object of the slice category .
Local cartesian closedness means that every slice is cartesian closed (Locally cartesian closed category).
An object of is exactly a morphism into in the slice, equivalently a morphism in over ; this identifies with (Comma category, slice category, and coslice category).
Proof
By [L2], the slice-of-a-slice is canonically isomorphic to the ordinary slice .
Since is locally cartesian closed, [L1] says that is cartesian closed. Transporting this structure across the isomorphism of step 1.1 shows that is cartesian closed.
Because was an arbitrary object of , every slice of is cartesian closed. Hence is locally cartesian closed.
A locally cartesian closed category with a terminal object is cartesian closed
Statement
If is locally cartesian closed and has a terminal object , then is cartesian closed.
Facts & Assumptions
Given: A locally cartesian closed category with terminal object .
Every slice of a locally cartesian closed category is cartesian closed (Locally cartesian closed category).
A terminal object receives a unique morphism from every object (Initial object, terminal object, and zero object).
Proof
The assignment defines a functor , and forgetting the structure map defines a functor back. Because [L2] gives a unique map to , these two functors are inverse isomorphisms of categories.
By [L1], the slice is cartesian closed. Transport that structure across the isomorphism of step 1.1 to conclude that itself is cartesian closed.
Therefore a locally cartesian closed category with a terminal object is cartesian closed.
A locally cartesian closed category has pullbacks, and with a terminal object it has all finite limits
Statement
Every locally cartesian closed category has pullbacks. If it also has a terminal object, then it has all finite limits.
Facts & Assumptions
Given: A locally cartesian closed category , and optionally a terminal object .
Every slice is cartesian closed, hence has binary products (Locally cartesian closed category).
A pullback of and is a universal square over (Pullbacks and pushouts as limits and colimits of cospans and spans).
A terminal object is an object receiving a unique map from every object (Initial object, terminal object, and zero object).
Proof
Fix arrows and . Since is cartesian closed by [L1], it has a binary product of those two slice objects. Its projections are morphisms and over , and the product universal property in the slice is exactly the pullback universal property of [L2]. So has pullbacks.
Now assume is terminal. A pullback with codomain is an ordinary binary product, because by [L3] every object has a unique map to . Thus step 1.1 gives binary products in , and the given object is terminal.
A category with pullbacks and a terminal object has all finite limits: binary products come from step 2.1, and equalizers are pullbacks of the diagonal against a pair of parallel arrows. Hence has all finite limits.
Therefore every locally cartesian closed category has pullbacks, and with a terminal object it has all finite limits.
Local cartesian closure is equivalent to every pullback functor having a right adjoint
Statement
Let be a category with chosen pullback functors. Then the following are equivalent.
- is locally cartesian closed.
- For every morphism , the pullback functor has a right adjoint.
Facts & Assumptions
Given: A category with chosen pullback functors.
Local cartesian closedness means that every slice category is cartesian closed (Locally cartesian closed category).
For each , the functors and between slice categories are the postcomposition and pullback functors (Slice categories, composition, and pullback along a morphism).
Every slice of a locally cartesian closed category is locally cartesian closed, and every locally cartesian closed category has pullbacks (Slices of a locally cartesian closed category are locally cartesian closed, A locally cartesian closed category has pullbacks, and with a terminal object it has all finite limits).
Proof
Assume condition (1), fix , and put . For an object of , regard as a morphism in . By [L1] and [L3], the category is cartesian closed and has pullbacks. Form in the pullback where is induced by and is the transpose of . For , currying identifies a map with a map over ; the pullback equation defining says exactly that is the projection . Hence naturally in and . Thus has right adjoint .
Assume condition (2), and fix an object . Chosen pullbacks give binary products in , and is terminal there. For , the pullback universal property gives , while condition (2) gives . The product functor with on is the composite Consequently it has right adjoint . Since this holds for every , the slice is cartesian closed.
Step 1.1 proves that condition (1) implies condition (2). Step 1.2 proves that each slice is cartesian closed, so condition (2) implies condition (1). Therefore the two conditions are equivalent.
Set is locally cartesian closed
Statement
The category is locally cartesian closed.
Facts & Assumptions
Given: A function and an object of the slice category .
A category is locally cartesian closed exactly when each pullback functor has a right adjoint (Local cartesian closure is equivalent to every pullback functor having a right adjoint).
In , functions are the morphisms and products are cartesian products (Sets and functions form the large locally small category ).
In , currying gives the adjunction between product and function-set formation (Currying gives the adjunction in ).
Proof
For , define a set over by , where . An element of is therefore a choice of one element of for each over ; when , this product is the singleton empty family. The projection sends such a family to .
If is another object over , then a morphism over assigns to each over a family of elements in the fibers for . Equivalently, it assigns to each pair with an element of , which is exactly a morphism over . This correspondence is natural and is the fiberwise form of [L3].
Step 2.1 constructs a right adjoint to every pullback functor in . Hence [L1] implies that is locally cartesian closed.
Subobject classifier
Definition
Let be a category with a terminal object (Initial object, terminal object, and zero object) and pullbacks (Pullbacks and pushouts as limits and colimits of cospans and spans).
A subobject classifier is a monomorphism
(Monomorphism and epimorphism by left and right cancellation) such that for every monomorphism there exists a unique morphism for which is, up to isomorphism of pullback objects, the pullback of along .
The map is the classifying morphism of the subobject represented by . The uniqueness clause is part of the definition: the classifier classifies subobjects in the sense of Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms, not arbitrary representing monomorphisms.
With a supplied well-powering, a subobject classifier represents the subobject functor
Statement
Assume is locally small, has a subobject classifier , and has a supplied well-powering . For each object , let be the quotient set of by mutual factorization. Then is a contravariant Set-valued functor, and the classifier induces a natural isomorphism
Thus represents the supplied representative-set form of the subobject functor.
Facts & Assumptions
Given: A locally small category with a subobject classifier and a supplied well-powering .
A subobject classifier assigns to each monomorphism a unique classifying map whose pullback of recovers the same subobject (Subobject classifier).
A supplied well-powering gives a set of monomorphisms into each object , containing a representative of every subobject class (Well-powered and co-well-powered categories, and supplied well-powerings).
Mutual factorization is an equivalence relation on monomorphisms into a fixed object, and subobjects are precisely those equivalence classes (Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms, Mutual factorisation is an equivalence relation on monomorphisms into an object and dually on epimorphisms out of it).
A contravariantly representable functor is a natural isomorphism for some presheaf (Presheaves, covariantly and contravariantly representable functors, and representations).
Proof
By [L3], the quotient by mutual factorization is a well-defined set for each , and its elements correspond exactly to subobject classes of represented inside the supplied set .
For a morphism and a class , pull back along . The resulting monomorphism into defines a subobject class of , and [L2] provides a representative of that class in ; step 1.1 shows that the resulting element of is independent of the chosen representative. Hence is a contravariant functor.
For each , define by sending to the class of the pullback of along . Conversely, define by sending the class of to its unique classifying map from [L1].
The composites are identities. If , then because the pullback subobject of along is classified by itself, and that classifying map is unique by [L1]. If , then the pullback of along represents the same subobject class as , so . Naturality follows because pullback commutes with composition of classifying maps.
Therefore is a natural isomorphism . By [L4], represents the supplied representative-set form of the subobject functor.
The two-element set is a subobject classifier for Set
Statement
In , the inclusion
is a subobject classifier.
Facts & Assumptions
Given: A monomorphism in .
In , morphisms are functions (Sets and functions form the large locally small category ).
Monomorphisms in are exactly injections (In , monomorphisms are exactly injections and epimorphisms are exactly surjections).
A subobject classifier is a monomorphism whose pullbacks classify all subobjects uniquely (Subobject classifier).
Proof
By [L1] and [L2], is an injection. Its image is a subset, and the bijection identifies with the inclusion . Define by for and otherwise.
The pullback of along has underlying set , so its inclusion into represents the same subobject as via the bijection from step 1.1.
If has a pullback representing the same subobject as , then , so agrees pointwise with . Hence the classifying map is unique. By [L3], is a subobject classifier.
Boundary: this page stops before elementary and Grothendieck toposes
This page develops closed monoidal categories, cartesian closed categories, locally cartesian closed categories, and subobject classifiers. It does not add the remaining axioms of an elementary topos, and it does not enter Grothendieck-topos or Giraud-theorem territory. Those subjects need separate logical and sheaf-theoretic infrastructure.
5 · Examples, counterexamples and false statements
A monoidal category need not be closed
Statement refuted
Every monoidal category is closed.
Facts & Assumptions
Given: The five-element diamond lattice with and pairwise incomparable.
A poset with top element and binary meets becomes a strict monoidal category under meet (A poset with finite meets is a strict monoidal category).
In a lattice, binary meets exist and are written (Lattices, distributive lattices, and order ideals).
Right closed means that, for each fixed object , the functor has a right adjoint (Left-closed, right-closed, and biclosed monoidal categories).
Counterexample
In , the meet operation satisfies , , and , while and are incomparable below . By [L1] and [L2], the associated poset-category is a strict monoidal category with tensor product and unit .
Fix and . An object satisfies exactly when : this holds for , fails for because , and fails for because .
The set has no greatest element, since and are incomparable and both dominate . Therefore there is no object with iff , so the functor has no right adjoint. By [L3], this monoidal category is not right closed and hence not closed.
FALSE: every monoidal category is closed
Statement
Every monoidal category is closed.
Facts & Assumptions
Given: The diamond-lattice monoidal category from A monoidal category need not be closed.
The counterexample item constructs a monoidal category for which has no right adjoint, so the category is not closed (A monoidal category need not be closed).
Refutation
The category exhibited in [L1] is monoidal.
The same category is not closed, because tensoring with the chosen object has no right adjoint. Therefore a monoidal category need not be closed.
So the statement is false.
FALSE: the left and right internal homs agree in every monoidal category
Statement
The left and right internal homs agree in every monoidal category.
Facts & Assumptions
Given: Let be the ring of upper-triangular matrices over a field , let , and work in the monoidal category of -bimodules with tensor product . Set and .
Left and right internal homs are defined separately as right adjoints to and (Left-closed, right-closed, and biclosed monoidal categories).
An -bimodule has commuting left and right actions, and balanced pairings induce unique maps from tensor products (-bimodules and commuting left and right scalar actions, Universal property of the tensor product for balanced maps into abelian groups).
Refutation
For bimodules , a bimodule map corresponds to the bimodule map from to , where . The inverse is evaluation, ; balancing and the two bimodule actions make both constructions well defined by [L2]. Thus is right adjoint to . Similarly, maps correspond to maps , with . Hence [L1] identifies these as the right and left internal homs respectively.
A right -linear map is determined by , and it is well defined exactly when . Thus .
A left -linear map is determined by , and it is well defined exactly when . Thus .
These two bimodules are not isomorphic: every element of is annihilated on the left by , while in . By [L1], the left and right internal homs therefore need not agree.
Hence the statement is false.
FALSE: every cartesian closed category has all finite limits
Statement
Every cartesian closed category has all finite limits.
Facts & Assumptions
Given: The full subcategory of on the nonempty sets.
A cartesian closed category is required to have finite products and exponentials, but not arbitrary finite limits as part of the definition (Cartesian closed category).
If are nonempty sets, then and are again nonempty, so is cartesian closed.
Refutation
By [A1], the category has products and exponentials for all of its objects, so by [L1] it is cartesian closed.
Consider the two constant maps with values and . Their equalizer in is the empty set, which is not an object of . So that equalizer does not exist in .
Therefore a cartesian closed category need not have all finite limits. The statement is false.
FALSE: every cartesian closed category is locally cartesian closed
Statement
Every cartesian closed category is locally cartesian closed.
Facts & Assumptions
Given: The category of nonempty sets.
Local cartesian closedness requires every slice to be cartesian closed (Locally cartesian closed category).
The category is cartesian closed, by the same function-set argument as in the previous false statement.
Refutation
By [A1], is cartesian closed.
In the slice over the two-point set , consider the singleton inclusions and . Their product in the slice would be their pullback, which is the empty set over . That object is not present in .
So the slice over is not even finitely complete, hence not cartesian closed. Therefore is not locally cartesian closed, and the statement is false.
FALSE: a subobject classifier is any object representing monomorphisms
Statement
A subobject classifier is any object representing monomorphisms.
Facts & Assumptions
Given: The set and the two singleton inclusions , with .
A subobject classifier classifies subobjects, meaning mutual-factorization classes of monomorphisms, and the classifying map is unique for that class (Subobject classifier, Subobject and quotient object as mutual-factorisation classes of monomorphisms and epimorphisms).
Two monomorphisms representing the same subobject class need only be isomorphic, not literally equal as arrows (Mutual factorisation is an equivalence relation on monomorphisms into an object and dually on epimorphisms out of it).
Refutation
The monomorphisms and have different domains and are different arrows, but they factor through each other via the unique bijection . So [L2] says that they represent the same subobject of .
Any classifier must assign the same characteristic map to the subobject class represented by and , because [L1] classifies subobjects rather than literal presenting monomorphisms. Therefore no object representing monomorphisms as bare arrows can be the right notion.
So the statement is false.
Sources
- Emily Riehl, Category Theory in Context, 2nd ed., Definition 4.4.7
- G. M. Kelly, Basic Concepts of Enriched Category Theory, Section 1.5
- S. Mac Lane, Categories for the Working Mathematician, 2nd ed., VII.7
- Emily Riehl, Category Theory in Context, 2nd ed., Proposition 4.3.1 and Definition 4.4.7
- G. M. Kelly, Basic Concepts of Enriched Category Theory, equations (1.23) and (1.24)
- Emily Riehl, Category Theory in Context, 2nd ed., Section 4.4
- Emily Riehl, Category Theory in Context, 2nd ed., Section 4.4 and Theorem 4.2.1
- Emily Riehl, Category Theory in Context, 2nd ed., Theorem 4.2.1 and Section 4.4
- G. M. Kelly, Basic Concepts of Enriched Category Theory, equations (1.25) to (1.27)
- G. M. Kelly, Basic Concepts of Enriched Category Theory, equations (1.25) and (1.26)
- S. Mac Lane, Categories for the Working Mathematician, 2nd ed., IV.6
- Emily Riehl, Category Theory in Context, 2nd ed., Definition 4.4.10
- Emily Riehl, Category Theory in Context, 2nd ed., Example 4.4.9
- Tom Leinster, Basic Category Theory, Example 6.3.17
- Emily Riehl, Category Theory in Context, 2nd ed., Lemma 4.4.11
- Tom Leinster, Basic Category Theory, Exercise 6.3.25
- Emily Riehl, Category Theory in Context, 2nd ed., Theorem 4.2.1
- Emily Riehl, Category Theory in Context, 2nd ed., Section 4.6
- Emily Riehl, Category Theory in Context, 2nd ed., Definition 4.6.2
- Emily Riehl, Category Theory in Context, 2nd ed., Lemma 4.6.3(i)
- Emily Riehl, Category Theory in Context, 2nd ed., Lemma 4.6.3(ii)
- Emily Riehl, Category Theory in Context, 2nd ed., Lemma 4.6.4
- Emily Riehl, Category Theory in Context, 2nd ed., Proposition 4.6.6
- S. Mac Lane, Categories for the Working Mathematician, 2nd ed., IV.9
- Tom Leinster, Basic Category Theory, Exercise 6.3.26
- S. Mac Lane, Categories for the Working Mathematician, 2nd ed., IV.10
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Example 2.3.12