Bourbaki

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)(\mathrm{X}, \mathrm{I}, \mathfrak{G}) is a family of subsets of a set E (that is, a family whose target G\mathfrak{G} is such that the relation Y∈G\mathrm{Y} \in \mathfrak{G} implies Y⊂E\mathrm{Y} \subset \mathrm{E}), we shall denote the family by (Xι)ι∈I(Xι∈G)(\mathrm{X}_\iota)_{\iota \in \mathrm{I}}(\mathrm{X}_\iota \in \mathfrak{G}) or simply by (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{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(\mathrm{X}_\iota)_{\iota \in \mathrm{I}}.

¶ Since the relation (∀x)((ι∈I(\forall x)((\iota \in \mathrm{I} and x∈Xι)⇒(x∈Xι))x \in \mathrm{X}_\iota) \Rightarrow (x \in \mathrm{X}_\iota)) is true, it follows from S5 (Chapter I, §4, no 2.) that the relation

(∀ι)(∃Z)(∀x)((ι∈I and x∈Xι)⇒(x∈Z))(\forall \iota)(\exists \mathrm{Z})(\forall x)((\iota \in \mathrm{I} \text{ and } x \in \mathrm{X}_\iota) \Rightarrow (x \in \mathrm{Z}))

is true. By virtue of the scheme S8 (§1, no. 6) the relation (∃ι)(ι∈I(\exists \iota)(\iota \in \mathrm{I} and x∈Xι)x \in \mathrm{X}_\iota) is collectivizing in xx.

Definition 1 03I1

Let (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{I}} be a family of sets* (resp. a family of subsets of a set E). The set Ex((∃ι)(ι∈I\mathscr{E}_x((\exists \iota)(\iota \in \mathrm{I} and x∈Xι))x \in \mathrm{X}_\iota)), that is to say, the set of all xx which belong to at least one set of the family (Xl)l∈I(X_l)_{l\in I}, is called the union of the family, and is denoted by

⋃l∈IXl,\bigcup_{l\in I}X_l,
[^1]

If (Xl)l∈I(X_l)_{l\in I} is a family of subsets of a set EE, then its union is a subset of EE; notice that it does not depend on EE, nor on the target G\mathfrak{G} of the mapping l→Xll\to X_l.

It is clear that if I=∅I=\varnothing, we have ⋃l∈IXl=∅\displaystyle\bigcup_{l\in I}X_l=\varnothing, because the relation (∃l)(l∈I and x∈Xl)(\exists l)(l\in I\text{ and }x\in X_l) is then false.

¶ Suppose now that I≠∅I\neq\varnothing. If α\alpha is an element of II, the relation

(∀l)((l∈I)⟹(x∈Xl)) (\forall l)((l\in I)\Longrightarrow(x\in X_l))
implies x∈Xαx\in X_\alpha and therefore, by virtue of C52 (§1, no. 6), this relation is *collectivizing in xx.

Definition 2 03PT

Let (Xl)l∈I(X_l)_{l\in I} be a family of sets whose index set II is not empty. The set Ex((∀l)((l∈I)⟹(x∈Xl)))\mathscr{E}_x((\forall l)((l\in I)\Longrightarrow(x\in X_l))), that is to say, the set of all xx which belong to every set of the family (Xl)l∈I(X_l)_{l\in I}, is called the intersection of the family and is denoted by*

⋂l∈IXl.\bigcap_{l\in I}X_l.

If I=∅I=\varnothing, the relation (∀l)((l∈I)⟹(x∈Xl))(\forall l)((l\in I)\Longrightarrow(x\in X_l)) is not collectivizing in xx; for it is a true relation and there exists no set YY such that x∈Yx\in Y is a true relation, because YY would then be the set of all objects (cf. §1, no. 7, Remark).

If (Xl)l∈I(X_l)_{l\in I} is a family of subsets of a set EE and if I≠∅I\neq\varnothing, the relation “x∈Ex\in E and (∀l)((l∈I)⟹(x∈Xl))(\forall l)((l\in I)\Longrightarrow(x\in X_l))” is equivalent to

(∀l)((l∈I)⟹(x∈Xl)); (\forall l)((l\in I)\Longrightarrow(x\in X_l));
consequently it is collectivizing in xx, and the set of all xx which satisfy this relation is equal to ⋂l∈IXl\displaystyle\bigcap_{l\in I}X_l. If I=∅I=\varnothing, the relation “x∈Ex\in E and (∀l)((l∈I)⟹(x∈Xl))(\forall l)((l\in I)\Longrightarrow(x\in X_l))” is equivalent to x∈Ex\in E; it is therefore collectivizing in xx, and the set of all xx which satisfy this relation is EE. Hence we may state the following definition :

Definition 3 03PU

Let (Xl)l∈I(X_l)_{l\in I} be a family of subsets of a set EE. The set*

Ex(x∈E and (∀l)((l∈I)⟹(x∈Xl))),\mathscr{E}_x\left(x\in E\text{ and }(\forall l)((l\in I)\Longrightarrow(x\in X_l))\right),

in other words, the set of all xx which belong to E and to each of the sets XιX_\iota, is called the intersection of the family and is denoted by ⋂ι∈IXι\bigcap\limits_{\iota \in I} X_\iota.

Hence for a family (Xι)ι∈∅(X_\iota)_{\iota \in \emptyset} of subsets of E we have

⋂ι∈∅Xι=E.\bigcap_{\iota \in \emptyset} X_\iota = E.

But for a family (Xι)ι∈I(X_\iota)_{\iota \in I} of subsets of E whose index set is not empty, the intersection ⋂ι∈IXι\bigcap\limits_{\iota \in I} X_\iota depends neither on E nor on the target of ι→Xι\iota \rightarrow X_\iota; and this justifies the use of the same notation in Definitions 2 and 3.

Proposition 1 03PV

Let* (Xι)ι∈I(X_\iota)_{\iota \in I} be a family of sets, and let ff be a mapping of a set K onto I. *Then

⋃ϰ∈KXf(ϰ)=⋃ι∈IXι,\bigcup_{\varkappa \in K} X_{f(\varkappa)} = \bigcup_{\iota \in I} X_\iota,

and, if I≠∅I \neq \emptyset,

⋂ϰ∈KXf(ϰ)=⋂ι∈IXι.\bigcap_{\varkappa \in K} X_{f(\varkappa)} = \bigcap_{\iota \in I} X_\iota.

Let xx be an element of ⋂ι∈IXι\bigcap\limits_{\iota \in I} X_\iota. There exists an index ι∈I\iota \in I such that x∈Xιx \in X_\iota. Since f⟨K⟩=If\langle K \rangle = I, there exists an index ϰ∈K\varkappa \in K such that ι=f(ϰ)\iota = f(\varkappa), whence x∈Xf(ϰ)x \in X_{f(\varkappa)} and consequently

x∈⋃ϰ∈KXf(ϰ).x \in \bigcup_{\varkappa \in K} X_{f(\varkappa)}.

Conversely, if x∈⋃ϰ∈KXf(ϰ)x \in \bigcup\limits_{\varkappa \in K} X_{f(\varkappa)}, there exists ϰ∈K\varkappa \in K such that x∈Xf(ϰ)x \in X_{f(\varkappa)}, and therefore, since f(ϰ)∈If(\varkappa) \in I, x∈⋃ι∈IXιx \in \bigcup\limits_{\iota \in I} X_\iota. Hence

⋃ϰ∈KXf(ϰ)=⋃ι∈IXι.\bigcup_{\varkappa \in K} X_{f(\varkappa)} = \bigcup_{\iota \in I} X_\iota.

¶ Now suppose that I≠∅I \neq \emptyset, and let xx be an element of ⋂ι∈IXι\bigcap\limits_{\iota \in I} X_\iota. For each element ϰ\varkappa of K we have f(ϰ)∈If(\varkappa) \in I, hence x∈Xf(ϰ)x \in X_{f(\varkappa)}, and therefore

x∈⋂ϰ∈KXf(ϰ).x \in \bigcap_{\varkappa \in K} X_{f(\varkappa)}.

Conversely, let xx be an element of ⋂ϰ∈KXf(ϰ)\bigcap\limits_{\varkappa \in K} X_{f(\varkappa)}. If ι\iota is any element of I, there exists an element ϰ\varkappa of K such that ι=f(ϰ)\iota = f(\varkappa), whence x∈Xιx \in X_\iota and consequently x∈⋂ι∈IXιx \in \bigcap_{\iota \in I} X_\iota. Hence

⋂ϰ∈KXf(ϰ)=⋂ι∈IXι.\bigcap_{\varkappa \in K} X_{f(\varkappa)} = \bigcap_{\iota \in I} X_\iota.

For families of subsets of a given set, it is clear that the second part of Proposition 1 remains valid without the restriction I≠∅I \neq \emptyset.

Corollary 03I2

Let* (Xι)ι∈I(X_\iota)_{\iota \in I} be a family of sets such that Xι=XϰX_\iota = X_\varkappa for each pair of indices (ι,ϰ)(\iota, \varkappa). Then for each α∈I\alpha \in I *we have

⋃ι∈IXι=Xα,and (if I≠∅)⋂ι∈IXι=Xα.\bigcup_{\iota \in I} X_\iota = X_\alpha, \qquad \textit{and (if } I \neq \emptyset) \qquad \bigcap_{\iota \in I} X_\iota = X_\alpha.

Apply Proposition 1 to the constant mapping ι→α\iota \to \alpha of I onto {α}\{\alpha\}.

Definition 4 03I3

Let* F\mathfrak{F} be a set of sets and let Φ\Phi be the family of sets defined by the identity mapping of F\mathfrak{F}. The union of the sets of Φ\Phi and (if F\mathfrak{F} is not empty) the intersection of the sets of Φ\Phi are called, respectively, the union and the intersection of the sets of F\mathfrak{F}, and are denoted by ⋃X∈FX\bigcup_{X \in \mathfrak{F}} X and ⋂X∈FX\bigcap_{X \in \mathfrak{F}} X.

If follows immediately from Proposition 1 that if (Xι)ι∈I(X_\iota)_{\iota \in I} is a family of sets, then the union and (if I≠∅I \neq \emptyset) 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(X_\iota)_{\iota \in I} and (Yι)ι∈I(Y_\iota)_{\iota \in I} are families of sets having the same index set I, and if Yι⊂XιY_\iota \subset X_\iota for each ι∈I\iota \in I, then it is clear that

⋃ι∈IYι⊂⋃ι∈IXι,and (if I≠∅)⋂ι∈IYι⊂⋂ι∈IXι.\bigcup_{\iota \in I} Y_\iota \subset \bigcup_{\iota \in I} X_\iota, \qquad \text{and (if } I \neq \emptyset) \qquad \bigcap_{\iota \in I} Y_\iota \subset \bigcap_{\iota \in I} X_\iota.

¶ Let (Xι)ι∈I(X_\iota)_{\iota \in I} be a family of sets. If J⊂IJ \subset I, we have

⋃ι∈JXι⊂⋃ι∈IXι,and (if J≠∅)⋂ι∈JXι⊃⋂ι∈IXι.\bigcup_{\iota \in J} X_\iota \subset \bigcup_{\iota \in I} X_\iota, \qquad \text{and (if } J \neq \emptyset) \qquad \bigcap_{\iota \in J} X_\iota \supset \bigcap_{\iota \in I} X_\iota.

Proposition 2 03I4

Let* (Xι)ι∈I(X_\iota)_{\iota \in I} be a family of sets whose index set I is the union of a family (Jλ)λ∈L(J_\lambda)_{\lambda \in L} *of sets. Then

⋃ι∈IXι=⋃λ∈L(⋃ι∈JλXι),\bigcup_{\iota \in I} X_\iota = \bigcup_{\lambda \in L} \left( \bigcup_{\iota \in J_\lambda} X_\iota \right),

and (if L≠∅L \neq \emptyset and Jλ≠∅J_\lambda \neq \emptyset for each λ∈L\lambda \in L)

⋂ι∈IXι=⋂λ∈L(⋂ι∈JλXι)\bigcap_{\iota \in I} X_\iota = \bigcap_{\lambda \in L} \left( \bigcap_{\iota \in J_\lambda} X_\iota \right)

("associativity" of union and intersection).

Let xx be an element of ⋃ι∈IXι\bigcup_{\iota \in I} X_\iota. There exists an index ι∈I\iota \in I such that x∈Xιx \in X_\iota. Since I is the union of the family (Jλ)λ∈L(J_\lambda)_{\lambda \in L}, there exists an index λ∈L\lambda \in L such that ι∈Jλ\iota \in J_\lambda, whence x∈⋃ι∈JλXιx \in \bigcup_{\iota \in J_\lambda} X_\iota, and consequently

x∈⋃λ∈L(⋃ι∈JλXι).x \in \bigcup_{\lambda \in L} \left( \bigcup_{\iota \in J_\lambda} X_\iota \right).

Conversely, let xx be an element of this set. There exists an index λ∈L\lambda \in L such that x∈⋃ι∈JλXιx \in \bigcup_{\iota \in J_\lambda} X_\iota, hence there exists an index ι∈Jλ\iota \in J_\lambda (and therefore ι∈I\iota \in I) such that x∈Xιx \in X_\iota; it follows that

x∈⋃ι∈IXι.x \in \bigcup_{\iota \in I} X_\iota.

Now suppose that L≠∅L \neq \emptyset and Jλ≠∅J_\lambda \neq \emptyset for each λ∈L\lambda \in L. Then I≠∅I \neq \emptyset. Let xx be an element of ⋂ι∈IXι\bigcap_{\iota \in I} X_\iota. If λ∈L\lambda \in L, we have x∈Xιx \in X_\iota for each ι∈Jλ\iota \in J_\lambda (since Jλ⊂IJ_\lambda \subset I), whence x∈⋂ι∈JλXιx \in \bigcap_{\iota \in J_\lambda} X_\iota. Since the last inclusion is true for all λ∈L\lambda \in L, xx belongs to ⋂λ∈L(⋂ι∈JλXι)\bigcap_{\lambda \in L} \left( \bigcap_{\iota \in J_\lambda} X_\iota \right). Conversely, let xx be an element of this latter set, and let ι\iota be any element of I. There exists λ∈L\lambda \in L such that ι∈Jλ\iota \in J_\lambda; since x∈⋂ι∈JλXιx \in \bigcap_{\iota \in J_\lambda} X_\iota, we have x∈Xιx \in X_\iota, which is true for all ι∈I\iota \in I. Hence x∈⋂ι∈IXιx \in \bigcap_{\iota \in I} X_\iota. 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λJ_\lambda.

3. Images of a union and an intersection

Proposition 3 03I5

Let* (Xι)ι∈I(X_\iota)_{\iota \in I} be a family of subsets of a set A, and let Γ\Gamma be a correspondence between A and B. *Then

Γ⟨⋃ι∈IXι⟩=⋃ι∈IΓ⟨Xι⟩,Γ⟨⋂ι∈IXι⟩⊂⋂ι∈IΓ⟨Xι⟩.\Gamma \left\langle \bigcup_{\iota \in I} X_\iota \right\rangle = \bigcup_{\iota \in I} \Gamma \langle X_\iota \rangle, \qquad \Gamma \left\langle \bigcap_{\iota \in I} X_\iota \right\rangle \subset \bigcap_{\iota \in I} \Gamma \langle X_\iota \rangle.

The relation (∃x)(x∈⋃ι∈IXι and y∈Γ(x))(\exists x)\left(x \in \bigcup_{\iota \in I} X_\iota \text{ and } y \in \Gamma(x)\right) is equivalent to

(∃x)(∃ι)(ι∈I and x∈Xι and y∈Γ(x)),(\exists x)(\exists \iota)(\iota \in I \text{ and } x \in X_\iota \text{ and } y \in \Gamma(x)),

hence to (∃ι)(ι∈I(\exists \iota)(\iota \in I and y∈Γ⟨Xι⟩)y \in \Gamma\langle X_\iota \rangle), hence is equivalent to y∈⋃ι∈IΓ⟨Xι⟩y \in \bigcup_{\iota \in I} \Gamma\langle X_\iota \rangle; this proves the first formula. As to the second formula, we have ⋂ι∈IXι⊂Xι\bigcap_{\iota \in I} X_\iota \subset X_\iota for all ι∈I\iota \in I, whence (§3, Proposition 2)

Γ⟨⋂ι∈IXι⟩⊂Γ⟨Xι⟩,\Gamma\left\langle \bigcap_{\iota \in I} X_\iota \right\rangle \subset \Gamma\langle X_\iota \rangle,

and consequently

Γ⟨⋂ι∈IXι⟩⊂⋂ι∈IΓ⟨Xι⟩.\Gamma\left\langle \bigcap_{\iota \in I} X_\iota \right\rangle \subset \bigcap_{\iota \in I} \Gamma\langle X_\iota \rangle.

¶ If Γ\Gamma is an arbitrary correspondence (and in particular an arbitrary function), the formula

Γ⟨⋂ι∈IXι⟩=⋂ι∈IΓ⟨Xι⟩\Gamma\left\langle \bigcap_{\iota \in I} X_\iota \right\rangle = \bigcap_{\iota \in I} \Gamma\langle X_\iota \rangle

is usually false.

\* For example, in the plane R2\mathbf{R}^2 the first projections of the lines y=xy = x and y=x+1y = x + 1 are equal to R\mathbf{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 ff be a mapping of* A into B and let (Yι)ι∈I(Y_\iota)_{\iota \in I} be a family of subsets of B. Then f−1⟨⋂ι∈IYι⟩=⋂ι∈If−1⟨Yι⟩.\overset{-1}{f}\left\langle \bigcap_{\iota \in I} Y_\iota \right\rangle = \bigcap_{\iota \in I} \overset{-1}{f}\langle Y_\iota \rangle.

To prove this, let xx be an element of ⋂ι∈If−1⟨Yι⟩\bigcap_{\iota \in I} \overset{-1}{f}\langle Y_\iota \rangle. We have f(x)∈Yιf(x) \in Y_\iota for all ι∈I\iota \in I, whence f(x)∈⋂ι∈IYιf(x) \in \bigcap_{\iota \in I} Y_\iota, and consequently

x∈f−1⟨⋂ι∈IYι⟩.x \in \overset{-1}{f}\left\langle \bigcap_{\iota \in I} Y_\iota \right\rangle.

Therefore ⋂ι∈If−1(Yι)⊂f−1⟨⋂ι∈IYι⟩\bigcap_{\iota \in I} \overset{-1}{f}(Y_\iota) \subset \overset{-1}{f}\left\langle \bigcap_{\iota \in I} Y_\iota \right\rangle; this relation, together with Proposition 3, gives the result.

Corollary 03I7

If ff is an injection of* A into B and if (Xι)ι∈I(X_\iota)_{\iota \in I} is a family of subsets of A whose index set I is not empty, then f⟨⋂ι∈IXι⟩=⋂ι∈If⟨Xι⟩f\left\langle \bigcap_{\iota \in I} X_\iota \right\rangle = \bigcap_{\iota \in I} f\langle X_\iota \rangle.

For we may write f=i∘gf = i \circ g, where ii is the canonical injection of f⟨A⟩f\langle A \rangle into B and gg is a bijection of A onto f⟨A⟩f\langle A \rangle. If hh denotes the inverse mapping of gg, we have f⟨X⟩=h−1⟨X⟩f\langle X \rangle = \overset{-1}{h}\langle X \rangle 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(X_\iota)_{\iota \in I} of subsets of a set E, *we have

∁E(⋃ι∈IXι)=⋂ι∈I(∁EXι),∁E(⋂ι∈IXι)=⋃ι∈I(∁EXι).\complement_E\left(\bigcup_{\iota \in I} X_\iota\right) = \bigcap_{\iota \in I} (\complement_E X_\iota), \qquad \complement_E\left(\bigcap_{\iota \in I} X_\iota\right) = \bigcup_{\iota \in I} (\complement_E X_\iota).

Let x∈∁E(⋃ι∈IXι)x \in \complement_E\left(\bigcup_{\iota \in I} X_\iota\right). Then x∈Ex \in E and, for every ι∈I\iota \in I, x∉Xιx \notin X_\iota, so that x∈∁EXιx \in \complement_E X_\iota; consequently

x∈⋂ι∈I(∁EXι).x \in \bigcap_{\iota \in I} (\complement_E X_\iota).

Conversely, let xx be an element of ⋂ι∈I(∁EXι)\bigcap_{\iota \in I} (\complement_E X_\iota); by the definition of intersection we have x∈Ex \in E. Furthermore, if we had x∈⋃ι∈IXιx \in \bigcup_{\iota \in I} X_\iota, there would exist an index ϰ∈I\varkappa \in I such that x∈Xϰx \in X_\varkappa, which contradicts the hypothesi x∈⋂ι∈I(∁EXι)x \in \bigcap_{\iota \in I} (\complement_E X_\iota); hence

x∈∁E(⋃ι∈IXι).x \in \complement_E\left(\bigcup_{\iota \in I} X_\iota\right).

This proves the first formula; the second one is an immediate consequence, in view of the relation ∁E(∁EX)=X\complement_E(\complement_E X) = 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.A \cup B = \bigcup_{X \in \{A, B\}} X, \qquad A \cap B = \bigcap_{X \in \{A, B\}} X.

It is clear that A∪BA \cup B is the set of all objects which belong either to AA or to BB (or possibly to both), while A∩BA \cap B is the set of all objects which belong to both AA and BB. In particular, {x,y}={x}∪{y}\{x, y\} = \{x\} \cup \{y\}.

¶ Let {x,y,z}={x,y}∪{z}\{x, y, z\} = \{x, y\} \cup \{z\}. The set {x,y,z}\{x, y, z\} is the set whose only elements are xx, yy, and zz. Similarly we write

{x,y,z,t}={x,y,z}∪{t},\{x, y, z, t\} = \{x, y, z\} \cup \{t\},

and so on.

¶ If now AA, BB, CC, DD are sets, we write

A∪B∪C=⋃X∈{A, B, C}X,A∩B∩C=⋂X∈{A, B, C}X;A \cup B \cup C = \bigcup_{X \in \{A,\, B,\, C\}} X, \qquad A \cap B \cap C = \bigcap_{X \in \{A,\, B,\, C\}} X;
A∪B∪C∪D=⋃X∈{A, B, C, D}X,A∩B∩C∩D=⋂X∈{A, B, C, D}X;A \cup B \cup C \cup D = \bigcup_{X \in \{A,\, B,\, C,\, D\}} X, \qquad A \cap B \cap C \cap D = \bigcap_{X \in \{A,\, B,\, C,\, D\}} X;

and so on.

¶ Let A,B,CA, B, C be sets. From Propositions 1 and 2 we deduce the formulae

A∪B=B∪A,A∩B=B∩A,A \cup B = B \cup A, \qquad A \cap B = B \cap A,
A∪(B∪C)=(A∪B)∪C=A∪B∪C,A \cup (B \cup C) = (A \cup B) \cup C = A \cup B \cup C,
A∩(B∩C)=(A∩B)∩C=A∩B∩C.A \cap (B \cap C) = (A \cap B) \cap C = A \cap B \cap 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)A \cup (B \cap C) = (A \cup B) \cap (A \cup C), \qquad A \cap (B \cup C) = (A \cap B) \cup (A \cap C)

("distributivity" of union over intersection and of intersection over union; cf. §5, no. 6).

¶ The relation A⊂BA \subset B is equivalent to A∪B=BA \cup B = B and to A∩B=AA \cap B = A. If AA and BB are subsets of a set EE, we deduce from Proposition 5 (or from criterion C24) the formulae

∁E(A∪B)=(∁EA)∩(∁EB),∁E(A∩B)=(∁EA)∪(∁EB);\complement_E(A \cup B) = (\complement_E A) \cap (\complement_E B), \qquad \complement_E(A \cap B) = (\complement_E A) \cup (\complement_E B);

furthermore, we have

A∪(∁EA)=E,A∩(∁EA)=∅.A \cup (\complement_E A) = E, \qquad A \cap (\complement_E A) = \emptyset.

¶ If Γ\Gamma is a correspondence between EE and FF, and if AA, BB are subsets of EE, it follows from Proposition 3 that

Γ⟨A∪B⟩=Γ⟨A⟩∪Γ⟨B⟩,Γ⟨A∩B⟩⊂Γ⟨A⟩∩Γ⟨B⟩,\Gamma\langle A \cup B \rangle = \Gamma\langle A \rangle \cup \Gamma\langle B \rangle, \qquad \Gamma\langle A \cap B \rangle \subset \Gamma\langle A \rangle \cap \Gamma\langle B \rangle,

and that, if ff is a mapping of F into E,

f−1⟨A∩B⟩=f−1⟨A⟩∩f−1⟨B⟩\overset{-1}{f}\langle \mathrm{A} \cap \mathrm{B} \rangle = \overset{-1}{f}\langle \mathrm{A} \rangle \cap \overset{-1}{f}\langle \mathrm{B} \rangle

from Proposition 4.

¶ We record also the following Proposition on complements :

Proposition 6 03PW

Let ff 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⟩.\overset{-1}{f}\langle \mathrm{B} - \mathrm{Y} \rangle = \overset{-1}{f}\langle \mathrm{B} \rangle - \overset{-1}{f}\langle \mathrm{Y} \rangle.

For xx belongs to f−1⟨B−Y⟩\overset{-1}{f}\langle \mathrm{B} - \mathrm{Y} \rangle if and only if f(x)f(x) belongs to B but not to Y, i.e., if and only if xx belongs to f−1 ⟨B⟩\overset{-1}{f}\ \langle \mathrm{B} \rangle but not to f−1 ⟨Y⟩\overset{-1}{f}\ \langle \mathrm{Y} \rangle.

Corollary 03PX

Let ff be an injection of* A into B. For every subset X of A, *we have f⟨A−X⟩=f⟨A⟩−f⟨X⟩f\langle \mathrm{A} - \mathrm{X} \rangle = f\langle \mathrm{A} \rangle - f\langle \mathrm{X} \rangle.

Writing f=i∘gf = i \circ g, where ii is the canonical injection of f⟨A⟩f\langle \mathrm{A} \rangle into B, we reduce the Corollary to Proposition 6 applied to g−1\overset{-1}{g}.

¶ The intersection X∩A\mathrm{X} \cap \mathrm{A} is sometimes called the trace of X on A. If F\mathfrak{F} is a family of sets, the set of traces on A of the sets belonging to F\mathfrak{F} is called the trace of F\mathfrak{F} on A.

6. Coverings

Definition 5 03PY

A family of sets (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{I}} is said to be a covering of a set* E (or to cover E) if E⊂⋃ι∈IXι\mathrm{E} \subset \bigcup\limits_{\iota \in \mathrm{I}} \mathrm{X}_\iota. If (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{I}} and (Yϰ)ϰ∈K(\mathrm{Y}_\varkappa)_{\varkappa \in \mathrm{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\varkappa \in \mathrm{K}, there exists ι∈I\iota \in \mathrm{I} such that

Yϰ⊂Xι.\mathrm{Y}_\varkappa \subset \mathrm{X}_\iota.

A set of sets R\mathfrak{R} is a covering of E if the family of sets defined by the identity mapping of R\mathfrak{R} is a covering of E, in other words, if E⊂⋃X∈RX\mathrm{E} \subset \bigcup\limits_{\mathrm{X} \in \mathfrak{R}} \mathrm{X}.

If R\mathfrak{R}, R′\mathfrak{R}', R′′\mathfrak{R}'' are three coverings of E such that R′\mathfrak{R}' refines R\mathfrak{R} and R′′\mathfrak{R}'' refines R′\mathfrak{R}', it is clear that R′′\mathfrak{R}'' refines R\mathfrak{R}.

Let (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{I}} be a covering of E. If J is a subset of I such that (Xι)ι∈J(\mathrm{X}_\iota)_{\iota \in \mathrm{J}} is still a covering of E, then this covering clearly refines (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{I}}.

¶ Let (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{I}} and (Yϰ)ϰ∈K(\mathrm{Y}_\varkappa)_{\varkappa \in \mathrm{K}} be coverings of a set E. Then the family of sets (Xι∩Yϰ)(ι,ϰ)∈I×K(\mathrm{X}_\iota \cap \mathrm{Y}_\varkappa)_{(\iota, \varkappa) \in \mathrm{I} \times \mathrm{K}} is a covering of E. For if x∈Ex \in \mathrm{E}, there exist indices ι∈I\iota \in \mathrm{I} and ϰ∈K\varkappa \in \mathrm{K} such that x∈Xιx \in \mathrm{X}_\iota and x∈Yϰx \in \mathrm{Y}_\varkappa, so that x∈Xι∩Yϰx \in \mathrm{X}_\iota \cap \mathrm{Y}_\varkappa Moreover, it is clear that the covering (Xι∩Yϰ)(ι,ϰ)∈I×K(\mathrm{X}_\iota \cap \mathrm{Y}_\varkappa)_{(\iota, \varkappa) \in \mathrm{I} \times \mathrm{K}} refines each o the coverings (Xι)ι∈I(X_\iota)_{\iota \in I}, (Yϰ)ϰ∈K(Y_\varkappa)_{\varkappa \in K}. Conversely, let (Zλ)λ∈L(Z_\lambda)_{\lambda \in L} be a covering of E which refines each of the coverings (Xι)ι∈I(X_\iota)_{\iota \in I}, (Yϰ)ϰ∈K(Y_\varkappa)_{\varkappa \in K}; if λ∈L\lambda \in L, then there exist indices ι∈I\iota \in I and ϰ∈K\varkappa \in K such that Zλ⊂XιZ_\lambda \subset X_\iota and Zλ⊂YϰZ_\lambda \subset Y_\varkappa, so that Zλ⊂Xι∩YϰZ_\lambda \subset X_\iota \cap Y_\varkappa; hence the covering (Zλ)λ∈L(Z_\lambda)_{\lambda \in L} is a refinement of

(Xι∩Yϰ)(ι,ϰ)∈I×K.(X_\iota \cap Y_\varkappa)_{(\iota, \varkappa) \in I \times K}.

¶ Let (Xι)ι∈I(X_\iota)_{\iota \in I} be a covering of a set A, and let ff be a mapping of A onto a set B. The family (f⟨Xι⟩)ι∈I(f\langle X_\iota \rangle)_{\iota \in I} is then a covering of B (Proposition 3), called the image under ff of the covering (Xι)ι∈I(X_\iota)_{\iota \in I}. If gg is a mapping of a set C into the set A, the family (g−1⟨Xι⟩)ι∈I(\overset{-1}{g}\langle X_\iota \rangle)_{\iota \in I} is a covering of C, called the inverse image under gg of the covering (Xι)ι∈I(X_\iota)_{\iota \in I}. ¶ Let E and F be sets, let (Xι)ι∈I(X_\iota)_{\iota \in I} be a covering of E, and let (Yϰ)ϰ∈K(Y_\varkappa)_{\varkappa \in K} be a covering of F. The family (Xι×Yϰ)(ι,ϰ)∈I×K(X_\iota \times Y_\varkappa)_{(\iota, \varkappa) \in I \times K} is then a covering of E×FE \times F, called the product of the coverings (Xι)ι∈I(X_\iota)_{\iota \in I} of E and (Yϰ)ϰ∈K(Y_\varkappa)_{\varkappa \in K} of F.

Proposition 7 03PZ

(1) Let E be a set and (Xι)ι∈I(X_\iota)_{\iota \in I} a covering of E. If ff and gg are two functions with domain E such that ff and gg agree on E∩XιE \cap X_\iota for each ι∈I\iota \in I, then ff and gg agree on E.

(2) Let (Xι)ι∈I(X_\iota)_{\iota \in I} be a family of sets and let (fι)ι∈I(f_\iota)_{\iota \in I} be a family of mappings with the same target F such that for each ι∈I\iota \in I the domain of fιf_\iota is XιX_\iota, and for each pair (ι,ϰ)∈I×I(\iota, \varkappa) \in I \times I, fιf_\iota and fϰf_\varkappa agree on Xι∩XϰX_\iota \cap X_\varkappa. Then there is exactly one function ff with domain A=⋃ι∈IXιA = \bigcup_{\iota \in I} X_\iota and target F which extends each of the functions fιf_\iota (i∈I)(i \in I).

(1) Let xx be any element of E. Then there exists ι∈I\iota \in I such that x∈Xιx \in X_\iota, whence f(x)=g(x)f(x) = g(x) by hypothesis. (2) Let GιG_\iota be the graph of fιf_\iota and let G=⋃ι∈IGιG = \bigcup_{\iota \in I} G_\iota; let us show that G is a functional graph. If (x,y)∈G(x, y) \in G and (x,y′)∈G(x, y') \in G, there exist two indices ι\iota, ϰ\varkappa in I such that (x,y)∈Gι(x, y) \in G_\iota and (x,y′)∈Gϰ(x, y') \in G_\varkappa. This implies x∈Xιx \in X_\iota, x∈Xϰx \in X_\varkappa, y=fι(x)y = f_\iota(x), y′=fϰ(x)y' = f_\varkappa(x); but since x∈Xι∩Xϰx \in X_\iota \cap X_\varkappa, we have

fι(x)=fϰ(x),f_\iota(x) = f_\varkappa(x),

that is to say, y=y′y = y'. The graph G has domain pr1G=⋃ι∈Ipr1Gι=A\mathrm{pr}_1 G = \bigcup_{\iota \in I} \mathrm{pr}_1 G_\iota = A; the function f=(G,A,F)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=∅A \cap B = \emptyset. If A∩B≠∅A \cap B \neq \emptyset, we say that A meets (or intersects) B. Let (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{I}} be a family of sets. The sets of this family are said to be mutually disjoint if the conditions ι∈I\iota \in \mathrm{I}, ϰ∈I\varkappa \in \mathrm{I}, ι≠ϰ\iota \neq \varkappa imply Xι∩Xϰ=∅\mathrm{X}_\iota \cap \mathrm{X}_\varkappa = \emptyset.

Let ff be a mapping of A into B, and let (Yι)ι∈I(\mathrm{Y}_\iota)_{\iota \in \mathrm{I}} be a family of mutually disjoint subsets of B. Proposition 4 then shows that the sets of the family (f−1⟨Yι⟩)ι∈I(\overset{-1}{f}\langle \mathrm{Y}_\iota \rangle)_{\iota \in \mathrm{I}} of subsets of A are mutually disjoint. On the other hand, if (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{I}} is a family of mutually disjoint subsets of A, the sets of the family (f⟨Xι⟩)ι∈I(f \langle \mathrm{X}_\iota \rangle)_{\iota \in \mathrm{I}} are not in general mutually disjoint.

Proposition 8 03Q1

Let* (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{I}} be a family of mutually disjoint sets, and let (fι)ι∈I(f_\iota)_{\iota \in \mathrm{I}} be a family of functions with the same target F such that the domain of fιf_\iota is Xι\mathrm{X}_\iota for each ι∈I\iota \in \mathrm{I}. Then there exists exactly one function f with domain ⋃ι∈IXι\bigcup_{\iota \in \mathrm{I}} \mathrm{X}_\iota and target F which extends each of the functions fιf_\iota (ι∈I)(\iota \in \mathrm{I}).

This is a corollary of Proposition 7, since fιf_\iota and fϰf_\varkappa clearly agree on Xι∩Xϰ=∅\mathrm{X}_\iota \cap \mathrm{X}_\varkappa = \emptyset whenever ι≠ϰ\iota \neq \varkappa.

Definition 7 03Q2

A partition of a set* E is a family of non-empty mutually disjoint subsets of E which covers E.

Example 03I9

For every non-empty set A, the family ({x})x∈A(\{x\})_{x \in \mathrm{A}} is a partition of A.

If (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{I}} is a partition of a set E, the mapping ι→Xι\iota \rightarrow \mathrm{X}_\iota of I onto the set F\mathfrak{F} of elements Xι\mathrm{X}_\iota of the partition is bijective. Hence, if F\mathfrak{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(\mathrm{X}_\iota)_{\iota \in \mathrm{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(\mathrm{X}'_\iota)_{\iota \in \mathrm{I}} of mutually disjoint sets such that for each ι∈I\iota \in \mathrm{I} there exists a one-to-one mapping of Xι\mathrm{X}_\iota onto Xι′\mathrm{X}'_\iota.

Let A=⋃ι∈IXι\mathrm{A} = \bigcup_{\iota \in \mathrm{I}} \mathrm{X}_\iota. If ι∈I\iota \in \mathrm{I}, the mapping x→(x,ι)x \rightarrow (x, \iota) (x∈Xι)(x \in \mathrm{X}_\iota) is a one-to-one mapping of Xι\mathrm{X}_\iota onto a subset Xι′\mathrm{X}'_\iota of A×I\mathrm{A} \times \mathrm{I}. Moreover, the image of Xι′\mathrm{X}'_\iota under the second coordinate function on A×I\mathrm{A} \times \mathrm{I} is contained in the set {ι}\{\iota\}; it follows that Xι′∩Xϰ′=∅\mathrm{X}'_\iota \cap \mathrm{X}'_\varkappa = \emptyset whenever ι≠ϰ\iota \neq \varkappa. We may then take X=⋃ι∈IXι′\mathrm{X} = \bigcup_{\iota \in \mathrm{I}} \mathrm{X}'_\iota.

Definition 8 03Q4

Let* (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{I}} be a family of sets. The sum of this family is the union of the family of sets (Xι×{ι})ι∈I(\mathrm{X}_\iota \times \{\iota\})_{\iota \in \mathrm{I}}.

Proposition 10 03IA

Let* (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{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\iota \in \mathrm{I}, let fιf_\iota be a bijection of Xι\mathrm{X}_\iota onto Xι×{ι}\mathrm{X}_\iota \times \{\iota\}. By virtue of Proposition 8, there exists a mapping ff of A into S which extends all the mappings fιf_\iota. It is immediately verified that ff 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(\mathrm{X}_\iota)_{\iota \in \mathrm{I}} if there exists a bijection of E onto the sum of the family, as defined in Definition 8.

Note that if (Xι)ι∈I(\mathrm{X}_\iota)_{\iota \in \mathrm{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).

Transcribed from the printed edition, 2004, Springer. Not translated.