Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A product formula for actual unordered nontranslation pairs

Proved
Couret.STROBO2TORS.nontranslationUnorderedPairCount_product

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

couret-programmecouret-unification-20261108

Let GGG be a finite abelian group, N=∣G∣N=|G|N=∣G∣, h=∣G[2]∣h=|G[2]|h=∣G[2]∣, t=∣G[3]∣t=|G[3]|t=∣G[3]∣, and D=∣2G∣D=|2G|D=∣2G∣. For finite supports write RAR_ARA​ for ordered pair-sum counts. Natural subtraction below is truncated at zero and division is integer division. Let UUU count unordered pairs of triple supports with equal square and no ambient translation. Then

U=Dh2(h−1)t−12.U=Dh^2(h-1)\frac{t-1}{2}.U=Dh2(h−1)2t−1​.

The last factor counts nonzero three-torsion sign pairs.

These supports may contain zero.

Preamble
import Aesop
import Definitions.Def_Couret_Strobo2TorsUnorderedPairs_09c78b93fb82
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Combinatorics.SimpleGraph.DegreeSum
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Fintype.Card
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_STROBO2TORS_directed_nontranslation_degree_sum_numeric
import Theorems.Thm_Couret_STROBO2TORS_group_card_eq_h_mul_doublingImages
import Theorems.Thm_Couret_STROBO2TORS_nontranslationPairGraph_degree_sum
import Theorems.Thm_Couret_STROBO2TORS_threeTorsion_nonzero_card_eq_two_pairs
import Definitions.Def_Couret_Strobo2TorsNontranslationDegree_16ff2822736a
import Mathlib.Combinatorics.SimpleGraph.DegreeSum
import Mathlib.Tactic.Ring
import Lean.Elab.Tactic.Omega

set_option autoImplicit false

open scoped BigOperators

namespace Couret.STROBO2TORS

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





















Formal statement

theorem nontranslationUnorderedPairCount_product :
    nontranslationUnorderedPairCount (G := G) =
      (doublingImages : Finset G).card *
        (twoTorsion : Finset G).card *
        (twoTorsion : Finset G).card *
        ((twoTorsion : Finset G).card - 1) *
        (threeSignPairs : Finset (Finset G)).card := by sorry


end Couret.STROBO2TORS

Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/3fb45e3419d8f464ba08064afe59061c6f6f9189/research/strobo-2tors-2026-10-12/lean/Strobo2TorsUnorderedPairs.lean#L146-L173, lines 146–173; source file SHA-256 0a0634b10b5614f2bdf375961002c86d0995bc2a8ad571bab13c0dd8918d2528; theorem Couret.STROBO2TORS.nontranslationUnorderedPairCount_product

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