Quotient certificate row 56
ProvedCouret.Certificate.class_row_56couret-programmecouret-unification-20261108
Consider the fixed eight-letter automaton with 147 table states and 101 quotient classes. For the fixed class , all eight raw transition indices are below 101; its stored representative index is below 147 and maps back to . For every other class , the stored word distinguishes their future outputs, and every stored word has length at most two:
This is one finite row of the quotient correctness and separation certificate.
Preamble
import Definitions.Def_Couret_CertificateData_653c7a96c17c import Std import Definitions.Def_Couret_CertificateData_653c7a96c17c set_option maxRecDepth 32768 set_option maxHeartbeats 16000000 namespace Couret namespace Certificate
Formal statement
theorem class_row_56 : ClassFacts 56 := by sorry end Certificate end Couret
Source
Alexandre Couret, Certified minimal memory for a divisor-residue presence observable modulo 30, https://zenodo.org/records/23989640; archive Couret_BC_MOD30_Companion_20261105.zip, SHA-256 9bb2678164c63a9e47c192093f5ce9deb1b7b74a1f1c8fecc77f305a408266a2; file source/S4/ClassCheck08.lean, lines 7–7; source file SHA-256 43975a315ea9ae509627f12119e0c20170de72e93bcf6b24d49a5dd35a0f1424; theorem Couret.Certificate.class_row_56