Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The three-channel multiplier has three possible values

Proved
CouretOaiBridge01.tcMultiplier_eq_three_or_one_or_neg_one

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

couret-programmecouret-unification-20261108

For any complex Dirichlet character χ modulo 30 put Mχ=1+χ(11)+χ(29)M_\chi=1+\chi(11)+\chi(29)Mχ​=1+χ(11)+χ(29). Then

Mχ∈{3,1,−1}.M_\chi\in\{3,1,-1\}.Mχ​∈{3,1,−1}.
Preamble
import Definitions.Def_Couret_BRIDGE01_B2_TCNonzeroChannels_1194a2978bc3
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 Definitions.Def_Couret_BRIDGE01_B0_DirichletMultiplexer_d0ed5832539d
import Mathlib.Tactic

namespace CouretOaiBridge01

noncomputable section













Formal statement
theorem tcMultiplier_eq_three_or_one_or_neg_one (χ : DirichletCharacter ℂ 30) :
    tcMultiplier χ = 3 ∨ tcMultiplier χ = 1 ∨ tcMultiplier χ = -1 := by sorry


end

end CouretOaiBridge01
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/d71ed2dafa9daa082f1a801b51d8a58abdb2c473/research/lean/CouretOaiBridge01/BRIDGE01_B2_TCNonzeroChannels.lean#L48-L52, lines 48–52; source file SHA-256 20187ae8758f4e235b891cee0692308db6f35eb2071b8bb573161596e9016dd9; theorem CouretOaiBridge01.tcMultiplier_eq_three_or_one_or_neg_one

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