Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

normal form orbit shapes

Proved
Couret.InterIA.Catalogue.Orbits.normal_form_orbit_shapes

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

couret-programmecouret-unification-20261108

For a finite set E, write Q(E,z) for the number of ordered pairs (a,b) in E × E with a+b=z. For every positive natural m and finite S,T⊆ℤ/(2m)ℤ, assume |S∩T|=2, there exist a₀,b₀ with S∖T={a₀,a₀+m} and T∖S={b₀,b₀+m}, and Q(S,z)=Q(T,z) for every z. Let π be reduction modulo m. Then there exist a,b,c,d∈ℤ/(2m)ℤ with S∖T={a,a+m}, T∖S={b,b+m}, c≠d, S∩T={c,d}, and each of π(c),π(d) unequal to each of π(a),π(b). Writing δ=π(b−a), either δ has additive order 2 and π(d)=π(c)+δ, or δ has additive order 4 and (π(c),π(d)) equals (π(a)+2δ,π(a)+3δ) or (π(a)+3δ,π(a)+2δ).

Preamble
import Definitions.Def_Couret_OrbitAssembly_415e94ef1ad8
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.MonoidAlgebra.Defs
import Mathlib.Algebra.MonoidAlgebra.MapDomain
import Mathlib.Data.Finset.Insert
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Finset.SymmDiff
import Mathlib.Data.ZMod.Basic
import Mathlib.GroupTheory.OrderOfElement
import Mathlib.Tactic.Abel
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_InterIA_Catalogue_Orbits_normal_form_geometric_data
import Theorems.Thm_Couret_InterIA_Catalogue_residual_four_atoms
import Definitions.Def_Couret_OrbitGeometry_a2664a5897aa

set_option autoImplicit false
namespace Couret.InterIA.Catalogue.Orbits
open Finset Couret.InterIA.Catalogue Couret.InterIA.Projection Couret.InterIA.Fibres
open Couret.InterIA.Parity







Formal statement
theorem normal_form_orbit_shapes (m : ℕ) (hm : 0 < m)
    (S T : Finset (ZMod (2*m)))
    (hn : Couret.InterIA.NormalForm.Normal (m : ZMod (2*m)) S T)
    (hsq : ∀ z, orderedSquare S z=orderedSquare T z) : OrbitShape m S T := by sorry




end Couret.InterIA.Catalogue.Orbits
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 source-tree/research/interia/m026-hk-review-corollaries-20261103/OrbitAssembly.lean, lines 81–108; source file SHA-256 d6824040ee0d4b903b0ade8b6cd64bca166fac4d10f9c9e004600456bf0ae193; theorem Couret.InterIA.Catalogue.Orbits.normal_form_orbit_shapes

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