Uniform n-place functions on T⊂eq ds(α)
Abstract
In this paper the Erdos-Rado theorem is generalized to the class of well founded trees. We define an equivalence relation on the class rs(infty)< aleph0 (finite sequences of decreasing sequences of ordinals) with aleph0 equivalence classes, and for n< omega a notion of n-end-uniformity for a colouring of rs(infty)< aleph0 with mu colours. We then show that for every ordinal alpha, n< omega and cardinal mu there is an ordinal lambda so that for any colouring c of T=rs(lambda)< aleph0 with mu colours, T contains S isomorphic to rs(alpha) so that c rest S< aleph0 is n-end uniform. For c with domain Tn this is equivalent to finding S subseteq T isomorphic to rs(alpha) so that c upharpoonright Sn depends only on the equivalence class of the defined relation, so in particular T-> (rs(alpha))nmu, aleph0 . We also draw a conclusion on colourings of n-tuples from a scattered linear order.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.