Filter (mathematics)

related topics
{math, number, function}

In mathematics, a filter is a special subset of a partially ordered set. A frequently used special case is the situation that the ordered set under consideration is just the power set of some set, ordered by set inclusion. Filters appear in order and lattice theory, but can also be found in topology where they originate. The dual notion of a filter is an ideal.

Filters were introduced by Henri Cartan in 1937[1][2] and subsequently used by Bourbaki in their book Topologie Générale as an alternative to the similar notion of a net developed in 1922 by E. H. Moore and H. L. Smith.


General definition

A non-empty subset F of a partially ordered set (P,≤) is a filter if the following conditions hold:

While the above definition is the most general way to define a filter for arbitrary posets, it was originally defined for lattices only. In this case, the above definition can be characterized by the following equivalent statement: A non-empty subset F of a lattice (P,≤) is a filter, if and only if it is an upper set that is closed under finite meets (infima), i.e., for all x, y in F, we find that xy is also in F.

Full article ▸

related documents
Modular arithmetic
Countable set
Exclusive or
Complex analysis
XPath 1.0
Homological algebra
Partition (number theory)
Scope (programming)
Absolute convergence
Key size
Tychonoff's theorem
Galois theory
Natural transformation
Gaussian quadrature
Ordinary differential equation
Elliptic curve
IEEE 754-1985
Ideal class group
Normed vector space
Database normalization
Holomorphic function
Linear combination
Algebraic structure
J (programming language)
E (mathematical constant)
Fuzzy logic
Power series