OurBigBook About$ Donate
 Sign in Sign up

Partition of a set

 Ancestors will show here when the tree index is updated
2026-10-14  NaN By others on same topic  0 Discussions Create my own version
A partition of a set X is a family of pairwise disjoint nonempty subsets whose union is X. Every equivalence relation defines a partition into equivalence classes, and conversely belonging to the same cell of a partition defines an equivalence relation. The nonempty colour classes of a finite colouring form a finite partition.

 Incoming links (15)

  • Communicating class
  • Conjugacy class
  • Connected component
  • Connected space
  • Coset
  • Equivalence class
  • Equivalence relation
  • Fiber of a function
  • Infinite pigeonhole principle
  • Kolmogorov axioms
  • Lagrange's theorem
  • Orbit (group theory)
  • Path component
  • Set partition
  • Totient divisor-sum identity

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (NaN)

Partition of a set by Wikipedia Bot  1
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook