Fréchet filter

In mathematics, the Fréchet filter, also called the cofinite filter, on a set [math]\displaystyle{ X }[/math] is a certain collection of subsets of [math]\displaystyle{ X }[/math] (that is, it is a particular subset of the power set of [math]\displaystyle{ X }[/math]). A subset [math]\displaystyle{ F }[/math] of [math]\displaystyle{ X }[/math] belongs to the Fréchet filter if and only if the complement of [math]\displaystyle{ F }[/math] in [math]\displaystyle{ X }[/math] is finite. Any such set [math]\displaystyle{ F }[/math] is said to be cofinite in [math]\displaystyle{ X }[/math], which is why it is alternatively called the cofinite filter on [math]\displaystyle{ X }[/math].

The Fréchet filter is of interest in topology, where filters originated, and relates to order and lattice theory because a set's power set is a partially ordered set under set inclusion (more specifically, it forms a lattice). The Fréchet filter is named after the French mathematician Maurice Fréchet (1878-1973), who worked in topology.

Definition

A subset [math]\displaystyle{ A }[/math] of a set [math]\displaystyle{ X }[/math] is said to be cofinite in [math]\displaystyle{ X }[/math] if its complement in [math]\displaystyle{ X }[/math] (that is, the set [math]\displaystyle{ X \setminus A }[/math]) is finite. If the empty set is allowed to be in a filter, the Fréchet filter on [math]\displaystyle{ X }[/math], denoted by [math]\displaystyle{ F. }[/math] is the set of all cofinite subsets of [math]\displaystyle{ X }[/math]. That is: [math]\displaystyle{ F = \{A \subseteq X : X \setminus A \; \text{ is finite }\}. }[/math]

If [math]\displaystyle{ X }[/math] is not a finite set, then every cofinite subset of [math]\displaystyle{ X }[/math] is necessarily not empty, so that in this case, it is not necessary to make the empty set assumption made before. [math]\displaystyle{ F = \{A \subseteq X : X \setminus A \; \text{ is finite }\}. }[/math]

This makes [math]\displaystyle{ F }[/math] a filter on the lattice [math]\displaystyle{ (\wp(X), \subseteq), }[/math] the power set [math]\displaystyle{ \wp(X) }[/math] of [math]\displaystyle{ X }[/math] with set inclusion, given that [math]\displaystyle{ S^{\operatorname{C}} }[/math] denotes the complement of a set [math]\displaystyle{ S }[/math] in [math]\displaystyle{ X. }[/math] the following two conditions hold:

Intersection condition

If two sets are finitely complemented in [math]\displaystyle{ X. }[/math] then so is their intersection, since [math]\displaystyle{ (A \cap B)^{\operatorname{C}} = A^{\operatorname{C}} \cup B^{\operatorname{C}}, }[/math] and

Upper-set condition

If a set is finitely complemented in [math]\displaystyle{ X. }[/math] then so are its supersets in [math]\displaystyle{ X }[/math].

Properties

If the base set [math]\displaystyle{ X }[/math] is finite, then [math]\displaystyle{ F = \wp(X) }[/math] since every subset of [math]\displaystyle{ X. }[/math] and in particular every complement, is then finite. This case is sometimes excluded by definition or else called the improper filter on [math]\displaystyle{ X. }[/math] Allowing [math]\displaystyle{ X }[/math] to be finite creates a single exception to the Fréchet filter's being free and non-principal since a filter on a finite set cannot be free and a non-principal filter cannot contain any singletons as members.

If [math]\displaystyle{ X }[/math] is infinite, then every member of [math]\displaystyle{ F }[/math] is infinite since it is simply [math]\displaystyle{ X }[/math] minus finitely many of its members. Additionally, [math]\displaystyle{ F }[/math] is infinite since one of its subsets is the set of all [math]\displaystyle{ \{x\}^{\operatorname{C}}, }[/math] where [math]\displaystyle{ x \in X. }[/math]

The Fréchet filter is both free and non-principal, excepting the finite case mentioned above, and is included in every free filter. It is also the dual filter of the ideal of all finite subsets of (infinite) [math]\displaystyle{ X }[/math].

The Fréchet filter is not necessarily an ultrafilter (or maximal proper filter). Consider the power set [math]\displaystyle{ \wp(\N), }[/math] where [math]\displaystyle{ \N }[/math] is the natural numbers. The set of even numbers is the complement of the set of odd numbers. Since neither of these sets is finite, neither set is in the Fréchet filter on [math]\displaystyle{ \N. }[/math] However, an ultrafilter (an any other non-degenerate filter) is free if and only if it includes the Fréchet filter. The ultrafilter lemma states that every non-degenerate filter is contained in some ultrafilter. The existence of free ultrafilters was established by Tarski in 1930, relying on a theorem equivalent to the axiom of choice and is used in the construction of the hyperreals in nonstandard analysis.

Examples

If [math]\displaystyle{ X }[/math] is a finite set, assuming that the empty set can be in a filter, then the Fréchet filter on [math]\displaystyle{ X }[/math] consists of all the subsets of [math]\displaystyle{ X }[/math].

On the set [math]\displaystyle{ \N }[/math] of natural numbers, the set of infinite intervals [math]\displaystyle{ B = \{(n, \infty) : n \in \N\} }[/math] is a Fréchet filter base, that is, the Fréchet filter on [math]\displaystyle{ \N }[/math] consists of all supersets of elements of [math]\displaystyle{ B }[/math].

See also

• Boolean prime ideal theorem – Ideals in a Boolean algebra can be extended to prime ideals
• Filter (mathematics) – In mathematics, a special subset of a partially ordered set
• Filter (set theory) – Family of sets representing "large" sets
• Filters in topology – Use of filters to describe and characterize all basic topological notions and results.
• Ultrafilter – Maximal proper filter

External links

• Weisstein, Eric W.. "Cofinite Filter". http://mathworld.wolfram.com/CofiniteFilter.html. 
• J.B. Nation, Notes on Lattice Theory, course notes, revised 2017.