List of set identities and relations

This article lists mathematical properties and laws of sets, involving the set-theoretic operations of union, intersection, and complementation and the relations of set equality and set inclusion. It also provides systematic procedures for evaluating expressions, and performing calculations, involving these operations and relations.

The binary operations of set union ($\cup$) and intersection ($\cap$) satisfy many identities. Several of these identities or "laws" have well established names.

Notation

Throughout this article, capital letters (such as $A,B,C,L,M,R,S,$ and $X$) will denote sets. On the left hand side of an identity, typically,

• $L$ will be the leftmost set,
• $M$ will be the middle set, and
• $R$ will be the rightmost set.

This is to facilitate applying identities to expressions that are complicated or use the same symbols as the identity. For example, the identity $$(L\setminus M)\setminus R=(L\setminus R)\setminus (M\setminus R)$$ may be read as: $$(\text{Left set}\setminus \text{Middle set})\setminus \text{Right set}=(\text{Left set}\setminus \text{Right set})\setminus (\text{Middle set}\setminus \text{Right set}).$$

Elementary set operations

For sets $L$ and $R,$ define: $$\begin{array}{ccccccc}L\cup R& & \stackrel{\text{def}}{=}\{x:x\in L& & \text{ or }& & x\in R\}\\ L\cap R& & \stackrel{\text{def}}{=}\{x:x\in L& & \text{ and }& & x\in R\}\\ L\setminus R& & \stackrel{\text{def}}{=}\{x:x\in L& & \text{ and }& & x\notin R\}\\ \end{array}$$ and $$L\mathrm{△}R\stackrel{\text{def}}{=}\{x:x\text{ belongs to exactly one of }L\text{ and }R\}$$ where the Template:Em $L\mathrm{△}R$ is sometimes denoted by $L\ominus R$ and equals: $$\begin{array}{cccccccc}L\mathrm{△}R& =(L\setminus & & R)\cup & & (R\setminus & & L)\\ & =(L\cup & & R)\setminus & & (L\cap & & R).\end{array}$$

One set $L$ is said to Template:Em another set $R$ if $L\cap R\ne \varnothing .$ Sets that do not intersect are said to be Template:Em.

The power set of $X$ is the set of all subsets of $X$ and will be denoted by $$\mathrm{\wp }(X)\stackrel{\text{def}}{=}\{L:L\subseteq X\}.$$

Universe set and complement notation

The notation $$L^{\complement }\stackrel{\text{def}}{=}X\setminus L.$$ may be used if $L$ is a subset of some set $X$ that is understood (say from context, or because it is clearly stated what the superset $X$ is). It is emphasized that the definition of $L^{\complement }$ depends on context. For instance, had $L$ been declared as a subset of $Y,$ with the sets $Y$ and $X$ not necessarily related to each other in any way, then $L^{\complement }$ would likely mean $Y\setminus L$ instead of $X\setminus L.$

If it is needed then unless indicated otherwise, it should be assumed that $X$ denotes the universe set, which means that all sets that are used in the formula are subsets of $X.$ In particular, the complement of a set $L$ will be denoted by $L^{\complement }$ where unless indicated otherwise, it should be assumed that $L^{\complement }$ denotes the complement of $L$ in (the universe) $X.$

One subset involved

Assume $L\subseteq X.$

Identity:Template:Sfn

Definition: $e$ is called a left identity element of a binary operator $\ast$ if $e\ast R=R$ for all $R$ and it is called a right identity element of $\ast$ if $L\ast e=L$ for all $L.$ A left identity element that is also a right identity element if called an identity element.

The empty set $\varnothing$ is an identity element of binary union $\cup$ and symmetric difference $\mathrm{△},$ and it is also a right identity element of set subtraction $\setminus :$

$$\begin{array}{cccccc}L\cap X& =& & L& =& X\cap L\text{ where }L\subseteq X\\ L\cup \varnothing & =& & L& =& \varnothing \cup L\\ L\mathrm{△}\varnothing & =& & L& =& \varnothing \mathrm{△}L\\ L\setminus \varnothing & =& & L\\ \end{array}$$ but $\varnothing$ is not a left identity element of $\setminus$ since $$\varnothing \setminus L=\varnothing$$ so $\varnothing \setminus L=L$ if and only if $L=\varnothing .$

IdempotenceTemplate:Sfn $L\ast L=L$ and Nilpotence $L\ast L=\varnothing$:

$$\begin{array}{cccccc}L\cup L& =& & L& & \text{ (Idempotence)}\\ L\cap L& =& & L& & \text{ (Idempotence)}\\ L\mathrm{△}L& =& & \varnothing & & \text{ (Nilpotence of index 2)}\\ L\setminus L& =& & \varnothing & & \text{ (Nilpotence of index 2)}\\ \end{array}$$

DominationTemplate:Sfn/Absorbing element:

Definition: $z$ is called a left absorbing element of a binary operator $\ast$ if $z\ast R=z$ for all $R$ and it is called a right absorbing element of $\ast$ if $L\ast z=z$ for all $L.$ A left absorbing element that is also a right absorbing element if called an absorbing element. Absorbing elements are also sometime called annihilating elements or zero elements.

A universe set is an absorbing element of binary union $\cup .$ The empty set $\varnothing$ is an absorbing element of binary intersection $\cap$ and binary Cartesian product $\times ,$ and it is also a left absorbing element of set subtraction $\setminus :$

$$\begin{array}{cccccc}X\cup L& =& & X& =& L\cup X\text{ where }L\subseteq X\\ \varnothing \cap L& =& & \varnothing & =& L\cap \varnothing \\ \varnothing \times L& =& & \varnothing & =& L\times \varnothing \\ \varnothing \setminus L& =& & \varnothing & & \\ \end{array}$$ but $\varnothing$ is not a right absorbing element of set subtraction since $$L\setminus \varnothing =L$$ where $L\setminus \varnothing =\varnothing$ if and only if $L=\varnothing .$

Double complement or involution law:

$$\begin{array}{cccccccccc}X\setminus (X\setminus L)& =L& & \text{ Also written }& & {\left(L^{\complement }\right)}^{\complement }=L& & & & \text{ where }L\subseteq X\text{ (Double complement/Involution law)}\\ \end{array}$$

$$L\setminus \varnothing =L$$ $$\begin{array}{cccc}\varnothing & =L& & \setminus L\\ & =\varnothing & & \setminus L\\ & =L& & \setminus X\text{ where }L\subseteq X\\ \end{array}$$Template:Sfn

$$L^{\complement }=X\setminus L\text{ (definition of notation)}$$

$$\begin{array}{cccccccccc}L\cup (X\setminus L)& =X& & \text{ Also written }& & L\cup L^{\complement }=X& & & & \text{ where }L\subseteq X\\ L\mathrm{△}(X\setminus L)& =X& & \text{ Also written }& & L\mathrm{△}{L}^{\complement }=X& & & & \text{ where }L\subseteq X\\ L\cap (X\setminus L)& =\varnothing & & \text{ Also written }& & L\cap L^{\complement }=\varnothing & & & & \\ \end{array}$$Template:Sfn

$$\begin{array}{cccccccccc}X\setminus \varnothing & =X& & \text{ Also written }& & {\varnothing }^{\complement }=X& & & & \text{ (Complement laws for the empty set))}\\ X\setminus X& =\varnothing & & \text{ Also written }& & X^{\complement }=\varnothing & & & & \text{ (Complement laws for the universe set)}\\ \end{array}$$

Two sets involved

In the left hand sides of the following identities, $L$ is the Template:EmTemplate:Hspeft most set and $R$ is the Template:EmTemplate:Hspight most set. Assume both $L\text{ and }R$ are subsets of some universe set $X.$

Formulas for binary set operations Template:Math, and Template:Math

In the left hand sides of the following identities, Template:Mvar is the Template:EmTemplate:Hspeft most set and Template:Mvar is the Template:EmTemplate:Hspight most set. Whenever necessary, both Template:Mvar and Template:Mvar should be assumed to be subsets of some universe set Template:Mvar, so that $L^{\complement }:=X\setminus L\text{ and }{R}^{\complement }:=X\setminus R.$

$$\begin{array}{cccccccccc}L\cap R& =L& & \setminus & & (L& & \setminus & & R)\\ & =R& & \setminus & & (R& & \setminus & & L)\\ & =L& & \setminus & & (L& & \mathrm{△}& & R)\\ & =L& & \mathrm{△}& & (L& & \setminus & & R)\\ \end{array}$$

$$\begin{array}{cccccccccccccc}L\cup R& =(& & L\mathrm{△}R)& & \cup & & & & L& & & & \\ & =(& & L\mathrm{△}R)& & \mathrm{△}& & (& & L& & \cap & & R)\\ & =(& & R\setminus L)& & \cup & & & & L& & & & \text{ (union is disjoint)}\\ \end{array}$$

$$\begin{array}{cccccccccccc}L\mathrm{△}R& =& & R\mathrm{△}L& & & & & & & & \\ & =(& & L\cup R)& & \setminus & & (& & L\cap R)& & \\ & =(& & L\setminus R)& & \cup & & (& & R\setminus L)& & \text{ (union is disjoint)}\\ & =(& & L\mathrm{△}M)& & \mathrm{△}& & (& & M\mathrm{△}R)& & \text{ where }M\text{ is an arbitrary set. }\\ & =(& & L^{\complement })& & \mathrm{△}& & (& & R^{\complement })& & \\ \end{array}$$

$$\begin{array}{cccccccccccc}L\setminus R& =& & L& & \setminus & & (L& & \cap & & R)\\ & =& & L& & \cap & & (L& & \mathrm{△}& & R)\\ & =& & L& & \mathrm{△}& & (L& & \cap & & R)\\ & =& & R& & \mathrm{△}& & (L& & \cup & & R)\\ \end{array}$$

De Morgan's laws

De Morgan's laws state that for $L,R\subseteq X:$

$$\begin{array}{cccccccccc}X\setminus (L\cap R)& =(X\setminus L)\cup (X\setminus R)& & \text{ Also written }& & (L\cap R{)}^{\complement }=L^{\complement }\cup R^{\complement }& & & & \text{ (De Morgan's law)}\\ X\setminus (L\cup R)& =(X\setminus L)\cap (X\setminus R)& & \text{ Also written }& & (L\cup R{)}^{\complement }=L^{\complement }\cap R^{\complement }& & & & \text{ (De Morgan's law)}\\ \end{array}$$

Commutativity

Unions, intersection, and symmetric difference are commutative operations:Template:Sfn

$$\begin{array}{cccccc}L\cup R& =& & R\cup L& & \text{ (Commutativity)}\\ L\cap R& =& & R\cap L& & \text{ (Commutativity)}\\ L\mathrm{△}R& =& & R\mathrm{△}L& & \text{ (Commutativity)}\\ \end{array}$$

Set subtraction is not commutative. However, the commutativity of set subtraction can be characterized: from $(L\setminus R)\cap (R\setminus L)=\varnothing$ it follows that: $$L\setminus R=R\setminus L\text{ if and only if }L=R.$$ Said differently, if distinct symbols always represented distinct sets, then the Template:Em true formulas of the form $\cdot \setminus \cdot =\cdot \setminus \cdot$ that could be written would be those involving a single symbol; that is, those of the form: $S\setminus S=S\setminus S.$ But such formulas are necessarily true for Template:Em binary operation $\ast$ (because $x\ast x=x\ast x$ must hold by definition of equality), and so in this sense, set subtraction is as diametrically opposite to being commutative as is possible for a binary operation. Set subtraction is also neither left alternative nor right alternative; instead, $(L\setminus L)\setminus R=L\setminus (L\setminus R)$ if and only if $L\cap R=\varnothing$ if and only if $(R\setminus L)\setminus L=R\setminus (L\setminus L).$ Set subtraction is quasi-commutative and satisfies the Jordan identity.

Other identities involving two sets

Absorption laws:

$$\begin{array}{cccccc}L\cup (L\cap R)& =& & L& & \text{ (Absorption)}\\ L\cap (L\cup R)& =& & L& & \text{ (Absorption)}\\ \end{array}$$

Other properties

$$\begin{array}{cccccccccc}L\setminus R& =L\cap (X\setminus R)& & \text{ Also written }& & L\setminus R=L\cap R^{\complement }& & & & \text{ where }L,R\subseteq X\\ X\setminus (L\setminus R)& =(X\setminus L)\cup R& & \text{ Also written }& & (L\setminus R{)}^{\complement }=L^{\complement }\cup R& & & & \text{ where }R\subseteq X\\ L\setminus R& =(X\setminus R)\setminus (X\setminus L)& & \text{ Also written }& & L\setminus R=R^{\complement }\setminus L^{\complement }& & & & \text{ where }L,R\subseteq X\\ \end{array}$$

Intervals:

$$(a,b)\cap (c,d)=(\max \{a,c\},\min \{b,d\})$$ $$[a,b)\cap [c,d)=[\max \{a,c\},\min \{b,d\})$$

Subsets ⊆ and supersets ⊇

The following statements are equivalent for any $L,R\subseteq X:$Template:Sfn

1. $L\subseteq R$
   • Definition of Template:Em: if $l\in L$ then $l\in R$
3. $L\cap R=L$
4. $L\cup R=R$
5. $L\mathrm{△}R=R\setminus L$
6. $L\mathrm{△}R\subseteq R\setminus L$
7. $L\setminus R=\varnothing$
8. $L$ and $X\setminus R$ are disjoint (that is, $L\cap (X\setminus R)=\varnothing$)
9. $X\setminus R\subseteq X\setminus L$ (that is, $R^{\complement }\subseteq L^{\complement }$)

The following statements are equivalent for any $L,R\subseteq X:$

1. $L\subseteq ̸R$
2. There exists some $l\in L\setminus R.$

Set equality

The following statements are equivalent:

1. $L=R$
2. $L\mathrm{△}R=\varnothing$
3. $L\setminus R=R\setminus L$

• If $L\cap R=\varnothing$ then $L=R$ if and only if $L=\varnothing =R.$
• Uniqueness of complements: If $L\cup R=X\text{ and }L\cap R=\varnothing$ then $R=X\setminus L$

Empty set

A set $L$ is empty if the sentence $\mathrm{\forall }x(x\in ̸L)$ is true, where the notation $x\in ̸L$ is shorthand for $\mathrm{\neg }(x\in L).$

If $L$ is any set then the following are equivalent:

1. $L$ is not empty, meaning that the sentence $\mathrm{\neg }[\mathrm{\forall }x(x\in ̸L)]$ is true (literally, the logical negation of "$L$ is empty" holds true).
2. (In classical mathematics) $L$ is inhabited, meaning: $\mathrm{\exists }x(x\in L)$
   • In constructive mathematics, "not empty" and "inhabited" are not equivalent: every inhabited set is not empty but the converse is not always guaranteed; that is, in constructive mathematics, a set $L$ that is not empty (where by definition, "$L$ is empty" means that the statement $\mathrm{\forall }x(x\in ̸L)$ is true) might not have an inhabitant (which is an $x$ such that $x\in L$).
3. $L\subseteq ̸R$ for some set $R$

If $L$ is any set then the following are equivalent:

1. $L$ is empty ($L=\varnothing$), meaning: $\mathrm{\forall }x(x\in ̸L)$
2. $L\cup R\subseteq R$ for every set $R$
3. $L\subseteq R$ for every set $R$
4. $L\subseteq R\setminus L$ for some/every set $R$
5. $\varnothing /L=L$

Given any $x,$ the following are equivalent:

1. $x\in ̸L\setminus R$
2. $x\in L\cap R\text{ or }x\in ̸L.$
3. $x\in R\text{ or }x\in ̸L.$

Moreover, $$(L\setminus R)\cap R=\varnothing \text{ always holds}.$$

Meets, Joins, and lattice properties

Inclusion is a partial order: Explicitly, this means that inclusion $\subseteq ,$ which is a binary operation, has the following three properties:Template:Sfn

• Reflexivity: $L\subseteq L$
• Antisymmetry: $(L\subseteq R\text{ and }R\subseteq L)\text{ if and only if }L=R$
• Transitivity: $\text{If }L\subseteq M\text{ and }M\subseteq R\text{ then }L\subseteq R$

The following proposition says that for any set $S,$ the power set of $S,$ ordered by inclusion, is a bounded lattice, and hence together with the distributive and complement laws above, show that it is a Boolean algebra.

Existence of a least element and a greatest element: $$\varnothing \subseteq L\subseteq X$$

Joins/supremums exist:Template:Sfn $$L\subseteq L\cup R$$

The union $L\cup R$ is the join/supremum of $L$ and $R$ with respect to $\subseteq$ because:

1. $L\subseteq L\cup R$ and $R\subseteq L\cup R,$ and
2. if $Z$ is a set such that $L\subseteq Z$ and $R\subseteq Z$ then $L\cup R\subseteq Z.$

The intersection $L\cap R$ is the join/supremum of $L$ and $R$ with respect to $\supseteq .$

Meets/infimums exist:Template:Sfn $$L\cap R\subseteq L$$

The intersection $L\cap R$ is the meet/infimum of $L$ and $R$ with respect to $\subseteq$ because:

1. if $L\cap R\subseteq L$ and $L\cap R\subseteq R,$ and
2. if $Z$ is a set such that $Z\subseteq L$ and $Z\subseteq R$ then $Z\subseteq L\cap R.$

