Finite-state certificate facts for state 0
ProvedCouret.Certificate.state_row_0couret-programmecouret-unification-20261108
For state of the specified 147-state automaton over eight symbols: every transition index is less than 147; its quotient-class index is less than 101; locating its encoded entry returns ; the entry is empty exactly when ; every symbol transition satisfies the encoded semantic step relation; and running its prescribed reachability word from state zero reaches . That word is nonempty if . The tabulated output equals both the output-mask observation and the presence count. For every symbol, taking its transition and then its quotient class equals taking the quotient transition, and the state output equals its class output.
This certifies a single explicit automaton row, including its reachability and semantic consistency.
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 state_row_0 : StateFacts 0 := 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/StateCheck00.lean, lines 7–7; source file SHA-256 575115fb5e0e55adce097f37a187de18860d6ad3f18ba0aa137b31f768ef4558; theorem Couret.Certificate.state_row_0