Quotient certificate facts for class 13
ProvedCouret.Certificate.class_row_13couret-programmecouret-unification-20261108
For class in the specified 101-class quotient automaton over eight input symbols, all next-state indices are less than 101, its representative index is less than 147, and that representative belongs to class . For each different class , the prescribed separating word gives different final outputs when run from and ; for every class , that word has length at most two.
This certifies one row of the explicit quotient and its distinguishing-word table.
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_13 : ClassFacts 13 := 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/ClassCheck01.lean, lines 13–13; source file SHA-256 e18436e83333c440ba569a448ec44f2aef18f3b5ab1ed17a044031a07cb1ec92; theorem Couret.Certificate.class_row_13