Concept

Finite intersection property

In general topology, a branch of mathematics, a non-empty family A of subsets of a set is said to have the finite intersection property (FIP) if the intersection over any finite subcollection of is non-empty. It has the strong finite intersection property (SFIP) if the intersection over any finite subcollection of is infinite. Sets with the finite intersection property are also called centered systems and filter subbases. The finite intersection property can be used to reformulate topological compactness in terms of closed sets; this is its most prominent application. Other applications include proving that certain perfect sets are uncountable, and the construction of ultrafilters. Let be a set and a nonempty family of subsets of ; that is, is a subset of the power set of . Then is said to have the finite intersection property if every nonempty finite subfamily has nonempty intersection; it is said to have the strong finite intersection property if that intersection is always infinite. In symbols, has the FIP if, for any choice of a finite nonempty subset of , there must exist a point Likewise, has the SFIP if, for every choice of such , there are infinitely many such . In the study of filters, the common intersection of a family of sets is called a kernel, from much the same etymology as the sunflower. Families with empty kernel are called free; those with nonempty kernel, fixed. The empty set cannot belong to any collection with the finite intersection property. A sufficient condition for the FIP intersection property is a nonempty kernel. The converse is generally false, but holds for finite families; that is, if is finite, then has the finite intersection property if and only if it is fixed. The finite intersection property is strictly stronger than pairwise intersection; the family has pairwise intersections, but not the FIP. More generally, let be a positive integer greater than unity, , and . Then any subset of with fewer than elements has nonempty intersection, but lacks the FIP.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related courses (4)
MATH-101(e): Analysis I
Étudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles d'une variable.
MATH-106(e): Analysis II
Étudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles de plusieurs variables.
MATH-502: Distribution and interpolation spaces
The goal of this course is to give an introduction to the theory of distributions and cover the fundamental results of Sobolev spaces including fractional spaces that appear in the interpolation theor
Show more
Related lectures (16)
Definition of a Gibbs measures
Covers the definition of Gibbs measures, proper kernels, compatibility, phase transitions, and existence conditions.
Normed Spaces
Covers normed spaces, dual spaces, Banach spaces, Hilbert spaces, weak and strong convergence, reflexive spaces, and the Hahn-Banach theorem.
Convergence and Compactness in R^n
Explores adhesion, convergence, closed sets, compact subsets, and examples of subsets in R^n.
Show more
Related publications (4)

Uniform s-Cross-Intersecting Families

Andrei Kupavskii

In this paper we study a question related to the classical Erdos-Ko-Rado theorem, which states that any family of k-element subsets of the set [n] = {1,..., n} in which any two sets intersect has cardinality at most ((n-1)(k-1)). We say that two non-empty ...
Cambridge Univ Press2017

L-2-Betti numbers and Plancherel measure

Henrik Densing Petersen, Alain Valette

We compute L-2-Betti numbers of postliminal, locally compact, unimodular groups in terms of ordinary dimensions of reduced cohomology with coefficients in irreducible unitary representations and the Plancherel measure. This allows us to compute the L-2-Bet ...
Academic Press Inc Elsevier Science2014

Control design of hybrid systems via dehybridization

Babak Sedghi

Hybrid dynamical systems are those with interaction between continuous and discrete dynamics. For the analysis and control of such systems concepts and theories from either the continuous or the discrete domain are typically readapted. In this thesis the i ...
EPFL2003
Show more
Related concepts (11)
Filter (set theory)
In mathematics, a filter on a set is a family of subsets such that: and if and , then If , and , then A filter on a set may be thought of as representing a "collection of large subsets", one intuitive example being the neighborhood filter. Filters appear in order theory, model theory, and set theory, but can also be found in topology, from which they originate. The dual notion of a filter is an ideal.
Ultrafilter on a set
In the mathematical field of set theory, an ultrafilter on a set is a maximal filter on the set In other words, it is a collection of subsets of that satisfies the definition of a filter on and that is maximal with respect to inclusion, in the sense that there does not exist a strictly larger collection of subsets of that is also a filter. (In the above, by definition a filter on a set does not contain the empty set.) Equivalently, an ultrafilter on the set can also be characterized as a filter on with the property that for every subset of either or its complement belongs to the ultrafilter.
General topology
In mathematics, general topology (or point set topology) is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology. It is the foundation of most other branches of topology, including differential topology, geometric topology, and algebraic topology. The fundamental concepts in point-set topology are continuity, compactness, and connectedness: Continuous functions, intuitively, take nearby points to nearby points.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.