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

preprint2016arXivOpen access

Abstract

In the 1970s M. Laczkovich posed the following problem: Let B1(X)\mathcal{B}_1(X) denote the set of Baire class 11 functions defined on an uncountable Polish space XX equipped with the pointwise ordering. Characterize the order types of the linearly ordered subsets of B1(X).\text{Characterize the order types of the linearly ordered subsets of $\mathcal{B}_1(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 11 functions iff it is isomorphic to a subset of the following linear order that we call ([0,1]↘0<ω1,<altlex)([0,1]^{<ω_1}_{\searrow 0},<_{altlex}), where [0,1]↘0<ω1[0,1]^{<ω_1}_{\searrow 0} is the set of strictly decreasing transfinite sequences of reals in [0,1][0, 1] with last element 00, and <altlex<_{altlex}, the so called \emph{alternating lexicographical ordering}, is defined as follows: if (xα)α≤ξ,(xα′)α≤ξ′∈[0,1]↘0<ω1(x_α)_{α\leq ξ}, (x'_α)_{α\leq ξ'} \in [0,1]^{<ω_1}_{\searrow 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δ′). (x_α)_{α\leq ξ} <_{altlex} (x'_α)_{α\leq ξ'} \iff (δ\text{ is even and } x_δ<x'_δ) \text{ or } (δ\text{ 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.