New

The twenty most recently written or updated notes, newest first.

20 entries

1 Predecessors simplify later predecessors-simplify-later

A predecessor of π‘₯ is a top element of its strict downset: a strict morphism 𝜌:𝑝→π‘₯ through which every strict morphism into π‘₯ factors uniquely. Equivalently, π–²π—π—‹π—‚π–Όπ—π–£π—ˆπ—π—‡(π‘₯)≅𝗒𝑝 β€” the downset is representable.

The Yoneda lemma then collapses later to evaluation:

βŠ³π‘ƒ(π‘₯)=π–―π—Œπ—π’žοΈ€(π–²π—π—‹π—‚π–Όπ—π–£π—ˆπ—π—‡(π‘₯),𝑃)β‰…π–―π—Œπ—π’žοΈ€(𝗒𝑝,𝑃)≅𝑃(𝑝),

with 𝗇𝖾𝗑𝗍 becoming restriction along 𝜌. The name is from the naturals: every strict map into 𝑛+1 factors through 𝑛→𝑛+1, so on πœ” β€” in the topos of trees β€” later is just the shift

βŠ³π‘ƒ(0)β‰…βŠ€,βŠ³π‘ƒ(𝑛+1)≅𝑃(𝑛),

and a LΓΆb step is a base value together with a rule producing the value at 𝑛+1 from the value at 𝑛.

When this predecessor exists, we can give a simpler description of later, as in the topos of trees, but this may not be possible in all direct categories.

2 Algebras as a displayed category algebras-displayed

Fix an endofunctor 𝐹:π’žοΈ€β†’π’žοΈ€. The 𝐹-algebras form a displayed category AlgStr(𝐹) over π’žοΈ€.

Over an object π‘₯, a displayed object of AlgStr(𝐹) is a structure map

π›Όβˆˆπ’žοΈ€(𝐹π‘₯,π‘₯).

Over 𝑓:π‘₯→𝑦, a displayed morphism from 𝛼 to 𝛽 is the proposition that 𝑓 is an algebra homomorphism:

𝛼⋆𝑓=𝐹𝑓⋆𝛽.

The total category Alg(𝐹)=∫AlgStr(𝐹) is the category of 𝐹-algebras.

3 The co-Eilenberg–Moore category as a displayed category co-eilenberg-moore-displayed

A comonad on π’žοΈ€ is a monad π‘Š on π’žοΈ€op. Everything about its coalgebras is then inherited from the Eilenberg–Moore construction, instantiated at the opposite category β€” nothing is defined twice.

Algebras of π‘Š over π’žοΈ€op are coalgebras π›Ύβˆˆπ’žοΈ€(π‘₯,π‘Šπ‘₯) of the underlying endofunctor, and the monad algebra laws, read in π’žοΈ€op, are the comonad coalgebra laws β€” the unit and multiplication of π‘Š, viewed in π’žοΈ€, are the counit πœ€ and comultiplication 𝛿:

π›Ύβ‹†πœ€π‘₯=𝗂𝖽π‘₯𝛾⋆𝛿π‘₯=π›Ύβ‹†π‘Šπ›Ύ.

The co-Eilenberg–Moore category is the opposite of the total category:

coEM(π‘Š)=(EM(π‘Š))op.

4 Coalgebras as a displayed category coalgebras-displayed

Fix an endofunctor 𝐹:π’žοΈ€β†’π’žοΈ€. Coalgebras require no new construction: a coalgebra is an algebra in the opposite category. Define

CoalgStr(𝐹)=AlgStr(𝐹op),

a displayed category over π’žοΈ€op, where 𝐹op:π’žοΈ€opβ†’π’žοΈ€op is 𝐹 acting on the opposite category.

Concretely, over an object π‘₯ a displayed object is a structure map

π›Ύβˆˆπ’žοΈ€(π‘₯,𝐹π‘₯).

The category of coalgebras is the opposite of the total category:

Coalg(𝐹)=(∫CoalgStr(𝐹))op.

The outer opposite returns morphisms to the direction of π’žοΈ€: a morphism (π‘₯,𝛾)β†’(𝑦,𝛿) is a map 𝑓:π‘₯→𝑦 with

𝑓⋆𝛿=𝛾⋆𝐹𝑓.

Definition 5. The comparison functor of an adjunction comparison-functor

An adjunction πΉβŠ£π‘ˆ with 𝐹:π’žοΈ€β†’π’ŸοΈ€ and π‘ˆ:π’ŸοΈ€β†’π’žοΈ€ induces a monad 𝑇=π‘ˆβˆ˜πΉ on π’žοΈ€. Write πœ€:πΉβˆ˜π‘ˆβ‡’π–¨π–½ for the counit of the adjunction. Every object 𝑑 of π’ŸοΈ€ then induces a 𝑇-algebra carried by the object π‘ˆπ‘‘, witnessed by the map

