odd common part impossible
ProvedCouret.InterIA.IntersectionThree.odd_common_part_impossiblecouret-programmecouret-unification-20261108
For every abelian group with decidable equality, write for the number of ordered pairs with . there are no finite subset and satisfying all of , , , , modulo , and for every .
Preamble
import Definitions.Def_Couret_IntersectionThree_e6b918e458b3
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.MonoidAlgebra.Defs
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 Definitions.Def_Couret_AntipodalFibres_0fc966ab17b4
import Definitions.Def_Couret_GroupRingBridge_e289cfa11c86
import Definitions.Def_Couret_TranslationControls_1ed5eea33a54
set_option autoImplicit false
namespace Couret.InterIA.IntersectionThree
open Finset Couret.InterIA.Parity Couret.InterIA.GroupRing Couret.InterIA.Fibres
variable {G : Type*} [AddCommGroup G] [DecidableEq G]
Formal statement
theorem odd_common_part_impossible (C : Finset G) (a h : G)
(hh : h ≠ 0) (hh2 : h+h=0) (ha : a ∉ C) (hb : a+h ∉ C)
(hodd : C.card % 2 = 1)
(hsquare : ∀ z, orderedSquare (insert a C) z = orderedSquare (insert (a+h) C) z) :
False := by sorry
end Couret.InterIA.IntersectionThree
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/IntersectionThree.lean, lines 59–65; source file SHA-256 b3124b74c98f6b286643eb93c66bfec0060bc80c1705a4a9f43c218fe84883d2; theorem Couret.InterIA.IntersectionThree.odd_common_part_impossible