Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

PricingWithTips 3DM dependency: CLRSLean.Chapter_34.Section_34_4_NP_Completeness_Proofs.CookLevin.Circuitization.GeneratorValidityRowTailSource.Part2.Chunk1

Definition
PricingWithTips3DM_bbaac3743d036b03526ad1a7Part2Chunk1

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

noncomputable section

namespace CLRS.Chapter34.Turing.CookLevin

open PolyBuilder

/-! ## Fixed invocation delimiters -/

/-- Delimiter layout of one standalone runtime-stack invocation.  The
seventh zero field materializes the header boundary; the eighth height field
is the runtime payload terminated by the outer stack boundary. -/
def arithmeticValidityTailStackOperandDelimiters : List UnaryFrameSym :=
  [.separator, .separator, .separator, .separator,
    .separator, .separator, .frameEnd, .frameEnd]

/-- The four fixed final-conjunction prefix operands remain ordinary unary
blocks; the variable one-hot family follows them in the next source layer. -/
def arithmeticValidityTailFinalPrefixDelimiters : List UnaryFrameSym :=
  [.separator, .separator, .separator, .separator]

/-- One complete cyclic delimiter table for the fixed part of a validity-tail
row: one eight-field stack invocation per fixed machine stack, then the four
final-conjunction prefix fields. -/
def arithmeticValidityTailFixedOperandDelimiters
    (tm : _root_.Turing.FinTM2) : List UnaryFrameSym :=
  ((arithmeticRuntimeStackSourceIndices tm).flatMap fun _ =>
      arithmeticValidityTailStackOperandDelimiters) ++
    arithmeticValidityTailFinalPrefixDelimiters

@[simp] theorem arithmeticValidityTailFixedOperandDelimiters_nonempty
    (tm : _root_.Turing.FinTM2) :
    0 < (arithmeticValidityTailFixedOperandDelimiters tm).length := by
  simp [arithmeticValidityTailFixedOperandDelimiters,
    arithmeticValidityTailFinalPrefixDelimiters]

/-- The delimiter table has exactly one entry for every fixed affine form. -/
theorem arithmeticValidityTailFixedOperandDelimiters_length
    (tm : _root_.Turing.FinTM2) :
    (arithmeticValidityTailFixedOperandDelimiters tm).length =
      (arithmeticValidityTailFixedOperandForms tm).length := by
  simp [arithmeticValidityTailFixedOperandDelimiters,
    arithmeticValidityTailStackOperandDelimiters,
    arithmeticValidityTailFinalPrefixDelimiters,
    arithmeticValidityTailFixedOperandForms,
    arithmeticValidityTailStackOperandFormsFamily,
    arithmeticValidityTailStackOperandForms,
    arithmeticValidityTailFinalPrefixForms, affineValidityForm]
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