[Merged by Bors] - feat(Mathlib/Order/PrimeSeparator): prime ideal separator in a bounded distributive lattice#12705
Closed
[Merged by Bors] - feat(Mathlib/Order/PrimeSeparator): prime ideal separator in a bounded distributive lattice#12705
Conversation
|
This PR/issue depends on: |
Vierkantor
reviewed
May 16, 2024
Vierkantor
reviewed
May 16, 2024
Vierkantor
reviewed
May 16, 2024
Vierkantor
approved these changes
May 16, 2024
Contributor
Vierkantor
left a comment
There was a problem hiding this comment.
Your proof is very nicely commented! It is slightly long for a typical Mathlib proof but there are no obvious intermediate results that I can suggest splitting off. So I think with a few tricks to achieve more powerful tactics this is good to go.
bors d+
Contributor
|
✌️ samvang can now approve this pull request. To approve and merge a pull request, simply reply with |
Co-authored-by: Anne Baanen <Vierkantor@users.noreply.github.com>
Contributor
Author
|
bors r+ |
mathlib-bors bot
pushed a commit
that referenced
this pull request
May 16, 2024
…d distributive lattice (#12705) We prove that a disjoint filter and ideal in a bounded distributive lattice can always be separated by a prime ideal. This is a step towards establishing Stone duality (currently in development here: https://github.com/samvang/StoneDualityInLean/) - [x] depends on: #12651 (ideals of sets are stable under directed unions and chains)
Contributor
|
Pull request successfully merged into master. Build succeeded: |
grunweg
pushed a commit
that referenced
this pull request
May 17, 2024
…d distributive lattice (#12705) We prove that a disjoint filter and ideal in a bounded distributive lattice can always be separated by a prime ideal. This is a step towards establishing Stone duality (currently in development here: https://github.com/samvang/StoneDualityInLean/) - [x] depends on: #12651 (ideals of sets are stable under directed unions and chains)
callesonne
pushed a commit
that referenced
this pull request
Jun 4, 2024
…d distributive lattice (#12705) We prove that a disjoint filter and ideal in a bounded distributive lattice can always be separated by a prime ideal. This is a step towards establishing Stone duality (currently in development here: https://github.com/samvang/StoneDualityInLean/) - [x] depends on: #12651 (ideals of sets are stable under directed unions and chains)
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
We prove that a disjoint filter and ideal in a bounded distributive lattice can always be separated by a prime ideal. This is a step towards establishing Stone duality (currently in development here: https://github.com/samvang/StoneDualityInLean/)