Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Total directed nontranslation degree

Proved
Couret.STROBO2TORS.directed_nontranslation_degree_sum_numeric

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

couret-programmecouret-unification-20261108

Let GGG be a finite abelian group. Write H=G[2]={x:2x=0}H=G[2]=\{x:2x=0\}H=G[2]={x:2x=0}, K=G[3]={x:3x=0}K=G[3]=\{x:3x=0\}K=G[3]={x:3x=0}, n=∣G∣n=|G|n=∣G∣, h=∣H∣h=|H|h=∣H∣, and t=∣K∣t=|K|t=∣K∣. For a finite support SSS, let QS(z)Q_S(z)QS​(z) count ordered pairs in S2S^2S2 with sum zzz, let F(S)F(S)F(S) be its fibre among three-element supports, and put S+u={x+u:x∈S}S+u=\{x+u:x\in S\}S+u={x+u:x∈S}. For each three-element support SSS, let N(S)N(S)N(S) be its nontranslated square-collision neighbours. Then

∑∣S∣=3∣N(S)∣=n(h−1)(t−1)h.\sum_{|S|=3}|N(S)|=n(h-1)(t-1)h.∣S∣=3∑​∣N(S)∣=n(h−1)(t−1)h.

All subtractions and products are in the natural numbers.

Preamble
import Aesop
import Definitions.Def_Couret_Strobo2TorsNontranslationDegree_16ff2822736a
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Fintype.Card
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_STROBO2TORS_directed_nontranslation_degree_sum
import Theorems.Thm_Couret_STROBO2TORS_exceptionalSupports_card
import Definitions.Def_Couret_Strobo2TorsNontranslationBridge_e18319b1ae30
import Definitions.Def_Couret_Strobo2TorsEnumeration_d0ac93e4ff30

set_option autoImplicit false

open scoped BigOperators

namespace Couret.STROBO2TORS

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















Formal statement

theorem directed_nontranslation_degree_sum_numeric :
    (∑ S ∈ (tripleSupports : Finset (Finset G)),
        (nontranslatedNeighbours S).card) =
      (Fintype.card G * ((twoTorsion : Finset G).card - 1) *
        ((threeTorsion : Finset G).card - 1)) *
        (twoTorsion : Finset G).card := by sorry


end Couret.STROBO2TORS

Source
Alexandre Couret, Couret — Additive reconstruction: STROBO-4, singleton collisions and RECOH formal proof artifacts, https://zenodo.org/records/23980513; archive COURET_MATHEMATIQUES_20261105.zip, SHA-256 19a3b59aee930df74cab79c27b29e014843bd17179a26fef1261ed6b5a651ab7; file RECOH/lean/Strobo2TorsNontranslationDegree.lean, lines 122–130; source file SHA-256 bb81c661856c1b823aeeb307e2603c5cb0aee20a082885d1c0ea1a2cc7b78ead; theorem Couret.STROBO2TORS.directed_nontranslation_degree_sum_numeric

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