Word-RAM constructive geometry implies geometric paths
ProvedKSATSingleFlip.Connect.wordRAM_geometry_soundIf the model-specific word-RAM constructive predicate holds for a proper formula, then the same formula satisfies the geometric looseness and local-connectivity predicate on a common good set. A sparse representation exists for every proper formula, and the compact outputs expand to satisfying paths of the claimed lengths. This implication does not assert that the programs exist.
Preamble
import Definitions.Def_KSATSingleFlip_Connect_RAMLooseness open OAI.FixedClauseThreshold
Formal statement
namespace KSATSingleFlip.Connect
/-- Verified word-RAM flip and routing outputs imply the geometric claim. -/
theorem wordRAM_geometry_sound {n k m : ℕ} (F : Formula n k m)
(A B : WordRAMProgram) (cA cB : ℕ) (radius pathConstant : ℝ)
(h : HasRAMLooseLocalGeometry F A B cA cB radius pathConstant) :
HasLooseLocalGeometry k (ofFormula F) radius pathConstant := by
sorry
end KSATSingleFlip.Connect
Source
Formalization of Theorem 1.3, Wang, Yin, Yu, Zhang, Single-Variable Connectivity in Random k-SAT, printed p. 4 (PDF p. 6), STOC 2027 submission #737, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/737.pdf. The source does not specify this particular RAM instruction set.