Julia Robinson(1919 — 1985)

Julia Robinson

États-Unis

6 min read

SciencesMathématicien(ne)20th CenturyTwentieth-century United States, a period of rapid growth in fundamental mathematics and the gradual opening of scientific research to women.

Julia Robinson (1919-1985) was an American mathematician famous for her work in number theory and mathematical logic. She made a decisive contribution to solving Hilbert's tenth problem.

Frequently asked questions

Julia Robinson (1919-1985) was an American mathematician whose work revolutionized mathematical logic and number theory. The key point to remember is that she laid the groundwork for solving Hilbert's tenth problem, a 70-year-old question asking whether a universal algorithm exists to decide whether a Diophantine equation has integer solutions. Her contribution, known as the “Julia Robinson hypothesis,” enabled the Soviet mathematician Yuri Matiyasevich to complete the proof in 1970: the answer is no, no general algorithm exists. This result profoundly reshaped our understanding of the limits of computation.

Key Facts

  • Born December 8, 1919, in St. Louis (Missouri) and died July 30, 1985, in Oakland (California).
  • Defended her doctoral thesis in 1948 at the University of California, Berkeley, under the supervision of Alfred Tarski.
  • Made a major contribution to solving Hilbert's tenth problem, completed in 1970 by Yuri Matiyasevich thanks to her work (the Julia Robinson hypothesis).
  • In 1975, became the first woman mathematician elected to the United States National Academy of Sciences.
  • In 1983, was the first woman elected president of the American Mathematical Society.

Works & Achievements

Thesis: “Definability and Decision Problems in Arithmetic” (1948)

Under the supervision of Alfred Tarski, she proves that the integers are definable in the field of rationals, establishing the undecidability of their arithmetic theory.

“An Iterative Method of Solving a Game” (1951)

An important game-theory result stemming from her work at RAND, demonstrating the convergence of an iterative procedure for zero-sum games.

“Existential Definability in Arithmetic” and the Julia Robinson hypothesis (1952)

She formulates the “J.R. hypothesis,” the key condition that would become the pivot for solving Hilbert's tenth problem.

“The Decision Problem for Exponential Diophantine Equations” (with Davis and Putnam) (1961)

A collaborative work that reduces Hilbert's tenth problem to a problem of exponential growth, a decisive step toward the final solution.

Solution to Hilbert's tenth problem (MRDP theorem) (1970)

Completed by Matiyasevich building on Robinson's work: there is no general algorithm to decide whether a Diophantine equation has integer solutions.

President of the American Mathematical Society (1983-1984)

The first woman to lead the foremost mathematical society in the United States, after having been the first woman mathematician elected to the National Academy of Sciences.

Anecdotes

As a child, Julia Robinson caught scarlet fever and then acute rheumatic fever, which kept her bedridden for nearly two years. Isolated and taught at home, she was left with a weak heart from this illness that would affect her entire life. Yet it was during this long convalescence that she developed her solitary passion for numbers.

One of her earliest memories goes back to her childhood in the Arizona desert, near Phoenix, where she had been sent for her health: she loved to line up and count little pebbles in the shade of a cactus. This early fascination with counting already foretold the number theorist she would become.

Married to the mathematician Raphael Robinson, a professor at Berkeley, Julia was barred from a regular position in the same department because of the university's anti-nepotism rules. For years she carried out leading research without any real position or salary; she would not become a full professor until 1976, after her election to the National Academy of Sciences.

She devoted more than twenty years to Hilbert's tenth problem. In 1970, a young 22-year-old Soviet mathematician, Yuri Matiyasevich, completed the proof by building on Robinson's work: the answer was negative—no universal algorithm exists. Despite the Cold War, the two mathematicians became friends and warm correspondents.

Julia Robinson refused to be celebrated as “the first woman” to hold this or that distinction. She said she wanted simply to be remembered, like any mathematician, for the theorems she had proved. It is said that every year, on her birthday, she wished to see Hilbert's tenth problem solved: Matiyasevich's proof was, she said, her finest gift.

Primary Sources

Constance Reid, Julia: A Life in Mathematics (collected autobiography) (1996 (words of Julia Robinson))
“What I really am is a mathematician. Rather than being remembered as the first woman this or that, I would prefer to be remembered, as a mathematician should, simply for the theorems I have proved and the problems I have solved.”
Julia Robinson, “Definability and decision problems in arithmetic”, Journal of Symbolic Logic (doctoral thesis, supervised by Alfred Tarski) (1949)
In it, Robinson proves that the notion of integer is definable in the field of rational numbers, thereby establishing the undecidability of the arithmetic theory of the rationals.
Julia Robinson, “Existential definability in arithmetic”, Transactions of the American Mathematical Society (1952)
An article in which Robinson formulates what would come to be called “the Julia Robinson hypothesis” (the J.R. hypothesis), a cornerstone of the eventual solution to Hilbert's tenth problem.
Martin Davis, Hilary Putnam and Julia Robinson, “The decision problem for exponential diophantine equations”, Annals of Mathematics (1961)
A joint work reducing Hilbert's tenth problem to the existence of a diophantine set with exponential growth, a decisive step toward the final solution.
Julia Robinson, “An iterative method of solving a game”, Annals of Mathematics (1951)
An article arising from her work at RAND, proving the convergence of the iterative procedure (“fictitious play”) for two-player zero-sum games.

Key Places

St. Louis (Missouri)

Birthplace of Julia Robinson, born on December 8, 1919.

Phoenix (Arizona)

In the desert near Phoenix, the young Julia was sent for her health, and there she developed her love of numbers by counting pebbles.

San Diego (California)

She grew up here and began her higher education at San Diego State College.

University of California, Berkeley

The heart of her intellectual life: here she earned her doctorate under Alfred Tarski and carried out most of her mathematical career.

RAND Corporation, Santa Monica (California)

Research center where she worked on game theory in the late 1940s and early 1950s.

Oakland (California)

City where Julia Robinson died of leukemia on July 30, 1985.

See also