Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1: finite-index stabilizer and polynomial-size lattice basis

Open
QAlgorithms.Papers.Independent.Intakethird100.P03.stabilizer_lattice

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let k,n>0k,n>0k,n>0, let M⊆{0,1}nM\subseteq\{0,1\}^nM⊆{0,1}n have unique encodings, let FFF be a Zk\mathbb Z^kZk action on MMM, and let a∈Ma\in Ma∈M. No membership test for MMM is required, and the black box is unrestricted off MMM. Write S={g:F(g,a)=a}S=\{g:F(g,a)=a\}S={g:F(g,a)=a}. There is a single polynomial ppp independent of all these data such that

[Zk:S]≤∣M∣≤2n,S≅Zk,∑i=1ksize⁡(gi)≤p(k+n)[\mathbb Z^k:S]\le |M|\le 2^n,\qquad S\cong\mathbb Z^k,\qquad \sum_{i=1}^k\operatorname{size}(g_i)\le p(k+n)[Zk:S]≤∣M∣≤2n,S≅Zk,i=1∑k​size(gi​)≤p(k+n)

for some integer basis g1,…,gkg_1,\ldots,g_kg1​,…,gk​ of SSS. Size uses a fixed signed binary, self-delimiting coordinate coding. In particular, the index is finite and nonzero.

This bounds the output size of the stabilizer problem without assuming a basis as input.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P03
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate Kronecker

namespace QAlgorithms.Papers.Independent.Intakethird100.P03

open QAlgorithms.Papers.Independent.Renew46.P01 (cleanVector)

attribute [local instance] Classical.propDecidable

/-- PDF pp.3–4, §1: finite-index, full-rank stabilizer and a polynomial-bit-size basis.
The polynomial precedes every size, action and encoded point. -/
theorem stabilizer_lattice :
    ∃ p : Polynomial ℕ, ∀ (k n : ℕ), 0 < k → 0 < n →
      ∀ (M : Set (Qubits n)) (A : ASPAction k n M) (a : Qubits n) (ha : a ∈ M),
        (stabilizer A a ha).FiniteIndex ∧
        (stabilizer A a ha).index ≤ Nat.card M ∧ Nat.card M ≤ 2 ^ n ∧
        ∃ b : (Fin k → ℤ) ≃+ stabilizer A a ha, latticeBasisBits b ≤ p.eval (n + k) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P03

end
Source
Quantum measurements and the Abelian Stabilizer Problem, arXiv:quant-ph/9511026v1, PDF p. 4, §1: finite-index stabilizer and polynomial-size lattice basis
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

There exists a single polynomial ppp with natural-number coefficients such that, for every pair of positive natural numbers k,nk,nk,n, every set M⊆{0,1}nM\subseteq\{0,1\}^nM⊆{0,1}n, every total map run⁡:Zk×{0,1}n→{0,1}n\operatorname{run}:\mathbb Z^k\times\{0,1\}^n\to\{0,1\}^nrun:Zk×{0,1}n→{0,1}n satisfying preservation of MMM, run⁡(0,x)=x\operatorname{run}(0,x)=xrun(0,x)=x, and run⁡(g+h,x)=run⁡(g,run⁡(h,x))\operatorname{run}(g+h,x)=\operatorname{run}(g,\operatorname{run}(h,x))run(g+h,x)=run(g,run(h,x)) for all g,h∈Zkg,h\in\mathbb Z^kg,h∈Zk and x∈Mx\in Mx∈M, and every point a∈Ma\in Ma∈M, the subgroup S={g∈Zk:run⁡(g,a)=a}S=\{g\in\mathbb Z^k:\operatorname{run}(g,a)=a\}S={g∈Zk:run(g,a)=a} has finite index and satisfies [Zk:S]≤∣M∣≤2n[\mathbb Z^k:S]\leq |M|\leq 2^n[Zk:S]≤∣M∣≤2n. Moreover, there exists an additive group isomorphism b:Zk→Sb:\mathbb Z^k\to Sb:Zk→S such that ∑i=0k−1∑j=0k−1[2(⌊log⁡2(∣(b(ei))j∣+1)⌋+1)+1]≤p(n+k)\sum_{i=0}^{k-1}\sum_{j=0}^{k-1}\left[2\bigl(\lfloor\log_2(|(b(e_i))_j|+1)\rfloor+1\bigr)+1\right]\leq p(n+k)∑i=0k−1​∑j=0k−1​[2(⌊log2​(∣(b(ei​))j​∣+1)⌋+1)+1]≤p(n+k), where eie_iei​ is the iiith standard coordinate vector. The polynomial is independent of k,n,Mk,n,Mk,n,M, the action, and aaa; no cases with k=0k=0k=0 or n=0n=0n=0 are asserted, and the hypothesis a∈Ma\in Ma∈M makes MMM nonempty.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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