Union Distributes over Intersection
Theorem
Set union is distributive over set intersection:
- $R \cup \paren {S \cap T} = \paren {R \cup S} \cap \paren {R \cup T}$
Family of Sets
Let $I$ be an indexing set.
Let $\family {A_\alpha}_{\alpha \mathop \in I}$ be an indexed family of subsets of a set $S$.
Let $B \subseteq S$.
Then:
- $\ds \map {\bigcap_{\alpha \mathop \in I} } {A_\alpha \cup B} = \paren {\bigcap_{\alpha \mathop \in I} A_\alpha} \cup B$
where $\ds \bigcap_{\alpha \mathop \in I} A_\alpha$ denotes the intersection of $\family {A_\alpha}_{\alpha \mathop \in I}$.
General Result
Let $S$ and $T$ be sets.
Let $\powerset T$ be the power set of $T$.
Let $\mathbb T$ be a subset of $\powerset T$.
Then:
- $\ds S \cup \bigcap \mathbb T = \bigcap_{X \mathop \in \mathbb T} \paren {S \cup X}$
Proof 1
\(\ds \) | \(\) | \(\ds x \in R \cup \paren {S \cap T}\) | ||||||||||||
\(\ds \) | \(\leadstoandfrom\) | \(\ds x \in R \lor \paren {x \in S \land x \in T}\) | Definition of Set Union and Definition of Set Intersection | |||||||||||
\(\ds \) | \(\leadstoandfrom\) | \(\ds \paren {x \in R \lor x \in S} \land \paren {x \in R \lor x \in T}\) | Disjunction is Left Distributive over Conjunction | |||||||||||
\(\ds \) | \(\leadstoandfrom\) | \(\ds x \in \paren {R \cup S} \cap \paren {R \cup T}\) | Definition of Set Union and Definition of Set Intersection |
$\blacksquare$
Proof 2
From Intersection Distributes over Union:
- $R \cap \paren {S \cup T} = \paren {R \cap S} \cup \paren {R \cap T}$
From the Duality Principle for Sets, exchanging $\cup$ for $\cap$ throughout, and vice versa, reveals the result:
- $R \cup \paren {S \cap T} = \paren {R \cup S} \cap \paren {R \cup T}$
$\blacksquare$
Demonstration by Venn Diagram
In the left hand diagram, $R$ is depicted in blue and $S \cap T$ is depicted in yellow.
Their intersection, where they overlap, is depicted in green.
Their union $R \cup \paren {S \cap T}$ is the total shaded area: yellow, blue and green.
In the right hand diagram, $\paren {R \cup S}$ is depicted in yellow and $\paren {R \cup T}$ is depicted in blue.
Their intersection, where they overlap, is depicted in green.
As can be seen by inspection, the areas are the same.
Also known as
This result and Intersection Distributes over Union are together known as the Distributive Laws.
Examples
Arbitrary Integer Sets: $1$
- $A \cup \paren {B \cap C} = \set {1, 2, 3, 4, 6, 8, \dotsc} = \paren {A \cup B} \cap \paren {A \cup C}$
Arbitrary Integer Sets: $2$
- $B \cup \paren {A \cap C} = \set {1, 2, 3, 4, 5, 7, \dotsc} = \paren {B \cup A} \cap \paren {B \cup C}$
Also see
Sources
- 1955: John L. Kelley: General Topology ... (previous) ... (next): Chapter $0$: Subsets and Complements; Union and Intersection: Theorem $2 \ \text{(d)}$
- 1961: John G. Hocking and Gail S. Young: Topology ... (previous) ... (next): A Note on Set-Theoretic Concepts: $(3)$
- 1964: W.E. Deskins: Abstract Algebra ... (previous) ... (next): Exercise $1.1: \ 8 \ \text{(e)}$
- 1964: Steven A. Gaal: Point Set Topology ... (previous) ... (next): Introduction to Set Theory: $1$. Elementary Operations on Sets
- 1965: A.M. Arthurs: Probability Theory ... (previous) ... (next): Chapter $1$: Set Theory: $1.3$: Set operations
- 1965: Seth Warner: Modern Algebra ... (previous) ... (next): Chapter $\text I$: Algebraic Structures: $\S 3$: Unions and Intersections of Sets: Theorem $3.1$
- 1965: Seth Warner: Modern Algebra ... (previous) ... (next): Chapter $\text I$: Algebraic Structures: $\S 3$: Unions and Intersections of Sets: Exercise $3.2$
- 1968: A.N. Kolmogorov and S.V. Fomin: Introductory Real Analysis ... (previous) ... (next): $\S 1.2$: Operations on sets: $(2)$
- 1971: Allan Clark: Elements of Abstract Algebra ... (previous) ... (next): Chapter $1$: The Notation and Terminology of Set Theory: $\S 7 \ \text{(a)}$
- 1971: Robert H. Kasriel: Undergraduate Topology ... (previous) ... (next): $\S 1.6$: Set Identities and Other Set Relations: Exercise $2 \ \text{(g)}$
- 1972: A.G. Howson: A Handbook of Terms used in Algebra and Analysis ... (previous) ... (next): $\S 2$: Sets and functions: Operations
- 1975: T.S. Blyth: Set Theory and Abstract Algebra ... (previous) ... (next): $\S 1$. Sets; inclusion; intersection; union; complementation; number systems: $\text{(d)}$
- 1975: Bert Mendelson: Introduction to Topology (3rd ed.) ... (previous) ... (next): Chapter $1$: Theory of Sets: $\S 4$: Indexed Families of Sets: Exercise $2$
- 1978: Thomas A. Whitelaw: An Introduction to Abstract Algebra ... (previous) ... (next): $\S 7.4 \ \text{(ii)}$: Unions and Intersections
- 1982: P.M. Cohn: Algebra Volume 1 (2nd ed.) ... (previous) ... (next): Chapter $1$: Sets and mappings: $\S 1.2$: Sets: Exercise $1 \ \text{(viii)}$
- 1993: Keith Devlin: The Joy of Sets: Fundamentals of Contemporary Set Theory (2nd ed.) ... (previous) ... (next): $\S 1$: Naive Set Theory: $\S 1.2$: Operations on Sets: Exercise $1.2.1 \ \text{(v)}$
- 2000: James R. Munkres: Topology (2nd ed.) ... (previous) ... (next): $1$: Set Theory and Logic: $\S 1$: Fundamental Concepts
- 2005: René L. Schilling: Measures, Integrals and Martingales ... (previous) ... (next): $\S 2$
- 2008: Paul Halmos and Steven Givant: Introduction to Boolean Algebras ... (previous) ... (next): $\S 2$
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): distributive
- 2012: M. Ben-Ari: Mathematical Logic for Computer Science (3rd ed.) ... (previous) ... (next): Appendix $\text{A}.2$: Theorem $\text{A}.10$
- 2014: Christopher Clapham and James Nicholson: The Concise Oxford Dictionary of Mathematics (5th ed.) ... (previous) ... (next): algebra of sets: $\text {(vi)}$