One-to-One Correspondence — Definition & Example
One-to-one correspondence is a way of matching two groups so that every item in the first group has exactly one partner in the second group, and nothing in either group is left over. If you can make such a matching, the two groups have the same number of items, even if you never count them.
Two sets and are in one-to-one correspondence when every element of is paired with exactly one element of and every element of is paired with exactly one element of . Two finite sets can be put in one-to-one correspondence exactly when they have the same number of elements; for infinite sets this pairing is how mathematicians define "same size" (cardinality). In higher math such a pairing is called a bijection. A "one-to-one function" alone only says that different inputs give different outputs; a correspondence also uses every element of .
Worked Example
Problem: A class has 7 students and a box of 9 pencils. Use matching to decide whether the students and pencils are in one-to-one correspondence.
Step 1: Pair each student with one pencil. Each pencil can go to only one student. After every student has a pencil, you have made 7 pairs.
Step 2: Look for leftovers. Every student is matched, but some pencils have no partner.
Step 3: A one-to-one correspondence allows no leftovers on either side. Because 2 pencils are unmatched, the matching fails. It also shows that the set of pencils is larger.
Answer: No. After pairing, 2 pencils are left over, so the students and pencils are not in one-to-one correspondence. There are more pencils than students.
Why It Matters
Counting is itself a one-to-one correspondence. You pair each object with one number word: 1, 2, 3, and so on. In advanced math, Georg Cantor used this idea to compare infinite sets. Pairing each natural number with the even number shows that both sets have the same size, called aleph null.
Common Mistakes
Mistake: When counting objects, touching one object twice or skipping one, so the final count is wrong.
Correction: Each object must get exactly one number word, and each number word must go to exactly one object. Move or mark each object as you count it so no object is counted twice or missed.
