AFTD Auto-Formalizing Theoretical Domains

zero_is_standardized_laplacian

theoremverified

For any natural number n, the n by n zero matrix is a standardized Laplacian matrix of order n.

Statement

theorem zero_is_standardized_laplacian (n : ℕ) :
    is_standardized_laplacian n (0 : Matrix (Fin n) (Fin n) ℝ)
Source
folklore
Verified
23 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • is_standardized_laplacianA standardized Laplacian matrix of order n is a real n x n matrix with zero row sums and off-diagonal entries in [-1/n, 0].
Used by 1

Read back from the Lean

For every natural number $n$, the $n \times n$ zero matrix with real entries is a standardized Laplacian (as defined by is_standardized_laplacian), meaning that all of its row sums are zero and every off-diagonal entry lies in the interval $[-1/n, 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

To show that the $n \times n$ zero matrix is a standardized Laplacian, we check the two conditions of the definition: row sums must be zero, and off-diagonal entries must lie in $[-1/n, 0]$. Row sums are zero because every entry of the zero matrix is zero. For any pair of distinct indices, the entry is zero, which trivially satisfies the upper bound $0 \le 0$ and satisfies the lower bound $-1/n \le 0$ because the numerator is nonpositive and the denominator is nonnegative.

  1. The goal splits into two conditions: each row sums to zero, and every off-diagonal entry lies in $[-1/n, 0]$.

    Unfolding the definition of a standardized Laplacian matrix, the constructor tactic splits the conjunction into the row-sum requirement and the off-diagonal bounding requirement.

    line 4

      constructor
  2. Every row of the zero matrix sums to zero.

    We introduce an arbitrary row index $i$. Since every entry of the zero matrix is $0$, the row sum $\sum_j 0$ simplifies directly to $0$.

    lines 5–6

      · intro i
        simp
  3. For distinct indices $i \ne j$, the requirement splits into the lower bound $-1/n \le 0_{i,j}$ and the upper bound $0_{i,j} \le 0$.

    We introduce arbitrary indices $i$ and $j$ together with the hypothesis $i \ne j$, and split the conjunction $-1/n \le 0_{i,j} \wedge 0_{i,j} \le 0$ into two separate inequality goals.

    lines 7–8

      · intro i j hij
        constructor
  4. The off-diagonal entry satisfies the lower bound $-1/n \le 0_{i,j}$.

    The entry $0_{i,j}$ simplifies to $0$, reducing the goal to $-1/n \le 0$. The numerator satisfies $-1 \le 0$ by numerical evaluation, and the denominator satisfies $n \ge 0$ by Nat.cast_nonneg. By div_nonpos_of_nonpos_of_nonneg, the quotient of a nonpositive number and a nonnegative number is nonpositive, so $-1/n \le 0$ holds.

    lines 9–10

    uses div_nonpos_of_nonpos_of_nonneg, Nat.cast_nonneg

        · simpa using
            div_nonpos_of_nonpos_of_nonneg (by norm_num : (-1 : ℝ) ≤ 0) (Nat.cast_nonneg n)
  5. The off-diagonal entry satisfies the upper bound $0_{i,j} \le 0$.

    Since the matrix entry $0_{i,j}$ is $0$, the inequality simplifies to $0 \le 0$, which holds trivially.

    line 11

        · simp
div_nonpos_of_nonpos_of_nonneg
Dividing a nonpositive element by a nonnegative element in an ordered group with zero yields a nonpositive result: if $a \le 0$ and $0 \le b$, then $a / b \le 0$.
Nat.cast_nonneg
The coercion of any natural number into an ordered semiring (such as $\mathbb{R}$) is nonnegative: $0 \le \uparrow n$.

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 zero matrix of size n x n is a standardized Laplacian matrix. -/theorem zero_is_standardized_laplacian (n : ℕ) :    is_standardized_laplacian n (0 : Matrix (Fin n) (Fin n) ℝ) := by  constructor  · intro i    simp  · intro i j hij    constructor    · simpa using        div_nonpos_of_nonpos_of_nonneg (by norm_num : (-1 : ℝ) ≤ 0) (Nat.cast_nonneg n)    · simp
See it in the graphDiscuss this resultChallenge it