Haskell
Executable finite checks and counterexample contracts. They are not numerical simulations of the thermodynamic limit.
Executable research record
Haskell files test finite witnesses and reject invalid implications. Lean modules encode theorem interfaces and status boundaries. Reviews remain visible beside both.
Executable finite checks and counterexample contracts. They are not numerical simulations of the thermodynamic limit.
Formal library representations and interfaces. Their status modules keep proved statements separate from open obligations.
AGY reviews the papers. Claude independently reviews code and the formal artifacts.
Paper I
Established under explicit F-norm hypotheses
Paper II
Established objectwise; categorical scope is explicit
Paper III
Proposed packaging with established conditional analytic inputs
Paper IV
Controlled in free settings; a universal equivalence is open
Paper V
Explicit witnesses exist; general surjectivity is open
Paper S
Proposed spectrum; conditional assembly theorem
Corpus-level audits