The first doubled value recovers its rectangle pair
ProvedCouret.Strobo2Tors.rectangle_filter_firstcouret-programmecouret-unification-20261108
Let be a finite abelian group and , . If and , then
Preamble
import Definitions.Def_Couret_RectangleFibres_2930a0e95467
import Mathlib
import Definitions.Def_Couret_Prelude_5b3cc8c481fb
/-!
STROBO type-II rectangle: intrinsic recovery of the two doubled fibres.
This file does not prove the full universal collision classification.
Given u+u=0 and doubleValue x != doubleValue y, the four-point
rectangle {x,x+u,y,y+u} splits canonically by the doubling map into
the two sets {x,x+u} and {y,y+u}.
-/
namespace Couret.Strobo2Tors
variable {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
Formal statement
theorem rectangle_filter_first (x y u : G)
(hu : u + u = 0) (hxy : doubleValue x ≠ doubleValue y) :
(rectangleSet x y u).filter (fun z => doubleValue z = doubleValue x) =
pairSet x u := by sorry
end Couret.Strobo2Tors
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/a91e50bc44e6bea233226b8e1090ba3e1b805b46/research/STROBO_2TORS_01/lean/STROBO2Tors/RectangleFibres.lean#L37-L51, lines 37–51; source file SHA-256 b58bd5cc6a9c03963265e4cd70ec907a0c62b9c159fe478c6e46672a7d4e1d68; theorem Couret.Strobo2Tors.rectangle_filter_first