R03 candidate definition: r03 defs e9ce17004c R03CenterChainCost v2
Definitionr03_defs_e9ce17004c_R03CenterChainCost_v2graph-theoryopg-46613p3-factorsource-faithful-candidate
This is a source-faithful definition module supporting a conditional formalization of the cubic P3-partition problem. It contains data structures and predicates used by separately published theorem candidates; it does not assert that the open root problem is solved.
Definition code
import Mathlib.Data.Fin.VecNotation
/- Candidate scalar certificate only. Its hypotheses encode the separate
four-square graph argument; no arbitrary-graph projector is asserted. -/
set_option Elab.async false
namespace R03CenterChainCost
def debt (b : Bool) : Int := if b then 1 else 0
def PairCertificate (a b : Bool) (w : Nat) : Prop :=
1 ≤ w ∧ (w=1 → b=true) ∧ (a=true → 3 ≤ w)
inductive CostChain : Bool → Bool → Nat → Nat → Prop where
| empty (a : Bool) : CostChain a a 0 0
| prepend {a b c : Bool} {steps total : Nat} (w : Nat)
(hpair : PairCertificate a b w) (tail : CostChain b c steps total) :
CostChain a c (steps+1) (w+total)
end R03CenterChainCost
Source
VibeMathing candidate definition artifact: Definitions/Def_r03_defs_e9ce17004c_R03CenterChainCost_v2.lean; candidate-only formalization for ProblemContract problem:opg-46613-p3-partition.