Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Concept
Intersection (set theory)
Summary
In set theory, the intersection of two sets and denoted by is the set containing all elements of that also belong to or equivalently, all elements of that also belong to
Intersection is written using the symbol "" between the terms; that is, in infix notation. For example:
The intersection of more than two sets (generalized intersection) can be written as:
which is similar to capital-sigma notation.
For an explanation of the symbols used in this article, refer to the table of mathematical symbols.
The intersection of two sets and denoted by , is the set of all objects that are members of both the sets and
In symbols:
That is, is an element of the intersection if and only if is both an element of and an element of
For example:
The intersection of the sets {1, 2, 3} and {2, 3, 4} is {2, 3}.
The number 9 is 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.
We say that if there exists some that is an element of both and in which case we also say that . Equivalently, intersects if their intersection is an , meaning that there exists some such that
We say that if does not intersect In plain language, they have no elements in common. and are disjoint if their intersection is empty, denoted
For example, the sets and are disjoint, while the set of even numbers intersects the set of multiples of 3 at the multiples of 6.
List of set identities and relations and Algebra of sets
Binary intersection is an associative operation; that is, for any sets and one has
Thus the parentheses may be omitted without ambiguity: either of the above can be written as . Intersection is also commutative. That is, for any and one has
The intersection of any set with the empty set results in the empty set; that is, that for any set ,
Also, the intersection operation is idempotent; that is, any set satisfies that . All these properties follow from analogous facts about logical conjunction.
Intersection distributes over union and union distributes over intersection.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related courses (14)
CS-101: Advanced information, computation, communication I
Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a
MATH-337: Number theory I.c - Combinatorial number theory
This is an introductory course to combinatorial number theory. The main objective of this course is to learn how to use combinatorial, topological, and analytic methods to solve problems in number the
PHYS-101(en): General physics : mechanics (English)
Students will learn the principles of mechanics to enable a better understanding of physical phenomena, such as the kinematics and dyamics of point masses and solid bodies. Students will acquire the c
Related publications (51)