π‘ˆπœ€π‘‘:π‘ˆπΉπ‘ˆπ‘‘β†’π‘ˆπ‘‘.

This assignment extends to a functor into the Eilenberg–Moore category,

𝐾:π’ŸοΈ€β†’EM(𝑇),

the comparison functor of the adjunction.

Dually, an adjunction induces a comonad on the other side and a comparison into the co-Eilenberg–Moore category. When these comparisons are equivalences we say that the adjunction πΉβŠ£π‘ˆ is (co)monadic.

Definition 6. Direct categories direct-category

A well-founded order is a set 𝐷 with a proposition-valued transitive relation < admitting no infinite descent: every element is accessible. Write π‘Žβ‰€π‘ for (π‘Ž<𝑏)∨(π‘Ž=𝑏).

A direct structure on a category π’žοΈ€ over (𝐷,<) is a functor

deg:π’žοΈ€β†’(𝐷,≀)

into the well-founded order viewed as a poset category. The functor organizes two pieces of data at once: an ordering on the objects, and the invariant that morphisms respect it β€” 𝑓:π‘₯→𝑦 forces degπ‘₯≀deg𝑦.

A direct structure equips the objects with a well-founded strict relation

π‘₯β‰Ίπ‘¦βŸΊdegπ‘₯<deg𝑦.

Intuitively, direct categories are the right generalization of well-foundedness to the categorical setting: a direct category is essentially one whose underlying graph is a directed acyclic graph, layered by degree, so that data at an object may be defined by recursion from data at all objects strictly below it.

The degrees order the objects, while the morphisms of π’žοΈ€ say how an object sits over its predecessors.

Definition 7. Earlier on presheaves earlier-presheaf

Later takes a limit over smaller indices. Dually, the earlier modality takes a colimit over larger indices: an element of βŠ²π‘ƒ at π‘₯ is a 𝑃-element sitting at some object 𝑦 strictly above π‘₯, carried down along a chosen morphism π‘₯→𝑦.

Earlier is left adjoint to later:

⊲⊣⊳

Under this adjunction, 𝗇𝖾𝗑𝗍:π‘ƒβ†’βŠ³π‘ƒ corresponds to

𝗉𝗋𝖾𝗏:βŠ²π‘ƒβ†’π‘ƒ,

.

8 The Eilenberg–Moore category as a displayed category eilenberg-moore-displayed

Fix a monad (𝑇,πœ‚,πœ‡) on π’žοΈ€. Its Eilenberg–Moore category arises in two displayed layers. The first layer is the displayed category of algebras AlgStr(𝑇) of the underlying endofunctor.

The second layer, EMStr(𝑇), is displayed over the total category Alg(𝑇). Over an algebra (π‘₯,𝛼) the displayed objects are the propositions that 𝛼 satisfies the monad algebra laws:

πœ‚π‘₯⋆𝛼=𝗂𝖽π‘₯πœ‡π‘₯⋆𝛼=𝑇𝛼⋆𝛼.

The Eilenberg–Moore category is the total category of the tower:

EM(𝑇)=∫EMStr(𝑇).

Definition 9. Initial algebra initial-algebra

Fix an endofunctor 𝐹:π’žοΈ€β†’π’žοΈ€. An initial 𝐹-algebra, written πœ‡πΉ, is an initial object of the category of algebras Alg(𝐹).

Unfolding the universal property: an initial algebra is an algebra (πœ‡πΉ,in) such that every algebra (π‘₯,𝛼) admits a unique morphism fold𝛼:πœ‡πΉβ†’π‘₯ satisfying

in⋆(fold𝛼)=𝐹(fold𝛼)⋆𝛼.

Definition 10. Later on families later-family

Conjugation with the adjunction between presheaves and families π‘ˆβŠ£Cofree lets us induce a later construction on families from the one on presheaves,

⊳Fam=π‘ˆβˆ˜βŠ³βˆ˜Cofree:Fam(π’žοΈ€)β†’Fam(π’žοΈ€).

Concretely, later on families evaluates to

⊳Fam𝐴(π‘₯)β‰…βˆπ‘¦β‰Ίπ‘₯Β βˆπ‘“:𝑦→π‘₯𝐴(𝑦)

Definition 11. Later on presheaves later-presheaf

The later modality for presheaves on a direct category is given by the presheaf of natural transformations

