AFTD Auto-Formalizing Theoretical Domains

op_1592_character_line_vanishing

theoremverified

For finite additive commutative groups, a function whose sums over translates of a homomorphic image are constant has zero Fourier coefficient at any nontrivial character that is trivial on that image.

Statement

theorem op_1592_character_line_vanishing
    {G H : Type*} [AddCommGroup G] [Fintype G] [AddCommGroup H] [Fintype H]
    (phi : H →+ G) (chi : AddChar G ℂ) (hchi : chi ≠ 0)
    (hphi : ∀ t : H, chi (phi t) = 1) (f : G → ℂ) (C : ℂ)
    (hline : ∀ x : G, (∑ t : H, f (x + phi t)) = C) :
    ∑ x : G, f x * chi x = 0
Source
The necessity argument, arXiv:2611.14754, Section 3.
Verified
15 Nov 2026
Axioms
Classical.choiceQuot.soundpropext

The proof, explained

The proof evaluates the double sum $\sum_{x \in G} \sum_{t \in H} f(x + \phi(t)) \chi(x + \phi(t))$ in two different ways. First, swapping the order of summation and using translation invariance on $G$ shows the double sum equals $|H| \sum_{x \in G} f(x) \chi(x)$. Second, because $\chi$ is trivial on $\operatorname{im}(\phi)$ and sums of $f$ along translates of $\operatorname{im}(\phi)$ equal $C$, the inner sum factors as $C \chi(x)$, which vanishes when summed over $x \in G$ by character orthogonality. Since $|H| \neq 0$ in $\mathbb{C}$, the Fourier coefficient $\sum_{x \in G} f(x) \chi(x)$ must be zero.

  1. The sum of the character $\chi$ over $G$ vanishes: $\sum_{x \in G} \chi(x) = 0$.

    By character orthogonality, the sum of a nontrivial additive character on a finite group is zero. Since $\chi \ne 0$ by assumption, its total sum over $G$ is zero.

    lines 10–11

    uses AddChar.sum_eq_zero_iff_ne_zero.mpr

      classical
      have hchar : (∑ x : G, chi x) = 0 := AddChar.sum_eq_zero_iff_ne_zero.mpr hchi
  2. For each $t \in H$, shifting the sum by $\phi(t)$ leaves it unchanged: $\sum_{x \in G} f(x + \phi(t)) \chi(x + \phi(t)) = \sum_{x \in G} f(x) \chi(x)$.

    For any fixed $t$, the map $x \mapsto x + \phi(t)$ is a bijection on the finite group $G$. Reindexing the sum by this bijective translation does not change its value.

    lines 12–14

    uses Equiv.addRight

      have hshift (t : H) : (∑ x : G, f (x + phi t) * chi (x + phi t)) =
          ∑ x : G, f x * chi x := by
        exact (Equiv.addRight (phi t)).bijective.sum_comp (fun x => f x * chi x)
  3. The double sum $\sum_{x \in G} \sum_{t \in H} f(x + \phi(t)) \chi(x + \phi(t))$ equals $|H| \sum_{x \in G} f(x) \chi(x)$.

    Swapping the order of summation gives a sum over $t \in H$ of the shifted sum. Since each shifted sum evaluates to $\sum_{x \in G} f(x) \chi(x)$ independently of $t$, summing this constant over all $|H|$ elements of $H$ multiplies it by $|H|$.

    lines 15–18

    uses Finset.sum_comm, Finset.sum_const, Finset.card_univ, nsmul_eq_mul

      have hsum1 : (∑ x : G, ∑ t : H, f (x + phi t) * chi (x + phi t)) =
          (Fintype.card H : ℂ) * (∑ x : G, f x * chi x) := by
        rw [Finset.sum_comm]
        simp only [hshift, Finset.sum_const, Finset.card_univ, nsmul_eq_mul]
  4. The double sum $\sum_{x \in G} \sum_{t \in H} f(x + \phi(t)) \chi(x + \phi(t))$ equals 0.

    Because $\chi$ is a character, $\chi(x + \phi(t)) = \chi(x) \chi(\phi(t))$, which reduces to $\chi(x)$ since $\chi(\phi(t)) = 1$ for all $t$. Factoring $\chi(x)$ out of the inner sum leaves $\sum_{t \in H} f(x + \phi(t))$, which equals $C$ for all $x$ by hypothesis. Factoring the constant $C$ out of the outer sum gives $C \sum_{x \in G} \chi(x)$, which is 0 because the character sum over $G$ is zero.

    lines 19–29

    uses Finset.sum_congr, Finset.sum_mul, chi.map_add_eq_mul, mul_one, Finset.mul_sum, mul_zero

      have hsum2 : (∑ x : G, ∑ t : H, f (x + phi t) * chi (x + phi t)) = 0 := by
        calc
          _ = ∑ x : G, (∑ t : H, f (x + phi t)) * chi x := by
            apply Finset.sum_congr rfl
            intro x hx
            rw [Finset.sum_mul]
            apply Finset.sum_congr rfl
            intro t ht
            rw [chi.map_add_eq_mul, hphi, mul_one]
          _ = C * (∑ x : G, chi x) := by simp_rw [hline]; rw [Finset.mul_sum]
          _ = 0 := by rw [hchar, mul_zero]
  5. The Fourier coefficient $\sum_{x \in G} f(x) \chi(x)$ is 0.

    Equating the two evaluations shows that $|H| \sum_{x \in G} f(x) \chi(x) = 0$. Since $H$ is a finite group, it is nonempty and its cardinality $|H|$ is nonzero in $\mathbb{C}$. Since $\mathbb{C}$ has no zero divisors, the sum $\sum_{x \in G} f(x) \chi(x)$ must be 0.

    lines 30–31

    uses Nat.cast_ne_zero.mpr, Fintype.card_ne_zero, mul_eq_zero.mp

      have hcard : (Fintype.card H : ℂ) ≠ 0 := Nat.cast_ne_zero.mpr Fintype.card_ne_zero
      exact (mul_eq_zero.mp (hsum1.symm.trans hsum2)).resolve_left hcard
