{
  "id": "set-intersection",
  "title": "Set Intersection",
  "lang": "en",
  "source_lang": "en",
  "summary": "Set intersection is the operation that forms a set containing exactly the elements common to every set in a specified collection.",
  "category": "mathematics",
  "subcategory": "discrete-logic",
  "type": "concept",
  "aliases": [
    "Intersection of sets",
    "Intersection"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/set-intersection/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/set-intersection/",
      "json": "https://aiwiki.page/zh/set-intersection.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "In set theory, the intersection of two sets \\(A\\) and \\(B\\) is the set of elements that belong to both, denoted \\(A\\cap B\\). More generally, the intersection of a nonempty family of sets consists of the elements belonging to every member of that family. Intersection is a fundamental operation used throughout mathematics, including logic, probability, geometry, and algebra."
    },
    {
      "heading": "Definition and notation",
      "text": "For sets \\(A\\) and \\(B\\),\n\n\\[A\\cap B=\\{x:x\\in A\\text{ and }x\\in B\\}.\\]\n\nEquivalently, membership satisfies\n\n\\[x\\in A\\cap B \\quad\\Longleftrightarrow\\quad (x\\in A)\\land(x\\in B),\\]\n\nwhere \\(\\land\\) denotes logical conjunction.\n\nFor example, if\n\n\\[A=\\{1,2,3,4\\}, \\qquad B=\\{3,4,5\\},\\]\n\nthen\n\n\\[A\\cap B=\\{3,4\\}.\\]\n\nThe intersection is a subset of each input:\n\n\\[A\\cap B\\subseteq A, \\qquad A\\cap B\\subseteq B.\\]\n\nIf the sets have no common element, their intersection is the empty set, written \\(\\varnothing\\); such sets are called disjoint.\n\nFor intervals of real numbers,\n\n\\[[0,3]\\cap(2,5]=(2,3].\\]\n\nThe endpoint \\(2\\) is excluded because it does not belong to the second interval, while \\(3\\) belongs to both.\n\nIntersection differs from union, which contains elements belonging to at least one of the sets. It also differs from the Cartesian product, which consists of ordered pairs rather than common elements."
    },
    {
      "heading": "Intersections of families",
      "text": "For an indexed family \\((A_i)_{i\\in I}\\) with nonempty index set \\(I\\), the intersection is written\n\n\\[\\bigcap_{i\\in I}A_i = \\{x:\\text{for every }i\\in I,\\ x\\in A_i\\}.\\]\n\nFor finitely many sets, this can be written\n\n\\[A_1\\cap A_2\\cap\\cdots\\cap A_n \\quad\\text{or}\\quad \\bigcap_{i=1}^{n}A_i.\\]\n\nFor example,\n\n\\[\\bigcap_{n=1}^{\\infty} \\left[-\\frac1n,\\frac1n\\right] =\\{0\\}.\\]\n\nEvery interval contains \\(0\\), while every nonzero real number is excluded by a sufficiently small interval.\n\nBy contrast,\n\n\\[\\bigcap_{n=1}^{\\infty} \\left(0,\\frac1n\\right) =\\varnothing.\\]\n\nAlthough every individual interval is nonempty, no positive real number belongs to them all. Thus, even a decreasing sequence of nonempty sets can have an empty intersection.\n\nEmpty intersection\n\nIf all sets under consideration are subsets of a fixed ambient set \\(U\\), the intersection indexed by the empty set is defined as\n\n\\[\\bigcap_{i\\in\\varnothing}A_i=U.\\]\n\nIndeed, every \\(x\\in U\\) satisfies the condition “\\(x\\in A_i\\) for every \\(i\\in\\varnothing\\),” because there are no indices imposing any restriction. This is an instance of vacuous truth.\n\nThe ambient-set qualification matters. In ordinary Zermelo–Fraenkel set theory, there is no set of all sets, so an unrestricted empty intersection cannot simply be taken to be a universal set. Without a specified ambient set, empty-family intersection requires a separate convention or is left undefined."
    },
    {
      "heading": "Algebraic laws",
      "text": "Intersection obeys several identities for arbitrary sets \\(A,B,C\\).\n\nLaw | Identity\nCommutativity | \\(A\\cap B=B\\cap A\\)\nAssociativity | \\((A\\cap B)\\cap C=A\\cap(B\\cap C)\\)\n[[idempotence | Idempotence]]\nEmpty-set law | \\(A\\cap\\varnothing=\\varnothing\\)\nAmbient-set identity, for \\(A\\subseteq U\\) | \\(A\\cap U=A\\)\nAbsorption | \\(A\\cap(A\\cup B)=A\\)\n\nAssociativity makes a finite expression such as \\(A\\cap B\\cap C\\) unambiguous without parentheses.\n\nIntersection and union distribute over one another:\n\n\\[A\\cap(B\\cup C) =(A\\cap B)\\cup(A\\cap C),\\]\n\n\\[A\\cup(B\\cap C) =(A\\cup B)\\cap(A\\cup C).\\]\n\nIntersection is also monotone: if \\(A\\subseteq B\\), then\n\n\\[A\\cap C\\subseteq B\\cap C.\\]\n\nAn important characterization of containment is\n\n\\[A\\subseteq B \\quad\\Longleftrightarrow\\quad A\\cap B=A.\\]\n\nThus intersection can express subset relationships as equalities.\n\nFor sets contained in an ambient set \\(U\\), let \\(A^c=U\\setminus A\\) denote the complement of \\(A\\). De Morgan’s laws give\n\n\\[(A\\cap B)^c=A^c\\cup B^c,\\]\n\nand, more generally,\n\n\\[\\left(\\bigcap_{i\\in I}A_i\\right)^c = \\bigcup_{i\\in I}A_i^c.\\]\n\nThese identities follow by examining membership. For example, membership in \\(A\\cap(B\\cup C)\\) means belonging to \\(A\\) and to at least one of \\(B,C\\), exactly the condition defining \\((A\\cap B)\\cup(A\\cap C)\\). This connects set identities with equivalences in propositional logic."
    },
    {
      "heading": "Order-theoretic interpretation",
      "text": "The power set \\(\\mathcal P(U)\\), consisting of all subsets of \\(U\\), is ordered by inclusion. In this partial order, \\(A\\cap B\\) is the greatest lower bound, or meet, of \\(A\\) and \\(B\\):\n\n- \\(A\\cap B\\) is contained in both \\(A\\) and \\(B\\).\n- Every set \\(C\\) contained in both \\(A\\) and \\(B\\) is contained in \\(A\\cap B\\).\n\nArbitrary intersections have the same greatest-lower-bound property for arbitrary families of subsets of \\(U\\). Together with union and complementation, intersection makes \\(\\mathcal P(U)\\) a Boolean algebra. The greatest lower bound of the empty family is \\(U\\), explaining the ambient-set convention for empty intersections."
    },
    {
      "heading": "Size of an intersection",
      "text": "For finite sets, cardinality satisfies\n\n\\[|A\\cap B|\\leq\\min(|A|,|B|).\\]\n\nThe exact relationship with union is\n\n\\[|A\\cup B|=|A|+|B|-|A\\cap B|.\\]\n\nThe subtraction corrects for common elements counted once in \\(|A|\\) and once in \\(|B|\\).\n\nIf \\(A,B\\subseteq U\\) and \\(U\\) is finite, then\n\n\\[\\max\\bigl(0,\\ |A|+|B|-|U|\\bigr) \\leq |A\\cap B| \\leq \\min(|A|,|B|).\\]\n\nIn particular, if \\(|A|+|B|>|U|\\), the sets must overlap.\n\nFor three or more sets, pairwise overlap does not guarantee a common element. For example,\n\n\\[A=\\{1,2\\},\\qquad B=\\{2,3\\},\\qquad C=\\{1,3\\}\\]\n\nhave nonempty intersections in every pair, but\n\n\\[A\\cap B\\cap C=\\varnothing.\\]\n\nThe distinction between pairwise intersection and intersection of the entire family is important in geometry and combinatorics."
    },
    {
      "heading": "Applications",
      "text": "Probability\n\nIn probability theory, an event is a measurable subset of a sample space. The intersection \\(A\\cap B\\) represents the event that both \\(A\\) and \\(B\\) occur.\n\nIn general,\n\n\\[P(A\\cap B)=P(A\\mid B)P(B)\\]\n\nwhen \\(P(B)>0\\), where \\(P(A\\mid B)\\) is conditional probability.\n\nIf \\(A\\) and \\(B\\) satisfy independence, then\n\n\\[P(A\\cap B)=P(A)P(B).\\]\n\nThis product formula does not hold for arbitrary events. Disjoint events of positive probability, for example, are not independent: their intersection has probability zero, whereas the product of their probabilities is positive.\n\nTopology and geometry\n\nIn topology, arbitrary intersections of closed sets are closed, while finite intersections of open sets are open. Infinite intersections of open sets need not be open; for instance,\n\n\\[\\bigcap_{n=1}^{\\infty} \\left(-\\frac1n,\\frac1n\\right)=\\{0\\},\\]\n\nwhich is not open in the usual topology of the real line.\n\nIntersections also preserve many geometric and algebraic properties. The intersection of any family of convex sets in a fixed vector space is convex. The intersection of any nonempty family of linear subspaces of a common vector space is again a linear subspace.\n\nThese closure properties support constructions such as the smallest convex set or smallest subspace containing a given set: each can be defined as the intersection of all suitable containing sets.\n\nConstraints and computation\n\nIn mathematical optimization, each constraint defines a set of admissible points. The feasible set is their intersection. An empty intersection means that no point satisfies every constraint simultaneously.\n\nIn computing, intersection finds common members of collections, such as records satisfying several filters or documents matching multiple search terms. The implementation depends on representation. Sorted lists can be intersected by advancing through both lists in order; hash-based sets support expected constant-time membership tests under standard hashing assumptions; bit-vector representations permit intersection through bitwise AND.\n\nMathematical sets ignore duplicates. Operations on lists or multisets may instead preserve multiplicities according to separate rules, so those operations must be distinguished from ordinary set intersection."
    }
  ],
  "links": [
    "set-theory",
    "set-mathematics",
    "subset",
    "empty-set",
    "real-number",
    "set-union",
    "cartesian-product",
    "zermelo-fraenkel-set-theory",
    "idempotence",
    "set-complement",
    "de-morgans-laws",
    "propositional-logic",
    "power-set",
    "partial-order",
    "boolean-algebra",
    "cardinality",
    "probability",
    "event-probability",
    "conditional-probability",
    "statistical-independence",
    "topology",
    "closed-set",
    "open-set",
    "convex-set",
    "linear-subspace",
    "mathematical-optimization",
    "feasible-set"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}