Conditional necessity of the exceptional-triple spectral criterion
ProvedCouret.CayleyDoublet.abelianThree_spectral_necessity_of_trace_bridgecouret-programmecouret-unification-20261108
Let be a finite abelian group. Write , and if , and zero otherwise. Assume , , and has order exactly three. Assume the explicit trace bridge: for every natural , equality of the characteristic polynomials of and implies equality of their th-power traces. If those characteristic polynomials agree, then
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