Skip to content

Mathematics Publication Status & Maturity Register

Formal Verification Lifecycle (M0–M5), Proof Obligations & Publication State

Spine Position

Mathematics Root · Mathematics Publication Status & Maturity Register

Public Status Boundary. This register defines the procedural maturity tiers (M0–M5) for all mathematical theorems, conjectures, and proof obligations across the corpus. Moving a theorem candidate into an active tier indicates formalization progress within our Lean 4 pipeline, not independent journal acceptance.


1. The M0–M5 Mathematical Maturity Scale

To prevent premature equivalence between heuristic derivations and verified proofs, every mathematical claim in the corpus is indexed according to a strict 6-stage maturity ladder:

TierClassificationDefinitionVerification Threshold
M0Conjectural ExtractUnparsed mathematical notes and initial relational formulations.Raw notebook extraction.
M1Syntactically CleanExplicit algebraic notation with all variables, operators, and domains specified.Dimensional & type validation.
M2Analytically DerivedClosed-form analytical proof consistent with corpus axioms.Internal peer derivation.
M3Machine VerifiedFully verified in Lean 4 with 0 sorry and 0 unproven axioms.Clean lake build output.
M4Numerically CheckedDiscretized numerical simulation stress-testing stability and residual bounds.Solver convergence (pnull=0.62).
M5Published & SealedPeer-reviewed external publication or public registered manuscript package.Standalone LaTeX / DOI artifact.

2. Active Formalization Portfolio

  • Machine-Verified Core (M3): 28 Lean 4 machine-verified proofs across 9 formal modules (Fabrica.ObserverKnot, Fabrica.InvariantEngineering, Fabrica.TraceReciprocity, Fabrica.FFE, Fabrica.FQFT, Fabrica.PGP, Fabrica.ObserverMonad, Fabrica.Fabricon, and Fabrica.Realica).
  • Standalone Manuscript Packages (M5):
    • Manuscript B (fqft-continuum-core): Dirichlet forms with operator-valued potentials.
    • Manuscript D (identifiability-obstructions): Negative identifiability theorems and singular Fisher information.

3. Canonical Continuations

DirectionNodeRouteFocus / Purpose
Proof GatewayLean 4 Formalization Roadmap/04-mathematics/formalization-roadmap28 machine-verified theorem records and lemma dependency DAGs
Proof GovernanceProof Governance & Verification Scale/04-mathematics/proof-governanceSix-stage M0–M5 verification and publication lifecycle
Review GatewayMathematical Review Gateway/04-mathematics/review-gatewayInteractive verification readiness dashboard and atlas
SFR Review PortalSFR Public Review Portal/03-research/sfr-review-portal/Dedicated scholarly manuscripts and reviewer dossiers
EXTERNAL REFERENCE

Prerequisites
None
Current
PUBLICATION STATUS
Enables
None

Continuity Engine