Two extremal candidate costs across one exceptional transition
ProvedDerivativeChainPrivate.one_exception_geometryderivative-chain-formalization-20261018derivative-chain-privatepolynomials
For real a,l,r,L,R,U,V with l<=a<=r, L<=R, U>=-1, l>=-1, r<=1, V<=1, the minimum of a-l+|L-l|+L-U and r-a+|R-r|+V-R is at most 3. This proves the candidate-cost inequality, not the existence of the root chains used in its application.
Preamble
import Mathlib.Data.Real.Basic import Mathlib.Tactic.Linarith set_option autoImplicit false namespace DerivativeChainPrivate end DerivativeChainPrivate
Formal statement
theorem DerivativeChainPrivate.one_exception_geometry (a l r L R U V : ℝ)
(hl : l ≤ a) (hr : a ≤ r) (hLR : L ≤ R)
(hU : -1 ≤ U) (hl1 : -1 ≤ l) (hr1 : r ≤ 1) (hV : V ≤ 1) :
min (a - l + |L - l| + L - U) (r - a + |R - r| + V - R) ≤ 3 := by sorrySource
Derivative-zero chains: public formalization reference, R37, DerivativeChainPrivate.one_exception_geometry. https://gist.github.com/Amal-David/d6612109c98595b12561cd638c60edf5/3883c57ddc7bf9d4c0e898c3d6bfd2ca0d7f9c95#file-notes-md
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.