Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A sufficient criterion for exceptional-triple cospectrality

Proved
Couret.CayleyDoublet.abelianThreeCospectral_of_nongeneration_or_even_quotient

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, the image of ddd in G/⟨h⟩G/\langle h\rangleG/⟨h⟩ has order exactly three, and a,d,ha,d,ha,d,h generate GGG. If either a,ha,ha,h fail to generate GGG or ∣G/⟨h⟩∣|G/\langle h\rangle|∣G/⟨h⟩∣ is even, then

det⁡(XI−A+)=det⁡(XI−A−).\det(XI-A_+)=\det(XI-A_-).det(XI−A+​)=det(XI−A−​).

This gives a sufficient directed spectral criterion.

Preamble
import Definitions.Def_Couret_CayleyTwoColourSpectral_cff7591a9c5d
import Mathlib
import Theorems.Thm_Couret_CayleyDoublet_abelianQuotient_generated_pair
import Theorems.Thm_Couret_CayleyDoublet_abelianThreeCospectral_of_nongeneration
import Theorems.Thm_Couret_CayleyDoublet_abelianThreeCospectral_of_parity
import Theorems.Thm_Couret_CayleyDoublet_abelian_quotient_natCard_even_of_odd_order
import Theorems.Thm_Couret_CayleyDoublet_abelian_quotient_zmultiples_generator_of_pair
import Theorems.Thm_Couret_CayleyParity_exists_parity_of_even_generator_order
import Definitions.Def_Couret_CayleyTwoColourSpectral_cff7591a9c5d

/-!
COU-20 — parity from finite quotient cardinality (17 October 2026).

The additive parity used by the directed spectral bridge is constructed here.
Let H be generated by h and assume G/H is finite, generated by the images of
a and d, with d+H of odd order. Then a character to ZMod 2 taking a to one
and h to zero exists exactly when G/H has even cardinality. The construction
also kills d. No half-turn or nonzero condition on h is needed for this part.

For the actual finite Cayley adjacency matrices the original nonzero half-turn,
exact order-three quotient and global generation premises are retained.
The disjunction of nongeneration by a,h and even quotient cardinality implies
cospectrality. This is the sufficient direction; the converse spectral
classification, independent human review and priority audit remain separate.
The earlier certified modules and their statements are imported unchanged.
-/

set_option autoImplicit false
noncomputable section

namespace Couret.CayleyParity

variable {Q : Type*} [AddGroup Q]







end Couret.CayleyParity

namespace Couret.CayleyParity














end Couret.CayleyParity

namespace Couret.CayleyDoublet










end Couret.CayleyDoublet

namespace Couret.CayleyDoublet

variable {G : Type*} [AddCommGroup G]




end Couret.CayleyDoublet

namespace Couret.CayleyDoublet



variable {G : Type*} [AddCommGroup G]









end Couret.CayleyDoublet


namespace Couret.CayleyDoublet

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



Formal statement

theorem abelianThreeCospectral_of_nongeneration_or_even_quotient
    (a d h : G) (hhalf : h + h = 0) (hne : h ≠ 0)
    (horder : addOrderOf (d : G ⧸ AddSubgroup.zmultiples h) = 3)
    (hgen : AddSubgroup.closure ({a, d, h} : Set G) = ⊤)
    (hcase : AddSubgroup.closure ({a, h} : Set G) ≠ ⊤ ∨
      Even (Nat.card (G ⧸ AddSubgroup.zmultiples h))) :
    (abelianCayleyMatrix (AbelianSource a d h)).charpoly =
      (abelianCayleyMatrix (AbelianTarget a d h)).charpoly := by sorry




end Couret.CayleyDoublet

Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/65b828d9ffd016ce2a1b05403f303fa5f948c10f/research/correspondants_20261013/lean/CayleyTwoColourParity.lean#L350-L363, lines 350–363; source file SHA-256 d093cc5d0fb31526ef68d4b1d68ee24818c67ebec52adc75170199eecb1ea7a6; theorem Couret.CayleyDoublet.abelianThreeCospectral_of_nongeneration_or_even_quotient

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