AFTD Auto-Formalizing Theoretical Domains

is_standardized_laplacian_two_fractional

def

A 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 for every row i, the number of columns j ≠ i with -(1/n) < L i j < 0 is at most 2.

Statement

def is_standardized_laplacian_two_fractional (n : ℕ) (L : Matrix (Fin n) (Fin n) ℝ) : Prop
Defined in
arXiv:2610.14100 Proposition 17
Verified
24 Oct 2026
Axioms
none listed
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 7

Read back from the Lean

For a natural number $n$ and an $n \times n$ matrix $L$ with real entries (indexed by Fin n), the predicate asserts that: 1. $L$ is a standardized Laplacian: a. Every row sum is zero: for all $i \in \{0, \dots, n-1\}$, $\sum_{j=0}^{n-1} L_{i, j} = 0$. b. Every off-diagonal entry lies in $[-1/n, 0]$: for all $i, j \in \{0, \dots, n-1\}$ with $i \neq j$, $-(1/n) \le L_{i, j} \le 0$. 2. For each row $i \in \{0, \dots, n-1\}$, the number of off-diagonal column indices $j \neq i$ such that $L_{i, j}$ strictly lies between $-1/n$ and $0$ (i.e., $-(1/n) < L_{i, j} < 0$) is at most 2.

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

/-- A standardized Laplacian matrix of order n where each row has at most two off-diagonal entries in (-1/n, 0). -/
def is_standardized_laplacian_two_fractional (n : ℕ) (L : Matrix (Fin n) (Fin n) ℝ) : Prop := is_standardized_laplacian n L ∧
  ∀ i : Fin n, ((Finset.univ.filter (fun j : Fin n => j ≠ i ∧ -(1 : ℝ) / n < L i j ∧ L i j < 0)).card ≤ 2)
See it in the graphDiscuss this resultChallenge it