matrix3_triad_decidable_eq
instance
Two triads over a type with decidable equality are equal exactly when their u, v and w components are equal; hence Matrix3Triad R inherits decidable equality from R. In particular, for R = ZMod 2, List.Nodup on lists of triads and any finite enumeration of triads are computable, which is what a reduced-space search needs.
Statement
instance matrix3_triad_decidable_eq (R : Type*) [DecidableEq R] : DecidableEq (Matrix3Triad R)
- Source
- step towards matrix3_tensor_rank_zmod2_le_22
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Built on 1
- Matrix3TriadGiven a type R, a Matrix3Triad R is a structure consisting of three 3-by-3 matrices with entries in R, labeled u, v, and w.
Lean source view module on GitHub
/-- Decidable equality for triads, inherited componentwise; makes `List.Nodup` and finite searches over triads computable. -/ instance matrix3_triad_decidable_eq (R : Type*) [DecidableEq R] : DecidableEq (Matrix3Triad R) := fun a b => decidable_of_iff (a.u = b.u ∧ a.v = b.v ∧ a.w = b.w) (by cases a; cases b; simp [Matrix3Triad.mk.injEq])