Let be an odd squarefree positive integer and let be a set of units modulo with . Then : every residue class, unit or not, is a sum of three elements of .
This is Corollary 1.5 of Xuancheng Shao, A density version of the Vinogradov three primes theorem, Duke Math. J. 163 (2014) 489-512, arXiv:1206.6139v2. It is the local input to Shao's density version of the three primes theorem, and it is a clean finite statement in its own right.
At the set has five elements, so exactly, and is not a sum of three of its elements. The hypothesis therefore fails by nothing at all and the conclusion already fails. If is weakened to , the statement is false.
The corollary cannot be proved by induction on sets. Passing from to a prime factor splits into fibers of different densities, and a set is the wrong object to carry through that split. The induction has to run on functions , and the corollary is the case of a weighted statement, Proposition 1.4. That is the one step from which the rest follows.
The weighted statement then splits at the primes 3 and 5. For coprime to 30 the induction runs on the prime factors, using Cauchy-Davenport-Chowla for three sets modulo a prime, and it produces the stronger bilinear conclusion . The modulus 15 is handled separately by a linear program over the eight units. Two averaging inequalities, one symmetric and one asymmetric, are what turn a density above into a single good triple in both halves.
The nine milestones follow Shao's own numbering: the two averaging inequalities of Section 2 (Lemmas 2.1 and 2.2), the finite check at (Lemma 2.3), the three-set Cauchy-Davenport-Chowla bound, the divisor reduction that lets the proof assume , the induction away from 3 and 5 (Proposition 3.1), the modulus-15 case (Proposition 3.2), the weighted local result (Proposition 1.4), and the counting bridge that the units modulo number .
Every item is stated in Mathlib primitives alone, so the mission needs no definition items: IsUnit, Nat.totient, Odd, Squarefree, Finset, and Antitone. The set of units modulo is written Finset.univ.filter (fun x => IsUnit x) at each use rather than through a defined abbreviation, so a reader auditing a statement has to trust only Mathlib. That is also why open scoped Classical appears in the preamble.
The density hypothesis is written 5 * Nat.totient m < 8 * A.card, which is cleared of division so the whole statement stays in with no rounding.
namespace ShaoThreeUnits
theorem three_units_of_five_eighths
(m : ℕ) [NeZero m] (hodd : Odd m) (hsq : Squarefree m)
(A : Finset (ZMod m)) (hA : ∀ a ∈ A, IsUnit a)
(hcard : 5 * Nat.totient m < 8 * A.card) (x : ZMod m) :
∃ a ∈ A, ∃ b ∈ A, ∃ c ∈ A, a + b + c = x := by sorry
end ShaoThreeUnits
Let be an odd squarefree positive integer and let be a set every element of which is a unit. If , then every residue class modulo , unit or not, can be written with not necessarily distinct. Equivalently .
The size hypothesis is written 5 * Nat.totient m < 8 * A.card, which is cleared of division so the statement stays in with no rounding.
The constant is sharp and the inequality has to be strict: at the set has five elements, so exactly, and is not a sum of three of its elements.
No open leaves. Every sub-goal is proved or awaiting decomposition.