English

A countable-support symmetric iteration separating PP from AC

Logic 2026-03-10 v6

Abstract

We construct, from a ground model of ZFCZFC, a transitive symmetric model MM satisfying ZF+DC+PP+ACwo+¬ACZF + DC + PP + AC_{wo} + \neg AC. The construction starts with a Cohen symmetric seed model NN over Add(ω,ω1)Add(\omega,\omega_1) and performs an Ord-length countable-support symmetric iteration. For fixed parameters S:=AωS:=A^\omega and T:=PowerSet(S)T:=PowerSet(S) (as computed in NN), successor stages add orbit-symmetrized packages which force the localized splitting principle PPsplit ⁣TPP^{\mathrm{split}}\!\restriction T (hence PPTPP\restriction T) and the choice principle ACwoAC_{wo}, while preserving DCDC and keeping AA non-well-orderable. A diagonal-lift/diagonal-cancellation scheme produces ω1\omega_1-complete normal limit filters. A persistence argument yields SVC+(T)SVC^+(T) in M, and Ryan--Smith localization then upgrades PPTPP\restriction T and ACwoAC_{wo} to PPPP.

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

R2 v1 2026-07-01T08:50:28.143Z