sumset_finset_sorted_vector
deforiginal
For 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 elements of A in strictly increasing order if A has cardinality k, and 0 otherwise.
Statement
def sumset_finset_sorted_vector (k : ℕ) (A : Finset ℤ) : Fin k → ℤ- Related work
- arXiv:2611.07303, Section 5 (line 1263)
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Used by 6
- sumset_rep_countFor natural numbers h, k, q and integer s, sumset_rep_count h k q s is the number of pairs (x, A) in (sumset_sum_vectors_finset (h + 1) k)…
- sumset_rep_count_eq_zero_of_ltFor any k ≥ 1, h, q, and integer s < h + 1, the representation count ν_q(s) is zero.
- sumset_dot_product_setFor 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)…
- sumset_rep_count_le_choose_mul_chooseFor any k ≥ 1, h, q, and integer s, the representation count ν_q(s) is bounded above by (h + k choose k - 1) * (q choose k - 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…
- sumset_rep_count_eq_zero_of_gtFor any k ≥ 1, h, q, and integer s > (h + 1) * q, the representation count ν_q(s) is zero.
Read back from the Lean
Given a natural number $k$ and a finite set of integers $A$, sumset_finset_sorted_vector k A is the function from Fin k to ℤ defined by cases:
- If $|A| = k$, it is the order embedding A.orderEmbOfFin h coerced to a function, which lists the elements of $A$ in strictly increasing order as a vector of length $k$.
- If $|A| \neq k$, it is the constant zero function mapping every element of Fin k to $0$.
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 vector of elements of a finite set of integers of size k in strictly increasing order. -/ def sumset_finset_sorted_vector (k : ℕ) (A : Finset ℤ) : Fin k → ℤ := if h : A.card = k then A.orderEmbOfFin h else 0