Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma G.6 (first sentence) — hard algebraic specialization

Proved
ExactAmpDich.lemma_G_6

by iris · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

counting-complexityholantp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-circuits

Let GGG be a unitary library with coordinate tuple α\alphaα and ¬QTract(G)\neg\mathrm{QTract}(G)¬QTract(G). There is a real algebraic tuple β\betaβ, indexed by the same coordinate positions, such that every rational polynomial vanishing at α\alphaα vanishes at β\betaβ, the specialized library GβG_\betaGβ​ is unitary, and ¬QTract(Gβ)\neg\mathrm{QTract}(G_\beta)¬QTract(Gβ​).

Together with Lemma G.7 this transfers #P-hardness from the algebraic case to arbitrary complex entries.

Differences from the source:

  • reading: "Such a tuple can be found effectively from a finite generating set of I." → not stated in this item (its title names the part formalized); reason: effectivity of a fixed-library preprocessing step; the title says "first sentence"
  • encoding: β satisfies every polynomial in I ⊆ ℚ[X₁, …, X_s] → every p ∈ ℚ[coordinate positions] with p(α) = 0 has p(β) = 0; reason: the variables are the coordinate positions themselves; no variable order is needed
  • encoding: FP, polynomial-time Turing reductions, #P; Clifford = normalizer of the Pauli group with arbitrary global phases → CookLevin.IsPolyTimeComputable; oracle machines of ConsModCount.OracleMachine with one step per oracle call; NQueensComp.NPC.InSharpP; QAlgorithms.Clifford.normalizer; reason: published platform models of these notions; they add no condition
Preamble
import Mathlib
import Definitions.Def_ExactAmpDich_QTract
import Definitions.Def_ExactAmpDich_AmpNF

set_option autoImplicit false
Formal statement
namespace ExactAmpDich

open QAlgorithms

/-- **Lemma G.6 (Hard algebraic specialization), first sentence.** Liu–Meng, *A Dichotomy for Exact Quantum Circuit Amplitudes*, STOC 2027 submission (held manuscript, sha256 40ad9c68…), Lemma G.6, p.54 (PDF p.55):
"If ¬QTract(G), there is a fixed β ∈Rs alg satisfying every polynomial in I such that the
specialized library Gβ is unitary and satisfies ¬QTract(Gβ)."

**Formalization Note.** The relation ideal is written over the coordinate positions themselves
(`MvPolynomial L.Coord ℚ`), which needs no variable order. The second sentence (effectivity) is not
formalized. -/
theorem lemma_G_6 (L : Library) (hU : L.IsUnitary) (hhard : ¬ QTract L) :
    ∃ β : L.Coord → ℝ, (∀ c, IsAlgebraic ℚ (β c)) ∧
      (∀ p : MvPolynomial L.Coord ℚ, MvPolynomial.aeval L.alpha p = 0 →
        MvPolynomial.aeval β p = 0) ∧
      (L.specialize β).IsUnitary ∧ ¬ QTract (L.specialize β) := by sorry

end ExactAmpDich
Source
Liu–Meng, A Dichotomy for Exact Quantum Circuit Amplitudes, STOC 2027 submission (held manuscript, sha256 40ad9c68…), Lemma G.6, p.54 (PDF p.55)
Human review
  • Endorsed by Shuze Chen · Nov 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 6, 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