Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Directed nontranslation degree sum

Proved
Couret.STROBO2TORS.directed_nontranslation_degree_sum

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]={u:2u=0}H=G[2]=\{u:2u=0\}H=G[2]={u:2u=0}, h=∣H∣h=|H|h=∣H∣, t=∣G[3]∣t=|G[3]|t=∣G[3]∣, and D=∣2G∣D=|2G|D=∣2G∣. Write RS(z)R_S(z)RS​(z) for the ordered pair-sum count of a finite support SSS, F(S)={T:∣T∣=3,RT=RS}F(S)=\{T:|T|=3,R_T=R_S\}F(S)={T:∣T∣=3,RT​=RS​}, O(S)={S+u:u∈H}O(S)=\{S+u:u\in H\}O(S)={S+u:u∈H}, and F∗={S∈F:0∉S}F^*=\{S\in F:0\notin S\}F∗={S∈F:0∈/S}. Ordinary full fibres have size hhh, exceptional full fibres size 2h2h2h. All displayed subtractions are natural subtraction, truncated at zero, and all quotients are integer division. Let EEE be the set of exceptional triple supports, and VVV all three-element supports. Then

∑S∈V∣F(S)∖O(S)∣=∣E∣h.\sum_{S\in V}|F(S)\setminus O(S)|=|E|h.S∈V∑​∣F(S)∖O(S)∣=∣E∣h.

Each nontranslation neighbour contributes in the direction of its source support.

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_mem_exceptionalSupports_card
import Theorems.Thm_Couret_STROBO2TORS_mem_tripleSupports
import Theorems.Thm_Couret_STROBO2TORS_nontranslatedNeighbours_card_exceptional
import Theorems.Thm_Couret_STROBO2TORS_nontranslatedNeighbours_card_ordinary
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 :
    (∑ S ∈ (tripleSupports : Finset (Finset G)),
        (nontranslatedNeighbours S).card) =
      (exceptionalSupports : Finset (Finset G)).card *
        (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 81–120; source file SHA-256 bb81c661856c1b823aeeb307e2603c5cb0aee20a082885d1c0ea1a2cc7b78ead; theorem Couret.STROBO2TORS.directed_nontranslation_degree_sum

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