Characterization of order types of pointwise linearly ordered families of Baire class 1 functions

Abstract

In the 1970s M. Laczkovich posed the following problem: Let B1(X) denote the set of Baire class 1 functions defined on an uncountable Polish space X equipped with the pointwise ordering. \[Characterize the order types of the linearly ordered subsets of B1(X). \]The main result of the present paper is a complete solution to this problem. We prove that a linear order is isomorphic to a linearly ordered family of Baire class 1 functions iff it is isomorphic to a subset of the following linear order that we call ([0,1]<ω1 0,<altlex), where [0,1]<ω1 0 is the set of strictly decreasing transfinite sequences of reals in [0, 1] with last element 0, and <altlex, the so called alternating lexicographical ordering, is defined as follows: if (xα)α≤ , (x'α)α≤ ' ∈ [0,1]<ω1 0, and δ is the minimal ordinal where the two sequences differ then we say that \[ (xα)α≤ <altlex (x'α)α≤ ' (δ is even and xδ<x'δ) or (δ is odd and xδ>x'δ). \] Using this characterization we easily reprove all the known results and answer all the known open questions of the topic.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…