The Setting
Here is the first uncountable ordinal, regarded as the set of all ordinals below the initial ordinal of .✦ Let . The problem is to choose finite stages exhausting each initial segment, with compatibility at every coordinate retained at a stage.
Coherent Closure Families
Let be a well-ordered set with countable initial segments, and write . A coherent finite closure system on is a family of finite subsets of , indexed by and the nonnegative integers , satisfying (1): (1)
A predecessor closure family at is a family of finite subsets of , indexed by and .✦ The family is coherent below when it satisfies (1) at every endpoint .✦
A coherent endpoint extension of at is an increasing sequence of finite subsets of , each containing , whose union is and whose compatibility with is given by (2): (2)✦
The endpoint closure construction assigns to a predecessor closure family a sequence of finite subsets of .✦ The chosen closure family on is the family of finite subsets of , indexed by and , defined by recursion along the well-order as in (3): (3)✦
On , the positive-indexed closures are the finite subsets specified by (4). Closure stages start at , whereas the positive-index convention starts at ; the subtraction is truncated at zero. (4)✦
The Claim
Theorem 1. Let be a well-ordered set with countable initial segments. Then (5)✦ For the positive-indexed closures on , let and , and suppose that . Then (6)✦
What Is Checked
Assertion (5) is stated over well-orders with countable initial segments, while (6) concerns the closure family (4) on .