Conditional spectral classification via a trace bridge
ProvedCouret.CayleyDoublet.abelianThree_spectral_equivalence_of_trace_bridgecouret-programmecouret-unification-20261108
Let be a finite abelian group. Suppose , , , and the image of in has exact order three. Write and , and let if and otherwise, with rational entries. Suppose . Assume also that equality of the two characteristic polynomials implies equality of and for every . Then
This combines the two sufficient spectral branches with a conditional necessity result.
Preamble
import Definitions.Def_Couret_CayleyTwoColourSpectral_cff7591a9c5d
import Mathlib
import Theorems.Thm_Couret_CayleyDoublet_abelianThreeCospectral_of_nongeneration_or_even_quotient
import Theorems.Thm_Couret_CayleyDoublet_abelianThree_spectral_necessity_of_trace_bridge
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_equivalence_of_trace_bridge (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) = ⊤)
(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)) :
((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#L164-L186, lines 164–186; source file SHA-256 7675ca2a1f08e8c6a20617d181810b5c2b6a4f0cffcf96b93678cb0bc9c7869d; theorem Couret.CayleyDoublet.abelianThree_spectral_equivalence_of_trace_bridge