AFTD Auto-Formalizing Theoretical Domains

sumset_dot_product_set

def

For natural numbers h, k, and q, sumset_dot_product_set h k q is the finset of all values dotProduct x (sumset_finset_sorted_vector k A) where x ∈ sumset_sum_vectors_finset (h + 1) k and A is a k-element subset of {1, ..., q}.

Statement

def sumset_dot_product_set (h k : ℕ) (q : ℕ) : Finset ℤ
Defined in
arXiv:2611.07303 Proposition 5.7
Verified
06 Nov 2026
Axioms
none listed
Built on 4
  • sumset_sum_vectors_finsetFor natural numbers h and k, the finite set sumset_sum_vectors_finset h k is the finset of all vectors x : Fin k → ℤ with components in…
  • sumset_finset_sorted_vectorFor a natural number k and a finset A of integers, sumset_finset_sorted_vector k A is the vector in Fin k → ℤ whose entries are the…
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
Used by 1
  • sumset_rep_support_and_symmetryLet k ≥ 3, h ≥ 2, and q ≥ k be integers. Then sumset_dot_product_set h k q = Finset.Icc ((h : ℤ) + 1) (((h : ℤ) + 1) * (q : ℤ)), its…

Read back from the Lean

sumset_dot_product_set h k q defines the finite set of integers formed by taking the dot product $\mathbf{x} \cdot \mathbf{a}$ of: 1. a vector $\mathbf{x} : \mathrm{Fin}\ k \to \mathbb{Z}$ whose coordinates are non-negative integers summing to $h + 1$, and 2. the vector $\mathbf{a} : \mathrm{Fin}\ k \to \mathbb{Z}$ listing the elements of a $k$-element subset $A \subseteq \{1, \dots, q\} \subset \mathbb{Z}$ in strictly increasing order, over all choices of such $\mathbf{x}$ and such subsets $A$.

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 set S_{h+1,k}(q) of all dot products x · vec(A) for x ∈ X_{h+1,k} and A ∈ binom([q], k). -/
def sumset_dot_product_set (h k : ℕ) (q : ℕ) : Finset ℤ := ((sumset_sum_vectors_finset (h + 1) k) ×ˢ ((Finset.Icc 1 (q : ℤ)).powersetCard k)).image fun (x, A) => dotProduct x (sumset_finset_sorted_vector k A)
See it in the graphDiscuss this resultChallenge it