Arthur Rubin

Last updated
Arthur Rubin
Arthur Rubin edit.jpg
Rubin at the Aquarium of the Pacific in August 2006
Born1956 (age 6768)
Alma mater Caltech
Scientific career
Fields Mathematics
Aerospace engineering
Thesis Free Algebras in Von Neumann–Bernays–Gödel Set Theory and Positive Elementary Inductions in Reasonable Structures  (1978)
Doctoral advisor Alexander S. Kechris

Arthur Leonard Rubin (born 1956) [1] is an American mathematician and aerospace engineer. He was named a Putnam Fellow on four consecutive occasions from 1970 to 1973.

Contents

Life and career

Rubin's mother was Jean E. Rubin, a professor of mathematics at Purdue University, and his father was Herman Rubin, a professor of statistics at the same university. [2] Arthur co-authored his first paper with his mother in 1969 at the age of 13. [3] He earned his Ph.D. at the California Institute of Technology in 1978, under the direction of Alexander S. Kechris. [4]

Rubin unsuccessfully stood as a Libertarian to represent the 55th district in the 1984 California State Assembly elections. [5]

Awards and honors

As an undergraduate, Rubin was named a Putnam Fellow on four occasions, the first time in 1970, aged 14, making him the youngest Fellow to date. [6] [7] [8] In 1972, he tied for third place in the first USA Mathematical Olympiad. [9]

In 1974, Rubin was the subject of an article in the Madison Capital Times , in which his Caltech undergraduate advisor was quoted as saying that someone of Rubin's ability appeared in the United States "about once in every ten years". [10]

Publications

Rubin's dissertation was entitled Free Algebras in Von Neumann–Bernays–Gödel Set Theory and Positive Elementary Inductions in Reasonable Structures. [4] [11] In 1979, Rubin co-authored a paper on list coloring of graphs with Paul Erdős, giving him an Erdős number of 1. [12]

Related Research Articles

In mathematics, the axiom of regularity is an axiom of Zermelo–Fraenkel set theory that states that every non-empty set A contains an element that is disjoint from A. In first-order logic, the axiom reads:

In mathematics, particularly set theory, a finite set is a set that has a finite number of elements. Informally, a finite set is a set which one could in principle count and finish counting. For example,

In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such as Russell's paradox. Today, Zermelo–Fraenkel set theory, with the historically controversial axiom of choice (AC) included, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics. Zermelo–Fraenkel set theory with the axiom of choice included is abbreviated ZFC, where C stands for "choice", and ZF refers to the axioms of Zermelo–Fraenkel set theory with the axiom of choice excluded.

In set theory, an uncountable cardinal is inaccessible if it cannot be obtained from smaller cardinals by the usual operations of cardinal arithmetic. More precisely, a cardinal κ is strongly inaccessible if it satisfies the following three conditions: it is uncountable, it is not a sum of fewer than κ cardinals smaller than κ, and implies .

In the mathematical discipline of set theory, 0# is the set of true formulae about indiscernibles and order-indiscernibles in the Gödel constructible universe. It is often encoded as a subset of the natural numbers, or as a subset of the hereditarily finite sets, or as a real number. Its existence is unprovable in ZFC, the standard form of axiomatic set theory, but follows from a suitable large cardinal axiom. It was first introduced as a set of formulae in Silver's 1966 thesis, later published as Silver (1971), where it was denoted by Σ, and rediscovered by Solovay, who considered it as a subset of the natural numbers and introduced the notation O#.

In mathematics, Tarski's theorem, proved by Alfred Tarski, states that in ZF the theorem "For every infinite set , there is a bijective map between the sets and " implies the axiom of choice. The opposite direction was already known, thus the theorem and axiom of choice are equivalent.

In set theory and related branches of mathematics, the von Neumann universe, or von Neumann hierarchy of sets, denoted by V, is the class of hereditary well-founded sets. This collection, which is formalized by Zermelo–Fraenkel set theory (ZFC), is often used to provide an interpretation or motivation of the axioms of ZFC. The concept is named after John von Neumann, although it was first published by Ernst Zermelo in 1930.

In the foundations of mathematics, von Neumann–Bernays–Gödel set theory (NBG) is an axiomatic set theory that is a conservative extension of Zermelo–Fraenkel–choice set theory (ZFC). NBG introduces the notion of class, which is a collection of sets defined by a formula whose quantifiers range only over sets. NBG can define classes that are larger than sets, such as the class of all sets and the class of all ordinals. Morse–Kelley set theory (MK) allows classes to be defined by formulas whose quantifiers range over classes. NBG is finitely axiomatizable, while ZFC and MK are not.

The axiom of constructibility is a possible axiom for set theory in mathematics that asserts that every set is constructible. The axiom is usually written as V = L. The axiom, first investigated by Kurt Gödel, is inconsistent with the proposition that zero sharp exists and stronger large cardinal axioms. Generalizations of this axiom are explored in inner model theory.

In mathematical logic, an axiom schema generalizes the notion of axiom.

<span class="mw-page-title-main">László Lovász</span> Hungarian mathematician

László Lovász is a Hungarian mathematician and professor emeritus at Eötvös Loránd University, best known for his work in combinatorics, for which he was awarded the 2021 Abel Prize jointly with Avi Wigderson. He was the president of the International Mathematical Union from 2007 to 2010 and the president of the Hungarian Academy of Sciences from 2014 to 2020.

