Current-State Interfaces and the Future Quotient in a Finite Icosahedral (AKN-Type) Attachment Geometry: Untouchable Differences and Persistent History Parity

On a frozen 691-cell patch of AKN-type rhombohedral geometry with a single-face attachment grammar, a companion paper constructed finite current-state codes that decide the complete legal future, without determining whether the normalised code \(R_{K}^{(2)}\) among them is minimal. Here we ask which differences between current states act on the legal future, and compare the partition of states by the normalised code \(R_{K}^{(2)}\) with the future quotient, the partition by equality of extension languages. Assuming that every face belongs to at most two catalogue cells (K1, an audited finite property of the frozen catalogue), we prove in Lean that \(R_{K}^{(2)}\) is an exact complete invariant of the one-step legal interface: two catalogue states have the same normalised code exactly when they have the same available cells and the same legal moves. Together with an exhaustive enumeration, this yields all identifications within eight insertions of the seed. The future quotient is strictly coarser even among reachable states that still have legal moves: a preregistered computation on complete descendant DAGs certifies 5,384,241 future-equivalent pairs separated by \(R_{K}^{(2)}\). Under the same assumption we prove that if a cell is available in a reachable state \(s\) but not in a state \(t\), and some legal continuation of \(s\) touches it, then an explicit word distinguishes the futures of \(s\) and \(t\); hence the availability differences absorbed by future equivalence lie in cells that the available side can never touch, and an exhaustive audit of all certified nonterminal pairs found no exception. Finally, an outcome-blind, preregistered test shows that a history-derived parity, evaluable from the current state, does not factor through the future quotient, even between states with identical normalised code and size; by an existing integration law, such a difference persists along every common legal continuation. The future quotient itself is classical; the contribution is its explicit realisation in a finite attachment geometry, with formally verified general theorems and computationally certified reachable witnesses. No physical claim is made.

Authors

Publication Details

Journal
Qeios
Published
2026-11-09
DOI
https://doi.org/10.32388/8c43ek
Primary Topic
semigroups and automata theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Current-State Interfaces and the Future Quotient in a Finite Icosahedral (AKN-Type) Attachment Geometry: Untouchable Differences and Persistent History Parity

Masaru Numagaki
Qeios
semigroups and automata theory
preprint

Current-State Interfaces and the Future Quotient in a Finite Icosahedral (AKN-Type) Attachment Geometry: Untouchable Differences and Persistent History Parity

Masaru Numagaki
preprint en

Abstract

On a frozen 691-cell patch of AKN-type rhombohedral geometry with a single-face attachment grammar, a companion paper constructed finite current-state codes that decide the complete legal future, without determining whether the normalised code \(R_{K}^{(2)}\) among them is minimal. Here we ask which differences between current states act on the legal future, and compare the partition of states by the normalised code \(R_{K}^{(2)}\) with the future quotient, the partition by equality of extension languages. Assuming that every face belongs to at most two catalogue cells (K1, an audited finite property of the frozen catalogue), we prove in Lean that \(R_{K}^{(2)}\) is an exact complete invariant of the one-step legal interface: two catalogue states have the same normalised code exactly when they have the same available cells and the same legal moves. Together with an exhaustive enumeration, this yields all identifications within eight insertions of the seed. The future quotient is strictly coarser even among reachable states that still have legal moves: a preregistered computation on complete descendant DAGs certifies 5,384,241 future-equivalent pairs separated by \(R_{K}^{(2)}\). Under the same assumption we prove that if a cell is available in a reachable state \(s\) but not in a state \(t\), and some legal continuation of \(s\) touches it, then an explicit word distinguishes the futures of \(s\) and \(t\); hence the availability differences absorbed by future equivalence lie in cells that the available side can never touch, and an exhaustive audit of all certified nonterminal pairs found no exception. Finally, an outcome-blind, preregistered test shows that a history-derived parity, evaluable from the current state, does not factor through the future quotient, even between states with identical normalised code and size; by an existing integration law, such a difference persists along every common legal continuation. The future quotient itself is classical; the contribution is its explicit realisation in a finite attachment geometry, with formally verified general theorems and computationally certified reachable witnesses. No physical claim is made.

Qeios
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon