(Joint question with Piotr Szewczak.)


**Definitions and notation.** By *filter* we mean a filter on $\omega$ containing the cofinite sets at least.


For a filter $\mathcal{F}$, let $\mathcal{F}^+:=\{A\subseteq\omega : A^c\notin \mathcal{F}\}$.


For an infinite set $A\subseteq\omega$ and a natural number $n$, define $\mathrm{next}(A,n)=\min\{k\in A:n<k\}$.


For natural numbers $m<n$, let $[m,n]:=\{m,m+1,\dots,n\}$.


**The question.** Which filters $\mathcal{F}$ we have the following property?


* For each $A\in \mathcal{F}^+$ and all $B\in \mathcal{F}$, the set
$C := \bigcup\{[n,\mathrm{next}(A,n)] : n \in A\cap B\}$
is in $\mathcal{F}$.


The Frechet filter (of all cofinite sets), and every ultrafilter, have this proeprty.


In particular, are there concrete examples of filters that
are not Frechet and not uf (and better not the above under
a finite-to-one map) but have this property?


**Update.** Blass and Brian provide below examples that are ultrafilters under finite-to-one maps. Our research developed in the meanwhile to see that we need examples that cannot be mapped to the Frechet filter or an ultrafilter by a finite-to-one function. Consistently, as Blass points out, there are no such examples (Filter Dichotomy), so the question is, for example, *what can be said if CH holds*? More concretely, how prevalent are such examples under CH? Are there "important" examples (i.e., not ones cooked up by transfinite induction for the purpose of the question).


Any other axioms relevant for a positive answer?



A property of the Frechet filter and every ultrafilter
The filters that you're looking for don't exist. Every filter with your property, other than the Frechet filter, maps to an ultrafilter via a finite-to-one map. Let's call the filters with your property *Szewczak-Tsaban filters*, or S-T filters for short.


**Theorem:** If $\mathcal F$ is an S-T filter other than the Frechet filter, then there is a finite-to-one map that sends $\mathcal F$ to an ultrafilter.


*Lemma:* Suppose $\mathcal F$ is an S-T filter and $B \in \mathcal F$. If $\mathcal F$ is not an ultrafilter, then $B-1 \in \mathcal F$.


*Proof:* Suppose $B \in \mathcal F$ and $B-1 \notin \mathcal F$, and suppose $\mathcal F$ is not an ultrafilter. We will show that $\mathcal F$ is not S-T. To do this, notice that $B \setminus (B-1) \in \mathcal F^+$. (In plain English, $B \setminus (B-1)$ is the set of right-hand endpoints of maximal subintervals of $B$). Using that $\mathcal F$ is not an ultrafilter, we can find some $A\_0 \subseteq B \setminus (B-1)$ with $A\_0 \in \mathcal F^+$ but $A\_0 \notin \mathcal F$. Let
$$A = A\_0 \cup (A\_0+1).$$
Now look at the definition of an S-T filter using these particular values of $A$ and $B$. The set $C$ that we get is precisely equal to $A\_0$, which is not in $\mathcal F$ by design. Thus $\mathcal F$ is not S-T. QED(lemma).


*Proof of theorem:* Fix a non-principal filter $\mathcal F$ other than the Frechet filter, and assume that $\mathcal F$ does not map to an ultrafilter by a finite-to-one map. We'll show $\mathcal F$ is not S-T. Because $\mathcal F$ is not Frechet, there is some infinite $D \subseteq \omega$ such that $\omega \setminus D \in \mathcal F$.


Partition $\omega$ into intervals as follows: if $n \in D$, then $[n,n]$ is in our partition, and we partition $\omega \setminus D$ into maximal intervals (which are all finite because $D$ is infinite). Let $\{I\_n : n \in \omega\}$ be an enumeration of this partition. Let $E\_0$ be the set of $n$ such that $I\_n$ is a maximal interval of $\omega \setminus D$. Notice that $\bigcup\_{n \in E\_0}I\_n = \omega \setminus D \in \mathcal F$.


Consider the finite-to-one map induced by this partition (i.e., the map that sends each element of $I\_n$ to $n$). By assumption, this map does not send $\mathcal F$ to an ultrafilter. Therefore there is some $E \subseteq E\_0$ such that $\bigcup\_{n \in E\_0}I\_n$ is in $\mathcal F^+$ but not $\mathcal F$.


Let $A = \bigcup\_{n \in E}I\_n$ and let
$$B = \left(\omega \setminus D\right) \cap \left(\left(\omega \setminus D\right)-1\right).$$
By our choice of $E$, we have $A \in \mathcal F^+$. By our lemma and our choice of $D$, we have $B \in \mathcal F$. Now plug this $A$ and $B$ into your definition of an S-T filter. You'll find that what pops out is precisely the set $A$. But by design, we have $A \notin \mathcal F$, so $\mathcal F$ is not S-T. **QED**


