Odd multiples cover a finite odd cyclic group up to sign
ProvedCouret.CayleyNecessity.odd_multiple_or_neg_of_cycliccouret-programmecouret-unification-20261108
Let be a finite abelian group of odd cardinality generated by , and let . Then
This finds an odd-degree return to either sign of any target.
Preamble
import Definitions.Def_Couret_CayleyTwoColourSpectral_cff7591a9c5d import Mathlib 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
Formal statement
theorem odd_multiple_or_neg_of_cyclic
{Q : Type*} [AddCommGroup Q] [Finite Q] (alpha delta : Q)
(hgen : AddSubgroup.zmultiples alpha = ⊤)
(hcard : Odd (Nat.card Q)) :
∃ n : ℕ, Odd n ∧ (n • alpha = delta ∨ n • alpha = -delta) := by sorry
end Couret.CayleyNecessity
namespace Couret.CayleyDoublet
open Couret.CayleyNecessity
variable {G : Type*} [AddCommGroup G] [DecidableEq G] [Fintype G]
end Couret.CayleyDoublet
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/65b828d9ffd016ce2a1b05403f303fa5f948c10f/research/correspondants_20261013/lean/CayleyTwoColourNecessity.lean#L42-L70, lines 42–70; source file SHA-256 7675ca2a1f08e8c6a20617d181810b5c2b6a4f0cffcf96b93678cb0bc9c7869d; theorem Couret.CayleyNecessity.odd_multiple_or_neg_of_cyclic