Robert M. Solovay

"Solovay" redirects here. For alleged internet "Spam King", see Robert Soloway. For other uses, see Soloway (disambiguation).

Robert M. Solovay
Robert Solovay in 1972 (photo by George Bergman)
Born	(1938-12-15) December 15, 1938 Brooklyn, New York, U.S.
Nationality	American
Fields	Mathematics
Institutions	University of California, Berkeley
Alma mater	University of Chicago
Doctoral advisor	Saunders Mac Lane
Doctoral students	Matthew Foreman Kenneth McAloon Judith Roitman W. Hugh Woodin
Notable awards	Paris Kanellakis Award (2003)

Robert Martin Solovay (born December 15, 1938) is an American mathematician specializing in set theory.

Solovay earned his Ph.D. from the University of Chicago in 1964 under the direction of Saunders Mac Lane, with a dissertation on A Functorial Form of the Differentiable Riemann–Roch theorem. Solovay has spent his career at the University of California at Berkeley, where his Ph.D. students include W. Hugh Woodin and Matthew Foreman.

Solovay's theorems include:

Solovay's theorem showing that, if one assumes the existence of an inaccessible cardinal, then the statement "every set of real numbers is Lebesgue measurable" is consistent with ZF without the axiom of choice;
Isolating the notion of 0^#;
Proving that the existence of a real valued measurable cardinal is equiconsistent with the existence of a measurable cardinal;
Proving that if $\lambda$ is a strong limit singular cardinal, greater than a strongly compact cardinal then $2^{\lambda }=\lambda ^{+}$ holds;
Proving that if $\kappa$ is an uncountable regular cardinal, and $S\subseteq \kappa$ is a stationary set, then $S$ can be decomposed into the union of $\kappa$ disjoint stationary sets;
With Stanley Tennenbaum, developing the method of iterated forcing and showing the consistency of Suslin's hypothesis.
Outside of set theory, developing (with Volker Strassen) the Solovay–Strassen primality test, used to identify large natural numbers that are prime with high probability. This method has had implications for cryptography.
Proving that GL (the normal modal logic which has the instances of the schema $\Box (\Box A\to A)\to \Box A$ as additional axioms) completely axiomatizes the logic of the provability predicate of Peano Arithmetic.
With Alexei Kitaev, proving that a finite set of quantum gates can efficiently approximate an arbitrary unitary operator on one qubit.

Selected publications

Solovay, Robert M. (1970). "A model of set-theory in which every set of reals is Lebesgue measurable". Annals of Mathematics. Second Series. 92 (1): 1–56. doi:10.2307/1970696.
Solovay, Robert M. (1967). "A nonconstructible Δ¹₃ set of integers". Transactions of the American Mathematical Society. American Mathematical Society. 127 (1): 50–75. doi:10.2307/1994631. JSTOR 1994631.
Solovay, Robert M. and Volker Strassen (1977). "A fast Monte-Carlo test for primality". SIAM Journal on Computing. 6 (1): 84–85. doi:10.1137/0206006.

Authority control	WorldCat Identities VIAF: 19458568 LCCN: no2007066038 MGP: 6522

This article is issued from Wikipedia - version of the 10/17/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.