Tree-derived ideals: Fubini iterations, limit amalgamations, and Katetov obstructions
Abstract
We develop a machinery for deriving ideals on a countable set from a partition of indexed by . A derivative operator on trace trees, parametrized by an auxiliary ideal , yields a strict transfinite hierarchy of proper ideals, tall from level one onward and independent of the chosen partition. Its finite levels are exactly the Fubini powers, , while amalgamates all finite powers. We establish presentation independence, local homogeneity, Fubini recursion, and -completeness of the full hierarchy. Let be Kwela's canonical inductive limit and his independent-partitions limit. We prove , although and every finite coherent fragment of a putative reduction is realizable over . The proof introduces essential depth, an invariant monotone along Katetov reductions of , and gives the sharp non-extension bound . Thus contains no isomorphic copy of , and . Applications include chromatic ideals whose inclusion order records divisibility and whose Katetov order records arithmetic. We also prove the orthogonality of Cantor--Bendixson and derivative ranks. Finally, is a -closed reduced power , contains regularly, and under CH is forcing-equivalent to .
Keywords
Cite
@article{arxiv.2607.16572,
title = {Tree-derived ideals: Fubini iterations, limit amalgamations, and Katetov obstructions},
author = {José de Jesús Pelayo Gómez},
journal= {arXiv preprint arXiv:2607.16572},
year = {2026}
}
Comments
27 pages, no figures