AFTD Auto-Formalizing Theoretical Domains

matrix_nuclear_norm_nonneg

theoremverified

For any square real matrix $M$, its nuclear norm is non-negative.

Statement

theorem matrix_nuclear_norm_nonneg {n : Type*} [Fintype n] [DecidableEq n]
    (M : Matrix n n ℝ) :
    0 ≤ matrix_nuclear_norm M
Source
folklore
Verified
25 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • matrix_nuclear_normThe nuclear norm of a square real matrix $M$ is the sum of its singular values, where $M$ is viewed as a complex matrix.
  • singularValues_nonnegSingular values are nonneg.
  • singularValuesThe singular values of a square complex matrix A, defined as the square roots of the eigenvalues of A†A. These are indexed by d…

Read back from the Lean

For any finite type n with decidable equality, and for any n × n matrix M with real entries, the nuclear norm of M (matrix_nuclear_norm M) is greater than or equal to 0.

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

The proof, explained

The nuclear norm of a square real matrix $M$ is defined as the sum of the singular values of its complexification. Because each singular value of a complex matrix is non-negative, the nuclear norm is a finite sum of non-negative numbers and is therefore non-negative.

  1. The nuclear norm of $M$ is non-negative ($0 ≤ \\operatorname{matrix\\_nuclear\\_norm}(M)$).

    By definition (`matrix_nuclear_norm`), the nuclear norm of $M$ is the sum of the singular values of $M$ considered as a complex matrix. Each singular value is non-negative by `singularValues_nonneg`, and the sum of non-negative terms over a finite set is non-negative by `Finset.sum_nonneg`.

    lines 5–6

    uses Finset.sum_nonneg, singularValues_nonneg

      unfold matrix_nuclear_norm
      exact Finset.sum_nonneg fun i _ => singularValues_nonneg _ i
Finset.sum_nonneg
If every term in a finite sum is non-negative, then the sum is non-negative.
singularValues_nonneg
Every singular value of a square complex matrix is non-negative.

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

/-- The nuclear norm of any square real matrix is non-negative. -/theorem matrix_nuclear_norm_nonneg {n : Type*} [Fintype n] [DecidableEq n]    (M : Matrix n n ℝ) :    0 ≤ matrix_nuclear_norm M := by  unfold matrix_nuclear_norm  exact Finset.sum_nonneg fun i _ => singularValues_nonneg _ i
See it in the graphDiscuss this resultChallenge it