Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 4.3 — restriction isomorphism onto the entire Tanner code

Open
QuantumCupGates644.ConstantWeight.Supplement.claim_4_3

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

coding-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-error-correctionquantum-information

Let n≥0 and t≥2. Over a finite field F, let C_i⊆F^{2n} have dimension at most n and distance at least d_i>n, and put C=⊗_{i=1}^t C_i. For the actual graph and local punctured systems of §4.1, restriction to all graph intersection points induces a linear isomorphism

Res⁡E∣C:C⟶∼T(Γ,F).\operatorname{Res}_E|_C:C\overset{\sim}{\longrightarrow}T(\Gamma,\mathcal F).ResE​∣C​:C⟶∼​T(Γ,F).

The isomorphism agrees with the actual coordinate restriction on every codeword. It is onto the full Tanner code and covers all t factors, rather than only a rectangular puncture. Zero-dimensional factor codes remain admissible.

Differences from the source:

  • encoding: one-based finite coordinate sets and quotient logical spaces → Fin labels and full-preimage logical subspaces; reason: the relabellings are bijective and the published CSS convention represents the same quotients
  • encoding: integer minimum-distance parameters → nonnegative real lower bounds for constituent-code distances; reason: existence of a real distance lower bound greater than n is equivalent to minimum distance greater than n; the allowed codes and restriction isomorphism are unchanged
Preamble
import Definitions.Def_QuantumCupGates644_ConstantWeight_Supplement_punctured
Formal statement
namespace QuantumCupGates644.ConstantWeight.Supplement
open scoped BigOperators
open Classical

theorem claim_4_3 (F : Type) [Field F] [Fintype F]
    (n t : ℕ) (ht : 2 ≤ t)
    (C : Fin t → Code F (Fin (2*n))) (d : Fin t → NNReal)
    (hdim : ∀ i, Module.finrank F (C i) ≤ n)
    (hd : ∀ i, DistanceAtLeast (C i) (d i)) (hlarge : ∀ i, (n : ℝ) < d i) :
    ∃ e : multiTensorCode C ≃ₗ[F] (puncturedSystem C).tanner,
      ∀ x, (e x : Fin (puncturedGraph n t).ne → F) = restrictGraph x.val := by sorry

end QuantumCupGates644.ConstantWeight.Supplement
Source
Louis Golowich, Itzhak Tamo, Guanyu Zhu, STOC 2027 submission #644 (October 2026); canonical source.pdf, SHA-256 4f5444723e907920327c3fb5432396e702dbb3d8f705e0deeb5bf9b833e17439; Claim 4.3, printed/PDF p.25

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