Three-point ordered convolution-square classification
OpenCouret.Palomar.classificationadditive-combinatoricscouret-programmestrobo
Let be an abelian group with decidable equality, and let be finite supports of size three. For and , define . The pairs are ordered and include the diagonal.
The equality for every is equivalent to at least one of the following conditions.
- There is with and .
- There are with , , , and , such that and .
Here . The classification applies also when and does not require the ambient group to be finite. The Lean statement uses the already-published STROBO definitions of the ordered square and both partner relations.
Preamble
import Definitions.Def_Couret_Strobo2TorsCore_3589e2e5b464 set_option autoImplicit false
Formal statement
namespace Couret.Palomar
open Couret.STROBO2TORS
variable {G : Type*} [AddCommGroup G] [DecidableEq G]
theorem classification (S T : Finset G) (hS : S.card = 3) (hT : T.card = 3) :
(∀ z : G, orderedSquare S z = orderedSquare T z) ↔
OrdinaryPartner S T ∨ ExceptionalPartner S T := by sorry
end Couret.PalomarSource
Alexandre Couret, Palomar PALOMAR-2026-11-08-000010 v1, https://palomar-registry.org/entry?id=PALOMAR-2026-11-08-000010&version=1; https://github.com/alexcour/couret-finite-verifications/blob/24f69d5c2635ff405a628c170086a62d477fd3a5/Challenge.lean#L13-L38, Couret.Palomar.classification. Proof: Solution.lean at the same commit.