AFTD Auto-Formalizing Theoretical Domains

back_identity_matrix

def

The back-identity (reversal) matrix R of order m over ℤ: R i j = 1 when i + j ≡ m - 1 (mod m), equivalently i + j + 1 = m for indices below m, and 0 otherwise.

Statement

def back_identity_matrix (m : ℕ) : Matrix (Fin m) (Fin m) ℤ
Defined in
arXiv:2610.27175 (Recent progress in the construction of Hadamard matrices), Theorem 3 and Theorem 5: the matrix R of the Goethals-Seidel array
Verified
22 Oct 2026
Axioms
none listed
Used by 16

Lean source view module on GitHub

/-- The back-identity (reversal) matrix R of order m over ℤ: R i j = 1 when i + j ≡ m - 1 (mod m), equivalently i + j + 1 = m for indices below m, and 0 otherwise. -/
def back_identity_matrix (m : ℕ) : Matrix (Fin m) (Fin m) ℤ :=
  Matrix.of fun i j => if (i : ℕ) + j + 1 = m then 1 else 0
See it in the graphDiscuss this resultChallenge it