Partition of a set
Mathematical ways to group elements of a set / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Partition of a set?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
This article is about grouping elements of a set. For partitioning an integer, see Integer partition. For the partition calculus of sets, see Infinitary combinatorics.
In mathematics, a partition of a set is a grouping of its elements into non-empty subsets, in such a way that every element is included in exactly one subset.
Every equivalence relation on a set defines a partition of this set, and every partition defines an equivalence relation. A set equipped with an equivalence relation or a partition is sometimes called a setoid, typically in type theory and proof theory.