Let be a tiny object of , and let be the initial object of . The representable functor is the terminal functor, since each of its values is a singleton. The exponential adjunction and the Yoneda lemma give
Since is tiny, is itself a left adjoint, so preserves all colimits. Evaluation at also preserves colimits, because they are pointwise in a set-valued functor category. Therefore preserves the coproduct construction.
It also preserves epimorphisms. Indeed, every such epimorphism is a pointwise epimorphism in a functor category, hence the coequalizer of its kernel pair, as can be checked pointwise in sets. A left adjoint preserves that coequalizer and therefore sends it to a regular epimorphism, which is an epimorphism; evaluation at zero preserves surjectivity. Thus is an irreducible projective in a set-valued functor category.
A Cauchy-complete category is one in which every idempotent morphism splits. By the characterization allowed in the question, irreducible projectives are representable functors for such an indexing category. Applying it to proves the tiny covariant functor on a Cauchy-complete category with an initial object is representable conclusion:
Fix , and let be the functor obtained from the chosen binary coproduct in a category construction. Its arrow map is . For , the binary coproduct property gives . The Yoneda lemma and part (i) therefore give, naturally in ,
Thus exponentiation by is precomposition .
This precomposition has a right adjoint given by Right Kan extension. Explicitly, for put
The comma category is small, so this categorical limit exists in the Category of sets. A map gives by taking a compatible family indexed by and selecting its entries at for the indices .
A natural transformation determines by sending to the family indexed by . Conversely, a map determines by projecting to the index . Naturality and the limit's compatibility relations make these constructions inverse. Hence , proving the tiny covariant representable functor on a category with binary coproducts result:
For a tiny object , the exponential functor has a right adjoint, say . The defining exponential adjunction gives the natural isomorphism
since . If are tiny objects, the composite on the right is a left adjoint with right adjoint . Thus is tiny. The terminal object is tiny because exponentiation by it is naturally the identity, which is its own right adjoint. Induction, including this empty-product case, proves tiny objects are closed under finite products:
A Cartesian closed category has finite products in a category and, for every , an exponential object characterized naturally by
In , finite products and the terminal functor are computed pointwise. With , define
This is a set because is a small category. For , precomposition induces by precomposition of natural transformations, making a covariant functor.
Given , define its curry by
For , naturality of gives , proving that this is a natural transformation . The same formula with precomposed proves naturality of in .
Conversely, from define
Naturality of and its values proves naturality of . Currying this result recovers , since ; uncurrying a curry recovers by setting . These mutually inverse constructions are natural in , giving the adjunction required for an exponential object. Therefore
Use , as required by the formula at zero, and composition of functions as multiplication in . The displayed preserves identities, and for ,
both sides send zero to zero. Thus is a functor on the one-object category.
For the shift monad on order-preserving maps of natural numbers, set
These are order-preserving functions. The equations and hold pointwise, giving the required natural transformations. For the second equation, both sides are zero at , and are for . The two unit laws are . Associativity is checked by
Consequently these maps define a monad. It is not an idempotent monad, since , so cannot be invertible.
An algebra for a monad is a map with and . The first equation forces ; monotonicity then forces . Thus , which satisfies the second equation by the monad associativity law. The Eilenberg-Moore category therefore has exactly one object. Its endomorphisms satisfy , and this equation holds precisely when : evaluate at zero for necessity, and at both sides equal .
The Kleisli comparison functor takes its only object to this only algebra and sends to
It is a bijection from the Kleisli arrows to the algebra endomorphisms, with inverse . It preserves identities and composition by the comparison construction; directly, and . Bijectivity on objects and arrows makes it an isomorphism of categories:
For inducing , the Kleisli comparison functor is always full and faithful, since the adjunction gives
Therefore it is part of an equivalence of categories if and only if every object of is isomorphic to for some .
For an idempotent monad, multiplication is invertible. The unit laws imply . If is an algebra for a monad, then , while naturality of gives
Thus is an isomorphism with inverse . The algebra law says that is a morphism of algebras for a monad from the free algebra to , so every object of the Eilenberg-Moore category is isomorphic to a free algebra. The criterion above yields
A monad is an endofunctor with natural transformations and satisfying
Its Kleisli category has the same objects as , with , identity , and composite
The unit laws follow from naturality of and the two monad unit laws. For , the two triple composites reduce, using naturality of , to
they agree by the monad associativity law. Thus this is a category.
Define the free functor into a Kleisli category and the right-hand functor by
The identity and composition formulas for are
For , , and
where the last step is naturality of . Hence both mappings are functors. The hom-set identity gives the adjunction . Its unit is , and its counit at is the Kleisli arrow represented by . Applying to that counit gives , so the induced monad is the specified one.
For any inducing this same monad, with counit , define the Kleisli comparison functor
The triangular identities give , and naturality of the counit together with gives . Explicitly, naturality moves past , then moves the resulting counit past , reducing the composite to . Thus is a functor, with and , and it sends the Kleisli counit to .
An adjunction morphism here is required to commute with the left and right adjoints and preserve their adjunction structure. Such a morphism must have the above object map; every Kleisli arrow factors as its counit after , so its arrow map is forced as well. This proves initiality of the Kleisli adjunction:
Use the category of commutative monoids, which is a semi-additive category: hom-sets have pointwise addition, composition is additive in each variable, and finite cartesian products are also coproducts. Explicitly, maps extend from the coordinate injections by .
Take the submonoid
with coordinatewise addition, and the two projections , . The homomorphism satisfies , so this is a reflexive pair. For , evaluation at identifies with and with .
The element gives an arrow from to in the prescribed graph. An inverse would require an element of , which does not exist. Therefore no groupoid structure with these source and target maps is possible, regardless of the proposed composition rule:
Let split the reflexive pair . Fix , and take objects and arrows with source and target . Since is an additive category, its hom-sets are abelian groups, and composition is additive.
The identity at is . For and , define
Its source is and its target is . The two identity laws follow from and . For , both parenthesizations of the triple composite are , so composition is associative.
Define the inverse by
Its source is and its target is . Moreover and . Thus these data form a groupoid, proving the represented form of reflexive pair in an additive category is an internal groupoid:
A reflexive pair has a common section with . Form the pushout in a category of and , and write its two maps from as . Its relation , composed with , gives . Thus . Any with gives the compatible pair for this pushout and therefore factors uniquely through . This proves the coequalizer of a reflexive pair from a pushout construction.
There is a genuine transcription difference: the original PDF says finite products in the finite-colimit assertion, while the TeX says finite coproducts. The PDF assertion is false with products. Even retaining a pushout-existence assumption, the full subcategory of the Category of sets on nonempty sets has finite products, pushouts, and all coequalizers, but no initial object, hence no empty colimit. Regard the poset with elements , order
and incomparable as a category. It has finite meets and top , hence finite products in a category. Every reflexive pair in a poset is an equal pair and has its identity as a coequalizer. But have no least upper bound, so they have no coproduct in a category.
For the corrected construction using finite coproducts, let be a finite diagram in a category. Put
Define on the summand indexed by as and . Maps with are exactly cocone under a diagram data on . Hence their universal coequalizer is its colimit. Replace by the reflexive pair
whose common section is the second injection and whose coequalizer is unchanged. This proves construction of finite colimits from coproducts and reflexive coequalizers, including the empty diagram via the empty coproduct:
Use the square's notation . For , choose in the nonempty connected category . Lift through the discrete fibration , obtaining the uniquely determined arrow
Define . If satisfies , then is a lift of with codomain . Uniqueness makes it exactly , including equality of its domain. Connectedness of the comma category therefore makes independent of the chosen object, with strict equality rather than merely an isomorphism.
For , choose and lift with codomain . Write this lift as . Its composite with is the lift of to , so its domain is . Set . The lift of an identity is an identity, and the composite of two lifts is the lift of the composite with the specified codomain. Thus is a functor, and .
At , choose ; its lift is , giving . For , the unique lift of with codomain is , giving on arrows as well. Finally, any other filler must send to the same lift of with codomain , so ; it must also send to the unique lift of with codomain . This proves orthogonality of final functors and discrete fibrations:
Let be the given cocone under a diagram. For , choose an object of the comma category and define
Such a choice exists because is a final functor. If gives a morphism , so , the cocone relation gives
The connected category condition makes the result independent of the choice along any zigzag.
For , choose ; then is available for , giving . Thus the maps form a cocone under a diagram on . Choosing shows that restriction recovers . Any extension must satisfy , proving uniqueness. This is cocone extension along a final functor.
If has a colimit, extend its universal cocone in this way. Every cocone on restricts to one on , factors uniquely through that colimit, and then agrees with its extension by uniqueness. Hence the same vertex is a colimit of . In particular,
and existence of all -shaped colimits in implies existence of all -shaped colimits.
Assume (c), and take an epimorphism with a monofunctor. Since is a projective object in a category, there is a natural transformation with . A retract in a category of a monofunctor is a monofunctor: if , then naturality of gives , injectivity of gives , and applying gives . Thus (c) implies (b), completing
The stronger assertion that every set-valued functor is a monofunctor holds exactly when is a groupoid. Sufficiency follows because a functor preserves inverses, so sends every arrow to a bijection.
For necessity, fix , and form the pointwise pushout in a category
using twice the natural transformation given by precomposition with . At an object , consists of two copies of , with the two copies of identified for every . No different underlying elements are identified: each generating relation simply joins the two copies of one element. In , the two copies of coincide, since . Hence sends the two copies of in to the same element. If is a monofunctor, those copies of coincide. The description of the pushout implies for some . Thus every morphism is a split monomorphism.
Apply the same conclusion to : there is with . Then , and so as well. Every arrow is invertible, proving
Assume (b). A coproduct in a category of monofunctors in is again a monofunctor: at an object it is the disjoint union of the values, and every arrow acts within the same summand by an injective function. Distinct summands cannot become identified, and injectivity within a summand follows from its monofunctor property.
Apply this to the coproduct of representable functors constructed in part (a). Its canonical map to is a pointwise epimorphism in a functor category. Thus every is an epimorphic image of a monofunctor, proving
Write . The covariant Yoneda lemma gives the natural bijection
whose inverse sends to the natural transformation with component . This also identifies the two variables' naturality.
To prove that is a projective object in a category, let be an epimorphism in the functor category and . By pointwise epimorphism in a functor category, lift through the surjective function . The Yoneda lemma turns this lift into with .
For a small category, the set of pairs with indexes the canonical map
It is natural, and every is the image of . Thus it is an epimorphism, establishing the projective cover of a set-valued functor by representables construction. Here cover means a projective presentation; no minimality is asserted.
For the equivalence's first step, if is a monomorphism, then , the map , is injective for every . Hence every representable functor is a monofunctor. Conversely, injectivity of every is exactly left cancellation against every , so it implies that is a monomorphism. Therefore
Let be the sheaf of closed holomorphic one-forms, namely . The local exactness proved in part (b) gives the short exact sequence of sheaves
Its long exact sequence in sheaf cohomology begins
The first arrow is an isomorphism: on a compact complex manifold, a global holomorphic function is constant on each connected component, just as a global section of the constant sheaf is. Thus is injective. By part (c), every global holomorphic differential form of degree one is closed, so .
Concretely, for a holomorphic differential form of degree one choose local holomorphic primitives . The connecting class is represented by the locally constant Čech cocycle on overlaps. The following arrow is induced by the inclusion of the constant sheaf into the sheaf of holomorphic functions. Exactness is inherited from the long exact sequence, giving
For degree zero, compactness and the maximum modulus principle make holomorphic functions constant on each connected component. For degree two, a holomorphic differential form is -closed and its derivative has type , which vanishes on a complex surface. Degrees above two have no nonzero holomorphic forms. It remains to treat a holomorphic differential form of degree one.
Set . Its coefficients are holomorphic, so is a holomorphic differential form of degree two, hence closed by the degree-two observation. Its conjugate is closed too. The Stokes theorem gives
The integrand is nonnegative in the complex orientation. In local coordinates, if with , then
It is strictly positive wherever is nonzero. Its zero integral therefore forces everywhere. Thus holomorphic forms on a compact complex surface are closed, even when the surface is not Kähler:
The holomorphic de Rham complex is exact locally, which is the criterion for an exact sequence of sheaves. Work in a small star-shaped holomorphic coordinate neighbourhood in , centred at zero. A holomorphic function has exactly when it is constant on this neighbourhood, giving exactness at and the injection of the constant sheaf.
For exactness at , let be holomorphic and -closed. Then . Define the holomorphic function
Differentiation under the integral and the closedness identity give
Thus .
For exactness at , any holomorphic differential form of degree two is and is automatically -closed by dimension. Define
Its derivative is
These local primitives prove the holomorphic Poincaré lemma in the degrees needed here. Exactness on every stalk gives
This is sheaf exactness; the local primitives need not glue to global ones.
A holomorphic differential form of type satisfies . The adjoint lowers antiholomorphic degree, so as well. Therefore .
The Kähler Laplacian identity gives . Compactness lets us use the identity for the Hodge Laplacian:
Both terms are nonnegative, so
This proves that holomorphic forms on a compact Kähler manifold are closed. The original PDF uses and ; the extra symbols in the local TeX superscripts are transcription errors.
Use the usual connected-manifold convention for this assertion. Suppose, for contradiction, that . The Dolbeault theorem gives , and the Hodge decomposition theorem for compact Kähler manifolds and its conjugation symmetry give . Hence every real class in has a real harmonic differential form of type as its representative.
The intersection form is . Its value on the Kähler class is positive: . Every real harmonic form splits uniquely as , with primitive and constant. Indeed, is a harmonic function, hence constant by connectedness, and ; subtracting kills , and part (b) makes primitive.
Part (c) gives , while . Thus
This proves the Hodge index theorem for compact Kähler surfaces in this case: has signature .
On the alleged two-dimensional totally isotropic subspace , the linear functional has a nonzero vector in its kernel. Its harmonic differential form representative is primitive, so the preceding negative-definiteness statement gives , contradicting the vanishing of on . Therefore
Connectedness is essential if one's definition of a manifold allows disconnected spaces. For , with , one has . Take on each component the pullback of the degree-two class from its first factor. Each class has square zero, and their mutual pairing is zero because their supports lie on different components. Their span is then a two-dimensional totally isotropic subspace, disproving the unqualified disconnected version.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact