Lemma 6.4 — implies
ProvedRelatedSchedFPTAS796.Main.lemma_6_4additive-combinatoricsp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a subset of a finite abelian group . If , then
Lemma 6.7 uses it to conclude that a sumset covering more than half of the residues modulo , doubled, covers all of them.
Differences from the source: none.
Preamble
import Mathlib set_option autoImplicit false open Pointwise
Formal statement
namespace RelatedSchedFPTAS796.Main
/-- **Lemma 6.4**, p.19 (proof Appendix A, p.25). Let `A` be a subset of a finite abelian group
`G`. If `|A| > |G|/2`, then `A + A = G`. -/
theorem lemma_6_4 {G : Type*} [AddCommGroup G] [Finite G] (A : Set G)
(hA : (Nat.card G : ℚ) / 2 < Nat.card A) : A + A = Set.univ := by sorry
end RelatedSchedFPTAS796.Main
Source
Lin Chen, Tingwei Hu, Jiayi Lian, Yuchen Mao, Guochuan Zhang, Faster Approximation Schemes for Scheduling on Related Machines, STOC 2027 submission #796 (October 2026), source.pdf SHA-256 5d7d0135eed9cbe942c80598e2bb07d8c56ab67aec0d6e8486a067237654f7f3, p.19, Lemma 6.4 (proof Appendix A, p.25)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.