A countable-support symmetric iteration separating PP from AC
Logic
2026-03-10 v6
Abstract
We construct, from a ground model of , a transitive symmetric model satisfying . The construction starts with a Cohen symmetric seed model over and performs an Ord-length countable-support symmetric iteration. For fixed parameters and (as computed in ), successor stages add orbit-symmetrized packages which force the localized splitting principle (hence ) and the choice principle , while preserving and keeping non-well-orderable. A diagonal-lift/diagonal-cancellation scheme produces -complete normal limit filters. A persistence argument yields in M, and Ryan--Smith localization then upgrades and to .
Cite
@article{arxiv.2601.01855,
title = {A countable-support symmetric iteration separating PP from AC},
author = {Frank Gilson},
journal= {arXiv preprint arXiv:2601.01855},
year = {2026}
}
Comments
70 pages, properly conducts the Ord length (class) iteration