IsAdmissible
def
A finite set A of positive integers is admissible if for any two subsets B and C of A, if the sum of elements in B equals the sum of elements in C, then B and C have the same cardinality.
Statement
def IsAdmissible (A : Finset ℕ) : Prop
- Defined in
- arXiv:2610.34372, Definition 1.1
- Verified
- 29 Oct 2026
- Axioms
- none listed
- Used by 5
- not_isAdmissible_one_two_threeThe set {1, 2, 3} is not an admissible set of natural numbers.
- admissible_card_le_nat_sqrtIf A is a nonempty admissible subset of {1, ..., N}, then the cardinality of A is at most the integer square root of 6 times N.
- admissible_card_sq_add_five_leIf A is a nonempty admissible subset of {1, ..., N}, then the square of the cardinality of A plus 5 is at most 6 times N.
- pairwiseDisjoint_k_sum_of_isAdmissibleIf A is an admissible set of positive integers, then for any distinct integers k₁ and k₂, the set of sums of k₁-element subsets of A and…
- isAdmissible_emptyThe empty set is an admissible set of natural numbers.
Read back from the Lean
For a finite set of natural numbers $A$, IsAdmissible A is defined to hold if and only if for all finite sets of natural numbers $B$ and $C$, if $B \subseteq A$, $C \subseteq A$, and the sum of the elements of $B$ equals the sum of the elements of $C$, then the cardinality of $B$ equals the cardinality of $C$.
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 finite set of positive integers is admissible if any two subsets with the same sum have the same cardinality. -/ def IsAdmissible (A : Finset ℕ) : Prop := ∀ B C, B ⊆ A → C ⊆ A → B.sum id = C.sum id → B.card = C.card