Generative Structural Theory v1.139 — Deleting Any Set of Witnesses: Strong Connectivity and K′-Side Cross-Port States
Year: 2026
Type: preprint
Abstract: This version proves that deleting any set of witnesses preserves strong connectivity after one pair is added to an inclusion-minimal strongly connected relation.Let R be an inclusion-minimal strongly connected relation on a finite set U, and let t = (x,y) be a pair not in R, with x ≠ y. Define the witness set T(R,t) to consist of those pairs g in R for which (R ∪ {t}) \ {g} remains strongly connected. Theorem G establishes that (R ∪ {t}) \ S is strongly connected for every subset S of T(R,t), extending the two-witness result of v1.137 to any number of witnesses. Consequently, for every nonempty deletion set Δ ⊆ R, the relation (R ∪ {t}) \ Δ is inclusion-minimal strongly connected if and only if Δ = T(R,t).In the leaf-lift setting of v1.137–v1.138, this yields a complete criterion for K′-side cross-port intermediate states at a cross pair t not in K′. Writing F = K′ \ K, the state B′(Δ′) = (K′ \ Δ′) ∪ {(x,v),(v,y)} gives a legal two-step connection under deletion budget two if and only if T(K′,t) ⊆ F and Δ′ = T(K′,t). Whenever it exists, this state is unique within the specified form and has deletion counts (2,1), attaining both the minimum of two transitions and the lower bound of three total deletions. The criterion includes the empty witness set and settles the case of three or more witnesses left unclassified in v1.138.A four-vertex example exhibits three witnesses for a general minimal relation. The existence of a leaf-lift configuration satisfying the endpoint conditions and having three or more witnesses at a cross pair remains open. Other forms of intermediate states, longer connections, and the global two-deletion-chain question (Q1) are not resolved.The distribution includes the paper in PDF and plain-text formats, a verification appendix, a README, and a SHA-256 manifest. The appendix checks file integrity and agreement between the plain text and the text extracted from the PDF; these checks do not constitute verification of the mathematics.
Author: Okino, Koji
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7233741108
