Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Definition
PricingWithTips3DM_a1c02e7eaac6891e9c299d1d

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_40dbd9fca02c36e68f0b8897
import Definitions.Def_PricingWithTips3DM_cc729d176793316810a31247
set_option autoImplicit true
set_option backward.isDefEq.respectTransparency.types false

/-!
# Final false-arm label rows from the label-major source

The fourth row of every label-major packet has already been recovered as the
canonical false-arm progression descriptor stream.  Here those descriptors
are executed as singleton groups, projected to their first coordinates, and
merged according to the fixed false-arm label boundary period.
-/

noncomputable section

namespace CLRS.Chapter34.Turing.CookLevin

open PolyBuilder

/-- Execute every label-major false descriptor and retain one temporary
marker per affine span. -/
noncomputable def
    verifierTransitionDispatchMuxInvocationLabelMajorFalseRawMarkedFrames
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L)
    (input : List Γ) : List UnaryFrameSym :=
  projectUnaryTripleGroupFirst
    (affineUnaryTripleProgressionFixedGroupFrameStream 0
      ((verifierTransitionRowSeeds W input).flatMap
        (transitionDispatchFalseArmProgressions W.machine.tm)))

/-- Progression execution and first-coordinate projection form a concrete
polynomial-time continuation of the label-major false source. -/
noncomputable def
    verifierTransitionDispatchMuxInvocationLabelMajorFalseRawMarkedFrames_computableInPolyTime
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L) :
    _root_.Turing.TM2ComputableInPolyTime id id
      (verifierTransitionDispatchMuxInvocationLabelMajorFalseRawMarkedFrames
        W) := by
  let descriptors :=
    verifierTransitionDispatchMuxInvocationLabelMajorFalseFrames_computableInPolyTime
      W
  let structured : _root_.Turing.TM2ComputableInPolyTime id
      encodeAffineUnaryTripleProgressionFamily
      (fun input =>
        (verifierTransitionRowSeeds W input).flatMap
          (transitionDispatchFalseArmProgressions W.machine.tm)) :=
    { tm := descriptors.tm
      inputAlphabet := descriptors.inputAlphabet
      outputAlphabet := descriptors.outputAlphabet
      time := descriptors.time
      outputsFun := fun input => by
        have run := descriptors.outputsFun input
        simpa only [id_eq,
          verifierTransitionDispatchMuxInvocationLabelMajorFalseFrames_eq_existing,
          verifierTransitionDispatchMuxInvocationDescriptorFalseFrames_eq]
          using run }
  let executed :=
    _root_.Turing.TM2Comp.TM2ComputableInPolyTime.comp_scratch structured
      (affineUnaryTripleProgressionFixedGroupFrameStream_computableInPolyTime 0)
  let projected :=
    _root_.Turing.TM2Comp.TM2ComputableInPolyTime.comp_scratch
      (Classical.choice executed)
      projectUnaryTripleGroupFirst_computableInPolyTime
  let result := Classical.choice projected
  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,
          verifierTransitionDispatchMuxInvocationLabelMajorFalseRawMarkedFrames]
          using run }

/-- Merge widened-fallback span markers and retain one marker per final
dispatch label. -/
noncomputable def
    verifierTransitionDispatchMuxInvocationLabelMajorFalseLabelFrames
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L)
    (input : List Γ) : List UnaryFrameSym :=
  rewriteUnaryFramePeriodicBoundaries
    (transitionDispatchFalseArmLabelBoundarySelection W.machine.tm)
    (transitionDispatchFalseArmLabelBoundarySelection_nonempty W.machine.tm)
    (verifierTransitionDispatchMuxInvocationLabelMajorFalseRawMarkedFrames
      W input)

/-- The label-major route recovers exactly the established final false label
channel. -/
theorem verifierTransitionDispatchMuxInvocationLabelMajorFalseLabelFrames_eq_existing
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L)
    (input : List Γ) :
    verifierTransitionDispatchMuxInvocationLabelMajorFalseLabelFrames W input =
      verifierTransitionDispatchMuxInvocationDescriptorFalseLabelFrames
        W input := by
  rfl

/-- The complete label-major false-arm route is one concrete polynomial-time
TM2 from the original verifier word. -/
noncomputable def
    verifierTransitionDispatchMuxInvocationLabelMajorFalseLabelFrames_computableInPolyTime
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L) :
    _root_.Turing.TM2ComputableInPolyTime id id
      (verifierTransitionDispatchMuxInvocationLabelMajorFalseLabelFrames W) := by
  let composed :=
    _root_.Turing.TM2Comp.TM2ComputableInPolyTime.comp_scratch
      (verifierTransitionDispatchMuxInvocationLabelMajorFalseRawMarkedFrames_computableInPolyTime
        W)
      (unaryFramePeriodicBoundaryFilter_computableInPolyTime
        (transitionDispatchFalseArmLabelBoundarySelection W.machine.tm)
        (transitionDispatchFalseArmLabelBoundarySelection_nonempty
          W.machine.tm))
  change _root_.Turing.TM2ComputableInPolyTime id id
    (fun input => rewriteUnaryFramePeriodicBoundaries
      (transitionDispatchFalseArmLabelBoundarySelection W.machine.tm)
      (transitionDispatchFalseArmLabelBoundarySelection_nonempty
        W.machine.tm)
      (verifierTransitionDispatchMuxInvocationLabelMajorFalseRawMarkedFrames
        W input))
  simpa [Function.comp_def,
    verifierTransitionDispatchMuxInvocationLabelMajorFalseLabelFrames]
    using Classical.choice composed

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