AFTD Auto-Formalizing Theoretical Domains

q_perm_counterexample_matrix

def

The 5-by-5 integer matrix with diagonal (5, 5, 1, 5, 5) and nonzero off-diagonal entries A_{0,3} = A_{3,0} = 4, A_{0,4} = A_{4,0} = 1, A_{1,3} = A_{3,1} = -1, and A_{1,4} = A_{4,1} = 4.

Statement

def q_perm_counterexample_matrix : Matrix (Fin 5) (Fin 5) ℤ
Defined in
arXiv:2611.14694, Theorem 2.1
Verified
13 Nov 2026
Axioms
none listed

Read back from the Lean

Definition of a 5 × 5 matrix of integers, named q_perm_counterexample_matrix, whose rows (indexed from 0 to 4) are: - Row 0: [5, 0, 0, 4, 1] - Row 1: [0, 5, 0, -1, 4] - Row 2: [0, 0, 1, 0, 0] - Row 3: [4, -1, 0, 5, 0] - Row 4: [1, 4, 0, 0, 5]

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The 5x5 integer matrix from arXiv:2611.14694 Theorem 2.1 that disproves q-permanent monotonicity. -/
def q_perm_counterexample_matrix : Matrix (Fin 5) (Fin 5) ℤ :=
  !![ 5,  0, 0,  4, 1;
      0,  5, 0, -1, 4;
      0,  0, 1,  0, 0;
      4, -1, 0,  5, 0;
      1,  4, 0,  0, 5]
See it in the graphDiscuss this resultChallenge it