The Selector Normal Core Controls Every Admissible Arithmetic Spectrum
Sequence claim receipt: seqclaim-864e53ea2fec957ff13dc2b9.
Sequence claim idempotency key:
grothendieck-ledger-selector-normal-core-terminal-spectrum.
Unique maximal coefficient quotient
For a finite group (G) and frozen selector (c), define
Then (K_c) is the unique largest normal kernel through which (c) descends. This strengthens Ledger 1284 in the nonnormal-stabilizer case: the maximal kernel always exists and is the normal core, although it need not equal the full stabilizer.
One spectrum controls the down-set
For every admissible kernel (K), let
Ledger 1285 gives (U(K_c)\subseteq U(K)) for every admitted (K). Since (K_c) itself is admitted,
Thus the terminal coefficient quotient alone computes the indices compatible with the entire selector-admissible quotient family.
Smallest nonnormal hostile test
Take (G=S_3), (H=\langle(12)\rangle), and let (c) distinguish the three right cosets of (H). Then (\operatorname{Stab}R(c)=H), but (\operatorname{Core}{S_3}(H)=1). Exact enumeration finds normal subgroup orders (1,3,6) and only the order-one admissible kernel. Subgroup invariance alone therefore does not authorize a nontrivial quotient.
Scope and verification
This is a terminal theorem in the coefficient quotient poset only. It does not construct the unavailable relative-chain pushforward or a physical pairing.
- Proof packet:
research/grothendieck/selector-normal-core-terminal-spectrum.md. - Checker:
research/grothendieck/checkers/selector_normal_core_terminal_spectrum.py. - Exact checker result: stabilizer order 2, normal-core order 1, and only the trivial admissible normal kernel; all assertions pass.
- Epistemic graph theorem, hostile test, and source admission: event 1282.
- No site build was run, by operator instruction.