Partition.md (725B)
1 2 AM W14 Reading 3 4 **Definition:** A partition of a set A is a set of non-empty subsets of A, such that the union of all the subsets equals A, and the intersection of any two different subsets is the null set. 5 6 Basically, a partition is the subsets of a set where all subsets together make the original set and all subsets are unique in their elements where any intersection between them is the null set. Keep in mind the partition is the combination of all of them not simply a singular one of the subsets which is where this diverges from the computational term "partition". 7 8 This relates to [EquivalenceClass](EquivalenceClass.md) as certain partitions are equivalence classes when considering equivalence relation sets. 9