AFTD Auto-Formalizing Theoretical Domains

redistribution_trade_affine

theoremverified

The symmetric finite trade average fixes every affine function when the report profile is nonempty.

Statement

theorem redistribution_trade_affine {n : ℕ} (hn : 0 < n)
    (θ : Fin n → ℝ) (a b t : ℝ) :
    redistribution_trade θ (fun x => a*x+b) t = a*t+b
Source
Routine helper in the proof of arXiv:2610.10995, Lemmas4.2/4.3 and equations11/12/20/21. Added while working IN-251. No research advance; the main harmonic bound remains unproved.
Verified
27 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • redistribution_tradeThe trade operation on the reports: (T f)(t) = (1/n²) Σ_{j,k} f(t − θ_j + θ_k).

The proof, explained

We unfold the definition of the redistribution trade operator, which expresses the trade average of the affine function $x \mapsto ax + b$ as the double sum $\frac{1}{n^2} \sum_{j, k=0}^{n-1} [a(t - \theta_j + \theta_k) + b]$. Expanding this linear expression and distributing the double summation separates the constant contributions from the sums over the profile components $\theta$. Because each $\theta_j$ appears $n$ times with a negative sign and each $\theta_k$ appears $n$ times with a positive sign, their contributions cancel out completely, leaving $n^2(at + b)$, which simplifies to $at + b$ after multiplying by $1/n^2$.

  1. The trade average of the affine function is rewritten as a double sum, and $n \neq 0$ as a real number.

    Unfolding the definition of `redistribution_trade` expands the left-hand side into the average $\frac{1}{n^2} \sum_{j, k} (a(t - \theta_j + \theta_k) + b)$. Using the hypothesis $0 < n$, we deduce that $n \neq 0$ in $\mathbb{R}$ via `Nat.pos_iff_ne_zero.mp`.

    lines 6–7

    uses redistribution_trade, Nat.pos_iff_ne_zero.mp

      rw [redistribution_trade]
      have hn' : (n : ℝ) ≠ 0 := by exact_mod_cast (Nat.pos_iff_ne_zero.mp hn)
  2. The affine summand expands and the double sum distributes into separate constant and profile sums.

    Distributing multiplication over addition and subtraction expands the summand into $at - a\theta_j + a\theta_k + b$ (`mul_add`, `mul_sub`). Then, splitting the double summation across sums and differences (`Finset.sum_add_distrib`, `Finset.sum_sub_distrib`) and evaluating the sums of constant terms (`Finset.sum_const`, `Finset.card_univ`, `nsmul_eq_mul`) separates the constant parts scaled by $|\mathrm{Fin}\; n|$ from the sums over $\theta$.

    lines 8–10

    uses mul_add, mul_sub, Finset.sum_add_distrib, Finset.sum_sub_distrib, Finset.sum_const, Finset.card_univ, nsmul_eq_mul

      simp only [mul_add, mul_sub]
      simp only [Finset.sum_add_distrib, Finset.sum_sub_distrib, Finset.sum_const, Finset.card_univ,
        nsmul_eq_mul]
  3. Clearing the denominator and substituting the cardinality simplifies the equation to polynomial terms in $n$, $a$, $t$, $b$, and $\sum_i \theta_i$.

    Using $n \neq 0$, `field_simp` clears the leading factor $1 / n^2$ by multiplying through by $n^2$. We then substitute $|\mathrm{Fin}\; n| = n$ (`Fintype.card_fin`) and pull the scalar factors out of the sums over $\theta$ (`Finset.mul_sum`).

    lines 11–12

    uses Fintype.card_fin, Finset.mul_sum

      field_simp [hn']
      simp only [← Finset.mul_sum, Fintype.card_fin]
  4. The identity holds because the profile sums cancel out. automation

    On the left-hand side, the terms $-n a \sum_i \theta_i$ and $+n a \sum_i \theta_i$ cancel each other out, leaving $n^2 a t + n^2 b = n^2 (a t + b)$. Ring arithmetic closes the goal.

    line 13

      ring
redistribution_trade
Definition of the redistribution trade operator: $\mathrm{redistribution\_trade}(\theta, f)(t) = \frac{1}{n^2} \sum_{j, k} f(t - \theta_j + \theta_k)$.
Nat.pos_iff_ne_zero.mp
A strictly positive natural number is nonzero: $0 < n \implies n \neq 0$.
mul_add
Left-distributivity of multiplication over addition: $a(b + c) = ab + ac$.
mul_sub
Left-distributivity of multiplication over subtraction: $a(b - c) = ab - ac$.
Finset.sum_add_distrib
The sum of a sum is the sum of the sums: $\sum_{x \in s} (f(x) + g(x)) = \sum_{x \in s} f(x) + \sum_{x \in s} g(x)$.
Finset.sum_sub_distrib
The sum of a difference is the difference of the sums: $\sum_{x \in s} (f(x) - g(x)) = \sum_{x \in s} f(x) - \sum_{x \in s} g(x)$.
Finset.sum_const
The sum of a constant value $c$ over a finite set $s$ is $|s| \cdot c$.
Finset.card_univ
The cardinality of the universal finset of a finite type equals the cardinality of the type.
nsmul_eq_mul
Natural number scalar multiplication equals multiplication by the natural number cast into the semiring: $n \cdot a = n a$.
Fintype.card_fin
The cardinality of $\mathrm{Fin}\; n$ is $n$.
Finset.mul_sum
Multiplication distributes over a finite sum: $a \sum_{i \in s} f(i) = \sum_{i \in s} a f(i)$.

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

open Finset MeasureTheorytheorem redistribution_trade_affine {n : ℕ} (hn : 0 < n)    (θ : Fin n → ℝ) (a b t : ℝ) :    redistribution_trade θ (fun x => a*x+b) t = a*t+b := by  rw [redistribution_trade]  have hn' : (n : ℝ) ≠ 0 := by exact_mod_cast (Nat.pos_iff_ne_zero.mp hn)  simp only [mul_add, mul_sub]  simp only [Finset.sum_add_distrib, Finset.sum_sub_distrib, Finset.sum_const, Finset.card_univ,    nsmul_eq_mul]  field_simp [hn']  simp only [← Finset.mul_sum, Fintype.card_fin]  ring
See it in the graphDiscuss this resultChallenge it