Intersection (set Theory) Intersection Syndrome Intersection

For example, the intersection of the sets {1, 2, 3} and {2, 3, 4} is {2, 3}. The 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, …}.

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
{1, 2} ∩{3, 4} = Ø.

More generally, one can take the intersection of several sets at once. The intersection of A, B, C, and D, for example, is A ∩B ∩C ∩D = A ∩(B ∩(C ∩D)). Intersection 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. If 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. In symbols:

This idea subsumes the above paragraphs, in that for example, A ∩B ∩C is the intersection of the collection {A,B,C}. (The case where M is empty can sometimes be made sense of; see nullary intersection.)

The latter notation can be generalized to "∩_i∈I A_i", which refers to the intersection of the collection {A_i : i ∈ I}. Here I is a nonempty set, and A_i is a set for every i in I.

When formatting is difficult, this can also be written "A₁ ∩ A₂ ∩ A₃ ∩ ...", even though strictly speaking, A₁ ∩ (A₂ ∩ (A₃ ∩ ... makes no sense. (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. (Eventually this will be available in HTMLHyperText Markup Language (HTML) is a markup language designed for creating web pages, that is, information presented on the World Wide Web. Defined as a simple "application" of SGML, which is used by organizations with complex publishing requirements, HT as the character entity ⋂, but until then, try ∩.)

Naive set theoryNaive set theory 1 is distinguished from axiomatic set theory by the fact that the former regards sets as collections of objects, called the elements or members of the set, whereas the latter regards sets only as that which satisfies certain axioms. Sets
UnionAbstract algebra Algebra In set theory and other branches of mathematics, the union of a collection of sets is the set that contains everything that belongs to any of the sets, but nothing else. This article uses mathematical symbols. Basic definition If
ComplementIn set theory and other branches of mathematics, two kinds of complements are defined, the relative complement and the absolute complement . Relative complement If A and B are sets, then the relative complement of a A in B also known as the set theoretic
Symmetric differenceAbstract algebra Algebra In mathematics, the symmetric difference of two sets is the set of elements which are in one of either set, but not in both. This operation is the set-theoretic equivalent of the XOR operation in Boolean logic. The symmetric diffe

Abstract algebraAbstract algebra Abstract algebra is the field of mathematics concerned with the study of algebraic structures such as groups, rings and fields. The term "abstract algebra" is used to distinguish the field from " elementary algebra" or "high school algebr AlgebraAlgebra Algebra (from the Arabic al-jabr meaning reunion connection or completion is a branch of mathematics which may be roughly characterized as a generalization and extension of arithmetic; it also refers to a particular kind of abstract algebra struct Set theory

<Hide>

Home > Intersection (set theory)

See also

Topics: Intersection (set Theory), Intersection Syndrome, Intersection...