4. Union and intersection of a family of sets
1. Definition of the union and the intersection of a family of sets
Let X be a family (§3, no. 4) and I its index set. To help the intuitive interpretation of what follows, we shall refer to X as a family of sets. If (X,I,G) is a family of subsets of a set E (that is, a family whose target G is such that the relation Y∈G implies Y⊂E), we shall denote the family by (Xι)ι∈I(Xι∈G) or simply by (Xι)ι∈I (§3, no. 6); by abuse of notation we shall denote any family of sets, which has I as its index set, by (Xι)ι∈I.
¶ Since the relation (∀x)((ι∈I and x∈Xι)⇒(x∈Xι)) is true, it follows from S5 (Chapter I, §4, no 2.) that the relation
(∀ι)(∃Z)(∀x)((ι∈I and x∈Xι)⇒(x∈Z))
is true. By virtue of the scheme S8 (§1, no. 6) the relation (∃ι)(ι∈I and x∈Xι) is collectivizing in x.
Definition 1 03I1
Let (Xι)ι∈I be a family of sets* (resp. a family of subsets of a set E). The set Ex((∃ι)(ι∈I and x∈Xι)), that is to say, the set of all x which belong to at least one set of the family (Xl)l∈I, is called the union of the family, and is denoted by
l∈I⋃Xl, [^1]
If (Xl)l∈I is a family of subsets of a set E, then its union is a subset of E; notice that it does not depend on E, nor on the target G of the mapping l→Xl.
It is clear that if I=∅, we have l∈I⋃Xl=∅, because the relation (∃l)(l∈I and x∈Xl) is then false.
¶ Suppose now that I=∅. If α is an element of I, the relation
(∀l)((l∈I)⟹(x∈Xl)) implies
x∈Xα and therefore, by virtue of C52 (§1, no. 6), this relation is *collectivizing in
x.
Definition 2 03PT
Let (Xl)l∈I be a family of sets whose index set I is not empty. The set Ex((∀l)((l∈I)⟹(x∈Xl))), that is to say, the set of all x which belong to every set of the family (Xl)l∈I, is called the intersection of the family and is denoted by*
l∈I⋂Xl.
If I=∅, the relation (∀l)((l∈I)⟹(x∈Xl)) is not collectivizing in x; for it is a true relation and there exists no set Y such that x∈Y is a true relation, because Y would then be the set of all objects (cf. §1, no. 7, Remark).
If (Xl)l∈I is a family of subsets of a set E and if I=∅, the relation “x∈E and (∀l)((l∈I)⟹(x∈Xl))” is equivalent to
(∀l)((l∈I)⟹(x∈Xl)); consequently it is collectivizing in x, and the set of all x which satisfy this relation is equal to l∈I⋂Xl. If I=∅, the relation “x∈E and (∀l)((l∈I)⟹(x∈Xl))” is equivalent to x∈E; it is therefore collectivizing in x, and the set of all x which satisfy this relation is E. Hence we may state the following definition :
Definition 3 03PU
Let (Xl)l∈I be a family of subsets of a set E. The set*
Ex(x∈E and (∀l)((l∈I)⟹(x∈Xl))),
in other words, the set of all x which belong to E and to each of the sets Xι, is called the intersection of the family and is denoted by ι∈I⋂Xι.
Hence for a family (Xι)ι∈∅ of subsets of E we have
ι∈∅⋂Xι=E.
But for a family (Xι)ι∈I of subsets of E whose index set is not empty, the intersection ι∈I⋂Xι depends neither on E nor on the target of ι→Xι; and this justifies the use of the same notation in Definitions 2 and 3.
Proposition 1 03PV
Let* (Xι)ι∈I be a family of sets, and let f be a mapping of a set K onto I. *Then
ϰ∈K⋃Xf(ϰ)=ι∈I⋃Xι,
and, if I=∅,
ϰ∈K⋂Xf(ϰ)=ι∈I⋂Xι.
Let x be an element of ι∈I⋂Xι. There exists an index ι∈I such that x∈Xι. Since f⟨K⟩=I, there exists an index ϰ∈K such that ι=f(ϰ), whence x∈Xf(ϰ) and consequently
x∈ϰ∈K⋃Xf(ϰ).
Conversely, if x∈ϰ∈K⋃Xf(ϰ), there exists ϰ∈K such that x∈Xf(ϰ), and therefore, since f(ϰ)∈I, x∈ι∈I⋃Xι. Hence
ϰ∈K⋃Xf(ϰ)=ι∈I⋃Xι.
¶ Now suppose that I=∅, and let x be an element of ι∈I⋂Xι. For each element ϰ of K we have f(ϰ)∈I, hence x∈Xf(ϰ), and therefore
x∈ϰ∈K⋂Xf(ϰ).
Conversely, let x be an element of ϰ∈K⋂Xf(ϰ). If ι is any element of I, there exists an element ϰ of K such that ι=f(ϰ), whence x∈Xι and consequently x∈⋂ι∈IXι. Hence
ϰ∈K⋂Xf(ϰ)=ι∈I⋂Xι.
For families of subsets of a given set, it is clear that the second part of Proposition 1 remains valid without the restriction I=∅.
Corollary 03I2
Let* (Xι)ι∈I be a family of sets such that Xι=Xϰ for each pair of indices (ι,ϰ). Then for each α∈I *we have
ι∈I⋃Xι=Xα,and (if I=∅)ι∈I⋂Xι=Xα.
Apply Proposition 1 to the constant mapping ι→α of I onto {α}.
Definition 4 03I3
Let* F be a set of sets and let Φ be the family of sets defined by the identity mapping of F. The union of the sets of Φ and (if F is not empty) the intersection of the sets of Φ are called, respectively, the union and the intersection of the sets of F, and are denoted by ⋃X∈FX and ⋂X∈FX.
If follows immediately from Proposition 1 that if (Xι)ι∈I is a family of sets, then the union and (if I=∅) the intersection of the family are respectively equal to the union and the intersection of the sets of the set of elements of this family.
2. Properties of union and intersection
If (Xι)ι∈I and (Yι)ι∈I are families of sets having the same index set I, and if Yι⊂Xι for each ι∈I, then it is clear that
ι∈I⋃Yι⊂ι∈I⋃Xι,and (if I=∅)ι∈I⋂Yι⊂ι∈I⋂Xι.
¶ Let (Xι)ι∈I be a family of sets. If J⊂I, we have
ι∈J⋃Xι⊂ι∈I⋃Xι,and (if J=∅)ι∈J⋂Xι⊃ι∈I⋂Xι.
Proposition 2 03I4
Let* (Xι)ι∈I be a family of sets whose index set I is the union of a family (Jλ)λ∈L *of sets. Then
ι∈I⋃Xι=λ∈L⋃(ι∈Jλ⋃Xι),
and (if L=∅ and Jλ=∅ for each λ∈L)
ι∈I⋂Xι=λ∈L⋂(ι∈Jλ⋂Xι)
("associativity" of union and intersection).
Let x be an element of ⋃ι∈IXι. There exists an index ι∈I such that x∈Xι. Since I is the union of the family (Jλ)λ∈L, there exists an index λ∈L such that ι∈Jλ, whence x∈⋃ι∈JλXι, and consequently
x∈λ∈L⋃(ι∈Jλ⋃Xι).
Conversely, let x be an element of this set. There exists an index λ∈L such that x∈⋃ι∈JλXι, hence there exists an index ι∈Jλ (and therefore ι∈I) such that x∈Xι; it follows that
x∈ι∈I⋃Xι.
Now suppose that L=∅ and Jλ=∅ for each λ∈L. Then I=∅. Let x be an element of ⋂ι∈IXι. If λ∈L, we have x∈Xι for each ι∈Jλ (since Jλ⊂I), whence x∈⋂ι∈JλXι. Since the last inclusion is true for all λ∈L, x belongs to ⋂λ∈L(⋂ι∈JλXι). Conversely, let x be an element of this latter set, and let ι be any element of I. There exists λ∈L such that ι∈Jλ; since x∈⋂ι∈JλXι, we have x∈Xι, which is true for all ι∈I. Hence x∈⋂ι∈IXι. This completes the proof.
For families of subsets of a given set the second part of Proposition 2 remains valid without restriction on L and Jλ.
3. Images of a union and an intersection
Proposition 3 03I5
Let* (Xι)ι∈I be a family of subsets of a set A, and let Γ be a correspondence between A and B. *Then
Γ⟨ι∈I⋃Xι⟩=ι∈I⋃Γ⟨Xι⟩,Γ⟨ι∈I⋂Xι⟩⊂ι∈I⋂Γ⟨Xι⟩.
The relation (∃x)(x∈⋃ι∈IXι and y∈Γ(x)) is equivalent to
(∃x)(∃ι)(ι∈I and x∈Xι and y∈Γ(x)),
hence to (∃ι)(ι∈I and y∈Γ⟨Xι⟩), hence is equivalent to y∈⋃ι∈IΓ⟨Xι⟩; this proves the first formula. As to the second formula, we have ⋂ι∈IXι⊂Xι for all ι∈I, whence (§3, Proposition 2)
Γ⟨ι∈I⋂Xι⟩⊂Γ⟨Xι⟩,
and consequently
Γ⟨ι∈I⋂Xι⟩⊂ι∈I⋂Γ⟨Xι⟩.
¶ If Γ is an arbitrary correspondence (and in particular an arbitrary function), the formula
Γ⟨ι∈I⋂Xι⟩=ι∈I⋂Γ⟨Xι⟩
is usually false.
\* For example, in the plane R2 the first projections of the lines y=x and y=x+1 are equal to R, but the intersection of these lines is empty, and therefore so is the first projection of this intersection [^2]. \*
However, we have the following important result :
Proposition 4 03I6
Let f be a mapping of* A into B and let (Yι)ι∈I be a family of subsets of B. Then f−1⟨⋂ι∈IYι⟩=⋂ι∈If−1⟨Yι⟩.
To prove this, let x be an element of ⋂ι∈If−1⟨Yι⟩. We have f(x)∈Yι for all ι∈I, whence f(x)∈⋂ι∈IYι, and consequently
x∈f−1⟨ι∈I⋂Yι⟩.
Therefore ⋂ι∈If−1(Yι)⊂f−1⟨⋂ι∈IYι⟩; this relation, together with Proposition 3, gives the result.
Corollary 03I7
If f is an injection of* A into B and if (Xι)ι∈I is a family of subsets of A whose index set I is not empty, then f⟨⋂ι∈IXι⟩=⋂ι∈If⟨Xι⟩.
For we may write f=i∘g, where i is the canonical injection of f⟨A⟩ into B and g is a bijection of A onto f⟨A⟩. If h denotes the inverse mapping of g, we have f⟨X⟩=h−1⟨X⟩ for every subset X of A, and we are therefore brought back to Proposition 4.
4. Complements of unions and intersections
Proposition 5 03I8
For every family* (Xι)ι∈I of subsets of a set E, *we have
∁E(ι∈I⋃Xι)=ι∈I⋂(∁EXι),∁E(ι∈I⋂Xι)=ι∈I⋃(∁EXι).
Let x∈∁E(⋃ι∈IXι). Then x∈E and, for every ι∈I, x∈/Xι, so that x∈∁EXι; consequently
x∈ι∈I⋂(∁EXι).
Conversely, let x be an element of ⋂ι∈I(∁EXι); by the definition of intersection we have x∈E. Furthermore, if we had x∈⋃ι∈IXι, there would exist an index ϰ∈I such that x∈Xϰ, which contradicts the hypothesi x∈⋂ι∈I(∁EXι); hence
x∈∁E(ι∈I⋃Xι).
This proves the first formula; the second one is an immediate consequence, in view of the relation ∁E(∁EX)=X for every subset X of E.
5. Union and intersection of two sets
If A, B are sets, we write
A∪B=X∈{A,B}⋃X,A∩B=X∈{A,B}⋂X.
It is clear that A∪B is the set of all objects which belong either to A or to B (or possibly to both), while A∩B is the set of all objects which belong to both A and B. In particular, {x,y}={x}∪{y}.
¶ Let {x,y,z}={x,y}∪{z}. The set {x,y,z} is the set whose only elements are x, y, and z. Similarly we write
{x,y,z,t}={x,y,z}∪{t},
and so on.
¶ If now A, B, C, D are sets, we write
A∪B∪C=X∈{A,B,C}⋃X,A∩B∩C=X∈{A,B,C}⋂X;
A∪B∪C∪D=X∈{A,B,C,D}⋃X,A∩B∩C∩D=X∈{A,B,C,D}⋂X;
and so on.
¶ Let A,B,C be sets. From Propositions 1 and 2 we deduce the formulae
A∪B=B∪A,A∩B=B∩A,
A∪(B∪C)=(A∪B)∪C=A∪B∪C,
A∩(B∩C)=(A∩B)∩C=A∩B∩C.
These formulae are also immediate consequences of the theorems enunciated in the criterion C24 (Chapter I, §3, no. 5). Similarly one proves the formulae
A∪(B∩C)=(A∪B)∩(A∪C),A∩(B∪C)=(A∩B)∪(A∩C)
("distributivity" of union over intersection and of intersection over union; cf. §5, no. 6).
¶ The relation A⊂B is equivalent to A∪B=B and to A∩B=A. If A and B are subsets of a set E, we deduce from Proposition 5 (or from criterion C24) the formulae
∁E(A∪B)=(∁EA)∩(∁EB),∁E(A∩B)=(∁EA)∪(∁EB);
furthermore, we have
A∪(∁EA)=E,A∩(∁EA)=∅.
¶ If Γ is a correspondence between E and F, and if A, B are subsets of E, it follows from Proposition 3 that
Γ⟨A∪B⟩=Γ⟨A⟩∪Γ⟨B⟩,Γ⟨A∩B⟩⊂Γ⟨A⟩∩Γ⟨B⟩,
and that, if f is a mapping of F into E,
f−1⟨A∩B⟩=f−1⟨A⟩∩f−1⟨B⟩
from Proposition 4.
¶ We record also the following Proposition on complements :
Proposition 6 03PW
Let f be a mapping of* A into B. For every subset Y of B, *we have
f−1⟨B−Y⟩=f−1⟨B⟩−f−1⟨Y⟩.
For x belongs to f−1⟨B−Y⟩ if and only if f(x) belongs to B but not to Y, i.e., if and only if x belongs to f−1 ⟨B⟩ but not to f−1 ⟨Y⟩.
Corollary 03PX
Let f be an injection of* A into B. For every subset X of A, *we have f⟨A−X⟩=f⟨A⟩−f⟨X⟩.
Writing f=i∘g, where i is the canonical injection of f⟨A⟩ into B, we reduce the Corollary to Proposition 6 applied to g−1.
¶ The intersection X∩A is sometimes called the trace of X on A. If F is a family of sets, the set of traces on A of the sets belonging to F is called the trace of F on A.
6. Coverings
Definition 5 03PY
A family of sets (Xι)ι∈I is said to be a covering of a set* E (or to cover E) if E⊂ι∈I⋃Xι. If (Xι)ι∈I and (Yϰ)ϰ∈K are coverings of E, *the second of these coverings is said to be finer than the first (or to be a refinement of the first, or to refine the first) if, for each ϰ∈K, there exists ι∈I such that
Yϰ⊂Xι.
A set of sets R is a covering of E if the family of sets defined by the identity mapping of R is a covering of E, in other words, if E⊂X∈R⋃X.
If R, R′, R′′ are three coverings of E such that R′ refines R and R′′ refines R′, it is clear that R′′ refines R.
Let (Xι)ι∈I be a covering of E. If J is a subset of I such that (Xι)ι∈J is still a covering of E, then this covering clearly refines (Xι)ι∈I.
¶ Let (Xι)ι∈I and (Yϰ)ϰ∈K be coverings of a set E. Then the family of sets (Xι∩Yϰ)(ι,ϰ)∈I×K is a covering of E. For if x∈E, there exist indices ι∈I and ϰ∈K such that x∈Xι and x∈Yϰ, so that x∈Xι∩Yϰ Moreover, it is clear that the covering (Xι∩Yϰ)(ι,ϰ)∈I×K refines each o the coverings (Xι)ι∈I, (Yϰ)ϰ∈K. Conversely, let (Zλ)λ∈L be a covering of E which refines each of the coverings (Xι)ι∈I, (Yϰ)ϰ∈K; if λ∈L, then there exist indices ι∈I and ϰ∈K such that Zλ⊂Xι and Zλ⊂Yϰ, so that Zλ⊂Xι∩Yϰ; hence the covering (Zλ)λ∈L is a refinement of
(Xι∩Yϰ)(ι,ϰ)∈I×K.
¶ Let (Xι)ι∈I be a covering of a set A, and let f be a mapping of A onto a set B. The family (f⟨Xι⟩)ι∈I is then a covering of B (Proposition 3), called the image under f of the covering (Xι)ι∈I. If g is a mapping of a set C into the set A, the family (g−1⟨Xι⟩)ι∈I is a covering of C, called the inverse image under g of the covering (Xι)ι∈I. ¶ Let E and F be sets, let (Xι)ι∈I be a covering of E, and let (Yϰ)ϰ∈K be a covering of F. The family (Xι×Yϰ)(ι,ϰ)∈I×K is then a covering of E×F, called the product of the coverings (Xι)ι∈I of E and (Yϰ)ϰ∈K of F.
Proposition 7 03PZ
(1) Let E be a set and (Xι)ι∈I a covering of E. If f and g are two functions with domain E such that f and g agree on E∩Xι for each ι∈I, then f and g agree on E.
(2) Let (Xι)ι∈I be a family of sets and let (fι)ι∈I be a family of mappings with the same target F such that for each ι∈I the domain of fι is Xι, and for each pair (ι,ϰ)∈I×I, fι and fϰ agree on Xι∩Xϰ. Then there is exactly one function f with domain A=⋃ι∈IXι and target F which extends each of the functions fι (i∈I).
(1) Let x be any element of E. Then there exists ι∈I such that x∈Xι, whence f(x)=g(x) by hypothesis. (2) Let Gι be the graph of fι and let G=⋃ι∈IGι; let us show that G is a functional graph. If (x,y)∈G and (x,y′)∈G, there exist two indices ι, ϰ in I such that (x,y)∈Gι and (x,y′)∈Gϰ. This implies x∈Xι, x∈Xϰ, y=fι(x), y′=fϰ(x); but since x∈Xι∩Xϰ, we have
fι(x)=fϰ(x),
that is to say, y=y′. The graph G has domain pr1G=⋃ι∈Ipr1Gι=A; the function f=(G,A,F) therefore satisfies the required conditions. Its uniqueness follows from the first part of the Proposition.
7. Partitions
Definition 6 03Q0
Two sets* A and B are said to be disjoint (or not to intersect) if A∩B=∅. If A∩B=∅, we say that A meets (or intersects) B. Let (Xι)ι∈I be a family of sets. The sets of this family are said to be mutually disjoint if the conditions ι∈I, ϰ∈I, ι=ϰ imply Xι∩Xϰ=∅.
Let f be a mapping of A into B, and let (Yι)ι∈I be a family of mutually disjoint subsets of B. Proposition 4 then shows that the sets of the family (f−1⟨Yι⟩)ι∈I of subsets of A are mutually disjoint. On the other hand, if (Xι)ι∈I is a family of mutually disjoint subsets of A, the sets of the family (f⟨Xι⟩)ι∈I are not in general mutually disjoint.
Proposition 8 03Q1
Let* (Xι)ι∈I be a family of mutually disjoint sets, and let (fι)ι∈I be a family of functions with the same target F such that the domain of fι is Xι for each ι∈I. Then there exists exactly one function f with domain ⋃ι∈IXι and target F which extends each of the functions fι (ι∈I).
This is a corollary of Proposition 7, since fι and fϰ clearly agree on Xι∩Xϰ=∅ whenever ι=ϰ.
Definition 7 03Q2
A partition of a set* E is a family of non-empty mutually disjoint subsets of E which covers E.
For every non-empty set A, the family ({x})x∈A is a partition of A.
If (Xι)ι∈I is a partition of a set E, the mapping ι→Xι of I onto the set F of elements Xι of the partition is bijective. Hence, if F is given, the partition is determined up to a one-to-one correspondence between index sets. Usually when we speak of a partition, it is the set of elements of the partition with which we are concerned.
8. Sum of a family of sets
Proposition 9 03Q3
Let* (Xι)ι∈I be a family of sets. Then there exists a set X with the following property : X is the union of a family (Xι′)ι∈I of mutually disjoint sets such that for each ι∈I there exists a one-to-one mapping of Xι onto Xι′.
Let A=⋃ι∈IXι. If ι∈I, the mapping x→(x,ι) (x∈Xι) is a one-to-one mapping of Xι onto a subset Xι′ of A×I. Moreover, the image of Xι′ under the second coordinate function on A×I is contained in the set {ι}; it follows that Xι′∩Xϰ′=∅ whenever ι=ϰ. We may then take X=⋃ι∈IXι′.
Definition 8 03Q4
Let* (Xι)ι∈I be a family of sets. The sum of this family is the union of the family of sets (Xι×{ι})ι∈I.
Proposition 10 03IA
Let* (Xι)ι∈I be a family of mutually disjoint sets. Let A be its union and S its sum. Then there exists a bijective mapping of A onto S.
For each ι∈I, let fι be a bijection of Xι onto Xι×{ι}. By virtue of Proposition 8, there exists a mapping f of A into S which extends all the mappings fι. It is immediately verified that f is a bijective mapping of A onto S.
By abuse of language, a set E is said to be the sum of a family of sets (Xι)ι∈I if there exists a bijection of E onto the sum of the family, as defined in Definition 8.
Note that if (Xι)ι∈I is an arbitrary family of sets, the argument of Proposition 10 shows that there exists a mapping of the sum S onto the union A.
Exercises
See the exercises for § 4.
[^1]: The scheme S8 therefore allows us to define the union of a family of sets without supposing a priori that these sets are subsets of the same set (which is the assumption made in the definition of union given in Summary of Results, §4, no. 2). [^2]: A celebrated error arising from the application of this formula is that committed by H. Lebesgue in his attempt to prove that the projection on an axis of a Borel set in the plane is again a Borel set (this statement was subsequently shown to be incorrect, and the discussion it provoked was the origin of the theory of "Souslin" sets) : Lebesgue asserted that the projection of the intersection of a decreasing sequence of sets is equal to the intersection of their projections (Journal de Mathématiques, (6) 1 (1905), pp. 191-192).