redistribution_trade_const
The trade operation maps a constant function to itself.
Statement
theorem redistribution_trade_const {n : ℕ} (hn : 0 < n) (θ : Fin n → ℝ) (c t : ℝ) : redistribution_trade θ (fun _ => c) t = c
- Source
- Sanity check of the definitions of arXiv:2610.10995 (Asymptotically optimal public project redistribution without bounded precision): the operations average, so they fix constants.
- Verified
- 09 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
The trade operation averages over all pairs `(j, k) ∈ (Fin n)²` scaled by `1 / n²`. When applied to a constant function `c`, each of the `n²` terms is simply `c`, so the double sum evaluates to `n² * c`. Since `n > 0`, the coerced dimension `(n : ℝ)` is nonzero, allowing the factor `1 / n²` to cancel with `n²` and leave `c`.
The trade operation applied to the constant function `c` reduces to `(1 / n^2) * (n * (n * c))`.
Unfolding the definition of `redistribution_trade` expresses the left-hand side as the scaled double sum `(1 / n^2) * ∑ j, ∑ k, c`. Because the summand is constant, summing over the universe of `Fin n` (which has cardinality `n`) twice simplifies the double sum to `n * (n * c)`.
uses
Finset.sum_const,Finset.card_univ,Fintype.card_fin,nsmul_eq_mulunfold redistribution_trade simp only [Finset.sum_const, Finset.card_univ, Fintype.card_fin, nsmul_eq_mul]
The dimension `n` is nonzero as a real number: `(n : ℝ) ≠ 0`.
From the assumption `0 < n` (`hn`), `n` is nonzero in `ℕ`. Casting this inequality to `ℝ` establishes `(n : ℝ) ≠ 0`.
have : (n : ℝ) ≠ 0 := by exact_mod_cast hn.ne'
The equality holds: `(1 / n^2) * (n * (n * c)) = c`.
With `(n : ℝ) ≠ 0` in scope, clearing denominators cancels the factor `n^2` in the denominator against `n * n` in the numerator, leaving `c`.
field_simp
Finset.sum_const- Summing a constant value over a finite set equals the cardinality of the set scalar-multiplied by that value.
Finset.card_univ- The cardinality of the universal finset of a finite type equals the cardinality of that type.
Fintype.card_fin- The cardinality of the standard finite type `Fin n` is `n`.
nsmul_eq_mul- Scalar multiplication of a semiring element by a natural number `n` equals multiplication by `n` coerced into the semiring.
- In Lean, `field_simp` requires an explicit hypothesis that `(n : ℝ) ≠ 0` in order to cancel `n^2` in the denominator, which is established on line 5 by casting `0 < n` from ℕ to ℝ.
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.
theorem redistribution_trade_const {n : ℕ} (hn : 0 < n) (θ : Fin n → ℝ) (c t : ℝ) : redistribution_trade θ (fun _ => c) t = c := by unfold redistribution_trade simp only [Finset.sum_const, Finset.card_univ, Fintype.card_fin, nsmul_eq_mul] have : (n : ℝ) ≠ 0 := by exact_mod_cast hn.ne' field_simp