Falsifiability Index & Empirical Boundaries
Empirical Falsification Criteria, Computational Failure Modes & Negative Identifiability
Spine Position
Mathematics Root · Falsification Metrics, Inverse Problems & Identifiability Safeguards
Public Status Boundary. This index establishes the rigorous mathematical, computational, and empirical criteria under which theoretical models in the Science of Fabric Reality are definitively falsified. It enforces negative identifiability theorems (
OBJ-PRG-NEG), the canonical negative permutation result (), and strict limits on parameter inference.
1. The Tripartite Falsification Architecture
To avoid category errors, the corpus strictly distinguishes three distinct modes of failure:
- Internal Model Failure (Logical / Axiomatic): Occurs when a theoretical proposition yields a mathematical contradiction, topological inconsistency, or boundary violation within its own formal framework.
- Computational Failure (Numerical / Discretization): Occurs when a numerical solver or algorithmic simulation fails to converge, violates error bounds (
), or introduces unphysical lattice artifacts on the computational axis ( ). A failed simulation falsifies an implementation or discretization model; it does not automatically falsify nature. - Empirical Falsification (Observational / Physical): Occurs when a prospective prediction (
) with an established observation bridge contradicts experimental measurements ( ) conducted by independent researchers.
2. Core Falsification Criteria
A candidate mathematical proposition or physical model within the corpus is falsified under any of the following explicit conditions:
- Topological Conservation Violation: If a discrete lattice evolution exhibits uncompensated divergence in winding number or topological boundary closure (
). - Continuum Recovery Failure: If discrete graph Laplacians fail to converge strongly in the resolvent sense to the continuous Laplacian
under mesh refinement: - Lorentz Violation Bounds: If discrete metric-measure dispersion relations exceed ultra-precise empirical vacuum constraints established by high-energy astrophysical observations.
- Parameter Over-Identification Failure: If a model asserts prospective physical predictions from an underdetermined parameter space without satisfying the rank condition
.
3. Negative Identifiability Theorems & Epistemic Firewalls
To prevent ungrounded claims of predictive power, the corpus prominently surfaces four foundational negative theorems:
| Negative Result ID | Formal Mathematical Statement | Epistemic Firewall Consequence |
|---|---|---|
NEG-KP-R1-SPECTRAL-INCOMPLETE-01 | Degree regularity ( | Graph regularity alone is insufficient to predict particle mass hierarchies. |
NEG-P2-PULLBACK-UNDERDET-01 | Pullback mapping | Reconstructing microscopic graph topology from boundary Green functions is ill-posed without phase constraints. |
NEG-P2-DIRECT-KP-PATH-01 | Direct graph paths do not uniquely determine physical observables without explicit source state | Coupling observables require the full pair |
NEG-P2-C3-P4-UNDERDET-01 | Parameter-to-observable Jacobian rank deficiency: | The 3-parameter charged-lepton model is an exact retrodiction ( |
Null Analysis Result
The permutation result NULL_ANALYSIS_RESULT and calibrated negative benchmark. It demonstrates model rank deficiency and parameter underdetermination rather than constituting an independent predictive physical constant.
Primary Inverse-Problem & Identifiability Anchors. The mathematical analysis of rank-deficient Jacobians and ill-posed parameter estimation follows:
- Aster, R. C., Borchers, B., & Thurber, C. H. (2018). Parameter Estimation and Inverse Problems. Elsevier. DOI: 10.1016/C2016-0-03820-2.
- Gutenkunst, R. N., et al. (2007). Universally Sloppy Parameter Sensitivities in Systems Biology Models. PLOS Comput. Biol., 3(10), e189. DOI: 10.1371/journal.pcbi.0030189.
4. Canonical Continuations
| Direction | Node | Route | Focus / Purpose |
|---|---|---|---|
| Empirical Ledger | Scientific Results Ledger | /science/results | 35 machine-verified Lean 4 theorems, null analysis result ( |
| Proof Governance | Proof Governance & Verification Scale | /04-mathematics/proof-governance | Canonical orthogonal status coordinates |
| Formal Roadmap | Lean 4 Formalization Roadmap | /04-mathematics/formalization-roadmap | Operational pipeline stages and 35 machine-verified theorem records |
| Axioms Register | Constitutional Axioms & Object Register | /04-mathematics/axioms | Formally typed axioms, definitions, and quarantined proposals |