Diplomats do not think of themselves as numerical analysts. Yet every round of shuttle diplomacy, every incremental concession extracted at a Geneva side table, every calibrated escalation designed to nudge an adversary toward settlement, follows a logic that a seventeenth century mathematician would recognise at once. The Newton–Raphson method — the iterative algorithm that finds a function’s root by successive linear approximation — is, stripped of its notation, a theory of convergence. And convergence is precisely what the current multipolar order promises but is structurally incapable of delivering.

The algorithm is elegant. Begin with an initial guess. Compute the function’s value and its slope at that point. Use the tangent line to project a better estimate of where the function crosses zero. Repeat. Under favourable conditions the method converges with ferocious speed, each iteration roughly doubling the number of correct digits. Under unfavourable conditions it oscillates, diverges, or locks into a cycle that never reaches a root at all. The claim of this essay is simple and uncomfortable: today’s geopolitics more closely resembles the second case than the first, and for reasons that are mathematical, not merely political.

Translate this into the language of statecraft. The “root” — f(x) = 0 — is equilibrium: a durable settlement in which no party has sufficient incentive to defect. The initial guess is the opening position, shaped by history, geography, and the accumulated weight of prior grievance. Each iteration is a negotiating round. The derivative, f′(x), captures the marginal sensitivity of the conflict to a unit of diplomatic effort. And it is in this derivative that the method’s deepest geopolitical lesson resides.

When f′(x) is large, a small movement in position produces a large change in the function’s value. Diplomacy has traction. The Camp David Accords of 1978 approximated this condition: the function was steep, the parties were close enough to a root, and thirteen days at a secluded Maryland retreat sufficed to reach it. But when f′(x) approaches zero — when the conflict surface flattens into a plateau of mutual intransigence — the algorithm demands division by a vanishingly........

© The Times of Israel (Blogs)