out of the strict downset.

(βŠ³π‘ƒ)(π‘₯)=π–―π—Œπ—π’žοΈ€(π–²π—π—‹π—‚π–Όπ—π–£π—ˆπ—π—‡(π‘₯),𝑃).

An element of βŠ³π‘ƒ at π‘₯ is a coherent choice of 𝑃-elements at all objects strictly smaller than π‘₯.

Restriction in βŠ³π‘ƒ along 𝑓:𝑦→π‘₯ precomposes with the induced map π–²π—π—‹π—‚π–Όπ—π–£π—ˆπ—π—‡(𝑦)β†’π–²π—π—‹π—‚π–Όπ—π–£π—ˆπ—π—‡(π‘₯). At an object of minimal degree the strict downset is empty, so βŠ³π‘ƒ is trivial there.

Via functoriality, every presheaf restricts to smaller indices. Thus we may define the map

𝗇𝖾𝗑𝗍:π‘ƒβ†’βŠ³π‘ƒ

that sends an element 𝑝 over π‘₯ to the family of all its restrictions along morphisms from strictly lower objects.

Theorem 12. LΓΆb induction on families lob-family

Like later on families, the recursion principle for families is inherited from that on presheaves. Given a family 𝐴 and a step

πœ‘π‘₯:⊳Fam𝐴(π‘₯)→𝐴(π‘₯)for each π‘₯,

the construction is a chain of transpositions with LΓΆb for presheaves used in the middle:

Just as for presheaves, the fixed point constructed above is unique: the two transpositions are bijections, and the presheaf-level fixed point is already unique.

Theorem 13. LΓΆb induction for presheaves on a direct category lob-presheaf

Let π’žοΈ€ be a direct category and 𝑃 a presheaf on it. Every map

πœ‘:βŠ³π‘ƒβ†’π‘ƒ

has a fixed point: a global element π—…ΓΆπ–»πœ‘:βŠ€β†’π‘ƒ with

π—…ΓΆπ–»πœ‘=π—…ΓΆπ–»πœ‘β‹†π—‡π–Ύπ—‘π—β‹†πœ‘,

and this fixed point is unique.

The hypothesis says: the value of 𝑃 at any object is determined by its values over the strict past β€” πœ‘ turns a coherent family over the strict downset of π‘₯ into a value at π‘₯. The proof is recursion along the well-founded β‰Ί: at each π‘₯, the section already constructed over the past assembles into an element of (βŠ³π‘ƒ)(π‘₯), and πœ‘ extends it to π‘₯.

Definition 14. Locally contractive endofunctors locally-contractive-functor

Write π‘‹β‡’π‘Œ for the presheaf of morphisms π‘‹β†’π‘Œ. An endofunctor 𝐹 on presheaves is locally contractive when its action on morphisms factors through later: there is a map

𝐹𝛿:⊳(π‘‹β‡’π‘Œ)β†’(πΉπ‘‹β‡’πΉπ‘Œ)

Definition 15. Monadicity and comonadicity monadicity-comonadicity

An adjunction πΉβŠ£π‘ˆ with 𝐹:π’žοΈ€β†’π’ŸοΈ€ and π‘ˆ:π’ŸοΈ€β†’π’žοΈ€ induces a monad 𝑇=π‘ˆβˆ˜πΉ on π’žοΈ€, and a comparison functor

𝐾:π’ŸοΈ€β†’EM(𝑇)

sending each object of π’ŸοΈ€ to the 𝑇-algebra it carries.

The functor π‘ˆ is monadic when 𝐾 is an equivalence: the adjunction exhibits π’ŸοΈ€ as objects of π’žοΈ€ equipped with algebraic structure for 𝑇, the Eilenberg–Moore category.

Comonadicity is monadicity in the opposite category: a left adjoint 𝐿:π’ŸοΈ€β†’π’žοΈ€ with right adjoint 𝑅 induces a comonad π‘Š=πΏβˆ˜π‘… on π’žοΈ€, a comparison π’ŸοΈ€β†’coEM(π‘Š) into the co-Eilenberg–Moore category, and 𝐿 is comonadic when this comparison is an equivalence.

16 The adjoint triple between presheaves and families presheaf-family-adjoint-triple

A family over π’žοΈ€ is a set 𝐴(π‘₯) for each object π‘₯, with no action of morphisms. Families form a category Fam(π’žοΈ€): a morphism 𝐴→𝐡 is a function 𝐴(π‘₯)→𝐡(π‘₯) for each π‘₯.

Forgetting the restriction maps of a presheaf gives a functor

