No direct novelty relation from C to D
ProvedCouretOaiBridge01.StatusTransport.MutationSuite.M17_documentary_edge_not_noveltycouret-programmecouret-unification-20261108
The baseline typed policy admits proof edges on the semantic, replay and novelty axes, replay edges only on replay, novelty edges only on novelty, and no documentary edges. Let the fixed graph have nodes A,B,C,D and edges A→B (proof), A→C (replay), B→D (novelty), C→D (documentary). The specified direct typed relation is absent:
This statement concerns one-step relations.
Preamble
import Definitions.Def_Couret_STAT_TRANS_05_MutationSuite_39e36fa4811a import Mathlib.Data.Set.Basic import Definitions.Def_Couret_STAT_TRANS_04_TypedDependencies_3df632007942 /-! # STAT-TRANS-05 — Pre-specified mutation suite This file freezes a small synthetic graph before application to G30, T16, Cayley, or OAI-7/8. The suite tests both accepted and rejected propagation channels. No RH claim. No novelty claim. -/ namespace CouretOaiBridge01 namespace StatusTransport namespace MutationSuite /-! ## Policy mutations: ACCEPT / REJECT -/ /-! ## Local seed mutations -/ /-! ## Direct propagation mutations -/ /-! ## Multi-hop mutation -/ /-! ## Channel-separation mutations -/
Formal statement
theorem M17_documentary_edge_not_novelty :
¬ TypedRelation edges .novelty .C .D := by sorry
end MutationSuite
end StatusTransport
end CouretOaiBridge01
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/d71ed2dafa9daa082f1a801b51d8a58abdb2c473/research/lean/CouretOaiBridge01/STAT_TRANS_05_MutationSuite.lean#L139-L141, lines 139–141; source file SHA-256 62a8f58f0372313f9ba80d9a0dfb97d452fe508070b154c884b1a452a7b7e23f; theorem CouretOaiBridge01.StatusTransport.MutationSuite.M17_documentary_edge_not_novelty