Intersection (set theory)\n\n\nCategory:Abstract algebra Category:Algebra\nIn 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. This article uses mathematical symbols. The intersection of A and B is written "A ∩ B".\nFormally: \n: x is an element of A ∩ B if and only if\n:* x is an element of A and \n:* x is an element of B. For example, the intersection of the sets {1,2,3} and {2,3,4} is {2,3}.\nThe number 9 is not contained in the intersection of the set of prime numbers {2,3,5,7,11,...} and the set of odd numbers {1,3,5,7,9,11,...}. More generally, one can take the intersection of several sets at once.\nThe intersection of A, B, C, and D, for example, is A ∩ B ∩ C ∩ D = A ∩ (B ∩ (C ∩ D)).\nIntersection is an associative operation; thus, A ∩ (B ∩ C) = (A ∩ B) ∩ C. The most general notion is the intersection of an arbitrary nonempty collection of sets.\nIf M is a nonempty set whose elements are themselves sets, then x is an element of the intersection of M if and only if for every element A of M, x is an element of A.\nIn symbols:⋂, but until then, try <big>∩</big>.)
See also\n* Basic set theory\n* union\n* complement\n* symmetric difference Category:Set theory |
||
"The President has kept all of the promises he intended to keep." - Clinton aide George Stephanopolous speaking on Larry King Live |

