Odd traces vanish for an even quotient
ProvedCouret.CayleyDoublet.abelianThree_odd_traces_zero_of_even_quotientcouret-programmecouret-unification-20261108
Let be a finite abelian group. Let satisfy and . Assume is even. Write and , and let if and otherwise, with rational entries. For every odd natural number ,
This supplies vanishing odd walk traces from quotient parity.
Preamble
import Definitions.Def_Couret_CayleyTwoColourSpectral_cff7591a9c5d
import Mathlib
import Theorems.Thm_Couret_CayleyDoublet_abelianQuotient_generated_pair
import Theorems.Thm_Couret_CayleyDoublet_abelianThree_odd_traces_zero_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 abelianThree_odd_traces_zero_of_even_quotient
(a d h : G)
(horder : addOrderOf (d : G ⧸ AddSubgroup.zmultiples h) = 3)
(hgen : AddSubgroup.closure ({a, d, h} : Set G) = ⊤)
(heven : Even (Nat.card (G ⧸ AddSubgroup.zmultiples h))) (n : ℕ) (hn : Odd n) :
Matrix.trace (abelianCayleyMatrix (AbelianSource a d h) ^ n) = 0 ∧
Matrix.trace (abelianCayleyMatrix (AbelianTarget a d h) ^ n) = 0 := by sorry
end Couret.CayleyDoublet
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/65b828d9ffd016ce2a1b05403f303fa5f948c10f/research/correspondants_20261013/lean/CayleyTwoColourParity.lean#L365-L375, lines 365–375; source file SHA-256 d093cc5d0fb31526ef68d4b1d68ee24818c67ebec52adc75170199eecb1ea7a6; theorem Couret.CayleyDoublet.abelianThree_odd_traces_zero_of_even_quotient