Automaton certificate state row 71
ProvedCouret.Certificate.state_row_71couret-programmecouret-unification-20261108
For the fixed table state in the 147-state, eight-letter automaton, every raw next-state index is below 147 and its raw quotient class is below 101. The stored encoding locates back to and is empty exactly when . Every letter step is semantically valid; the stored reachability word reaches from zero and is nonempty if . The stored output equals both the encoded output-mask count and the semantic presence count. Finally the quotient map respects transitions and output:
This records the full state-row certificate, including bounds, semantics, reachability and quotient compatibility.
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_71 : StateFacts 71 := 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/StateCheck10.lean, lines 8–8; source file SHA-256 3ef2e39f209468ddadb1b425afb235c7e156f84a03d7338a14e6d439b25426f4; theorem Couret.Certificate.state_row_71