Twenty-two cheapest card triples cover Z/15Z
ProvedShaoThreeUnits.cover_c1aadditive-combinatoricsnumber-theory
Let be the unit group of . Let be the explicit set of the twenty-two cheapest card triples from the first cover chunk of Shao Lemma 2.3 (all triples of check-cost at most ). If and , then equals .
This is a split of Path C chunk 1. It does not treat the remaining twenty mixed triples of , nor the full lemma.
Formalization Note. The Lean statement is ShaoThreeUnits.cover_c1a.
Preamble
import Mathlib open Finset open scoped Pointwise
Formal statement
namespace ShaoThreeUnits
def units15 : Finset (ZMod 15) := {1, 2, 4, 7, 8, 11, 13, 14}
def c1Cards : Finset (Nat × Nat × Nat) := {
(8, 8, 8), (7, 8, 8), (8, 7, 8), (8, 8, 7),
(2, 8, 8), (6, 8, 8), (8, 2, 8), (8, 6, 8), (8, 8, 2), (8, 8, 6),
(3, 8, 8), (5, 8, 8), (8, 3, 8), (8, 5, 8), (8, 8, 3), (8, 8, 5),
(7, 7, 8), (7, 8, 7), (8, 7, 7),
(4, 8, 8), (8, 4, 8), (8, 8, 4)
}
theorem cover_c1a (A B C : Finset (ZMod 15))
(hA : A ⊆ units15) (hB : B ⊆ units15) (hC : C ⊆ units15)
(hp : (A.card, B.card, C.card) ∈ c1Cards) :
(A + B + C : Finset (ZMod 15)) = univ := by sorry
end ShaoThreeUnitsSource
Shao, Three units of Z/15Z, arXiv:1206.6139, Lemma 2.3, cheapest 22 of 42 card triples