The Extremal Principle
When a puzzle asks you to prove something exists, look at the biggest, smallest, first, or last object satisfying some property — its extremeness usually does the proving for you.
Prerequisites: How to Attack a Brainteaser
Some interview puzzles ask you to prove that something exists — a strategy, a player, a subset — without telling you which one. Trying to construct it directly can stall, because you have no way to point at the right object. The extremal principle sidesteps this: instead of hunting for the object, pick out whichever candidate is the biggest, smallest, first, or otherwise most extreme by some measure, and show that this one must have the property you need.
Worked example: the tournament king
In a round-robin tournament, every pair of players plays exactly one game and there are no ties. Prove that there is always a player — call them the "king" — who either beat every other player directly, or beat every other player who wasn't beaten directly, through one player they beat.
Pick the extreme. Let be a player with the most wins in the whole tournament (if several players tie for most wins, pick any one of them).
Suppose isn't a king. Then some player is not beaten by directly, and is not beaten by anyone beat either. Since and played each other and didn't beat , beat . And since nobody beat managed to beat , beat every single player that beat too.
The contradiction. So beat , and everyone beat. That means has strictly more wins than — at least one more, from beating itself. But was chosen to have the most wins in the entire tournament. Contradiction. So no such exists, and the player with the most wins is always a king.
To prove something exists, try picking the extreme case — the maximum, minimum, first, or last object with some property — and show it must have the property you want. If it didn't, you could usually build something more extreme still, which contradicts the choice.
The same move proves a finite set of positive integers has a smallest element (trivial, but it's the base case of every induction), and that any non-empty set of positive reals bounded above has candidates worth checking only at its supremum. Whenever a puzzle says "prove there exists..." and direct construction feels blocked, ask: what happens at the extreme case, and can I derive a contradiction if it lacks the property?
"Most wins," "shortest path," "largest gap," "first time a rule is broken" — these are all extremal quantities. If a puzzle's structure lets you rank candidates by some number, rank them and inspect the top or bottom of the list first.
Quant research uses the same reflex when hunting for what breaks a model: rather than testing every parameter combination, look at the parameter that maximises some exposure or minimises some diversification — that boundary case is usually where the assumption fails first.
Related concepts
Practice in interviews
Further reading
- Engel, Problem-Solving Strategies (ch. 4)