Jules Richard (12 August 1862 – 14 October 1956) was a French mathematician who worked mainly in geometry but his name is most commonly associated with Richard's paradox.
Richard was born in Blet, in the Cher département.
He taught at the lycées of Tours, Dijon and Châteauroux. He obtained his doctorate, at age of 39, from the Faculté des Sciences in Paris. His thesis of 126 pages concerns Fresnel's wave-surface. Richard worked mainly on the foundations of mathematics and geometry, relating to works by Hilbert, von Staudt and Méray.
In a more philosophical treatise about the nature of axioms of geometry Richard discusses and rejects the following basic principles:
The latter approach was essentially that proposed by Kant. Richard arrived at the result that the notion of identity of two objects and the invariability of an object are too vague and need to be specified more precisely. This should be done by axioms.
Further according to Richard, it is the aim of science to explain the material universe. And although non-Euclidean geometry had not found any applications (Albert Einstein finished his general theory of relativity only in 1915), Richard already stated clairvoyantly:
Richard corresponded with Giuseppe Peano and Henri Poincaré. He became known to more than a small group of specialists by formulating his paradox which was extensively use by Poincaré to attack set theory whereupon the advocates of set theory had to refute these attacks.
He died in 1956 in Châteauroux, in the Indre département, at the age of 94.
See main article: Richard's Paradox. The paradox was first stated in 1905 in a letter to Louis Olivier, director of the Revue générale des sciences pures et appliquées. It was published in 1905 in the article Les Principes des mathématiques et le problème des ensembles. The Principia Mathematica by Alfred North Whitehead and Bertrand Russell quote it together with six other paradoxes concerning the problem of self-reference. In one of the most important compendia of mathematical logic, compiled by Jean van Heijenoort, Richard's article is translated into English. The paradox can be interpreted as an application of Cantor's diagonal argument. It inspired Kurt Gödel and Alan Turing to their famous works. Kurt Gödel considered his incompleteness theorem as analogous to Richard's paradox which, in the original version runs as follows:
Let E be the set of real numbers that can be defined by a finite number of words. This set is denumerable. Let p be the nth decimal of the nth number of the set E; we form a number N having zero for the integral part and p + 1 for the nth decimal, if p is not equal either to 8 or 9, and unity in the contrary case. This number N does not belong to the set E because it differs from any number of this set, namely from the nth number by the nth digit. But N has been defined by a finite number of words. It should therefore belong to the set E. That is a contradiction.
Richard never presented his paradox in another form, but meanwhile there exist several different versions, some of which being only very loosely connected to the original. For the sake of completeness they may be stated here.
(A) The version given in Principia Mathematica by Whitehead and Russell is similar to Richard's original version, alas not quite as exact. Here only the digit 9 is replaced by the digit 0, such that identities like 1.000... = 0.999... can spoil the result.
(B) Berry's Paradox, first mentioned in the Principia Mathematica as fifth of seven paradoxes, is credited to Mr. G. G. Berry of the Bodleian Library. It uses the least integer not nameable in fewer than nineteen syllables; in fact, in English it denotes 111,777. But "the least integer not nameable in fewer than nineteen syllables" is itself a name consisting of eighteen syllables; hence the least integer not nameable in fewer than nineteen syllables can be named in eighteen syllables, which is a contradiction
(C) Berry's Paradox with letters instead of syllables is often related to the set of all natural numbers which can be defined by less than 100 (or any other large number) letters. As the natural numbers are a well-ordered set there must be the least number which cannot be defined by less than 100 letters. But this number was just defined by 65 letters including spaces.
(D) König's Paradox was also published in 1905 by Julius König. All real numbers which can be defined by a finite number of words form a subset of the real numbers. If the real numbers can be well-ordered, then there must be a first real number (according to this order) which cannot be defined by a finite number of words. But the first real number which cannot be defined by a finite number of words has just been defined by a finite number of words.
(E) The smallest natural number without interesting properties acquires an interesting property by this very lack of any interesting properties.
(F) A loan of the Paradox of Grelling and Nelson. The number of all finite definitions is countable. In lexical order we obtain a sequence of definitions D1, D2, D3, ... Now, it may happen that a definition defines its own number. This would be the case if D1 read "the smallest natural number". It may happen, that a definition does not describe its own number. This would be the case if D2 read "the smallest natural number". Also the sentence "this definition does not describe its number" is a finite definition. Let it be Dn. Is n described by Dn. If yes, then no, and if no, then yes. The dilemma is irresolvable. (This version is described in more detail in another article, Richard's paradox.)
Georg Cantor wrote in a letter to David Hilbert:
\aleph0
\aleph0
Here Cantor is in error. Today we know that there are uncountably many real numbers without the possibility of a finite definition.
Ernst Zermelo comments Richard's argument:
Zermelo points to the reason why Richard's paradox fails. His last statement, however, is impossible to satisfy. A real number with infinitely many digits, which are not determined by some "rule", has an infinitely large contents of information. Such a number could only be identified by a short name if there were only one or few of them existing. If there exist uncountably many, as is the case, an identification is impossible.