-
Notifications
You must be signed in to change notification settings - Fork 49
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
Smallest filter #915
Smallest filter #915
Conversation
1ffcedd
to
5dfdd52
Compare
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 for the contribution. The results are definitely useful. I have a few questions & comments though.
theories/topology.v
Outdated
@@ -2133,6 +2180,25 @@ move=> ?; apply: (card_le_trans (card_image_le _ _)). | |||
exact: fset_subset_countable. | |||
Qed. | |||
|
|||
Lemma smallest_filter_finI {T : choiceType} (D : set T) f : | |||
D!=set0 -> filter_from (finI_from D f) id = smallest (@Filter T) (f @` D). |
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.
D!=set0 -> filter_from (finI_from D f) id = smallest (@Filter T) (f @` D). | |
D !=set0 -> filter_from (finI_from D f) id = smallest (@Filter T) (f @` D). |
Also.
Could this be decomposed into:
filter_from D f = smallest superset_closed (f @
D)`finI_from D f = smallest finI_closed (f @
D)`smallest Filter X = setT
|smallest superset_closed (smallest finI_closed X)
? (and maybe other variations withsetT
or with nonemptyness ofX
)
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.
Probably yes. I just proved the relationship I needed for my Urysohn's Lemma stuff. But these other variants are likely helpful elsewhere (E.G. with the sup topology). I'd rather add them in a separate PR, though.
Thanks for the review. Turns out putting a |
* various forms of smallest filters Co-authored-by: Reynald Affeldt <reynald.affeldt@aist.go.jp>
* various forms of smallest filters Co-authored-by: Reynald Affeldt <reynald.affeldt@aist.go.jp>
* various forms of smallest filters Co-authored-by: Reynald Affeldt <reynald.affeldt@aist.go.jp>
* various forms of smallest filters Co-authored-by: Reynald Affeldt <reynald.affeldt@aist.go.jp>
Motivation for this change
Splitting up the boring part of #900, this just shows that the following are all equivalent
Smallest filter F
filter_from (\bigcup_n (smallest_filter_stage F n))
(E.G. set of all pairwise intersections)filter_from (finI_from F)
It also adds a notion of
set_nbhs A
, which is the filter from all open sets containingA
.I also added a gitignore for the
tools
repo. Is this correct? If not, how else am I supposed to use the changelog generator?Things done/to do
CHANGELOG_UNRELEASED.md
Compatibility with MathComp 2.0
TODO: HB port
to make sure someone ports this PR tothe
hierarchy-builder
branch or I already opened an issue or PR (please cross reference).Automatic note to reviewers
Read this Checklist and put a milestone if possible.