the canonical intensive quality of a pre cohesive topos
play

The canonical intensive quality of a pre-cohesive topos Francisco - PowerPoint PPT Presentation

The canonical intensive quality of a pre-cohesive topos Francisco Marmolejo Instituto de Matem aticas Universidad Nacional Aut onoma de M exico Joint work with Mat as Menni Monday, July 17, 2017 The canonical intensive quality


  1. The canonical intensive quality of a pre-cohesive topos Francisco Marmolejo Instituto de Matem´ aticas Universidad Nacional Aut´ onoma de M´ exico Joint work with Mat´ ıas Menni Monday, July 17, 2017

  2. The canonical intensive quality of a pre-cohesive topos Francisco Marmolejo Instituto de Matem´ aticas Universidad Nacional Aut´ onoma de M´ exico Joint work with Mat´ ıas Menni Monday, July 17, 2017 and help from F.W. Lawvere

  3. Axiomatic Cohesion I. Categories of space as cohesive backgrounds II. Cohesion versus non-cohesion; quality types III. Extensive quality; intensive quality in its rarefied and condensed aspects; the canonical qualities form and substance IV. Non-cohesion within cohesion via constancy on infinitesimals V. The example of reflexive graphs and their atomic numbers VI. Sufficient cohesion and the Grothendieck condition VII. Weak generation of a subtopos by a quotient topos

  4. Axiomatic Cohesion I. Categories of space as cohesive backgrounds II. Cohesion versus non-cohesion; quality types III. Extensive quality; intensive quality in its rarefied and condensed aspects; the canonical qualities form and substance IV. Non-cohesion within cohesion via constancy on infinitesimals V. The example of reflexive graphs and their atomic numbers VI. Sufficient cohesion and the Grothendieck condition VII. Weak generation of a subtopos by a quotient topos “I look forward to further work on each of these aspects”

  5. Axiomatic Cohesion E and S are toposes.

  6. Axiomatic Cohesion E and S are toposes. p : E → S geometric morphism.

  7. Axiomatic Cohesion E and S are toposes. p : E → S geometric morphism. E is pre-cohesive over S if

  8. Axiomatic Cohesion E and S are toposes. p : E → S geometric morphism. E is pre-cohesive over S if E p ! p ! ⊣ p ∗ ⊣ p ∗ ⊣ S

  9. Axiomatic Cohesion E and S are toposes. p : E → S geometric morphism. E is pre-cohesive over S if E i) p ∗ full and faithful p ! p ! ⊣ p ∗ ⊣ p ∗ ⊣ S

  10. Axiomatic Cohesion E and S are toposes. p : E → S geometric morphism. E is pre-cohesive over S if E i) p ∗ full and faithful ii) p ! preserves finite products p ! p ! ⊣ p ∗ ⊣ p ∗ ⊣ S

  11. Axiomatic Cohesion E and S are toposes. p : E → S geometric morphism. E is pre-cohesive over S if E i) p ∗ full and faithful ii) p ! preserves finite products p ! iii) θ : p ∗ → p ! is epi p ! ⊣ p ∗ ⊣ p ∗ ⊣ S

  12. Axiomatic Cohesion E and S are toposes. p : E → S geometric morphism. E is pre-cohesive over S if E i) p ∗ full and faithful ii) p ! preserves finite products p ! iii) θ : p ∗ → p ! is epi p ! ⊣ p ∗ ⊣ p ∗ ⊣ (the Nullstellensatz) S

  13. Axiomatic Cohesion E and S are toposes. p : E → S geometric morphism. E is pre-cohesive over S if E i) p ∗ full and faithful ii) p ! preserves finite products p ! iii) θ : p ∗ → p ! is epi p ! ⊣ p ∗ ⊣ p ∗ ⊣ (the Nullstellensatz) S Continuity Axiom: iv) p ! ( E p ∗ S ) → ( p ! E ) S iso.

  14. Quality type E p : E → S is a quality type if p ∗ ⊣ p ∗ S

  15. Quality type E p : E → S is a quality type if p ∗ is full and faithful, p ∗ ⊣ p ∗ S

  16. Quality type E p : E → S is a quality type if p ∗ is full and faithful, p ! ⊣ p ∗ ⊣ p ∗ p ! ⊣ p ∗ exists S

  17. Quality type E p : E → S is a quality type if p ∗ is full and faithful, p ! ⊣ p ∗ ⊣ p ∗ p ! ⊣ p ∗ exists and θ : p ∗ → p ! is iso. S

  18. Quality type E p : E → S is a quality type if p ∗ is full and faithful, p ! ⊣ p ∗ ⊣ p ∗ p ! ⊣ p ∗ exists and θ : p ∗ → p ! is iso. S “A quality type is a category of cohesion in one extreme sense”

  19. Canonical Quality Type L the full subcategory of E of those objects X for which θ X : p ∗ → p ! is iso

  20. Canonical Quality Type L the full subcategory of E of those objects X for which θ X : p ∗ → p ! is iso s ∗ L E p ! p ! ⊣ p ∗ ⊣ p ∗ ⊣ S

  21. Canonical Quality Type Reflexive Graphs Sets

  22. Canonical Quality Type p ! connected components Reflexive Graphs p ! Sets

  23. Canonical Quality Type p ∗ p ! connected discrete components Reflexive Graphs p ! ⊣ p ∗ Sets

  24. Canonical Quality Type p ∗ p ! p ∗ connected discrete points components Reflexive Graphs p ! ⊣ p ∗ ⊣ p ∗ Sets

  25. Canonical Quality Type p ! p ∗ p ! p ∗ connected discrete points codiscrete components Reflexive Graphs p ! p ! ⊣ p ∗ ⊣ p ∗ ⊣ Sets

  26. Canonical Quality Type p ! p ∗ p ! p ∗ connected discrete points codiscrete components s ∗ Reflexive Graphs L p ! p ! ⊣ p ∗ ⊣ p ∗ ⊣ Sets

  27. Canonical Quality Type s ∗ L E p ! ⊣ p ∗ ⊣ p ∗ p ! ⊣ S

  28. Canonical Quality Type s ∗ L E p ! ⊣ p ∗ ⊣ p ∗ q ∗ p ! ⊣ S

  29. Canonical Quality Type s ∗ L E p ! s ∗ ⊣ p ∗ ⊣ p ∗ q ∗ p ! ⊣ E S

  30. Canonical Quality Type s ∗ L E p ! s ∗ ⊣ p ∗ ⊣ p ∗ q ∗ p ! ⊣ E p ! S

  31. Canonical Quality Type s ∗ L E s ∗ p ! s ∗ E ⊣ p ∗ ⊣ p ∗ q ∗ p ! ⊣ E p ! S

  32. Canonical Quality Type s ∗ L E s ∗ p ! s ∗ E ⊣ p ∗ ⊣ p ∗ p ∗ q ∗ p ! ⊣ E p ! S

  33. Theorem from Axiomatic Cohesion Theorem Any category of cohesion satisfying reasonable completeness conditions has a canonical intensive quality s whose codomain is the subcategory s ∗ : L → E consisting of those X for which the map θ X : p ∗ X → p ! X is an isomorphism. Moreover, s ∗ has a left adjoint s ! and a coproduct-preserving right adjoint s ∗ .

  34. Theorem from Axiomatic Cohesion Theorem Any category of cohesion satisfying reasonable completeness conditions has a canonical intensive quality s whose codomain is the subcategory s ∗ : L → E consisting of those X for which the map θ X : p ∗ X → p ! X is an isomorphism. Moreover, s ∗ has a left adjoint s ! and a coproduct-preserving right adjoint s ∗ . Thus L is a topos. (Algebras for a left exact comonad.)

  35. Reflexive Graphs Again Reflexive Graphs

  36. Reflexive Graphs Again s ∗ Reflexive Graphs L

  37. Reflexive Graphs Again s ! s ∗ ⊥ Reflexive Graphs L

  38. Reflexive Graphs Again s ! s ∗ ⊥ Reflexive Graphs L ⊥ s ∗

  39. Reflexive Graphs Again super-cooling s ! s ∗ ⊥ Reflexive Graphs L ⊥ s ∗

  40. Reflexive Graphs Again super-cooling s ! s ∗ ⊥ Reflexive Graphs L ⊥ s ∗ super-heating

  41. The Actual Construction of the Adjoints s ! : E → L . p ∗ θ X p ∗ p ∗ X p ∗ p ! X β X s ∗ s ! X X a pushout.

  42. The Actual Construction of the Adjoints For the right adjoint s ∗ : E → L we need φ : p ∗ → p ! . s ∗ s ∗ X X η X p ∗ p ∗ X p ! p ∗ X φ p ∗ X a pullback.

  43. Theorem Let p : E → S be an essential and local geometric morphism between toposes such that the Nullstellensatz holds. Then then the inclusion s ∗ : L → E of Leibniz objects has a right adjoint. It follows that L is a topos and p induces an hyperconnected essential geometric morphism s : E → L .

  44. Basically consequence of

  45. Basically consequence of Lemma If p : E → S satisfies the Nullstellensatz, then the image of s ∗ : L → E is closed under subobjects.

  46. Basically consequence of Lemma If p : E → S satisfies the Nullstellensatz, then the image of s ∗ : L → E is closed under subobjects. As a consequence s ∗ (Ω E ) = Ω L .

  47. � � � � � � � L in E . Proof. L ∈ L , m : X θ X p ∗ X p ! X p ∗ m p ! m ≃ p ∗ L p ! L θ L

  48. p : E → S essential and local. The Nullstellensatz holds.

  49. p : E → S essential and local. The Nullstellensatz holds. Lemma If X ∈ E is separated for the topology induced by p ∗ ⊣ p ! , then s ∗ s ∗ X is discrete.

  50. p : E → S essential and local. The Nullstellensatz holds. Lemma If X ∈ E is separated for the topology induced by p ∗ ⊣ p ! , then s ∗ s ∗ X is discrete. Lemma X ∈ E is Leibniz if and only if β X : p ∗ p ∗ X → X has a retraction.

  51. p : E → S essential and local. The Nullstellensatz holds. Lemma If X ∈ E is separated for the topology induced by p ∗ ⊣ p ! , then s ∗ s ∗ X is discrete. Lemma X ∈ E is Leibniz if and only if β X : p ∗ p ∗ X → X has a retraction. Lemma Let Ω be the subobject classifier of E . Then s ∗ s ∗ Ω is discrete if and only if p : E → S is an equivalence.

  52. Proposition Boolean objects in E are discrete. Thus, E Boolean implies that p : E → S is an equivalence.

  53. Proposition Boolean objects in E are discrete. Thus, E Boolean implies that p : E → S is an equivalence. Proposition L Boolean implies that p : E → S is an equivalence.

  54. Pre-cohesive presheaf topos C a small category whose idempotents split.

  55. Pre-cohesive presheaf topos C a small category whose idempotents split. Proposition p : Con C op → Con is precohesive if and only if C has a terminal object and every object has a point.

Recommend


More recommend