Eq. (EC.6) — Bellman optimality for consecutive blocks
ProvedFBMSP.dp_correctnessLet be any real score assigned to the index interval . The declared Bellman recurrence for consecutive block slots on is attained by a witnessed partition and is at least the score of every such partition.
Empty blocks are allowed. When their scores are zero, they represent unused slots. This is a generic combinatorial lemma; applying it to pricing requires the block-oracle and interval-reduction links. A complete proof of this generic lemma has been checked locally, but this uploaded draft target remains an open statement until publication and proof submission.
import Definitions.Def_FBMSP_DynamicProgram
namespace FBMSP
theorem dp_correctness (W : ℕ → ℕ → ℝ) (k a n : ℕ) :
IntervalValue W k a n (intervalDP W k a n) ∧
∀ v, IntervalValue W k a n v → v ≤ intervalDP W k a n := by sorry
end FBMSPRead-back
What the Lean code literally says, in plain math · gpt-6-astra
For every function and all natural numbers , let and . Then is itself a sum for some nondecreasing natural cuts and , and every such sum is at most . Here the admissible sums are equivalently the values generated by beginning with the one-block value at level and repeatedly appending a last block from to with . There are blocks, repeated cuts and empty blocks are allowed, and no sign, monotonicity, or zero-diagonal condition on is assumed. All zero cases are included: for the value is the single weight , and for every block is empty and the value is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.