AFTD Auto-Formalizing Theoretical Domains

matrix_psd_rank

def

For types m and n, the positive semidefinite rank (psd rank) of a real matrix M : Matrix m n ℝ is the infimum of the set of natural numbers r such that M has a positive semidefinite factorization of size r.

Statement

noncomputable def matrix_psd_rank {m n : Type*} (M : Matrix m n ℝ) : ℕ
Defined in
scout/2610-04498-rank-sensitive-vertex-bounds-for-semidefinite-lifts.md:351
Verified
22 Oct 2026
Axioms
none listed
Built on 1
  • matrix_has_psd_factorizationFor types m and n, a real matrix M : Matrix m n ℝ has a positive semidefinite (PSD) factorization of size r (for a natural number r) if…
Used by 5

Read back from the Lean

Given types m and n and a real matrix M : Matrix m n ℝ, matrix_psd_rank M is defined as the infimum (in ℕ) of the set of all natural numbers r such that M has a positive semidefinite (PSD) factorization of dimension r.

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 positive semidefinite rank of a real matrix is the minimum size of a positive semidefinite factorization. -/
noncomputable def matrix_psd_rank {m n : Type*} (M : Matrix m n ℝ) : ℕ := sInf {r : ℕ | matrix_has_psd_factorization M r}
See it in the graphDiscuss this resultChallenge it