basic facts about Gdelta sets#1615
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. |
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). |
Co-authored-by: IshiguroYoshihiro <jb.15r.1213@s.thers.ac.jp> Co-authored-by: Takafumi Saikawa <tscompor@gmail.com>
a2ffd60 to
0aa108b
Compare
|
I'll merge tomorrow if the CI is green unless there is new input. |
* basic facts about Gdelta sets -- Co-authored-by: IshiguroYoshihiro <jb.15r.1213@s.thers.ac.jp> Co-authored-by: Takafumi Saikawa <tscompor@gmail.com>
Motivation for this change
fyi @mkerjean (application of Baire)
@IshiguroYoshihiro
Checklist
CHANGELOG_UNRELEASED.mdReference: How to document
Merge policy
As a rule of thumb:
all compile are preferentially merged into master.
Reminder to reviewers