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.
Adjunctions Units and Counits
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Compactness
- Compactness in Metric Spaces
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Convergence: Nets and Filters
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hereditary and Productive Behaviour of the Separation Axioms
- Limits and Colimits
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- 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
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Set Theory Beyond Choice: Recorded, Not Proved Here
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Tychonoff Embedding and the Stone–Čech Compactification
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Universal Properties, Representables and the Yoneda Lemma
- Urysohn's Lemma and the Tietze Extension Theorem
2 · Summary
Categories, functors and natural transformations are published, together with whiskering and horizontal composition, the interchange law, functor categories, comma categories, the small / locally small / large distinction, full, faithful and essentially surjective functors, equivalences and adjoint equivalences, and the duality principle. Universal arrows are known to be initial or terminal in the appropriate comma category; hom functors and the hom bifunctor are defined; representable functors and representations are available; and the Yoneda lemma is natural in both variables. Limits and colimits of diagrams, preservation and creation, limit–colimit duality, and the theorem that representable functors preserve small limits complete the categorical background, while free groups, abelianisation, the universal property of free modules and the Stone–Čech compactification supply concrete material.
An adjunction is defined here by functors, a unit, a counit and the two triangle identities, a formulation that stays meaningful without local smallness; transposition recovers the natural hom-set bijection when the hom-classes are sets, and universal arrows and initial comma objects give equivalent encodings, with the choice used to assemble objectwise universal objects into a functor made explicit. Uniqueness, composition, induced adjunctions on functor categories, mates, fixed subcategories, full-faithfulness read off the counit, adjoint triples and Galois connections follow. The unit–counit proof that right adjoints preserve limits carries no size hypothesis, and a representable proof is kept separate and locally small. Exactness consequences and the diagonal-functor adjunctions come next, and the page ends with image and preimage, free groups, free modules, free monoids, abelianisation, the discrete and indiscrete topologies, Stone–Čech, coextension of scalars and currying.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Adjunction by unit, counit, and the triangle identities
Definition
Let and be categories. An adjunction consists of functors and , a natural transformation
called the unit, and a natural transformation
called the counit, such that the two triangle identities hold:
Here whiskering and vertical composition are those of Whiskering and horizontal composition of natural transformations. Componentwise, for every and ,
The direction means that is left adjoint to and is right adjoint to . If and are natural isomorphisms, this is precisely the adjunction data occurring in an adjoint equivalence (Equivalence, quasi-inverse, and adjoint equivalence of categories).
The unit-counit definition imposes no local-smallness hypothesis
The data in Adjunction by unit, counit, and the triangle identities consist only of functors and natural transformations, so they are meaningful for legitimate large categories even when a hom-class is not a set. By contrast, a Set-valued family of hom-set bijections presupposes local smallness as defined in Small, locally small, and large categories. The hom-set formulation remains equivalent under that hypothesis, but it is not used as the definition here because the size condition belongs to that encoding rather than to adjunctions themselves.
An adjoint equivalence is an adjunction whose unit and counit are natural isomorphisms
Statement
For functors and , the following data are equivalent:
- an adjoint equivalence between and with functors and ;
- an adjunction (Adjunction by unit, counit, and the triangle identities) whose unit and counit are natural isomorphisms.
Consequently, every equivalence of categories can be equipped with such an adjunction.
Facts & Assumptions
Given: Categories and functors , .
An adjoint equivalence consists of , a natural isomorphism , a natural isomorphism , and the two triangle identities (Equivalence, quasi-inverse, and adjoint equivalence of categories).
Every equivalence of categories admits a choice of unit and counit satisfying the triangle identities, and hence can be equipped as an adjoint equivalence (Every equivalence of categories can be equipped as an adjoint equivalence).
Proof
Starting with an adjoint equivalence, forget only the assertion that and are invertible. The remaining functors, natural transformations, and triangle identities are an adjunction, while the forgotten assertion still says its unit and counit are natural isomorphisms.
Conversely, an adjunction with invertible unit and counit has exactly the functors, natural isomorphisms, and triangle identities required by [F1], so it is an adjoint equivalence.
Finally, [F2] equips any equivalence with the data in step 1.1, proving the consequence.
Adjuncts and transposition under an adjunction
Definition
Let be an adjunction in the sense of Adjunction by unit, counit, and the triangle identities, with unit and counit . For objects and :
- the right adjunct, or transpose, of is
- the left adjunct, or inverse transpose, of is
The symbols and always refer to the displayed adjunction; when several adjunctions occur, the relevant unit and counit are named explicitly.
The unit and counit transpose formulas are mutually inverse
Statement
Let have unit and counit . For every and ,
where transposition is defined in Adjuncts and transposition under an adjunction.
Facts & Assumptions
Given: An adjunction with unit and counit , objects , and morphisms and .
The triangle identities are and (Adjunction by unit, counit, and the triangle identities).
The transpose formulas are and (Adjuncts and transposition under an adjunction).
Proof
Expanding the first composite gives .
Naturality of at gives .
Expanding the second composite gives .
Naturality of at gives .
Substituting step 1.2 into step 1.1 and applying the first triangle identity yields .
Substituting step 1.4 into step 1.3 and applying the second triangle identity yields .
Under local smallness, transposition gives the natural hom-set bijection, and conversely
Statement
Let and be locally small categories and let and be functors.
An adjunction determines bijections
natural in and , whose inverses are . Conversely, every such natural family of bijections determines a unique unit and counit satisfying the triangle identities, and hence a unique adjunction structure on and .
Facts & Assumptions
Given: Locally small categories and functors , .
In a locally small category every hom-collection is a set (Small, locally small, and large categories).
In a locally small category the two-variable hom assignment is a Set-valued bifunctor, contravariant in its first variable and covariant in its second (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).
Under an adjunction, the two transpose formulas are mutually inverse on every pair of hom-collections (The unit and counit transpose formulas are mutually inverse).
The transpose formulas are and (Adjuncts and transposition under an adjunction).
Proof
Given an adjunction, [F1] makes the displayed hom-collections sets, and [L1] shows that and are inverse bijections.
For , , and , functoriality and naturality of give ; this is naturality in both variables in the sense of [F2].
Conversely, let be a natural family of bijections with inverse . Define and .
Naturality of in makes natural, and naturality of in makes natural.
Naturality in and , respectively, gives and .
Since fixes , step 2.2 gives ; since fixes , it gives .
Thus the data of steps 1.3 and 2.1 satisfy both triangle identities and define an adjunction. Any unit and counit inducing must be the transposes of the two identity morphisms, so step 1.3 also proves uniqueness.
A square commutes if and only if its transposed square commutes
Statement
Let be an adjunction between locally small categories. Suppose
Then
The analogous equivalence holds after applying inverse transposition to a square between morphisms .
Facts & Assumptions
Given: The adjunction and the four typed morphisms in the Statement.
Transposition is a bijection natural in both variables: for , and , one has (Under local smallness, transposition gives the natural hom-set bijection, and conversely).
Proof
If , apply transposition. By [L1], the transpose of the left side is , while the transpose of the right side is , so the transposed square commutes.
Conversely, if the transposed square commutes, apply the inverse bijection to its two sides. The two inverse images are and by [L1], so the original square commutes.
Repeating steps 1.1 and 1.2 with the inverse bijections proves the analogous assertion for inverse transposition.
Unit components are initial in comma categories, and counit components are terminal
Statement
Let have unit and counit .
- For each , is a universal arrow from to , hence an initial object of .
- For each , is a universal arrow from to , hence a terminal object of .
No local-smallness hypothesis is needed.
Facts & Assumptions
Given: An adjunction with unit and counit .
A universal arrow from to is a pair such that every factors uniquely as ; dually, a universal arrow from to has the corresponding unique factorisation property (Universal arrows from an object to a functor and from a functor to an object).
A universal arrow from an object to a functor is initial in the associated comma category, and a universal arrow from a functor to an object is terminal in the dual comma category (Universal arrows to a functor are initial in comma categories, and universal arrows from a functor are terminal).
The formulas and are mutually inverse for an adjunction (The unit and counit transpose formulas are mutually inverse, Adjuncts and transposition under an adjunction).
Proof
Fix and a morphism . Its inverse transpose satisfies , and it is the unique morphism with this property because transposition is injective.
Dually, for , its transpose is the unique morphism satisfying .
Thus has the universal property in [F1], and [F2] makes it initial in .
Hence is universal from to and terminal in . The argument used individual morphisms and uniqueness only, so it imposed no set-size condition on any hom-class.
The unit-counit, hom-set, unit-universal, and counit-universal encodings of an adjunction are equivalent
Statement
For functors and , the following descriptions carry the same adjunction data:
- a unit and counit satisfying the triangle identities;
- when and are locally small, a natural family of bijections ;
- a natural family of universal arrows from each to ;
- a natural family of universal arrows from to each .
Only description 2 requires local smallness.
Facts & Assumptions
Given: Categories and functors , .
An adjunction is functors together with a unit, counit, and the two triangle identities (Adjunction by unit, counit, and the triangle identities).
Under local smallness, unit-counit data and natural hom-set bijections determine one another uniquely (Under local smallness, transposition gives the natural hom-set bijection, and conversely).
Unit components are universal arrows and initial comma objects, while counit components are universal arrows and terminal comma objects (Unit components are initial in comma categories, and counit components are terminal).
Proof
Descriptions 1 and 2 determine one another by [L2], including the recovery formulas obtained by transposing identity morphisms.
Description 1 gives descriptions 3 and 4 by [L3].
Conversely, from description 3, put for ; the unique-factorisation property of says exactly that this is a bijection onto the morphisms , with inverse the unique factorisation. Define as the unique morphism with , which is the second triangle identity. For the two morphisms and have the same factorisation datum, since and ; uniqueness makes natural. Likewise , so uniqueness gives the first triangle identity . This recovers a unit and counit satisfying [L1].
The dual construction from description 4 defines as the unique morphism with , proves its naturality from terminality of in by the argument of step 1.3 read in the opposite categories, and yields the second triangle identity the same way. It therefore gives the same unit-counit data.
Steps 1.1 through 2.1 establish all implications. Since [L3] is expressed by unique individual factorisations, descriptions 1, 3, and 4 remain meaningful without local smallness, whereas [L2] explicitly uses hom-sets.
A left adjoint exists exactly when chosen initial objects are supplied in every comma category
Statement
Let be a functor. A left adjoint to is supplied exactly by choosing, for every , an initial object of the comma category . These choices determine the action of on morphisms and the adjunction uniquely.
Dually, a right adjoint to is supplied exactly by choosing a terminal object in every comma category .
Facts & Assumptions
Given: A functor .
The comma category has objects , and a morphism from to is a morphism with (Comma category, slice category, and coslice category).
If , then is initial in for every ; dually, counit components are terminal in (Unit components are initial in comma categories, and counit components are terminal).
Unit-counit data with the triangle identities and a natural family of universal arrows from each to carry the same adjunction data, and neither description requires local smallness (The unit-counit, hom-set, unit-universal, and counit-universal encodings of an adjunction are equivalent).
Proof
If a left adjoint is supplied, [L1] gives the required chosen initial object for every .
Conversely, suppose such initial objects are supplied. For , initiality gives a unique satisfying .
The identity satisfies the defining equation for , so uniqueness gives .
If and , then satisfies the defining equation for ; uniqueness gives . Thus is a functor and is natural.
For every , initiality supplies a unique with . Steps 2.1 and 2.2 make a functor and natural, so is a natural family of universal arrows from each to ; by [L2] that data is an adjunction, so .
Any functor action compatible with the chosen initial objects must satisfy the equation in step 1.2 and is therefore equal to this one. Passing to opposite categories proves the terminal-object criterion for right adjoints.
Chosen objectwise universal arrows assemble uniquely into a left adjoint
Statement
Let be a functor. Suppose that for every a universal arrow from to is supplied. There is a unique functor structure on the object assignment for which is natural, and with that structure .
Facts & Assumptions
Given: The functor and the supplied universal arrows in the Statement.
Universality means that every factors uniquely as for a morphism (Universal arrows from an object to a functor and from a functor to an object).
Chosen initial objects in all determine a unique left adjoint functor (A left adjoint exists exactly when chosen initial objects are supplied in every comma category).
Proof
For , apply [F1] to and define as the unique morphism satisfying .
The uniqueness clause in [F1] gives and , because the proposed right sides satisfy the same defining equations.
Hence is a functor and the equations in step 1.1 say exactly that is natural. The same universal factorisations give the adjunction by [L1].
Any other compatible functor structure would have to satisfy the defining equation in step 1.1, so [F1] makes it identical to this one on every morphism.
A supplied pointwise right adjoint extends uniquely to a functor
Statement
Let be a functor between locally small categories. Suppose an object is supplied for every , together with an isomorphism
natural in the variable of . Then the object assignment has a unique functor structure for which the are natural in , and .
Facts & Assumptions
Given: The functor , supplied objects , and representing isomorphisms as in the Statement.
A representation of a presheaf is an object together with a natural isomorphism from the corresponding representable presheaf (Presheaves, covariantly and contravariantly representable functors, and representations).
The Yoneda bijection is natural in both the represented object and the presheaf, so a natural transformation between represented presheaves is induced by a unique morphism between their representing objects (The Yoneda bijection is natural in both and ).
A natural family determines an adjunction (Under local smallness, transposition gives the natural hom-set bijection, and conversely).
Proof
For , postcomposition by gives a natural transformation . Transport it through and ; [F2] supplies a unique morphism representing the result.
Postcomposition by an identity is the identity transformation, so Yoneda uniqueness gives .
Postcomposition by is the composite of postcomposition by and by , so Yoneda uniqueness gives . Thus is a functor.
The definition in step 1.1 makes natural in ; it was natural in by hypothesis. Therefore [L1] gives .
If another functor structure made every natural, its value on would induce the same transported natural transformation, so [F2] would force it to equal . The supplied object assignment also shows that no class-sized selection was made in the proof.
Objectwise existence does not itself supply a class-sized choice of adjoint values
The reverse implications in A left adjoint exists exactly when chosen initial objects are supplied in every comma category and A supplied pointwise right adjoint extends uniquely to a functor begin with chosen objects as data. An assertion that a suitable object exists separately for every object of a proper class does not by itself provide one class-function selecting them all. This is the same distinction recorded for limit and colimit functors in A limit for each diagram need not provide a chosen limit functor without a simultaneous choice of representatives: after the object assignment is supplied, universal uniqueness determines the morphism assignment without further choice.
Adjoints are unique up to a unique natural isomorphism compatible with the adjunction data
Statement
Suppose and are two left adjoints to the same functor, with units and . There is a unique natural isomorphism satisfying
for every . It also intertwines the two counits. Dually, two right adjoints to the same functor are uniquely naturally isomorphic in a way compatible with their adjunction data. No local-smallness hypothesis is needed.
Facts & Assumptions
Given: Adjunctions and , with units and counits .
An adjunction supplies a natural unit and counit satisfying the two triangle identities, in particular (Adjunction by unit, counit, and the triangle identities).
Each and is initial in , and no local-smallness hypothesis is needed (Unit components are initial in comma categories, and counit components are terminal).
Proof
By initiality of there is a unique with ; reversing the roles gives a unique with .
The composites and both carry to itself, so initiality gives ; similarly .
Let . The object lies in , so by initiality of exactly one morphism composes with to . Both candidates do: by naturality of , and by naturality of . Hence and is natural. This uses only initiality and naturality of the units, so no local smallness is required.
Any natural transformation compatible with the units has components satisfying the uniqueness condition in step 1.1 and hence equals . For counit compatibility, both and are morphisms , and initiality of determines such a morphism by its composite: by the triangle identity of [L1], while by step 1.1 and the triangle identity for . So . Passing to opposite categories proves the dual assertion.
Adjunctions compose with the composite unit and counit formulas
Statement
Let be left adjoint to , with unit and counit , and let be left adjoint to , with unit and counit . Then
with unit and counit
Facts & Assumptions
Given: The two adjunctions and their units and counits as in the Statement.
An adjunction is determined by a unit, a counit, and the two triangle identities (Adjunction by unit, counit, and the triangle identities).
Whenever the expressions are defined, the interchange identity is (Horizontal and vertical composition of natural transformations satisfy the interchange law).
Proof
Whiskering gives and , so the displayed composites have the required types; they are natural because whiskering and vertical composition preserve naturality.
Expanding the first triangle composite for gives . Interchange rewrites the two middle factors as , and naturality of at the component turns that bracket into .
Expanding the second triangle composite for gives . Interchange rewrites the two middle factors as , and naturality of at the component turns that bracket into . The composite becomes , which by the two second triangle identities and is .
By step 2.1 the first composite becomes , which by the two first triangle identities and is .
Thus and satisfy both triangle identities, and [L1] gives .
An adjunction induces postcomposition and precomposition adjunctions on legitimate functor categories
Statement
Let . Whenever the indicated functor categories are legitimate:
- postcomposition gives an adjunction ;
- precomposition gives an adjunction .
If is small and are locally small, the functor categories in clause 1 are locally small.
Facts & Assumptions
Given: An adjunction with unit and counit , and categories for which the displayed functor categories are formed.
For a small source category, functors and natural transformations form the functor category (Functor category ).
If the source is small and the target is locally small, the resulting functor category is locally small (If is small and is locally small then is locally small; if both are small it is small).
The triangle identities are and (Adjunction by unit, counit, and the triangle identities).
Proof
Postcomposition sends to and to . Whiskering and gives unit components and counit components .
Precomposition sends to and to . Whiskering now gives the unit and counit , so .
The two triangle identities hold at every object of by [L1], hence hold as equalities of natural transformations. Therefore .
Again the triangle identities are the images under and of those in [L1]. The size assertion follows from [F2]; the componentwise unit-counit construction itself uses only legitimate functors and natural transformations.
Natural transformations have mates under a pair of adjunctions
Statement
Let and have units and counits . For functors and , there is a bijection between natural transformations
and their right mates
The right mate and inverse construction are
When the two adjunctions coincide and , , the mate of is . Mates respect typed vertical and horizontal pasting. No local-smallness hypothesis is needed.
For a general pair of adjunctions the mate of an identity transformation need not be an identity transformation: has source and target , and these functors need not be equal.
Facts & Assumptions
Given: The adjunctions, functors, and typed transformations in the Statement.
Each adjunction supplies natural units, counits, and two triangle identities (Adjunction by unit, counit, and the triangle identities).
The left whiskering has components and the right whiskering has components ; each is a horizontal composite of with an identity transformation, and horizontal composites of natural transformations satisfy naturality (Whiskering and horizontal composition of natural transformations, Horizontal composites of natural transformations satisfy naturality).
The vertical composite of natural transformations satisfies naturality (Vertical composites of natural transformations satisfy naturality).
The interchange identity is whenever the expressions are defined (Horizontal and vertical composition of natural transformations satisfy the interchange law).
Proof
Whiskering shows that the three factors defining have successive types ; the three factors defining have successive types .
Each of those six factors is a whiskering of one of , , , , , , every one of which is natural by [L1] and the hypothesis on and ; so each factor is natural by [L2], and the two vertical composites are natural by [L3]. Only the unit–counit data enters, so the argument applies whether or not the four categories are locally small.
When the two adjunctions coincide and are identity functors, the middle factor is the identity transformation of , so the mate of is , which is by the triangle identity of [L1]. For a typed vertical or horizontal pasting, expand the displayed formulas; interchange identifies the expansion with the corresponding pasting of the mates, with the order fixed by the types.
Substitute into the formula for . Interchange moves the two unit-counit pairs together, and the triangle identities cancel both pairs, leaving .
Substituting into the formula for gives the dual cancellation and leaves . Thus the constructions are inverse.
Hence the formulas give the asserted bijection, carry to in the coinciding-adjunction case, and preserve both forms of compatible pasting.
Conjugation preserves invertibility but the general mates correspondence need not
When both adjunctions in Natural transformations have mates under a pair of adjunctions are adjoint equivalences, all unit and counit components in the mate formulas are isomorphisms. A mate is then obtained from the original transformation by whiskering and composing with isomorphisms, so invertibility is preserved. For a general adjunction the unit or counit need not be invertible; an identity transformation can have such a component as its mate. The mates bijection therefore preserves equations and typed pasting, not invertibility in general.
An adjunction restricts to an equivalence on the subcategories fixed by its unit and counit
Statement
For an adjunction , let be the full subcategory of objects for which is an isomorphism, and let be the full subcategory of objects for which is an isomorphism. Then and restrict to an adjoint equivalence
Facts & Assumptions
Given: An adjunction with unit and counit .
A full subcategory contains chosen objects and all morphisms between them from the ambient category (Subcategory and full subcategory).
An equivalence consists of quasi-inverse functors and natural isomorphisms between their composites and the identity functors (Equivalence, quasi-inverse, and adjoint equivalence of categories).
The triangle identities are and (Adjunction by unit, counit, and the triangle identities).
Proof
If is invertible, then is invertible, and the first triangle identity makes ; hence .
Dually, if is invertible, then the second triangle identity makes ; hence .
By [F1], and therefore restrict to functors between the two full subcategories, and the restricted unit and counit remain natural.
Every component of the restricted unit and counit is an isomorphism by definition, so [F2] makes the restrictions quasi-inverse equivalences; the inherited triangle identities make the equivalence adjoint.
Fullness and faithfulness of a right adjoint are detected by its counit
Statement
Let be an adjunction between locally small categories, with counit .
- is faithful if and only if every is an epimorphism.
- is full if and only if every is a split monomorphism.
- is fully faithful if and only if is a natural isomorphism.
Dually, is faithful exactly when every unit component is monic, full exactly when every unit component is split epic, and fully faithful exactly when the unit is a natural isomorphism.
Facts & Assumptions
Given: The adjunction in the Statement, with unit and counit .
A functor is faithful when every induced hom-set map is injective, full when every such map is surjective, and fully faithful when every such map is bijective (Faithful, full, fully faithful, essentially surjective, and split essentially surjective functors).
A morphism is epic when implies for every parallel pair (Monomorphism and epimorphism by left and right cancellation).
A morphism is a split monomorphism when there is with (Split monomorphism, split epimorphism, retraction, and section).
Transposition gives natural bijections (Under local smallness, transposition gives the natural hom-set bijection, and conversely).
Proof
If is faithful and , then ; composing with and using the triangle identity gives , hence . Thus each is epic.
Conversely, if every is epic and , naturality gives , so . Hence is faithful.
If is full, lift to with . Naturality of and the first triangle identity give , so is split monic.
Conversely, choose with . Then is the inverse of , whose right inverse is by the triangle identity, so . For , the morphism satisfies , using naturality of and the triangle identity. Thus is full.
A fully faithful makes both epic and split monic by steps 1.1 and 1.3; if , epicity gives , so is an isomorphism. Conversely, an invertible counit is epic and split monic, so steps 1.2 and 2.1 make fully faithful.
Passing to opposite categories exchanges the counit with the unit, faithful with faithful, epic with monic, and split monic with split epic, proving the dual assertions.
Adjoint triple
Definition
An adjoint triple consists of categories , functors
and adjunctions and in the sense of Adjunction by unit, counit, and the triangle identities. Thus the middle functor is simultaneously a right adjoint and a left adjoint, with separate units and counits for the two adjunctions.
An adjoint triple induces adjunctions between its associated endofunctors
Statement
If , with and , then
and
These adjunctions use the composite units and counits and require no local-smallness hypothesis.
Facts & Assumptions
Given: An adjoint triple .
An adjoint triple supplies adjunctions and with the displayed functor types (Adjoint triple ).
If and , then with the composite unit and counit formulas (Adjunctions compose with the composite unit and counit formulas).
Proof
Compose with in [L2]. The left composite is and the right composite is , so .
Compose with in [L2]. The left composite is and the right composite is , so .
In each case the unit is obtained by inserting the second unit between the first unit's functors, and the counit by inserting the first counit between the second counit's functors, exactly as in [L2]. Since [L2] uses unit-counit data, neither construction requires hom-sets.
Mutually left and mutually right adjoint contravariant functors
Definition
Let and be contravariant functors (Covariant functor, identity functor, composite functor, and contravariant functor) between locally small categories (Small, locally small, and large categories). They are mutually left and mutually right adjoint when there are bijections
natural in and . Equivalently, the covariant functors and form an adjoint pair, and the same data give the opposite adjunction after reversing both categories.
Galois connection between preorders
Definition
Let and be preorders (Preorder and monotone map). A Galois connection consists of monotone maps and such that, for every and ,
Under the identification of preorders with thin categories in A preorder is a category with at most one morphism between any two objects, and its functors are exactly monotone maps, this is exactly an adjunction. The corresponding unit and counit are the inequalities
A Galois connection between posets satisfies and
Statement
Let be posets and let , form a Galois connection. Then
For preorders, the same argument gives pointwise equivalences and in the associated thin categories, but equality need not follow without antisymmetry.
Facts & Assumptions
Given: Posets and a Galois connection .
A Galois connection satisfies and , and both maps are monotone (Galois connection between preorders).
Antisymmetry says that and imply (Partial order and partially ordered set).
Proof
Applying to gives , while the counit inequality at gives .
Applying to gives , while the unit inequality at gives .
Antisymmetry applied to steps 1.1 and 1.2 gives and for every , hence the two equalities of maps.
Without antisymmetry, steps 1.1 and 1.2 still give morphisms in both directions between the corresponding objects of each thin category, which are inverse because parallel morphisms are unique.
In a poset adjunction the triangle identities are automatic
Statement
Let and be monotone maps between posets. If there are natural transformations and , equivalently the pointwise inequalities
then both triangle identities hold automatically. In particular, the unit and counit inequalities of a Galois connection determine an adjunction without a separate triangle calculation.
Facts & Assumptions
Given: The monotone maps and pointwise inequalities in the Statement.
A preorder determines a category with at most one morphism between any two objects, and functors between such categories are exactly monotone maps (A preorder is a category with at most one morphism between any two objects, and its functors are exactly monotone maps).
A Galois connection supplies the unit inequalities and counit inequalities (Galois connection between preorders).
Proof
By [F1], each pointwise inequality is the unique possible morphism with its source and target, so the supplied families are natural transformations.
At , the two sides of the first triangle identity are parallel morphisms in the thin category , hence they are equal.
At , the two sides of the second triangle identity are parallel morphisms in the thin category , hence they are equal.
Thus both triangle identities hold. Applying this to the inequalities in [L1] proves the final assertion.
Right adjoints preserve every limit that exists
Statement
Let be left adjoint to . If a diagram has a limit , then is a limit of . Thus preserves every limit that exists, for arbitrary indexing categories for which the displayed diagram and cone categories are legitimate.
Facts & Assumptions
Given: An adjunction with unit and counit , a diagram , and a limiting cone .
A limit of a diagram is a terminal cone: every cone has a unique mediating morphism to its vertex whose composites with the limiting legs are the given cone legs (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).
A functor preserves a limit when the image of a limiting cone is limiting (Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors).
The unit and counit are natural and satisfy and (Adjunction by unit, counit, and the triangle identities).
Proof
Let be any cone over , and define .
For in , naturality of and the cone equation for give , so is a cone over .
By [F1], there is a unique with for every . Define .
For each , , by naturality of and the second triangle identity.
If also satisfies , then mediates by naturality of . Uniqueness in [F1] makes it , and naturality of together with the second triangle identity give , that is .
Thus every cone over factors uniquely through , so it is limiting by [F1]. The construction also covers the empty diagram, where there are no leg equations, and [F2] says exactly that preserves the limit.
Left adjoints preserve every colimit that exists
Statement
If is a left adjoint and a diagram has a colimit, then applying to a colimiting cocone produces a colimit of . Thus left adjoints preserve every colimit that exists.
Facts & Assumptions
Given: An adjunction and a diagram in with a colimit.
A formal theorem derived from the category axioms has a formal dual obtained by reversing morphisms and exchanging each notion with its opposite-category version (Every theorem about categories has a formal dual obtained by reversing morphisms and composition).
A cocone is colimiting in a category exactly when the reversed family is a limiting cone in the opposite category (A limiting cone for a diagram is exactly a colimiting cocone for the formally dual diagram in the opposite category).
Right adjoints preserve every limit that exists (Right adjoints preserve every limit that exists).
Proof
Passing to opposite categories turns into , so is a right adjoint.
By [F2], the given colimit in is a limit in .
Apply [L1] to : the reversed image cone is limiting in .
Translating back with [F2], the image cocone under is colimiting in .
The direct preservation theorem carries no size hypothesis
The proof of Right adjoints preserve every limit that exists transposes individual cone legs by explicit unit and counit formulas. It neither collects a hom-class into a set nor forms a Set-valued representable functor. Consequently its statement applies to every legitimate diagram whose limit exists, without assuming local smallness of the categories or smallness of the indexing category. The separate representable proof needs both hypotheses because its chain of hom-set isomorphisms is Set-valued.
Under local smallness, representable functors give a second proof that right adjoints preserve small limits
Statement
Let be an adjunction between locally small categories. For every small diagram with a limit, the representable-functor calculation identifies as a limit of . Equivalently, the canonical comparison
is an isomorphism whenever the displayed chosen limits are supplied.
Facts & Assumptions
Given: The locally small adjunction and small diagram in the Statement.
A covariantly representable Set-valued functor on a locally small category preserves every small limit that exists (Every covariantly representable functor to Set preserves all existing small limits).
A functor preserves a chosen limit exactly when its canonical comparison to the chosen limit of the image diagram is an isomorphism (A functor preserves a chosen limit exactly when its canonical comparison to the chosen target limit is an isomorphism, and dually for colimits).
The adjunction gives natural bijections (Under local smallness, transposition gives the natural hom-set bijection, and conversely).
Proof
For every , [L1] gives .
By [F1], the right side is naturally isomorphic to , since is representable and is small.
Applying [L1] componentwise identifies this limit with . The composite is natural in .
Hence the cone represents the cone functor and is limiting. If a chosen limit of is also supplied, uniqueness of limits makes the canonical comparison an isomorphism, exactly as stated in [F2].
Left exact and right exact functors
Definition
A functor is left exact when it preserves every finite limit that exists in its source category, and right exact when it preserves every finite colimit that exists there. Here finite means indexed by a finite category as in Finite, small, and large limits and colimits; complete and cocomplete categories, and preservation has the meaning of Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors. These terms assert preservation, not existence, of the relevant limits or colimits.
A right adjoint is left exact and a left adjoint is right exact
Statement
Every right adjoint is left exact, and every left adjoint is right exact. The assertion concerns finite limits or colimits that exist in the source category; it does not assert that the source has them.
Facts & Assumptions
Given: An adjunction .
Right adjoints preserve every limit that exists (Right adjoints preserve every limit that exists).
Left adjoints preserve every colimit that exists (Left adjoints preserve every colimit that exists).
Left exact means preserving existing finite limits, and right exact means preserving existing finite colimits (Left exact and right exact functors).
Proof
Applying [L1] to finite indexing categories shows that preserves every existing finite limit.
Applying [L2] to finite indexing categories shows that preserves every existing finite colimit.
Unfolding [L3], step 1.1 says that is left exact and step 1.2 says that is right exact, without adding an existence hypothesis.
Right adjoints preserve monomorphisms and left adjoints preserve epimorphisms
Statement
Every right adjoint preserves monomorphisms, and every left adjoint preserves epimorphisms.
Facts & Assumptions
Given: A morphism and an adjunction whose right or left adjoint is applied to it.
A morphism is monic when implies for every parallel pair, and epic when implies for every parallel pair (Monomorphism and epimorphism by left and right cancellation).
Right adjoints preserve every existing limit (Right adjoints preserve every limit that exists).
Left adjoints preserve every existing colimit (Left adjoints preserve every colimit that exists).
Proof
If is monic, the commutative square with vertex , both maps into the two copies of equal to , and both maps from those copies to equal to , is a pullback: a pair with has the unique mediating map .
Conversely, if that self-square is a pullback and , then both and are mediating maps for the same cone, so pullback uniqueness gives ; hence is monic.
A right adjoint preserves the pullback in step 1.1 by [L1], and step 1.2 then says that the image of is monic.
Passing to opposite categories turns epimorphisms into monomorphisms and a left adjoint into a right adjoint; equivalently, apply [L2] to the dual pushout characterization. Thus left adjoints preserve epimorphisms.
Chosen limits and colimits are adjoint to the diagonal functor
Statement
Let be small and let be the diagonal functor.
- If a limiting cone is supplied for every , the resulting limit functor satisfies .
- If a colimiting cocone is supplied for every such , the resulting colimit functor satisfies .
The choices are part of the hypotheses.
Facts & Assumptions
Given: The small category and the supplied choices in the Statement.
Chosen limiting or colimiting cones for every diagram assemble into limit or colimit functors (Chosen limits and colimits of a fixed small shape assemble into limit and colimit functors).
A limit is a terminal cone and a colimit is an initial cocone (Limits and colimits as terminal cones and initial cocones, with existence and uniqueness in their universal properties).
Morphisms in a functor category are natural transformations (Functor category ).
Proof
By [F1], the supplied limiting cones define a functor .
A morphism is, by [F2], uniquely equivalent to a cone from to ; by [F3], such a cone is exactly a natural transformation .
Dually, supplied colimits assemble by [F1], and [F2] with [F3] make a morphism uniquely equivalent to a cocone .
The correspondence in step 1.2 is natural in and because postcomposition of a mediating map and transport of a cone along a natural transformation preserve the defining cone equations. Hence .
Reading step 2.1 in the opposite categories gives the corresponding check for step 1.3: the cocone correspondence is natural in and because precomposition of a mediating map and transport of a cocone along a natural transformation preserve the defining cocone equations. Hence .
Both constructions begin with supplied objectwise choices; no selection is inferred from bare existence.
Direct image, preimage, and universal image form an adjoint triple on power sets
Statement
For a function , order the power sets by inclusion and define
Then
Thus direct image is left adjoint to preimage, and universal image is right adjoint to preimage. The notation here always denotes universal image.
Facts & Assumptions
Given: A function , subsets and .
For a relation, image and preimage are and (The image and the preimage of a set under a relation).
For posets, an adjunction is a Galois connection: if and only if (Galois connection between preorders).
Proof
By [F1], means that every satisfies , which is equivalent to .
The inclusion means that whenever , every in the fibre lies in ; this is equivalent to .
Step 1.2 also covers an empty fibre, because the empty set is a subset of every ; hence no surjectivity hypothesis on is present.
Applying [L1] to steps 1.1 and 1.2 gives and , respectively.
The image-preimage adjunctions explain the set-operation preservation laws
In Direct image, preimage, and universal image form an adjoint triple on power sets, is a left adjoint, so its preservation of joins recovers the union law for images in For and : , and ; both inclusions are equalities for all and if and only if is injective. The middle functor is both a left and a right adjoint, so it preserves both joins and meets, agreeing with the union and intersection laws in For and : , , , and . The direct set proofs remain stronger as concrete formulas, including the difference law, which is not a bare consequence of adjointness.
The free-group functor is left adjoint to the underlying-set functor
Statement
Choosing a free group on every set defines a functor , and
where is the underlying-set functor. The adjunction bijection sends a group homomorphism to the function .
Facts & Assumptions
Given: A chosen free group for every set .
A free group on has the property that every function extends uniquely to a homomorphism with (Free group on a set of generators).
Two free groups on the same set are uniquely isomorphic by an isomorphism preserving the generator maps (Free groups on the same set are uniquely isomorphic compatibly with their generators).
Groups and group homomorphisms form the locally small category (Groups and group homomorphisms form the large locally small category ).
Chosen objectwise universal arrows assemble uniquely into a left adjoint (Chosen objectwise universal arrows assemble uniquely into a left adjoint).
Proof
For a function , apply [F1] to and define as its unique extending homomorphism.
For each , restriction along and extension by [F1] are inverse maps between and .
Uniqueness in [F1] gives and , since both sides agree with the relevant generator map. Thus is a functor and is natural.
Equivalently, is a universal arrow from to , so [L1] gives and the asserted natural bijection.
For , [F1] says is initial in , so the same construction applies. By [F2], replacing any chosen free-group model changes only by the unique generator-preserving isomorphism.
The free-module functor is left adjoint to the underlying-set functor
Statement
Fix a unital ring . The assignment extends to a functor from sets to left -modules, and it is left adjoint to the underlying-set functor
The natural bijection sends an -linear map to the function .
Facts & Assumptions
Given: A unital ring , a set , and a left -module .
Every function extends uniquely to an -linear map with (Universal property of the free module on a set).
Left -modules and module homomorphisms form the locally small category (Left modules over a fixed ring and module homomorphisms form the large locally small category ).
Chosen objectwise universal arrows assemble uniquely into a left adjoint (Chosen objectwise universal arrows assemble uniquely into a left adjoint).
Proof
For a function , define as the unique linear map sending to .
Restricting a linear map to the standard basis and extending a function by [F1] are inverse operations, naturally in and .
Uniqueness in [F1] gives and , so this is a functor and the basis inclusions are natural.
Thus the standard-basis map is a universal arrow from to , and [L1] gives the asserted adjunction.
When , is the zero module and [F1] gives the unique map from it to every -module, so no separate nonempty-basis hypothesis is required.
Finite words satisfy the free-monoid universal property
Statement
For a set , let
be the set of finite words in letters from , where is the set of functions . With concatenation and the empty word, is a monoid. The one-letter map has the universal property that every function into a monoid extends uniquely to a monoid homomorphism .
Facts & Assumptions
Given: A set , a monoid , and a function .
A monoid is a set with an associative binary operation and a two-sided identity (Semigroup and monoid).
A finite product in a monoid is uniquely defined by the recursion and (The product of a finite list in a monoid, by recursion, with the empty product () equal to the identity).
The natural numbers form the smallest inductive set (The natural numbers (von Neumann)).
Natural addition satisfies and (Addition of natural numbers).
Natural addition is associative: (Addition is associative).
For sets , the functions form a set (The set of all functions ).
The indexed union of a family is (, and for ).
If a property holds at and passes from to , it holds for every natural number (The principle of mathematical induction).
Proof
Each is a set by [F6], and [F3] and [F7] make their indexed union a set. The unique function is the empty word.
For and , define by using on the first positions and on the following positions.
For a word , define as the finite product , with value when .
Function extensionality and [F5] show ; the equations in [F4] show that the empty word is a two-sided identity. Thus is a monoid by [F1].
Induction on the length of the second word, using [F2] and associativity in , proves . Hence is a monoid homomorphism and extends on one-letter words.
If is any homomorphism extending , induction on word length gives ; the base case uses the empty word and the identity of .
Thus the extension exists and is unique for every , including , where contains only the empty word.
The free-monoid functor is left adjoint to the underlying-set functor
Statement
The assignment of the finite-word monoid extends to a functor and is left adjoint to the underlying-set functor .
Facts & Assumptions
Given: A set and its finite-word monoid .
The one-letter map is universal: every function extends uniquely to a monoid homomorphism (Finite words satisfy the free-monoid universal property).
Chosen objectwise universal arrows assemble uniquely into a left adjoint (Chosen objectwise universal arrows assemble uniquely into a left adjoint).
Proof
For a function , let be the unique monoid homomorphism extending the one-letter function .
Restriction to letters and the extension in [L1] are inverse, naturally identifying monoid homomorphisms with functions .
Uniqueness in [L1] gives and , since each pair agrees on all one-letter words. Thus is a functor and is natural.
Therefore is a universal arrow from to , and [L2] gives , including the empty-set case.
Abelianisation is left adjoint to the inclusion of abelian groups
Statement
Abelianisation defines a functor , and it is left adjoint to the inclusion . Explicitly, every homomorphism with abelian factors uniquely through the quotient .
Facts & Assumptions
Given: A group , an abelian group , and a homomorphism .
The abelianisation of is (The abelianisation and its canonical map).
For , their commutator is , and is generated by all commutators (Commutators and the commutator subgroup ).
A homomorphism that kills a normal subgroup factors uniquely through the quotient group (A homomorphism that kills a normal subgroup factors uniquely through the quotient group).
Chosen objectwise universal arrows assemble uniquely into a left adjoint (Chosen objectwise universal arrows assemble uniquely into a left adjoint).
Proof
Since is abelian, for all , so .
The group is abelian: has kernel by [F1], so for the commutator is trivial by [F2], and is surjective.
By [F3], there is a unique homomorphism with .
For a homomorphism , the target is abelian by step 1.2, so step 2.1 applies to ; define as its unique factor through .
Uniqueness in [F3] gives and , so abelianisation is a functor and is natural.
Step 2.1 is the universal-arrow property of from to the inclusion ; [L1] therefore gives .
Discrete topology, underlying set, and indiscrete topology form an adjoint triple
Statement
Let equip a set with the discrete and indiscrete topology, respectively, and let forget the topology. Then
Facts & Assumptions
Given: A set and a topological space .
The discrete topology on a set is its power set, and the indiscrete topology is (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).
A map is continuous when it is continuous at every point, and is continuous at exactly when for every open with there is an open with and (Continuity of a map of topological spaces at a point and globally).
Sets and functions form the locally small category (Sets and functions form the large locally small category ).
Topological spaces and continuous maps form the locally small category (Topological spaces and continuous maps form the large locally small category ).
An adjoint triple consists of adjunctions on both sides of its middle functor (Adjoint triple ).
Proof
Every function is continuous as a map : given and an open in , the singleton is open in the discrete topology by [F1] and satisfies , so [F2] gives continuity at and hence continuity. Thus the identity-on-functions correspondence gives .
Every function is continuous as a map : by [F1] the only open sets of are and , so an open containing must be , and is open with ; [F2] again gives continuity. Thus .
Both correspondences are natural because precomposition and postcomposition leave the underlying function unchanged. Therefore and .
By [L1] these adjunctions form the displayed triple. The same proof includes the empty set and singleton, whose discrete and indiscrete topologies may coincide.
Under the ultrafilter lemma and dependent choice, Stone-Cech compactification is left adjoint to the compact-Hausdorff inclusion
Statement
Assume the ultrafilter lemma and dependent choice. On the category of Tychonoff spaces, chosen Stone–Čech compactifications define a functor left adjoint to the full inclusion
For each Tychonoff space , the unit is its compactification map .
Facts & Assumptions
Given: The ultrafilter lemma and dependent choice, and a chosen Stone–Čech compactification for every Tychonoff space .
A Stone–Čech compactification of has the property that every continuous map to a compact Hausdorff space extends uniquely to a continuous map (The Stone–Čech compactification by its compact-Hausdorff extension property).
Under the ultrafilter lemma and dependent choice, the evaluation-closure construction is a Stone–Čech compactification of every Tychonoff space (Under the ultrafilter lemma and dependent choice, the closure of the full evaluation image is the Stone–Čech compactification).
Under dependent choice, every compact Hausdorff space embeds in a cube for some set (Under dependent choice, every compact Hausdorff space embeds in a unit cube).
Every compact Hausdorff space is Tychonoff (Under dependent choice a compact Hausdorff space is Tychonoff, and its disjoint closed sets are separated by continuous functions).
A full subcategory contains all ambient morphisms between its objects (Subcategory and full subcategory).
Chosen objectwise universal arrows assemble uniquely into a left adjoint (Chosen objectwise universal arrows assemble uniquely into a left adjoint).
Proof
By [F5] every compact Hausdorff space is Tychonoff, so [F4] makes a well-defined full inclusion; [F3] is what supplies the embedding used inside [F2]. The hypotheses in [F2] supply , and [F1] says precisely that it is a universal arrow from to .
For a continuous map , apply [F1] to and define as its unique extension.
Extension uniqueness gives and , and the defining equations make natural.
Thus the chosen universal arrows assemble by [L1] into . The assumptions are exactly those used in [F2] and [F3]; the assembly step adds no choice principle.
The underlying-set functor on fields has no left adjoint
Statement
The underlying-set functor has no left adjoint, where field homomorphisms preserve .
Facts & Assumptions
Given: The category of fields and unital field homomorphisms.
A field has , is an abelian group under addition, has associative commutative multiplication with unit and inverses for nonzero elements, and satisfies distributivity (Field).
A field homomorphism satisfies , , and , and is automatically injective because its kernel is an ideal of a field and does not contain (Field homomorphism and embedding).
The characteristic of a unital ring is the least positive natural with , if such an exists, and is otherwise (The characteristic of a ring: the least with when one exists, and otherwise).
For every prime , is a field (For every prime , the two operations on make it a field).
If , then naturally (Under local smallness, transposition gives the natural hom-set bijection, and conversely).
Proof
Suppose, for contradiction, that a left adjoint to exists.
Taking in [L1], the right hom-set is a singleton for every field , so there is exactly one field homomorphism ; hence is an initial field.
Let be a field homomorphism. By [F2] it sends to for every natural and is injective. If then ; dividing by with remainder and using the minimality in [F3] shows divides , and is impossible because in [F1], so . If then for every , so injectivity gives and . Thus a field homomorphism preserves characteristic exactly.
In the element is the class of , which vanishes exactly when , so [F3] and [F4] give and . The initial field would have homomorphisms to both, and step 1.3 would force its characteristic to equal and to equal .
The contradiction shows that has no left adjoint.
Coextension of scalars carries its canonical left -module structure
Statement
Let be a unital ring homomorphism and let be a left -module. Regard as a left -module by . Then is a left -module under
For an -linear map , postcomposition is -linear, so this construction is functorial in .
Facts & Assumptions
Given: A unital ring homomorphism , a left -module , elements , , and .
A ring homomorphism preserves addition, multiplication, zero, and one (Ring homomorphism: additive, multiplicative, and required to send to ).
A left module action satisfies distributivity, , and (Unital left and right modules over a ring; unqualified module means left module).
An -linear map satisfies and (Module homomorphism and isomorphism, kernel, image and cokernel).
The functions from one set to another form a set (The set of all functions ).
Proof
The set is a subset of the function set , which exists by [F4].
For and , , and additivity is similar, so is -linear.
Pointwise, and , so associativity and the unit law hold.
Pointwise additivity of gives , and linearity in gives .
Steps 1.1 through 1.4 verify all left -module axioms in [F2].
If is -linear, then is -linear and , so postcomposition is -linear. Identities and composites are preserved by associativity of function composition.
Coextension of scalars is right adjoint to restriction of scalars
Statement
For a unital ring homomorphism , restriction of scalars
is left adjoint to coextension of scalars
Naturally in an -module and an -module ,
Facts & Assumptions
Given: The ring homomorphism , a left -module , and a left -module .
On the canonical left -action is (Coextension of scalars carries its canonical left -module structure).
Left modules and module homomorphisms form locally small categories (Left modules over a fixed ring and module homomorphisms form the large locally small category ).
A natural family of hom-set bijections determines an adjunction (Under local smallness, transposition gives the natural hom-set bijection, and conversely).
Proof
Given an -linear map , define by . It is -linear because and [L1] gives .
Given an -linear map , define . For , , so is -linear.
For , by [L1], so is -linear.
Evaluation gives . Conversely, -linearity of gives .
Thus and are inverse bijections. Precomposition in and postcomposition in commute with the two displayed formulas, so the bijections are natural.
By [L2], these natural bijections define . No tensor-product or extension-of-scalars construction is used.
Currying gives the adjunction in
Statement
For every set , the product functor is left adjoint to the function-set functor . Naturally in and ,
The bijection sends to and sends to .
Facts & Assumptions
Given: Sets .
The functions form the set (The set of all functions ).
The function collection between two sets is a set (For sets and the collection of all functions is a set, being a subset of ).
The cartesian product consists of ordered pairs with , (The Cartesian product ).
Sets and functions form the locally small category (Sets and functions form the large locally small category ).
Natural hom-set bijections determine an adjunction (Under local smallness, transposition gives the natural hom-set bijection, and conversely).
Proof
For , define by ; [F1] and [F3] make this a well-defined function.
For , define by .
For all , , so function extensionality gives ; similarly gives .
Precomposition in and postcomposition in commute with evaluation at , so the bijection is natural in both variables.
Since is locally small by [F4], [L1] applies and gives . The formulas also cover without exception.
A unit and counit determine an adjunction without the triangle identities
Statement
If functors and admit natural transformations and , then even when the triangle identities have not been checked.
Facts & Assumptions
Given: The two-element group with .
Every monoid is a one-object category, and it is a group exactly when every morphism in that category is invertible (A monoid is a one-object category, and a group is a one-object category in which every morphism is invertible).
An adjunction requires natural transformations and satisfying and (Adjunction by unit, counit, and the triangle identities).
Refutation
Regard as the one-object category supplied by [F1], and take .
Let the sole component of be and the sole component of be . Both are natural because is abelian, so each component commutes with every morphism.
Each triangle composite is , which is not the identity morphism . Thus the data fail both identities in [F2] and do not form an adjunction.
Left adjoints preserve limits
Statement
Every left adjoint preserves all limits that exist.
Facts & Assumptions
Given: The free-group functor .
The functor is left adjoint to the underlying-set functor (The free-group functor is left adjoint to the underlying-set functor).
The reduced words on form the free group on , with each represented by a one-letter word (Reduced words form the free group on an alphabet).
A terminal object admits exactly one morphism from every object, hence exactly one endomorphism (Initial object, terminal object, and zero object).
Refutation
A singleton is terminal in . By [F2], contains the distinct empty word and one-letter word , so its identity homomorphism differs from its trivial endomorphism.
Therefore is not terminal by [F3], although is a left adjoint by [F1]. The terminal-object limit is not preserved, so the statement is false.
Every functor with a left adjoint also has a right adjoint
Statement
If a functor has a left adjoint, then it also has a right adjoint.
Facts & Assumptions
Given: The underlying-set functor .
The free-group functor is a left adjoint of (The free-group functor is left adjoint to the underlying-set functor).
Every left adjoint preserves colimits, including initial objects (Left adjoints preserve every colimit that exists).
An initial object has exactly one morphism to every object (Initial object, terminal object, and zero object).
Refutation
By [F1], has a left adjoint. Suppose, as the claim predicts, that also has a right adjoint. Then itself is a left adjoint and preserves initial objects by [F2].
The trivial group is initial in , since there is exactly one homomorphism from it to every group. Its underlying set is a singleton.
The empty set, not a singleton, is initial in , so step 1.2 contradicts the preservation conclusion of step 1.1. Hence has no right adjoint and the statement is false.
The hom-set form of an adjunction needs no size hypothesis
Statement
The hom-set formulation of an adjunction is meaningful without any local-smallness hypothesis.
Facts & Assumptions
Given: The class of all ordinals.
A category is locally small exactly when every hom-class is a set; a large category may still be locally small (Small, locally small, and large categories).
Ordinal addition is specified by , , and for nonzero limit (Ordinal addition ).
Ordinal addition is associative: for all ordinals (Ordinal addition is associative).
The ordinals form a proper class: no set contains every ordinal (Burali-Forti: there is no set of all ordinals).
An adjunction is specified by functors, a unit, a counit, and the two triangle identities, without a hom-set hypothesis (Adjunction by unit, counit, and the triangle identities).
Refutation
Form a one-object category whose endomorphism class is , whose identity is , and whose composition is ordinal addition. The zero clause in [F2] gives directly. The other identity law needs all three clauses and transfinite induction on : the zero clause gives ; the successor clause gives from the inductive hypothesis; and for a nonzero limit the limit clause gives . Associativity is [F3].
Its only hom-class is the proper class by [F4], so is not locally small by [F1]. Consequently is not a hom-set and cannot be an object of .
Thus a Set-valued hom-set bijection is not even meaningful in this example, whereas [L1] explains why unit-counit data remain the size-free formulation. The statement is false.
5 · Examples, counterexamples and false statements
None yet.
Sources
Standard references
Recommended treatments; not extraction sources.
- Emily Riehl, Category Theory in Context, 2nd ed., Definition 4.2.5
- Tom Leinster, Basic Category Theory, Theorem 2.2.5
- Emily Riehl, Category Theory in Context, 2nd ed., Sections 4.1–4.2
- Tom Leinster, Basic Category Theory, Section 2.2
- Emily Riehl, Category Theory in Context, 2nd ed., Proposition 4.3.5
- Tom Leinster, Basic Category Theory, Section 1.3 and Theorem 2.2.5
- Emily Riehl, Category Theory in Context, 2nd ed., Section 4.2
- Tom Leinster, Basic Category Theory, Lemma 2.2.4
- Tom Leinster, Basic Category Theory, Lemmas 2.2.2 and 2.2.4
- Emily Riehl, Category Theory in Context, 2nd ed., Theorem 4.2.7
- Emily Riehl, Category Theory in Context, 2nd ed., Lemma 4.1.3
- Tom Leinster, Basic Category Theory, Theorem 2.3.6
- Emily Riehl, Category Theory in Context, 2nd ed., Lemma 4.7.1
- Tom Leinster, Basic Category Theory, Corollary 2.3.7
- Emily Riehl, Category Theory in Context, 2nd ed., Proposition 4.4.4
- Tom Leinster, Basic Category Theory, Section 4.2
- Emily Riehl, Category Theory in Context, 2nd ed., Lemma 4.7.1 and surrounding discussion
- Emily Riehl, Category Theory in Context, 2nd ed., Proposition 4.3.1
- Tom Leinster, Basic Category Theory, Section 2.3
- Emily Riehl, Category Theory in Context, 2nd ed., Proposition 4.3.4
- Saunders Mac Lane, Categories for the Working Mathematician, 2nd ed., Chapter IV.8
- Emily Riehl, Category Theory in Context, 2nd ed., Proposition 4.3.6
- Saunders Mac Lane, Categories for the Working Mathematician, 2nd ed., Chapter IV
- Emily Riehl, Category Theory in Context, 2nd ed., Proposition 4.3.7
- Saunders Mac Lane, Categories for the Working Mathematician, 2nd ed., Chapter IV.7
- Emily Riehl, Category Theory in Context, 2nd ed., Exercise 4.3.iv
- Emily Riehl, Category Theory in Context, 2nd ed., Lemma 4.2.11
- Emily Riehl, Category Theory in Context, 2nd ed., Lemma 4.6.11
- Saunders Mac Lane, Categories for the Working Mathematician, 2nd ed., Chapter IV.3
- Emily Riehl, Category Theory in Context, 2nd ed., Section 4.1
- Emily Riehl, Category Theory in Context, 2nd ed., Exercise 4.1.iv
- Emily Riehl, Category Theory in Context, 2nd ed., Definition 4.4.1
- Tom Leinster, Basic Category Theory, Example 2.2.7
- Emily Riehl, Category Theory in Context, 2nd ed., Corollary 4.2.10
- Emily Riehl, Category Theory in Context, 2nd ed., Theorem 4.6.2
- Tom Leinster, Basic Category Theory, Section 6.3
- Emily Riehl, Category Theory in Context, 2nd ed., Section 4.6
- Emily Riehl, Category Theory in Context, 2nd ed., Definition 4.6.7
- Emily Riehl, Category Theory in Context, 2nd ed., Definition 4.6.7 and Theorem 4.6.2
- Emily Riehl, Category Theory in Context, 2nd ed., Exercise 4.6.vi
- Emily Riehl, Category Theory in Context, 2nd ed., Proposition 4.6.1
- Tom Leinster, Basic Category Theory, Section 5.1
- Emily Riehl, Category Theory in Context, 2nd ed., Example 4.1.8
- Emily Riehl, Category Theory in Context, 2nd ed., Example 4.1.10
- Tom Leinster, Basic Category Theory, Example 2.1.3
- Emily Riehl, Category Theory in Context, 2nd ed., Example 4.1.6
- Tom Leinster, Basic Category Theory, Example 2.1.5
- Emily Riehl, Category Theory in Context, 2nd ed., Example 4.6.13
- Tom Leinster, Basic Category Theory, Example 6.3.14
- Emily Riehl, Category Theory in Context, 2nd ed., Example 4.1.12
- Tom Leinster, Basic Category Theory, Example 6.3.5
- Emily Riehl, Category Theory in Context, 2nd ed., Example 4.4.9
- Tom Leinster, Basic Category Theory, Example 2.1.6
- Emily Riehl, Category Theory in Context, 2nd ed., Definition 4.2.1
- Tom Leinster, Basic Category Theory, Definition 2.1.1