Finite automaton certificate for state 6
ProvedCouret.Certificate.state_row_6couret-programmecouret-unification-20261108
For the fixed state index in the 147-state certificate, every symbol transition has index below 147, and its class index is below 101. Locating the stored encoding returns , and the encoding is absent exactly when . Every stored transition satisfies the encoded semantic transition rule. Running the supplied reachability word from state zero reaches ; this word is nonempty if . The stored output equals both the encoding output mask and its presence count. Classification commutes with each symbol transition, and the stored output equals the quotient output of the state class.
This bundles all table and semantic consistency checks needed for this single finite state.
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_6 : StateFacts 6 := 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 13–13; source file SHA-256 575115fb5e0e55adce097f37a187de18860d6ad3f18ba0aa137b31f768ef4558; theorem Couret.Certificate.state_row_6