Intersection Set Operation

An Intersection Set Operation is a set operation that tests for members that are in a intersection relation with each other.

• AKA: Intersection, Intersection Operation, ∩, Set Intersection, Set Product, Set Minimum.
• Context:
  • It can be used by a Set Distance Function.
• Example(s):
  • ∩({1,2}, {2,3}) ⇒ Empty Set.
  • ∩({1},{2}) ⇒ {1,2}.
  • …
• Counter-Example(s):
  • ∪({1},{2}) ⇒ {1,2}, the Union Set Operation.
  • ∪({1,2}, {2,3}) ⇒ {1,2,3},, the Union Set Operation.
  • ∪({1,11,3}, {10,2}, {7}) ⇒ {10,2,1,3,11,7},, the Union Set Operation.
  • CSO({1}) ⇒ {2,3,4,5,..}, the Complement Set Operation.
• See: Operation, Proper Subset Relation.

---

---

References

2009

• (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Intersection_(set_theory)
  • In 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.

---