Existence of the canonical odd quotient return
ProvedCouret.CayleyDoublet.abelianThree_exists_canonical_odd_returncouret-programmecouret-unification-20261108
Let be a finite abelian group and . Suppose , is odd, and has exact order three. Then
Preamble
import Definitions.Def_Couret_CayleyTwoColourNewton_1eb4b626b6a5
import Mathlib
import Theorems.Thm_Couret_CayleyDoublet_abelianThree_canonical_odd_quotient_return
import Theorems.Thm_Couret_CayleyDoublet_odd_ell_of_odd_three_mul
import Definitions.Def_Couret_CayleyTwoColourNewton_1eb4b626b6a5
/-!
COU-20, research-only quotient factor / first-coefficient assembly.
UNCOMPILED candidate (Lean 4.29.1). The first bridge eliminates explicit
arithmetic parameters ell, hell and hsize. The second derives a
noncospectrality theorem under finite-dimensional Newton recurrences.
-/
set_option autoImplicit false
noncomputable section
namespace Couret.CayleyThirdFactor
end Couret.CayleyThirdFactor
namespace Couret.CayleyDoublet
open Couret.CayleyThirdFactor
open Couret.CayleyNewton
variable {G : Type*} [AddCommGroup G] [DecidableEq G] [Fintype G]
Formal statement
theorem abelianThree_exists_canonical_odd_return
(a d h : G)
(hpair : AddSubgroup.closure ({a, h} : Set G) = ⊤)
(hodd : Odd (Nat.card (G ⧸ AddSubgroup.zmultiples h)))
(hdorder : addOrderOf (d : G ⧸ AddSubgroup.zmultiples h) = 3) :
∃ ell : ℕ, 0 < ell ∧ Odd ell ∧
Nat.card (G ⧸ AddSubgroup.zmultiples h) = 3 * ell ∧
(ell • a + d ∈ AddSubgroup.zmultiples h ∨
ell • a - d ∈ AddSubgroup.zmultiples h) := by sorry
end Couret.CayleyDoublet
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/1483e8ae3e5491ee176364fe944c90c4341d40ff/research/correspondants_20261013/lean/CayleyTwoColourThirdFactor.lean#L41-L56, lines 41–56; source file SHA-256 e70e1aee776509b376b41c8a8e2a0e86da60bd4afd69cfc444455445ef314974; theorem Couret.CayleyDoublet.abelianThree_exists_canonical_odd_return