The sum of two two-torsion elements is two-torsion
ProvedCouret.Strobo2Tors.torsionTwo_addcouret-programmecouret-unification-20261108
Let G be a finite abelian group and let count ordered pairs from the finite support S summing to w. If , then
Preamble
import Definitions.Def_Couret_Prelude_5b3cc8c481fb
import Mathlib
import Mathlib
/-!
STROBO-2TORS: exact finite-abelian triple-support model.
Scope of this module: definitions and elementary two-torsion lemmas ONLY.
The universal collision classification and count are NOT formalized here.
Until a pinned Lean build succeeds, this source is UNCOMPILED.
-/
namespace Couret.Strobo2Tors
variable {G : Type*} [AddCommGroup G] [Fintype G] [DecidableEq G]
Formal statement
theorem torsionTwo_add (a b : G) (ha : a + a = 0) (hb : b + b = 0) :
(a + b) + (a + b) = 0 := by sorry
end Couret.Strobo2Tors
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/a91e50bc44e6bea233226b8e1090ba3e1b805b46/research/STROBO_2TORS_01/lean/STROBO2Tors/Prelude.lean#L55-L59, lines 55–59; source file SHA-256 89fcdc8c9910bcaf6db0f9ef8c7ab2a0a0f7b5e04fda098817c5e55b8bab0dc9; theorem Couret.Strobo2Tors.torsionTwo_add