Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cyclic four-point normal form

Proved
Couret.InterIA.NormalForm.cyclic_four_L4

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

couret-programmecouret-unification-20261108

For every natural n≥4n\ge4n≥4 and four-element subsets S,T⊆Z/nZS,T\subseteq\mathbb Z/n\mathbb ZS,T⊆Z/nZ with equal ordered-pair sum counts everywhere, if no unit uuu and residue vvv satisfy uS+v=TuS+v=TuS+v=T, then nnn is even and there is a residue ttt equal to 000 or the natural quotient ⌊n/2⌋\lfloor n/2\rfloor⌊n/2⌋, such that, writing T′=T+tT'=T+tT′=T+t and h=⌊n/2⌋h=\lfloor n/2\rfloorh=⌊n/2⌋ in Z/nZ\mathbb Z/n\mathbb ZZ/nZ, ∣S∩T′∣=2|S\cap T'|=2∣S∩T′∣=2 and there exist residues a,ba,ba,b with S∖T′={a,a+h}S\setminus T'=\{a,a+h\}S∖T′={a,a+h} and T′∖S={b,b+h}T'\setminus S=\{b,b+h\}T′∖S={b,b+h}.

Preamble
import Definitions.Def_Couret_L4Assembly_154a326d9c14
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.Tactic.Abel
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Theorems.Thm_Couret_InterIA_NormalForm_even_cyclic_L4
import Theorems.Thm_Couret_InterIA_NormalForm_translation_is_affine
import Definitions.Def_Couret_DisjointReduction_b47db5028f89

set_option autoImplicit false
namespace Couret.InterIA.NormalForm
open Finset Couret.InterIA.Parity Couret.InterIA.Fibres







Formal statement

theorem cyclic_four_L4 (n : ℕ) (hn : 4 ≤ n)
    (S T : Finset (ZMod n)) (hS : S.card=4) (hT : T.card=4)
    (hsq : ∀ z, orderedSquare S z=orderedSquare T z)
    (hnaff : ¬ AffineEquivalent S T) :
    Even n ∧ ∃ t : ZMod n, (t=0 ∨ t=(n/2 : ℕ)) ∧
      Normal ((n/2 : ℕ) : ZMod n) S (T.image (fun x => x+t)) := by sorry




end Couret.InterIA.NormalForm
Source
Alexandre Couret, Cubic observations for four-point convolution reconstruction: universal two-coordinate bound and Lean proof archive, https://zenodo.org/records/23983731; archive Cubic_Observations_Lean_Archive_20261105.zip, SHA-256 7a118549d5729dbcfbfb20bd35fea7ebd91275b7bde61591d6bdda5c13b749ec; file formal/lean/L4Assembly.lean, lines 30–49; source file SHA-256 963e8dd3e3584e7170596d25b739b90c527798bb137acf05581e70913cf1549c; theorem Couret.InterIA.NormalForm.cyclic_four_L4

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