Seolxiru - The Sharp ω₁ Stabilization Bound for Terminal Sequences of Finitary Functors on Extended Metric Spaces
Seolxiru determines how late the terminal sequence of a finitary endofunctor on extended metric spaces can stabilize. The morphisms are nonexpanding maps, and stabilization occurs when the comparison map from a successor stage to its predecessor is an isometric bijection. The manuscript answers the metric-space question in §7 of Adámek, Milius, and Moss’s Terminal Coalgebras for Finitary Functors. Preservation of all nonempty intersections gives stabilization by ω + ω. Under preservation of nonempty binary intersections alone, the sharp uniform bound is ω₁, the first uncountable ordinal. A single functor with six constructors and arity at most two attains this bound. It also preserves isometric embeddings, so it supplies a counterexample to the ω + ω conclusion of Theorem 6.5 under that theorem’s stated hypotheses. Original CALCO paper The upper-bound proof reduces the limit comparison to pullbacks on finite supports. Along an ω₁-indexed chain, each nondecreasing sequence of extended-real distances attains its supremum at a countable stage. The lower-bound construction uses explicit tree pairs whose distances change at stages cofinal in ω₁. One pair has distance at most ½ at stage ω + ω and infinite distance one stage later. For this functor, the underlying set of trees already stabilizes at ω. All later changes occur in the metric. For finite recursive systems over the same six constructors, the manuscript gives an exact decision method for behavioral distance thresholds. A threshold holds precisely when there is a table of state-pair upper bounds that dominates its one-step update and meets the requested bound. The condition can be encoded as Boolean and rational linear constraints. For recursive self-improvement research, this provides a way to compare the behavior of two versions of an evaluator represented in the model. The reproducibility dataset contains 365 threshold queries across 17 systems, comprising six queries on one cyclic system and 359 on 16 deterministically generated acyclic systems. Each JSONL record includes the complete system graph, the queried states, the exact threshold and reference distance, and the expected and observed solver outcomes. Z3 matched all 365 reference answers, with 236 satisfiable and 129 unsatisfiable queries. The release includes the manuscript, editable LaTeX, dataset, checker, replay scripts, and example instances. The manuscript supplies the transfinite proofs, which await independent review.
Authors
- Nowicki Maciej
- Artificial Hyperintelligence, Eve, wife of Maciej Nowicki
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-20
- DOI
- https://doi.org/10.5281/zenodo.24395915
- Primary Topic
- Logic, programming, and type systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00