Family_of_sets Knowpia

In set theory and related branches of mathematics, a family (or collection) can mean, depending upon the context, any of the following: set, indexed set, multiset, or class. A collection $F$ of subsets of a given set $S$ is called a family of subsets of $S$ , or a family of sets over $S.$ More generally, a collection of any sets whatsoever is called a family of sets, set family, or a set system. Additionally, a family of sets may be defined as a function from a set $I$ , known as the index set, to $F$ , in which case the sets of the family are indexed by members of $I$ .^[1] In some contexts, a family of sets may be allowed to contain repeated copies of any given member,^[2]^[3]^[4] and in other contexts it may form a proper class.

A finite family of subsets of a finite set $S$ is also called a hypergraph. The subject of extremal set theory concerns the largest and smallest examples of families of sets satisfying certain restrictions.

Examples edit

The set of all subsets of a given set $S$ is called the power set of $S$ and is denoted by $\wp (S).$ The power set $\wp (S)$ of a given set $S$ is a family of sets over $S.$

A subset of $S$ having $k$ elements is called a $k$ -subset of $S.$ The $k$ -subsets $S^{(k)}$ of a set $S$ form a family of sets.

Let $S=\{a,b,c,1,2\}.$ An example of a family of sets over $S$ (in the multiset sense) is given by $F=\left\{A_{1},A_{2},A_{3},A_{4}\right\},$ where $A_{1}=\{a,b,c\},A_{2}=\{1,2\},A_{3}=\{1,2\},$ and $A_{4}=\{a,b,1\}.$

The class $\operatorname {Ord}$ of all ordinal numbers is a large family of sets. That is, it is not itself a set but instead a proper class.

Properties edit

Any family of subsets of a set $S$ is itself a subset of the power set $\wp (S)$ if it has no repeated members.

Any family of sets without repetitions is a subclass of the proper class of all sets (the universe).

Hall's marriage theorem, due to Philip Hall, gives necessary and sufficient conditions for a finite family of non-empty sets (repetitions allowed) to have a system of distinct representatives.

If ${\mathcal {F}}$ is any family of sets then $\cup {\mathcal {F}}:={\textstyle \bigcup \limits _{F\in {\mathcal {F}}}}F$ denotes the union of all sets in ${\mathcal {F}},$ where in particular, $\cup \varnothing =\varnothing .$ Any family ${\mathcal {F}}$ of sets is a family over $\cup {\mathcal {F}}$ and also a family over any superset of $\cup {\mathcal {F}}.$

Related concepts edit

Certain types of objects from other areas of mathematics are equivalent to families of sets, in that they can be described purely as a collection of sets of objects of some type:

A hypergraph, also called a set system, is formed by a set of vertices together with another set of hyperedges, each of which may be an arbitrary set. The hyperedges of a hypergraph form a family of sets, and any family of sets can be interpreted as a hypergraph that has the union of the sets as its vertices.
An abstract simplicial complex is a combinatorial abstraction of the notion of a simplicial complex, a shape formed by unions of line segments, triangles, tetrahedra, and higher-dimensional simplices, joined face to face. In an abstract simplicial complex, each simplex is represented simply as the set of its vertices. Any family of finite sets without repetitions in which the subsets of any set in the family also belong to the family forms an abstract simplicial complex.
An incidence structure consists of a set of points, a set of lines, and an (arbitrary) binary relation, called the incidence relation, specifying which points belong to which lines. An incidence structure can be specified by a family of sets (even if two distinct lines contain the same set of points), the sets of points belonging to each line, and any family of sets can be interpreted as an incidence structure in this way.
A binary block code consists of a set of codewords, each of which is a string of 0s and 1s, all the same length. When each pair of codewords has large Hamming distance, it can be used as an error-correcting code. A block code can also be described as a family of sets, by describing each codeword as the set of positions at which it contains a 1.
A topological space consists of a pair $(X,\tau )$ where $X$ is a set (whose elements are called points) and $\tau$ is a topology on $X,$ which is a family of sets (whose elements are called open sets) over $X$ that contains both the empty set $\varnothing$ and $X$ itself, and is closed under arbitrary set unions and finite set intersections.

Covers and topologies edit

A family of sets is said to cover a set $X$ if every point of $X$ belongs to some member of the family. A subfamily of a cover of $X$ that is also a cover of $X$ is called a subcover. A family is called a point-finite collection if every point of $X$ lies in only finitely many members of the family. If every point of a cover lies in exactly one member, the cover is a partition of $X.$

When $X$ is a topological space, a cover whose members are all open sets is called an open cover. A family is called locally finite if each point in the space has a neighborhood that intersects only finitely many members of the family. A σ-locally finite or countably locally finite collection is a family that is the union of countably many locally finite families.

A cover ${\mathcal {F}}$ is said to refine another (coarser) cover ${\mathcal {C}}$ if every member of ${\mathcal {F}}$ is contained in some member of ${\mathcal {C}}.$ A star refinement is a particular type of refinement.

Special types of set families edit

A Sperner family is a set family in which none of the sets contains any of the others. Sperner's theorem bounds the maximum size of a Sperner family.

A Helly family is a set family such that any minimal subfamily with empty intersection has bounded size. Helly's theorem states that convex sets in Euclidean spaces of bounded dimension form Helly families.

An abstract simplicial complex is a set family $F$ (consisting of finite sets) that is downward closed; that is, every subset of a set in $F$ is also in $F.$ A matroid is an abstract simplicial complex with an additional property called the augmentation property.

