Let be a Cartesian comonad, so its endofunctor preserves finite limits. A coalgebra for a comonad is with , and . Its morphisms satisfy . Write for the forgetful functor and for the cofree coalgebra. Transposition is
The forgetful functor creates finite limits, since preserves them. We construct both exponential objects and the subobject classifier.
For coalgebras , set and in the ambient topos. Define by transposing
where . Their cofree transposes are coalgebra morphisms
Let be their coalgebra equalizer. For a coalgebra , an arrow corresponds to a map . Its evaluation respects coalgebra structure exactly when
Under the displayed transpositions this is precisely the condition that it equalize . Thus naturally, and is the required exponential in a coalgebra topos.
Let classify . In take the equalizer
The truth map into is and factors through this equalizer. To verify its universal property, take an underlying subobject of a coalgebra. It carries a compatible coalgebra structure exactly when maps into . Such a structure, if it exists, is unique because is monic; its laws follow by cancellation of . Moreover always: applying to a point of lands in . Thus stability is equivalent to .
If classifies , this last equality is exactly
The cofree transpose satisfies this equation precisely when it factors through . Indeed transposing the equality gives the equation above. Pulling back its truth map recovers , because classifies . Hence is the subobject classifier of a coalgebra topos. We have obtained finite limits, exponentials and a classifier, proving is a topos.
Now let be a geometric morphism, and put , , with unit . Both functors preserve finite limits, so is a Cartesian comonad on . Put . Its comparison functor
is left exact and has right adjoint
To check the adjunction, transpose an underlying map to . The coalgebra-morphism equation becomes exactly the equality of the two composites into , so the transposed arrow factors uniquely through the displayed equalizer.
The counit is invertible. Applying to the defining equalizer gives the equalizer of . The structure map is exactly that equalizer: it equalizes by coassociativity; if equalizes, apply to obtain , giving its unique factorization through . Thus the underlying comparison counit is an isomorphism, and the forgetful functor reflects isomorphisms. Therefore is full and faithful.
The adjunctions and define
Here is faithful, so is a surjective geometric morphism; is full and faithful, so is a geometric embedding. Their inverse-image composite is , establishing the surjection-embedding factorization of a geometric morphism.
For uniqueness, let be the class of arrows in inverted by . In any surjection-embedding factorization , conservativity of shows that is also the class inverted by . The essential image of the fully faithful consists exactly of the -local objects , namely those for which is bijective for every in . One direction follows from the adjunction. For the converse, the reflector unit belongs to ; locality gives a retraction, and locality of the reflected object makes that retraction also a right inverse. Thus the unit is invertible. The image subcategory is consequently determined by , independently of the factorization. The two intermediate toposes are equivalent over , and their inverse-image composites with the embeddings determine the surjection legs. This proves uniqueness up to equivalence.
Suppose is a surjective geometric morphism, so is faithful. First, if a monomorphism becomes an isomorphism, then its characteristic map and the constantly true map become equal after : by part (i), the pulled-back subobject is the whole object, and equivalently because is epic and these maps agree after precomposition with it. Faithfulness gives , so was already invertible.
Now let satisfy . Adjunction and part (i) identify their pulled-back subobjects . Each inclusion consequently becomes an isomorphism. By the preceding argument it already is an isomorphism, so and . This works for every test object , proving
Write the Cartesian comonad as , with preserving finite limits. A coalgebra for a comonad is with , and . Its forgetful functor is faithful, creates finite limits, and has the cofree coalgebra right adjoint . We construct the two remaining topos structures explicitly.
For exponential objects, take coalgebras and start with . Put , with structure , and let
Transpose the following two maps into maps :
using . The cofree adjunction transposes once more into coalgebra morphisms . Let be their equalizer. A coalgebra map corresponds to an arbitrary ambient map . It factors through precisely when
which is exactly the condition that be a coalgebra morphism. Therefore represents and is the required exponential in a coalgebra topos.
For the subobject classifier, let classify the mono . In the cofree coalgebra , form
Both arrows are coalgebra morphisms. The cofree transpose of factors through this equalizer and gives its true arrow. To verify classification, let have ambient characteristic map . It supports a subcoalgebra of exactly when it is invariant under , equivalently
The counit proves the reverse containment in the first equation; the forward containment supplies the restricted structure map, whose coalgebra laws follow through the mono. Under the cofree adjunction, the second equation says exactly that factors through . Pulling back its true arrow recovers , since . This proves the universal property of the subobject classifier of a coalgebra topos. Hence is a topos.
Now let be a geometric morphism, with . The comonad is Cartesian: preserves finite limits and the right adjoint preserves limits. Put , already a topos. The forgetful adjunction defines with , so is faithful.
The comparison functor
preserves finite limits. It has a right adjoint , given on a coalgebra by
Indeed, the transposed arrow corresponds to a coalgebra map exactly when it equalizes these two maps. Applying the finite-limit-preserving shows that is the equalizer of
That equalizer is . If equalizes the pair, then , proving the claimed universal property. Consequently the counit is invertible. The fully faithful adjoint criterion makes full and faithful.
Thus defines a geometric embedding , and identifies the composite with . The requested factorization is
where is a surjective geometric morphism and is full and faithful.
For each object , characteristic maps identify with . These subobject posets carry a natural Heyting algebra structure. Truth and falsity classify and the empty subobject. Intersections define , unions define , and implication is characterized by
These operations commute with pullback, giving arrows on and the internal Heyting algebra of truth values. Concretely, the order relation on is the subobject where ; its characteristic map is implication. Negation is .
If has truth value , its quasi-closed local operator is
This is double negation relative to the bottom value . In the Heyting algebra interval , relative implication is inherited and relative negation is . Also . Therefore the displayed map is the composite of adjoining and relative double negation. It is inflationary, idempotent, fixes truth and preserves binary meets, so it is a Lawvere-Tierney topology. Its value at bottom is .
The truth values of its sheaf topos are the fixed elements . They have bottom , inherited meet and join . Their relative negation is , which is again fixed because . The relative double-negation law holds on every fixed element, and
Thus every subobject in the sheaf topos has a complement: every quasi-closed subtopos is Boolean. This identifies its internal logic, not merely the global truth-value lattice.
Now work in . The arrow is a subterminal object there; internally it supplies a freely varying generic truth value . Let be sheafification for a local operator for its quasi-closed topology, and let be the slice geometric morphism. The composite has inverse image .
To prove surjectivity, take any mono in , classified by . Its pullback along has predicate , independent of the generic . If sends the mono to an isomorphism, it is -dense in the slice, so
for all . Pull back this identity along the graph . Substituting gives , and therefore . Thus the original mono was already invertible.
For parallel arrows , equality of their inverse images makes the inverse image of their equalizer invertible. The preceding mono argument makes the equalizer invertible and hence . Therefore is faithful, and the composite is a surjective geometric morphism. A fixed double-negation subtopos can erase information; allowing the generic relative bottom is what detects every original predicate.
For the completeness consequence, let be coherent and use its classifying topos with the generic model. Its conservative syntactic interpretation makes an underivable coherent sequent fail as a subobject inclusion. Pulling this model into the Boolean cover constructed above preserves coherent formulas and still refutes that inclusion, because the inverse image is faithful and reflects containment. In the Boolean topos, the difference between antecedent and consequent is a nonzero complemented subobject. Slicing over that difference gives a nondegenerate Boolean topos with a global tuple satisfying the antecedent and the negation of the consequent.
Classical first-order deduction is sound in a Boolean topos. Hence together with constants for that tuple, the antecedent and the negated consequent is classically consistent: a proof of contradiction would hold in the nondegenerate sliced model. The ordinary Henkin construction supplies a set model of this consistent theory. Briefly, extend it by witness constants, complete it to a maximal consistent theory, form the term structure modulo provable equality, and prove the truth lemma by induction on formulas. For possibly empty sorts use the standard encoding by sort predicates and functional graph relations, without asserting sort inhabitance; the constants for the chosen tuple assert only the needed witnesses. The resulting set model is a countermodel to the original sequent.
Consequently a coherent sequent valid in every set-valued model of a coherent theory is derivable in coherent logic. The Boolean cover supplies the crucial passage from the generic intuitionistic countermodel to consistency with classical negation; the final set-model step uses ordinary first-order completeness via its Henkin proof, rather than an assumption that every Boolean topos has points.