I understand that Nachman Aronszajn is credited for proving the existence of Aronszajn trees. But I've not had any success finding where this was published. Does anyone know of a specific paper or book where Aronszajn published his proof?
1 Answer
I believe that these first appeared in the paper
Georges Kurepa, Ensembles linéaires et une classe de tableaux ramifiés (tableaux ramifiés de M.Aronszajn), Publ. Math. Univ. Belgrade, 6 (1936) 129160.
The author attributes them to a letter that Aronszajn wrote to him (see page 132). This paper is available here.
Edit by A. Caicedo: The following is from Stevo Todorcevic's essay introducing the papers on "Theory of partially ordered sets", part A of Selected papers of Ðuro Kurepa, Edited and with commentaries by Aleksandar Ivić, Zlatko Mamuzić, Žarko Mijajlović and Stevo Todorčević, Matematički institut SANU, Belgrade, 1996. MR1429393 (97m:01106).
The papers it refers to are
 A[35] Ensembles ordonnés et ramifiés, Publ. Math. Univ. Belgrade 4 (1935), 1138.
 A[37] Ensembles lineaires et une classe de tableaux ramifies (Tableaux ramifies de M. Aronszajn), Publ. Math. Univ. Belgrade 6/7 (1937/38), 129160.
[1]
J. E. Baumgartner, Decomposition and embedding of trees, Notices Amer. Math. Soc. 17 (1970), 967. [6] K. J. Devlin, Note on a theorem of J. Baumgartner, Fund. Math. 76 (1972), 255260. MR0540759 (58 #27476).
 [12] W. P. Hanf, Incompactness in languages with infinitely long expressions, Fund. Math. 53 (1964), 309324. MR0160732 (28 #3943).
The most important publication in this group is Kurepa's thesis A[35] written under the direction of M. Fréchet. It was the first systematic study of trees and ramified partially ordered sets and of their close relationship to linear orderings. It was the source of many crucial notions and problems in this area such as, for example, the notions of Aronszajn and Souslin tree. It is the source of the problem whether inaccessible cardinals have the tree property i.e., whether they satisfy the analogue of König's infinity lemma, which was later proved by Hanf, Tarski and others ([12]) to be equivalent to the large cardinal property of weak compactness. Trees are classified in §8 A11 as "large", "étroit" and "ambigu" according to their heights and widths. The very thin and tall trees ("étroit") always have cofinal branches i.e., chains intersecting every level (Theorem $5^{bis}$). This is a fine result representing a recurring theme in applications of trees, especially in the partition calculus. This result was also a source of the problem whether the same fact is true about the class of slightly wider trees ("ambigu") i.e., the trees of height equal to some cardinal $\theta$ and whose levels are now only assumed to be of size $\lt \theta$ (rather than $\lt\lambda$ for some cardinal $\lambda<\theta$ as it was the case with the trees in Theorem $5^{bis}$). This is the problem known today as the problem whether $\theta$ has the tree property. For $\theta= \omega_1$ the problem was solved in June 1934 by N. Aronszajn and appeared (with an acknowledgement) as Theorem 6 of A[35]. According to the footnote on the same page, Aronszajn constructed his tree as a subtree of the tree of all $11$ sequences from $\mathbb Q^{\lt\omega_1}$, while Kurepa's version of the proof presented in A[35] (and also in A[37]) was to build such a tree inside the tree $\sigma\mathbb Q$ (denoted by $\sigma_0$) of all (nonempty bounded) wellordered subsets of rationals. This is the construction most frequently used in subsequent expositions of this result. In the sequel A[37;§27] he modified his construction in order to produce an Aronszajn tree with the surprising property that it is a union of countably many antichains, thus introducing yet another remarkable notion, the notion of a special Aronszajn tree. (It is known today that some care is needed to get such a tree, as it is possible to have nonspecial Aronszajn subtrees of both $\sigma\mathbb Q$ and the set of all $11$ sequences from $\mathbb Q^{\lt\omega_1}$; see
[1]
and [6].)
The essay goes on to describe additional work (by Kurepa and others) on the tree property.

$\begingroup$ (Apologies to Andy for the addition. I think it belongs here rather than as a comment or a separate answer.) $\endgroup$ Commented Nov 23, 2012 at 7:11

$\begingroup$ @Andrew Caicedo : No apologies necessary! Your addendum is much more scholarly than my answer. This is far from my area of research, but I had recently read Bergman's little note "Some empty inverse limits" (see math.berkeley.edu/~gbergman/papers/unpub/emptylim.pdf; I found it a while ago while aimlessly browsing the internet late at night), and I remembered that it gave the historical attribution that I gave in my answer. $\endgroup$ Commented Nov 24, 2012 at 3:52