[Merged by Bors] - feat(CategoryTheory): Computable cartesian monoidal structure on slices induced by chosen pullbacks#31433
[Merged by Bors] - feat(CategoryTheory): Computable cartesian monoidal structure on slices induced by chosen pullbacks#31433sinhp wants to merge 118 commits intoleanprover-community:masterfrom
Conversation
Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
Co-authored-by: Joël Riou <37772949+joelriou@users.noreply.github.com>
We discussed this with @joelriou in #30366, and we decided to put these two files in this folder. Happy to hear what @joelriou thinks. My reservation about Yes, we have definition of LCCC in #30375. |
Co-authored-by: Dagur Asgeirsson <dagurtomas@gmail.com>
Co-authored-by: Dagur Asgeirsson <dagurtomas@gmail.com>
Co-authored-by: Dagur Asgeirsson <dagurtomas@gmail.com>
Co-authored-by: Dagur Asgeirsson <dagurtomas@gmail.com>
robin-carlier
left a comment
There was a problem hiding this comment.
The only remaining comments I have is about the characterizing lemmas for some def that can be added by using @[simps!]. Feel free to ignore if some of these ommisions were intentional.
Thanks!
maintainer delegate
|
🚀 Pull request has been placed on the maintainer queue by robin-carlier. |
|
Thanks 🎉 bors d+ |
|
✌️ sinhp can now approve this pull request. To approve and merge a pull request, simply reply with |
Co-authored-by: Robin Carlier <57142648+robin-carlier@users.noreply.github.com>
Co-authored-by: Robin Carlier <57142648+robin-carlier@users.noreply.github.com>
Co-authored-by: Robin Carlier <57142648+robin-carlier@users.noreply.github.com>
Co-authored-by: Robin Carlier <57142648+robin-carlier@users.noreply.github.com>
Co-authored-by: Robin Carlier <57142648+robin-carlier@users.noreply.github.com>
…long.lean Co-authored-by: Robin Carlier <57142648+robin-carlier@users.noreply.github.com>
bors r+ |
…es induced by chosen pullbacks (#31433) We provide for a category `C` with chosen pullbacks, a cartesian monoidal structure on the slice categories `Over X` for all objects `X : C`. We also show that the functor `pullback f : Over X ⥤ Over Y` is naturally isomorphic to `toOver (Over.mk f): Over X ⥤ Over (Over.mk f)` post-composed with the iterated slice equivalence `Over (Over.mk f) ⥤ Over Y`. This latter theorem will be crucial in relating closed objects in the slices to exponentiable morphisms in the base in `LocallyCartesianClosed.Basic.lean` (Here `toOver` is defined to be the computable analogue of the functor `Over.star`.) ```mermaid graph TD A[ChosenPullbackAlong.lean] --> A'[Over.lean] A' --> B[Sections.lean] A --> C[ExponentiableMorphism.lean] B --> D[Basic.lean] C --> D D --> E[Types.lean] E --> F[Presheaves.lean] D --> G[Beck-Chevalley.lean] %% Define highlight style classDef highlight fill:#ffe599,stroke:#d4a017,stroke-width:2px; %% Apply to one node class A' highlight; ``` Co-authored-by: Dagur Asgeirsson <dagurtomas@gmail.com>
|
Pull request successfully merged into master. Build succeeded: |
…es induced by chosen pullbacks (leanprover-community#31433) We provide for a category `C` with chosen pullbacks, a cartesian monoidal structure on the slice categories `Over X` for all objects `X : C`. We also show that the functor `pullback f : Over X ⥤ Over Y` is naturally isomorphic to `toOver (Over.mk f): Over X ⥤ Over (Over.mk f)` post-composed with the iterated slice equivalence `Over (Over.mk f) ⥤ Over Y`. This latter theorem will be crucial in relating closed objects in the slices to exponentiable morphisms in the base in `LocallyCartesianClosed.Basic.lean` (Here `toOver` is defined to be the computable analogue of the functor `Over.star`.) ```mermaid graph TD A[ChosenPullbackAlong.lean] --> A'[Over.lean] A' --> B[Sections.lean] A --> C[ExponentiableMorphism.lean] B --> D[Basic.lean] C --> D D --> E[Types.lean] E --> F[Presheaves.lean] D --> G[Beck-Chevalley.lean] %% Define highlight style classDef highlight fill:#ffe599,stroke:#d4a017,stroke-width:2px; %% Apply to one node class A' highlight; ``` Co-authored-by: Dagur Asgeirsson <dagurtomas@gmail.com>
…es induced by chosen pullbacks (leanprover-community#31433) We provide for a category `C` with chosen pullbacks, a cartesian monoidal structure on the slice categories `Over X` for all objects `X : C`. We also show that the functor `pullback f : Over X ⥤ Over Y` is naturally isomorphic to `toOver (Over.mk f): Over X ⥤ Over (Over.mk f)` post-composed with the iterated slice equivalence `Over (Over.mk f) ⥤ Over Y`. This latter theorem will be crucial in relating closed objects in the slices to exponentiable morphisms in the base in `LocallyCartesianClosed.Basic.lean` (Here `toOver` is defined to be the computable analogue of the functor `Over.star`.) ```mermaid graph TD A[ChosenPullbackAlong.lean] --> A'[Over.lean] A' --> B[Sections.lean] A --> C[ExponentiableMorphism.lean] B --> D[Basic.lean] C --> D D --> E[Types.lean] E --> F[Presheaves.lean] D --> G[Beck-Chevalley.lean] %% Define highlight style classDef highlight fill:#ffe599,stroke:#d4a017,stroke-width:2px; %% Apply to one node class A' highlight; ``` Co-authored-by: Dagur Asgeirsson <dagurtomas@gmail.com>
We provide for a category
Cwith chosen pullbacks, a cartesian monoidal structure on the slice categoriesOver Xfor all objectsX : C.We also show that the functor
pullback f : Over X ⥤ Over Yis naturally isomorphic totoOver (Over.mk f): Over X ⥤ Over (Over.mk f)post-composed with the iterated slice equivalenceOver (Over.mk f) ⥤ Over Y.This latter theorem will be crucial in relating closed objects in the slices to exponentiable morphisms in the base in
LocallyCartesianClosed.Basic.lean(Here
toOveris defined to be the computable analogue of the functorOver.star.)