Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite weighted sums multiplex into character channels

Proved
CouretOaiBridge01.u30_weighted_sum_multiplex

by alexcour · Nov 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

couret-programmecouret-unification-20261108

Let U be the units modulo 30 and R a commutative integral domain with enough roots of unity for the exponent of U. Let I be any finite type, w:U→R, c:I→R and r:I→U. With w^(χ)=∑b∈Uw(b)χ(b−1)\widehat w(\chi)=\sum_{b\in U}w(b)\chi(b^{-1})w(χ)=∑b∈U​w(b)χ(b−1),

φ(30)∑i∈Iciw(ri)=∑χ mod 30w^(χ)∑i∈Iciχ(ri).\varphi(30)\sum_{i\in I}c_iw(r_i)=\sum_{\chi\bmod30}\widehat w(\chi)\sum_{i\in I}c_i\chi(r_i).φ(30)i∈I∑​ci​w(ri​)=χmod30∑​w(χ)i∈I∑​ci​χ(ri​).

Empty I is included; this is a finite algebraic identity.

Preamble
import Definitions.Def_Couret_BRIDGE01_B0_DirichletMultiplexer_d0ed5832539d
import Mathlib.Algebra.MonoidAlgebra.Basic
import Mathlib.Data.ZMod.Units
import Mathlib.NumberTheory.DirichletCharacter.Orthogonality
import Mathlib.Tactic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.NormNum
import Theorems.Thm_CouretOaiBridge01_u30_dirichlet_fourier_inversion
import Definitions.Def_Couret_BRIDGE01_B0_DirichletMultiplexer_d0ed5832539d
import Mathlib.Tactic

open scoped BigOperators

namespace CouretOaiBridge01

noncomputable section

Formal statement

theorem u30_weighted_sum_multiplex
    {R I : Type*} [CommRing R] [IsDomain R]
    [HasEnoughRootsOfUnity R (Monoid.exponent U30)]
    [Fintype I]
    (w : U30 → R) (c : I → R) (r : I → U30) :
    ((30 : ℕ).totient : R) * (∑ i : I, c i * w (r i)) =
      ∑ χ : DirichletCharacter R 30,
        u30FourierCoeff w χ * (∑ i : I, c i * χ (r i : ZMod 30)) := by sorry


end

end CouretOaiBridge01
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/d71ed2dafa9daa082f1a801b51d8a58abdb2c473/research/lean/CouretOaiBridge01/BRIDGE01_B1_WeightedSumMultiplex.lean#L10-L46, lines 10–46; source file SHA-256 a1f7837de0f1205815cb78782dfb1fedbacc565a70f12d76db2d82abfd994d36; theorem CouretOaiBridge01.u30_weighted_sum_multiplex

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me