Ranks of $\mathcal{F}$-limits of filter sequences
Adam Kwela, Ireneusz Rec{\l}aw

TL;DR
This paper determines the exact rank of certain filter limits when the filter is Borel of rank 1, and explores how ranks of these limits can vary, including cases where ranks drop to 1.
Contribution
It provides exact calculations of filter ranks for Borel filters of rank 1 and estimates ranks of $$-limits, revealing they can decrease to 1 regardless of initial ranks.
Findings
Exact rank of $$-Fubini sum for Borel filters of rank 1
Ranks of $$-limits can be as low as 1
Filters of countable type and their ranks are analyzed
Abstract
We give an exact value of the rank of an -Fubini sum of filters for the case where is a Borel filter of rank . We also consider -limits of filters , which are of the form . We estimate the ranks of such filters; in particular we prove that they can fall to for as well as for of arbitrarily large ranks. At the end we prove some facts concerning filters of countable type and their ranks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
