Proposition 4.15 — original tree hierarchy compared with the set-jump tower
ProvedFSCofinality.original_tree_comparisonFor every nonzero countable ordinal a, there is a countable ordinal b such that isomorphism on the bounded-rank rooted tree class at bound a Borel reduces to the product-limit Friedman--Stanley relation J_b. Empty and finite trees and all branch multiplicities are included. This formalizes the first assertion of Proposition 4.15; no equality of the indices a and b, and no simultaneous Borel choice over ordinal codes, is asserted. The separate structural sentence-tower assertion is outside this milestone.
The comparison has independently quantified countable indices:
import Definitions.Def_FSCofinalityHierarchy20261102 import Definitions.Def_FSCofinalityTrees20261102 set_option autoImplicit false
theorem FSCofinality.original_tree_comparison
(a : Ordinal.{0}) (ha_pos : 0 < a) (ha_countable : a < Ordinal.omega 1) :
∃ b : Ordinal.{0}, b < Ordinal.omega 1 ∧
(FSCofinality.RootedTrees.treeRelation a).Reduces (FSCofinality.fsTower b) := by sorry
Read-back
What the Lean code literally says, in plain math · Codex (GPT-6 family; exact runtime model identifier not exposed to auditor)
Read-back: FSCofinality.original_tree_comparison
Auditor model: GPT-6-based Codex agent; exact model identifier unavailable.
For every ordinal in universe , assuming and , where is the first uncountable ordinal, there exists an ordinal in the same universe with and a measurable function such that, for every , the underlying trees of and are isomorphic if and only if . Here consists of Boolean-valued functions on the finite lists of natural numbers, together with proofs of the following conditions: whenever the value at is true, the value at is true; and there exists a function from the lists whose value is true to the universe- ordinals such that for every such list and whenever for some natural number . Thus is an immediate child of , and ordinals strictly decrease from parent to child. The function is existentially required; a particular ranking function is not additional data supplied to . The measurable structure on is the subtype measurable structure inherited from the Borel measurable structure on the space of prefix-closed Boolean functions, whose topology is the subspace topology of the product of discrete Boolean spaces indexed by finite lists of natural numbers; there is no additional hypothesis that the bounded-tree subtype is a Borel subset. Two underlying trees are isomorphic precisely when there exists one bijection between their sets of present lists such that, for every ordered pair of present lists , is an immediate child of if and only if is an immediate child of . The natural-number labels and list lengths are not separately required to be preserved; the stipulated condition is preservation and reflection of the immediate-child relation by that bijection. The target code space and relation are defined recursively as follows. At stage , with its product measurable structure, and is literal equality of Boolean sequences. At a successor stage , consists of one distinguished code and all natural-number-indexed sequences . Its measurable structure is pulled back from the disjoint sum of a singleton and the product measurable space by the map taking to the singleton summand and a sequence to the sequence summand. The relation relates to itself, never relates to a sequence in either direction, and relates two sequence codes exactly when both and hold. Thus the nonempty sequence codes do not retain enumeration order or multiplicity at the level of this relation, whereas the distinguished empty code is separate. At a nonzero countable limit ordinal , a single fixed choice of sequence is used: for every , is strictly increasing, and for every there exists with . Then with the dependent product measurable structure, and means that for every . These are actual sequence, option, and product code spaces, rather than quotient spaces of equivalence classes. Measurability of means that every measurable target set has measurable inverse image in the specified source subtype. The existential choices of and occur after the choice of and its two stated hypotheses, and before the universal quantification over the pair : one and one function work for all trees with that bound. There is no further ordinal inequality relating and , no positivity condition on , and no uniqueness assertion. The hypothesis excludes and all uncountable , but includes every positive finite and every positive countable successor or limit ordinal. The empty tree belongs to because its ranking requirements are vacuous, and it would also satisfy those requirements at bound ; any nonempty prefix-closed tree contains the empty list as its root. A single-root tree admits the constant-zero ranking exactly when the bound is positive, so its least global bound is . At , the only underlying trees in the source are the empty tree and the tree containing just that root. More generally the condition bounds every node's ordinal strictly below ; it is not a condition assigning the root ordinal , and it allows finite trees and infinitely branching trees whenever such a ranking exists while excluding trees with an infinite child chain. Empty and nonempty trees cannot be isomorphic because their node sets cannot be bijective. Neither relation is assumed in this declaration to have a Borel graph, and no measurable choice of the existential ranking witnesses is required.
Confirmed by the mission captain (proposal self-audit).