If is a representable functor, it preserves small categorical limits. Part (b) makes have an initial object, which gives a weakly initial set.
Conversely, assume limit preservation and a weakly initial set in . The needed comma-limit fact is explicit: for a small diagram in a category , form in . The elements form a compatible family, hence determine a unique under . The projections from are a categorical limit in the comma category. This includes the empty diagram, since carries the terminal object to a singleton. Each comma hom-set is a subset of a hom-set in , so the comma category is also locally small.
Part (c) now gives an initial object of , and part (b) supplies a representation of a functor. Therefore
The size requirement is a genuine solution-set condition; limit preservation alone does not produce it in an arbitrary complete category.
A weakly initial set is a set of objects such that every object receives at least one map from some . An initial object is itself a singleton weakly initial set. We prove the converse without replacing uniqueness by weak initiality.
Let be a complete category that is locally small. Form . For every object , choose and compose with the projection , so is weakly initial. Completeness supplies a terminal object, so the given weakly initial set cannot be empty.
The endomorphisms of form a set. Take a simultaneous equalizer of all of them with ; equivalently, equalize the two maps from into with components and . Thus for every endomorphism . The object is weakly initial, since exists for every . Weak initiality of gives a map . Applying the equalizing identity to yields , so monicity of gives .
For any endomorphism , the map is an endomorphism of . Therefore . Since , this becomes , giving . Now let and form their equalizer . Weak initiality of gives . The composite is an endomorphism of , hence the identity. Consequently .
There is at least one map from to every object, and the argument proves that there is at most one. The object is an initial object. This establishes the initial-object lemma for complete categories with a weakly initial set using only small products in a category and equalizers.
Suppose is a representable functor, with a natural isomorphism . Put . For any in the comma category , the representing bijection gives a unique with . By naturality, , exactly the condition for . Hence is an initial object.
Conversely, if is an initial object, then
is a bijection for each : existence and uniqueness are precisely initiality applied to every . For , , proving naturality. Thus is a universal element and is a representation of a functor. Being representable is equivalent to the singleton comma category having an initial object.
The comma category has objects with and a function . Its morphisms are maps in satisfying . The identity morphism and composition in a category are inherited from ; the functor laws make the defining equations stable under both.
For a singleton , its map is just an element . Thus is the covariant category of elements of , with arrows satisfying .
If every monomorphism is strong, let be both a monomorphism and an epimorphism. Use as both vertical maps in the lifting square, with horizontal maps and . The strong monomorphism property gives satisfying and . Thus is an isomorphism, proving that the category is balanced.
For the converse, take epic, monic, and . Form the pullback in a category of along :
The equality gives with and . By preservation of monomorphisms under pullback in a category, is monic. It is also epic: if , then , and cancellation of gives . The balanced category hypothesis therefore makes an isomorphism.
Set . Then and . Any other such lift agrees with after composing with the monomorphism , so it is equal to . Consequently in a category with pullbacks in a category, being balanced is equivalent to every monomorphism being a strong monomorphism. This is the balanced categories with pullbacks have strong monomorphisms principle; the proof does not assume pullback stability of epimorphisms.
A monomorphism satisfies for every parallel pair into . An epimorphism satisfies for every parallel pair out of . A strong monomorphism is a monomorphism with the following lifting property: whenever is an epimorphism and , with and , there is a unique with and . A regular monomorphism is a morphism occurring as the equalizer of two parallel maps. A balanced category is one in which every morphism that is both a monomorphism and an epimorphism is an isomorphism.
Suppose equalizes . If , the common composite has two factorizations through the equalizer, so its uniqueness property gives . Hence every regular monomorphism is indeed a monomorphism.
Now take the lifting square just described. The equations imply . Cancel the epimorphism to obtain . The equalizer gives a unique with . Since and is a monomorphism, . Thus every regular monomorphism is a strong monomorphism; the existence of the lift uses epic cancellation, and its uniqueness uses the equalizer property.
An object of the slice category is a morphism ; a map from to is with . The identity morphism is a terminal object of this slice category, even when itself has no terminal object.
For a cospan in the slice category, form its underlying pullback in a category in , with maps and . If are the structure maps to , then . This common map equips with its slice structure. An underlying mediating map into is automatically over , because its composite with is the prescribed structure map. Hence the same square is a pullback in a category in .
With a terminal object , the pullback in a category of is the binary product in a category . Repetition gives all nonempty finite products in a category, and supplies the empty one.
For , form the diagonal and pull it back along . Write the resulting maps as and . The equation says . A map with pairs with to give a unique map into this pullback in a category. Thus is the equalizer of .
We now have the finite products in a category and equalizers needed in part (a). A terminal object and pullbacks in a category therefore suffice for all finite limits.
Let be a finite diagram in a category. Form the finite products in a category
Define by and . Take their equalizer . The maps satisfy , so they constitute a categorical cone.
Any other categorical cone gives a unique by the product in a category property. Its cone equations say , so the equalizer gives a unique with . The projections then give , and uniqueness follows from both universal properties. Thus this equalizer of two product maps is the finite limit of the diagram in a category.
The empty indexing category is included: its empty product in a category is a terminal object, which is the empty categorical limit. Hence no nonemptiness restriction has entered the construction.
Suppose every component is a monomorphism in the Category of sets, hence an injective function. If are natural transformations with , then at every object. Componentwise cancellation gives , so . Thus is a monomorphism in the functor category.
Conversely, suppose is a monomorphism and satisfy . The Yoneda lemma supplies natural transformations . Its naturality in identifies and with the equal elements and . Cancellation by gives ; evaluating at gives . Therefore a natural transformation is a monomorphism exactly when all its components are injective functions. This is the pointwise monomorphism in a set-valued functor category criterion.
For the covariant version of the Yoneda embedding, put . A morphism induces the natural transformation whose component sends to . Thus is a functor from the opposite category to the functor category . The locally small category hypothesis makes each value a set.
The Yoneda lemma says that, for a functor , evaluation at the identity morphism gives a natural bijection
Given , define . For , the functor law gives , proving naturality. Conversely, naturality of at gives . These two constructions are inverse, because .
The bijection is natural in both variables. A natural transformation sends the element to , matching postcomposition by . For , precomposing with sends to a transformation from and its distinguished element is . This is exactly the required dependence on .
Taking gives . Consequently the covariant Yoneda embedding is full and faithful, with the reversal of arrows accounted for by its opposite category domain.
Morita equivalence of geometric theories means equivalence of their classifying toposes. Equivalently, their categories of models in every Grothendieck topos are equivalent pseudonaturally with respect to inverse image. Agreement only of their set-based model categories, without this natural internal-model structure, is not the definition.
Suppose . A property expressed intrinsically in terms of the topos is the same under either presentation. One can therefore translate a site or logical characterization of that property from into one for . Examples include Booleanity, connectedness, atomicity and the structure of the subtopos lattice. The bridge is the common invariant , rather than an assumed literal identification of the two signatures.
The duality between geometric quotients and subtoposes makes this precise. A geometric quotient theory of adds geometric axioms over the same signature. Quotients are identified when they prove the same geometric sequents. The theorem gives
The subtopos corresponding to is its classifying topos. Stronger axioms correspond to smaller subtoposes under inclusion.
The site mechanism explains the correspondence. On , an additional sequent requires the associated family of definable images to cover its antecedent. Adding these covering sieves produces a topology and a geometric embedding
Conversely, subtoposes correspond to such larger topologies; requiring their extra definable covers gives the corresponding deductively closed quotient theory. Pulling the universal model into the subtopos supplies the universal model of the quotient.
Given a quotient , transport its subtopos along the chosen equivalence of classifying toposes. Apply the duality again to obtain a quotient of . Their classifying toposes are equivalent, so
This is an explicit transfer principle for whole families of theory extensions and their order relations. Intrinsic constructions such as open, closed or Boolean subtoposes can likewise be described in each syntax. Different descriptions may look unrelated, but their equality is explained by the common subtopos. No universal translation of individual formulas is asserted without choosing the relevant equivalence and interpretations.
Yes, with the Horn/Cartesian-fragment convention. A Horn theory uses positive finite-conjunction sequents and has a Cartesian syntactic category with finite limits. Provably uniquely witnessed existential formulas can also be admitted without changing the finite-limit nature of its semantics. Its internal models are precisely finite-limit-preserving functors from that category.
For a category with finite limits, flat functors into a Grothendieck topos are exactly finite-limit-preserving functors. In sets, the reason is concrete: the category of elements of a covariant left-exact functor is cofiltered. Its terminal object supplies nonemptiness, products supply cones over pairs of elements, and equalizers supply equalizing cones over parallel arrows. Conversely a cofiltered category of elements expresses the functor as a filtered colimit of covariant representables; filtered colimits of sets commute with finite limits. The internal version uses the same cone conditions locally.
The presheaf form of the Diaconescu equivalence for geometric morphisms therefore identifies geometric morphisms into
with internal Horn models, naturally in the domain topos. This is the presheaf classifier of a Horn theory.
Equivalently, using a small skeleton of the category of finitely presented set-based Horn models, the classifier is , with covariant functors. The duality sends a formula to the model generated by its tuple subject to its finite constraints. The presheaf claim does not extend merely because a general geometric or regular theory has no written disjunctions: arbitrary existential witnesses are not uniquely witnessed Horn data.
A geometric formula is built from atomic formulas, including equality, using finite conjunctions, arbitrary set-indexed disjunctions and existential quantification in a finite variable context. Truth is the empty conjunction and falsity the empty disjunction. A geometric theory is a set of sequents between such formulas over a many-sorted signature. The context supplies the universal force of an axiom; unrestricted universal quantification, implication and negation are not formula constructors in this fragment.
These choices are exactly suited to inverse image functors of geometric morphisms. Finite-limit preservation handles equality and conjunction; colimit and image preservation handle disjunction and existential quantification. Therefore an inverse image carries an internal model of a geometric theory to another model.
Construct the geometric syntactic category as follows. Objects are formulas in context , modulo provable renaming and equivalence. A morphism to is an equivalence class of formulas that are provably total and single-valued:
The last notation abbreviates componentwise equality. Identity is equality of the context variables; composition is existential conjunction over the intermediate tuple. The category has finite limits, formed through conjunction and equality.
Give it the geometric syntactic topology . A family of arrows represented by into covers when
Pullback stability is substitution, and transitivity comes from distributing existential conjunction through the covering disjunctions. Thus the generated sieves define a Grothendieck topology. Empty covers impose the interpretation of falsity as the initial object.
The classifying topos is
Its universal model assigns a sort the sheafified representable of , functions their definable graph morphisms and relations their definable subobjects. The syntactic covering conditions make the axioms valid in this model.
For the universal property, interpreting formulas in a model in a Grothendieck topos gives a finite-limit-preserving, -continuous functor : covers go to jointly epimorphic families precisely because the relevant sequents hold. The Diaconescu equivalence for geometric morphisms associates to this functor a geometric morphism . Conversely, pulling back along a geometric morphism gives a model. The constructions on models and their homomorphisms are inverse up to natural isomorphism, yielding
naturally in . This proves the required classifying property, not merely classification of set-valued models.
For the covariant category in this part, put and . Its global-sections functor is , the limit of the diagram. If is also an inverse image, it is a left adjoint and preserves all small colimits.
Consider the canonical pointwise-surjective map
At , the summand contains , so is an epimorphism. In a presheaf topos epimorphisms are regular, and a colimit-preserving functor preserves their coequalizer presentations. Thus is surjective. Since preserves coproducts, some summand has a global element, yielding a section of its unique map . The constant singleton functor is a retract of a covariant representable.
Conversely, if is such a retract in a category, is a retract of , which is evaluation at by the Yoneda lemma. Evaluation preserves colimits pointwise. The colimit comparison for a retract functor is a retract of the evaluation comparison; a retract of an isomorphism is an isomorphism, so preserves all small colimits. It also preserves finite limits because it is representable. A right adjoint can be constructed by
For , precomposition gives , and applying and then gives . The presentation of every functor as a colimit of representables gives . Hence , so is an inverse image and the topos is local.
The retract condition has a precise interpretation as the initial object criterion for a covariant local topos. Write the section as a natural family . Naturality says for every . Put . Then and every satisfies . In the idempotent completion of , the object is initial: an arrow from it to must satisfy , and the identities force ; this arrow exists because and .
Conversely an initial object in the idempotent completion gives that natural family and the retract. Therefore
If is already idempotent-complete, this is equivalent to an initial object in itself, and is evaluation there. The word is initial, not terminal, because this question uses covariant functors.
One cannot omit idempotent completion for a general small category. Take the one-object category of the monoid with absorbing zero. It has no initial object because its endomorphism set has two elements, but the natural family satisfies for every . Its covariant functor category is local. Concretely, a functor is a set with an idempotent operator, and its global sections are the fixed points of that operator.
For a topological space , there is an equally explicit criterion. If is local, apply to the epimorphism associated with any open cover , regarding the opens as subterminal sheaves. Since is a singleton exactly when , and otherwise empty, coproduct and epimorphism preservation force some .
Thus every open cover of contains itself. Conversely this open cover criterion for a local sheaf topos condition is equivalent to existence of a point whose only open neighborhood is : the union of all proper open sets cannot be all of , so choose outside it. Such a point plainly forces any cover to contain . Empty spaces fail the condition.
At this point, the stalk functor is simply , since there is only one open neighborhood. Its right adjoint is the skyscraper sheaf of sets
A morphism is determined exactly by its map , because all proper opens omit . Hence , and preserves finite limits, proving locality. Consequently
In a space this distinguished point is unique and closed. In a space the condition forces to be a singleton. Indistinguishable points in a non- space can all have this property; uniqueness of an actual point is not part of the general criterion.
In a Grothendieck topos define
The coproduct universal property gives , naturally. Thus . On any sheaf presentation, is the composite of the constant-presheaf functor with sheafification. The former preserves finite limits pointwise, and the latter is left exact, so preserves finite limits. Therefore these functors define a geometric morphism .
For uniqueness, let be any such geometric morphism. Its inverse image is a left adjoint and preserves the terminal object. Every set has the canonical coproduct decomposition , so
These isomorphisms respect all functions between sets, giving a natural isomorphism . The right adjoint is then unique up to the corresponding natural isomorphism, so . There is a unique geometric morphism to sets, up to isomorphism, called the global sections geometric morphism. This also applies to the degenerate topos.
When is a group, evaluation at its identity gives a bijection from the previous equivariant-map set to all functions . For an arbitrary function , the inverse construction is
Indeed,
so is an equivariant map. Conversely, if is equivariant, implies , so for .
Transport the right action from part (a) through this bijection. At its value is
Thus the exponential of right group actions is
For clarity, the right-action law holds even in a nonabelian group:
Evaluation is equivariant because . The underlying functions need not be equivariant; the fixed points of this exponential action are exactly the equivariant functions.
Let have the diagonal right monoid action , and put . Define the right action on this set of equivariant maps of monoid sets by
It really stays in : . Also and , so it satisfies the right-action law. Left multiplication in the first argument is intentional; no commutativity of has been assumed.
Define the evaluation map of an exponential object
It is equivariant, because
For any right -set and equivariant map , define its currying by
For fixed , this is equivariant in the diagonal variables: . The map is also equivariant, since
It satisfies .
Conversely, given an equivariant , set . Evaluation makes this equivariant, and currying recovers :
These constructions are inverse and natural in . Therefore they establish the exponential object universal property
This is the exponential of right monoid actions, not the set of ordinary maps with an arbitrarily guessed action.
For a section represented by a column , expand the covariant exterior derivative using the graded Leibniz rule:
Therefore the Cartan curvature matrix equation is
The product includes endomorphism composition; it need not vanish for a matrix-valued one-form. For a scalar frame change , and , confirming that the line-bundle two-forms patch globally.
Use a row of local frame sections and columns of coefficients: . If for a smooth invertible matrix-valued function , then
Hence the change of frame of a vector-bundle connection is
This convention specifies both the placement of the frame matrix and the sign of the inhomogeneous term. The vector-bundle curvature transforms by , either by applying to the new frame or by substituting in the formula of the next subpart.

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