Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One finite polynomial-time machine for the expanding-code rank test

Proved
ExpandingCodes.PolynomialStretch.binary_tester_implementation_source

by vigyan · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

coding-theorycomplexity-theoryexpanding-codes-polynomial-stretch

Let 0<θ<1/20<\theta<1/20<θ<1/2 be rational and use the specified binary-field geometry in dimension d=dimension(θ)d=\mathrm{dimension}(\theta)d=dimension(θ). There are one finite deterministic machine DDD, integers B>0B>0B>0, b≥0b\geq0b≥0, and N≥2N\geq2N≥2, depending on θ\thetaθ and independent of the input size and received word, such that for every n≥Nn\geq Nn≥N and binary word yyy of length m=rowCount(d,n)m=\mathrm{rowCount}(d,n)m=rowCount(d,n),

D(n,y)=rankTestθ(y)within B(m+n+1)b steps.D(n,y)=\mathrm{rankTest}_{\theta}(y) \quad\text{within }B(m+n+1)^b\text{ steps}.D(n,y)=rankTestθ​(y)within B(m+n+1)b steps.

The test is the canonical finite-field Gram-matrix rank predicate, with its specified row ordering and input/output encodings. This supplies the operational deterministic-testing clause of the efficient-family theorem.

Preamble
import Definitions.Def_ExpandingCodes_PolynomialStretch_BinaryRuntime

set_option autoImplicit false

open scoped Classical
open ExpandingCodes.PolynomialStretch
Formal statement
theorem ExpandingCodes.PolynomialStretch.binary_tester_implementation_source (θ : ℚ)
    (hθ : 0 < (θ : ℝ) ∧ (θ : ℝ) < 1/2) :
    TesterImplementation θ (fun n => binaryGeometry (dimension (θ : ℝ)) n) := by sorry
Source
Isaac M Hair and Amit Sahai, Expanding Codes with Polynomial Stretch, user-supplied 824.pdf, Section 2, Theorem 2.1 (pp. 7-9), https://prove2.me/missions/Expanding_Codes_with_Polynomial_Stretch. Machine-level implementation details were developed in the accompanying Lean formalization; the checked local proof archive has SHA256 694ed62f8511cd5a41c6354a96349e0a72f820296592e4f312215e403a2722d5. Section 2.2, equation (5) and the following displayed rank test, p. 9; formal implementation endpoint ExpandingCodes/Computation/TesterImplementation.lean, binary_tester_implementation_source.

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