π‘ˆ:π–―π—Œπ—π’žοΈ€β†’Fam(π’žοΈ€).

It has both a left and a right adjoint,

FreeβŠ£π‘ˆβŠ£Cofree.

The two adjoints demonstrate different means of forcing a family to be functorial. The right adjoint universally quantifies over morphisms in,

Cofree(𝐴)(π‘₯)=βˆπ‘¦π’žοΈ€(𝑦,π‘₯)→𝐴(𝑦),

with restriction along 𝑓 given by precomposition. The left adjoint instead existentially quantifiers over morphisms out:

Free(𝐴)(π‘₯)=βˆ‘π‘¦π’žοΈ€(π‘₯,𝑦)×𝐴(𝑦),

with restriction acting on the first component. (For Free we ask that π’žοΈ€ have a set of objects, so that this sum is a set and thus Free defines a presheaf.)

Theorem 17. Presheaves are monadic and comonadic over families presheaves-monadic-comonadic-over-families

The adjoint triple FreeβŠ£π‘ˆβŠ£Cofree induces a monad 𝑇=π‘ˆβˆ˜Free and a comonad π‘Š=π‘ˆβˆ˜Cofree on Fam(π’žοΈ€).

Both comparison functors are equivalences: presheaves are the Eilenberg–Moore algebras of 𝑇 and the co-Eilenberg–Moore coalgebras of π‘Š,

π–―π—Œπ—π’žοΈ€β‰ƒEM(𝑇)π–―π—Œπ—π’žοΈ€β‰ƒcoEM(π‘Š).

So presheaves are both monadic and comonadic over families.

Reading the algebra structure concretely: a 𝑇-algebra on a family 𝐴 is a map βˆ‘π‘¦π’žοΈ€(π‘₯,𝑦)×𝐴(𝑦)→𝐴(π‘₯) for each π‘₯, subject to the monad algebra laws β€” that is, exactly a functorial action of restriction.

The comonadic reading is the same structure seen from the element’s side: a π‘Š-coalgebra is a map 𝐴(π‘₯)β†’βˆπ‘¦π’žοΈ€(𝑦,π‘₯)→𝐴(𝑦), giving each value its restriction along every morphism into π‘₯. Where the monad says restriction acts on values, the comonad says a value already carries all of its restrictions β€” and the coalgebra laws say it does so coherently.

Definition 18. Proper and maximal sieves proper-maximal-sieve

The representable 𝗒π‘₯ is itself a sieve on π‘₯. A sieve on π‘₯ is proper when it is not equal to the representable.

Say that a proper sieve is maximal when it contains all other proper sieves as a sub-sieve.

Definition 19. Sieves sieve

A sieve on an object π‘₯ of π’žοΈ€ is a subobject of the representable presheaf 𝗒π‘₯: a presheaf 𝑆 with a monic morphism 𝑆↣𝗒π‘₯. Sieves are a generalization from the notion of ideal found in ring theory to category theory.

A morphism 𝑓:𝑦→π‘₯ belongs to 𝑆, written π‘†βˆ‹π‘“, when 𝑓 lies in the image of the inclusion at 𝑦. Because 𝑆 is a presheaf and the inclusion is natural, membership is closed under precomposition:

π‘†βˆ‹π‘“β‡’π‘†βˆ‹π‘”β‹†π‘“for every 𝑔:𝑧→𝑦.

A sieve is thus a β€œdownward closed” collection of morphisms into π‘₯.

Sieves on π‘₯ are ordered by refinement: π‘†βŠ†π‘‡ when every morphism belonging to 𝑆 belongs to 𝑇.

Theorem 20. Maximality of the strict downset among proper sieves strict-downset-maximal

Call a direct structure reflecting when every morphism between objects of equal degree is a split epimorphism. In a reflecting direct category, every non-invertible-in-degree morphism strictly raises degree, and the strict downset is as large as a proper sieve can be:

If the direct structure is reflecting, then every proper sieve 𝑆 on π‘₯ refines into the strict downset:

π‘†βŠ†π–²π—π—‹π—‚π–Όπ—π–£π—ˆπ—π—‡(π‘₯).

Suppose π‘“βˆˆπ‘† with 𝑓:𝑦→π‘₯ of equal degree. By reflection 𝑓 has a section 𝑠, and closure under precomposition gives 𝑠⋆𝑓=𝗂𝖽π‘₯βˆˆπ‘†, contradicting properness.

So every morphism in 𝑆 strictly raises degree. That is, every morphism in 𝑆 is also a member of π–²π—π—‹π—‚π–Όπ—π–£π—ˆπ—π—‡(π‘₯).

new note entries/home/new.hel