Infinite Descent is the habit of proving impossibility by showing any solution creates a smaller solution forever. 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.
$$\text{No infinite strictly decreasing sequence of positive integers exists}$$
Infinite descent proves no solution exists by showing any solution would force a strictly smaller positive solution, which cannot continue forever.
Why It Works
1
Assume a solution in positive integers exists; among all solutions pick one minimizing some positive integer quantity (the well-ordering principle guarantees a smallest).
2
Manipulate the equation to construct a new solution whose corresponding quantity is strictly smaller but still a positive integer.
3
This contradicts minimality of the chosen solution.
4
Hence the original assumption fails and no solution exists — equivalently, positive integers cannot descend forever.
Worked Examples
Example 1
Prove that $\sqrt{2}$ is irrational.
1
Suppose $\sqrt 2 = a/b$ with positive integers $a, b$, so $a^2 = 2b^2$.
2
Then $a^2$ is even, so $a$ is even; write $a = 2a_1$, giving $4a_1^2 = 2b^2$, i.e. $b^2 = 2a_1^2$.
3
By the same reasoning $b$ is even, $b = 2b_1$, so $(a_1, b_1)$ is another solution with $a_1 = a/2 < a$.
4
We can repeat forever, producing an infinite strictly decreasing sequence of positive integers — impossible. So no such $a,b$ exist and $\sqrt 2$ is irrational.
Answer:
$\sqrt{2}$ is irrational.
Warm-up
Prove that there are no positive integers $x, y$ with $x^2 = 3y^2$ (equivalently, $\sqrt 3$ is irrational).
1
Suppose positive integers satisfy $x^2 = 3y^2$, and pick a solution with $x$ minimal.
2
Then $3 \mid x^2$, and since $3$ is prime, $3 \mid x$; write $x = 3x_1$, so $9x_1^2 = 3y^2$, i.e. $y^2 = 3x_1^2$.
3
By the same argument $3 \mid y$; write $y = 3y_1$, giving $9y_1^2 = 3x_1^2$... rearranged, $(x_1, y_1)$ satisfies $x_1^2 = 3y_1^2$ with $x_1 = x/3 < x$.
4
This is a strictly smaller positive solution, contradicting minimality. So none exists, and $\sqrt 3$ is irrational.
Answer:
No positive solution; $\sqrt 3$ is irrational.
Contest level
Prove that the only integer solution of $a^2 + b^2 = 3c^2$ is $a = b = c = 0$.
1
Suppose a nontrivial solution exists; take one minimizing $a^2 + b^2 + c^2 > 0$. Work modulo $3$: squares are $\equiv 0$ or $1 \pmod 3$.
2
Since $3c^2 \equiv 0 \pmod 3$, we need $a^2 + b^2 \equiv 0 \pmod 3$. The only way two squares (each $0$ or $1$) sum to $0 \pmod 3$ is $0 + 0$, so $3 \mid a$ and $3 \mid b$.
3
Write $a = 3a_1$, $b = 3b_1$: then $9a_1^2 + 9b_1^2 = 3c^2$, so $3(a_1^2 + b_1^2) = c^2$, forcing $3 \mid c$; write $c = 3c_1$ to get $a_1^2 + b_1^2 = 3c_1^2$.
4
So $(a_1, b_1, c_1) = (a/3, b/3, c/3)$ is a smaller nontrivial solution — contradiction. Hence only the trivial solution exists.
Answer:
$a = b = c = 0$ is the only solution.
Olympiad / Challenge
Prove that $x^4 + y^4 = z^2$ has no solution in positive integers (Fermat's infinite descent).
1
Suppose a positive solution exists; choose one with $z$ minimal. We may assume $\gcd(x, y) = 1$ (a common factor could be divided out, shrinking $z$), so $(x^2, y^2, z)$ is a primitive Pythagorean triple.
Now $y^2 = 2mn = 2(p^2+q^2)(2pq) = 4pq(p^2+q^2)$, so $(y/2)^2 = pq(p^2+q^2)$. Since $p, q, p^2+q^2$ are pairwise coprime and their product is a square, each is a perfect square: $p = a^2$, $q = b^2$, $p^2 + q^2 = c^2$.
4
Then $a^4 + b^4 = p^2 + q^2 = c^2$, a new positive solution with $c \le c^2 = p^2 + q^2 = m \le m^2 < m^2 + n^2 = z$, so $c < z$ — contradicting minimality. Hence no positive solution exists (and in particular $x^4 + y^4 = z^4$ is impossible).
Answer:
No positive-integer solution exists.
Going Deeper
Generalization: infinite descent is the contrapositive of the well-ordering principle (every nonempty set of positive integers has a least element) and of strong induction. Any proof that 'a counterexample yields a smaller counterexample' is a descent; Vieta jumping is the descent technique specialized to equations quadratic in a variable.
Where it appears: irrationality of $\sqrt d$ for non-square $d$, Fermat's $n = 4$ case and many Diophantine non-existence results, proving uniqueness/minimality, and as the backbone of Vieta jumping on competition problems.
Pitfall: the descent must stay within a well-ordered set (positive integers) and must reach — or be blocked by — a base case. Two classic errors: (1) the 'smaller' object slips to $0$ or negative and the descent silently stops without a contradiction; and (2) descending over rationals or reals, where infinite strictly decreasing sequences DO exist, so the argument is invalid. Always confirm the quantity you descend on is a positive integer and strictly decreases.
Spot the Signal
Look for problems where the key step is proving impossibility by showing any solution creates a smaller solution forever.
You can describe the hard part as proving impossibility by showing any solution creates a smaller solution forever, 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 integer constraint that calls for infinite descent, then rewrite the givens around it.
Name the relation that makes Infinite Descent 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 Infinite Descent just because the surface looks familiar; verify the required condition first.
Applying Infinite Descent 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 infinite descent reveal the integer structure; then compute only what remains.
Try it on:
Practice a contest problem where the key step is proving impossibility by showing any solution creates a smaller solution forever.