Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 2 min ago
Peer-reviewedCC BY 4.0Mathematics

Closed-Relational Reconstruction Systems: Viability, Observable-History Lifting, and Finite Obstruction Certificates

  1. 1Research Department, Silicon Minds Inc., Clarksville, MD 21029, USA

Abstract

A many-to-one observation can create a fictitious history by joining transitions that require incompatible hidden states. We study this problem for compact Hausdorff stage spaces with closed continuation relations and closed observational equivalences. Compactness identifies indefinite viability with viability at every finite horizon and makes every nonliftable infinite observable history detectable by a finite prefix. Exact successor congruence (ESC), a stage-dependent bisimulation condition, guarantees lifting from every initial representative. We also give a strictly weaker necessary-and-sufficient criterion for existence of some lift, formulated using reachable sets of compatible representatives. In finite time-homogeneous systems, a shortest obstruction has at most ∑y(2|q−1(y)|−1) transitions, making exhaustive verification finite. Arbitrary finite Markov kernels descend exactly when their aggregate probabilities agree within each source class; uniform successor counting is a special case. A complete partially observed control example computes viability, detects a spliced plan, repairs the abstraction, and verifies a nonuniform kernel. A separate common-action proposition distinguishes existential realizability from admissibility for every retained candidate. The contribution is a unified history-level audit and its explicit criteria and certificates, built on classical inverse-limit, bisimulation, lumpability, and subset-construction methods. Physical reconstruction and Reconstruction Before Control motivate the framework; their empirical validity remains outside these model-relative guarantees.

Related

  1. Universal Semisimple Reconstruction and Obstruction Theory
    Joe Gildea
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  2. Optimizing Explicit Unit-Distance Lower-Bound Certificates
    Michael T. M. Emmerich
    arXiv (Cornell University)PreprintLicence not statedFull text9 citedCombinatorics & discrete mathematicsOpenAlex
  3. Unique Normal Forms: Proof-Graph Counterexamples, Infinite-Carrier Certificates, and Confluence Repair
    Moses Rahnama
    HALPreprintLicence not statedLogic & foundationsHAL
  4. Sum-of-Squares Certificates for Copositive Matrices via Recursive Identities: The de Klerk-Pasechnik Conjecture and Hoffman-Pereira Matrices
    Jineon Baek, Luis Felipe Vargas
    HALPreprintarXiv licenceFull textOptimisation & controlHALarXiv
  5. Task-aware Kernel Stein certificates for Rényi differential privacy
    Leoni Carla Wirth, Tara Trauthwein, Gesine Reinert
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@article{li2026closedrelational,
  title = {{Closed-Relational Reconstruction Systems: Viability, Observable-History Lifting, and Finite Obstruction Certificates}},
  author = {Bin Li},
  journal = {Mathematics},
  year = {2026},
  month = oct,
  doi = {10.3390/math14213883},
  url = {https://www.mdpi.com/2227-7390/14/21/3883},
  note = {CC BY 4.0},
}
RIS
TY  - JOUR
TI  - Closed-Relational Reconstruction Systems: Viability, Observable-History Lifting, and Finite Obstruction Certificates
AU  - Bin Li
PY  - 2026
DA  - 2026/10/24
JO  - Mathematics
DO  - 10.3390/math14213883
UR  - https://www.mdpi.com/2227-7390/14/21/3883
AB  - A many-to-one observation can create a fictitious history by joining transitions that require incompatible hidden states. We study this problem for compact Hausdorff stage spaces with closed continuation relations and closed observational equivalences. Compactness identifies indefinite viability with viability at every finite horizon and makes every nonliftable infinite observable history detectable by a finite prefix. Exact successor congruence (ESC), a stage-dependent bisimulation condition, guarantees lifting from every initial representative. We also give a strictly weaker necessary-and-sufficient criterion for existence of some lift, formulated using reachable sets of compatible representatives. In finite time-homogeneous systems, a shortest obstruction has at most ∑y(2|q−1(y)|−1) transitions, making exhaustive verification finite. Arbitrary finite Markov kernels descend exactly when their aggregate probabilities agree within each source class; uniform successor counting is a special case. A complete partially observed control example computes viability, detects a spliced plan, repairs the abstraction, and verifies a nonuniform kernel. A separate common-action proposition distinguishes existential realizability from admissibility for every retained candidate. The contribution is a unified history-level audit and its explicit criteria and certificates, built on classical inverse-limit, bisimulation, lumpability, and subset-construction methods. Physical reconstruction and Reconstruction Before Control motivate the framework; their empirical validity remains outside these model-relative guarantees.
SN  - 2227-7390
ER  -