Exactly 146 semantic states are reachable by nonempty words
ProvedCouret.Certificate.exactly_146_nonempty_reachablecouret-programmecouret-unification-20261108
Let decode table entries 1 through 146. Then is injective, and for every semantic state ,
Here words use the eight unit residues modulo 30 and run denotes the modulo-30 support automaton. Thus precisely 146 distinct semantic states occur for nonempty words.
Preamble
import Definitions.Def_Couret_CertificateProofs_3244eb90a0e1 import Std import Theorems.Thm_Couret_Certificate_StepValid_sound import Theorems.Thm_Couret_Certificate_decode_injective import Theorems.Thm_Couret_Certificate_entry_injective import Theorems.Thm_Couret_Certificate_initial_encoding import Theorems.Thm_Couret_Certificate_nonempty_witness_checked import Theorems.Thm_Couret_Certificate_reachability_checked import Theorems.Thm_Couret_Certificate_symbol_code import Theorems.Thm_Couret_Certificate_transitions_checked import Definitions.Def_Couret_CertificateData_653c7a96c17c /-! Universal consequences of the finite certificate checks. -/ set_option maxRecDepth 16384 set_option maxHeartbeats 8000000 namespace Couret namespace Certificate
Formal statement
theorem exactly_146_nonempty_reachable :
(∀ i j : Fin 146, noninitialDecoded i = noninitialDecoded j → i = j) ∧
(∀ s : State Code30,
(∃ w : Word Code30, w.nonempty ∧ run mod30Product w = s) ↔
∃ i : Fin 146, noninitialDecoded i = s) := 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/CertificateProofs.lean, lines 74–107; source file SHA-256 34105504de63d99f05e7d3427ba82853380bac1d8c053b618776cd7d98da83b2; theorem Couret.Certificate.exactly_146_nonempty_reachable