Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ordered sum count of a three-element support

Proved
Couret.Strobo2Tors.orderedRep_three

by alexcour · Nov 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

couret-programmecouret-unification-20261108

Let G be a finite additive commutative group with decidable equality. For any a,c,b,w in G with a≠c, a≠b and c≠b, the number orderedRep({a,c,b},w) of ordered pairs (x,y) in {a,c,b}×{a,c,b} satisfying x+y=w equals 1[a+a=w]+1[c+c=w]+1[b+b=w]+2·1[a+c=w]+2·1[a+b=w]+2·1[c+b=w], as an equality of natural numbers. Here each indicator is 1 if its equality holds and 0 otherwise. Different displayed sums may coincide, in which case their contributions add; no distinctness among these sums or restriction on w is assumed.

Preamble
import Definitions.Def_Couret_CrossedOrderThree_8ba7af1c9194
import Mathlib
import Definitions.Def_Couret_CrossedOrderThree_8ba7af1c9194

/-!
Exact expansion of a labelled triple convolution square.
This connects SameSquare to all nine ordered sums, including diagonals.
No assertion of complete classification or uniqueness is made here.
-/

namespace Couret.Strobo2Tors

variable {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]

Formal statement

theorem orderedRep_three (a c b w : G)
    (hac : a ≠ c) (hab : a ≠ b) (hcb : c ≠ b) :
    orderedRep ({a, c, b} : Finset G) w =
      (if a + a = w then 1 else 0) +
      (if c + c = w then 1 else 0) +
      (if b + b = w then 1 else 0) +
      2 * (if a + c = w then 1 else 0) +
      2 * (if a + b = w then 1 else 0) +
      2 * (if c + b = w then 1 else 0) := by sorry


end Couret.Strobo2Tors
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/a91e50bc44e6bea233226b8e1090ba3e1b805b46/research/STROBO_2TORS_01/lean/STROBO2Tors/SquareExpansion.lean#L13-L29, lines 13–29; source file SHA-256 01be501848647215ec5106190839256dcf4cd37b939447c09e682624689abc6c; import module renamed from STROBO2Tors.SquareExpansion to Strobo2TorsSquareExpansion to disambiguate source modules; proof-only compatibility repair; declaration headers and elaborated theorem types preserved; theorem Couret.Strobo2Tors.orderedRep_three

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me