Fréchet filter

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

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 $A$ of a set $X$ is said to be cofinite in $X$ if its complement in $X$ (i.e. the set $X ∖ A$ ) is finite. The Fréchet filter on $X$ , denoted by $F$ , is the set of all non-empty cofinite subsets of $X$ . That is:^[1]

F = {A \subseteq X : X ∖ A is finite and A \neq \emptyset}

.

If $X$ is not a finite set then every cofinite subset of $X$ is necessarily not empty so that in this case the definition becomes simply

F = {A \subseteq X : X ∖ A is finite}

.

This makes $F$ a filter on the lattice ( $P$ ( $X$ ), ⊆), the power set $P$ of $X$ with set inclusion, given that $S$ ^c denotes the complement of a set $S$ in $X$ , the following two conditions hold:

Intersection condition: If two sets are finitely complemented in $X$ , then so is their intersection, since $(A \cap B) c = A c \cup B c$ , and
Upper-set condition: If a set is finitely complemented in $X$ , then so are its supersets in $X$ .

Properties[]

If the base set $X$ is finite, then $F = P (X)$ since every subset of $X$ , and in particular every complement, is then finite. This case is sometimes excluded by definition or else called the improper filter on $X$ .^[2] Allowing $X$ 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 $X$ is infinite, then every member of $F$ is infinite since it is simply $X$ minus finitely many of its members. Additionally, $F$ is infinite since one of its subsets is the set of all { $x$ }^c, where $x \in X$ .

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) $X$ .

The Fréchet filter is not necessarily an ultrafilter (or maximal proper filter). Consider $= P (ℕ)$ , where $ℕ$ 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 $ℕ$ . However, an ultrafilter is free if and only if it includes the Fréchet filter. 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.^[3]

Examples[]

If $X$ is a finite set then the Fréchet filter on $X$ consists of all non-empty subsets of $X$ .

On the set $ℕ$ of natural numbers, the set of infinite intervals $B = { (n, \infty) : n \in ℕ$ } is a Fréchet filter base, i.e., the Fréchet filter on $ℕ$ consists of all supersets of elements of $B$ .^{[citation needed]}

References[]

^ "Cofinite filter". mathworld.wolfram.com.
^ Hodges, Wilfrid (2008). "Model Theory". Encyclopedia of Mathematics and its Applications. Cambridge University Press. p. 265. ISBN 978-0-521-06636-5.
^ Pinto, J. Sousa; Hoskins, R.F. (2004). Infinitesimal Methods for Mathematical Analysis. Mathematics and Applications Series. Horwood Publishing. p. 53. ISBN 978-1-898563-99-0.

External links[]

Weisstein, Eric W. "Cofinite Filter". MathWorld.
J.B. Nation, Notes on Lattice Theory, unpublished course notes available as two PDF files.

[1] "Cofinite filter". mathworld.wolfram.com.

[2] Hodges, Wilfrid (2008). "Model Theory". Encyclopedia of Mathematics and its Applications. Cambridge University Press. p. 265. ISBN 978-0-521-06636-5.

[3] Pinto, J. Sousa; Hoskins, R.F. (2004). Infinitesimal Methods for Mathematical Analysis. Mathematics and Applications Series. Horwood Publishing. p. 53. ISBN 978-1-898563-99-0.

[1]

[2]

[3]

hide v t Mathematics (areas of mathematics)
Foundations	Category theory Information theory Mathematical logic Philosophy of mathematics Set theory Type theory
Algebra	Abstract Commutative Elementary Group theory Linear Multilinear Universal Homological
Analysis	Calculus Real analysis Complex analysis Differential equations Functional analysis Harmonic analysis Measure theory
Discrete	Combinatorics Graph theory Order theory Game theory
Geometry	Algebraic Analytic Differential Discrete Euclidean Finite
Number theory	Arithmetic Algebraic number theory Analytic number theory Diophantine geometry
Topology	General Algebraic Differential Geometric Homotopy theory
Applied	Control theory Mathematical biology Mathematical chemistry Mathematical economics Mathematical finance Mathematical physics Mathematical psychology Mathematical sociology Mathematical statistics Operations research Probability Statistics
Computational	Computer science Theory of computation Computational complexity theory Numerical analysis Optimization Computer algebra
Related topics	History of mathematics Recreational mathematics Mathematics and art Mathematics education
Category Portal Commons WikiProject