Generative Structural Theory v1.113 — One Bypassed Pair and One Cut: Why the Added Deletion Works at M 4
Year: 2026
Type: preprint
Abstract: Version v1.112 of Generative Structural Theory established a complete chain under deletion budget two for M4, the last of the twelve fixed inputs M1–M12 of v1.108. After its first step #4, that chain uses a one-sided step at leaf 12, side 1, with the additional deletion D = {(0, 7)}. This version gives a structural explanation of the eighteen deletion choices recorded at that fixed state, leaf and side. It distinguishes three questions: whether condition (N3) holds, whether a one-sided step exists, and whether a complete chain exists. For condition (N3), the seventeen pairs of h0 show that (0, 7) is the only pair bypassed before an additional deletion. In h0 minus {(0, 7)}, the path 0 → 10 → 15 → 16 → 14 → 5 → 9 → 11 → 13 is the unique path from 0 to 13. Consequently, (N3) holds exactly when the deleted pair is (0, 7) itself or one of the eight pairs on this path. It fails at the remaining nine choices. The general deletion criterion is presented as a corollary of the bypass definition in v1.89, not as a new general result. Among the nine choices satisfying (N3), the deletions D = {(9, 11)} and D = {(11, 13)} admit no one-sided step. For each, an explicit nonempty proper vertex set has no incoming pair in H ∪ U ∪ {v}. Memberships in the forbidden set F are proved directly from the definitions, establishing failure of (N4). The other seven choices have one-step witnesses recorded in v1.112. A complete chain is confirmed for D = {(0, 7)}. For the other six choices with a step, no complete chain was found under the conditions of v1112chain_run01, and v1112chain_run02 was not run from those choices. No conclusion about their complete-chain existence or nonexistence is asserted. In general, (N1)–(N4) do not guarantee a step, as already shown in v1.90. For the eighteen fixed choices considered here, however, both cases without a step that remain after (N3) are explained by failure of (N4). No general conclusion about (Q1), other leaves, other states or other inputs is claimed. The supplement provides the fixed state, the eighteen recorded choices, and computational checks of the stated proof grounds. These are checks performed on the drafting side, not independent verification. AI-assisted tools were used for drafting and review; responsibility for the adopted text and publication rests with the author. Files:• GST_v1.113_paper.pdf — main text.• GST_v1.113_supplement.pdf — supplementary material.• GST_v1.113_supplement.zip — main-text TXT, supplement TXT, README.txt, and MANIFEST.sha256 containing the SHA-256 checksums of those three files.
Author: Okino, Koji
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7225909127
