AFTD Auto-Formalizing Theoretical Domains

redistribution_trade_error_succ

theoremverified

For every natural number n, profile θ : Fin n → ℝ, natural number m, and real number t, the (m + 1)-th order trade residual error at t equals redistribution_trade_error θ m t - redistribution_trade θ (redistribution_trade_error θ m) t.

Statement

theorem redistribution_trade_error_succ {n : ℕ} (θ : Fin n → ℝ) (m : ℕ) (t : ℝ) :
    redistribution_trade_error θ (m + 1) t =
      redistribution_trade_error θ m t -
        redistribution_trade θ (redistribution_trade_error θ m) t
Source
arXiv:2610.10995 Definition 4.1
Verified
27 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • redistribution_trade_errorThe m-th order error function E_m = (I - T)^m G after m rounds of trade error correction on the shortfall function G(t) = max(1 - t, 0).
  • redistribution_tradeThe trade operation on the reports: (T f)(t) = (1/n²) Σ_{j,k} f(t − θ_j + θ_k).
  • redistribution_shortfallThe shortfall function G(t) = max(1 - t, 0), representing the amount by which a total report falls short of the project cost 1.

Read back from the Lean

For any natural number $n$, any vector $\theta : \mathrm{Fin}\ n \to \mathbb{R}$, any natural number $m$, and any real number $t$, the redistribution trade error with parameters $\theta$ at step $m + 1$, evaluated at $t$, is equal to the redistribution trade error at step $m$ evaluated at $t$ minus the redistribution trade operator applied to the step-$m$ error function, evaluated at $t$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The proof proceeds by unfolding the definition of redistribution_trade_error, which is defined as the m-th iterate of the error-update operator f ↦ (fun t => f t - redistribution_trade θ f t) starting from redistribution_shortfall. It then rewrites the (m + 1)-th iterate using Function.iterate_succ_apply', which expresses f^[m+1] as f (f^[m]), immediately yielding the recursive subtraction formula.

  1. The (m + 1)-th trade error function satisfies the recursive update rule: redistribution_trade_error θ (m + 1) t = redistribution_trade_error θ m t - redistribution_trade θ (redistribution_trade_error θ m) t.

    By definition, redistribution_trade_error θ m is the m-th iterate of the operator f ↦ (fun t => f t - redistribution_trade θ f t) applied to redistribution_shortfall. Unfolding this definition and applying the successor rule for iterated functions, f^[m+1] x = f (f^[m] x) (via Function.iterate_succ_apply'), expresses the (m + 1)-th iterate as a single application of the update operator to the m-th iterate, which coincides with the right-hand side.

    lines 6–7

    uses Function.iterate_succ_apply'

      unfold redistribution_trade_error
      rw [Function.iterate_succ_apply']
Function.iterate_succ_apply'
For any function f from a type to itself, natural number n, and input x, the (n + 1)-th iterate of f at x equals f applied to the n-th iterate of f at x: f^[n+1] x = f (f^[n] x).

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Recursive update rule for iterated trade error functions. -/theorem redistribution_trade_error_succ {n : ℕ} (θ : Fin n → ℝ) (m : ℕ) (t : ℝ) :    redistribution_trade_error θ (m + 1) t =      redistribution_trade_error θ m t -        redistribution_trade θ (redistribution_trade_error θ m) t := by  unfold redistribution_trade_error  rw [Function.iterate_succ_apply']
See it in the graphDiscuss this resultChallenge it