Flat functor Created 2026-10-07 Updated 2026-10-14
A covariant functor into a Grothendieck topos is flat when its tensor extension from presheaves preserves finite limits. For set values, its category of elements with arrows carrying source elements to target elements is cofiltered; equivalently the functor is a filtered colimit of covariant representables. If the indexing category has finite limits, flatness is equivalent to preservation of finite limits. For a site, cover-to-joint-epimorphism continuity adds the condition needed by the Diaconescu equivalence for geometric morphisms.
Use one ring sort with and the usual unital commutative ring equations. Write for the coherent formula . Add the coherent sequents
This presents the coherent theory of local rings. For an ordinary nonzero ring satisfying these axioms, the nonunits form an ideal: a multiple of a nonunit cannot be a unit; and if nonunits had unit sum, multiplying by would make two nonunits sum to , contradicting the second axiom. They are also closed under additive inverses. This proper ideal contains every proper ideal, since a proper ideal contains no unit, and its quotient is a field; it is the unique maximal ideal. Conversely in a local ring, and cannot both belong to the unique maximal ideal, so one is a unit. The first sequent excludes the zero ring. In a topos, the disjunction asserts that these unit alternatives hold locally.
Let be a small skeleton of the opposite of the category of finitely presented unital commutative rings; write for the object corresponding to . The Zariski coverage on finitely presented rings is generated by
and the empty cover of . Localization is finitely presented, and its compatibility with base change proves the covering axioms.
Here is the classifying argument. For an internal commutative ring and a presentation , define as the subobject of satisfying the polynomial equations . Ring maps induce maps of these solution objects in the site direction. This is independent of presentation, and it preserves finite limits: finite colimits of finitely presented rings correspond to joining finite generators and equations, whose solution objects are finite limits. Conversely a left-exact functor reconstructs a commutative ring using the polynomial maps for addition, multiplication, constants and additive inverse. Presentations by generators and equations then show . Thus flat functors on correspond to internal commutative rings.
Under , the localization arrow above identifies its domain with the locus where evaluates to a unit; the inverse witness is unique. The family is jointly epimorphic exactly when these unit loci cover the solution object for . The locality axiom implies this for every unit-ideal family: from a finite sum , repeatedly apply the two-summand unit alternative, rescaling a unit partial sum when necessary; some , hence some , is a unit locally. Conversely the cover of by its localizations at and gives precisely the locality axiom, while the empty cover of the zero ring gives . Therefore continuous flat functors are exactly models of the displayed coherent theory. The Diaconescu equivalence for geometric morphisms now identifies
naturally in . This proves the asserted classifying topos identification.
Since the site is subcanonical, the generic local ring is the representable sheaf
Its ring operations are induced by polynomial substitution. Its infinitesimal subobject is likewise representable:
Products of representables correspond to tensor products of their rings. For every finitely presented , exponential adjunction and the Yoneda lemma give
Every element of this ring has a unique expression , because form an -basis. This holds even when has nilpotents or zero divisors. The expression is natural under every ring homomorphism , which sends its two coefficients to their images. The canonical morphism , transposed from , is consequently a bijection at every stage , with a natural inverse extracting the coefficients. Therefore
This proves the Kock-Lawvere axiom for the generic local ring. The uniqueness is an internal sheaf assertion tested at all finitely presented rings, including the ring with its generic square-zero element; restricting the test to fields would lose that element and would not prove uniqueness.
Let be a small skeleton of finite partially ordered sets with all weak order-preserving functions, and let consist of finite strict partial orders with all strict order-preserving functions. Include the empty structure, because no inhabitation axiom has been imposed. The two classifiers are
These are covariant functor categories, or presheaves on the opposite finite-model categories; reversing this variance would give the wrong generic models. In each case the generic carrier sends a finite model to its underlying set, with the generic relation given by its order at that stage. These are the classifying topos of partial orders and the classifying topos of strict partial orders.
We justify the finite-model presentations internally, so an identification of set-based model categories alone is not being mistaken for a classifying property. A finite weak-order presentation takes a finite graph of required inequalities, closes it transitively and reflexively, and identifies vertices in mutually reachable cycles; this produces a finite poset representing that positive diagram. For the strict theory, a transitive cycle makes the presentation contradictory by irreflexivity; otherwise transitive closure produces a finite strict poset. Homomorphisms from these presentations into any model are exactly the tuples satisfying the specified finite relations.
More explicitly, an internal model gives on the opposite finite-model category. Its finite realizations form an internally filtered system. It is nonempty through the empty presentation. Two realizations combine through a disjoint-union presentation. To equalize parallel presentation maps whose composites in agree, quotient their target by the finitely many required identifications and close the relation transitively. In the weak case, collapse the resulting mutually comparable blocks; antisymmetry in guarantees that the realization factors through this quotient. In the strict case, either the quotient is a finite strict poset and gives the required factorization, or it has a cycle, making the supposed realization impossible. These constructions prove the flatness conditions without deciding equality of arbitrary elements of .
Conversely a flat functor gives an internal filtered colimit of finite models with the indicated carrier and relation. Each finite axiom remains true under that filtered presentation. One-point presentations recover every element; two-point comparison presentations recover every relation; and finite identifications recover equality. These constructions are inverse: a realization of any finite diagram in the colimit factors locally through a finite stage, and two such realizations agreeing in the colimit agree after a further stage. Thus internal models in every Grothendieck topos correspond to flat functors on the opposite finite-model category. The presheaf case of the Diaconescu equivalence for geometric morphisms gives the displayed classifiers. This direct finite-presentation argument is the relevant safeguard in identifying presheaf classifiers; agreement of set-model categories by itself would not suffice, as emphasized in Research on theories of presheaf type.
The reflexification of a strict partial order interprets the weak theory by
Reflexivity is supplied by the equality disjunct. For transitivity, distribute over the two disjunctions: a pair of strict comparisons composes by strict transitivity, and any equality substitutes into the other comparison. For antisymmetry, the case of two opposed strict comparisons implies and hence falsity; every remaining case supplies equality. All these are coherent deductions, so the interpretation works in an arbitrary topos rather than only in classical sets.
It gives a functor and hence a geometric morphism
This applies Question 5 to on the presheaf indexing categories. Every finite weak poset is the reflexification of its classical strict part, so every target indexing object is in the image. Question 5(ii) therefore makes surjective. But is not full: the constant map from a two-element chain to a singleton is weak-order-preserving and not strict-order-preserving. Question 5(iii) consequently proves the morphism is a surjection, not an injection. The strict part of a weak order would require an inequality predicate, so the classical equivalence of weak and strict orders on sets does not supply an inverse geometric interpretation.
For the extended theories, interpret the printed final symbols as the classifiers of , respectively; the repeated names in that sentence are a source slip. Let contain finite totally ordered sets and all weak monotone maps, and let contain finite strict total orders and increasing injections. Again include the empty order. Then both linear-order classifiers are presheaf toposes:
For the weak-total model, two finite nondecreasing realized tuples can locally be merged into a single nondecreasing tuple: compare their first remaining entries using totality, take an entry known to be no larger than the other, and continue. This finite procedure uses only finite totality disjunctions and permits duplicate values; it does not require decidable equality. To equalize maps between finite chains, collapse the convex intervals forced equal by their realization; antisymmetry guarantees that all values in such intervals agree. These give the flatness conditions for , and finite tuples recover the model exactly as above.
For a strict-total model, trichotomy merges two finite increasing tuples, identifying entries when the equality alternative holds. Every strict map out of a finite chain is injective: if two indices differ, their images are strictly comparable and cannot be equal. Consequently parallel increasing injections with the same realized tuple are already equal, supplying the equalization condition. The same reconstruction proves the classifying topos of strict linear orders claim; in the weak case it proves the classifying topos of linear orders claim. In particular the latter proof has not silently replaced weak totality by decidable strict trichotomy.
Finally, reflexification sends a strict-total model to a weak-total one. Indeed pulling back weak totality under the interpretation gives
exactly the strict trichotomy axiom. Thus the original morphism restricts to the corresponding subtoposes, giving the commutative square
The vertical embeddings are induced by the full inclusions of finite chains among finite partial orders, and their images classify precisely the added axioms. On presheaves is restriction along . The same object-surjectivity and two-element-collapse argument show that the restricted morphism is also surjective and not an embedding. The exact pullback of the added totality axiom further identifies the square as the corresponding base change of subtoposes.
A classifying topos for a coherent theory is a Grothendieck topos with a generic model such that, for every Grothendieck topos , inverse image gives an equivalence
pseudonatural in . The equivalence includes model homomorphisms and geometric transformations, not merely a bijection between isomorphism classes of set-based models.
Construct the coherent syntactic category . Its objects are coherent formulas in finite contexts, modulo provable equivalence, and an arrow is a provably total single-valued coherent relation between their contexts. Composition existentially quantifies the intermediate tuple. Context concatenation, conjunction and equality give finite limits; existential quantification gives stable images; finite disjunction gives stable finite unions. Thus it is a small coherent category, after choosing representatives.
Equip it with the coherent topology : a finite family covers when the union of its images is the whole object, equivalently when the associated finite existential disjunction is provable from the target formula. Pullback stability and closure of covers under composition follow from the corresponding properties of images and unions. Set
The functor , consisting of the Yoneda embedding followed by sheafification, interprets each sort, function and relation of the syntax and yields the generic model . It preserves finite limits, images and finite unions: syntactic covers become epimorphic families after sheafification, and the syntactic image factorization thus becomes the image factorization of the corresponding arrow. All the axioms consequently hold in .
Here is the classifying argument. A model in interprets each context-formula as a subobject and each functional relation as a map. This gives a functor preserving finite limits, images and finite unions, so carrying covers to jointly epimorphic families. Conversely such an interpretation functor recovers exactly a model and all its formula interpretations. Because the source category has finite limits, a finite-limit-preserving functor is flat; cover preservation says that it is -continuous.
For explicitness, the associated inverse image is the flat tensor extension
where a set of sections indexes a coproduct and the coend identifies the two actions of every arrow. Flatness makes this extension preserve finite limits. The cover condition makes it identify a presheaf with its sheafification, so it descends to a finite-limit-preserving left adjoint on -sheaves. Its right adjoint sends to ; this is a sheaf because matching maps along an interpreted covering family glue uniquely across its jointly epimorphic cover. This is the Diaconescu equivalence for geometric morphisms, with its actual functors displayed.
The resulting geometric inverse image satisfies , hence . Conversely any inverse image preserves finite limits and colimits, hence images and unions, and its composite with is the interpretation functor of . Since the sheafified representables generate the topos, these constructions recover the geometric morphism up to its unique appropriate isomorphism. Natural transformations of interpretation functors correspond to the model homomorphisms and geometric transformations. This proves the required equivalence and the construction's classifying property.
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.
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.
Internal Horn models are finite-limit-preserving functors out of the Cartesian syntactic category. Since that category has finite limits, these are exactly flat functors; the presheaf Diaconescu equivalence for geometric morphisms proves the classifying property. Equivalently the classifier is the covariant functor category on finitely presented set-based models.