fin_sum_sub_left
For v : Fin m → ℤ with m > 0 and any i, the sum of v(i - j) over j equals the sum of v.
Statement
theorem fin_sum_sub_left {m : ℕ} [NeZero m] (v : Fin m → ℤ) (i : Fin m) :
∑ j, v (i - j) = ∑ j, v j- Source
- helper for arXiv:2610.27175 Theorem 5
- Verified
- 22 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- bordered_goethals_seidel_cross_blockIf the first columns a, b, c, d (m > 0) sum to 2, 0, 0, 0, then K Lᵀ + T Mᵀ = 0, where K is the 4 × 4 corner, L the 4m × 4 left border of…
The proof, explained
The proof reindexes the sum using the reflection automorphism of $\mathrm{Fin}\; m$. Since $m > 0$, $\mathrm{Fin}\; m$ has an additive group structure, making the map $j \mapsto i - j$ a bijection (`Equiv.subLeft i`). Applying the reindexing lemma for finite sums (`Fintype.sum_equiv`) shows that summing $v(i - j)$ over all $j$ is equal to summing $v(j)$ over all $j$.
$\sum_j v(i - j) = \sum_j v(j)$
Because $m > 0$, $\mathrm{Fin}\; m$ is an additive group, so left subtraction $j \mapsto i - j$ is an equivalence of $\mathrm{Fin}\; m$ with itself (`Equiv.subLeft i`). Reindexing the finite sum along this bijection via `Fintype.sum_equiv` preserves the sum, as the summands match definitionally ($v(i - j) = v(e(j))$).
uses
Fintype.sum_equiv,Equiv.subLeftFintype.sum_equiv (Equiv.subLeft i) _ _ (fun _ => rfl)
Fintype.sum_equiv- If $e : \iota \simeq \kappa$ is an equivalence between finite types, and $f(x) = g(e(x))$ for all $x$, then $\sum_x f(x) = \sum_x g(x)$.
Equiv.subLeft- In an additive group, left subtraction by a fixed element $a$, sending $x \mapsto a - x$, is an equivalence from the group to itself.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
theorem fin_sum_sub_left {m : ℕ} [NeZero m] (v : Fin m → ℤ) (i : Fin m) : ∑ j, v (i - j) = ∑ j, v j := Fintype.sum_equiv (Equiv.subLeft i) _ _ (fun _ => rfl)