Equal ordered-sum counts for reflected triples
ProvedCouret.CayleyDoublet.abelianOrderedSquare_source_targetcouret-programmecouret-unification-20261108
Let be an abelian group. Let , with and . Assume the entries of each of and are pairwise distinct. Set and . Then
This gives the convolution equality for actual finite supports.
Preamble
import Definitions.Def_Couret_CayleyTwoColourAbelian_32e780a833c0
import Mathlib
import Theorems.Thm_Couret_CayleyDoublet_abelianOrderedSquare_triple
import Theorems.Thm_Couret_CayleyDoublet_abelianTripleSquareCoeff_source_target
import Definitions.Def_Couret_CayleyDoubletCore_59125eeb43b1
import Definitions.Def_Couret_CayleyDoubletCore_59125eeb43b1
set_option autoImplicit false
/-!
COU-20 — abelian two-colour bridge (17 Oct 2026).
The directed isomorphism dichotomy for the exceptional triple pair is
assembled below, including its exact order-three quotient formulation.
It retains a nonzero half-turn and generation by a,d,h; no finiteness or
cyclicity assumption is added. No spectral-necessity or undirected-graph
extension, independent human review, release or priority claim.
-/
namespace Couret.CayleyDoublet
section AbelianTwoColour
variable {G : Type*} [AddCommGroup G] [DecidableEq G]
/-!
COU-20: ordered-square algebra ported from the STROBO proof (PR #25,
Strobo2TorsCore.lean at d4a1f9718). This internal dependency is intentionally
copied with provenance rather than merging separate research branches.
-/
Formal statement
theorem abelianOrderedSquare_source_target
(a d h z : G) (hh : h + h = 0)
(hthree : (d + d) + d = 0 ∨ (d + d) + d = h)
(hs1 : a ≠ a + d)
(hs2 : a ≠ (a + d) + h)
(hs3 : a + d ≠ (a + d) + h)
(ht1 : a ≠ a - d)
(ht2 : a ≠ (a - d) + h)
(ht3 : a - d ≠ (a - d) + h) :
abelianOrderedSquare (AbelianSource a d h) z =
abelianOrderedSquare (AbelianTarget a d h) z := by sorry
/-!
COU-20: a CONDITIONAL construction of the d -> -d reflection.
This section first treats a supplied 3-torsion idempotent projection.
The final normal-form construction below derives it from generation by
a,d,h and properness of the subgroup generated by a,h.
-/
/-!
## COU-20: Three-valued quotient character as a constructive intermediary
If the index-three quotient provides a character χ : G →+ ZMod 3 with
χ(a)=χ(h)=0 and χ(d)=1, the required additive projection can be
constructed explicitly. The final elementary normal-form theorem below
derives χ from the stated generation and subgroup properness hypotheses.
-/
/-!
## COU-20: closure-level intrinsic obstruction (no cyclicity hypothesis)
This strengthens the previous "b = k•a modulo h" obstruction:
an isomorphism preserves shifts by both a and h, hence by the subgroup
they generate. No cardinality bound and no finite-group assumption.
-/
/-!
COU-20: formal assembly of the two directions.
The separated-support version exposes the exact hypotheses required
by the intrinsic-colour obstruction. The next corollary discharges
these separations from the order-three quotient arithmetic.
-/
/-!
## COU-20: exact separation criterion and order-three quotient corollary
-/
end AbelianTwoColour
end Couret.CayleyDoublet
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/65b828d9ffd016ce2a1b05403f303fa5f948c10f/research/correspondants_20261013/lean/CayleyTwoColourAbelian.lean#L301-L319, lines 301–319; source file SHA-256 c9643d6e3a677d5a903623825d50a309d87175a21ace2b7ab56939d9189f13b1; theorem Couret.CayleyDoublet.abelianOrderedSquare_source_target