Filter on a set explained

In mathematics, a filter on a set is a family of subsets which is closed under supersets and finite intersections. The concept originates in topology, where the neighborhoods of a point form a filter on the space. Filters were introduced by Henri Cartan in 1937 and, as described in the article dedicated to filters in topology, they were subsequently used by Nicolas Bourbaki in their book Topologie Générale as an alternative to the related notion of a net developed in 1922 by E. H. Moore and Herman L. Smith. They have also found applications in model theory and set theory.

Filters on a set were later generalized to order filters. Specifically, a filter on a set

X

is an order filter on the power set of

X

ordered by inclusion.

The notion dual to a filter is an ideal. Ultrafilters are a particularly important subclass of filters.

Definition

Given a set

X

, a filter

l{F}

on

X

is a set of subsets of

X

such that:

l{F}

is upwards-closed: If

A,B\subseteqX

are such that

A\inl{F}

and

A\subseteqB

then

B\inl{F}

,

l{F}

is closed under finite intersections:

X\inl{F}

,, and if

A\inl{F}

and

B\inl{F}

then

A\capB\inl{F}

.

A (or non-degenerate) filter is a filter which is proper as a subset of the powerset

l{P}(X)

(i.e., the only improper filter is

l{P}(X)

, consisting of all possible subsets). By upwards-closure, a filter is proper if and only if it does not contain the empty set. Many authors adopt the convention that a filter must be proper by definition.

When

l{F}

and

l{G}

are two filters on the same set such that

l{F}\subseteql{G}

holds,

l{F}

is said to be coarser than

l{G}

(or a subfilter of

l{G}

) while

l{G}

is said to be finer than

l{F}

(or to

l{F}

or a superfilter of

l{F}

).

Examples

l{F}=\{X\}

is called the trivial or indiscrete filter on

X

.

Y

is a subset of

X

, the subsets of

X

which are supersets of

Y

form a principal filter.

X

is a topological space and

x\inX

, then the set of neighborhoods of

x

is a filter on

X

, the neighborhood filter or vicinity filter of

x

.

X

is a set, the set of all cofinite subsets of

X

(i.e., those sets whose complement in

X

is finite) is a filter on

X

, the Fréchet filter (or cofinite filter).

X

is a set, the cocountable subsets of

X

(those whose complement is countable) form a filter, the cocountable filter which is finer than the Fréchet filter. More generally, for any cardinal

\kappa

, the subsets whose complement has cardinal at most

\kappa

form a filter.

X

is a metric space, e.g.,

\Rn

, the co-bounded subsets of

X

(those whose complement is bounded set) form a filter on

X

.

X

is a complete measure space (e.g.,

\Rn

with the Lebesgue measure), the conull subsets of

X

, i.e., the subsets whose complement has measure zero, form a filter on

X

. (For a non-complete measure space, one can take the subsets which, while not necessarily measurable, are contained in a measurable subset of measure zero.)

X

is a measure space, the subsets whose complement is contained in a measurable subset of finite measure form a filter on

X

.

X

is a topological space, the comeager subsets of

X

, i.e., those whose complement is meager, form a filter on

X

.

N

which have a natural density of 1 form a filter on

N

.[1]

\kappa

is the filter of all sets containing a club subset of

\kappa

.

(l{F}i)i

is a family of filters on

X

and

l{J}

is a filter on

I

then

cupA

} \bigcap_ \mathcal_i is a filter on

X

called Kowalsky's filter.

Principal and free filters

The kernel of a filter

l{F}

on

X

is the intersection of all the subsets of

X

in

l{F}

.

A filter

l{F}

on

X

is principal (or atomic) when it has a particularly simple form: it contains exactly the supersets of

Y

, for some fixed subset

Y\subseteqX

. When

Y=\varnothing

, this yields the improper filter. When

Y=\{y\}

is a singleton, this filter (which consists of all subsets that contain

y

) is called the fundamental filter (or discrete filter) associated with

y

.

A filter

l{F}

is principal if and only if the kernel of

l{F}

is an element of

l{F}

, and when this is the case,

l{F}

consists of the supersets of its kernel. On a finite set, every filter is principal (since the intersection defining the kernel is finite).

A filter is said to be free when it has empty kernel, otherwise it is fixed (and if

x

is an element of the kernel, it is fixed by

x

). A filter on a set

X

is free if and only if it contains the Fréchet filter on

X

.

Two filters

l{F}1

and

l{F}2

on

X

mesh when every member of

l{F}1

intersects every member of

l{F}2

. For every filter

l{F}

on

X

, there exists a unique pair of filters

l{F}f

(the free part of

l{F}

) and

l{F}p

(the principal part of

l{F}

) on

X

such that

l{F}f

is free,

l{F}p

is principal,

l{F}f\capl{F}p=l{F}

, and

l{F}p

does not mesh with

l{F}f

. The principal part

l{F}p

is the principal filter generated by the kernel of

l{F}

, and the free part

l{F}f

consists of elements of

l{F}

with any number of elements from the kernel possibly removed.

A filter

l{F}

is countably deep if the kernel of any countable subset of

l{F}

belongs to

l{F}

.

Correspondence with order filters

P

is a subset

l{F}

of

P

which is upwards-closed (if

x\inl{F}

and

x\leqy

then

y\inl{F}

) and downwards-directed (every finite subset of

l{F}

has a lower bound in

l{F}

). A filter on a set

X

is the same as a filter on the powerset

l{P}(X)

ordered by inclusion.

Constructions of filters

Intersection of filters

If

(l{F}i)i

is a family of filters on

X

, its intersection

capil{F}i

is a filter on

X

. The intersection is a greatest lower bound operation in the set of filters on

X

partially ordered by inclusion, which endows the filters on

X

with a complete lattice structure.

The intersection

capil{F}i

consists of the subsets which can be written as

cupiAi

where

Ai\inl{F}i

for each

i\inI

.

Filter generated by a family of subsets

Given a family of subsets

l{S}\subseteql{P}(X)

, there exists a minimum filter on

X

(in the sense of inclusion) which contains

l{S}

. It can be constructed as the intersection (greatest lower bound) of all filters on

X

containing

l{S}

. This filter

\langlel{S}\rangle

is called the filter generated by

l{S}

, and

l{S}

is said to be a filter subbase of

\langlel{S}\rangle

.

The generated filter can also be described more explicitly:

\langlel{S}\rangle

is obtained by closing

l{S}

under finite intersections, then upwards, i.e.,

\langlel{S}\rangle

consists of the subsets

Y\subseteqX

such that

A0\cap...\capAn-1\subseteqY

for some

A0,...,An-1\inl{B}

.

Since these operations preserve the kernel, it follows that

\langlel{S}\rangle

is a proper filter if and only if

l{S}

has the finite intersection property: the intersection of a finite subfamily of

l{S}

is non-empty.

In the complete lattice of filters on

X

ordered by inclusion, the least upper bound of a family of filters

(l{F}i)i

is the filter generated by

cupil{F}i

.

Two filters

l{F}1

and

l{F}2

on

X

mesh if and only if

\langlel{F}1\cupl{F}2\rangle

is proper.

Filter bases

Let

l{F}

be a filter on

X

. A filter base of

l{F}

is a family of subsets

l{B}\subseteql{P}(X)

such that

l{F}

is the upwards closure of

l{B}

, i.e.,

l{F}

consists of those subsets

Y\subseteqX

for which

A\subseteqY

for some

A\inl{B}

.

This upwards closure is a filter if and only if

l{B}

is downwards-directed, i.e.,

l{B}

is non-empty and for all

A,B\inl{B}

there exists

C\inl{B}

such that

C\subseteqA\capB

. When this is the case,

l{B}

