Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

PricingWithTips 3DM dependency: CLRSLean.Chapter_34.Section_34_4_NP_Completeness_Proofs.GeneralClique.OccurrenceReduction.Machine.CompatibilityEdgesTermination

Definition
PricingWithTips3DM_8fb65f62dc7f7936c2bf07db

by qmaai2907271020 · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theorypricing-with-tipsthree-dimensional-matching

A private, kernel-checked dependency module used by the formal NP-hardness proof for three-dimensional matching and Theorems 4.1 and 4.2 of arXiv:2507.10872.

Definition code
import Definitions.Def_PricingWithTips3DM_605d537983b61208617f371b
set_option autoImplicit true
set_option backward.isDefEq.respectTransparency.types false

/-!
# Occurrence compatibility edges: complete terminating run

The verified loader, all outer iterations, the empty-stack boundary, and the
successful halt are composed here into one formula-level controller theorem.
-/

noncomputable section

open StateTransition

namespace CLRS
namespace Chapter34
namespace Turing
namespace TMClique

open PolyBuilder

/-- Exact step budget of the complete compatibility-edge controller on one
semantic formula. -/
def compatibilityEdgesSteps (formula : CNF) : Nat :=
  compatibilityEdgesLoadRowsSteps (indexedOccurrences formula).zipIdx +
    compatibilityEdgesOuterIterationsSteps
      (indexedOccurrences formula).zipIdx.reverse + 3

/-- The complete fixed controller consumes canonical occurrence rows, emits
exactly the canonical occurrence-graph edge suffix, clears all scratch state,
and halts successfully. -/
def compatibilityEdges_run (formula : CNF) :
    EvalsToInTime (step compatibilityEdgesProgram)
      (initialCfg compatibilityEdgesProgram
        (encodeIndexedOccurrenceRows formula))
      (some (haltCfg compatibilityEdgesProgram
        (encodeOccurrenceCliqueEdges formula)))
      (compatibilityEdgesSteps formula) := by
  have loaded := compatibilityEdges_loadCanonicalCleanRun formula
  have iterations := compatibilityEdges_outerIterationsRun
    (indexedOccurrences formula).zipIdx.reverse []
  have stop : EvalsToInTime (step compatibilityEdgesProgram)
      (compatibilityEdgesCfg .outer none none false []
        (encodeCompatibleOccurrenceIterations
          (indexedOccurrences formula).zipIdx.reverse)
        [] [] 0 0 0)
      (some (compatibilityEdgesCfg .halt none none false []
        (encodeCompatibleOccurrenceIterations
          (indexedOccurrences formula).zipIdx.reverse)
        [] [] 0 0 0)) 1 :=
    ⟨⟨1, rfl⟩, le_rfl⟩
  have halt : EvalsToInTime (step compatibilityEdgesProgram)
      (compatibilityEdgesCfg .halt none none false []
        (encodeCompatibleOccurrenceIterations
          (indexedOccurrences formula).zipIdx.reverse)
        [] [] 0 0 0)
      (some (haltCfg compatibilityEdgesProgram
        (encodeCompatibleOccurrenceIterations
          (indexedOccurrences formula).zipIdx.reverse))) 1 :=
    ⟨⟨1, rfl⟩, le_rfl⟩
  let first := EvalsToInTime.trans (step compatibilityEdgesProgram)
    (compatibilityEdgesLoadRowsSteps
      (indexedOccurrences formula).zipIdx + 1)
    (compatibilityEdgesOuterIterationsSteps
      (indexedOccurrences formula).zipIdx.reverse)
    _ _ _ loaded iterations
  let second := EvalsToInTime.trans (step compatibilityEdgesProgram)
    _ 1 _ _ _ first (by simpa using stop)
  let full := EvalsToInTime.trans (step compatibilityEdgesProgram)
    _ 1 _ _ _ second halt
  convert full using 1 <;>
    simp [compatibilityEdgesSteps,
      encodeCompatibleOccurrenceIterations_canonical]
  omega

end TMClique
end Turing
end Chapter34
end CLRS
Source
https://github.com/tanktechnology/CLRS-Lean

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