Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A two-simple cyclic support has two or four square partners

Proved
Couret.InterIA.Fibres.two_simple_fibre_ncard

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

couret-programmecouret-unification-20261108

Let m>0m>0m>0, C⊆Z/(2m)ZC\subseteq\mathbb Z/(2m)\mathbb ZC⊆Z/(2m)Z have two elements and no antipodal pair, and let aaa be such that CCC is disjoint from {a,a+m}\{a,a+m\}{a,a+m}. Put S=C∪{a,a+m}S=C\cup\{a,a+m\}S=C∪{a,a+m}. The family F(S)\mathcal F(S)F(S) of four-sets with the same ordered-square counts satisfies

∣F(S)∣=2or∣F(S)∣=4.|\mathcal F(S)|=2\quad\text{or}\quad|\mathcal F(S)|=4.∣F(S)∣=2or∣F(S)∣=4.

This determines the ambiguity sizes for the two-simple support case.

Preamble
import Definitions.Def_Couret_TwoSimpleFibre_28201a278c39
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.Set.Card
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.Units
import Mathlib.GroupTheory.OrderOfElement
import Mathlib.Tactic.Abel
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Tauto
import Definitions.Def_Couret_WeightedFullPosition_056084203332
import Definitions.Def_Couret_AntipodalFreeFour_f97edb479894
import Definitions.Def_Couret_QuotientBridge_26f10959e8eb
import Mathlib.Data.Set.Card

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























































Formal statement

theorem two_simple_fibre_ncard (m : ℕ) (hm : 0 < m)
    (C : Finset (ZMod (2*m))) (a : ZMod (2*m)) (hC : C.card=2)
    (hfree : AntipodalFree m C) (ha : Disjoint C (fibre (m : ZMod (2*m)) a)) :
    (originalFibre m (C ∪ fibre (m : ZMod (2*m)) a)).ncard=2 ∨
      (originalFibre m (C ∪ fibre (m : ZMod (2*m)) a)).ncard=4 := by sorry


end Couret.InterIA.Fibres
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/TwoSimpleFibre.lean, lines 428–444; source file SHA-256 06c3e6b8dbdb8d80fbe47dc48b06485708ba310ea7e7b7b8681b9c42b32966b7; theorem Couret.InterIA.Fibres.two_simple_fibre_ncard

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