Skip to content
November 24, 2009 / porton

Open problem: Pseudodifference of filters

Let {U} is a set. A filter {\mathcal{F}} (on {U}) is a non-empty set of subsets of {U} such that {A, B \in \mathcal{F} \Leftrightarrow A \cap B \in \mathcal{F}}. Note that unlike some other authors I do not require {\emptyset \notin \mathcal{F}}.

I will call the set of filter objects the set of filters ordered reverse to set theoretic inclusion of filters, with principal filters equated to the corresponding sets. See here for the formal definition of filter objects. I will denote {(\mathrm{up} a)} the filter corresponding to a filter object {a}. I will denote the set of filter objects (on {U}) as {\mathfrak{F}}.

I will denote {(\mathrm{atoms} a)} the set of atomic lattice elements under a given lattice element {a}. If {a} is a filter object, then {(\mathrm{atoms} a)} is essentially the set of ultrafilters over {a}.

Problem Which of the following expressions are pairwise equal for all {a, b \in \mathfrak{F}} for each set {U}? (If some are not equal, provide counter-examples.)

  1. {\bigcap^{\mathfrak{F}} \left\{ z \in \mathfrak{F} | a \subseteq b \cup^{\mathfrak{F}} z \right\}};
  2. {\bigcup^{\mathfrak{F}} \left\{ z \in \mathfrak{F} | z \subseteq a \wedge z \cap^{\mathfrak{F}} b = \emptyset \right\}};
  3. {\bigcup^{\mathfrak{F}} (\mathrm{atoms} a \setminus \mathrm{atoms} b)};
  4. {\bigcup^{\mathfrak{F}} \left\{ a \cap^{\mathfrak{F}} (U\setminus B) | B \in \mathrm{up} b \right\}}.
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: