zero_is_standardized_laplacian_two_fractional
For any natural number n, the n by n zero matrix is a standardized Laplacian with at most two fractional entries per row.
Statement
theorem zero_is_standardized_laplacian_two_fractional (n : ℕ) :
is_standardized_laplacian_two_fractional n (0 : Matrix (Fin n) (Fin n) ℝ)- Source
- arXiv:2610.14100 Proposition 17
- Verified
- 24 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- is_standardized_laplacian_two_fractionalA real matrix L of order n is a standardized Laplacian with at most two fractional entries per row if L is a standardized Laplacian and…
- zero_is_standardized_laplacianFor any natural number n, the n by n zero matrix is a standardized Laplacian matrix of order n.
- 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].
Read back from the Lean
For every natural number n, the n × n zero matrix over ℝ satisfies is_standardized_laplacian_two_fractional n.
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
By definition, a matrix is a standardized Laplacian with at most two fractional entries per row if it is a standardized Laplacian and each row has at most two off-diagonal entries strictly between $-1/n$ and $0$. The first property is provided by the lemma `zero_is_standardized_laplacian`. The second property holds vacuously because every entry of the zero matrix is $0$, which fails the strict inequality $0 < 0$, leaving an empty set of fractional entries in every row.
The zero matrix satisfies the standardized Laplacian condition, reducing the goal to bounding the number of fractional entries per row.
By definition, a matrix is a standardized Laplacian with at most two fractional entries per row if it is a standardized Laplacian and each row contains at most two off-diagonal entries strictly between $-1/n$ and $0$. The first conjunct holds by applying `zero_is_standardized_laplacian`, leaving only the condition on the row entries.
uses
zero_is_standardized_laplacianrefine ⟨zero_is_standardized_laplacian n, ?_⟩Every row of the zero matrix contains at most two fractional entries (in fact, none).
Fix an arbitrary row index $i$. A column $j$ contributes to the count if it satisfies $j \ne i$, $-1/n < 0_{i,j}$, and $0_{i,j} < 0$. Since all entries of the zero matrix are $0$, the requirement $0 < 0$ is false for every $j$. The simplifier recognizes that the set of such indices is empty, so its cardinality is $0 \le 2$, closing the goal.
intro i simp
zero_is_standardized_laplacian- For any natural number $n$, the $n \times n$ zero matrix is a standardized Laplacian (its row sums are zero and all off-diagonal entries lie in $[-(1/n), 0]$).
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The zero matrix is a standardized Laplacian with at most two fractional entries per row. -/theorem zero_is_standardized_laplacian_two_fractional (n : ℕ) : is_standardized_laplacian_two_fractional n (0 : Matrix (Fin n) (Fin n) ℝ) := by refine ⟨zero_is_standardized_laplacian n, ?_⟩ intro i simp