Proof by exhaustion is a mathematical proof technique that establishes the truth of a proposition by dividing it into a finite number of cases and proving each one individually. This method is particularly useful when the problem space is limited and can be completely covered by a manageable number of cases.