Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Definition
PricingWithTips3DM_5ec6efe3c13ebba9e8487e8d

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

/-!
# Closed coordinates of the final transition outputs

Each local transition circuit ends in one final AND gate.  Its output is
therefore the last wire in a fixed-cost transition block.  This module gives
the subtraction-free polynomial offset and specializes the family coordinate
formula to verifier instances.
-/

noncomputable section

namespace CLRS.Chapter34.Turing.CookLevin

open PolyBuilder

/-- Last-wire offset of one local transition circuit. -/
def transitionCircuitOutputOffsetPolynomial
    (tm : _root_.Turing.FinTM2) : Polynomial Nat :=
  2 + dispatchGatePolynomial tm +
    Polynomial.C (Fintype.card tm.K * maxPushesPerStep tm + 2) +
    (Polynomial.C 6 * cfgBitPolynomial tm + 1)

/-- The transition output offset is exactly one less than the full local
transition cost at every positive workspace height. -/
theorem transitionCircuitOutputOffsetPolynomial_eval_add_one
    (tm : _root_.Turing.FinTM2) (H : Nat)
    (hwork : 0 < workHeight tm H) :
    (transitionCircuitOutputOffsetPolynomial tm).eval H + 1 =
      transitionCircuitGateCost tm H := by
  rw [← transitionCircuitGatePolynomial_eval tm H hwork]
  simp [transitionCircuitOutputOffsetPolynomial,
    transitionCircuitGatePolynomial, Polynomial.eval_add,
    Polynomial.eval_mul]

/-- Input-length polynomial for the output offset of one verifier transition. -/
def verifierTransitionOutputOffsetPolynomial
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L) :
    Polynomial Nat :=
  (transitionCircuitOutputOffsetPolynomial W.machine.tm).comp
    (verifierHeight W)

@[simp] theorem verifierTransitionOutputOffsetPolynomial_eval_add_one
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L) (n : Nat) :
    (verifierTransitionOutputOffsetPolynomial W).eval n + 1 =
      transitionCircuitGateCost W.machine.tm
        ((verifierHeight W).eval n) := by
  rw [verifierTransitionOutputOffsetPolynomial, Polynomial.eval_comp,
    transitionCircuitOutputOffsetPolynomial_eval_add_one]
  exact Nat.add_pos_left (verifierHeight_eval_pos W n)
    (maxPushesPerStep W.machine.tm)

/-- Closed coordinate of every semantic verifier-transition output. -/
theorem verifierTransitions_output_eq
    {Γ : Type} {L : Language Γ} (W : VerifierWitness L)
    (input : List Γ)
    (step : Fin ((verifierHorizon W).eval input.length)) :
    (verifierTransitions W input).outputs step =
      (verifierTransitionStartPolynomial W).eval input.length +
        step.val * transitionCircuitGateCost W.machine.tm
          ((verifierHeight W).eval input.length) +
        (verifierTransitionOutputOffsetPolynomial W).eval input.length := by
  have hfamily := transitionCircuitFamily_output_add_one_eq W.machine.tm
    ((verifierHeight W).eval input.length)
    (verifierValidity W input).builder (verifierRows W input).rows
    (fun row =>
      ((verifierRows W input).rowValid row).mono
        ((verifierPool W input).extension.trans
          (verifierValidity W input).extension)) step
  change (verifierTransitions W input).outputs step + 1 = _ at hfamily
  have hstart :
      (verifierTransitionStartPolynomial W).eval input.length =
        (verifierValidity W input).builder.gates.length := by
    simpa [verifierValidity, verifierRows, verifierPool,
      arithmeticValidityAt, arithmeticPoolAt, arithmeticRowsAt] using
      verifierTransitionStartPolynomial_eval_eq_validity_length W
        input.length
  rw [← hstart] at hfamily
  have hoff := verifierTransitionOutputOffsetPolynomial_eval_add_one W
    input.length
  have hcancel :
      (verifierTransitions W input).outputs step + 1 =
        ((verifierTransitionStartPolynomial W).eval input.length +
            step.val * transitionCircuitGateCost W.machine.tm
              ((verifierHeight W).eval input.length) +
            (verifierTransitionOutputOffsetPolynomial W).eval input.length) +
          1 := by
    rw [Nat.add_mul] at hfamily
    simp only [one_mul] at hfamily
    calc
      (verifierTransitions W input).outputs step + 1 =
          (verifierTransitionStartPolynomial W).eval input.length +
            step.val * transitionCircuitGateCost W.machine.tm
              ((verifierHeight W).eval input.length) +
            transitionCircuitGateCost W.machine.tm
              ((verifierHeight W).eval input.length) := by
        simpa only [Nat.add_assoc] using hfamily
      _ = _ := by rw [← hoff]; omega
  exact Nat.add_right_cancel hcancel

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