Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Definition
PricingWithTips3DM_4de718643723c432564de3fd

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

/-!
# Recovering the physical dispatch-mux selector channel

The final four-way descriptor route stores one marked selector row after the
false, true, and coordinate rows of each transition seed.  This module selects
that fourth row and removes its outer marker.  The recovered bytes are proved
equal to the established raw-input selector frame stream.
-/

noncomputable section

namespace CLRS.Chapter34.Turing.CookLevin

open PolyBuilder

/-- Keep the selector row and erase the other three routed rows. -/
def transitionDispatchMuxInvocationDescriptorSelectorSelection : List Bool :=
  [false, false, false, true]

theorem transitionDispatchMuxInvocationDescriptorSelectorSelection_nonempty :
    0 < transitionDispatchMuxInvocationDescriptorSelectorSelection.length := by
  simp [transitionDispatchMuxInvocationDescriptorSelectorSelection]

/-- Physical marked stream containing only the selector row of each
transition seed. -/
noncomputable def
    verifierTransitionDispatchMuxInvocationDescriptorSelectorMarkedRows
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L)
    (input : List Γ) : List UnaryFrameSym :=
  rewriteUnaryFramePeriodicMarkedRows
    transitionDispatchMuxInvocationDescriptorSelectorSelection
    transitionDispatchMuxInvocationDescriptorSelectorSelection_nonempty
    (verifierTransitionDispatchMuxInvocationDescriptorFourWayRows W input)

/-- Periodic selection retains exactly one marked selector row per seed. -/
theorem
    verifierTransitionDispatchMuxInvocationDescriptorSelectorMarkedRows_eq
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L)
    (input : List Γ) :
    verifierTransitionDispatchMuxInvocationDescriptorSelectorMarkedRows
        W input =
      (verifierTransitionRowSeeds W input).flatMap fun seed =>
        encodeUnaryFrame (transitionDispatchSelectors W.machine.tm seed) ++
          [.frameEnd] := by
  unfold verifierTransitionDispatchMuxInvocationDescriptorSelectorMarkedRows
  rw [←
    verifierTransitionDispatchMuxInvocationDescriptorFourWayValueGroups_encoding_eq]
  rw [rewriteUnaryFramePeriodicMarkedRows_encode]
  have hgroups : ∀ group ∈
      verifierTransitionDispatchMuxInvocationDescriptorFourWayValueGroups
        W input,
      group.length =
        transitionDispatchMuxInvocationDescriptorSelectorSelection.length := by
    intro group hgroup
    have hlength :=
      verifierTransitionDispatchMuxInvocationDescriptorFourWayValueGroups_length
        W input group hgroup
    simpa [transitionDispatchMuxInvocationDescriptorFalseSelection,
      transitionDispatchMuxInvocationDescriptorSelectorSelection] using
        hlength
  rw [encodeUnaryFramePeriodicMarkedRowOutput_groups
    transitionDispatchMuxInvocationDescriptorSelectorSelection
    transitionDispatchMuxInvocationDescriptorSelectorSelection_nonempty _
    hgroups]
  unfold
    verifierTransitionDispatchMuxInvocationDescriptorFourWayValueGroups
  rw [List.flatMap_map]
  apply List.flatMap_congr
  intro seed hseed
  simp [transitionDispatchMuxInvocationDescriptorSelectorSelection,
    encodeUnaryFramePeriodicSelectedMarkedRows]

/-- The unified raw descriptor source followed by selector-row selection is
one concrete polynomial-time TM2. -/
noncomputable def
    verifierTransitionDispatchMuxInvocationDescriptorSelectorMarkedRows_computableInPolyTime
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L) :
    _root_.Turing.TM2ComputableInPolyTime id id
      (verifierTransitionDispatchMuxInvocationDescriptorSelectorMarkedRows
        W) := by
  let composed :=
    _root_.Turing.TM2Comp.TM2ComputableInPolyTime.comp_scratch
      (verifierTransitionDispatchMuxInvocationDescriptorFourWayRows_computableInPolyTime
        W)
      (unaryFramePeriodicMarkedRowFilter_computableInPolyTime
        transitionDispatchMuxInvocationDescriptorSelectorSelection
        transitionDispatchMuxInvocationDescriptorSelectorSelection_nonempty)
  change _root_.Turing.TM2ComputableInPolyTime id id
    (fun input => rewriteUnaryFramePeriodicMarkedRows
      transitionDispatchMuxInvocationDescriptorSelectorSelection
      transitionDispatchMuxInvocationDescriptorSelectorSelection_nonempty
      (verifierTransitionDispatchMuxInvocationDescriptorFourWayRows W input))
  simpa [Function.comp_def] using Classical.choice composed

/-- Ordinary selector frame stream recovered from the selected marked rows. -/
noncomputable def
    verifierTransitionDispatchMuxInvocationDescriptorSelectorFrames
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L)
    (input : List Γ) : List UnaryFrameSym :=
  unmarkAffineUnaryTripleProgressionRows
    (verifierTransitionDispatchMuxInvocationDescriptorSelectorMarkedRows
      W input)

/-- Marker removal recovers exactly the established selector source. -/
theorem verifierTransitionDispatchMuxInvocationDescriptorSelectorFrames_eq
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L)
    (input : List Γ) :
    verifierTransitionDispatchMuxInvocationDescriptorSelectorFrames W input =
      verifierTransitionDispatchSelectorFrames W input := by
  unfold verifierTransitionDispatchMuxInvocationDescriptorSelectorFrames
  rw [verifierTransitionDispatchMuxInvocationDescriptorSelectorMarkedRows_eq]
  rw [show
      (verifierTransitionRowSeeds W input).flatMap
          (fun seed =>
            encodeUnaryFrame (transitionDispatchSelectors W.machine.tm seed) ++
              [.frameEnd]) =
        ((verifierTransitionRowSeeds W input).map fun seed =>
          transitionDispatchSelectors W.machine.tm seed).flatMap
            (fun row => encodeUnaryFrame row ++ [.frameEnd]) by
      simp [List.flatMap_map]]
  rw [unmarkAffineUnaryTripleProgressionRows_markedValues]
  rw [verifierTransitionDispatchSelectorFrames_eq]
  congr 1

/-- A concrete polynomial-time TM2 follows the unified route, selects the
fourth physical channel, and emits the canonical selector frames. -/
noncomputable def
    verifierTransitionDispatchMuxInvocationDescriptorSelectorFrames_computableInPolyTime
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L) :
    _root_.Turing.TM2ComputableInPolyTime id id
      (verifierTransitionDispatchMuxInvocationDescriptorSelectorFrames W) := by
  let composed :=
    _root_.Turing.TM2Comp.TM2ComputableInPolyTime.comp_scratch
      (verifierTransitionDispatchMuxInvocationDescriptorSelectorMarkedRows_computableInPolyTime
        W)
      unmarkAffineUnaryTripleProgressionRows_computableInPolyTime
  change _root_.Turing.TM2ComputableInPolyTime id id
    (fun input => unmarkAffineUnaryTripleProgressionRows
      (verifierTransitionDispatchMuxInvocationDescriptorSelectorMarkedRows
        W input))
  simpa [Function.comp_def] 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