gen-explain-a-bijective-proof-as-you-would-to-a-capable-student-dcf2

Explain a bijective proof as you would to a capable student, in 3-4 sentences.

A bijective proof demonstrates that two sets have the same size by constructing a bijection—a perfect pairing where each element from one set corresponds to exactly one element in the other set, with none left over. This is particularly useful for proving that two different ways of counting give the same result: if you can show a bijection exists between the objects counted by formula A and those counted by formula B, then the formulas must be equal. For example, to prove that choosing k items from n objects equals choosing which (n-k) to leave behind, you'd establish a bijection between k-subsets and (n-k)-subsets by pairing each selection with its complement. The elegance is that you never actually count anything—you just show the two collections can be perfectly matched up.