AFTD Auto-Formalizing Theoretical Domains

redistribution_trade_without

def

The trade operation on the reports other than agent i: (T_{-i} f)(t) = (1/(n−1)²) Σ_{j≠i} Σ_{k≠i} f(t − θ_j + θ_k).

Statement

noncomputable def redistribution_trade_without {n : ℕ} (θ : Fin n → ℝ) (i : Fin n)
    (f : ℝ → ℝ) : ℝ → ℝ
Defined in
arXiv:2610.10995 (Asymptotically optimal public project redistribution without bounded precision), Sec. 4.3, (25).
Verified
09 Oct 2026
Axioms
none listed
Used by 2
  • redistribution_iterated_trade_boundsLet n ≥ 3, θ ∈ [0,1]^n and G(t) = max(1 − t, 0). For every k ≥ 0, T^k G and T_{-i}^k G are 1-Lipschitz, and |(T^k G)(t) − (T_{-i}^k G)(t)|…
  • redistribution_one_draw_gap_boundsLet n ≥ 3 and reports θ ∈ [0,1]^n. For every L-Lipschitz F, every agent i and every t: |(A F)(t) − (A_{-i} F)(t)| ≤ L d_i and |(T F)(t) −…

Lean source view module on GitHub

/-- The trade operation on the reports other than `i`:
`(T_{-i} f)(t) = (1/(n-1)²) ∑_{j ≠ i} ∑_{k ≠ i} f(t - θ_j + θ_k)`. -/
noncomputable def redistribution_trade_without {n : ℕ} (θ : Fin n → ℝ) (i : Fin n)
    (f : ℝ → ℝ) : ℝ → ℝ :=
  fun t => (1 / ((n : ℝ) - 1) ^ 2) *
    ∑ j ∈ Finset.univ.erase i, ∑ k ∈ Finset.univ.erase i, f (t - θ j + θ k)
See it in the graphDiscuss this resultChallenge it