![]() |
![]() |
|
![]() |
![]() |
Encyclopedia :
I :
IN :
INT :
Intersection (set theory) |
|
|
Intersection (set theory)In mathematics, the intersection of two sets A and B is the set that contains all elements of A that also belong to B (or equivalently, all elements of B that also belong to A), but no other elements.For explanation of the symbols used in this article, refer to the table of mathematical symbols. Basic definition
For example, the intersection of the sets {1, 2, 3} and {2, 3, 4} is {2, 3}. If the intersection of two sets A and B is empty, that is they have no elements in common, then they are said to be disjoint, denoted: A ∩ B = Ø. For example the sets {1, 2} and {3, 4} are disjoint, written More generally, one can take the intersection of several sets at once. Arbitrary intersections The most general notion is the intersection of an arbitrary nonempty collection of sets.
The notation for this last concept can vary considerably. In the case that the index set I is the set of natural numbers, you might see notation analogous to that of an infinite series:
(This last example, an intersection of countably many sets, is actually very common; for an example see the article on σ-algebras.) Finally, let us note that whenever the symbol "∩" is placed before other symbols instead of between them, it should be of a larger size. Nullary intersection Note that in the previous section we excluded the case where M was the empty set (∅). The reason is the follows. The intersection of the collection M is defined as the set (see set-builder notation) A partial fix for this problem can be found if we agree to restriction our attention to subsets of a fixed set U called the universe. In this case the intersection of a family of subsets of U can be defined as See also
|
|
|
This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License. |
|
| © 2008 Chamas Enterprises Inc. |