A One-Step Cascade Symmetric Model: Rank-$1$ Packets, Binary Shielding, and the Even Exact-Cardinality Profile
Frank Gilson

TL;DR
This paper introduces a novel one-step cascade symmetric model with finite $ ho$-closed supports, leading to new results in set theory, including the failure of certain choice principles and a packet normalization theorem for rank-1 hereditarily symmetric reals.
Contribution
It develops a new finite star-span lemma and rank-1 packet calculus, establishing normalization and coding theorems, and applies these to prove the failure of specific choice principles.
Findings
Failure of the principle $ eg C_2$ and $ eg AC_{ ext{fin}}$
Existence of a packet normalization theorem for rank-1 hereditarily symmetric reals
Development of a finite star-span lemma and associated rank-1 packet calculus
Abstract
We introduce a one-step cascade symmetric system whose local symmetry geometry is organized by finite -closed windows and one-step stars rather than by rowwise-independent toggles. The resulting symmetric model isolates a new geometry in which rank- hereditarily symmetric reals admit a packet normalization theorem over countable -closed supports. The technical center of the paper is the finite star-span lemma and the associated rank- packet calculus. From this we obtain a normalization theorem and a two-layer coding consequence for rank- reals (in the metatheory, via a well-orderable base of packets). We then apply the same binary fresh-support shielding pattern to prove , hence , and therefore the failure of every even (where denotes the principle that every family of nonempty -element…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
