Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite automaton certificate for state 3

Proved
Couret.Certificate.state_row_3

by alexcour · Nov 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

couret-programmecouret-unification-20261108

For the fixed state index i=3i=3i=3 in the 147-state certificate, every symbol transition has index below 147, and its class index is below 101. Locating the stored encoding returns iii, and the encoding is absent exactly when i=0i=0i=0. Every stored transition satisfies the encoded semantic transition rule. Running the supplied reachability word from state zero reaches iii; this word is nonempty if i≠0i\ne0i=0. 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.

run⁡(0,wi)=i.\operatorname{run}(0,w_i)=i.run(0,wi​)=i.

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_3 : StateFacts 3 := 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 10–10; source file SHA-256 575115fb5e0e55adce097f37a187de18860d6ad3f18ba0aa137b31f768ef4558; theorem Couret.Certificate.state_row_3

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me