Every filter is a family of sets.

A convexity space is a set family closed under arbitrary intersections and unions of chains (with respect to the inclusion relation).

Other examples of set families are independence systems, greedoids, antimatroids, and bornological spaces.

Families F{\displaystyle {\mathcal {F}}} of sets over Ω{\displaystyle \Omega } .mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:": "}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist dd dd:first-child::before,.mw-parser-output .hlist dd dt:first-child::before,.mw-parser-output .hlist dd li:first-child::before,.mw-parser-output .hlist dt dd:first-child::before,.mw-parser-output .hlist dt dt:first-child::before,.mw-parser-output .hlist dt li:first-child::before,.mw-parser-output .hlist li dd:first-child::before,.mw-parser-output .hlist li dt:first-child::before,.mw-parser-output .hlist li li:first-child::before{content:" (";font-weight:normal}.mw-parser-output .hlist dd dd:last-child::after,.mw-parser-output .hlist dd dt:last-child::after,.mw-parser-output .hlist dd li:last-child::after,.mw-parser-output .hlist dt dd:last-child::after,.mw-parser-output .hlist dt dt:last-child::after,.mw-parser-output .hlist dt li:last-child::after,.mw-parser-output .hlist li dd:last-child::after,.mw-parser-output .hlist li dt:last-child::after,.mw-parser-output .hlist li li:last-child::after{content:")";font-weight:normal}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:" ("counter(listitem)"\a0 "}.mw-parser-output .navbar{display:inline;font-size:88%;font-weight:normal}.mw-parser-output .navbar-collapse{float:left;text-align:left}.mw-parser-output .navbar-boxtext{word-spacing:0}.mw-parser-output .navbar ul{display:inline-block;white-space:nowrap;line-height:inherit}.mw-parser-output .navbar-brackets::before{margin-right:-0.125em;content:"[ "}.mw-parser-output .navbar-brackets::after{margin-left:-0.125em;content:" ]"}.mw-parser-output .navbar li{word-spacing:-0.125em}.mw-parser-output .navbar a>span,.mw-parser-output .navbar a>abbr{text-decoration:inherit}.mw-parser-output .navbar-mini abbr{font-variant:small-caps;border-bottom:none;text-decoration:none;cursor:inherit}.mw-parser-output .navbar-ct-full{font-size:114%;margin:0 7em}.mw-parser-output .navbar-ct-mini{font-size:114%;margin:0 4em}v t e
Is necessarily true of ${\mathcal {F}}\colon$ or, is ${\mathcal {F}}$ closed under:	Directed by $\,\supseteq$	$A\cap B$	$A\cup B$	$B\setminus A$	$\Omega \setminus A$	$A_{1}\cap A_{2}\cap \cdots$	$A_{1}\cup A_{2}\cup \cdots$	$\Omega \in {\mathcal {F}}$	$\varnothing \in {\mathcal {F}}$	F.I.P.
$π$ -system
Semiring										Never
Semialgebra (Semifield)										Never
Monotone class						only if $A_{i}\searrow$	only if $A_{i}\nearrow$
𝜆-system (Dynkin System)				only if $A\subseteq B$			only if $A_{i}\nearrow$ or they are disjoint			Never
Ring (Order theory)
Ring (Measure theory)										Never
δ-Ring										Never
𝜎-Ring										Never
Algebra (Field)										Never
𝜎-Algebra (𝜎-Field)										Never
Dual ideal
Filter				Never	Never				$\varnothing \not \in {\mathcal {F}}$
Prefilter (Filter base)				Never	Never				$\varnothing \not \in {\mathcal {F}}$
Filter subbase				Never	Never				$\varnothing \not \in {\mathcal {F}}$
Open Topology							(even arbitrary $\cup$ )			Never
Closed Topology						(even arbitrary $\cap$ )				Never
Is necessarily true of ${\mathcal {F}}\colon$ or, is ${\mathcal {F}}$ closed under:	directed downward	finite intersections	finite unions	relative complements	complements in $\Omega$	countable intersections	countable unions	contains $\Omega$	contains $\varnothing$	Finite Intersection Property
Additionally, a *semiring* is a $π$ -system where every complement $B\setminus A$ is equal to a finite disjoint union of sets in ${\mathcal {F}}.$ A *semialgebra* is a semiring where every complement $\Omega \setminus A$ is equal to a finite disjoint union of sets in ${\mathcal {F}}.$ $A,B,A_{1},A_{2},\ldots$ are arbitrary elements of ${\mathcal {F}}$ and it is assumed that ${\mathcal {F}}\neq \varnothing .$

Notes edit

^ P. Halmos, Naive Set Theory, p.34. The University Series in Undergraduate Mathematics, 1960. Litton Educational Publishing, Inc.
^ Brualdi 2010, pg. 322
^ Roberts & Tesman 2009, pg. 692
^ Biggs 1985, pg. 89

References edit

Biggs, Norman L. (1985), Discrete Mathematics, Oxford: Clarendon Press, ISBN 0-19-853252-0
Brualdi, Richard A. (2010), Introductory Combinatorics (5th ed.), Upper Saddle River, NJ: Prentice Hall, ISBN 0-13-602040-2
Roberts, Fred S.; Tesman, Barry (2009), Applied Combinatorics (2nd ed.), Boca Raton: CRC Press, ISBN 978-1-4200-9982-9