redistribution_trade_error_one
For every natural number n, report profile θ : Fin n → ℝ, and real number t, the first-order trade error redistribution_trade_error θ 1 t equals redistribution_shortfall t - redistribution_trade θ redistribution_shortfall t.
Statement
theorem redistribution_trade_error_one {n : ℕ} (θ : Fin n → ℝ) (t : ℝ) :
redistribution_trade_error θ 1 t =
redistribution_shortfall t - redistribution_trade θ redistribution_shortfall 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_shortfallThe shortfall function G(t) = max(1 - t, 0), representing the amount by which a total report falls short of the project cost 1.
- redistribution_tradeThe trade operation on the reports: (T f)(t) = (1/n²) Σ_{j,k} f(t − θ_j + θ_k).
Read back from the Lean
For every natural number $n$, every function $\theta : \text{Fin } n \to \mathbb{R}$, and every real number $t$, the redistribution trade error with parameter $m = 1$ evaluated at $t$ is equal to the redistribution shortfall at $t$ minus the redistribution trade of the redistribution shortfall 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 identity follows directly from the definition of the trade error. By definition, the m-th trade error is the m-fold iteration of the operator f ↦ (t ↦ f(t) - redistribution_trade θ f t) applied to the initial shortfall function. For m = 1, taking a single iteration yields the stated formula immediately.
The first-order trade error redistribution_trade_error θ 1 t equals redistribution_shortfall t - redistribution_trade θ redistribution_shortfall t.
Unfolding the definition of redistribution_trade_error, the m-th trade error is defined as the m-fold iteration of the operator f ↦ (λ t, f t - redistribution_trade θ f t) applied to redistribution_shortfall. For m = 1, applying the operator once to redistribution_shortfall and evaluating at t yields redistribution_shortfall t - redistribution_trade θ redistribution_shortfall t, completing the proof by simplification.
uses
redistribution_trade_errorsimp [redistribution_trade_error]
redistribution_trade_error- The m-th trade error is defined by iterating m times the operator f ↦ (λ t, f t - redistribution_trade θ f t), starting from redistribution_shortfall.
- The simplifier automatically unfolds the single function iteration `^[1]` to a single function application.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- First-order trade error definition unrolling. -/theorem redistribution_trade_error_one {n : ℕ} (θ : Fin n → ℝ) (t : ℝ) : redistribution_trade_error θ 1 t = redistribution_shortfall t - redistribution_trade θ redistribution_shortfall t := by simp [redistribution_trade_error]