not_finset_has_no_unique_sums_zmod_five_pair
The set {0, 1} in Z/5Z has unique sums (0 + 0 has only one representation).
Statement
theorem not_finset_has_no_unique_sums_zmod_five_pair :
¬ finset_has_no_unique_sums ({0, 1} : Finset (ZMod 5))- Source
- Sanity check of the definitions of arXiv:2610.09349 on a small case.
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- finset_has_no_unique_sumsA has no unique sums (is NUS): |A| ≥ 2 and every sum a + b with a, b ∈ A has at least two representations as an unordered pair from A.
- finset_unordered_sum_rep_countr_{A,2}(s): the number of unordered pairs {a, b} (a = b allowed) of elements of A with a + b = s.
The proof, explained
To show that {0, 1} in ℤ/5ℤ does not satisfy `finset_has_no_unique_sums`, the proof unfolds the definition into an explicit check on the unordered representations of each pair sum. Since {0, 1} is a finite subset of ℤ/5ℤ, the condition is decidable. The `decide` tactic disproves it by finite evaluation, as 0 + 0 = 0 has only {0, 0} as a representation.
The set {0, 1} ⊆ ℤ/5ℤ does not satisfy `finset_has_no_unique_sums`. automation
Unfolding the definition of `finset_has_no_unique_sums` and `finset_unordered_sum_rep_count` turns the claim into the negation of a conjunction: that |{0, 1}| ≥ 2 and that every sum a + b for a, b ∈ {0, 1} has at least two unordered representations. Because {0, 1} is a finite subset of the finite ring ℤ/5ℤ, this is a bounded, decidable condition. The `decide` tactic checks it by direct evaluation: the sum 0 + 0 = 0 has only the single unordered representation {0, 0}, so the universal property fails.
unfold finset_has_no_unique_sums finset_unordered_sum_rep_count; decide
- The proof relies entirely on `decide`, which evaluates the decidable proposition by exhaustive finite computation.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem not_finset_has_no_unique_sums_zmod_five_pair : ¬ finset_has_no_unique_sums ({0, 1} : Finset (ZMod 5)) := by unfold finset_has_no_unique_sums finset_unordered_sum_rep_count; decide