Facebook
Britain's News Portal
Around The Clock
BREAKING
Loading latest headlines…

The 150-year-old maths trick that still shapes modern science

A mathematical technique known as non-constructive proof lets researchers solve problems without providing explicit answers. First pioneered by David Hilbert in 1888, it sparked a century of debate but now underpins fields from cryptography to computer science.

  • Non-constructive proofs prove existence without giving a concrete example, relying on logic such as the pigeonhole principle.
  • David Hilbert's 1888 proof on algebraic invariants outraged traditionalists like Paul Gordan, who called it 'theology'.
  • The technique is now standard in mathematics and has practical applications in UK research, from algorithm design to data analysis.

Imagine a mathematician who sees a small fire in her office, spots a fire extinguisher, and declares the problem solved without actually using it. That joke, long told in academic circles, captures the essence of a revolutionary mathematical method: the non-constructive proof. Rather than building an explicit solution, this approach proves that a solution must exist — and leaves the hard work of finding it to others.

A classic illustration is the birthday problem: in a room of 367 people, at least two must share a birthday. There are only 366 possible birthdays (accounting for leap years), so the conclusion is certain even though we have no idea which two people they are. Mathematicians call this the pigeonhole principle, and it is a cornerstone of non-constructive reasoning.

The technique became a flashpoint in the late 19th century. German mathematician David Hilbert used it in 1888 to prove that a finite set of algebraic invariants exists for a broad class of objects — without actually producing that set. His predecessor Paul Gordan, who had spent his career laboriously constructing such sets for specific cases, was appalled. 'That is not mathematics, that is theology,' Gordan declared. Yet he later conceded that 'theology does have its advantages.'

Hilbert's work sparked decades of philosophical conflict, notably with Dutch mathematician L.E.J. Brouwer, who championed constructivism — the view that proofs must provide explicit examples. Hilbert's school of formalism eventually won out, and non-constructive proofs are now taught routinely in UK universities. The approach underpins modern fields such as cryptography, where proving that a secure code exists is often more important than building it immediately.

For UK society, the legacy is quietly profound. Algorithms used in everything from search engines to medical diagnostics rely on non-constructive reasoning to guarantee that a solution can be found, even when the exact steps are too complex to spell out. The findings are peer-reviewed and form part of standard mathematical literature, though the original 1888 proof is now considered a historical milestone rather than active research.

Why this matters: This mathematical trick, now over a century old, shapes the logic behind the algorithms that run UK infrastructure, from banking systems to weather forecasting. Understanding it reveals why some problems can be solved without ever showing the answer.

What this means for you: What this means for you: the next time your online banking works or your GPS finds a route, it may be thanks to a proof that says the solution exists — without ever spelling it out.

Related Articles

Get the news that matters.

Join thousands of readers getting the best of British news straight to their inbox.