This repository was archived by the owner on Jul 24, 2024. It is now read-only.
feat(topology/order/scott): Introduce the Scott topology on a preorder#18448
Closed
feat(topology/order/scott): Introduce the Scott topology on a preorder#18448
Conversation
Co-authored-by: Eric Wieser <wieser.eric@gmail.com>
eric-wieser
reviewed
Feb 20, 2023
eric-wieser
reviewed
Feb 20, 2023
eric-wieser
reviewed
Feb 20, 2023
eric-wieser
reviewed
Feb 20, 2023
eric-wieser
reviewed
Feb 20, 2023
alexjbest
reviewed
Feb 20, 2023
alexjbest
reviewed
Feb 20, 2023
alexjbest
reviewed
Feb 20, 2023
alexjbest
reviewed
Feb 20, 2023
src/topology/order/scott.lean
Outdated
| end, | ||
| rw with_scott_topology.is_open_eq_upper_and_lub_mem_implies_inter_nonempty at hu, | ||
| have e2: ((f '' d) ∩ u).nonempty := | ||
| begin |
Member
There was a problem hiding this comment.
probably you can use show_term {} to turn this whole block into a 1-liner
Collaborator
Author
There was a problem hiding this comment.
@alexjbest Do you mean:
have e2: ((f '' d) ∩ u).nonempty,
show_term { sorry, },
? How do I know what tatic to replace sorry with? There don't seem to be any examples of use of show_term in mathlib outside of tatics.
Co-authored-by: Alex J Best <alex.j.best@gmail.com>
Co-authored-by: Alex J Best <alex.j.best@gmail.com>
Co-authored-by: Alex J Best <alex.j.best@gmail.com>
Collaborator
|
All prerequisites are ported. Would you mind closing this PR and reopening it on the mathlib4 side, so that we have one less file to port? |
Collaborator
Author
Sure! |
3 tasks
Collaborator
Author
|
PR opened (needs more work) leanprover-community/mathlib4#2508 |
bors bot
pushed a commit
that referenced
this pull request
Apr 20, 2023
We prove an insert result for directed sets when the relation is reflexive. This is then used to show that a Scott continuous function is monotone. This result is required in the [construction of the Scott topology on a preorder](leanprover-community/mathlib4#2508) (see also #18448). Holding PR for mathlib4: leanprover-community/mathlib4#2543 Co-authored-by: Christopher Hoskin <mans0954@users.noreply.github.com> Co-authored-by: Eric Wieser <wieser.eric@gmail.com>
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 subscribe to this conversation on GitHub.
Already have an account?
Sign in.
5 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.
Introduces the Scott topology on a preorder, defined in terms of directed sets.
There is already a related notion of Scott topology defined in
topology.omega_complete_partial_order, where it is defined on ω-complete partial orders in terms of ω-chains. In some circumstances the definition given here coincides with that given intopology.omega_complete_partial_orderbut in general they are different. Abramsky and Jung ([Domain Theory, 2.2.4][abramsky_gabbay_maibaum_1994]) argue that the ω-chain approach has pedagogical advantages, but the directed sets approach is more appropriate as a theoretical foundation.