distinct_subset_sums_admissible
def
A sequence of vectors a : Fin n → Fin k → ℕ is admissible if any two subsets S, T ⊆ Fin n with the same subset sum ∑_{i ∈ S} a_i = ∑_{i ∈ T} a_i are equal.
Statement
def distinct_subset_sums_admissible {n k : ℕ} (a : Fin n → Fin k → ℕ) : Prop
- Defined in
- arXiv:2610.26970 Def 1.1
- Verified
- 24 Oct 2026
- Axioms
- none listed
- Used by 1
- distinct_subset_sums_powers_of_two_upper_boundFor all integers k ≥ 1 and n ≥ 1, there exists an admissible sequence a : Fin n → Fin k → ℕ whose maximum entry is at most 2^(Nat.ceil (n…
Read back from the Lean
Given natural numbers n and k (implicit), and a family of vectors a : Fin n → Fin k → ℕ, the predicate distinct_subset_sums_admissible asserts that all subset sums of a are distinct: for all finite subsets S, T ⊆ Fin n, if ∑_{i ∈ S} a(i) = ∑_{i ∈ T} a(i) (evaluated pointwise in Fin k → ℕ), then S = T.
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 sequence of vectors in N^k is admissible if all of its subset sums are distinct. -/ def distinct_subset_sums_admissible {n k : ℕ} (a : Fin n → Fin k → ℕ) : Prop := ∀ (S T : Finset (Fin n)), (∑ i ∈ S, a i) = (∑ i ∈ T, a i) → S = T