Testing a vertex against the front of its group
ProvedDirKECC1549.Asm.ls4_specFor that are -edge-connected, the four local searches ls4 (both directions, in and ) end with outcome TestOut: either a found set separating and is stored (a -out set of volume in or ), or and are -connected; time at most .
Context. This lemma belongs to the machine-checked word-RAM implementation of Lemma 1 (p.11): Algorithm 1 refining by small -out sets, with the deterministic local search of [GKK+26, Proposition 6] (FindOutPaths and recursive path reversals). The program is written in the structured language Stmt compiled to the published word-RAM; Run E s mem Q states that the statement s, started on mem, reaches its end in a state satisfying Q t mem' within t ticks. The input cells double as registers; they are saved at SV and read through the image ImgAt. All definitions are in the Definitions.Def_DirKECC1549_Impl_* modules.
import Definitions.Def_DirKECC1549_Impl_L1Alg2
set_option autoImplicit false
open WordRAM Classical Finset
open DirKECC1549.Main DirKECC1549.Main.CostAux
open DirKECC1549 DirKECC1549.Asm
variable {w : Width} {n m : ℕ}theorem DirKECC1549.Asm.ls4_spec (E : Env) (orig : Memory w) (hm : 0 < m) (P : LP) (OR PR IR HR TR : ℕ)
(G : Fin m → Fin n × Fin n) (σ τ : Equiv.Perm (Fin m)) (K Δ FR W k : ℕ)
(hst : AlgStat P OR PR IR HR TR orig G σ τ) (hL : LsLay P n m K Δ FR W w.bits)
(hE : EnvOK E lsBody) (hs : ∀ x ∈ E.sites, x < 2 ^ w.bits) (hk : K = k - 1) (hk2 : 2 ≤ k)
(f x : Fin n) (hfx : f ≠ x) (hkec : KEdgeConnected K G f x) (mm : Memory w)
(hSI : SI (m := m) P OR PR IR HR TR FR K Δ W orig mm mm f x) :
Run E ls4 mm (fun t mm' => SI (m := m) P OR PR IR HR TR FR K Δ W orig mm mm' f x ∧ TestOut P k Δ G f x mm' ∧
t ≤ 4 * lsTT K Δ E.sites.length K + 240) := by sorry