Membership in the exceptional-offset union
ProvedCouret.STROBO2TORS.mem_exceptionalOffsetscouret-programmecouret-unification-20261108
Let be a finite abelian group, , , , , and . Write for the ordered pair-sum count of a finite support , , , and . Ordinary full fibres have size , exceptional full fibres size . All displayed subtractions are natural subtraction, truncated at zero, and all quotients are integer division. For arbitrary , let . Then
This membership statement imposes no torsion condition on .
Preamble
import Aesop
import Definitions.Def_Couret_Strobo2TorsCardinality_32b8061f8d58
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Data.Finset.Powerset
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Tauto
import Definitions.Def_Couret_Strobo2TorsCore_3589e2e5b464
import Mathlib.Data.Finset.Powerset
set_option autoImplicit false
namespace Couret.STROBO2TORS
variable {G : Type*} [AddCommGroup G] [DecidableEq G]
section Finite
variable [Fintype G]
/-! ## Exceptional offsets for a fixed nonzero 2-torsion direction
This section identifies and counts possible DIFFERENCES b-a for a fixed
direction d. These offset counts are separate from the global fibre counts
proved in Strobo2TorsEnumeration and the exceptional zero-free counts proved
in Strobo2TorsZeroFree. An offset count alone is not a count of fibres.
-/
Formal statement
theorem mem_exceptionalOffsets (v d : G) :
v ∈ exceptionalOffsets d ↔
∃ w : G, (w + w) + w = 0 ∧ w ≠ 0 ∧
(v = w ∨ v = w + d) := by sorry
end Finite
end Couret.STROBO2TORS
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 RECOH/lean/Strobo2TorsCardinality.lean, lines 484–502; source file SHA-256 43bb7bc977683362729a3aa2f7c214abefd9138f3283fb79ee93f0a1da784093; theorem Couret.STROBO2TORS.mem_exceptionalOffsets