The canonical quotient third is the first reversed coefficient difference
ProvedCouret.CayleyDoublet.abelianThree_first_reverse_coefficient_differencecouret-programmecouret-unification-20261108
Let be a finite abelian group, with , and generate . Suppose has odd cardinality and has order three. Write for the rational directed Cayley matrices of supports and . Set and use reversed coefficients, zero beyond matrix dimension. Then
Preamble
import Definitions.Def_Couret_CayleyCharpolyTrace_5d18cab1d32f
import Definitions.Def_Couret_CayleyTwoColourNewton_1eb4b626b6a5
import Mathlib
import Mathlib.Algebra.Polynomial.Derivative
import Mathlib.LinearAlgebra.Matrix.Charpoly.Basic
import Mathlib.LinearAlgebra.Matrix.Charpoly.Coeff
import Mathlib.LinearAlgebra.Matrix.Trace
import Mathlib.Tactic.Abel
import Theorems.Thm_Couret_CayleyDoublet_abelianThree_first_trace_difference_at_quotient_third
import Theorems.Thm_Couret_CayleyNewton_first_reverse_coefficient_gap_of_first_trace_difference
import Definitions.Def_Couret_CayleyTwoColourNewton_1eb4b626b6a5
import Definitions.Def_Couret_CayleyCharpolyTrace_5d18cab1d32f
/-!
COU-20 — exact first characteristic coefficient obstruction.
RESEARCH CANDIDATE: must be compiled with the pinned Lean 4.29.1
toolchain and its #print axioms checked before a certification claim.
The general matrix theorem uses the now-proposed unconditional Newton
recurrence for rational square matrices. The directed Cayley corollary
uses the previously established first trace discrepancy at one third
of the odd quotient cardinality. No graph symmetry, loop exclusion,
new axiom, or independent generation assumption is introduced.
-/
set_option autoImplicit false
noncomputable section
open Matrix
namespace Couret.CayleyNewton
variable {i : Type*} [Fintype i] [DecidableEq i]
end Couret.CayleyNewton
namespace Couret.CayleyDoublet
variable {G : Type*} [AddCommGroup G] [DecidableEq G] [Fintype G]
Formal statement
theorem abelianThree_first_reverse_coefficient_difference
(a d h : G)
(hhalf : h + h = 0) (hne : h ≠ 0)
(horder : addOrderOf (d : G ⧸ AddSubgroup.zmultiples h) = 3)
(hpair : AddSubgroup.closure ({a, h} : Set G) = ⊤)
(hodd : Odd (Nat.card (G ⧸ AddSubgroup.zmultiples h))) :
let k := Nat.card (G ⧸ AddSubgroup.zmultiples h) / 3
(∀ j : ℕ, 0 < j → j < k →
Couret.CayleyNewton.reverseCharpolyCoeff
(abelianCayleyMatrix (AbelianSource a d h)) j =
Couret.CayleyNewton.reverseCharpolyCoeff
(abelianCayleyMatrix (AbelianTarget a d h)) j) ∧
Couret.CayleyNewton.reverseCharpolyCoeff
(abelianCayleyMatrix (AbelianSource a d h)) k ≠
Couret.CayleyNewton.reverseCharpolyCoeff
(abelianCayleyMatrix (AbelianTarget a d h)) k := by sorry
end Couret.CayleyDoublet
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/bef25648f750d1b9d7792a883597021665e3ba00/research/correspondants_20261013/lean/CayleyTwoColourFirstCoefficient.lean#L75-L106, lines 75–106; source file SHA-256 f26de50d22cca32e5b50cae2954724a46bdbf8e8b8465f15443d7d7c8bb63e39; theorem Couret.CayleyDoublet.abelianThree_first_reverse_coefficient_difference