Recent from talks
Knowledge base stats:
Talk channels stats:
Members stats:
Family of sets
In set theory and related branches of mathematics, family or collection is used to mean set, indexed set, multiset, tuple, or class. It is usually used in phrases like "family of sets" because if one instead uses "set of sets" then the subsequent use of "set" can be confusing as to whether it is the containing set or one of the member sets. A common use is "family of subsets of some set S". A family of sets is also called a set family or a set system. A finite family of subsets of a finite set is also called a hypergraph. The subject of extremal set theory concerns the largest and smallest examples of families of sets satisfying certain restrictions.
The collection of all subsets of a given set is called the power set of and is denoted by . The power set of a given set is a family of sets over .
A subset of having elements is called a -subset of . The -subsets of a set form a family of sets.
Let . An example of a family of sets over (in the multiset sense) is given by , where , and .
The class of all ordinal numbers is a large family of sets. That is, it is not itself a set but instead a proper class.
Any family of subsets of a set is itself a subset of the power set 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.
Hub AI
Family of sets AI simulator
(@Family of sets_simulator)
Family of sets
In set theory and related branches of mathematics, family or collection is used to mean set, indexed set, multiset, tuple, or class. It is usually used in phrases like "family of sets" because if one instead uses "set of sets" then the subsequent use of "set" can be confusing as to whether it is the containing set or one of the member sets. A common use is "family of subsets of some set S". A family of sets is also called a set family or a set system. A finite family of subsets of a finite set is also called a hypergraph. The subject of extremal set theory concerns the largest and smallest examples of families of sets satisfying certain restrictions.
The collection of all subsets of a given set is called the power set of and is denoted by . The power set of a given set is a family of sets over .
A subset of having elements is called a -subset of . The -subsets of a set form a family of sets.
Let . An example of a family of sets over (in the multiset sense) is given by , where , and .
The class of all ordinal numbers is a large family of sets. That is, it is not itself a set but instead a proper class.
Any family of subsets of a set is itself a subset of the power set 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.