Bifalgorithm post · Brisk · Chapter 1

How do partitions simplify counting?

How do partitions simplify counting? (Brisk · Chapter 1) — "Partitions come up quite a bit, and when they do, we can make some important simplifications. Take…

Ideas in this flowchart

  • Partitions simplify reasoning about sets
  • A partition divides a set into subsets that are mutually exclusive and collectively exhaustive
  • Freshmen, sophomores, juniors, and seniors form a partition of S
  • In-state and out-of-state students form a partition of S
  • On-campus and off-campus students form a partition of S
  • Computer science majors and English majors do not form a partition of S
  • Some students are in neither major, so the groups are not collectively exhaustive
  • Some students may double-major, so the groups are not mutually exclusive
  • Male and female classifications are not a partition of the human race
  • Non-binary persons may identify with neither classification
  • A partition allows the cardinality of a set to be found by adding subset sizes
  • |S| equals the number of on-campus students plus the number of off-campus students
  • Adding the numbers of freshmen, sophomores, juniors, and seniors also gives |S|
  • Adding computer science and English majors usually differs from |S| because some students are double-counted and others are omitted
  • Partitions provide a beautiful simplicity in counting and reasoning
Feed/

How do partitions simplify counting?

Channel

Brisk

1 page

"Partitions come up quite a bit, and when they do, we can make some important simplifications. Take S, the set of all students at UMW. We can partition it in several different ways. If we divide S into the set of freshmen, sophomores, juniors, and seniors, we have a partition: every student is one of those grade levels, and no student is more than one. If we group them into in-state and out-of-state students, we again have a partition. And if we divide them into those who live on-campus and those who live off, we again have a partition. Note that dividing S into computer science majors and English majors does not give us a partition. For one thing, not everyone is majoring in one of those two subjects. For another, some students might be double-majoring in both. Hence this group of subsets is neither mutually exclusive nor collectively exhaustive. It’s interesting to think about gender and partitions: when I grew up, I was taught that males and females were a partition of the human race. But now I’ve come to realize that there are non-binary persons who do not identify with either of those genders, and so it’s not a partition after all. Is the number of students |S| equal to the number of off-campus students plus the number of on-campus students? Obviously yes. But why? The answer: because the off-campus and on-campus students form a partition. If we added up the number of freshmen, sophomores, juniors, and seniors, we would also get |S|. But adding up the number of computer science majors and English majors would almost certainly not be equal to |S|, because some students would be double-counted and others counted not at all. This is an example of the kind of beautiful simplicity that partitions provide."

Flowchart preview
Series cover
👍
0
0 comments0 shares

Sign in to view and post comments.