is also called a prefilter, and the upwards closure is also equal to the generated filter

\langlel{B}\rangle

. Hence, being a filter base of

l{F}

is a stronger property than being a filter subbase of

l{F}

.

Examples

X

is a topological space and

x\inX

, a filter base of the neighborhood filter of

x

is known as a neighborhood base for

x

, and similarly, a filter subbase of the neighborhood filter of

x

is known as a neighborhood subbase for

x

. The open neighborhoods of

x

always form a neighborhood base for

x

, by definition of the neighborhood filter. In

X=\Rn

, the closed balls of positive radius around

x

also form a neighborhood base for

x

.

X

be an infinite set and let

l{F}

consist of the subsets of

X

which contain all points but one. Then

l{F}

is a filter subbase of the Fréchet filter on

X

, which consists of the cofinite subsets. Its closure under finite intersections is the entire Fréchet filter, but there are smaller bases of the Fréchet filter which contain the subbase

l{F}

, such as the one formed by the subsets of

X

which contain all points but a finite odd number. In fact, for every base of the Fréchet filter, removing any subset yields another base of the Fréchet filter.

X

is a topological space, the dense open subsets of

X

form a filter base on

X

, because they are closed under finite intersection. The filter they generate consists of the complements of nowhere dense subsets. On

X=\Rn

, restricting to the null dense open subsets yields another filter base for the same filter.

X

is a topological space, the countable intersections of dense open subsets form a filter base which generates the filter of comeager subsets.

X

be a set and let

(xi)i

be a net with values in

X

, i.e., a family whose domain

I

is a directed set. The filter base of tails of

(xi)

consists of the sets

\{xj,j\geqi\}

for

i\inI

; it is downwards-closed by directedness of

I

. The generated filter is called the eventuality filter or filter of tails of

(xn)

. A sequential filter or is a filter which is the eventuality filter of some net. This example is fundamental in the application of filters in topology.

Trace of a filter on a subset

If

l{F}

is a filter on

X

and

Y\subseteqX

, the trace of

l{F}

on

Y

is

\{A\capY,A\inl{F}\}

, which is a filter.

Image of a filter by a function

Let

f:X\toY

be a function.

When

l{F}

is a family of subsets of

X

, its image by

f

is defined as

f(\mathcal) = \

The image filter by

f

of a filter

l{F}

on

X

is defined as the generated filter

\langlef(l{F})\rangle

. If

f

is surjective, then

f(l{F})

is already a filter. In the general case,

f(l{F})

is a filter base and hence

\langlef(l{F})\rangle

is its upwards closure. Furthermore, if

l{B}

is a filter base of

l{F}

then

f(l{B})

is a filter base of

\langlef(l{F})\rangle

.

The kernels of

l{F}

and

\langlef(l{F})\rangle

are linked by

f\left(capl{F}\right)\subseteqcap\langlef(l{F})\rangle

.

Product of filters

Given a family of sets

(Xi)i

and a filter

l{F}i

on each

Xi

, the product filter

\prodil{F}i

on the product set

\prodiXi

is defined as the filter generated by the sets
-1
\pi
i

(A)

for

i\inI

and

A\inl{F}i

, where

\pii:\left(\prodjXj\right)\toXi

is the projection from the product set onto the

i

-th component. This construction is similar to the product topology.

If each

l{B}i

is a filter base on

l{F}i

, a filter base of

\prodil{F}i

is given by the sets

\prodiAi

where

(Ai)

is a family such that

Ai\inl{F}i

for all

i\inI

and

Ai=Xi

for all but finitely many

i\inI

.

See also

References

Notes and References

  1. Book: Jech, Thomas. Thomas Jech. Set Theory: The Third Millennium Edition, Revised and Expanded. Springer Science & Business Media. Berlin New York. 2006. 978-3-540-44085-7. 50422939. 74.

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Filter on a set".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2026, A B Cryer, All Rights Reserved. Cookie policy.