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
- bordered_goethals_seidel_cross_blockIf the first columns a, b, c, d (m > 0) sum to 2, 0, 0, 0, then K Lᵀ + T Mᵀ = 0, where K is the 4 × 4 corner, L the 4m × 4 left border of…
- back_identity_matrix_mul_selfThe back-identity matrix is an involution: R R = I.
- mul_back_identity_matrix_applyRight multiplication by the back-identity matrix reverses the columns: (X R) i j = X i (m - 1 - j).
- back_identity_matrix_applyEntry (i, j) of the back-identity matrix is 1 when j is the reversal m - 1 - i of i and 0 otherwise.
- bordered_goethals_seidel_lower_blockIf the circulants A, B, C, D (m > 0) satisfy AAᵀ + BBᵀ + CCᵀ + DDᵀ = (4m+4)I - 4J, then L Lᵀ + M Mᵀ = (4m+4) I for the left border L and…
- bordered_goethals_seidel_matrix_entriesIf a, b, c, d : Fin m → ℤ take only the values 1 and -1, every entry of the bordered Goethals-Seidel matrix built from their circulants is…
- back_identity_matrix_mul_self_mulR (R Z) = Z for the back-identity matrix R.
- back_identity_matrix_mul_applyLeft multiplication by the back-identity matrix reverses the rows: (R X) i j = X (m - 1 - i) j.
- goethals_seidel_array_mul_transposeFor circulant integer matrices A, B, C, D of order m > 0 and R the back-identity matrix, the Goethals-Seidel array M satisfies M Mᵀ =…
- bordered_goethals_seidel_matrixThe (4m+4) × (4m+4) matrix of arXiv:2610.27175 Theorem 5, indexed by Fin 4 ⊕ (Fin 4 × Fin m): top-left 4 × 4 block with diagonal 1 and…
- circulant_mul_back_identity_matrix_row_sumEvery row of X R, X the circulant with first column v and R the back-identity, sums to the sum of v.
- back_identity_matrix_transposeThe back-identity matrix is symmetric: Rᵀ = R.
- back_identity_matrix_mul_circulantR times the circulant with first column v equals the circulant of i ↦ v(-i) times R.
- bordered_goethals_seidel_is_hadamardLet m be even and let A, B, C, D be circulant {±1}-matrices of order m (first columns a, b, c, d) with AAᵀ + BBᵀ + CCᵀ + DDᵀ = (4m+4)I -…
- circulant_mul_back_identity_matrixFor a circulant integer matrix X of order m > 0 and the back-identity matrix R, X R = R Xᵀ.
- back_identity_matrix_mul_circulant_mulR (circulant v Z) = circulant(i ↦ v(-i)) (R Z): the back-identity moves rightward past a circulant, transposing it.
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