Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Conditional necessity of the exceptional-triple spectral criterion

Proved
Couret.CayleyDoublet.abelianThree_spectral_necessity_of_trace_bridge

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

couret-programmecouret-unification-20261108

Let GGG be a finite abelian group. Write S+={a,a+d,a+d+h}S_+=\{a,a+d,a+d+h\}S+​={a,a+d,a+d+h}, S−={a,a−d,a−d+h}S_-=\{a,a-d,a-d+h\}S−​={a,a−d,a−d+h} and A±(x,y)=1A_\pm(x,y)=1A±​(x,y)=1 if y−x∈S±y-x\in S_\pmy−x∈S±​, and zero otherwise. Assume h≠0h\ne0h=0, 2h=02h=02h=0, and d+⟨h⟩d+\langle h\rangled+⟨h⟩ has order exactly three. Assume the explicit trace bridge: for every natural nnn, equality of the characteristic polynomials of A+A_+A+​ and A−A_-A−​ implies equality of their nnnth-power traces. If those characteristic polynomials agree, then

⟨a,h⟩≠Gor∣G/⟨h⟩∣ is even.\langle a,h\rangle\ne G\quad\text{or}\quad |G/\langle h\rangle|\text{ is even}.⟨a,h⟩=Gor∣G/⟨h⟩∣ is even.

The trace bridge is a hypothesis of this statement.

Preamble
import Definitions.Def_Couret_CayleyTwoColourSpectral_cff7591a9c5d
import Mathlib
import Theorems.Thm_Couret_CayleyDoublet_abelianThree_odd_trace_witness_of_odd_quotient
import Definitions.Def_Couret_CayleyTwoColourSpectral_cff7591a9c5d

/-!
COU-20 — research branch only, spectral necessity work in progress.

This file is deliberately separate from the certified Core/Family/Abelian/
Spectral/Parity modules. It does not claim a new Lean or GitHub Actions
certificate until it has been compiled against the pinned toolchain.

The cyclic lemma below produces an odd *discriminating* exponent. It is
slightly more general than the canonical candidate |Q|/3: its exponent
need not be the least such one. Directed adjacency and loops are untouched.

The generic rational charpoly-to-all-power-traces theorem is NOT assumed as
proved. The final assembly is explicitly conditional on that missing bridge.
-/

set_option autoImplicit false
noncomputable section

open Matrix

namespace Couret.CayleyNecessity





end Couret.CayleyNecessity

namespace Couret.CayleyDoublet

open Couret.CayleyNecessity

variable {G : Type*} [AddCommGroup G] [DecidableEq G] [Fintype G]







Formal statement

theorem abelianThree_spectral_necessity_of_trace_bridge (a d h : G)
    (hhalf : h + h = 0) (hne : h ≠ 0)
    (horder : addOrderOf (d : G ⧸ AddSubgroup.zmultiples h) = 3)
    (hbridge :
      ∀ n : ℕ,
        (abelianCayleyMatrix (AbelianSource a d h)).charpoly =
          (abelianCayleyMatrix (AbelianTarget a d h)).charpoly →
        Matrix.trace (abelianCayleyMatrix (AbelianSource a d h) ^ n) =
          Matrix.trace (abelianCayleyMatrix (AbelianTarget a d h) ^ n))
    (hcospec :
      (abelianCayleyMatrix (AbelianSource a d h)).charpoly =
        (abelianCayleyMatrix (AbelianTarget a d h)).charpoly) :
    AddSubgroup.closure ({a, h} : Set G) ≠ ⊤ ∨
      Even (Nat.card (G ⧸ AddSubgroup.zmultiples h)) := by sorry




end Couret.CayleyDoublet


Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/65b828d9ffd016ce2a1b05403f303fa5f948c10f/research/correspondants_20261013/lean/CayleyTwoColourNecessity.lean#L131-L162, lines 131–162; source file SHA-256 7675ca2a1f08e8c6a20617d181810b5c2b6a4f0cffcf96b93678cb0bc9c7869d; theorem Couret.CayleyDoublet.abelianThree_spectral_necessity_of_trace_bridge

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