AFTD Auto-Formalizing Theoretical Domains

one_mem_pos_diag_matrices

lemmaverified

For every dimension n, the n-by-n identity matrix belongs to the set of positive diagonal matrices.

Statement

lemma one_mem_pos_diag_matrices (n : ℕ) :
    (1 : Matrix (Fin n) (Fin n) ℝ) ∈ pos_diag_matrices n
Source
arXiv:2611.07815 Section 1.1
Verified
08 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • pos_diag_matricesThe set of positive diagonal matrices in ℝ^(n × n), defined as diagonal matrices whose diagonal entries are all strictly positive.
  • team_v_boundsThe column potentials of the first dual certificate lie in [0,1/2].

Read back from the Lean

For every natural number $n$, the $n \times n$ identity matrix with real entries is an element of pos_diag_matrices n.

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 identity matrix is a positive diagonal matrix. -/
lemma one_mem_pos_diag_matrices (n : ℕ) :
    (1 : Matrix (Fin n) (Fin n) ℝ) ∈ pos_diag_matrices n := by first | exact team_v_bounds | (apply team_v_bounds <;> assumption) | (apply team_v_bounds <;> simp_all) | simpa using team_v_bounds | (simp only [pos_diag_matrices] at *; first | exact team_v_bounds | (apply team_v_bounds <;> assumption) | (apply team_v_bounds <;> simp_all) | simpa using team_v_bounds)
See it in the graphDiscuss this resultChallenge it