# Definition:Filter on Set

## Definition

Let $S$ be a set.

Let $\powerset S$ denote the power set of $S$.

### Definition 1

A filter on $S$ (or filter of $S$) is a set $\FF \subset \powerset S$ which satisfies the following conditions:

 $(\text F 1)$ $:$ $\displaystyle S \in \FF$ $(\text F 2)$ $:$ $\displaystyle \O \notin \FF$ $(\text F 3)$ $:$ $\displaystyle U, V \in \FF \implies U \cap V \in \FF$ $(\text F 4)$ $:$ $\displaystyle \forall U \in \FF: U \subseteq V \subseteq S \implies V \in \FF$

### Definition 2

A filter on $S$ (or filter of $S$) is a set $\FF \subset \powerset S$ which satisfies the following conditions:

 $(\text F 1)$ $:$ $\displaystyle S \in \FF$ $(\text F 2)$ $:$ $\displaystyle \O \notin \FF$ $(\text F 3)$ $:$ $\displaystyle \forall n \in \N: U_1, \ldots, U_n \in \FF \implies \bigcap_{i \mathop = 1}^n U_i \in \FF$ $(\text F 4)$ $:$ $\displaystyle \forall U \in \FF: U \subseteq V \subseteq S \implies V \in \FF$

### Filtered Set

Let $\FF$ be a filter on $S$.

Then $S$ is said to be filtered by $\FF$, or just a filtered set.

### Trivial Filter

A filter $\FF$ on $S$ by definition specifically does not include the empty set $\O$.

If a filter $\FF$ were to include $\O$, then from Empty Set is Subset of All Sets it would follow that every subset of $S$ would have to be in $\FF$, and so $\FF = \powerset S$.

Such a "filter" is called the trivial filter on $S$.

## Also see

• Results about filters can be found here.