-
Notifications
You must be signed in to change notification settings - Fork 259
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[Merged by Bors] - feat(CategoryTheory): allow diagram chases by arguing up to refinements #7821
Conversation
Note: I have pushed an update to the lean toolchain because this PR was on a buggy version of the toolchain. WARNING: checking out old commits of this PR using v4.2.0-rc2 or v4.2.0-rc3 can cause |
arguing locally for a Grothendieck topology. It is even likely that | ||
it is a particular case (consider the canonical topology on | ||
the abelian category `C`). |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Do you want to turn this into a TODO? Or phrase it more directly as a question that can be investigated?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I have turned it into a TODO, with a more precise formulation.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks 🎉
bors merge
…ts (#7821) This PR introduces the most basic results which enable doing diagram chases in general abelian categories by arguing "up to refinements". Co-authored-by: Mario Carneiro <di.gama@gmail.com>
Pull request successfully merged into master. Build succeeded! The publicly hosted instance of bors-ng is deprecated and will go away soon. If you want to self-host your own instance, instructions are here. If you want to switch to GitHub's built-in merge queue, visit their help page. |
…ts (#7821) This PR introduces the most basic results which enable doing diagram chases in general abelian categories by arguing "up to refinements". Co-authored-by: Mario Carneiro <di.gama@gmail.com>
…ts (#7821) This PR introduces the most basic results which enable doing diagram chases in general abelian categories by arguing "up to refinements". Co-authored-by: Mario Carneiro <di.gama@gmail.com>
This PR introduces the most basic results which enable doing diagram chases in general abelian categories by arguing "up to refinements".
See also https://leanprover.zulipchat.com/#narrow/stream/335062-homology/topic/Diagram.20chases.20in.20general.20abelian.20categories