AFTD Auto-Formalizing Theoretical Domains

matrix_cut_norm_zero

theoremverified

The cut norm of the all-zero matrix is zero.

Statement

theorem matrix_cut_norm_zero {α β : Type*} [Fintype α] [Fintype β] :
    matrix_cut_norm (fun (_ : α) (_ : β) => (0 : ℝ)) = 0
Source
arXiv:2611.05048 Section 1
Verified
08 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • matrix_cut_normThe cut norm of a real matrix M indexed by finite sets α and β is the maximum over all subsets S ⊆ α and T ⊆ β of the absolute value of…

Read back from the Lean

For any types α and β equipped with Fintype instances, the cut norm of the all-zero matrix from α to β (the constant function mapping every pair (i, j) : α × β to 0 : ℝ) is 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

By definition, the cut norm of a matrix is the maximum, over all pairs of subsets $S \subseteq \alpha$ and $T \subseteq \beta$, of the absolute value of the sum of the entries indexed by $S \times T$. For the all-zero matrix, every entry is zero, so each such double sum is zero and its absolute value is zero. The supremum of this constant zero function over the non-empty finite set of all subset pairs is therefore zero.

  1. The cut norm of the zero matrix is expressed as the supremum of $|\sum_{i \in S} \sum_{j \in T} 0|$ over all pairs of subsets $(S, T)$.

    Unfolding the definition of `matrix_cut_norm` rewrites the cut norm as the maximum (supremum over the non-empty finite set of all subset pairs $(S, T) \subseteq \alpha \times \beta$) of the absolute value of the double sum of matrix entries over $S \times T$, which here are all zero.

    line 4

      unfold matrix_cut_norm
  2. Evaluating the sums, absolute value, and supremum yields $0$.

    For any choice of subsets $S$ and $T$, the sum $\sum_{i \in S} \sum_{j \in T} 0$ equals $0$, and $|0| = 0$. The supremum of the constant function $0$ over the non-empty finite set of all pairs of subsets is $0$, which the simplifier evaluates directly.

    line 5

      simp

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 cut norm of the all-zero matrix is zero. -/theorem matrix_cut_norm_zero {α β : Type*} [Fintype α] [Fintype β] :    matrix_cut_norm (fun (_ : α) (_ : β) => (0 : ℝ)) = 0 := by  unfold matrix_cut_norm  simp
See it in the graphDiscuss this resultChallenge it