Suppose naturally and has small coproducts in a category. Define
For a function , define by sending the -summand by the identity of to the -summand. The coproduct property gives the identity and composition laws, so is a functor. There are natural bijections
The first chooses a morphism on every summand; the second views that family as a function. Hence this is the left adjoint to a covariant representable functor:
For empty , the formula uses the empty coproduct, an initial object, and the same bijection remains valid.
The general adjoint functor theorem says that, for a functor with a complete category and both categories locally small, has a left adjoint exactly when it preserves small categorical limits and satisfies the solution-set condition. The latter means that for each there is a set of arrows such that every factors as
Equivalently, has a weakly initial set.
The limit form of the special adjoint functor theorem says that, if in addition is well-powered and has a small cogenerating family, then has a left adjoint exactly when it preserves small limits. These are the limit/left-adjoint forms; their duals interchange limits with colimits, left with right adjoints, and cogenerators with generators.
For the first route, let be a complete category that is locally small and has a weakly initial set . Put . It is weakly initial: for any , choose an arrow and precompose with the corresponding product projection. The set indexes a simultaneous equalizer
It exists by completeness, for example as the equalizer of the two maps with components and . Since exists for each , is also weakly initial.
Choose . Applying the defining equation to gives , whence because is a monomorphism. If is any endomorphism, apply it to to obtain , hence and . Thus has only its identity endomorphism.
For two arrows , take their equalizer . Weak initiality of gives . Since is an endomorphism of , . The monic arrow with this right inverse is invertible; therefore . Existence of an arrow and this uniqueness show that is initial.
For the general adjoint functor theorem, limit preservation makes each comma category complete, and the solution-set condition makes it weakly initially generated by a set. The lemma provides an initial object . For , the universal property uniquely defines by
Uniqueness gives the functor laws. The same property gives natural bijections
so . Conversely a right adjoint preserves limits, by applying its hom-set bijections to cones, and its unit is already an initial object of each comma category, hence a singleton solution set. This proves necessity as well as sufficiency.
For the second route, assume the general adjoint functor theorem and the additional hypotheses of the Special adjoint functor theorem. Let be a small cogenerating family. Fix and an arrow . A limit-preserving functor preserves monomorphisms, by the self-pullback criterion. Intersect the set of all subobjects supporting . Preservation of this categorical limit gives a minimal supporting pair and a monomorphism with .
If have , their equalizer supports and must be invertible by minimality. Thus
The evaluation map into the product of all these cogenerator targets is monic, because the family coseparates arrows. Its coordinates inject into the fixed set
For every subset , form the product whose coordinate has target . Each minimal is isomorphic to a subobject of one such product, using precisely its realized coordinates. There is a set of subsets ; the well-powered category condition gives a set of representative subobjects of each product. For each representative , include every arrow , a set by local smallness of .
This is a solution-set condition: the minimal pair is isomorphic to one of these representatives, and its inclusion into supplies the required factorization of . The general adjoint functor theorem now gives the left adjoint. This is the cogenerator bound for comma-category solution sets proof of the special theorem. Necessity follows again because a right adjoint preserves limits. Both alternative proof routes are therefore supplied.
A monad on consists of an endofunctor and natural transformations , satisfying the unit and multiplication of a monad laws
An algebra for a monad is an object equipped with such that
A morphism of algebras for a monad is a morphism satisfying . Identities and composition obey this equation, giving the Eilenberg-Moore category and its forgetful functor .
For an adjunction with induced monad , the Eilenberg-Moore comparison functor is
The functor is monadic when it has such a left adjoint and this comparison is an equivalence of categories; a stricter convention requires an isomorphism of categories over . We will identify which limit-lifting conclusion each convention supports in part (iii).
For a projective scheme over , define its Hilbert functor on -schemes by assigning to the set of closed subschemes such that is a flat morphism of finite presentation and is proper. For projective , the properness is automatic for these closed families. A morphism sends a family to ; base change preserves the required properties, making this a contravariant functor. The embedding in is part of the data, so these are embedded families rather than families modulo automorphisms of .
Choose a very ample line bundle on . In a flat projective family of finite presentation the fibre Hilbert polynomial is locally constant. Requiring polynomial gives a subfunctor represented by ; the unrestricted Hilbert functor is represented by the disjoint union over . For the specified , use its polynomial and let be the resulting -point of the Hilbert scheme .
A Zariski tangent space vector at is a -morphism
whose restriction to is . Here is the ring of dual numbers. Locally such a morphism sends to , where , so these morphisms form the vector space . By the representing property of the Hilbert scheme, the same tangent vector is exactly a first-order embedded deformation
with the last equality an equality of embedded closed subschemes.
Let be the ideal sheaf of , and define its normal sheaf by
This definition is valid even when or is singular; it need not give a locally free sheaf. We now derive the tangent-space identification by constructing inverse maps, rather than merely invoking the normal sheaf's name.
Work on an affine open subscheme , put , and let define a flat deformation with special fibre . The flatness criterion over dual numbers says that a -module is flat exactly when
Flatness implies this by tensoring . Conversely lift a -basis of to . It generates over : after removing the linear combination representing an element modulo , the remainder is times another element, whose residue is another finite basis combination. For independence, reduce a relation modulo to remove its constant coefficients. The remaining relation says that a linear combination of the lifts belongs to the kernel of , hence to , so its remaining coefficients vanish modulo too. The lifts are a free -basis, establishing flatness.
Applying this criterion to gives
Indeed follows by lifting each to and multiplying by . Conversely, if , then the class of is in the kernel of on , hence in ; reducing modulo gives .
For , choose a lift and define
Two lifts differ by an element of , so this is well defined. Addition and multiplication of lifts by elements of prove that is -linear. For , one has in , so it factors through an element of .
Conversely, for such a homomorphism define
This is an ideal: multiplying by gives , and . Its reduction is . To prove that its quotient is flat, suppose . The condition says . Choose lifting ; then , so
Thus the kernel of is its image, and the criterion proves flatness. These constructions are inverse: the graph condition reconstructs every lift in , and changes by account for all choices.
Localization respects both constructions. The local maps therefore glue exactly to global sections of the internal Hom sheaf ; conversely such a section gives compatible local ideals that glue to . Hence
The middle identification uses that every map to kills . The zero map gives the product deformation ; addition and scalar multiplication of the maps give the canonical vector-space operations on the tangent space. This proves the Zariski tangent space of a Hilbert scheme formula without a smoothness or regular-embedding hypothesis.
Work in the based CW homotopy category. A homotopy-invariant functor depends on a map only through its based homotopy class. In a sequence of pointed sets, exactness at the middle means that the preceding image equals the inverse image of the distinguished point; it does not imply injectivity or surjectivity at the ends. For groups this is the familiar image-equals-kernel condition. A half-exact functor preserves such middle exactness on the appropriate elementary sequence.
For a contravariant functor , the relevant elementary sequence is a cofibration . Half-exactness is
exact at . One should not silently turn this into a short exact sequence. In particular, arbitrary group actions and pointed sets at low degrees are not interchangeable with abelian groups.
The basic contravariant example is , often called a cohomotopy-type functor. Suppose a map becomes null-homotopic on . A chosen null-homotopy extends it over the cone attached to , giving a map from the topological mapping cone to . Conversely every such extension restricts to a null-homotopic map on . Since the topological mapping cone of a subcomplex inclusion models , this proves half-exactness, rather than merely asserting it.
Repeating the topological mapping cone construction gives the Puppe sequence
Contravariant mapping into gives
This is exact as pointed sets. An H-group structure on , for example a loop space with path concatenation, provides group structures; repeated looping gives abelian group structures in the usual ranges. The suspension-loop adjunction explains the shifted terms and their compatibility.
The covariant counterpart is , with ordinary homotopy groups obtained from . Its natural elementary sequence is a homotopy fiber sequence , not an arbitrary cofibration. A map whose composite to is null-homotopic, together with that null-homotopy, determines a map into the homotopy fibre. Conversely a fibre map projects to such a null composite. This proves exactness of at the middle. Adding the loop terms produces the homotopy long exact sequence. For a Serre fibration, its ordinary fibre supplies the same homotopy information.
This variance distinction matters. Include one circle, generated by , in , with other generator . The quotient is the second circle. The kernel of is the normal closure of , which contains . The image of the included circle is only the cyclic subgroup generated by , and does not contain that reduced word. Thus covariant is not half-exact on this cofibration. Fibre and cofibre statements cannot be swapped just by reversing notation.
Reduced cohomology gives group-valued contravariant examples. For an abelian coefficient group , the degree- functor is represented by an Eilenberg–MacLane space:
Its cofibration exact sequence continues as . Ordinary homotopy groups are instead covariant, with decreasing group degree across a fibre connecting map. These are the two complementary representable patterns, maps out of a test object and maps into a representing object.
Brown's representability theorem makes the contravariant pattern structural. A reduced contravariant homotopy functor on based CW complexes is represented by a CW complex if it converts arbitrary wedges to products and satisfies the Mayer-Vietoris weak-pullback gluing axiom. The latter says that compatible classes on two subcomplexes extend to their union. It contains more information than the single kernel statement of half-exactness. Consequently half-exactness alone is not a representability criterion. In a representing functor these axioms are natural: a map on a wedge is a family of based maps, while compatible maps on an intersection can be adjusted by a homotopy and glued across a homotopy pushout.
A reduced generalized cohomology theory with the usual wedge axiom supplies these axioms degree by degree. Its representing spaces have by suspension compatibility, assembling an Omega-spectrum. Thus generalized cohomology can be expressed as , while represented homology is . The appearance of mapping into a spectrum in one case and smashing with it in the other is another form of the same variance distinction.
There is a literal duality after stabilization and a finiteness restriction. Here a finite based CW complex is identified with its suspension spectrum. For a finite spectrum , let be its Spanier-Whitehead dual. Then and for finite spectra. Duality reverses a cofibre triangle into a fibre triangle. In particular,
This turns a cohomology calculation on a finite object into a homology calculation on its dual, and vice versa. It is Spanier-Whitehead duality, not a claim that the full category of ordinary spaces is self-dual.
Half-exactness is the local image–kernel property; fibres and cofibres, representability, and finite stable duality explain how that property organizes homotopy and cohomology. The distinctions between variance, pointed sets and groups, and finite stable objects and arbitrary spaces are essential to using the duality correctly.
For , a functor-split coequalizer pair is a parallel pair such that its image admits a split coequalizer in . In one orientation this means morphisms , and satisfy
These equations prove that is a coequalizer: if , then , so factors ; uniqueness follows from . They remain true under every functor, making a split coequalizer an absolute colimit.
To say that reflects such coequalizers means that any fork in whose image is a split coequalizer is itself a coequalizer in . This is a reflection assertion about an existing fork; it does not by itself require lifting every split fork from , or creating its splitting maps in .
Define the Yoneda embedding by and . For , define . Associativity proves naturality in , and preservation of identity morphisms and composition in a category proves that is a functor.
Apply the Yoneda lemma to . It gives
The natural transformation corresponding to has component , exactly . Therefore the induced map on every hom-set is a bijection: the Yoneda embedding is full and faithful.
For a categorical presheaf and , the Yoneda lemma gives a natural bijection
To construct its inverse, take and set for . For , the functor law gives , so is a natural transformation. Conversely, naturality of any at gives . Thus the two constructions are inverse, proving the bijection.
The bijection is natural in : a natural transformation sends the distinguished element to on either side. It is natural in : for , precomposing a transformation with postcomposition by sends its distinguished element to . These equations prove the claimed naturality, rather than just an objectwise correspondence. Reversing morphisms gives the covariant form for .
For a functor with finite indexing category, form the finite products in a category
Define by requiring the coordinate indexed by to be for and for . Let be their equalizer, and put . The equality says exactly that for every morphism , so these morphisms form a categorical cone.
For any other categorical cone , the product in a category gives a unique with . The categorical cone equations give , so the equalizer gives a unique with . This is exactly the universal property of a categorical limit. Empty indexing products are terminal objects, so the construction includes the empty diagram in a category. Thus finite products and equalizers give all finite limits.
Choose for each a categorical limit of , with projections . For , the morphisms form a categorical cone over , since the two actions of the product functor commute. Define by the equations
Existence and uniqueness follow from the universal property. The identity morphism of satisfies the equations for , and satisfies those for , so uniqueness gives and . Hence is a functor.
If with projections are other choices, there is a unique isomorphism carrying every projection to the corresponding projection. The same equations show , because their composites with all agree. Thus the choices give a unique natural isomorphism compatible with the chosen categorical limit categorical cones. Without the compatibility condition, uniqueness of an arbitrary natural isomorphism is not asserted.
For , define the functor by
where is the constant diagram functor; a morphism into acts by precomposition on every categorical cone leg. A categorical limit is a representation of a functor of the form
The image of is the universal categorical cone . By naturality of the representing isomorphism, the image of is . Thus this definition is exactly existence and uniqueness of factorization of every categorical cone through . Conversely that universal property gives the representing natural bijection.
For a presheaf of sets on a topological space , define and . Then the adjoints to constant presheaves on open sets are
To prove the first adjunction, a natural transformation must satisfy by naturality at the inclusion . Hence it is uniquely determined by a function . Every such function defines a natural transformation by this formula, because restriction maps compose. This gives .
For the second adjunction, a natural transformation satisfies , so it is uniquely determined by a function . Every such function defines the remaining components by restriction, giving . Evaluation acts on presheaf morphisms componentwise, so these object assignments are indeed functors. The use of is essential: a constant presheaf of sets has value there, whereas a sheaf has a singleton value there. No sheaf condition is imposed in this question.