-
Notifications
You must be signed in to change notification settings - Fork 52
basic facts about Gdelta sets #1615
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
base: master
Are you sure you want to change the base?
Conversation
Why not parallelly formalize Fsigma sets too? |
like this affeldt-aist#40 |
Why not. We were just trying to keep the PR to a minimal to ease review. |
Co-authored-by: IshiguroYoshihiro <[email protected]>
43d8051
to
a2ffd60
Compare
The last commit moves the definition By the way, @IshiguroYoshihiro and I wanted to introduce these definitions because they are use in work in progress and since we proved a lemma using Baire and |
It looks short but a nice place for future additions, e.g., a generic definition of the borel hierarchy parametrized by a well-ordered set. Btw, there will be another demand for this PR from PR #1585 (by @motikaku), where perfect normality is introduced in terms of (sharp) Urysohn functions, but is planned to be related to Gdelta sets (Vedenissoff's theorem). |
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.
Looks good.
Motivation for this change
fyi @mkerjean (application of Baire)
@IshiguroYoshihiro
Checklist
CHANGELOG_UNRELEASED.md
Reference: How to document
Merge policy
As a rule of thumb:
all compile are preferentially merged into master.
Reminder to reviewers