back_identity_matrix_mul_self_mul
R (R Z) = Z for the back-identity matrix R.
Statement
theorem back_identity_matrix_mul_self_mul (m : ℕ) (Z : Matrix (Fin m) (Fin m) ℤ) :
back_identity_matrix m * (back_identity_matrix m * Z) = Z- Source
- helper for the Goethals-Seidel array identity, arXiv:2610.27175 Theorem 3
- Verified
- 22 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- back_identity_matrixThe 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…
- back_identity_matrix_mul_selfThe back-identity matrix is an involution: R R = I.
The proof, explained
The theorem states that multiplying a matrix $Z$ twice on the left by the back-identity matrix $R$ yields $Z$. The proof reassociates the product $R (R Z)$ to $(R R) Z$ using associativity of matrix multiplication. Since the back-identity matrix is an involution ($R R = 1$), this reduces to $1 Z$, which simplifies directly to $Z$.
The double multiplication of $Z$ on the left by the back-identity matrix yields $Z$.
Using associativity of matrix multiplication (`Matrix.mul_assoc`), rewrite $R (R Z)$ as $(R R) Z$. Then, substitute $R R = 1$ using `back_identity_matrix_mul_self`, and finally apply `Matrix.one_mul` to simplify $1 Z$ to $Z$.
uses
Matrix.mul_assoc,back_identity_matrix_mul_self,Matrix.one_mulrw [← Matrix.mul_assoc, back_identity_matrix_mul_self, Matrix.one_mul]
Matrix.mul_assoc- Matrix multiplication is associative: $(L M) N = L (M N)$.
back_identity_matrix_mul_self- The back-identity matrix is its own inverse: $R R = 1$.
Matrix.one_mul- Multiplying a matrix on the left by the identity matrix leaves it unchanged: $1 M = M$.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem back_identity_matrix_mul_self_mul (m : ℕ) (Z : Matrix (Fin m) (Fin m) ℤ) : back_identity_matrix m * (back_identity_matrix m * Z) = Z := by rw [← Matrix.mul_assoc, back_identity_matrix_mul_self, Matrix.one_mul]