Two-sided-majorant mixed-product total variation
ProvedDerivativeChainPrivate.mixed_product_variationderivative-chain-formalization-20261018derivative-chain-privatepolynomials
For nonnegative real sequences G and J, with G nondecreasing and J nonincreasing, and every natural n, the sum from k=0 to n-1 of |G(k+1)J(k+1)-G(k)J(k)| is at most 2G(n)J(0)-G(0)J(0)-G(n)J(n). This formalizes equation (6) of the two-sided-majorant checkpoint for all finite lengths.
Preamble
import Mathlib.Algebra.Order.BigOperators.Ring.Finset import Mathlib.Data.Real.Basic import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring set_option autoImplicit false open scoped BigOperators namespace DerivativeChainPrivate end DerivativeChainPrivate
Formal statement
theorem DerivativeChainPrivate.mixed_product_variation (G J : ℕ → ℝ) (hG : Monotone G) (hJ : Antitone J)
(hG0 : ∀ k, 0 ≤ G k) (hJ0 : ∀ k, 0 ≤ J k) (n : ℕ) :
(∑ k ∈ Finset.range n, |G (k + 1) * J (k + 1) - G k * J k|) ≤
2 * G n * J 0 - G 0 * J 0 - G n * J n := by sorrySource
Derivative-zero chains: public formalization reference, R38, DerivativeChainPrivate.mixed_product_variation. 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.