Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Definition
PricingWithTips3DM_d45ede390e2ec9beab47cf24

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_aa162841a84ceac12b7dc683
set_option autoImplicit true
set_option backward.isDefEq.respectTransparency.types false

/-!
# Occurrence compatibility edges: all outer iterations

This file iterates the verified one-row outer loop over an arbitrary family of
indexed occurrences.  The formula-specific identification with the canonical
normalized edge enumeration is deliberately kept for a later semantic file.
-/

noncomputable section

open StateTransition

namespace CLRS
namespace Chapter34
namespace Turing
namespace TMClique

open PolyBuilder

/-- Edge encoding accumulated by exhausting an explicitly ordered outer-loop
row family.  Later iterations prepend their edges, exactly as the output stack
does. -/
def encodeCompatibleOccurrenceIterations :
    List (IndexedOccurrence × Nat) → List CliqueSym
  | [] => []
  | current :: priors =>
      encodeCompatibleOccurrenceIterations priors ++
        encodeCompatibleOccurrenceEdges current priors.reverse

/-- Exact accumulated budget for exhausting every outer-loop row. -/
def compatibilityEdgesOuterIterationsSteps :
    List (IndexedOccurrence × Nat) → Nat
  | [] => 0
  | current :: priors =>
      compatibilityEdgesOuterIterationSteps current priors +
        compatibilityEdgesOuterIterationsSteps priors

/-- Starting from a clean outer-loop boundary, all rows are consumed, their
compatible edges are accumulated, and the controller returns to the same
clean boundary with both work stacks empty. -/
def compatibilityEdges_outerIterationsRun
    (entries : List (IndexedOccurrence × Nat)) (output : List CliqueSym) :
    EvalsToInTime (step compatibilityEdgesProgram)
      (compatibilityEdgesCfg .outer none none false [] output
        (encodeIndexedOccurrenceEntries entries) [] 0 0 0)
      (some (compatibilityEdgesCfg .outer none none false []
        (encodeCompatibleOccurrenceIterations entries ++ output)
        [] [] 0 0 0))
      (compatibilityEdgesOuterIterationsSteps entries) := by
  induction entries generalizing output with
  | nil =>
      exact ⟨⟨0, by
        simp [encodeIndexedOccurrenceEntries,
          encodeCompatibleOccurrenceIterations]⟩, le_rfl⟩
  | cons current priors ih =>
      have first := compatibilityEdges_outerIterationRun current priors output
        none none false
      have rest := ih
        (output := encodeCompatibleOccurrenceEdges current priors.reverse ++
          output)
      let full := EvalsToInTime.trans (step compatibilityEdgesProgram)
        (compatibilityEdgesOuterIterationSteps current priors)
        (compatibilityEdgesOuterIterationsSteps priors) _ _ _ first rest
      simpa [encodeIndexedOccurrenceEntries,
        encodeCompatibleOccurrenceIterations,
        compatibilityEdgesOuterIterationsSteps, List.append_assoc,
        Nat.add_assoc, Nat.add_comm, Nat.add_left_comm] using full

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