AFTD Auto-Formalizing Theoretical Domains

sumset_vector_weight

def

The weight of an integer vector d is the sum of its positive parts max(d_i, 0).

Statement

def sumset_vector_weight {k : ℕ} (d : Fin k → ℤ) : ℤ
Defined in
arXiv:2611.07303, Definition 3.1
Verified
06 Nov 2026
Axioms
none listed
Used by 1
  • sumset_null_vectorsThe set R_{h,k} is defined as the set of all nonzero vectors d : Fin k → ℤ such that ∑ i, d i = 0, sumset_vector_weight d ≤ (h : ℤ),…

Read back from the Lean

Given a natural number $k$ and a tuple/vector of integers $d : \mathrm{Fin}(k) \to \mathbb{Z}$, sumset_vector_weight d is defined as the sum over all indices $i \in \mathrm{Fin}(k)$ of $\max(d(i), 0)$ (the sum of the positive parts of the components of $d$).

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

/-- The weight w(d) of an integer vector d, defined as the sum of max(d_i, 0). -/
def sumset_vector_weight {k : ℕ} (d : Fin k → ℤ) : ℤ :=
  ∑ i : Fin k, max (d i) 0
See it in the graphDiscuss this resultChallenge it