olymmath

SCHWEITZER 2002 Problem 1

    For an arbitrary ordinal number α\alpha let H(α)H(\alpha) denote the set of functions f ⁣:α→{−1,0,1}f\colon \alpha \rightarrow \{ -1,0,1\} that map all but finitely many elements of α\alpha to 00 . Order H(α)H(\alpha) according to the last difference, that is, for f,g∈H(α)f, g\in H(\alpha) let f≺gf\prec g if f(β)<g(β)f(\beta) < g(\beta) holds for the maximum ordinal number β<α\beta < \alpha with f(β)≠g(β)f(\beta) \neq g(\beta) . Prove that the ordered set (H(α),≺)(H(\alpha), \prec) is scattered (i.e. it doesn't contain a subset isomorphic to the set of rational numbers with the usual order), and that any scattered order type can be embedded into some (H(α),≺)(H(\alpha), \prec) .

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator schweitzer/2002/p1 · Tag 7HPTS9M4SY · Edit this page on GitHub · Keys: j next, k previous