Table of Contents
Fetching ...

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

Frank Gilson

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 $ZF + DC + \neg \mathrm{BPI}$ geometry in which rank-$1$ 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-$1$ packet calculus. From this we obtain a normalization theorem and a two-layer coding consequence for rank-$1$ reals (in the metatheory, via a well-orderable base of packets). We then apply the same binary fresh-support shielding pattern to prove $\neg C_2$, hence $\neg AC_{\mathrm{fin}}$, and therefore the failure of every even $C_n$ (where $C_n$ denotes the principle that every family of nonempty $n$-element sets admits a choice function). On the odd side, the present bounded packet calculus remains dyadic: support-fixed local actions factor through finite $2$-groups, bounded support-equivariant quotients of finite local orbits have power-of-two size, and trace-separated bounded rigid ternary families admit canonical selectors within a fixed finite trace window. Accordingly, the odd exact-cardinality profile remains open beyond the current local binary machinery.

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

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 sets admits a choice function). On the odd side, the present bounded packet calculus remains dyadic: support-fixed local actions factor through finite -groups, bounded support-equivariant quotients of finite local orbits have power-of-two size, and trace-separated bounded rigid ternary families admit canonical selectors within a fixed finite trace window. Accordingly, the odd exact-cardinality profile remains open beyond the current local binary machinery.

Paper Structure

This paper contains 8 sections, 19 theorems, 44 equations.

Key Result

Theorem 1.1

Let $\mathcal{N}^{\mathrm{1cas}}_{\rho}$ be the one-step cascade symmetric model defined in sec:model. Then: In addition, prop:nonconj records the geometric fact that $\mathscr G^{\mathrm{1cas}}_{\rho}$ contains elements with stationary row-support and therefore with uncountable total support, while sec:odd explains why the present bounded packet calculus leaves the odd side beginning with $\math

Theorems & Definitions (48)

  • Theorem 1.1: Main theorem
  • Definition 2.1: Stage 0 forcing and successor notation
  • Definition 2.2: Stage 1 forcing and one-step cascade generators
  • Definition 2.3: The symmetric system
  • Remark 2.4
  • Remark 2.5
  • Lemma 2.6: Fresh one-step separation
  • proof
  • Lemma 2.7: Finite shielding
  • proof
  • ...and 38 more