AddChar.sum_eq_zero_iff_ne_zero.mpr
The sum of values of a nontrivial additive character over a finite group is zero.
Equiv.addRight
Right translation by a fixed group element is an equivalence (bijective permutation) of the group.
Finset.sum_comm
The order of summation in a finite double sum can be swapped.
Finset.sum_const
Summing a constant value over a finite set equals the cardinality of the set multiplied by that constant.
Finset.card_univ
The cardinality of the universal finite set of a finite type equals the cardinality of the type.
nsmul_eq_mul
Natural number scalar multiplication in a semiring coincides with multiplication by the natural number cast into the semiring.
Finset.sum_congr
Two finite sums are equal if their index sets are equal and their summands agree at every element.
Finset.sum_mul
Multiplication by an element on the right distributes over a finite sum.
chi.map_add_eq_mul
An additive character converts addition in the group to multiplication: $\chi(a + b) = \chi(a) \chi(b)$.
mul_one
Multiplying any element by 1 yields that element.
Finset.mul_sum
Multiplication by an element on the left distributes over a finite sum.
mul_zero
Multiplying any element by zero yields zero.
Nat.cast_ne_zero.mpr
A nonzero natural number casts to a nonzero element in a characteristic-zero semiring (such as $\mathbb{C}$).
Fintype.card_ne_zero
The cardinality of any nonempty finite type is nonzero.
mul_eq_zero.mp
If the product of two elements is zero in a domain, at least one of the factors is zero.

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 Finsetset_option maxHeartbeats 4000000theorem op_1592_character_line_vanishing    {G H : Type*} [AddCommGroup G] [Fintype G] [AddCommGroup H] [Fintype H]    (phi : H →+ G) (chi : AddChar G ℂ) (hchi : chi ≠ 0)    (hphi : ∀ t : H, chi (phi t) = 1) (f : G → ℂ) (C : ℂ)    (hline : ∀ x : G, (∑ t : H, f (x + phi t)) = C) :    ∑ x : G, f x * chi x = 0 := by  classical  have hchar : (∑ x : G, chi x) = 0 := AddChar.sum_eq_zero_iff_ne_zero.mpr hchi  have hshift (t : H) : (∑ x : G, f (x + phi t) * chi (x + phi t)) =      ∑ x : G, f x * chi x := by    exact (Equiv.addRight (phi t)).bijective.sum_comp (fun x => f x * chi x)  have hsum1 : (∑ x : G, ∑ t : H, f (x + phi t) * chi (x + phi t)) =      (Fintype.card H : ℂ) * (∑ x : G, f x * chi x) := by    rw [Finset.sum_comm]    simp only [hshift, Finset.sum_const, Finset.card_univ, nsmul_eq_mul]  have hsum2 : (∑ x : G, ∑ t : H, f (x + phi t) * chi (x + phi t)) = 0 := by    calc      _ = ∑ x : G, (∑ t : H, f (x + phi t)) * chi x := by        apply Finset.sum_congr rfl        intro x hx        rw [Finset.sum_mul]        apply Finset.sum_congr rfl        intro t ht        rw [chi.map_add_eq_mul, hphi, mul_one]      _ = C * (∑ x : G, chi x) := by simp_rw [hline]; rw [Finset.mul_sum]      _ = 0 := by rw [hchar, mul_zero]  have hcard : (Fintype.card H : ℂ) ≠ 0 := Nat.cast_ne_zero.mpr Fintype.card_ne_zero  exact (mul_eq_zero.mp (hsum1.symm.trans hsum2)).resolve_left hcard
See it in the graphDiscuss this resultChallenge it