Protected-State-Correction-Theory
Protected-State Correction Theory
This repository develops a theorem-first recoverability program for declared triples (A, M, T) of admissible family, record map, and target map. The core criterion is exact target recoverability under constrained observation, with explicit failure and minimal-augmentation structure on declared classes.
Strongest current contribution: restricted anti-classifier results (OCP-049 to OCP-053) that rule out amount-only exact classification on supported families using executable witness catalogs.
Adopted backbone is stated as known: factorization and fiber-constancy logic, restricted-linear row-space/kernel criteria, and standard observability/identifiability framing. Promoted novelty is branch-limited and labeled by scope.
Scope
The program treats exactness, impossibility, and repair under constrained records. It does not claim a universal scalar recoverability law and does not promote branch-limited diagnostics as universal invariants.
Primary Results and Anchors
- Theorem spine
- No-go spine
- Strongest restricted lane
- Restricted linear fiber theory
- Descriptor-fiber branch paper
Representative witnesses retained as active evidence:
- same-rank opposite-verdict constructions against rank-only language,
- bounded-domain projection failures under boundary incompatibility,
- family-enlargement and model-mismatch instability witnesses.
Repository Lanes
- Theorem core
- Restricted results
- Methods and diagnostics
- Validation and evidence
- Physics translation
- Meta-governance and claim scope
Reading Path
License
MIT - see LICENSE.