Proposition 14 — from dual-good to self-dual codes
ProvedMetricSelfDualCompletion.Completion.proposition_14coding-theorycomplexity-theorydual-good-codesp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1self-dual-codes
This is Proposition 14 of the paper.
Let and let be a binary linear code with
Then one can deterministically and in time polynomial in construct a self-dual code with
Thus has rate and relative distance at least , i.e. .
Combined with a dual-good family (Theorem 11) this yields self-dual codes of linear length and linear distance (Proposition 7).
Formalization Note The construction is one fixed PvsNP.PolyTimeComputable function mapping an encoded row basis of (dimensions in unary) to an encoded row basis of . Distance bounds are HasMinDistAtLeast (every nonzero codeword has weight at least the bound). is admitted and holds trivially.
Differences from the source:
- encoding: "deterministically and in poly(n)-time construct" → a fixed
PvsNP.PolyTimeComputablefunction mapping an encoded row basis of (dimensions in unary) to an encoded row basis of ; reason: codes are specified by bases (§2.1); the machine model measures input length; no instance changes. - generalization: "Let δ > 0 … we can construct" (algorithm possibly depending on δ) → one algorithm, chosen before , for all ; reason: ∃f ∀δ implies ∀δ ∃f, so it specializes to the source; δ is not an input of the construction.
- reading: "construct … P" from → one per , reached from every row basis of ; reason: P is constructed from the code D; the stronger reading.
Preamble
import Mathlib import Definitions.Def_QAlgorithms_Defs_TensorCode import Definitions.Def_PvsNP import Definitions.Def_MetricSelfDualCompletion_Completion_Codes import Definitions.Def_MetricSelfDualCompletion_Completion_Encoding
Formal statement
namespace MetricSelfDualCompletion.Completion
open QAlgorithms
/-- Proposition 14 (From dual-good to self-dual codes), printed p. 12 / PDF p. 14. Let `δ > 0`.
For every `D ⩽ F₂ⁿ` with `d(D) ⩾ δn` and `d(D^⊥) ⩾ δn` there is a self-dual `P ⩽ F₂^{4n}` with
`dim P = 2n` (rate `1/2`) and `d(P) ⩾ δn = (δ/4)·4n` (relative distance `⩾ δ/4`), and one fixed
deterministic polynomial-time machine maps every row basis of `D` to a row basis of `P`. -/
theorem proposition_14 :
∃ f : List Bool → List Bool, PvsNP.PolyTimeComputable f ∧
∀ (δ : ℝ), 0 < δ → ∀ (n : ℕ) (D : Submodule (ZMod 2) (Fin n → ZMod 2)),
HasMinDistAtLeast D (δ * n) → HasMinDistAtLeast (codeDual D) (δ * n) →
∃ P : Submodule (ZMod 2) (Fin (4 * n) → ZMod 2),
IsSelfDual P ∧ Module.finrank (ZMod 2) P = 2 * n ∧
HasMinDistAtLeast P (δ * n) ∧ HasMinDistAtLeast P (δ / 4 * ((4 * n : ℕ) : ℝ)) ∧
∀ (k : ℕ) (B : Fin k → Fin n → ZMod 2), IsRowBasis B D →
∃ (r : ℕ) (B' : Fin r → Fin (4 * n) → ZMod 2),
IsRowBasis B' P ∧ f (encMatrix B) = encMatrix B' := by sorry
end MetricSelfDualCompletion.Completion
Source
Rafail Ostrovsky, STOC 2027 submission #5 (October 2026), §5.3, Proposition 14, printed p. 12 (PDF p. 14). https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/5.pdf
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.