The union $L\cup R$ is the meet/infimum of $L$ and $R$ with respect to $\supseteq .$

Other inclusion properties:

$$L\setminus R\subseteq L$$ $$(L\setminus R)\cap L=L\setminus R$$

• If $L\subseteq R$ then $L\mathrm{△}R=R\setminus L.$
• If $L\subseteq X$ and $R\subseteq Y$ then $L\times R\subseteq X\times Y$Template:Sfn

Three sets involved

In the left hand sides of the following identities, $L$ is the Template:EmTemplate:Hspeft most set, $M$ is the Template:EmTemplate:Hspiddle set, and $R$ is the Template:EmTemplate:Hspight most set.

Precedence rules

There is no universal agreement on the order of precedence of the basic set operators. Nevertheless, many authors use precedence rules for set operators, although these rules vary with the author.

One common convention is to associate intersection $L\cap R=\{x:(x\in L)\wedge (x\in R)\}$ with logical conjunction (and) $L\wedge R$ and associate union $L\cup R=\{x:(x\in L)\vee (x\in R)\}$ with logical disjunction (or) $L\vee R,$ and then transfer the precedence of these logical operators (where $\wedge$ has precedence over $\vee$) to these set operators, thereby giving $\cap$ precedence over $\cup .$ So for example, $L\cup M\cap R$ would mean $L\cup (M\cap R)$ since it would be associated with the logical statement $L\vee M\wedge R=L\vee (M\wedge R)$ and similarly, $L\cup M\cap R\cup Z$ would mean $L\cup (M\cap R)\cup Z$ since it would be associated with $L\vee M\wedge R\vee Z=L\vee (M\wedge R)\vee Z.$

Sometimes, set complement (subtraction) $\setminus$ is also associated with logical complement (not) $\mathrm{\neg },$ in which case it will have the highest precedence. More specifically, $L\setminus R=\{x:(x\in L)\wedge \mathrm{\neg }(x\in R)\}$ is rewritten $L\wedge \mathrm{\neg }R$ so that for example, $L\cup M\setminus R$ would mean $L\cup (M\setminus R)$ since it would be rewritten as the logical statement $L\vee M\wedge \mathrm{\neg }R$ which is equal to $L\vee (M\wedge \mathrm{\neg }R).$ For another example, because $L\wedge \mathrm{\neg }M\wedge R$ means $L\wedge (\mathrm{\neg }M)\wedge R,$ which is equal to both $(L\wedge (\mathrm{\neg }M))\wedge R$ and $L\wedge ((\mathrm{\neg }M)\wedge R)=L\wedge (R\wedge (\mathrm{\neg }M))$ (where $(\mathrm{\neg }M)\wedge R$ was rewritten as $R\wedge (\mathrm{\neg }M)$), the formula $L\setminus M\cap R$ would refer to the set $(L\setminus M)\cap R=L\cap (R\setminus M);$ moreover, since $L\wedge (\mathrm{\neg }M)\wedge R=(L\wedge R)\wedge \mathrm{\neg }M,$ this set is also equal to $(L\cap R)\setminus M$ (other set identities can similarly be deduced from propositional calculus identities in this way). However, because set subtraction is not associative $(L\setminus M)\setminus R\ne L\setminus (M\setminus R),$ a formula such as $L\setminus M\setminus R$ would be ambiguous; for this reason, among others, set subtraction is often not assigned any precedence at all.

Symmetric difference $L\mathrm{△}R=\{x:(x\in L)\oplus (x\in R)\}$ is sometimes associated with exclusive or (xor) $L\oplus R$ (also sometimes denoted by $⊻$), in which case if the order of precedence from highest to lowest is $\mathrm{\neg },\oplus ,\wedge ,\vee$ then the order of precedence (from highest to lowest) for the set operators would be $\setminus ,\mathrm{△},\cap ,\cup .$ There is no universal agreement on the precedence of exclusive disjunction $\oplus$ with respect to the other logical connectives, which is why symmetric difference $\mathrm{△}$ is not often assigned a precedence.

Associativity

Definition: A binary operator $\ast$ is called associative if $(L\ast M)\ast R=L\ast (M\ast R)$ always holds.

The following set operators are associative:Template:Sfn

$$\begin{array}{cccc}(L\cup M)\cup R& =& & L\cup (M\cup R)\\ (L\cap M)\cap R& =& & L\cap (M\cap R)\\ (L\mathrm{△}M)\mathrm{△}R& =& & L\mathrm{△}(M\mathrm{△}R)\\ \end{array}$$

For set subtraction, instead of associativity, only the following is always guaranteed: $$(L\setminus M)\setminus R\subseteq L\setminus (M\setminus R)$$ where equality holds if and only if $L\cap R=\varnothing$ (this condition does not depend on $M$). Thus $(L\setminus M)\setminus R=L\setminus (M\setminus R)$ if and only if $(R\setminus M)\setminus L=R\setminus (M\setminus L),$ where the only difference between the left and right hand side set equalities is that the locations of $L\text{ and }R$ have been swapped.

Distributivity

Definition: If $\ast \text{ and }\bullet$ are binary operators then Template:Em if $$L\ast (M\bullet R)=(L\ast M)\bullet (L\ast R)\text{ for all }L,M,R$$ while Template:Em if $$(L\bullet M)\ast R=(L\ast R)\bullet (M\ast R)\text{ for all }L,M,R.$$ The operator Template:Em if it both left distributes and right distributes over $\bullet .$ In the definitions above, to transform one side to the other, the innermost operator (the operator inside the parentheses) becomes the outermost operator and the outermost operator becomes the innermost operator.

Right distributivity:Template:Sfn

$$\begin{array}{cccccccccc}(L\cap M)\cup R& =& & (L\cup R)& & \cap & & (M\cup R)& & \text{ (Right-distributivity of }\cup \text{ over }\cap \text{)}\\ (L\cup M)\cup R& =& & (L\cup R)& & \cup & & (M\cup R)& & \text{ (Right-distributivity of }\cup \text{ over }\cup \text{)}\\ (L\cup M)\cap R& =& & (L\cap R)& & \cup & & (M\cap R)& & \text{ (Right-distributivity of }\cap \text{ over }\cup \text{)}\\ (L\cap M)\cap R& =& & (L\cap R)& & \cap & & (M\cap R)& & \text{ (Right-distributivity of }\cap \text{ over }\cap \text{)}\\ (L\mathrm{△}M)\cap R& =& & (L\cap R)& & \mathrm{△}& & (M\cap R)& & \text{ (Right-distributivity of }\cap \text{ over }\mathrm{△}\text{)}\\ (L\cap M)\times R& =& & (L\times R)& & \cap & & (M\times R)& & \text{ (Right-distributivity of }\times \text{ over }\cap \text{)}\\ (L\cup M)\times R& =& & (L\times R)& & \cup & & (M\times R)& & \text{ (Right-distributivity of }\times \text{ over }\cup \text{)}\\ (L\setminus M)\times R& =& & (L\times R)& & \setminus & & (M\times R)& & \text{ (Right-distributivity of }\times \text{ over }\setminus \text{)}\\ (L\mathrm{△}M)\times R& =& & (L\times R)& & \mathrm{△}& & (M\times R)& & \text{ (Right-distributivity of }\times \text{ over }\mathrm{△}\text{)}\\ (L\cup M)\setminus R& =& & (L\setminus R)& & \cup & & (M\setminus R)& & \text{ (Right-distributivity of }\setminus \text{ over }\cup \text{)}\\ (L\cap M)\setminus R& =& & (L\setminus R)& & \cap & & (M\setminus R)& & \text{ (Right-distributivity of }\setminus \text{ over }\cap \text{)}\\ (L\mathrm{△}M)\setminus R& =& & (L\setminus R)& & \mathrm{△}& & (M\setminus R)& & \text{ (Right-distributivity of }\setminus \text{ over }\mathrm{△}\text{)}\\ (L\setminus M)\setminus R& =& & (L\setminus R)& & \setminus & & (M\setminus R)& & \text{ (Right-distributivity of }\setminus \text{ over }\setminus \text{)}\\ & =& & L& & \setminus & & (M\cup R)\\ \end{array}$$

Left distributivity:Template:Sfn

$$\begin{array}{cccccc}L\cup (M\cap R)& =& & (L\cup M)\cap (L\cup R)& & \text{ (Left-distributivity of }\cup \text{ over }\cap \text{)}\\ L\cup (M\cup R)& =& & (L\cup M)\cup (L\cup R)& & \text{ (Left-distributivity of }\cup \text{ over }\cup \text{)}\\ L\cap (M\cup R)& =& & (L\cap M)\cup (L\cap R)& & \text{ (Left-distributivity of }\cap \text{ over }\cup \text{)}\\ L\cap (M\cap R)& =& & (L\cap M)\cap (L\cap R)& & \text{ (Left-distributivity of }\cap \text{ over }\cap \text{)}\\ L\cap (M\mathrm{△}R)& =& & (L\cap M)\mathrm{△}(L\cap R)& & \text{ (Left-distributivity of }\cap \text{ over }\mathrm{△}\text{)}\\ L\times (M\cap R)& =& & (L\times M)\cap (L\times R)& & \text{ (Left-distributivity of }\times \text{ over }\cap \text{)}\\ L\times (M\cup R)& =& & (L\times M)\cup (L\times R)& & \text{ (Left-distributivity of }\times \text{ over }\cup \text{)}\\ L\times (M\setminus R)& =& & (L\times M)\setminus (L\times R)& & \text{ (Left-distributivity of }\times \text{ over }\setminus \text{)}\\ L\times (M\mathrm{△}R)& =& & (L\times M)\mathrm{△}(L\times R)& & \text{ (Left-distributivity of }\times \text{ over }\mathrm{△}\text{)}\\ \end{array}$$

Distributivity and symmetric difference Template:Math

Intersection distributes over symmetric difference: $$\begin{array}{cccccc}L\cap (M\mathrm{△}R)& =& & (L\cap M)\mathrm{△}(L\cap R)& & \\ \end{array}$$ $$\begin{array}{cccccc}(L\mathrm{△}M)\cap R& =& & (L\cap R)\mathrm{△}(M\cap R)& & \\ \end{array}$$

Union does not distribute over symmetric difference because only the following is guaranteed in general: $$\begin{array}{ccccccc}L\cup (M\mathrm{△}R)\supseteq (L\cup M)\mathrm{△}(L\cup R)& =& & (M\mathrm{△}R)\setminus L& =& & (M\setminus L)\mathrm{△}(R\setminus L)\\ \end{array}$$

Symmetric difference does not distribute over itself: $$L\mathrm{△}(M\mathrm{△}R)\ne (L\mathrm{△}M)\mathrm{△}(L\mathrm{△}R)=M\mathrm{△}R$$ and in general, for any sets $L\text{ and }A$ (where $A$ represents $M\mathrm{△}R$), $L\mathrm{△}A$ might not be a subset, nor a superset, of $L$ (and the same is true for $A$).

Distributivity and set subtraction Template:Math

Failure of set subtraction to left distribute:

Set subtraction is Template:Em distributive over itself. However, set subtraction is Template:Em left distributive over itself because only the following is guaranteed in general: $$\begin{array}{cccc}L\setminus (M\setminus R)& \supseteq & & (L\setminus M)\setminus (L\setminus R)=L\cap R\setminus M\\ \end{array}$$ where equality holds if and only if $L\setminus M=L\cap R,$ which happens if and only if $L\cap M\cap R=\varnothing \text{ and }L\setminus M\subseteq R.$

For symmetric difference, the sets $L\setminus (M\mathrm{△}R)$ and $(L\setminus M)\mathrm{△}(L\setminus R)=L\cap (M\mathrm{△}R)$ are always disjoint. So these two sets are equal if and only if they are both equal to $\varnothing .$ Moreover, $L\setminus (M\mathrm{△}R)=\varnothing$ if and only if $L\cap M\cap R=\varnothing \text{ and }L\subseteq M\cup R.$

To investigate the left distributivity of set subtraction over unions or intersections, consider how the sets involved in (both of) De Morgan's laws are all related: $$\begin{array}{cccc}(L\setminus M)\cap (L\setminus R)=L\setminus (M\cup R)& \subseteq & & L\setminus (M\cap R)=(L\setminus M)\cup (L\setminus R)\\ \end{array}$$ always holds (the equalities on the left and right are De Morgan's laws) but equality is not guaranteed in general (that is, the containment $\subseteq$ might be strict). Equality holds if and only if $L\setminus (M\cap R)\subseteq L\setminus (M\cup R),$ which happens if and only if $L\cap M=L\cap R.$

This observation about De Morgan's laws shows that $\setminus$ is Template:Em left distributive over $\cup$ or $\cap$ because only the following are guaranteed in general: $$\begin{array}{cccc}L\setminus (M\cup R)& \subseteq & & (L\setminus M)\cup (L\setminus R)=L\setminus (M\cap R)\\ \end{array}$$ $$\begin{array}{cccc}L\setminus (M\cap R)& \supseteq & & (L\setminus M)\cap (L\setminus R)=L\setminus (M\cup R)\\ \end{array}$$ where equality holds for one (or equivalently, for both) of the above two inclusion formulas if and only if $L\cap M=L\cap R.$

The following statements are equivalent:

1. $L\cap M=L\cap R$
2. $L\setminus M=L\setminus R$
3. $L\setminus (M\cap R)=(L\setminus M)\cap (L\setminus R);$ that is, $\setminus$ left distributes over $\cap$ for these three particular sets
4. $L\setminus (M\cup R)=(L\setminus M)\cup (L\setminus R);$ that is, $\setminus$ left distributes over $\cup$ for these three particular sets
5. $L\setminus (M\cap R)=L\setminus (M\cup R)$
6. $L\cap (M\cup R)=L\cap M\cap R$
7. $L\cap (M\cup R)\subseteq M\cap R$
8. $L\cap R\subseteq M$ and $L\cap M\subseteq R$
9. $L\setminus (M\setminus R)=L\setminus (R\setminus M)$
10. $L\setminus (M\setminus R)=L\setminus (R\setminus M)=L$

Quasi-commutativity: $$(L\setminus M)\setminus R=(L\setminus R)\setminus M\text{ (Quasi-commutative)}$$ always holds but in general, $$L\setminus (M\setminus R)\ne L\setminus (R\setminus M).$$ However, $L\setminus (M\setminus R)\subseteq L\setminus (R\setminus M)$ if and only if $L\cap R\subseteq M$ if and only if $L\setminus (R\setminus M)=L.$

Set subtraction complexity: To manage the many identities involving set subtraction, this section is divided based on where the set subtraction operation and parentheses are located on the left hand side of the identity. The great variety and (relative) complexity of formulas involving set subtraction (compared to those without it) is in part due to the fact that unlike $\cup ,\cap ,$ and $\mathrm{△},$ set subtraction is neither associative nor commutative and it also is not left distributive over $\cup ,\cap ,\mathrm{△},$ or even over itself.

Two set subtractions

Set subtraction is Template:Em associative in general: $$(L\setminus M)\setminus R\ne L\setminus (M\setminus R)$$ since only the following is always guaranteed: $$(L\setminus M)\setminus R\subseteq L\setminus (M\setminus R).$$

Template:Math

$$\begin{array}{cccc}(L\setminus M)\setminus R& =& & L\setminus (M\cup R)\\ & =(& & L\setminus R)\setminus M\\ & =(& & L\setminus M)\cap (L\setminus R)\\ & =(& & L\setminus R)\setminus M\\ & =(& & L\setminus R)\setminus (M\setminus R)\\ \end{array}$$

Template:Math

$$\begin{array}{cc}L\setminus (M\setminus R)& =(L\setminus M)\cup (L\cap R)\\ \end{array}$$

• If $L\subseteq M\text{ then }L\setminus (M\setminus R)=L\cap R$
• $L\setminus (M\setminus R)\subseteq (L\setminus M)\cup R$ with equality if and only if $R\subseteq L.$

One set subtraction

Template:Math

Set subtraction on the left, and parentheses on the Template:Em

$$\begin{array}{cc}(L\setminus M)\cup R& =(L\cup R)\setminus (M\setminus R)\\ & =(L\setminus (M\cup R))\cup R\text{ (the outermost union is disjoint) }\\ \end{array}$$

$\begin{array}{cccc}(L\setminus M)\cap R& =(& & L\cap R)\setminus (M\cap R)\text{ (Distributive law of }\cap \text{ over }\setminus \text{ )}\\ & =(& & L\cap R)\setminus M\\ & =& & L\cap (R\setminus M)\\ \end{array}$Template:Sfn

$$\begin{array}{cccc}(L\setminus M)\cap (L\setminus R)=L\setminus (M\cup R)& \subseteq & & L\setminus (M\cap R)=(L\setminus M)\cup (L\setminus R)\\ \end{array}$$ $$\begin{array}{cc}(L\setminus M)\mathrm{△}R& =(L\setminus (M\cup R))\cup (R\setminus L)\cup (L\cap M\cap R)\text{ (the three outermost sets are pairwise disjoint) }\\ \end{array}$$

$$(L\setminus M)\times R=(L\times R)\setminus (M\times R)\text{ (Distributivity)}$$

Template:Math

Set subtraction on the left, and parentheses on the Template:Em

$$\begin{array}{cccccc}L\setminus (M\cup R)& =(L\setminus M)& & \cap (& & L\setminus R)\text{ (De Morgan's law) }\\ & =(L\setminus M)& & \setminus & & R\\ & =(L\setminus R)& & \setminus & & M\\ \end{array}$$

$$\begin{array}{cc}L\setminus (M\cap R)& =(L\setminus M)\cup (L\setminus R)\text{ (De Morgan's law) }\\ \end{array}$$ where the above two sets that are the subjects of De Morgan's laws always satisfy $L\setminus (M\cup R)\subseteq L\setminus (M\cap R).$

$$\begin{array}{cc}L\setminus (M\mathrm{△}R)& =(L\setminus (M\cup R))\cup (L\cap M\cap R)\text{ (the outermost union is disjoint) }\\ \end{array}$$

Template:Math

Set subtraction on the right, and parentheses on the Template:Em

$$\begin{array}{cc}(L\cup M)\setminus R& =(L\setminus R)\cup (M\setminus R)\\ \end{array}$$

$$\begin{array}{cccccc}(L\cap M)\setminus R& =(& & L\setminus R)& & \cap (M\setminus R)\\ & =& & L& & \cap (M\setminus R)\\ & =& & M& & \cap (L\setminus R)\\ \end{array}$$

$$\begin{array}{cccc}(L\mathrm{△}M)\setminus R& =(L\setminus R)& & \mathrm{△}(M\setminus R)\\ & =(L\cup R)& & \mathrm{△}(M\cup R)\\ \end{array}$$

Template:Math

Set subtraction on the right, and parentheses on the Template:Em

$$\begin{array}{cccccccccccc}L\cup (M\setminus R)& =& & & & L& & \cup & & (M\setminus (R\cup L))& & \text{ (the outermost union is disjoint) }\\ & =[& & (& & L\setminus M)& & \cup & & (R\cap L)]\cup (M\setminus R)& & \text{ (the outermost union is disjoint) }\\ & =& & (& & L\setminus (M\cup R))& & \cup & & (R\cap L)\cup (M\setminus R)& & \text{ (the three outermost sets are pairwise disjoint) }\\ \end{array}$$

$\begin{array}{cccccc}L\cap (M\setminus R)& =(& & L\cap M)& & \setminus (L\cap R)\text{ (Distributive law of }\cap \text{ over }\setminus \text{ )}\\ & =(& & L\cap M)& & \setminus R\\ & =& & M& & \cap (L\setminus R)\\ & =(& & L\setminus R)& & \cap (M\setminus R)\\ \end{array}$Template:Sfn

$$L\times (M\setminus R)=(L\times M)\setminus (L\times R)\text{ (Distributivity)}$$

Three operations on three sets

Template:Math

Operations of the form $(L\bullet M)\ast (M\bullet R)$:

$$\begin{array}{cccccccccccc}(L\cup M)& \cup & & (& & M\cup R)& & & & =& & L\cup M\cup R\\ (L\cup M)& \cap & & (& & M\cup R)& & & & =& & M\cup (L\cap R)\\ (L\cup M)& \setminus & & (& & M\cup R)& & & & =& & L\setminus (M\cup R)\\ (L\cup M)& \mathrm{△}& & (& & M\cup R)& & & & =& & (L\setminus (M\cup R))\cup (R\setminus (L\cup M))\\ & & & & & & & & & =& & (L\mathrm{△}R)\setminus M\\ (L\cap M)& \cup & & (& & M\cap R)& & & & =& & M\cap (L\cup R)\\ (L\cap M)& \cap & & (& & M\cap R)& & & & =& & L\cap M\cap R\\ (L\cap M)& \setminus & & (& & M\cap R)& & & & =& & (L\cap M)\setminus R\\ (L\cap M)& \mathrm{△}& & (& & M\cap R)& & & & =& & [(L\cap M)\cup (M\cap R)]\setminus (L\cap M\cap R)\\ (L\setminus M)& \cup & & (& & M\setminus R)& & & & =& & (L\cup M)\setminus (M\cap R)\\ (L\setminus M)& \cap & & (& & M\setminus R)& & & & =& & \varnothing \\ (L\setminus M)& \setminus & & (& & M\setminus R)& & & & =& & L\setminus M\\ (L\setminus M)& \mathrm{△}& & (& & M\setminus R)& & & & =& & (L\setminus M)\cup (M\setminus R)\\ & & & & & & & & & =& & (L\cup M)\setminus (M\cap R)\\ (L\mathrm{△}M)& \cup & & (& & M\mathrm{△}R)& & & & =& & (L\cup M\cup R)\setminus (L\cap M\cap R)\\ (L\mathrm{△}M)& \cap & & (& & M\mathrm{△}R)& & & & =& & ((L\cap R)\setminus M)\cup (M\setminus (L\cup R))\\ (L\mathrm{△}M)& \setminus & & (& & M\mathrm{△}R)& & & & =& & (L\setminus (M\cup R))\cup ((M\cap R)\setminus L)\\ (L\mathrm{△}M)& \mathrm{△}& & (& & M\mathrm{△}R)& & & & =& & L\mathrm{△}R\\ \end{array}$$

Template:Math

Operations of the form $(L\bullet M)\ast (R\setminus M)$:

$$\begin{array}{cccccccccccc}(L\cup M)& \cup & & (& & R\setminus M)& & & & =& & L\cup M\cup R\\ (L\cup M)& \cap & & (& & R\setminus M)& & & & =& & (L\cap R)\setminus M\\ (L\cup M)& \setminus & & (& & R\setminus M)& & & & =& & M\cup (L\setminus R)\\ (L\cup M)& \mathrm{△}& & (& & R\setminus M)& & & & =& & M\cup (L\mathrm{△}R)\\ (L\cap M)& \cup & & (& & R\setminus M)& & & & =& & [L\cap (M\cup R)]\cup [R\setminus (L\cup M)]\text{ (disjoint union)}\\ & & & & & & & & & =& & (L\cap M)\mathrm{△}(R\setminus M)\\ (L\cap M)& \cap & & (& & R\setminus M)& & & & =& & \varnothing \\ (L\cap M)& \setminus & & (& & R\setminus M)& & & & =& & L\cap M\\ (L\cap M)& \mathrm{△}& & (& & R\setminus M)& & & & =& & (L\cap M)\cup (R\setminus M)\text{ (disjoint union)}\\ (L\setminus M)& \cup & & (& & R\setminus M)& & & & =& & L\cup R\setminus M\\ (L\setminus M)& \cap & & (& & R\setminus M)& & & & =& & (L\cap R)\setminus M\\ (L\setminus M)& \setminus & & (& & R\setminus M)& & & & =& & L\setminus (M\cup R)\\ (L\setminus M)& \mathrm{△}& & (& & R\setminus M)& & & & =& & (L\mathrm{△}R)\setminus M\\ (L\mathrm{△}M)& \cup & & (& & R\setminus M)& & & & =& & (L\cup M\cup R)\setminus (L\cap M)\\ (L\mathrm{△}M)& \cap & & (& & R\setminus M)& & & & =& & (L\cap R)\setminus M\\ (L\mathrm{△}M)& \setminus & & (& & R\setminus M)& & & & =& & [L\setminus (M\cup R)]\cup (M\setminus L)\text{ (disjoint union)}\\ & & & & & & & & & =& & (L\mathrm{△}M)\setminus (L\cap R)\\ (L\mathrm{△}M)& \mathrm{△}& & (& & R\setminus M)& & & & =& & L\mathrm{△}(M\cup R)\\ \end{array}$$

Template:Math

Operations of the form $(L\setminus M)\ast (L\setminus R)$:

$$\begin{array}{cccccccccc}(L\setminus M)& \cup & & (& & L\setminus R)& & =& & L\setminus (M\cap R)\\ (L\setminus M)& \cap & & (& & L\setminus R)& & =& & L\setminus (M\cup R)\\ (L\setminus M)& \setminus & & (& & L\setminus R)& & =& & (L\cap R)\setminus M\\ (L\setminus M)& \mathrm{△}& & (& & L\setminus R)& & =& & L\cap (M\mathrm{△}R)\\ & & & & & & & =& & (L\cap M)\mathrm{△}(L\cap R)\\ \end{array}$$

Other simplifications

Other properties:

$$L\cap M=R\text{ and }L\cap R=M\text{ if and only if }M=R\subseteq L.$$

• If $L\subseteq M$ then $L\setminus R=L\cap (M\setminus R).$Template:Sfn
• $L\times (M\setminus R)=(L\times M)\setminus (L\times R)$
• If $L\subseteq R$ then $M\setminus R\subseteq M\setminus L.$
• $L\cap M\cap R=\varnothing$ if and only if for any $x\in L\cup M\cup R,$ $x$ belongs to Template:Em of the sets $L,M,\text{ and }R.$

Symmetric difference ∆ of finitely many sets

Given finitely many sets $L_1,\dots ,L_n,$ something belongs to their symmetric difference if and only if it belongs to an odd number of these sets. Explicitly, for any $x,$ $x\in L_1\mathrm{△}\cdots \mathrm{△}{L}_n$ if and only if the cardinality $\left|\{i:x\in L_i\}\right|$ is odd. (Recall that symmetric difference is associative so parentheses are not needed for the set $L_1\mathrm{△}\cdots \mathrm{△}{L}_n$).

Consequently, the symmetric difference of three sets satisfies: $$\begin{array}{cc}L\mathrm{△}M\mathrm{△}R& =(L\cap M\cap R)\cup \{x:x\text{ belongs to exactly one of the sets }L,M,R\}\text{ (the union is disjoint) }\\ & =[L\cap M\cap R]\cup [L\setminus (M\cup R)]\cup [M\setminus (L\cup R)]\cup [R\setminus (L\cup M)]\text{ (all 4 sets enclosed by [ ] are pairwise disjoint) }\\ \end{array}$$

Cartesian products Template:Math of finitely many sets

Binary Template:Math distributes over Template:Math and Template:Math and Template:Math and Template:Math

The binary Cartesian product ⨯ distributes over unions, intersections, set subtraction, and symmetric difference:

$$\begin{array}{cccccccccc}(L\cap M)\times R& =& & (L\times R)& & \cap & & (M\times R)& & \text{ (Right-distributivity of }\times \text{ over }\cap \text{)}\\ (L\cup M)\times R& =& & (L\times R)& & \cup & & (M\times R)& & \text{ (Right-distributivity of }\times \text{ over }\cup \text{)}\\ (L\setminus M)\times R& =& & (L\times R)& & \setminus & & (M\times R)& & \text{ (Right-distributivity of }\times \text{ over }\setminus \text{)}\\ (L\mathrm{△}M)\times R& =& & (L\times R)& & \mathrm{△}& & (M\times R)& & \text{ (Right-distributivity of }\times \text{ over }\mathrm{△}\text{)}\\ \end{array}$$

$$\begin{array}{cccccc}L\times (M\cap R)& =& & (L\times M)\cap (L\times R)& & \text{ (Left-distributivity of }\times \text{ over }\cap \text{)}\\ L\times (M\cup R)& =& & (L\times M)\cup (L\times R)& & \text{ (Left-distributivity of }\times \text{ over }\cup \text{)}\\ L\times (M\setminus R)& =& & (L\times M)\setminus (L\times R)& & \text{ (Left-distributivity of }\times \text{ over }\setminus \text{)}\\ L\times (M\mathrm{△}R)& =& & (L\times M)\mathrm{△}(L\times R)& & \text{ (Left-distributivity of }\times \text{ over }\mathrm{△}\text{)}\\ \end{array}$$

But in general, ⨯ does not distribute over itself: $$L\times (M\times R)\ne (L\times M)\times (L\times R)$$ $$(L\times M)\times R\ne (L\times R)\times (M\times R).$$

Binary Template:Math of finite Template:Math

$$(L\times R)\cap (L_2\times R_2)=(L\cap L_2)\times (R\cap R_2)$$ $$(L\times M\times R)\cap (L_2\times M_2\times R_2)=(L\cap L_2)\times (M\cap M_2)\times (R\cap R_2)$$

Binary Template:Math of finite Template:Math

$$\begin{array}{cc}(L\times R)\cup (L_2\times R_2)& =[(L\setminus L_2)\times R]\cup [(L_2\setminus L)\times R_2]\cup [(L\cap L_2)\times (R\cup R_2)]\\ & =[L\times (R\setminus R_2)]\cup [L_2\times (R_2\setminus R)]\cup [(L\cup L_2)\times (R\cap R_2)]\\ \end{array}$$

Difference Template:Math of finite Template:Math

$$\begin{array}{cc}(L\times R)\setminus (L_2\times R_2)& =[(L\setminus L_2)\times R]\cup [L\times (R\setminus R_2)]\\ \end{array}$$ and $$(L\times M\times R)\setminus (L_2\times M_2\times R_2)=[(L\setminus L_2)\times M\times R]\cup [L\times (M\setminus M_2)\times R]\cup [L\times M\times (R\setminus R_2)]$$

Finite Template:Math of differences Template:Math

$$(L\setminus L_2)\times (R\setminus R_2)=(L\times R)\setminus [(L_2\times R)\cup (L\times R_2)]$$

$$(L\setminus L_2)\times (M\setminus M_2)\times (R\setminus R_2)=(L\times M\times R)\setminus [(L_2\times M\times R)\cup (L\times M_2\times R)\cup (L\times M\times R_2)]$$

Symmetric difference Template:Math and finite Template:Math

$$L\times \left(R\mathrm{△}{R}_2\right)=[L\times (R\setminus R_2)]\cup [L\times (R_2\setminus R)]$$ $$\left(L\mathrm{△}{L}_2\right)\times R=[(L\setminus L_2)\times R]\cup [(L_2\setminus L)\times R]$$

$$\begin{array}{cccccc}\left(L\mathrm{△}{L}_2\right)\times \left(R\mathrm{△}{R}_2\right)& =& & & & [(L\cup L_2)\times (R\cup R_2)]\setminus [((L\cap L_2)\times R)\cup (L\times (R\cap R_2))]\\ & =& & & & [(L\setminus L_2)\times (R_2\setminus R)]\cup [(L_2\setminus L)\times (R_2\setminus R)]\cup [(L\setminus L_2)\times (R\setminus R_2)]\cup [(L_2\setminus L)\cup (R\setminus R_2)]\\ \end{array}$$

$$\begin{array}{cc}\left(L\mathrm{△}{L}_2\right)\times \left(M\mathrm{△}{M}_2\right)\times \left(R\mathrm{△}{R}_2\right)& =[(L\cup L_2)\times (M\cup M_2)\times (R\cup R_2)]\setminus [((L\cap L_2)\times M\times R)\cup (L\times (M\cap M_2)\times R)\cup (L\times M\times (R\cap R_2))]\\ \end{array}$$

In general, $\left(L\mathrm{△}{L}_2\right)\times \left(R\mathrm{△}{R}_2\right)$ need not be a subset nor a superset of $(L\times R)\mathrm{△}(L_2\times R_2).$

$$\begin{array}{cccc}(L\times R)\mathrm{△}(L_2\times R_2)& =& & (L\times R)\cup (L_2\times R_2)\setminus [(L\cap L_2)\times (R\cap R_2)]\\ \end{array}$$

$$\begin{array}{cccc}(L\times M\times R)\mathrm{△}(L_2\times M_2\times R_2)& =& & (L\times M\times R)\cup (L_2\times M_2\times R_2)\setminus [(L\cap L_2)\times (M\cap M_2)\times (R\cap R_2)]\\ \end{array}$$

Arbitrary families of sets

Let ${\left(L_i\right)}_{i\in I},$ ${\left(R_j\right)}_{j\in J},$ and ${\left(S_{i,j}\right)}_{(i,j)\in I\times J}$ be indexed families of sets. Whenever the assumption is needed, then all indexing sets, such as $I$ and $J,$ are assumed to be non-empty.

Definitions

A Template:Em or (more briefly) a Template:Em refers to a set whose elements are sets.

An Template:Em is a function from some set, called its Template:Em, into some family of sets. An indexed family of sets will be denoted by ${\left(L_i\right)}_{i\in I},$ where this notation assigns the symbol $I$ for the indexing set and for every index $i\in I,$ assigns the symbol $L_i$ to the value of the function at $i.$ The function itself may then be denoted by the symbol $L_{\bullet },$ which is obtained from the notation ${\left(L_i\right)}_{i\in I}$ by replacing the index $i$ with a bullet symbol $\bullet ;$ explicitly, $L_{\bullet }$ is the function: $$\begin{array}{cccccc}{L}_{\bullet }:& & I& & \to & \{L_i:i\in I\}\\ & & i& & \mapsto & L_i\\ \end{array}$$ which may be summarized by writing $L_{\bullet }={\left(L_i\right)}_{i\in I}.$

Any given indexed family of sets $L_{\bullet }={\left(L_i\right)}_{i\in I}$ (which is a function) can be canonically associated with its image/range $\mathrm{Im}{L}_{\bullet }\stackrel{\text{def}}{=}\{L_i:i\in I\}$ (which is a family of sets). Conversely, any given family of sets $ℬ$ may be associated with the $ℬ$-indexed family of sets $(B{)}_{B\in ℬ},$ which is technically the identity map $ℬ\to ℬ.$ However, this is Template:Em a bijective correspondence because an indexed family of sets $L_{\bullet }={\left(L_i\right)}_{i\in I}$ is Template:Em required to be injective (that is, there may exist distinct indices $i\ne j$ such as $L_i=L_j$), which in particular means that it is possible for distinct indexed families of sets (which are functions) to be associated with the same family of sets (by having the same image/range).

Arbitrary unions definedTemplate:Sfn Template:NumBlk

If $I=\varnothing$ then $\bigcup _{i\in \varnothing }{L}_i=\{x:\text{ there exists }i\in \varnothing \text{ such that }x\in L_i\}=\varnothing ,$ which is somethings called the Template:Em (despite being called a convention, this equality follows from the definition).

If $ℬ$ is a family of sets then $\cup ℬ$ denotes the set: $$\bigcup ℬ\stackrel{\text{def}}{=}\bigcup _{B\in ℬ}B\stackrel{\text{def}}{=}\{x:\text{ there exists }B\in ℬ\text{ such that }x\in B\}.$$

Arbitrary intersections defined

If $I\ne \varnothing$ thenTemplate:Sfn Template:NumBlk

If $ℬ\ne \varnothing$ is a Template:Em family of sets then $\cap ℬ$ denotes the set: $$\bigcap ℬ\stackrel{\text{def}}{=}\bigcap _{B\in B}B\stackrel{\text{def}}{=}\{x:x\in B\text{ for every }B\in ℬ\}=\{x:\text{ for all }B,\text{ if }B\in ℬ\text{ then }x\in B\}.$$

Nullary intersections

If $I=\varnothing$ then $$\bigcap _{i\in \varnothing }{L}_i=\{x:\text{ for all }i,\text{ if }i\in \varnothing \text{ then }x\in L_i\}$$ where every possible thing $x$ in the universe vacuously satisfied the condition: "if $i\in \varnothing$ then $x\in L_i$". Consequently, $\bigcap _{i\in \varnothing }{L}_i=\{x:\text{ true }\}$ consists of Template:Em in the universe.

So if $I=\varnothing$ and:

1. if you are working in a model in which there exists some [[Universe set|universe Template:Em]] $X$ then $\bigcap _{i\in \varnothing }{L}_i=\{x:x\in L_i\text{ for every }i\in \varnothing \}=X.$
2. otherwise, if you are working in a model in which "the class of all things $x$" is not a set (by far the most common situation) then $\bigcap _{i\in \varnothing }{L}_i$ is Template:Em because $\bigcap _{i\in \varnothing }{L}_i$ consists of Template:Em, which makes $\bigcap _{i\in \varnothing }{L}_i$ a proper class and Template:Em a set.

Assumption: Henceforth, whenever a formula requires some indexing set to be non-empty in order for an arbitrary intersection to be well-defined, then this will automatically be assumed without mention.

A consequence of this is the following assumption/definition:

A Template:Em of sets or an Template:Em refers to the intersection of a finite collection of Template:Em sets.

Some authors adopt the so called Template:Em, which is the convention that an empty intersection of sets is equal to some canonical set. In particular, if all sets are subsets of some set $X$ then some author may declare that the empty intersection of these sets be equal to $X.$ However, the nullary intersection convention is not as commonly accepted as the nullary union convention and this article will not adopt it (this is due to the fact that unlike the empty union, the value of the empty intersection depends on $X$ so if there are multiple sets under consideration, which is commonly the case, then the value of the empty intersection risks becoming ambiguous).

Multiple index sets $$\bigcup _{\stackrel{i\in I,}{j\in J}}{S}_{i,j}\stackrel{\text{def}}{=}\bigcup _{(i,j)\in I\times J}{S}_{i,j}$$ $$\bigcap _{\stackrel{i\in I,}{j\in J}}{S}_{i,j}\stackrel{\text{def}}{=}\bigcap _{(i,j)\in I\times J}{S}_{i,j}$$

Distributing unions and intersections

Binary ⋂ of arbitrary ⋃'sTemplate:Anchor

Template:NumBlk andTemplate:Sfn Template:NumBlk

• If all ${\left(L_i\right)}_{i\in I}$ are pairwise disjoint and all ${\left(R_j\right)}_{j\in J}$ are also pairwise disjoint, then so are all ${(L_i\cap R_j)}_{(i,j)\in I\times J}$ (that is, if $(i,j)\ne (i_2,j_2)$ then $(L_i\cap R_j)\cap (L_{i_2}\cap R_{j_2})=\varnothing$).

• Importantly, if $I=J$ then in general, $$\left(\bigcup _{i\in I}{L}_i\right)\cap \left(\bigcup _{i\in I}{R}_i\right)\ne \bigcup _{i\in I}(L_i\cap R_i)$$ (an example of this is given below). The single union on the right hand side Template:Em be over all pairs $(i,j)\in I\times I:$ $$\left(\bigcup _{i\in I}{L}_i\right)\cap \left(\bigcup _{i\in I}{R}_i\right)=\bigcup _{\stackrel{i\in I,}{j\in I}}(L_i\cap R_j).$$ The same is usually true for other similar non-trivial set equalities and relations that depend on two (potentially unrelated) indexing sets $I$ and $J$ (such as Template:EquationNote or Template:EquationNoteTemplate:Sfn). Two exceptions are Template:EquationNote (unions of unions) and Template:EquationNote (intersections of intersections), but both of these are among the most trivial of set equalities (although even for these equalities there is still something that must be proven).
• Template:Visible anchor: Let $X\ne \varnothing$ and let $I=\{1,2\}.$ Let $L_1:=R_2:=X$ and let $L_2:=R_1:=\varnothing .$ Then $$X=X\cap X=(L_1\cup L_2)\cap (R_2\cup R_2)=\left(\bigcup _{i\in I}{L}_i\right)\cap \left(\bigcup _{i\in I}{R}_i\right)\ne \bigcup _{i\in I}(L_i\cap R_i)=(L_1\cap R_1)\cup (L_2\cap R_2)=\varnothing \cup \varnothing =\varnothing .$$ Furthermore, $$\varnothing =\varnothing \cup \varnothing =(L_1\cap L_2)\cup (R_2\cap R_2)=\left(\bigcap _{i\in I}{L}_i\right)\cup \left(\bigcap _{i\in I}{R}_i\right)\ne \bigcap _{i\in I}(L_i\cup R_i)=(L_1\cup R_1)\cap (L_2\cup R_2)=X\cap X=X.$$

Binary ⋃ of arbitrary ⋂'sTemplate:Anchor

Template:NumBlk andTemplate:Sfn Template:NumBlk

• Importantly, if $I=J$ then in general, $$\left(\bigcap _{i\in I}{L}_i\right)\cup \left(\bigcap _{i\in I}{R}_i\right)\ne \bigcap _{i\in I}(L_i\cup R_i)$$ (an example of this is given above). The single intersection on the right hand side Template:Em be over all pairs $(i,j)\in I\times I:$ $$\left(\bigcap _{i\in I}{L}_i\right)\cup \left(\bigcap _{i\in I}{R}_i\right)=\bigcap _{\stackrel{i\in I,}{j\in I}}(L_i\cup R_j).$$

Arbitrary ⋂'s and arbitrary ⋃'sTemplate:Anchor

Incorrectly distributing by swapping ⋂ and ⋃Template:Anchor

Naively swapping $\bigcup _{i\in I}$ and $\bigcap _{j\in J}$ may produce a different setTemplate:Anchor

The following inclusion always holds: Template:NumBlk

In general, equality need not hold and moreover, the right hand side depends on how for each fixed $i\in I,$ the sets ${\left(S_{i,j}\right)}_{j\in J}$ are labelled; and analogously, the left hand side depends on how for each fixed $j\in J,$ the sets ${\left(S_{i,j}\right)}_{i\in I}$ are labelled. An example demonstrating this is now given.

• Example of dependence on labeling and failure of equality: To see why equality need not hold when $\cup$ and $\cap$ are swapped, let $I:=J:=\{1,2\},$ and let $S_{11}=\{1,2\},S_{12}=\{1,3\},S_{21}=\{3,4\},$ and $S_{22}=\{2,4\}.$ Then $$\{1,4\}=\{1\}\cup \{4\}=(S_{11}\cap S_{12})\cup (S_{21}\cap S_{22})=\bigcup _{i\in I}\left(\bigcap _{j\in J}{S}_{i,j}\right)\ne \bigcap _{j\in J}\left(\bigcup _{i\in I}{S}_{i,j}\right)=(S_{11}\cup S_{21})\cap (S_{12}\cup S_{22})=\{1,2,3,4\}.$$ If $S_{11}$ and $S_{21}$ are swapped while $S_{12}$ and $S_{22}$ are unchanged, which gives rise to the sets ${\hat{S}}_{11}:=\{3,4\},{\hat{S}}_{12}:=\{1,3\},{\hat{S}}_{21}:=\{1,2\},$ and ${\hat{S}}_{22}:=\{2,4\},$ then $$\{2,3\}=\{3\}\cup \{2\}=({\hat{S}}_{11}\cap {\hat{S}}_{12})\cup ({\hat{S}}_{21}\cap {\hat{S}}_{22})=\bigcup _{i\in I}\left(\bigcap _{j\in J}{\hat{S}}_{i,j}\right)\ne \bigcap _{j\in J}\left(\bigcup _{i\in I}{\hat{S}}_{i,j}\right)=({\hat{S}}_{11}\cup {\hat{S}}_{21})\cap ({\hat{S}}_{12}\cup {\hat{S}}_{22})=\{1,2,3,4\}.$$ In particular, the left hand side is no longer $\{1,4\},$ which shows that the left hand side $\bigcup _{i\in I}\bigcap _{j\in J}{S}_{i,j}$ depends on how the sets are labelled. If instead $S_{11}$ and $S_{12}$ are swapped while $S_{21}$ and $S_{22}$ are unchanged, which gives rise to the sets ${\bar{S}}_{11}:=\{1,3\},{\bar{S}}_{12}:=\{1,2\},{\bar{S}}_{21}:=\{3,4\},$ and ${\bar{S}}_{22}:=\{2,4\},$ then both the left hand side and right hand side are equal to $\{1,4\},$ which shows that the right hand side also depends on how the sets are labeled.

Equality in Template:EquationNote can hold under certain circumstances, such as in Template:EquationNote, which is the special case where ${\left(S_{i,j}\right)}_{(i,j)\in I\times J}$ is ${(L_i\setminus R_j)}_{(i,j)\in I\times J}$ (that is, $S_{i,j}:=L_i\setminus R_j$ with the same indexing sets $I$ and $J$), or such as in Template:EquationNote, which is the special case where ${\left(S_{i,j}\right)}_{(i,j)\in I\times J}$ is ${(L_i\setminus R_j)}_{(j,i)\in J\times I}$ (that is, ${\hat{S}}_{j,i}:=L_i\setminus R_j$ with the indexing sets $I$ and $J$ swapped). For a correct formula that extends the distributive laws, an approach other than just switching $\cup$ and $\cap$ is needed.

Correct distributive lawsTemplate:Anchor

Suppose that for each $i\in I,$ $J_i$ is a non-empty index set and for each $j\in J_i,$ let $T_{i,j}$ be any set (for example, to apply this law to ${\left(S_{i,j}\right)}_{(i,j)\in I\times J},$ use $J_i:=J$ for all $i\in I$ and use $T_{i,j}:=S_{i,j}$ for all $i\in I$ and all $j\in J_i=J$). Let $$\prod J_{\bullet }\stackrel{\text{def}}{=}\prod _{i\in I}{J}_i$$ denote the Cartesian product, which can be interpreted as the set of all functions $f:I\to \bigcup _{i\in I}{J}_i$ such that $f(i)\in J_i$ for every $i\in I.$ Such a function may also be denoted using the tuple notation ${\left(f_i\right)}_{i\in I}$ where $f_i\stackrel{\text{def}}{=}f(i)$ for every $i\in I$ and conversely, a tuple ${\left(f_i\right)}_{i\in I}$ is just notation for the function with domain $I$ whose value at $i\in I$ is $f_i;$ both notations can be used to denote the elements of $\prod J_{\bullet }.$ Then Template:NumBlk Template:NumBlk

where $\prod J_{\bullet }\stackrel{\text{def}}{=}\prod _{i\in I}{J}_i.$

Applying the distributive lawsTemplate:Anchor

Template:Em: In the particular case where all $J_i$ are equal (that is, $J_i=J_{i_2}$ for all $i,i_2\in I,$ which is the case with the family ${\left(S_{i,j}\right)}_{(i,j)\in I\times J},$ for example), then letting $J$ denote this common set, the Cartesian product will be $\prod J_{\bullet }\stackrel{\text{def}}{=}\prod _{i\in I}{J}_i=\prod _{i\in I}J=J^I,$ which is the set of all functions of the form $f:I\to J.$ The above set equalities Template:EquationNote and Template:EquationNote, respectively become:Template:Sfn $$\bigcap _{i\in I}\bigcup _{j\in J}{S}_{i,j}=\bigcup _{f\in J^I}\bigcap _{i\in I}{S}_{i,f(i)}$$ $$\bigcup _{i\in I}\bigcap _{j\in J}{S}_{i,j}=\bigcap _{f\in J^I}\bigcup _{i\in I}{S}_{i,f(i)}$$

which when combined with Template:EquationNote implies: $$\bigcup _{i\in I}\bigcap _{j\in J}{S}_{i,j}=\bigcap _{f\in J^I}\bigcup _{i\in I}{S}_{i,f(i)}\subseteq \bigcup _{g\in I^J}\bigcap _{j\in J}{S}_{g(j),j}=\bigcap _{j\in J}\bigcup _{i\in I}{S}_{i,j}$$ where

• on the left hand side, the indices $f\text{ and }i$ range over $f\in J^I\text{ and }i\in I$ (so the subscripts of $S_{i,f(i)}$ range over $i\in I\text{ and }f(i)\in f(I)\subseteq J$)
• on the right hand side, the indices $g\text{ and }j$ range over $g\in I^J\text{ and }j\in J$ (so the subscripts of $S_{g(j),j}$ range over $j\in J\text{ and }g(j)\in g(J)\subseteq I$).

Template:Em: To apply the general formula to the case of ${\left(C_k\right)}_{k\in K}$ and ${\left(D_l\right)}_{l\in L},$ use $I:=\{1,2\},$ $J_1:=K,$ $J_2:=L,$ and let $T_{1,k}:=C_k$ for all $k\in J_1$ and let $T_{2,l}:=D_l$ for all $l\in J_2.$ Every map $f\in \prod J_{\bullet }\stackrel{\text{def}}{=}\prod _{i\in I}{J}_i=J_1\times J_2=K\times L$ can be bijectively identified with the pair $(f(1),f(2))\in K\times L$ (the inverse sends $(k,l)\in K\times L$ to the map $f_{(k,l)}\in \prod J_{\bullet }$ defined by $1\mapsto k$ and $2\mapsto l;$ this is technically just a change of notation). Recall that Template:EquationNote was $$\bigcap _{i\in I}\bigcup _{j\in J_i}{T}_{i,j}=\bigcup _{f\in \prod J_{\bullet }}\bigcap _{i\in I}{T}_{i,f(i)}.$$ Expanding and simplifying the left hand side gives $$\bigcap _{i\in I}\bigcup _{j\in J_i}{T}_{i,j}=\left(\bigcup _{j\in J_1}{T}_{1,j}\right)\cap \left(\bigcup _{j\in J_2}{T}_{2,j}\right)=\left(\bigcup _{k\in K}{T}_{1,k}\right)\cap \left(\bigcup _{l\in L}{T}_{2,l}\right)=\left(\bigcup _{k\in K}{C}_k\right)\cap \left(\bigcup _{l\in L}{D}_l\right)$$ and doing the same to the right hand side gives: $$\bigcup _{f\in \prod J_{\bullet }}\bigcap _{i\in I}{T}_{i,f(i)}=\bigcup _{f\in \prod J_{\bullet }}(T_{1,f(1)}\cap T_{2,f(2)})=\bigcup _{f\in \prod J_{\bullet }}(C_{f(1)}\cap D_{f(2)})=\bigcup _{(k,l)\in K\times L}(C_k\cap D_l)=\bigcup _{\stackrel{k\in K,}{l\in L}}(C_k\cap D_l).$$

Thus the general identity Template:EquationNote reduces down to the previously given set equality Template:EquationNote: $$\left(\bigcup _{k\in K}{C}_k\right)\cap \bigcup _{l\in L}{D}_l=\bigcup _{\stackrel{k\in K,}{l\in L}}(C_k\cap D_l).$$

Distributing subtraction over ⋃ and ⋂Template:Anchor

Template:NumBlk Template:NumBlk The next identities are known as De Morgan's laws.Template:Sfn Template:NumBlk Template:NumBlk

The following four set equalities can be deduced from the equalities Template:EquationNote - Template:EquationNote above. Template:NumBlk Template:NumBlk Template:NumBlk Template:NumBlk

In general, naively swapping $\cup$ and $\cap$ may produce a different set (see this note for more details). The equalities $$\bigcup _{i\in I}\bigcap _{j\in J}(L_i\setminus R_j)=\bigcap _{j\in J}\bigcup _{i\in I}(L_i\setminus R_j)\text{ and }\bigcup _{j\in J}\bigcap _{i\in I}(L_i\setminus R_j)=\bigcap _{i\in I}\bigcup _{j\in J}(L_i\setminus R_j)$$ found in Template:EquationNote and Template:EquationNote are thus unusual in that they state exactly that swapping $\cup$ and $\cap$ will Template:Em change the resulting set.

Commutativity and associativity of ⋃ and ⋂Template:Anchor

Commutativity:Template:Sfn

$$\bigcup _{\stackrel{i\in I,}{j\in J}}{S}_{i,j}\stackrel{\text{def}}{=}\bigcup _{(i,j)\in I\times J}{S}_{i,j}=\bigcup _{i\in I}\left(\bigcup _{j\in J}{S}_{i,j}\right)=\bigcup _{j\in J}\left(\bigcup _{i\in I}{S}_{i,j}\right)$$

$$\bigcap _{\stackrel{i\in I,}{j\in J}}{S}_{i,j}\stackrel{\text{def}}{=}\bigcap _{(i,j)\in I\times J}{S}_{i,j}=\bigcap _{i\in I}\left(\bigcap _{j\in J}{S}_{i,j}\right)=\bigcap _{j\in J}\left(\bigcap _{i\in I}{S}_{i,j}\right)$$

Unions of unions and intersections of intersections:Template:Sfn

$$\left(\bigcup _{i\in I}{L}_i\right)\cup R=\bigcup _{i\in I}(L_i\cup R)$$ $$\left(\bigcap _{i\in I}{L}_i\right)\cap R=\bigcap _{i\in I}(L_i\cap R)$$ andTemplate:Sfn Template:NumBlk Template:NumBlk

and if $I=J$ then also:Template:Sfn Template:NumBlk Template:NumBlk

Cartesian products Template:Math of arbitrarily many sets

Intersections Template:Math of Template:Math

If ${\left(S_{i,j}\right)}_{(i,j)\in I\times J}$ is a family of sets then Template:NumBlk

• Moreover, a tuple ${\left(x_i\right)}_{i\in I}$ belongs to the set in Template:EquationNote above if and only if $x_i\in S_{i,j}$ for all $i\in I$ and all $j\in J.$

In particular, if ${\left(L_i\right)}_{i\in I}$ and ${\left(R_i\right)}_{i\in I}$ are two families indexed by the same set then $$\left(\prod _{i\in I}{L}_i\right)\cap \prod _{i\in I}{R}_i=\prod _{i\in I}(L_i\cap R_i)$$ So for instance, $$(L\times R)\cap (L_2\times R_2)=(L\cap L_2)\times (R\cap R_2)$$ $$(L\times R)\cap (L_2\times R_2)\cap (L_3\times R_3)=(L\cap L_2\cap L_3)\times (R\cap R_2\cap R_3)$$ and $$(L\times M\times R)\cap (L_2\times M_2\times R_2)=(L\cap L_2)\times (M\cap M_2)\times (R\cap R_2)$$

Intersections of products indexed by different sets

Let ${\left(L_i\right)}_{i\in I}$ and ${\left(R_j\right)}_{j\in J}$ be two families indexed by different sets.

Technically, $I\ne J$ implies $\left(\prod _{i\in I}{L}_i\right)\cap \prod _{j\in J}{R}_j=\varnothing .$ However, sometimes these products are somehow identified as the same set through some bijection or one of these products is identified as a subset of the other via some injective map, in which case (by abuse of notation) this intersection may be equal to some other (possibly non-empty) set.

• For example, if $I:=\{1,2\}$ and $J:=\{1,2,3\}$ with all sets equal to $ℝ$ then $\prod _{i\in I}{L}_i=\prod _{i\in \{1,2\}}ℝ={ℝ}^2$ and $\prod _{j\in J}{R}_j=\prod _{j\in \{1,2,3\}}ℝ={ℝ}^3$ where ${ℝ}^2\cap {ℝ}^3=\varnothing$ Template:Em, for example, $\prod _{i\in \{1,2\}}ℝ={ℝ}^2$ is identified as a subset of $\prod _{j\in \{1,2,3\}}ℝ={ℝ}^3$ through some injection, such as maybe $(x,y)\mapsto (x,y,0)$ for instance; however, in this particular case the product $\prod _{i\in I=\{1,2\}}{L}_i$ actually represents the $J$-indexed product $\prod _{j\in J=\{1,2,3\}}{L}_i$ where $L_3:=\{0\}.$
• For another example, take $I:=\{1,2\}$ and $J:=\{1,2,3\}$ with $L_1:={ℝ}^2$ and $L_2,R_1,R_2,\text{ and }{R}_3$ all equal to $ℝ.$ Then $\prod _{i\in I}{L}_i={ℝ}^2\times ℝ$ and $\prod _{j\in J}{R}_j=ℝ\times ℝ\times ℝ,$ which can both be identified as the same set via the bijection that sends $((x,y),z)\in {ℝ}^2\times ℝ$ to $(x,y,z)\in ℝ\times ℝ\times ℝ.$ Under this identification, $\left(\prod _{i\in I}{L}_i\right)\cap \prod _{j\in J}{R}_j={ℝ}^3.$

Binary Template:Math distributes over arbitrary Template:Math and Template:Math

The binary Cartesian product ⨯ distributes over arbitrary intersections (when the indexing set is not empty) and over arbitrary unions:

$$\begin{array}{cccccc}L\times \left(\bigcup _{i\in I}{R}_i\right)& =& & \bigcup _{i\in I}(L\times R_i)& & \text{ (Left-distributivity of }\times \text{ over }\cup \text{)}\\ L\times \left(\bigcap _{i\in I}{R}_i\right)& =& & \bigcap _{i\in I}(L\times R_i)& & \text{ (Left-distributivity of }\times \text{ over }\bigcap _{i\in I}\text{ when }I\ne \varnothing \text{)}\\ \left(\bigcup _{i\in I}{L}_i\right)\times R& =& & \bigcup _{i\in I}(L_i\times R)& & \text{ (Right-distributivity of }\times \text{ over }\cup \text{)}\\ \left(\bigcap _{i\in I}{L}_i\right)\times R& =& & \bigcap _{i\in I}(L_i\times R)& & \text{ (Right-distributivity of }\times \text{ over }\bigcap _{i\in I}\text{ when }I\ne \varnothing \text{)}\\ \end{array}$$

Distributing arbitrary Template:Math over arbitrary Template:MathTemplate:Anchor

Suppose that for each $i\in I,$ $J_i$ is a non-empty index set and for each $j\in J_i,$ let $T_{i,j}$ be any set (for example, to apply this law to ${\left(S_{i,j}\right)}_{(i,j)\in I\times J},$ use $J_i:=J$ for all $i\in I$ and use $T_{i,j}:=S_{i,j}$ for all $i\in I$ and all $j\in J_i=J$). Let $$\prod J_{\bullet }\stackrel{\text{def}}{=}\prod _{i\in I}{J}_i$$ denote the Cartesian product, which (as mentioned above) can be interpreted as the set of all functions $f:I\to \bigcup _{i\in I}{J}_i$ such that $f(i)\in J_i$ for every $i\in I$. Then Template:NumBlk

where $\prod J_{\bullet }\stackrel{\text{def}}{=}\prod _{i\in I}{J}_i.$

Unions Template:Math of Template:Math

For unions, only the following is guaranteed in general: $$\bigcup _{j\in J}\prod _{i\in I}{S}_{i,j}\subseteq \prod _{i\in I}\bigcup _{j\in J}{S}_{i,j}\text{ and }\bigcup _{i\in I}\prod _{j\in J}{S}_{i,j}\subseteq \prod _{j\in J}\bigcup _{i\in I}{S}_{i,j}$$ where ${\left(S_{i,j}\right)}_{(i,j)\in I\times J}$ is a family of sets.

• Example where equality fails: Let $I=J=\{1,2\},$ let $S_{1,1}=S_{2,2}=\varnothing ,$ let $X\ne \varnothing ,$ and let $S_{1,2}=S_{2,1}=X.$ Then $$\varnothing =\varnothing \cup \varnothing =\left(\prod _{i\in I}{S}_{i,1}\right)\cup \left(\prod _{i\in I}{S}_{i,2}\right)=\bigcup _{j\in J}\prod _{i\in I}{S}_{i,j}\ne \prod _{i\in I}\bigcup _{j\in J}{S}_{i,j}=\left(\bigcup _{j\in J}{S}_{1,j}\right)\times \left(\bigcup _{j\in J}{S}_{2,j}\right)=X\times X.$$ More generally, $\varnothing =\bigcup _{j\in J}\prod _{i\in I}{S}_{i,j}$ if and only if for each $j\in J,$ at least one of the sets in the $I$-indexed collections of sets $S_{\bullet ,j}={\left(S_{i,j}\right)}_{i\in I}$ is empty, while $\prod _{i\in I}\bigcup _{j\in J}{S}_{i,j}\ne \varnothing$ if and only if for each $i\in I,$ at least one of the sets in the $J$-indexed collections of sets $S_{i,\bullet }={\left(S_{i,j}\right)}_{j\in J}$ is not empty.

However, $$\begin{array}{cc}(L\times R)\cup (L_2\times R_2)& =[(L\setminus L_2)\times R]\cup [(L_2\setminus L)\times R_2]\cup [(L\cap L_2)\times (R\cup R_2)]\\ & =[L\times (R\setminus R_2)]\cup [L_2\times (R_2\setminus R)]\cup [(L\cup L_2)\times (R\cap R_2)]\\ \end{array}$$

Difference Template:Math of Template:Math

If ${\left(L_i\right)}_{i\in I}$ and ${\left(R_i\right)}_{i\in I}$ are two families of sets then: $$\begin{array}{cc}\left(\prod _{i\in I}{L}_i\right)\setminus \prod _{i\in I}{R}_i& =\bigcup _{j\in I}\prod _{i\in I}\{\begin{array}{cc}{L}_j\setminus R_j& \text{ if }i=j\\ L_i& \text{ if }i\ne j\end{array}\\ & =\bigcup _{j\in I}[(L_j\setminus R_j)\times \prod _{\stackrel{i\in I,}{j\ne i}}{L}_i]\\ & =\bigcup _{\stackrel{j\in I,}{L_j\subseteq ̸R_j}}[(L_j\setminus R_j)\times \prod _{\stackrel{i\in I,}{j\ne i}}{L}_i]\\ \end{array}$$ so for instance, $$\begin{array}{cc}(L\times R)\setminus (L_2\times R_2)& =[(L\setminus L_2)\times R]\cup [L\times (R\setminus R_2)]\\ \end{array}$$ and $$(L\times M\times R)\setminus (L_2\times M_2\times R_2)=[(L\setminus L_2)\times M\times R]\cup [L\times (M\setminus M_2)\times R]\cup [L\times M\times (R\setminus R_2)]$$

Symmetric difference Template:Math of Template:Math

$$\begin{array}{cc}\left(\prod _{i\in I}{L}_i\right)\mathrm{△}\left(\prod _{i\in I}{R}_i\right)& =\left(\prod _{i\in I}{L}_i\right)\cup \left(\prod _{i\in I}{R}_i\right)\setminus \prod _{i\in I}{L}_i\cap R_i\\ \end{array}$$

Functions and sets

Let $f:X\to Y$ be any function.

Let $L\text{ and }R$ be completely arbitrary sets. Assume $A\subseteq X\text{ and }C\subseteq Y.$

Definitions

Let $f:X\to Y$ be any function, where we denote its Template:Em $X$ by $\mathrm{domain}f$ and denote its Template:Em $Y$ by $\mathrm{codomain}f.$

Many of the identities below do not actually require that the sets be somehow related to $f$'s domain or codomain (that is, to $X$ or $Y$) so when some kind of relationship is necessary then it will be clearly indicated. Because of this, in this article, if $L$ is declared to be "Template:Em," and it is not indicated that $L$ must be somehow related to $X$ or $Y$ (say for instance, that it be a subset $X$ or $Y$) then it is meant that $L$ is truly arbitrary. This generality is useful in situations where $f:X\to Y$ is a map between two subsets $X\subseteq U$ and $Y\subseteq V$ of some larger sets $U$ and $V,$ and where the set $L$ might not be entirely contained in $X=\mathrm{domain}f$ and/or $Y=\mathrm{codomain}f$ (e.g. if all that is known about $L$ is that $L\subseteq U$); in such a situation it may be useful to know what can and cannot be said about $f(L)$ and/or $f^{-1}(L)$ without having to introduce a (potentially unnecessary) intersection such as: $f(L\cap X)$ and/or $f^{-1}(L\cap Y).$

Images and preimages of sets

If $L$ is Template:Em set then the Template:Em is defined to be the set: $$f(L)\stackrel{\text{def}}{=}\{f(l):l\in L\cap \mathrm{domain}f\}$$ while the Template:Em is: $$f^{-1}(L)\stackrel{\text{def}}{=}\{x\in \mathrm{domain}f:f(x)\in L\}$$ where if $L=\{s\}$ is a singleton set then the Template:Em or Template:Em is $$f^{-1}(s)\stackrel{\text{def}}{=}{f}^{-1}(\{s\})=\{x\in \mathrm{domain}f:f(x)=s\}.$$

Denote by $\mathrm{Im}f$ or $\mathrm{image}f$ the Template:Em or Template:Em of $f:X\to Y,$ which is the set: $$\mathrm{Im}f\stackrel{\text{def}}{=}f(X)\stackrel{\text{def}}{=}f(\mathrm{domain}f)=\{f(x):x\in \mathrm{domain}f\}.$$

Saturated sets

A set $A$ is said to be Template:Em or a Template:Em if any of the following equivalent conditions are satisfied:Template:Sfn

1. There exists a set $R$ such that $A=f^{-1}(R).$
   • Any such set $R$ necessarily contains $f(A)$ as a subset.
   • Any set not entirely contained in the domain of $f$ cannot be $f$-saturated.
2. $A=f^{-1}(f(A)).$
3. $A\supseteq f^{-1}(f(A))$ and $A\subseteq \mathrm{domain}f.$
   • The inclusion $L\cap \mathrm{domain}f\subseteq f^{-1}(f(L))$ always holds, where if $A\subseteq \mathrm{domain}f$ then this becomes $A\subseteq f^{-1}(f(A)).$
4. $A\subseteq \mathrm{domain}f$ and if $a\in A$ and $x\in \mathrm{domain}f$ satisfy $f(x)=f(a),$ then $x\in A.$
5. Whenever a fiber of $f$ intersects $A,$ then $A$ contains the entire fiber. In other words, $A$ contains every $f$-fiber that intersects it.
• Explicitly: whenever $y\in \mathrm{Im}f$ is such that $A\cap f^{-1}(y)\ne \varnothing ,$ then $f^{-1}(y)s\subseteq A.$
• In both this statement and the next, the set $\mathrm{Im}f$ may be replaced with any superset of $\mathrm{Im}f$ (such as $\mathrm{codomain}f$) and the resulting statement will still be equivalent to the rest.
6. The intersection of $A$ with a fiber of $f$ is equal to the empty set or to the fiber itself.
   • Explicitly: for every $y\in \mathrm{Im}f,$ the intersection $A\cap f^{-1}(y)$ is equal to the empty set $\varnothing$ or to $f^{-1}(y)$ (that is, $A\cap f^{-1}(y)=\varnothing$ or $A\cap f^{-1}(y)=f^{-1}(y)$).

For a set $A$ to be $f$-saturated, it is necessary that $A\subseteq \mathrm{domain}f.$

Compositions and restrictions of functions

If $f$ and $g$ are maps then $g\circ f$ denotes the Template:Em map $$g\circ f:\{x\in \mathrm{domain}f:f(x)\in \mathrm{domain}g\}\to \mathrm{codomain}g$$ with domain and codomain $$\begin{array}{cc}\mathrm{domain}(g\circ f)& =\{x\in \mathrm{domain}f:f(x)\in \mathrm{domain}g\}\\ \mathrm{codomain}(g\circ f)& =\mathrm{codomain}g\\ \end{array}$$ defined by $$(g\circ f)(x)\stackrel{\text{def}}{=}g(f(x)).$$

The Template:Em denoted by $f{|}_L,$ is the map $$f{|}_L:L\cap \mathrm{domain}f\to Y$$ with $\mathrm{domain}f{|}_L=L\cap \mathrm{domain}f$ defined by sending $x\in L\cap \mathrm{domain}f$ to $f(x);$ that is, $$f{|}_L(x)\stackrel{\text{def}}{=}f(x).$$ Alternatively, $f{|}_L=f\circ \mathrm{In}$ where $\mathrm{In}:L\cap X\to X$ denotes the inclusion map, which is defined by $\mathrm{In}(s)\stackrel{\text{def}}{=}s.$

(Pre)Images of arbitrary unions ⋃'s and intersections ⋂'s

If ${\left(L_i\right)}_{i\in I}$ is a family of arbitrary sets indexed by $I\ne \varnothing$ then:Template:Sfn $$\begin{array}{cc}f\left(\bigcap _{i\in I}{L}_i\right)& \subseteq \bigcap _{i\in I}f\left(L_i\right)\\ f\left(\bigcup _{i\in I}{L}_i\right)& =\bigcup _{i\in I}f\left(L_i\right)\\ f^{-1}\left(\bigcup _{i\in I}{L}_i\right)& =\bigcup _{i\in I}{f}^{-1}\left(L_i\right)\\ f^{-1}\left(\bigcap _{i\in I}{L}_i\right)& =\bigcap _{i\in I}{f}^{-1}\left(L_i\right)\\ \end{array}$$

So of these four identities, it is Template:Em Template:Em that are not always preserved. Preimages preserve all basic set operations. Unions are preserved by both images and preimages.

If all $L_i$ are $f$-saturated then $\bigcap _{i\in I}{L}_i$ be will be $f$-saturated and equality will hold in the first relation above; explicitly, this means: Template:NumBlk

If ${\left(A_i\right)}_{i\in I}$ is a family of arbitrary subsets of $X=\mathrm{domain}f,$ which means that $A_i\subseteq X$ for all $i,$ then Template:EquationNote becomes: Template:NumBlk

(Pre)Images of binary set operations

Throughout, let $L$ and $R$ be any sets and let $f:X\to Y$ be any function.

Summary

As the table below shows, set equality is Template:Em guaranteed Template:Em for Template:Em of: intersections, set subtractions, and symmetric differences.

Image	Preimage	Template:Nowrap
$f(L\cup R)=f(L)\cup f(R)$	$f^{-1}(L\cup R)=f^{-1}(L)\cup f^{-1}(R)$Template:Sfn	None
$$f(L\cap R)\subseteq f(L)\cap f(R)$$	$f^{-1}(L\cap R)=f^{-1}(L)\cap f^{-1}(R)$Template:Sfn	None
$$f(L\setminus R)\supseteq f(L)\setminus f(R)$$	$\begin{array}{cccccccccc}{f}^{-1}(L)\setminus f^{-1}(R)& =f^{-1}& & (& & L& & \setminus & & R)\\ & =f^{-1}& & (& & L& & \setminus [& & R\cap \mathrm{Im}f])\\ & =f^{-1}& & ([& & L\cap \mathrm{Im}f]& & \setminus & & R)\\ & =f^{-1}& & ([& & L\cap \mathrm{Im}f]& & \setminus [& & R\cap \mathrm{Im}f])\end{array}$Template:SfnTemplate:Sfn	None
$$f(X\setminus R)\supseteq f(X)\setminus f(R)$$	$\begin{array}{cccccccc}X\setminus f^{-1}(R)& =f^{-1}(& & Y& & \setminus & & R)\\ & =f^{-1}(& & Y& & \setminus [& & R\cap \mathrm{Im}f])\\ & =f^{-1}(& & \mathrm{Im}f& & \setminus & & R)\\ & =f^{-1}(& & \mathrm{Im}f& & \setminus [& & R\cap \mathrm{Im}f])\end{array}$	None
$$f\left(L\mathrm{△}R\right)\supseteq f(L)\mathrm{△}f(R)$$	$f^{-1}\left(L\mathrm{△}R\right)=f^{-1}(L)\mathrm{△}{f}^{-1}(R)$	None

Preimages preserve set operations

Preimages of sets are well-behaved with respect to all basic set operations:

$$\begin{array}{cc}{f}^{-1}(L\cup R)& =f^{-1}(L)\cup f^{-1}(R)\\ f^{-1}(L\cap R)& =f^{-1}(L)\cap f^{-1}(R)\\ f^{-1}(L\setminus R)& =f^{-1}(L)\setminus f^{-1}(R)\\ f^{-1}(L\mathrm{△}R)& =f^{-1}(L)\mathrm{△}{f}^{-1}(R)\\ \end{array}$$

In words, preimages distribute over unions, intersections, set subtraction, and symmetric difference.

Images Template:Em preserve unions

Images of unions are well-behaved:

$$\begin{array}{cc}f(L\cup R)& =f(L)\cup f(R)\\ \end{array}$$

but images of the other basic set operations are Template:Em since only the following are guaranteed in general:

$$\begin{array}{cc}f(L\cap R)& \subseteq f(L)\cap f(R)\\ f(L\setminus R)& \supseteq f(L)\setminus f(R)\\ f(L\mathrm{△}R)& \supseteq f(L)\mathrm{△}f(R)\\ \end{array}$$

In words, images distribute over unions but not necessarily over intersections, set subtraction, or symmetric difference. What these latter three operations have in common is set subtraction: they either Template:Em set subtraction $L\setminus R$ or else they can naturally Template:Em as the set subtraction of two sets: $$L\cap R=L\setminus (L\setminus R)\text{ and }L\mathrm{△}R=(L\cup R)\setminus (L\cap R).$$

If $L=X$ then $f(X\setminus R)\supseteq f(X)\setminus f(R)$ where as in the more general case, equality is not guaranteed. If $f$ is surjective then $f(X\setminus R)\supseteq Y\setminus f(R),$ which can be rewritten as: $f\left(R^{\complement }\right)\supseteq f(R{)}^{\complement }$ if $R^{\complement }\stackrel{\text{def}}{=}X\setminus R$ and $f(R{)}^{\complement }\stackrel{\text{def}}{=}Y\setminus f(R).$

Counter-examples: images of operations not distributing

Picture showing $f$ failing to distribute over set intersection:
Template:Center The map $f:ℝ\to ℝ$ is defined by $x\mapsto x^2,$ where $ℝ$ denotes the real numbers. The sets $A_1=[-4,2]$ and $A_2=[-2,4]$ are shown in Template:Color immediately below the $x$-axis while their intersection $A_3=[-2,2]$ is shown in Template:Color.

If $f:\{1,2\}\to Y$ is constant, $L=\{1\},$ and $R=\{2\}$ then all four of the set containments $$\begin{array}{cc}f(L\cap R)& ⊊f(L)\cap f(R)\\ f(L\setminus R)& ⊋f(L)\setminus f(R)\\ f(X\setminus R)& ⊋f(X)\setminus f(R)\\ f(L\mathrm{△}R)& ⊋f(L)\mathrm{△}f(R)\\ \end{array}$$ are strict/proper (that is, the sets are not equal) since one side is the empty set while the other is non-empty. Thus equality is not guaranteed for even the simplest of functions. The example above is now generalized to show that these four set equalities can fail for any constant function whose domain contains at least two (distinct) points.

Template:Em:Template:Anchor Let $f:X\to Y$ be any constant function with image $f(X)=\{y\}$ and suppose that $L,R\subseteq X$ are non-empty disjoint subsets; that is, $L\ne \varnothing ,R\ne \varnothing ,$ and $L\cap R=\varnothing ,$ which implies that all of the sets $L\mathrm{△}R=L\cup R,$ $L\setminus R=L,$ and $X\setminus R\supseteq L\setminus R$ are not empty and so consequently, their images under $f$ are all equal to $\{y\}.$

1. The containment $f(L\setminus R)⊋f(L)\setminus f(R)$ is strict: $$\{y\}=f(L\setminus R)\ne f(L)\setminus f(R)=\{y\}\setminus \{y\}=\varnothing$$ In words: functions might not distribute over set subtraction $\setminus$
2. The containment $f(X\setminus R)⊋f(X)\setminus f(R)$ is strict: $$\{y\}=f(X\setminus R)\ne f(X)\setminus f(R)=\{y\}\setminus \{y\}=\varnothing .$$
3. The containment $f(L\mathrm{△}R)⊋f(L)\mathrm{△}f(R)$ is strict: $$\{y\}=f\left(L\mathrm{△}R\right)\ne f(L)\mathrm{△}f(R)=\{y\}\mathrm{△}\{y\}=\varnothing$$ In words: functions might not distribute over symmetric difference $\mathrm{△}$ (which can be defined as the set subtraction of two sets: $L\mathrm{△}R=(L\cup R)\setminus (L\cap R)$).
4. The containment $f(L\cap R)⊊f(L)\cap f(R)$ is strict: $$\varnothing =f(\varnothing )=f(L\cap R)\ne f(L)\cap f(R)=\{y\}\cap \{y\}=\{y\}$$ In words: functions might not distribute over set intersection $\cap$ (which can be defined as the set subtraction of two sets: $L\cap R=L\setminus (L\setminus R)$).

What the set operations in these four examples have in common is that they either Template:Em set subtraction $\setminus$ (examples (1) and (2)) or else they can naturally Template:Em as the set subtraction of two sets (examples (3) and (4)).

Mnemonic: In fact, for each of the above four set formulas for which equality is not guaranteed, the direction of the containment (that is, whether to use $\subseteq \text{ or }\supseteq$) can always be deduced by imagining the function $f$ as being Template:Em and the two sets ($L$ and $R$) as being non-empty disjoint subsets of its domain. This is because Template:Em equality fails for such a function and sets: one side will be always be $\varnothing$ and the other non-empty − from this fact, the correct choice of $\subseteq \text{ or }\supseteq$ can be deduced by answering: "which side is empty?" For example, to decide if the $?$ in $$f(L\mathrm{△}R)\setminus f(R)?f((L\mathrm{△}R)\setminus R)$$ should be $\subseteq \text{ or }\supseteq ,$ pretend that $f$ is constant and that $L\mathrm{△}R$ and $R$ are non-empty disjoint subsets of $f$'s domain; then the Template:Em hand side would be empty (since $f(L\mathrm{△}R)\setminus f(R)=\{f\text{'s single value}\}\setminus \{f\text{'s single value}\}=\varnothing$), which indicates that $?$ should be $\subseteq$ (the resulting statement is always guaranteed to be true) because this is the choice that will make $$\varnothing =\text{left hand side}?\text{right hand side}$$ true. Alternatively, the correct direction of containment can also be deduced by consideration of any constant $f:\{1,2\}\to Y$ with $L=\{1\}$ and $R=\{2\}.$

Furthermore, this mnemonic can also be used to correctly deduce whether or not a set operation always distribute over images or preimages; for example, to determine whether or not $f(L\cap R)$ always equals $f(L)\cap f(R),$ or alternatively, whether or not $f^{-1}(L\cap R)$ always equals $f^{-1}(L)\cap f^{-1}(R)$ (although $\cap$ was used here, it can replaced by $\cup ,\setminus ,\text{ or }\mathrm{△}$). The answer to such a question can, as before, be deduced by consideration of this constant function: the answer for the general case (that is, for arbitrary $f,L,$ and $R$) is always the same as the answer for this choice of (constant) function and disjoint non-empty sets.

Conditions guaranteeing that images distribute over set operations

Characterizations of when equality holds for Template:Em sets:

For any function $f:X\to Y,$ the following statements are equivalent:

1. $f:X\to Y$ is injective.
   • This means: $f(x)\ne f(y)$ for all distinct $x,y\in X.$
2. $f(L\cap R)=f(L)\cap f(R)\text{ for all }L,R\subseteq X.$ (The equals sign $=$ can be replaced with $\supseteq$).
3. $f(L\setminus R)=f(L)\setminus f(R)\text{ for all }L,R\subseteq X.$ (The equals sign $=$ can be replaced with $\subseteq$).
4. $f(X\setminus R)=f(X)\setminus f(R)\text{ for all }R\subseteq X.$ (The equals sign $=$ can be replaced with $\subseteq$).
5. $f(L\mathrm{△}R)=f(L)\mathrm{△}f(R)\text{ for all }L,R\subseteq X.$ (The equals sign $=$ can be replaced with $\subseteq$).
6. Any one of the four statements (b) - (e) but with the words "for all" replaced with any one of the following:
   1. "for all singleton subsets"
      • In particular, the statement that results from (d) gives a characterization of injectivity that explicitly involves only one point (rather than two): $f$ is injective if and only if $f(x)\in ̸f(X\setminus \{x\})\text{ for every }x\in X.$
   2. "for all disjoint singleton subsets"
      • For statement (d), this is the same as: "for all singleton subsets" (because the definition of "pairwise disjoint" is satisfies vacuously by any family that consists of exactly 1 set).
   3. "for all disjoint subsets"

In particular, if a map is not known to be injective then barring additional information, there is no guarantee that any of the equalities in statements (b) - (e) hold.

An example above can be used to help prove this characterization. Indeed, comparison of that example with such a proof suggests that the example is representative of the fundamental reason why one of these four equalities in statements (b) - (e) might not hold (that is, representative of "what goes wrong" when a set equality does not hold).

Conditions for f(L⋂R) = f(L)⋂f(R)Template:Anchor

$$f(L\cap R)\subseteq f(L)\cap f(R)\text{ always holds}$$

Characterizations of equality: The following statements are equivalent:

1. $f(L\cap R)=f(L)\cap f(R)$
2. $f(L\cap R)\supseteq f(L)\cap f(R)$
3. $L\cap f^{-1}(f(R))\subseteq f^{-1}(f(L\cap R))$
   • The left hand side $L\cap f^{-1}(f(R))$ is always equal to $L\cap f^{-1}(f(L)\cap f(R))$ (because $L\cap f^{-1}(f(R))\subseteq f^{-1}(f(L))$ always holds).
4. $R\cap f^{-1}(f(L))\subseteq f^{-1}(f(L\cap R))$
5. $L\cap f^{-1}(f(R))=f^{-1}(f(L\cap R))\cap L$
6. $R\cap f^{-1}(f(L))=f^{-1}(f(L\cap R))\cap R$
7. If $l\in L$ satisfies $f(l)\in f(R)$ then $f(l)\in f(L\cap R).$
8. If $y\in f(L)$ but $y\notin f(L\cap R)$ then $y\notin f(R).$
9. $f(L)\setminus f(L\cap R)\subseteq f(L)\setminus f(R)$
10. $f(R)\setminus f(L\cap R)\subseteq f(R)\setminus f(L)$
11. $f(L\cup R)\setminus f(L\cap R)\subseteq f(L)\mathrm{△}f(R)$
12. Any of the above three conditions (i) - (k) but with the subset symbol $\subseteq$ replaced with an equals sign $=.$

Sufficient conditions for equality: Equality holds if any of the following are true:

1. $f$ is injective.
2. The restriction $f{|}_{L\cup R}$ is injective.
3. $f^{-1}(f(R))\subseteq R$
4. $f^{-1}(f(L))\subseteq L$
5. $R$ is $f$-saturated; that is, $f^{-1}(f(R))=R$
6. $L$ is $f$-saturated; that is, $f^{-1}(f(L))=L$
7. $f(L)\subseteq f(L\cap R)$
8. $f(R)\subseteq f(L\cap R)$
9. $f(L\setminus R)\subseteq f(L)\setminus f(R)$ or equivalently, $f(L\setminus R)=f(L)\setminus f(R)$
10. $f(R\setminus L)\subseteq f(R)\setminus f(L)$ or equivalently, $f(R\setminus L)=f(R)\setminus f(L)$
11. $f\left(L\mathrm{△}R\right)\subseteq f(L)\mathrm{△}f(R)$ or equivalently, $f\left(L\mathrm{△}R\right)=f(L)\mathrm{△}f(R)$
12. $R\cap \mathrm{domain}f\subseteq L$
13. $L\cap \mathrm{domain}f\subseteq R$
14. $R\subseteq L$
15. $L\subseteq R$

In addition, the following always hold: $$f(f^{-1}(L)\cap R)=L\cap f(R)$$ $$f(f^{-1}(L)\cup R)=(L\cap \mathrm{Im}f)\cup f(R)$$

Conditions for f(L\R) = f(L)\f(R)Template:Anchor

$$f(L\setminus R)\supseteq f(L)\setminus f(R)\text{ always holds}$$

Characterizations of equality: The following statements are equivalent:

1. $f(L\setminus R)=f(L)\setminus f(R)$
2. $f(L\setminus R)\subseteq f(L)\setminus f(R)$
3. $L\cap f^{-1}(f(R))\subseteq R$
4. $L\cap f^{-1}(f(R))=L\cap R\cap \mathrm{domain}f$
5. Whenever $y\in f(L)\cap f(R)$ then $L\cap f^{-1}(y)\subseteq R.$
6. $f(L)\cap f(R)\subseteq \{y\in f(L):L\cap f^{-1}(y)\subseteq R\}$
   • The set on the right hand side is always equal to $\{y\in f(L\cap R):L\cap f^{-1}(y)\subseteq R\}.$
7. $f(L)\cap f(R)=\{y\in f(L):L\cap f^{-1}(y)\subseteq R\}$
   • This is the above condition (f) but with the subset symbol $\subseteq$ replaced with an equals sign $=.$

Necessary conditions for equality (excluding characterizations): If equality holds then the following are necessarily true:

1. $f(L\cap R)=f(L)\cap f(R),$ or equivalently $f(L\cap R)\supseteq f(L)\cap f(R).$
2. $L\cap f^{-1}(f(R))=L\cap f^{-1}(f(L\cap R))$ or equivalently, $L\cap f^{-1}(f(R))\subseteq f^{-1}(f(L\cap R))$
3. $R\cap f^{-1}(f(L))=R\cap f^{-1}(f(L\cap R))$

Sufficient conditions for equality: Equality holds if any of the following are true:

1. $f$ is injective.
2. The restriction $f{|}_{L\cup R}$ is injective.
3. $f^{-1}(f(R))\subseteq R$ or equivalently, $R\cap \mathrm{domain}f=f^{-1}(f(R))$
4. $R$ is $f$-saturated; that is, $R=f^{-1}(f(R)).$
5. $f\left(L\mathrm{△}R\right)\subseteq f(L)\mathrm{△}f(R)$ or equivalently, $f\left(L\mathrm{△}R\right)=f(L)\mathrm{△}f(R)$

Conditions for f(X\R) = f(X)\f(R)Template:Anchor

$$f(X\setminus R)\supseteq f(X)\setminus f(R)\text{ always holds, where }f:X\to Y$$

Characterizations of equality: The following statements are equivalent:

1. $f(X\setminus R)=f(X)\setminus f(R)$
2. $f(X\setminus R)\subseteq f(X)\setminus f(R)$
3. $f^{-1}(f(R))\subseteq R$
4. $f^{-1}(f(R))=R\cap \mathrm{domain}f$
5. $R\cap \mathrm{domain}f$ is $f$-saturated.
6. Whenever $y\in f(R)$ then $f^{-1}(y)\subseteq R.$
7. $f(R)\subseteq \{y\in f(R):f^{-1}(y)\subseteq R\}$
8. $f(R)=\{y\in f(R):f^{-1}(y)\subseteq R\}$

   where if $R\subseteq \mathrm{domain}f$ then this list can be extended to include:

9. $R$ is $f$-saturated; that is, $R=f^{-1}(f(R)).$

Sufficient conditions for equality: Equality holds if any of the following are true:

1. $f$ is injective.
2. $R$ is $f$-saturated; that is, $R=f^{-1}(f(R)).$

Conditions for f(L∆R) = f(L)∆f(R)Template:Anchor

$$f\left(L\mathrm{△}R\right)\supseteq f(L)\mathrm{△}f(R)\text{ always holds}$$

Characterizations of equality: The following statements are equivalent:

1. $f\left(L\mathrm{△}R\right)=f(L)\mathrm{△}f(R)$
2. $f\left(L\mathrm{△}R\right)\subseteq f(L)\mathrm{△}f(R)$
3. $f(L\setminus R)=f(L)\setminus f(R)$  and  $f(R\setminus L)=f(R)\setminus f(L)$
4. $f(L\setminus R)\subseteq f(L)\setminus f(R)$  and  $f(R\setminus L)\subseteq f(R)\setminus f(L)$
5. $L\cap f^{-1}(f(R))\subseteq R$  and  $R\cap f^{-1}(f(L))\subseteq L$
   • The inclusions $L\cap f^{-1}(f(R))\subseteq f^{-1}(f(L))$ and $R\cap f^{-1}(f(L))\subseteq f^{-1}(f(R))$ always hold.
6. $L\cap f^{-1}(f(R))=R\cap f^{-1}(f(L))$
   • If this above set equality holds, then this set will also be equal to both $L\cap R\cap \mathrm{domain}f$ and $L\cap R\cap f^{-1}(f(L\cap R)).$
7. $L\cap f^{-1}(f(L\cap R))=R\cap f^{-1}(f(L\cap R))$  and  $f(L\cap R)\supseteq f(L)\cap f(R).$

Necessary conditions for equality (excluding characterizations): If equality holds then the following are necessarily true:

1. $f(L\cap R)=f(L)\cap f(R),$ or equivalently $f(L\cap R)\supseteq f(L)\cap f(R).$
2. $L\cap f^{-1}(f(L\cap R))=R\cap f^{-1}(f(L\cap R))$

Sufficient conditions for equality: Equality holds if any of the following are true:

1. $f$ is injective.
2. The restriction $f{|}_{L\cup R}$ is injective.

Exact formulas/equalities for images of set operations

Formulas for f(L\R) =Template:Anchor

For any function $f:X\to Y$ and any sets $L$ and $R,$ $$\begin{array}{cc}f(L\setminus R)& =Y\setminus \{y\in Y:L\cap f^{-1}(y)\subseteq R\}\\ & =f(L)\setminus \{y\in f(L):L\cap f^{-1}(y)\subseteq R\}\\ & =f(L)\setminus \{y\in f(L\cap R):L\cap f^{-1}(y)\subseteq R\}\\ & =f(L)\setminus \{y\in V:L\cap f^{-1}(y)\subseteq R\}& & \text{ for any superset }V\supseteq f(L\cap R)\\ & =f(S)\setminus \{y\in f(S):L\cap f^{-1}(y)\subseteq R\}& & \text{ for any superset }S\supseteq L\cap X.\\ \end{array}$$

Formulas for f(X\R) =Template:Anchor

Taking $L:=X=\mathrm{domain}f$ in the above formulas gives: $$\begin{array}{cc}f(X\setminus R)& =Y\setminus \{y\in Y:f^{-1}(y)\subseteq R\}\\ & =f(X)\setminus \{y\in f(X):f^{-1}(y)\subseteq R\}\\ & =f(X)\setminus \{y\in f(R):f^{-1}(y)\subseteq R\}\\ & =f(X)\setminus \{y\in W:f^{-1}(y)\subseteq R\}\text{ for any superset }W\supseteq f(R)\\ \end{array}$$ where the set $\{y\in f(R):f^{-1}(y)\subseteq R\}$ is equal to the image under $f$ of the largest $f$-saturated subset of $R.$

• In general, only $f(X\setminus R)\supseteq f(X)\setminus f(R)$ always holds and equality is not guaranteed; but replacing "$f(R)$" with its subset "$\{y\in f(R):f^{-1}(y)\subseteq R\}$" results in a formula in which equality is Template:Em guaranteed: $$f(X\setminus R)=f(X)\setminus \{y\in f(R):f^{-1}(y)\subseteq R\}.$$ From this it follows that: $$f(X\setminus R)=f(X)\setminus f(R)\text{ if and only if }f(R)=\{y\in f(R):f^{-1}(y)\subseteq R\}\text{ if and only if }{f}^{-1}(f(R))\subseteq R.$$
• If $f_R:=\{y\in f(X):f^{-1}(y)\subseteq R\}$ then $f(X\setminus R)=f(X)\setminus f_R,$ which can be written more symmetrically as $f(X\setminus R)=f_X\setminus f_R$ (since $f_X=f(X)$).

Formulas for f(L∆R) =Template:Anchor

It follows from $L\mathrm{△}R=(L\cup R)\setminus (L\cap R)$ and the above formulas for the image of a set subtraction that for any function $f:X\to Y$ and any sets $L$ and $R,$ $$\begin{array}{cc}f(L\mathrm{△}R)& =Y\setminus \{y\in Y:L\cap f^{-1}(y)=R\cap f^{-1}(y)\}\\ & =f(L\cup R)\setminus \{y\in f(L\cup R):L\cap f^{-1}(y)=R\cap f^{-1}(y)\}\\ & =f(L\cup R)\setminus \{y\in f(L\cap R):L\cap f^{-1}(y)=R\cap f^{-1}(y)\}\\ & =f(L\cup R)\setminus \{y\in V:L\cap f^{-1}(y)=R\cap f^{-1}(y)\}& & \text{ for any superset }V\supseteq f(L\cap R)\\ & =f(S)\setminus \{y\in f(S):L\cap f^{-1}(y)=R\cap f^{-1}(y)\}& & \text{ for any superset }S\supseteq (L\cup R)\cap X.\\ \end{array}$$

Formulas for f(L) =Template:Anchor

It follows from the above formulas for the image of a set subtraction that for any function $f:X\to Y$ and any set $L,$$$\begin{array}{cc}f(L)& =Y\setminus \{y\in Y:f^{-1}(y)\cap L=\varnothing \}\\ & =\mathrm{Im}f\setminus \{y\in \mathrm{Im}f:f^{-1}(y)\cap L=\varnothing \}\\ & =W\setminus \{y\in W:f^{-1}(y)\cap L=\varnothing \}\text{ for any superset }W\supseteq f(L)\\ \end{array}$$

This is more easily seen as being a consequence of the fact that for any $y\in Y,$ $f^{-1}(y)\cap L=\varnothing$ if and only if $y\in ̸f(L).$

Formulas for f(L⋂R) =Template:Anchor

It follows from the above formulas for the image of a set that for any function $f:X\to Y$ and any sets $L$ and $R,$ $$\begin{array}{cccc}f(L\cap R)& =Y\setminus \{y\in Y:L\cap R\cap f^{-1}(y)=\varnothing \}& & \\ & =f(L)\setminus \{y\in f(L):L\cap R\cap f^{-1}(y)=\varnothing \}& & \\ & =f(L)\setminus \{y\in U:L\cap R\cap f^{-1}(y)=\varnothing \}& & \text{ for any superset }U\supseteq f(L)\\ & =f(R)\setminus \{y\in f(R):L\cap R\cap f^{-1}(y)=\varnothing \}& & \\ & =f(R)\setminus \{y\in V:L\cap R\cap f^{-1}(y)=\varnothing \}& & \text{ for any superset }V\supseteq f(R)\\ & =f(L)\cap f(R)\setminus \{y\in f(L)\cap f(R):L\cap R\cap f^{-1}(y)=\varnothing \}& & \\ \end{array}$$ where moreover, for any $y\in Y,$

$L\cap f^{-1}(y)\subseteq L\setminus R$ if and only if $L\cap R\cap f^{-1}(y)=\varnothing$ if and only if $R\cap f^{-1}(y)\subseteq R\setminus L$ if and only if $y\in ̸f(L\cap R).$

The sets $U$ and $V$ mentioned above could, in particular, be any of the sets $f(L\cup R),\mathrm{Im}f,$ or $Y,$ for example.

(Pre)Images of set operations on (pre)imagesTemplate:Anchor

Let $L$ and $R$ be arbitrary sets, $f:X\to Y$ be any map, and let $A\subseteq X$ and $C\subseteq Y.$

Image of preimage	Preimage of image	Additional assumptions on sets
$f(f^{-1}(L)\cap R)=L\cap f(R)$Template:Sfn	$f^{-1}(f(L)\cap R)\supseteq L\cap f^{-1}(R)$	None
$f(f^{-1}(L)\cup R)=(L\cap \mathrm{Im}f)\cup f(R)\subseteq L\cup f(R)$	$f^{-1}(f(A)\cup R)\supseteq A\cup f^{-1}(R)$ Equality holds if any of the following are true: $f(A)\subseteq R.$ $A\subseteq f^{-1}(R).$	$A\subseteq X$

(Pre)Images of operations on images

Since $f(L)\setminus f(L\setminus R)=\{y\in f(L\cap R):L\cap f^{-1}(y)\subseteq R\},$

$$\begin{array}{cccc}{f}^{-1}(f(L)\setminus f(L\setminus R))& =& & f^{-1}\left(\{y\in f(L\cap R):L\cap f^{-1}(y)\subseteq R\}\right)\\ & =& & \{x\in f^{-1}(f(L\cap R)):L\cap f^{-1}(f(x))\subseteq R\}\\ \end{array}$$

Since $f(X)\setminus f(L\setminus R)=\{y\in f(X):L\cap f^{-1}(y)\subseteq R\},$ $$\begin{array}{cccc}{f}^{-1}(Y\setminus f(L\setminus R))& =& & f^{-1}(f(X)\setminus f(L\setminus R))\\ & =& & f^{-1}\left(\{y\in f(X):L\cap f^{-1}(y)\subseteq R\}\right)\\ & =& & \{x\in X:L\cap f^{-1}(f(x))\subseteq R\}\\ & =& & X\setminus f^{-1}(f(L\setminus R))\\ \end{array}$$

Using $L:=X,$ this becomes $f(X)\setminus f(X\setminus R)=\{y\in f(R):f^{-1}(y)\subseteq R\}$ and $$\begin{array}{cccc}{f}^{-1}(Y\setminus f(X\setminus R))& =& & f^{-1}(f(X)\setminus f(X\setminus R))\\ & =& & f^{-1}\left(\{y\in f(R):f^{-1}(y)\subseteq R\}\right)\\ & =& & \{r\in R\cap X:f^{-1}(f(r))\subseteq R\}\\ & \subseteq & & R\\ \end{array}$$ and so $$\begin{array}{cccc}{f}^{-1}(Y\setminus f(L))& =& & f^{-1}(f(X)\setminus f(L))\\ & =& & f^{-1}\left(\{y\in f(X\setminus L):f^{-1}(y)\cap L=\varnothing \}\right)\\ & =& & \{x\in X\setminus L:f(x)\in ̸f(L)\}\\ & =& & X\setminus f^{-1}(f(L))\\ & \subseteq & & X\setminus L\\ \end{array}$$

(Pre)Images and Cartesian products Π

Let $\prod Y_{\bullet }\stackrel{\text{def}}{=}\prod _{j\in J}{Y}_j$ and for every $k\in J,$ let $${\pi }_k:\prod _{j\in J}{Y}_j\to Y_k$$ denote the canonical projection onto $Y_k.$

Definitions

Given a collection of maps $F_j:X\to Y_j$ indexed by $j\in J,$ define the map $$\begin{array}{cccccc}{\left(F_j\right)}_{j\in J}:& & X& & \to & \prod _{j\in J}{Y}_j\\ & & x& & \mapsto & {\left(F_j\left(x_j\right)\right)}_{j\in J},\\ \end{array}$$ which is also denoted by $F_{\bullet }={\left(F_j\right)}_{j\in J}.$ This is the unique map satisfying $${\pi }_j\circ F_{\bullet }=F_j\text{ for all }j\in J.$$

Conversely, if given a map $$F:X\to \prod _{j\in J}{Y}_j$$ then $F={({\pi }_j\circ F)}_{j\in J}.$ Explicitly, what this means is that if $$F_k\stackrel{\text{def}}{=}{\pi }_k\circ F:X\to Y_k$$ is defined for every $k\in J,$ then $F$ the unique map satisfying: ${\pi }_j\circ F=F_j$ for all $j\in J;$ or said more briefly, $F={\left(F_j\right)}_{j\in J}.$

The map $F_{\bullet }={\left(F_j\right)}_{j\in J}:X\to \prod _{j\in J}{Y}_j$ should not be confused with the Cartesian product $\prod _{j\in J}{F}_j$ of these maps, which is by definition is the map $$\begin{array}{cccccc}\prod _{j\in J}{F}_j:& & \prod _{j\in J}X& & \to & \prod _{j\in J}{Y}_j\\ & & {\left(x_j\right)}_{j\in J}& & \mapsto & {\left(F_j\left(x_j\right)\right)}_{j\in J}\\ \end{array}$$ with domain $\prod _{j\in J}X=X^J$ rather than $X.$

Preimage and images of a Cartesian product

Suppose $F_{\bullet }={\left(F_j\right)}_{j\in J}:X\to \prod _{j\in J}{Y}_j.$

If $A\subseteq X$ then $$F_{\bullet }(A)\subseteq \prod _{j\in J}{F}_j(A).$$

If $B\subseteq \prod _{j\in J}{Y}_j$ then $$F_{\bullet }^{-1}(B)\subseteq \bigcap _{j\in J}{F}_j^{-1}({\pi }_j(B))$$ where equality will hold if $B=\prod _{j\in J}{\pi }_j(B),$ in which case $F_{\bullet }^{-1}(B)=\bigcap _{j\in J}{F}_j^{-1}({\pi }_j(B))$ and Template:NumBlk

For equality to hold, it suffices for there to exist a family ${\left(B_j\right)}_{j\in J}$ of subsets $B_j\subseteq Y_j$ such that $B=\prod _{j\in J}{B}_j,$ in which case: Template:NumBlk and ${\pi }_j(B)=B_j$ for all $j\in J.$

(Pre)Image of a single set

Image	Preimage	Additional assumptions
$\begin{array}{cc}f(L)& =f(L\cap \mathrm{domain}f)\\ & =f(L\cap X)\\ & =Y\setminus \{y\in Y:f^{-1}(y)\subseteq X\setminus L\}\\ & =\mathrm{Im}f\setminus \{y\in \mathrm{Im}f:f^{-1}(y)\subseteq X\setminus L\}\\ \end{array}$	$\begin{array}{cc}{f}^{-1}(L)& =f^{-1}(L\cap \mathrm{Im}f)\\ & =f^{-1}(L\cap Y)\end{array}$	None
$f(X)=\mathrm{Im}f\subseteq Y$	$\begin{array}{cc}{f}^{-1}(Y)& =X\\ f^{-1}(\mathrm{Im}f)& =X\end{array}$	None
$\begin{array}{cccccccc}f(L)& =f(L\cap R& & \cup & & (& & L\setminus R))\\ & =f(L\cap R)& & \cup f& & (& & L\setminus R)\end{array}$	$\begin{array}{cccccccccccc}{f}^{-1}(L)& =f^{-1}(L\cap R& & \cup & & (& & L& & \setminus & & R))\\ & =f^{-1}(L\cap R)& & \cup f^{-1}& & (& & L& & \setminus & & R)\\ & =f^{-1}(L\cap R)& & \cup f^{-1}& & (& & L& & \setminus [& & R\cap \mathrm{Im}f])\\ & =f^{-1}(L\cap R)& & \cup f^{-1}& & ([& & L\cap \mathrm{Im}f]& & \setminus & & R)\\ & =f^{-1}(L\cap R)& & \cup f^{-1}& & ([& & L\cap \mathrm{Im}f]& & \setminus [& & R\cap \mathrm{Im}f])\end{array}$	None
$\mathrm{Im}f=f(X)=f(L)\cup f(X\setminus L)$	$\begin{array}{cccc}X& =f^{-1}(L)\cup f^{-1}(Y& & \setminus L)\\ & =f^{-1}(L)\cup f^{-1}(\mathrm{Im}f& & \setminus L)\end{array}$	None
$f{|}_L(R)=f(L\cap R)$	${\left(f{|}_L\right)}^{-1}(R)=L\cap f^{-1}(R)$	None
$(g\circ f)(L)=g(f(L))$	$(g\circ f{)}^{-1}(L)=f^{-1}(g^{-1}(L))$	None ($f$ and $g$ are arbitrary functions).
$f(f^{-1}(L))=L\cap \mathrm{Im}f$	$f^{-1}(f(L))\supseteq L\cap f^{-1}(\mathrm{Im}f)=L\cap f^{-1}(Y)$Template:Sfn	None
$f(f^{-1}(Y))=f(f^{-1}(\mathrm{Im}f))=f(X)$	$f^{-1}(f(X))=f^{-1}(\mathrm{Im}f)=X$	None
$f(f^{-1}(f(L)))=f(L)$	$f^{-1}\left(f(f^{-1}(L))\right)=f^{-1}(L)$	None

Containments ⊆ and intersections ⋂ of images and preimages

Equivalences and implications of images and preimages

Image	Preimage	Additional assumptions on sets
$f(L)\subseteq \mathrm{Im}f\subseteq Y$	$f^{-1}(L)=X$ if and only if $\mathrm{Im}f\subseteq L$	None
$f(L)=\varnothing$ if and only if $L\cap \mathrm{domain}f=\varnothing$	$f^{-1}(L)=\varnothing$ if and only if $L\cap \mathrm{Im}f=\varnothing$	None
$f(A)=\varnothing$ if and only if $A=\varnothing$	$f^{-1}(C)=\varnothing$ if and only if $C\subseteq Y\setminus \mathrm{Im}f$	$A\subseteq X$ and $C\subseteq Y$
$L\subseteq R$ implies $f(L)\subseteq f(R)$Template:Sfn	$L\subseteq R$ implies $f^{-1}(L)\subseteq f^{-1}(R)$Template:Sfn	None
The following are equivalent: $f(L)\subseteq f(R)$ $f(L\cup R)=f(R)$ $L\cap \mathrm{domain}f\subseteq f^{-1}(f(R))$	The following are equivalent: $f^{-1}(L)\subseteq f^{-1}(R)$ $f^{-1}(L\cup R)=f^{-1}(R)$ $L\cap \mathrm{Im}f\subseteq R$ If $C\subseteq \mathrm{Im}f$ then $f^{-1}(C)\subseteq f^{-1}(R)$ if and only if $C\subseteq R.$	$C\subseteq \mathrm{Im}f$
The following are equivalent when $C\subseteq Y:$ $C\subseteq f(R)$ $f(B)=C$ for some $B\subseteq R$ Template:Nowrap	The following are equivalent: $L\subseteq f^{-1}(R)$ $f(L)\subseteq R$ and $L\subseteq \mathrm{domain}f$ The following are equivalent when $A\subseteq X:$ $A\subseteq f^{-1}(R)$ $f(A)\subseteq R$	$A\subseteq X$ and $C\subseteq Y$
The following are equivalent: $f(A)\supseteq f(X\setminus A)$ $f(A)=\mathrm{Im}f$	The following are equivalent: $f^{-1}(C)\supseteq f^{-1}(Y\setminus C)$ $f^{-1}(C)=X$	$A\subseteq X$ and $C\subseteq Y$
$f(f^{-1}(L))\subseteq L$Template:Sfn Equality holds if Template:Em the following is true: $L\subseteq \mathrm{Im}f.$ Equality holds if any of the following are true: $L\subseteq Y$ and $f:X\to Y$ is surjective.	$f^{-1}(f(A))\supseteq A$ Equality holds if Template:Em the following is true: $A$ is $f$-saturated. Equality holds if any of the following are true: $f$ is injective.	$A\subseteq X$

Intersection of a set and a (pre)image

The following statements are equivalent:

1. $\varnothing =f(L)\cap R$
2. $\varnothing =L\cap f^{-1}(R)$Template:Sfn
3. $\varnothing =f^{-1}(f(L))\cap f^{-1}(R)$
4. $\varnothing =f^{-1}(f(L)\cap R)$

Thus for any $t,$Template:Sfn $$t\in ̸f(L)\text{ if and only if }L\cap f^{-1}(t)=\varnothing .$$

Sequences and collections of families of sets

Definitions

A Template:Em or simply a Template:Em is a set whose elements are sets. A Template:Em is a family of subsets of $X.$

The Template:Em of a set $X$ is the set of all subsets of $X$: $$\mathrm{\wp }(X):=\{S:S\subseteq X\}.$$

Notation for sequences of sets

Throughout, $S\text{ and }T$ will be arbitrary sets and $S_{\bullet }$ and will denote a net or a sequence of sets where if it is a sequence then this will be indicated by either of the notations $$S_{\bullet }={\left(S_i\right)}_{i=1}^{\mathrm{\infty }}\text{ or }{S}_{\bullet }={\left(S_i\right)}_{i\in \mathbb{N}}$$ where $\mathbb{N}$ denotes the natural numbers. A notation $S_{\bullet }={\left(S_i\right)}_{i\in I}$ indicates that $S_{\bullet }$ is a net directed by $(I,\le ),$ which (by definition) is a sequence if the set $I,$ which is called the net's indexing set, is the natural numbers (that is, if $I=\mathbb{N}$) and $\le$ is the natural order on $\mathbb{N}.$

Disjoint and monotone sequences of sets

If $S_i\cap S_j=\varnothing$ for all distinct indices $i\ne j$ then $S_{\bullet }$ is called a Template:Em or simply a Template:Em. A sequence or net $S_{\bullet }$ of set is called Template:Em or Template:Em if (resp. Template:Em or Template:Em) if for all indices $i\le j,$ $S_i\subseteq S_j$ (resp. $S_i\supseteq S_j$). A sequence or net $S_{\bullet }$ of set is called Template:Em (resp. Template:Em) if it is non-decreasing (resp. is non-increasing) and also $S_i\ne S_j$ for all Template:Em indices $i\text{ and }j.$ It is called Template:Em if it is non-decreasing or non-increasing and it is called Template:Em if it is strictly increasing or strictly decreasing.

A sequences or net $S_{\bullet }$ is said to Template:Em denoted by $S_{\bullet }\uparrow S$Template:Sfn or $S_{\bullet }\nearrow S,$ if $S_{\bullet }$ is increasing and the union of all $S_i$ is $S;$ that is, if $$\bigcup _n{S}_n=S\text{ and }{S}_i\subseteq S_j\text{ whenever }i\le j.$$ It is said to Template:Em denoted by $S_{\bullet }\downarrow S$Template:Sfn or $S_{\bullet }\searrow S,$ if $S_{\bullet }$ is increasing and the intersection of all $S_i$ is $S$ that is, if $$\bigcap _n{S}_n=S\text{ and }{S}_i\supseteq S_j\text{ whenever }i\le j.$$

Definitions of elementwise operations on families

If $ℒ\text{ and }ℛ$ are families of sets and if $S$ is any set then define:Template:Sfn $$ℒ(\cup )ℛ:=\{L\cup R:L\in ℒ\text{ and }R\in ℛ\}$$ $$ℒ(\cap )ℛ:=\{L\cap R:L\in ℒ\text{ and }R\in ℛ\}$$ $$ℒ(\setminus )ℛ:=\{L\setminus R:L\in ℒ\text{ and }R\in ℛ\}$$ $$ℒ(\mathrm{△})ℛ:=\{L\mathrm{△}R:L\in ℒ\text{ and }R\in ℛ\}$$ $$ℒ{|}_S:=\{L\cap S:L\in ℒ\}=ℒ(\cap )\{S\}$$ which are respectively called Template:Em Template:Em, Template:Em Template:Em, Template:Em (Template:Em) Template:Em, Template:Em Template:Em, and the Template:Em/Template:Em The regular union, intersection, and set difference are all defined as usual and are denoted with their usual notation: $ℒ\cup ℛ,ℒ\cap ℛ,ℒ\mathrm{△}ℛ,$ and $ℒ\setminus ℛ,$ respectively. These elementwise operations on families of sets play an important role in, among other subjects, the theory of filters and prefilters on sets.

The Template:Em of a family $ℒ\subseteq \mathrm{\wp }(X)$ is the family: $${ℒ}^{\uparrow X}:=\bigcup _{L\in ℒ}\{S:L\subseteq S\subseteq X\}=\{S\subseteq X:\text{ there exists }L\in ℒ\text{ such that }L\subseteq S\}$$ and the Template:Em is the family: $${ℒ}^{\downarrow }:=\bigcup _{L\in ℒ}\mathrm{\wp }(L)=\{S:\text{ there exists }L\in ℒ\text{ such that }S\subseteq L\}.$$

Definitions of categories of families of sets

The following table lists some well-known categories of families of sets having applications in general topology and measure theory.

A family $ℒ$ is called Template:Em, Template:Em, or Template:Em in $X$ if $ℒ\subseteq \mathrm{\wp }(X)$ and $ℒ={ℒ}^{\uparrow X}.$Template:Sfn A family $ℒ$ is called Template:Em if $ℒ={ℒ}^{\downarrow }.$

A family $ℒ$ is said to be:

• Template:Em (resp. Template:Em) if whenever $L,R\in ℒ$ then $L\cap R\in ℒ$ (respectively, $L\cup R\in ℒ$).
• Template:Em (resp. Template:Em) if whenever $L_1,L_2,L_3,\dots$ are elements of $ℒ$ then so is their intersections $\bigcap _{i=1}^{\mathrm{\infty }}{L}_i:=L_1\cap L_2\cap L_3\cap \cdots$ (resp. so is their union $\bigcup _{i=1}^{\mathrm{\infty }}{L}_i:=L_1\cup L_2\cup L_3\cup \cdots$).
• Template:Em (or Template:Em) Template:Em if whenever $L\in ℒ$ then $X\setminus L\in ℒ.$

A family $ℒ$ of sets is called a/an:

• Template:Em if $ℒ\ne \varnothing$ and $ℒ$ is closed under finite-intersections.
  • Every non-empty family $ℒ$ is contained in a unique smallest (with respect to $\subseteq$) Template:Pi−system that is denoted by $\pi (ℒ)$ and called Template:Em
• Template:Em and is said to have Template:Em if $ℒ\ne \varnothing$ and $\varnothing \in ̸\pi (ℒ).$
• Template:Em if $ℒ\ne \varnothing$ is a family of subsets of $X$ that is a Template:Pi−system, is upward closed in $X,$ and is also Template:Em, which by definition means that it does not contain the empty set as an element.
• Template:Em or Template:Em if it is a non-empty family of subsets of some set $X$ whose upward closure in $X$ is a filter on $X.$
• Template:Em is a non-empty family of subsets of $X$ that contains the empty set, forms a Template:Pi−system, and is also closed under complementation with respect to $X.$
• Template:Em is an algebra on $X$ that is closed under countable unions (or equivalently, closed under countable intersections).

Sequences of sets often arise in measure theory.

Algebra of sets

A family $\mathrm{\Phi }$ of subsets of a set $X$ is said to be Template:Em if $\varnothing \in \mathrm{\Phi }$ and for all $L,R\in \mathrm{\Phi },$ all three of the sets $X\setminus R,L\cap R,$ and $L\cup R$ are elements of $\mathrm{\Phi }.$ The article on this topic lists set identities and other relationships these three operations.

Every algebra of sets is also a ring of sets and a π-system.

Algebra generated by a family of sets

Given any family $𝒮$ of subsets of $X,$ there is a unique smallest algebra of sets in $X$ containing $𝒮.$ It is called Template:Em and it will be denote it by ${\mathrm{\Phi }}_{𝒮}.$ This algebra can be constructed as follows:

1. If $𝒮=\varnothing$ then ${\mathrm{\Phi }}_{𝒮}=\{\varnothing ,X\}$ and we are done. Alternatively, if $𝒮$ is empty then $𝒮$ may be replaced with $\{\varnothing \},\{X\},\text{ or }\{\varnothing ,X\}$ and continue with the construction.
2. Let ${𝒮}_0$ be the family of all sets in $𝒮$ together with their complements (taken in $X$).
3. Let ${𝒮}_1$ be the family of all possible finite intersections of sets in ${𝒮}_0.$
4. Then the algebra generated by $𝒮$ is the set ${\mathrm{\Phi }}_{𝒮}$ consisting of all possible finite unions of sets in ${𝒮}_1.$

Elementwise operations on families

Let $ℒ,ℳ,$ and $ℛ$ be families of sets over $X.$ On the left hand sides of the following identities, $ℒ$ is the Template:EmTemplate:Hspeft most family, $ℳ$ is in the Template:EmTemplate:Hspiddle, and $ℛ$ is the Template:EmTemplate:Hspight most set.

Commutativity:Template:Sfn $$ℒ(\cup )ℛ=ℛ(\cup )ℒ$$ $$ℒ(\cap )ℛ=ℛ(\cap )ℒ$$

Associativity:Template:Sfn $$[ℒ(\cup )ℳ](\cup )ℛ=ℒ(\cup )[ℳ(\cup )ℛ]$$ $$[ℒ(\cap )ℳ](\cap )ℛ=ℒ(\cap )[ℳ(\cap )ℛ]$$

Identity: $$ℒ(\cup )\{\varnothing \}=ℒ$$ $$ℒ(\cap )\{X\}=ℒ$$ $$ℒ(\setminus )\{\varnothing \}=ℒ$$

Domination: $$ℒ(\cup )\{X\}=\{X\}\text{ if }ℒ\ne \varnothing$$ $$ℒ(\cap )\{\varnothing \}=\{\varnothing \}\text{ if }ℒ\ne \varnothing$$ $$ℒ(\cup )\varnothing =\varnothing$$ $$ℒ(\cap )\varnothing =\varnothing$$ $$ℒ(\setminus )\varnothing =\varnothing$$ $$\varnothing (\setminus )ℛ=\varnothing$$

Power set

$$\mathrm{\wp }(L\cap R)=\mathrm{\wp }(L)\cap \mathrm{\wp }(R)$$ $$\mathrm{\wp }(L\cup R)=\mathrm{\wp }(L)(\cup )\mathrm{\wp }(R)\supseteq \mathrm{\wp }(L)\cup \mathrm{\wp }(R).$$

If $L$ and $R$ are subsets of a vector space $X$ and if $s$ is a scalar then $$\mathrm{\wp }(sL)=s\mathrm{\wp }(L)$$ $$\mathrm{\wp }(L+R)\supseteq \mathrm{\wp }(L)+\mathrm{\wp }(R).$$

Sequences of sets

Suppose that $L$ is any set such that $L\supseteq R_i$ for every index $i.$ If $R_{\bullet }$ decreases to $R$ then $L\setminus R_{\bullet }:={(L\setminus R_i)}_i$ increases to $L\setminus R$Template:Sfn whereas if instead $R_{\bullet }$ increases to $R$ then $L\setminus R_{\bullet }$ decreases to $L\setminus R.$

If $L\text{ and }R$ are arbitrary sets and if $L_{\bullet }={\left(L_i\right)}_i$ increases (resp. decreases) to $L$ then ${(L_i\setminus R)}_i$ increase (resp. decreases) to $L\setminus R.$

Partitions

Suppose that $S_{\bullet }={\left(S_i\right)}_{i=1}^{\mathrm{\infty }}$ is any sequence of sets, that $S\subseteq \bigcup _i{S}_i$ is any subset, and for every index $i,$ let $D_i=(S_i\cap S)\setminus \bigcup _{m=1}^i(S_m\cap S).$ Then $S=\bigcup _i{D}_i$ and $D_{\bullet }:={\left(D_i\right)}_{i=1}^{\mathrm{\infty }}$ is a sequence of pairwise disjoint sets.Template:Sfn

Suppose that $S_{\bullet }={\left(S_i\right)}_{i=1}^{\mathrm{\infty }}$ is non-decreasing, let $S_0=\varnothing ,$ and let $D_i=S_i\setminus S_{i-1}$ for every $i=1,2,\dots .$ Then $\bigcup _i{S}_i=\bigcup _i{D}_i$ and $D_{\bullet }={\left(D_i\right)}_{i=1}^{\mathrm{\infty }}$ is a sequence of pairwise disjoint sets.Template:Sfn

See also

• Template:Annotated link
• Template:Annotated link
• Template:Annotated link
• Template:Annotated link
• Template:Annotated link
• Template:Annotated link
• Template:Annotated link
• Template:Annotated link
• Template:Annotated link
• Template:Annotated link
• Template:Annotated link
• Template:Annotated link

Notes

Notes

Proofs

References

• Template:Cite book
• Template:Cite book.
• Template:Cite journal
• Courant, Richard, Herbert Robbins, Ian Stewart, What is mathematics?: An Elementary Approach to Ideas and Methods, Oxford University Press US, 1996. Template:ISBN. "SUPPLEMENT TO CHAPTER II THE ALGEBRA OF SETS".
• Template:Császár General Topology
• Template:Dixmier General Topology
• Template:Dolecki Mynard Convergence Foundations Of Topology
• Template:Dugundji Topology
• Template:Durrett Probability Theory and Examples 5th Edition
• Template:Cite book
• Template:Joshi Introduction to General Topology
• Template:Cite book
• Template:Köthe Topological Vector Spaces I
• Template:Cite book
• Template:Munkres Topology
• Template:Narici Beckenstein Topological Vector Spaces
• Template:Cite journal
• Template:Schechter Handbook of Analysis and Its Foundations
• Template:Schubert Topology
• Stoll, Robert R.; Template:Em, Mineola, N.Y.: Dover Publications (1979) Template:ISBN. "The Algebra of Sets", pp 16—23.
• Template:Cite journal
• Template:Wilansky Modern Methods in Topological Vector Spaces
• Template:Willard General Topology

External links

• Operations on Sets at ProvenMath