Extremal Principle is the habit of choosing the largest, smallest, earliest, or latest object to force useful structure. In contest math, that habit turns a crowded setup into a relation the student can test, bound, count, or compute. MathGrit teaches it as a recognizable signal, a deliberate move, and a final translation back to the original question.
Every nonempty finite set (or set of nonnegative integers) $S$ attains a maximum and a minimum: there exist $x_{\max}, x_{\min} \in S$ with $x_{\min} \le x \le x_{\max}$ for all $x \in S$. Pick one and exploit its extremity.
Choose the most extreme object in the configuration — the largest, smallest, closest, or first — because being extreme rules out one direction of escape and forces a contradiction or the desired structure.
Why It Works
1
A finite set of numbers (or a set of nonnegative integers) always attains a maximum and a minimum.
2
Select the extreme element; whatever construction the problem allows can no longer push 'past' it in that direction.
3
If the problem's rule would produce something even more extreme, you contradict the choice — proving no such configuration exists.
4
If instead the extreme element must have a special neighbor or property, you have located useful structure for free.
Worked Examples
Example 1
Five distinct positive integers have the property that the sum of all five is $25$. Prove that the largest of them is at least $7$.
1
Let the integers in increasing order be $a_1 < a_2 < a_3 < a_4 < a_5$; we study the extreme element $a_5$, the largest.
2
Suppose for contradiction $a_5 \le 6$. Then five distinct positive integers all at most $6$ are largest when they are $\{2,3,4,5,6\}$ (we must drop one of $1,\dots,6$ to leave five values).
3
The maximum possible sum of five distinct integers each $\le 6$ is $2+3+4+5+6 = 20 < 25$.
4
That contradicts the sum being $25$, so the assumption fails and $a_5 \ge 7$. (E.g. $1+2+3+4+15$ or $1+2+3+7+12$ realize sum $25$.)
Answer:
The largest integer must be at least $7$.
Contest level
There are $n$ red points and $n$ blue points in the plane, no three collinear. Prove they can be joined by $n$ segments, each from a red point to a blue point, so that no two segments cross.
1
There are only finitely many ways to pair the reds with the blues, so among all such pairings choose the extreme one: the matching whose total segment length is smallest.
2
Suppose in this minimal matching two segments $R_1B_1$ and $R_2B_2$ crossed at a point $X$.
3
Re-pair them as $R_1B_2$ and $R_2B_1$. By the triangle inequality $R_1B_2 + R_2B_1 < (R_1X + XB_2) + (R_2X + XB_1) = R_1B_1 + R_2B_2$, strictly shortening the total.
4
That contradicts minimality, so no two segments cross — the shortest matching is automatically non-crossing.
Answer:
The minimum-total-length red–blue matching has no crossings, proving such a matching exists.
Olympiad / Challenge
Prove that every positive integer can be written as a sum of distinct powers of $2$ (that is, every positive integer has a binary representation).
1
Suppose not. By the well-ordering principle there is a smallest positive integer $m$ that is not a sum of distinct powers of $2$ — the extreme (least) counterexample.
2
Let $2^k$ be the largest power of $2$ with $2^k \le m$. Then $m - 2^k \ge 0$, and $m - 2^k < 2^k$ since otherwise $2^{k+1} \le m$, contradicting maximality of $2^k$.
3
If $m - 2^k = 0$ then $m = 2^k$ is already such a sum — contradiction. Otherwise $0 < m - 2^k < m$, so $m - 2^k$ (being smaller than the least counterexample) is a sum of distinct powers of $2$, each less than $2^k$.
4
Append $2^k$: it is distinct from all those smaller powers, so $m = 2^k + (m - 2^k)$ is a sum of distinct powers of $2$ after all — contradicting the choice of $m$. Hence no counterexample exists.
Answer:
Every positive integer is a sum of distinct powers of $2$ (its binary expansion).
Going Deeper
The extremal principle and infinite descent are two sides of one coin: assuming a smallest counterexample and then producing a smaller one (well-ordering) is descent in disguise, used to prove irrationality of $\sqrt{2}$ and to power Vieta jumping on IMO problems.
On olympiads it cracks existence and impossibility problems: take the longest path, the closest pair, the smallest counterexample, or the heaviest configuration, and the extremity forbids one escape route.
Pitfall: an extreme element only exists when the set is finite or the values are well-ordered (e.g. nonnegative integers). Over the rationals or an open real interval there may be no minimum, so the argument silently fails — always confirm the extremum is actually attained.
Spot the Signal
Look for problems where the key step is choosing the largest, smallest, earliest, or latest object to force useful structure.
You can describe the hard part as choosing the largest, smallest, earliest, or latest object to force useful structure, but a direct attack starts producing clutter.
The problem rewards preserving structure instead of expanding, listing, or guessing too early.
Learn the Move
Start by identify the problem-solving bottleneck that calls for extremal principle, then rewrite the givens around it.
Name the relation that makes Extremal Principle legal before doing computation.
Use the new relation to replace the messiest part of the problem with a cleaner one.
Translate the result back to the quantity the problem actually asks for.
Avoid These Traps
Do not use Extremal Principle just because the surface looks familiar; verify the required condition first.
Applying Extremal Principle because it sounds relevant, without checking the trigger first.
Stopping after spotting the technique instead of finishing the calculation or proof.
MathGrit Coach Note
Let extremal principle reveal the strategic structure; then compute only what remains.
Try it on:
Practice a contest problem where the key step is choosing the largest, smallest, earliest, or latest object to force useful structure.