Lemma 4.2 — Randomized additive codes
OpenNearLogSetCover966.Main.Supplement.lemma_4_2p2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1parameterized-complexityset-cover
There are absolute constants , an exponent , and a single randomized program which, for every , and
constructs all tables with output length in at most actual steps on every random path. The entries have the independent uniform law of Appendix B. On one event of probability at least , the resulting code is simultaneously injective and average-list-recoverable. This is the code input required for the amplification reduction.
Formalization Note Binary encodings and the inherited finite incidence and actual-machine conventions are used. All resource witnesses are uniform as specified above.
Differences from the source:
- encoding: existential integral output multiplier λ and randomized table construction → λ=16 and the uniform table law; reason: Appendix B explicitly sets λ=16 and samples all entries independently
- encoding: field alphabet of cardinality q a power of two → binary additive group Vec s with q=2^s and positive k; reason: a fixed binary basis preserves every operation; Definition 4.1 requires positive message dimension
- encoding: real threshold h and polynomial time → floor h encoded, and C(kq+1)^e actual worst-case steps; reason: integer weights make this finite threshold exact; +1 is polynomial padding
Preamble
import Definitions.Def_NearLogSetCover966_Main_Supplement_Codes set_option autoImplicit false
Formal statement
namespace NearLogSetCover966.Main.Supplement
/-- Lemma 4.2, with λ=16 from Appendix B, on the entire stated admissible range. -/
theorem lemma_4_2 :
∃ (β C : ℝ) (e : ℕ) (P : RandomProgram), 0 < β ∧ 0 < C ∧
∀ (k s : ℕ) (h : ℝ), 1 ≤ k → 2 ≤ s → (k : ℝ) ≤ h →
h ≤ β * log2 ((2:ℝ)^s) / (k * log2 (log2 ((2:ℝ)^s))) →
let B := C * ((k : ℝ) * (2:ℝ)^s + 1)^e
P.halts (codeInput k s h) B ∧
(∀ f : Tables k s (16*k),
P.prob (codeInput k s h) B (· = tableEncode f) =
1 / ((2:ℝ)^s) ^ (k * 2^s * (16*k))) ∧
P.prob (codeInput k s h) B (fun y => ∃ f : Tables k s (16*k),
y = tableEncode f ∧ GoodCode f h ⌊h/k⌋₊) ≥ 1 - 1 / (2:ℝ)^s := by sorry
end NearLogSetCover966.Main.Supplement
Source
Bingkai Lin, Xin Zheng, STOC 2027 submission #966 (October 2026), Lemma 4.2, printed p.16 (PDF p.18); proof Appendix B, printed pp.30–31 (PDF pp.32–33)