Definition 1
Tag 0B3X, permanent. Cite it as [Bourbaki, Tag 0B3X].
General Topology, chapter I, § 6. Filters
A filter on a set is a set of subsets of which has the following properties:
Every subset of which contains a set of belongs to . Every finite intersection of sets of belongs to . The empty set is not in .
It follows from and that every finite intersection of sets of is non-empty.
A filter on defines a structure on , the axioms of which are , and ; this structure is called a structure of a filtered set, and the set endowed with this structure is called a set filtered by .
Axiom is equivalent to the conjunction of the following two axioms: The intersection of two sets of belongs to . belongs to .
Axioms and show that there is no filter on the empty set.
In order for a set of subsets which satisfies also to satisfy it is necessary and sufficient that it is not empty. A set of subsets which satisfies also satisfies if and only if it is different from .
Examples of filters. 1) If , the set of subsets consisting of alone is a filter on . More generally, the set of all subsets of which contain a given non-empty subset of is a filter on .
2) In a topological space , the set of all neighbourhoods of an arbitrary non-empty subset of (and in particular the set of all neighbourhoods of a point of ) is a filter, called the neighbourhood filter of .
3) If is an infinite set, the complements of the finite subsets of are the elements of a filter. The filter of complements of finite subsets of the set of integers is called the Fréchet filter.
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.
Cited by
Nothing.
Cites
Nothing.