Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, equations (13)–(14) — every source coset: distance doubles and short words are the embedded coset

Proved
MetricSelfDualCompletion.Completion.eq_13_14

by mikedeng1 · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theoryp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1self-dual-codes

These are equations (13) and (14) of §3.2 of the paper, under the construction of §3.1 (as in Lemma 8).

Let m≥0m\ge0m≥0, H≥2mH\ge2mH≥2m, let M≤F2NM\le\mathbb F_2^NM≤F2N​ be self-dual with d(M)>2Hd(M)>2Hd(M)>2H, τ(x)=(x,x,0N−2m)\tau(x)=(x,x,0^{N-2m})τ(x)=(x,x,0N−2m), C≤F2mC\le\mathbb F_2^mC≤F2m​ any code, K=M∩τ(C)⊥K=M\cap\tau(C)^\perpK=M∩τ(C)⊥ and A=K+τ(C)A=K+\tau(C)A=K+τ(C). Then for every y∈F2my\in\mathbb F_2^my∈F2m​,

dist(τ(y),A)=2 dist(y,C)(13)\mathrm{dist}(\tau(y),A)=2\,\mathrm{dist}(y,C)\tag{13}dist(τ(y),A)=2dist(y,C)(13)

and

{p∈τ(y)+A: wt(p)≤H}=τ(y+C).(14)\{p\in\tau(y)+A:\ \mathrm{wt}(p)\le H\}=\tau(y+C).\tag{14}{p∈τ(y)+A: wt(p)≤H}=τ(y+C).(14)

Here dist(z,A)=min⁡a∈Awt(z+a)\mathrm{dist}(z,A)=\min_{a\in A}\mathrm{wt}(z+a)dist(z,A)=mina∈A​wt(z+a).

With y=0y=0y=0, (14) is clause (iii) of the main theorem, and (13) is its clause (ii); for general yyy, (14) identifies the short words of every coset of AAA that meets the image of τ\tauτ.

Formalization Note Membership p∈τ(y)+Ap\in\tau(y)+Ap∈τ(y)+A is written p−τ(y)∈Ap-\tau(y)\in Ap−τ(y)∈A, and τ(y+C)\tau(y+C)τ(y+C) as the image of {x:x−y∈C}\{x: x-y\in C\}{x:x−y∈C}. The hypothesis 2m≤N2m\le N2m≤N makes τ\tauτ well-typed.

Differences from the source:

  • generalization: the host MMM of §3.1 built by Proposition 7 → any self-dual MMM with d(M)>2Hd(M)>2Hd(M)>2H; reason: the argument uses only these two properties; Proposition 7 hosts are instances, so it specializes to the source.
  • encoding: "τ(x) = (x, x, 0^{N−2m})" with "N ⩾ d(M) > 2H ⩾ 2m" → hypothesis 2m≤N2m\le N2m≤N; reason: excludes only cases where the padding is undefined; every host of §3.1 satisfies it.
  • encoding: "H ∈ ℤ" → H∈NH\in\mathbb NH∈N; reason: H≥2m≥0H\ge2m\ge0H≥2m≥0; same instances.
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

/-- §3.2, equations (13)–(14), printed p. 8 / PDF p. 10, under the construction of §3.1 (as in
Lemma 8): for every `y ∈ F₂ᵐ`, `dist(τ(y), A) = 2 dist(y, C)` (13) and
`{p ∈ τ(y) + A : wt(p) ⩽ H} = τ(y + C)` (14). -/
theorem eq_13_14 (m H N : ℕ) (M : Submodule (ZMod 2) (Fin N → ZMod 2)) (hM : IsSelfDual M)
    (hdM : ((2 * H : ℕ) : ℕ∞) < minDistCode M) (hH : 2 * m ≤ H) (hN : 2 * m ≤ N)
    (C : Submodule (ZMod 2) (Fin m → ZMod 2)) (y : Fin m → ZMod 2) :
    distToCode (repEmbed m N y) (completionA M C) = 2 * distToCode y C ∧
    {p | p - repEmbed m N y ∈ completionA M C ∧ hammingNorm p ≤ H} =
      repEmbed m N '' {x | x - y ∈ C} := by sorry

end MetricSelfDualCompletion.Completion
Source
Rafail Ostrovsky, STOC 2027 submission #5 (October 2026), §3.2, equations (13)–(14), printed p. 8 (PDF p. 10). https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/5.pdf
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me