AFTD Auto-Formalizing Theoretical Domains

matrix3_unit_check_int

def

A computable Bool-valued checker that tests a list L of triads over ℤ against all 81 pairs of 3x3 matrix units: it returns true exactly when, for every i j k l : Fin 3, the evaluation of L at the unit pair equals the product of those units.

Statement

def matrix3_unit_check_int (L : List (Matrix3Triad ℤ)) : Bool
Source
step towards matrix3_tensor_rank_int_le_22
Verified
23 Oct 2026
Axioms
none listed
Built on 2
  • 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.
  • eval_matrix3_decompositionGiven a commutative semiring R, a list L of Matrix3Triad R, and 3x3 matrices A and B over R, eval_matrix3_decomposition L A B is the sum…
Used by 3

Lean source view module on GitHub

/-- Computable Bool checker testing a list of integer triads on all 81 matrix unit pairs. -/
def matrix3_unit_check_int (L : List (Matrix3Triad ℤ)) : Bool := (List.finRange 3).all fun i =>
  (List.finRange 3).all fun j =>
  (List.finRange 3).all fun k =>
  (List.finRange 3).all fun l =>
    decide (eval_matrix3_decomposition L (Matrix.single i j (1 : ℤ)) (Matrix.single k l (1 : ℤ))
      = Matrix.single i j (1 : ℤ) * Matrix.single k l (1 : ℤ))
See it in the graphDiscuss this resultChallenge it