Filter on a set
Template:Short description Script error: No such module "For". Script error: No such module "other uses". 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 1937Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. 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 is an order filter on the power set of ordered by inclusion.
The notion dual to a filter is an ideal. Ultrafilters are a particularly important subclass of filters.
Definition
Given a set , a filter on is a set of subsets of such that:Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
- is upwards-closed: If are such that and then ,
- is closed under finite intersections: ,[a], and if and then .
A Page Template:Visible anchor/styles.css has no content.proper (or non-degenerate) filter is a filter which is proper as a subset of the powerset (i.e., the only improper filter is , consisting of all possible subsets). By upwards-closure, a filter is proper if and only if it does not contain the empty set.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. Many authors adopt the convention that a filter must be proper by definition.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
When and are two filters on the same set such that holds, is said to be coarserLua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. than (or a subfilter of ) while is said to be finerLua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. than (or Page Template:Visible anchor/styles.css has no content.subordinate to or a superfilterLua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. of ).
Examples
- The singleton set is called the trivial or indiscrete filter on .Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
- If is a subset of , the subsets of which are supersets of form a principal filter.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
- If is a topological space and , then the set of neighborhoods of is a filter on , the neighborhood filterLua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. or vicinity filterLua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. of .
- Many examples arise from various "largeness" conditions:
- If is a set, the set of all cofinite subsets of (i.e., those sets whose complement in is finite) is a filter on , the Fréchet filterLua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. (or cofinite filterLua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.).
- Similarly, if is a set, the cocountable subsets of (those whose complement is countable) form a filter, the cocountable filterLua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. which is finer than the Fréchet filter. More generally, for any cardinal , the subsets whose complement has cardinal at most form a filter.
- If is a metric space, e.g., , the co-bounded subsets of (those whose complement is bounded set) form a filter on .Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
- If is a complete measure space (e.g., with the Lebesgue measure), the conull subsets of , i.e., the subsets whose complement has measure zero, form a filter on . (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.)
- Similarly, if is a measure space, the subsets whose complement is contained in a measurable subset of finite measure form a filter on .
- If is a topological space, the comeager subsets of , i.e., those whose complement is meager, form a filter on .
- The subsets of which have a natural density of 1 form a filter on .[1]
- The club filter of a regular uncountable cardinal is the filter of all sets containing a club subset of .
- If is a family of filters on and is a filter on then is a filter on called Kowalsky's filter.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
Principal and free filters
The kernel of a filter on is the intersection of all the subsets of in .
A filter on is principalLua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. (or atomicLua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.) when it has a particularly simple form: it contains exactly the supersets of , for some fixed subset . When , this yields the improper filter. When is a singleton, this filter (which consists of all subsets that contain ) is called the fundamental filterLua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. (or discrete filterLua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.) associated with .
A filter is principal if and only if the kernel of is an element of , and when this is the case, consists of the supersets of its kernel.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. 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 is an element of the kernel, it is fixed by ).Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. A filter on a set is free if and only if it contains the Fréchet filter on .Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
Two filters and on mesh when every member of intersects every member of .Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. For every filter on , there exists a unique pair of filters (the free part of ) and (the principal part of ) on such that is free, is principal, , and does not mesh with . The principal part is the principal filter generated by the kernel of , and the free part consists of elements of with any number of elements from the kernel possibly removed.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
A filter is countably deep if the kernel of any countable subset of belongs to .Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
Correspondence with order filters
The concept of a filter on a set is a special case of the more general concept of a filter on a partially ordered set. By definition, a filter on a partially ordered set is a subset of which is upwards-closed (if and then ) and downwards-directed (every finite subset of has a lower bound in ). A filter on a set is the same as a filter on the powerset ordered by inclusion.[b]
Constructions of filters
Intersection of filters
If is a family of filters on , its intersection is a filter on . The intersection is a greatest lower bound operation in the set of filters on partially ordered by inclusion, which endows the filters on with a complete lattice structure.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
The intersection consists of the subsets which can be written as where for each .
Filter generated by a family of subsets
Given a family of subsets , there exists a minimum filter on (in the sense of inclusion) which contains . It can be constructed as the intersection (greatest lower bound) of all filters on containing . This filter is called the filter generated by , and is said to be a filter subbase of . Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
The generated filter can also be described more explicitly: is obtained by closing under finite intersections, then upwards, i.e., consists of the subsets such that for some .Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
Since these operations preserve the kernel, it follows that is a proper filter if and only if has the finite intersection property: the intersection of a finite subfamily of is non-empty.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
In the complete lattice of filters on ordered by inclusion, the least upper bound of a family of filters is the filter generated by .Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
Two filters and on mesh if and only if is proper.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
Filter bases
Let be a filter on . A filter base of is a family of subsets such that is the upwards closure of , i.e., consists of those subsets for which for some .Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
This upwards closure is a filter if and only if is downwards-directed, i.e., is non-empty and for all there exists such that .Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. When this is the case, is also called a prefilter, and the upwards closure is also equal to the generated filter .Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. Hence, being a filter base of is a stronger property than being a filter subbase of .
Examples
- When is a topological space and , a filter base of the neighborhood filter of is known as a neighborhood base for , and similarly, a filter subbase of the neighborhood filter of is known as a neighborhood subbase for . The open neighborhoods of always form a neighborhood base for , by definition of the neighborhood filter. In , the closed balls of positive radius around also form a neighborhood base for .
- Let be an infinite set and let consist of the subsets of which contain all points but one. Then is a filter subbase of the Fréchet filter on , 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 , such as the one formed by the subsets of 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.
- If is a topological space, the dense open subsets of form a filter base on , because they are closed under finite intersection. The filter they generate consists of the complements of nowhere dense subsets. On , restricting to the null dense open subsets yields another filter base for the same filter.[citation needed]
- Similarly, if is a topological space, the countable intersections of dense open subsets form a filter base which generates the filter of comeager subsets.
- Let be a set and let be a net with values in , i.e., a family whose domain is a directed set. The filter base of tails of consists of the sets for ; it is downwards-closed by directedness of . The generated filter is called the eventuality filter or filter of tails of . A sequential filterLua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. or Page Template:Visible anchor/styles.css has no content.elementary filter[citation needed] is a filter which is the eventuality filter of some net. This example is fundamental in the application of filters in topology.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
- Every π-system is a filter base.
Trace of a filter on a subset
If is a filter on and , the trace of on is , which is a filter.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
Image of a filter by a function
Let be a function.
When is a family of subsets of , its image by is defined as
The image filter by of a filter on is defined as the generated filter .Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. If is surjective, then is already a filter. In the general case, is a filter base and hence is its upwards closure.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. Furthermore, if is a filter base of then is a filter base of .
The kernels of and are linked by .
Product of filters
Given a family of sets and a filter on each , the product filter on the product set is defined as the filter generated by the sets for and , where is the projection from the product set onto the -th component.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. This construction is similar to the product topology.
If each is a filter base on , a filter base of is given by the sets where is a family such that for all and for all but finitely many .Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
See also
- Axiomatic foundations of topological spaces, for a definition of topological spaces in terms of filters
- Template:Annotated link
- Convergence space, a generalization of topological spaces using filters
- Template:Annotated link
- Template:Annotated link
- Generic filter, a kind of filter used in set-theoretic forcing
Notes
Page Template:Reflist/styles.css has no content.
- ^ The intersection of zero subsets of is itself.
- ^ It is immediate that a filter on is an order filter on . For the converse, let be an order filter on . It is upwards-closed by definition. We check closure under finite intersections. If is a finite family of subsets from , it has a lower bound in by downwards-closure, which is some such that . Then , hence by upwards-closure.
Citations
Page Template:Reflist/styles.css has no content.
- ^ Page Module:Citation/CS1/styles.css has no content.Jech, Thomas (2006). Set Theory: The Third Millennium Edition, Revised and Expanded. Berlin New York: Springer Science & Business Media. p. 74. ISBN 978-3-540-44085-7. OCLC 50422939.
References
Page Template:Refbegin/styles.css has no content.
- Template:Bourbaki General Topology Part I Chapters 1-4
- Template:Bourbaki General Topology Part II Chapters 5-10
- Template:Bourbaki Topological Vector Spaces Part 1 Chapters 1–5
- Page Module:Citation/CS1/styles.css has no content.Burris, Stanley; Sankappanavar, Hanamantagouda P. (2012). A Course in Universal Algebra (PDF). Springer-Verlag. pp. 127–135. ISBN 978-0-9880552-0-9. Archived (PDF) from the original on 1 April 2022.
- Page Module:Citation/CS1/styles.css has no content.Cartan, Henri (1937a). "Théorie des filtres". Comptes rendus hebdomadaires des séances de l'Académie des sciences. 205: 595–598.
- Page Module:Citation/CS1/styles.css has no content.Cartan, Henri (1937b). "Filtres et ultrafiltres". Comptes rendus hebdomadaires des séances de l'Académie des sciences. 205: 777–779.
- Page Module:Citation/CS1/styles.css has no content.Császár, Ákos (1978). General topology. Translated by Császár, Klára. Bristol England: Adam Hilger Ltd. pp. 55–59. ISBN 0-85274-275-4. OCLC 4146011.
- Page Module:Citation/CS1/styles.css has no content.Dolecki, Szymon; Mynard, Frédéric (2016). Convergence Foundations Of Topology. New Jersey: World Scientific Publishing Company. pp. 29–39. ISBN 978-981-4571-52-4. OCLC 945169917.
- Page Module:Citation/CS1/styles.css has no content.Joshi, K. D. (1983). Introduction to General Topology. New York: John Wiley and Sons Ltd. pp. 241–248. ISBN 978-0-85226-444-7. OCLC 9218750.
- Page Module:Citation/CS1/styles.css has no content.Köthe, Gottfried (1983) [1969]. Topological Vector Spaces I. Grundlehren der mathematischen Wissenschaften. Vol. 159. Translated by Garling, D. J. H. New York: Springer Science & Business Media. pp. 11–15. ISBN 978-3-642-64988-2. MR 0248498. OCLC 840293704.
- Page Module:Citation/CS1/styles.css has no content.Koutras, Costas D.; Moyzes, Christos; Nomikos, Christos; Tsaprounis, Konstantinos; Zikos, Yorgos (20 October 2021). "On Weak Filters and Ultrafilters: Set Theory From (and for) Knowledge Representation". Logic Journal of the IGPL. 31: 68–95. doi:10.1093/jigpal/jzab030.
- Page Module:Citation/CS1/styles.css has no content.MacIver R., David (1 July 2004). "Filters in Analysis and Topology" (PDF). Archived from the original (PDF) on 2007-10-09. (Provides an introductory review of filters in topology and in metric spaces.)
- Page Module:Citation/CS1/styles.css has no content.Narici, Lawrence; Beckenstein, Edward (2011). Topological Vector Spaces. Pure and applied mathematics (Second ed.). Boca Raton, FL: CRC Press. pp. 2–5. ISBN 978-1584888666. OCLC 144216834.
- Page Module:Citation/CS1/styles.css has no content.Schechter, Eric (1996). Handbook of Analysis and Its Foundations. San Diego, CA: Academic Press. pp. 100–105. ISBN 978-0-12-622760-4. OCLC 175294365.
- Page Module:Citation/CS1/styles.css has no content.Schubert, Horst (1968). Topology. London: Macdonald & Co. pp. 48–51. ISBN 978-0-356-02077-8. OCLC 463753.
- Page Module:Citation/CS1/styles.css has no content.Wilansky, Albert (2013). Modern Methods in Topological Vector Spaces. Mineola, New York: Dover Publications, Inc. ISBN 978-0-486-49353-4. OCLC 849801114.
- Page Module:Citation/CS1/styles.css has no content.Willard, Stephen (2004) [1970]. General Topology. Mineola, N.Y.: Dover Publications. pp. 77–84. ISBN 978-0-486-43479-7. OCLC 115240.
Template:Families of sets Lua error in package.lua at line 80: module 'Module:Navbox/configuration' not found.