In the foundations of mathematics, Morse–Kelley set theory (MK), Kelley–Morse set theory (KM), Morse–Tarski set theory (MT), Quine–Morse set theory (QM) or the system of Quine and Morse is a first-order axiomatic set theory that is closely related to von Neumann–Bernays–Gödel set theory (NBG). While von Neumann–Bernays–Gödel set theory restricts the bound variables in the schematic formula appearing in the axiom schema of Class Comprehension to range over sets alone, Morse–Kelley set theory allows these bound variables to range over proper classes as well as sets, as first suggested by Quine in 1940 for his system ML.

Gentzen's consistency proof is a result of proof theory in mathematical logic, published by Gerhard Gentzen in 1936. It shows that the Peano axioms of first-order arithmetic do not contain a contradiction, as long as a certain other system used in the proof does not contain any contradictions either. This other system, today called "primitive recursive arithmetic with the additional principle of quantifier-free transfinite induction up to the ordinal ε0", is neither weaker nor stronger than the system of Peano axioms. Gentzen argued that it avoids the questionable modes of inference contained in Peano arithmetic and that its consistency is therefore less controversial.

In mathematics, specifically in class theories, the axiom of global choice is a stronger variant of the axiom of choice that applies to proper classes of sets as well as sets of sets. Informally it states that one can simultaneously choose an element from every non-empty set.

<span class="mw-page-title-main">Axiom of limitation of size</span>

In set theory, the axiom of limitation of size was proposed by John von Neumann in his 1925 axiom system for sets and classes. It formalizes the limitation of size principle, which avoids the paradoxes encountered in earlier formulations of set theory by recognizing that some classes are too big to be sets. Von Neumann realized that the paradoxes are caused by permitting these big classes to be members of a class. A class that is a member of a class is a set; a class that is not a set is a proper class. Every class is a subclass of V, the class of all sets. The axiom of limitation of size says that a class is a set if and only if it is smaller than V—that is, there is no function mapping it onto V. Usually, this axiom is stated in the equivalent form: A class is a proper class if and only if there is a function that maps it onto V.

In mathematics, specifically set theory, a cumulative hierarchy is a family of sets indexed by ordinals such that

The Banach–Tarski paradox is a theorem in set-theoretic geometry, which states the following: Given a solid ball in three-dimensional space, there exists a decomposition of the ball into a finite number of disjoint subsets, which can then be put back together in a different way to yield two identical copies of the original ball. Indeed, the reassembly process involves only moving the pieces around and rotating them, without changing their original shape. However, the pieces themselves are not "solids" in the traditional sense, but infinite scatterings of points. The reconstruction can work with as few as five pieces.

András Hajnal was a professor of mathematics at Rutgers University and a member of the Hungarian Academy of Sciences known for his work in set theory and combinatorics.

Haim Hanani was a Polish-born Israeli mathematician, known for his contributions to combinatorial design theory, in particular for the theory of pairwise balanced designs and for the proof of an existence theorem for Steiner quadruple systems. He is also known for the Hanani–Tutte theorem on odd crossings in non-planar graphs.

References

  1. Bock, M. E. (2004), "Conversations with Herman Rubin", in DasGupta, Anirban (ed.), A Festschrift for Herman Rubin, Lecture notes – monograph series, vol. 45, Institute of Mathematical Statistics, pp. 408–417, ISBN   9780940600614, JSTOR   4356327 .
  2. McClure, Dinah L., ed. (2002). "Obituary: J.E.H. Rubin" (PDF). Sequel (38): 2. Archived from the original (PDF) on 2006-09-02. Retrieved 2006-04-25.
  3. Rubin, A. L. & Rubin, J. E. (1969). "Extended operations and relations on the class of ordinal numbers". Fundamenta Mathematicae . 65 (2): 227–242. doi: 10.4064/fm-65-2-227-242 . (The default language of this webpage is Polish, but it can be changed to English via the language option on the upper right)
  4. 1 2 Arthur Rubin at the Mathematics Genealogy Project
  5. Ward, Mike (June 3, 1984). "Most Senators, Assemblymen Unchallenged". Los Angeles Times . ProQuest   676835132. Archived from the original on November 4, 2012.
  6. Alexanderson, Gerald L.; Klosinski, Leonard F.; Larson, Loren C., eds. (1985). The William Lowell Putnam Mathematical Competition Problems and Solutions 1965–1984. Mathematical Association of America. pp. 141–142. ISBN   0-88385-463-5. OCLC   55235548.
  7. "The Mathematical Association of America's William Lowell Putnam Competition". Mathematical Association of America . Archived from the original on 21 April 2006. Retrieved 2006-04-25.
  8. Gallian, Joseph. "The Putnam Competition from 1938-2009" (PDF). Archived from the original (PDF) on 2009-10-13. Retrieved 2015-09-22.
  9. Greitzer, S (March 1973). "The First U.S.A Mathematical Olympiad". American Mathematical Monthly . 80 (3). Mathematical Association of America: 276–281. doi:10.2307/2318449. JSTOR   2318449.
  10. Stingley, Jim (May 13, 1974). "Caltech Math Whiz" . Los Angeles Times . pp. D1–D2. ProQuest   157440937. Reprinted and slightly altered in Madison Capital Times on July 6, 1974
  11. Rubin, Arthur Leonard (1978). Free Algebras in Von Neumann–Bernays–Gödel Set Theory and Positive Elementary Inductions in Reasonable Structures (Ph.D.). California Institute of Technology. OCLC   436995833. ProQuest   302912786. (Note: access might be depended on type of library institutional subscription available)
  12. Erdős, Paul; Rubin, Arthur L. & Taylor, Herbert (1980). "Choosability in graphs" (PDF). Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing (Humboldt State Univ., Arcata, Calif., 1979). Congressus Numerantium. Vol. XXVI. pp. 125–157. MR   0593902.