Intersection (set theory)

{{Infobox mathematical statement | name = Intersection | image = Venn0001.svg | caption = The intersection of two sets A and B, represented by circles.

Uses your system voice; voice and rate in settings.

≈ 10 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In set theory, the intersection of two sets A and B, denoted by A∩B,[1] is the set containing all elements of A that also belong to B or equivalently, all elements of B that also belong to A.[2] The notion of intersection as an algebraic operation with sets as operands has been generalized from geometry, where it is encountered in the case of geometric sets of points, such as individual points, lines (infinite uncountable sets of points), planes, etc.

  • 3 Algebraic properties
  • 4 Arbitrary intersections
  • 5 Nullary intersection
  • 6 See also
  • 7 References
  • 8 Further reading
  • 9 External links
  • Notation and terminology

    edit edit source

    Intersection is written using the symbol "∩" between the terms; that is, in infix notation. For example: {1,2,3}∩{2,3,4}={2,3} {1,2,3}∩{4,5,6}=∅ ℤ∩ℕ=ℕ {x∈ℝ:x2=1}∩ℕ={1} The intersection of more than two sets (generalized intersection) can be written as: ⋂i=1nAi which is similar to capital-sigma notation.

    For an explanation of the symbols used in this article, refer to the table of mathematical symbols.

    Definition

    edit edit source

    The intersection of two sets A and B, denoted by A∩B,[3] is the set of all objects that are members of both the sets A and B. In symbols: A∩B={x:x∈A and x∈B}.

    That is, x is an element of the intersection A∩B if and only if x is both an element of A and an element of B.[3]

    For example:

    • The intersection of the sets {1, 2, 3} and {2, 3, 4} is {2, 3}.
    • The number 9 is not 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, ...}, because 9 is not prime.
    • The intersection of two geometric sets of points such as two lines is a singleton set of one point for distinct non-parallel lines in the same plane.

    Intersecting and disjoint sets

    edit edit source

    We say that A intersects (meets) B if there exists some x that is an element of both A and B, in which case we also say that A intersects (meets) B at x. Equivalently, A intersects B if their intersection A∩B is an inhabited set, meaning that there exists some x such that x∈A∩B.

    We say that A and B are disjoint if A does not intersect B. In plain language, they have no elements in common. A and B are disjoint if their intersection is empty, denoted A∩B=∅.

    For example:

    • the sets {1,2} and {3,4} are disjoint, while the set of even numbers intersects the set of multiples of 3 at the multiples of 6.
    • two parallel lines in the same plane are disjoint.

    Algebraic properties

    edit edit source

    Binary intersection is an associative operation; that is, for any sets A,B, and C, one has

    A∩(B∩C)=(A∩B)∩C.Thus the parentheses may be omitted without ambiguity: either of the above can be written as A∩B∩C. Intersection is also commutative. That is, for any A and B, one hasA∩B=B∩A. The intersection of any set with the empty set results in the empty set; that is, that for any set A, A∩∅=∅ Also, the intersection operation is idempotent; that is, any set A satisfies that A∩A=A. All these properties follow from analogous facts about logical conjunction.

    Intersection distributes over union and union distributes over intersection. That is, for any sets A,B, and C, one has A∩(B∪C)=(A∩B)∪(A∩C)A∪(B∩C)=(A∪B)∩(A∪C) Inside a universe U, one may define the complement Ac of A to be the set of all elements of U not in A. Furthermore, the intersection of A and B may be written as the complement of the union of their complements, derived easily from De Morgan's laws:A∩B=(Ac∪Bc)c

    Arbitrary intersections

    edit edit source

    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: (x∈⋂A∈MA)⇔(∀A∈M, x∈A).

    The notation for this last concept can vary considerably. Set theorists will sometimes write "⋂M", while others will instead write "⋂A∈MA". The latter notation can be generalized to "⋂i∈IAi", which refers to the intersection of the collection {Ai:i∈I}. Here I is a nonempty set, and Ai is a set for every i∈I.

    In the case that the index set I is the set of natural numbers, notation analogous to that of an infinite product may be seen: ⋂i=1∞Ai.

    When formatting is difficult, this can also be written "A1∩A2∩A3∩⋯". This last example, an intersection of countably many sets, is actually very common; for an example, see the article on σ-algebras.

    Nullary intersection

    edit edit source

    In the previous section, we excluded the case where M was the empty set (∅). The reason is as follows: The intersection of the collection M is defined as the set (see set-builder notation) ⋂A∈MA={x: for all A∈M,x∈A}. If M is empty, there are no sets A in M, so the question becomes "which x's satisfy the stated condition?" The answer seems to be every possible x. When M is empty, the condition given above is an example of a vacuous truth. So the intersection of the empty family should be the universal set (the identity element for the operation of intersection),[4] but in standard (ZF) set theory, the universal set does not exist.

    However, when restricted to the context of subsets of a given fixed set X, the notion of the intersection of an empty collection of subsets of X is well-defined. In that case, if M is empty, its intersection is ⋂M=⋂∅={x∈X:x∈A for all A∈∅}. Since all x∈X vacuously satisfy the required condition, the intersection of the empty collection of subsets of X is all of X. In formulas, ⋂∅=X. This matches the intuition that as collections of subsets become smaller, their respective intersections become larger; in the extreme case, the empty collection has an intersection equal to the whole underlying set.

    Also, in type theory x is of a prescribed type τ, so the intersection is understood to be of type set τ (the type of sets whose elements are in τ), and we can define ⋂A∈∅︀A to be the universal set of set τ (the set whose elements are exactly all terms of type τ).

    See also

    edit edit source

    References

    edit edit source
    1. ^ "Intersection of Sets". web.mnstate.edu. Archived from the original on 2020-08-04. Retrieved 2020-09-04. Wikipedia revision 1377874427, retrieved 2026-11-21
    2. ^ "Stats: Probability Rules". People.richland.edu. Retrieved 2012-05-08. Wikipedia revision 1377874427, retrieved 2026-11-21
    3. ^ a b "Set Operations | Union | Intersection | Complement | Difference | Mutually Exclusive | Partitions | De Morgan's Law | Distributive Law | Cartesian Product". www.probabilitycourse.com. Retrieved 2020-09-04. Wikipedia revision 1377874427, retrieved 2026-11-21
    4. ^ Megginson, Robert E. (1998). "Chapter 1". An introduction to Banach space theory. Graduate Texts in Mathematics. Vol. 183. New York: Springer-Verlag. pp. xx+596. ISBN 0-387-98431-3. Wikipedia revision 1377874427, retrieved 2026-11-21

    Further reading

    edit edit source
    • Devlin, K. J. (1993). The Joy of Sets: Fundamentals of Contemporary Set Theory (Second ed.). New York, NY: Springer-Verlag. ISBN 3-540-94094-4.
    • Munkres, James R. (2000). "Set Theory and Logic". Topology (Second ed.). Upper Saddle River: Prentice Hall. ISBN 0-13-181629-2.
    • Rosen, Kenneth (2007). "Basic Structures: Sets, Functions, Sequences, and Sums". Discrete Mathematics and Its Applications (Sixth ed.). Boston: McGraw-Hill. ISBN 978-0-07-322972-0.
    edit edit source Wikimedia Commons has media related to Intersection (set theory). Set theoryOverview Axioms Operations
    • Concepts
    • Methods
    Set types Theories Set theorists Mathematical logicGeneral Theorems
    (list),
    paradoxes Logics Set theory Formal
    systems

    (list),
    language,
    syntax Proof theory Model theory Computability
    theory
    Related Mathematics portal

    Text derived from https://en.wikipedia.org/w/index.php?oldid=1377874427 under CC BY-SA 4.0; modifications have been made.

    Words in each sectionDefinitionDefinitionDefinition: 295 words295Nullary intersectionNullary intersectionNullary intersection: 286 words286Algebraic propertiesAlgebraic propertiesAlgebraic properties: 197 words197Arbitrary intersectionsArbitrary intersectionsArbitrary intersections: 182 words182See alsoSee alsoSee also: 116 words116Notation and terminologyNotation and terminologyNotation and terminology: 75 words75Further readingFurther readingFurther reading: 69 words69
    Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

    Provenance

    snapshot enwiki-001377874427 · captured 2026-10-01 · ledger · version history

    Cite this page as: encyclopegia.org, “Intersection (set theory)”, snapshot enwiki-001377874427. https://encyclopegia.org/a/intersection-set-theory