Familycollection, both of which are greater sets of sets (e.g. is in the family of sets ).
is still standard for power sets.
includes (that is, and ) as a possibility here.
is a family. The unions and intersections of its member sets are as follows:
For this it’s easier/convenient to consider indexed families of sets
If whenever , then the family is disjoint.
When considering families indexed (enumerated) by we write or .
The limit superior and limit inferior are given by
So and .
is the notation for the difference of sets: , and
for is .
de Morgan laws:
For sets , the cartesian product is the set of all with ,.
A relation on is a subset of (if then we say “a relation on ”). Let be such a subset. We write for .
The most important relations are the following.
I. Equivalence relations. An ER on is a relation (say ) such that for all ;; and if and then . These rules are known as the reflexive, symmetric, and transitive properties, respectively.
The equivalence class of is , and is the disjoint union of these equivalence classes. (, so , the set of equivalence classes.)
II. Orderings. We will come back to this.
III. Mappings. is a relation from to with the property that for every there is a unique such that , and we write . Mappings maps functions. Folland reserves “functions” for maps where .
If and , then ,, is the composition. If and , we define the image of and the inverse image of under a map by
commutes with unions, intersections, and complements:
is the domain of , and is the range of . is injective if only when ;surjective if (the range is the codomain, i.e. the image of is all of );bijective if both. If is bijective there exists such that and .
If we write for the restriction of to :, for .
A sequence of a set is a mapping of into . For finite sequences, with . If is a sequence and satisfies whenever , then is called a subsequence of .
Sometimes we care little about differentiating sequences and their ranges. For example, if we speak of , and determine from context whether we refer to or to where . (Likewise for subsequences.)
Cartesian products of sets -tuples.
Infinite families of sets: if is an indexed family of sets, their cartesian product is the set of all maps
If and , we define the th projection or coordinate map by . We write and instead of and , and call the th coordinate of . If for all , then is the set of all maps , denoted , and if then .