Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 5.3 / Theorem 1.2 — linear yield and full headline family

Open
QuantumCupGates644.ConstantWeight.Supplement.corollary_5_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

For each integer r≥3 there is a positive integer U(r), chosen before ε and the prime p. For each 0<ε<1 there are positive constants c_K,c_D,c_ρ depending only on r,ε such that for every prime p a fixed field F of size p^u, 1≤u≤U(r), admits an unbounded family of r-tuples of valid subsystem codes satisfying

K,s≥cKN,dX,dZ≥cDN1/r,wlocal,sparsity⁡≤Nε,ρ=cρN1/r.K,s\ge c_KN,\quad d_X,d_Z\ge c_DN^{1/r},\quad w_{\mathrm{local}},\operatorname{sparsity}\le N^\varepsilon,\quad \rho=c_\rho N^{1/r}.K,s≥cK​N,dX​,dZ​≥cD​N1/r,wlocal​,sparsity≤Nε,ρ=cρ​N1/r.

The formal family has strict-radius executable decoders within one polynomial clock for all lengths and inputs. No asymptotic constant varies with the growing length or the received error.

The same item also retains the full informal Theorem 1.2: for every target prime-power alphabet q=p^a, a≥1, there is a fixed field of that size and an unbounded family with positive linear dimension and yield, both distances and inclusive adversarial correction Ω(N^{1/r}), source stabilizer locality at most N^ε, and an actual physical C^(r−1)Z circuit of depth at most N^ε. The gate form producing that schedule has the stated logical trace-phase action. The headline constants may depend on the fixed target alphabet; all precede family indices and inputs.

This is one companion result covering the formal family and its preview. Alphabet reduction, polynomial decoder preservation and the physical depth conversion are conclusions to prove, never additional assumptions. The polynomial clock witnesses for each fixed alphabet precede every family length.

Differences from the source:

  • encoding: Ω bounds and u=O_r(1) → positive Ω witnesses before p and family indices, and U(r) before ε,p; reason: the proof on pp.30–31 supplies uniform constants; no numerical degradation is inserted
  • encoding: Corollary 5.3 and its informal preview Theorem 1.2 → one conjunction retaining both complete family claims; reason: the preview additionally requires every target alphabet and actual physical depth; it is not a second goal
  • 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
Preamble
import Definitions.Def_QuantumCupGates644_ConstantWeight_Supplement_families
Formal statement
namespace QuantumCupGates644.ConstantWeight.Supplement
open scoped BigOperators
open Classical

theorem corollary_5_3 :
    ∀ r : ℕ, 3 ≤ r → ∃ U : ℕ, 0 < U ∧
    ∀ ε : ℝ, 0 < ε → ε < 1 →
      (∃ cK cD cρ : ℝ, 0 < cK ∧ 0 < cD ∧ 0 < cρ ∧
        ∀ (p : ℕ) [Fact p.Prime], ∃ A : FiniteAlphabet p,
          A.exponent ≤ U ∧ FormalLinearYieldFamily (r := r) A ε cK cD cρ) ∧
      (∀ (p a : ℕ) [Fact p.Prime], 0 < a →
        ∃ A : FiniteAlphabet p, A.exponent = a ∧
          HeadlineLinearYieldFamily (r := r) A ε) := 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; Corollary 5.3, printed/PDF p.28; Theorem 1.2, printed/PDF p.5; proof pp.30–31

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