Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Odd traces vanish for the parity-separated triple pair

Proved
Couret.CayleyDoublet.abelianThree_odd_traces_zero_of_parity

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. Let ε:G→Z/2Z\varepsilon:G\to\mathbb Z/2\mathbb Zε:G→Z/2Z be additive, with ε(a)=1\varepsilon(a)=1ε(a)=1 and ε(d)=ε(h)=0\varepsilon(d)=\varepsilon(h)=0ε(d)=ε(h)=0. For every odd natural number nnn,

tr⁡(A+n)=tr⁡(A−n)=0.\operatorname{tr}(A_+^n)=\operatorname{tr}(A_-^n)=0.tr(A+n​)=tr(A−n​)=0.

No half-turn or quotient-order condition is needed for this parity consequence.

Preamble
import Definitions.Def_Couret_CayleyTwoColourSpectral_cff7591a9c5d
import Mathlib
import Theorems.Thm_Couret_CayleyDoublet_abelianCayleyMatrix_parity_sign
import Theorems.Thm_Couret_CayleySpectral_trace_pow_eq_zero_of_odd_of_involution
import Definitions.Def_Couret_CayleyTwoColourAbelian_32e780a833c0

/-!
COU-20 — finite directed spectral bridge (17 October 2026).

This file connects finite-support convolution to the actual rational adjacency
matrices, proves cospectrality for a supplied additive parity and for the
already certified nongeneration branch, and proves exact odd-power and trace
difference formulas. Translation sums are identified with Finset adjacency
only after distinctness has been derived from the exact quotient order.

The construction of parity from quotient cardinality and the full spectral
classification are not asserted by these conditional spectral corollaries.
No undirected-graph extension, independent human review, release or priority
claim is made here. The preceding isomorphism dichotomy is imported unchanged.
-/

set_option autoImplicit false
noncomputable section
open Matrix Polynomial
open scoped BigOperators
namespace Couret.CayleySpectral

variable {ι : Type*} [Fintype ι] [DecidableEq ι]
variable {R : Type*} [CommRing R]

















end Couret.CayleySpectral
namespace Couret.CayleySpectral
/-! An exact odd-power identity, valid in every unital associative ring. -/






















end Couret.CayleySpectral

namespace Couret.CayleyDoublet

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





















end Couret.CayleyDoublet

namespace Couret.CayleyDoublet
open Couret.CayleySpectral
variable {G : Type*} [AddCommGroup G] [DecidableEq G] [Fintype G]








































end Couret.CayleyDoublet

namespace Couret.CayleyDoublet

open Classical

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





















Formal statement

theorem abelianThree_odd_traces_zero_of_parity
    (a d h : G) (ε : G →+ ZMod 2)
    (ha : ε a = 1) (hd : ε d = 0) (hh : ε h = 0) (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/CayleyTwoColourSpectral.lean#L647-L660, lines 647–660; source file SHA-256 c35f0bcb235d6cfd9ce9cf16e4ece0a784c0c18ed967e268865d8a9c061aa16b; theorem Couret.CayleyDoublet.abelianThree_odd_traces_zero_of_parity

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