Skip to content
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

Merged
merged 12 commits into from
Jun 27, 2023
Merged

Smallest filter #915

merged 12 commits into from
Jun 27, 2023

Conversation

zstone1
Copy link
Contributor

@zstone1 zstone1 commented Apr 27, 2023

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 containing A.

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
  • added corresponding entries in CHANGELOG_UNRELEASED.md
  • added corresponding documentation in the headers
Compatibility with MathComp 2.0
  • I added the label TODO: HB port to make sure someone ports this PR to
    the 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.

@zstone1 zstone1 added enhancement ✨ This issue/PR is about adding new features enhancing the library TODO: MC2 port This PR must be ported to mathcomp 2 now that the. Remove this label when the port is done. labels Apr 27, 2023
Copy link
Member

@CohenCyril CohenCyril left a 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.

@@ -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).
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
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 with setT or with nonemptyness of X)

Copy link
Contributor Author

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.

@zstone1
Copy link
Contributor Author

zstone1 commented May 2, 2023

Thanks for the review. Turns out putting a setT in the definition of smallest_filter_stage solves these issues around having setT or not. I've also followed your thought, and now prove finI_from D f = \bigcup_n (smallest_filter_stage (f @ D) n)` which is a more flexible result.

@affeldt-aist affeldt-aist added this to the 0.6.3 milestone Jun 4, 2023
@affeldt-aist affeldt-aist modified the milestones: 0.6.3, 0.6.4 Jun 20, 2023
@zstone1 zstone1 requested a review from CohenCyril June 27, 2023 14:52
@CohenCyril CohenCyril merged commit 3d755ef into math-comp:master Jun 27, 2023
@zstone1 zstone1 mentioned this pull request Jun 27, 2023
2 tasks
affeldt-aist added a commit to affeldt-aist/analysis that referenced this pull request Jun 28, 2023
* various forms of smallest filters

Co-authored-by: Reynald Affeldt <reynald.affeldt@aist.go.jp>
proux01 pushed a commit to affeldt-aist/analysis that referenced this pull request Jul 8, 2023
* various forms of smallest filters

Co-authored-by: Reynald Affeldt <reynald.affeldt@aist.go.jp>
proux01 pushed a commit that referenced this pull request Jul 8, 2023
* various forms of smallest filters

Co-authored-by: Reynald Affeldt <reynald.affeldt@aist.go.jp>
@proux01 proux01 removed the TODO: MC2 port This PR must be ported to mathcomp 2 now that the. Remove this label when the port is done. label Jul 17, 2023
IshiguroYoshihiro pushed a commit to IshiguroYoshihiro/analysis that referenced this pull request Sep 7, 2023
* various forms of smallest filters


Co-authored-by: Reynald Affeldt <reynald.affeldt@aist.go.jp>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement ✨ This issue/PR is about adding new features enhancing the library
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants