Definition:Set Intersection
Contents
Definition
Let $S$ and $T$ be any two sets.
The (set) intersection of $S$ and $T$ is written $S \cap T$.
It means the set which consists of all the elements which are contained in both of $S$ and $T$:
- $x \in S \cap T \iff x \in S \land x \in T$
or, more formally:
- $A = S \cap T \iff \forall z: \left({z \in A \iff z \in S \land z \in T}\right)$
We can write:
- $S \cap T := \left\{{x: x \in S \land x \in T}\right\}$
For example, let $S = \left \{{1,2,3}\right\}$ and $T = \left \{{2,3,4}\right\}$. Then $S \cap T = \left \{{2,3}\right\}$.
It can be seen that $\cap$ is an operator.
One often says that two sets intersect iff they have non-empty intersection.
General Definition
Let $\Bbb S$ be a set of sets
The intersection of $\Bbb S$ is:
- $\displaystyle \bigcap \Bbb S := \left\{{x: \forall S \in \Bbb S: x \in S}\right\}$
That is, the set of all objects that are elements of all the elements of $\Bbb S$.
Thus:
- $\displaystyle \bigcap \left\{{S, T}\right\} := S \cap T$
Family of Sets
Let $I$ be an indexing set.
Let $\left \langle {S_i} \right \rangle_{i \mathop \in I}$ be a family of sets indexed by $I$.
Then the intersection of $\left \langle {S_i} \right \rangle$ is defined as:
- $\displaystyle \bigcap_{i \mathop \in I} S_i := \left\{{x: \forall i \in I: x \in S_i}\right\}$
Countable Intersection
Let $\Bbb S = \left\{{S_0, S_1, S_2, \ldots}\right\}$ be a set of a countably infinite number of sets.
Then:
- $\displaystyle \bigcap \Bbb S := \bigcap_{i \mathop \in \N} S_i = \left\{{x: \forall i \in \N: x \in S_i}\right\}$
This can also be denoted:
- $\displaystyle \bigcap_{i \mathop = 1}^\infty S_i$
but its usage is strongly discouraged.
If it is clear from the context that $i \in \N$, we can also write $\displaystyle \bigcap_{\N} S_i$.
Finite Intersection
Let $S = S_1 \cap S_2 \cap \ldots \cap S_n$.
Then:
- $\displaystyle S = \bigcap_{i \mathop \in \N^*_n} S_i := \left\{{x: \forall i \in \N^*_n: x \in S_i}\right\}$
where $\N^*_n = \left\{{1, 2, 3, \ldots, n}\right\}$.
If it is clear from the context that $i \in \N^*_n$, we can also write $\displaystyle \bigcap_{\N^*_n} S_i$.
Illustration by Venn Diagram
The intersection $S \cap T$ of the two sets $S$ and $T$ is illustrated in the following Venn diagram by the red area:
Historical Note
The symbol $\cap$, informally known as cap, was first used by Hermann Grassmann in Die Ausdehnungslehre from 1844. However, he was using it as a general operation symbol, not specialized for intersection.
It was Giuseppe Peano who took this symbol and used it for intersection, in his 1888 work Calcolo geometrico secondo l'Ausdehnungslehre di H. Grassmann.
Peano also created the large symbol $\bigcap$ for general intersection of more than two sets. This appeared in his Formulario Mathematico (5th edtion, 1908).^{[1]}
Also denoted as
Some authors use the notation $S \ T$ or $S \cdot T$ for $S \cap T$, but this is non-standard and can be confusing.
Also see
- Definition:Set Union, a related operation.
- Intersection of Singleton, where it is shown that $\displaystyle \Bbb S = \left\{{S}\right\} \implies \bigcap \Bbb S = S$
- Intersection of Empty Set, where it is shown (paradoxically) that $\displaystyle \Bbb S = \left\{{\varnothing}\right\} \implies \bigcap \Bbb S = \Bbb U$
- Results about set intersections can be found here.
Internationalization
Intersection is translated:
In German: | durchschnitt | (literally: (act of) cutting) | ||
In Dutch: | doorsnede |
References
- ↑ See Earliest Uses of Symbols of Set Theory and Logic in Jeff Miller's website Earliest Uses of Various Mathematical Symbols.
Sources
- Nathan Jacobson: Lectures in Abstract Algebra: I. Basic Concepts (1951)... (previous)... (next): Introduction $\S 1$: Operations on Sets
- Paul R. Halmos: Naive Set Theory (1960)... (previous)... (next): $\S 4$: Unions and Intersections
- Bert Mendelson: Introduction to Topology (1962)... (previous)... (next): $\S 1.3$: Set Operations: Union, Intersection and Complement
- W.E. Deskins: Abstract Algebra (1964)... (previous)... (next): $\S 1.1$: Definition $1.2$
- Steven A. Gaal: Point Set Topology (1964)... (previous)... (next): Introduction to Set Theory: $1$. Elementary Operations on Sets
- Murray R. Spiegel: Theory and Problems of Complex Variables (1964)... (previous)... (next): $1$: Point Sets: $12.$
- J.A. Green: Sets and Groups (1965)... (previous)... (next): $\S 1.3$
- Seth Warner: Modern Algebra (1965)... (previous)... (next): $\S 3$
- Richard A. Dean: Elements of Abstract Algebra (1966)... (previous)... (next): $\S 0.2$
- George McCarty: Topology: An Introduction with Application to Topological Groups (1967)... (previous)... (next): Introduction: Set-Theoretic Notation
- A.N. Kolmogorov and S.V. Fomin: Introductory Real Analysis (1968)... (previous)... (next): $\S 1.2$: Operations on sets
- Ian D. Macdonald: The Theory of Groups (1968)... (previous)... (next): Appendix: Elementary set and number theory
- C.R.J. Clapham: Introduction to Abstract Algebra (1969)... (previous)... (next): $\S 1.2$: Example $2$
- Avner Friedman: Foundations of Modern Analysis (1970)... (previous)... (next): $\S 1.1$: Rings and Algebras
- B. Hartley and T.O. Hawkes: Rings, Modules and Linear Algebra (1970)... (previous)... (next): $\S 1.2$: Some examples of rings: Ring Example $6$
- George E. Andrews: Number Theory (1971)... (previous)... (next): $\S 2.2$: Exercise $10$
- Allan Clark: Elements of Abstract Algebra (1971)... (previous)... (next): $\S 5$
- Robert H. Kasriel: Undergraduate Topology (1971)... (previous)... (next): $\S 1.4$: Union and Intersection of Sets: Definition $4.2$
- Gaisi Takeuti and Wilson M. Zaring: Introduction to Axiomatic Set Theory (1971): $\S 5.6$
- A.G. Howson: A Handbook of Terms used in Algebra and Analysis (1972)... (previous)... (next): $\S 2$: Sets and functions: Sets
- T.S. Blyth: Set Theory and Abstract Algebra (1975)... (previous)... (next): $\S 1$
- W.A. Sutherland: Introduction to Metric and Topological Spaces (1975)... (previous)... (next): Notation and Terminology
- Gary Chartrand: Introductory Graph Theory (1977)... (previous)... (next): Appendix $\text{A}.1$: Sets and Subsets
- Thomas A. Whitelaw: An Introduction to Abstract Algebra (1978)... (previous)... (next): $\S 7$
- P.M. Cohn: Algebra Volume 1 (2nd ed., 1982)... (previous)... (next): $\S 1.2$: Sets
- Geoffrey Grimmett and Dominic Welsh: Probability: An Introduction (1986)... (previous)... (next): $\S 1.2$: Outcomes and events
- Keith Devlin: The Joy of Sets: Fundamentals of Contemporary Set Theory (2nd ed., 1993)... (previous)... (next): $\S 1.2$: Operations on Sets
- Keith Devlin: The Joy of Sets: Fundamentals of Contemporary Set Theory (2nd ed., 1993)... (previous)... (next): $\S 1.3$: Notation for Sets: Exercise $1.3.1 \ \text{(ii)}$
- H. Jerome Keisler and Joel Robbin: Mathematical Logic and Computability (1996)... (previous)... (next): Appendix $\text{A}.2$: Boolean Operations
- James R. Munkres: Topology (2nd ed., 2000)... (previous)... (next): $1$: Set Theory and Logic: $\S 1$: Fundamental Concepts
- René L. Schilling: Measures, Integrals and Martingales (2005)... (previous)... (next): $\S 2$
- Paul Halmos and Steven Givant: Introduction to Boolean Algebras (2008)... (previous)... (next): Appendix $\text{A}$: Set Theory: Operations on Sets
- M. Ben-Ari: Mathematical Logic for Computer Science (3rd ed., 2012)... (previous)... (next): Appendix $\text{A}.2$: Definition $\text{A}.8$