Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

PricingWithTips 3DM dependency: CLRSLean.Chapter_34.Section_34_4_NP_Completeness_Proofs.CookLevin.Circuitization.GeneratorTransitionWidenedFallbackMarkedDescriptors

Definition
PricingWithTips3DM_242f8497e98ec1ade577bf97

by qmaai2907271020 · Oct 22, 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_a39abcc00b238b2d99ed7809
import Definitions.Def_PricingWithTips3DM_7019935caab4d9733d34fc99
set_option autoImplicit true
set_option backward.isDefEq.respectTransparency.types false

/-!
# Marked widened-fallback descriptors from the raw verifier word

This is the concrete source boundary needed by descriptor-local stack-route
passes: the already verified raw-input affine source is followed by the fixed
seven-field row marker.
-/

noncomputable section

namespace CLRS.Chapter34.Turing.CookLevin

open PolyBuilder

/-- Every runtime widened-fallback progression descriptor, now with an outer
row marker suitable for descriptor-local streaming rewrites. -/
noncomputable def verifierTransitionWidenedFallbackMarkedDescriptorFrames
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L)
    (input : List Γ) : List UnaryFrameSym :=
  markAffineUnaryTripleProgressionRows
    (verifierTransitionWidenedFallbackDescriptorFrames W input)

/-- Exact marked descriptor semantics over every transition-row seed. -/
theorem verifierTransitionWidenedFallbackMarkedDescriptorFrames_eq
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L)
    (input : List Γ) :
    verifierTransitionWidenedFallbackMarkedDescriptorFrames W input =
      encodeAffineUnaryTripleProgressionMarkedFamily
        ((verifierTransitionRowSeeds W input).flatMap
          (transitionWidenedFallbackProgressions W.machine.tm)) := by
  unfold verifierTransitionWidenedFallbackMarkedDescriptorFrames
  rw [verifierTransitionWidenedFallbackDescriptorFrames_eq]
  exact markAffineUnaryTripleProgressionRows_encode _

/-- One fixed polynomial-time TM2 emits the marked descriptor family directly
from the original verifier input. -/
noncomputable def
    verifierTransitionWidenedFallbackMarkedDescriptorFrames_computableInPolyTime
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L) :
    _root_.Turing.TM2ComputableInPolyTime id id
      (verifierTransitionWidenedFallbackMarkedDescriptorFrames W) := by
  let composed :=
    _root_.Turing.TM2Comp.TM2ComputableInPolyTime.comp_scratch
      (verifierTransitionWidenedFallbackDescriptorFrames_computableInPolyTime W)
      markAffineUnaryTripleProgressionRows_computableInPolyTime
  let result := Classical.choice composed
  exact
    { tm := result.tm
      inputAlphabet := result.inputAlphabet
      outputAlphabet := result.outputAlphabet
      time := result.time
      outputsFun := fun input => by
        have run := result.outputsFun input
        simpa only [Function.comp_apply, id_eq,
          verifierTransitionWidenedFallbackMarkedDescriptorFrames] using run }

end CLRS.Chapter34.Turing.CookLevin
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