Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Main properties (iii): completeness when the bond dimension may grow exponentially

Open
QAlgorithms.Papers.Independent.Intakethird100.P57.completeness

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

prove2quantum

Let N≥1N\ge1N≥1 and let ψ\psiψ be any unit vector in (C2)⊗N(\mathbb C^2)^{\otimes N}(C2)⊗N. There exist an integer bond dimension DDD and periodic trace tensors AAA such that

1≤D≤2N,R(A,0,I)=ψ.1\le D\le2^N,\qquad R(A,0,I)=\psi.1≤D≤2N,R(A,0,I)=ψ.

The graph weights and final local rotations can therefore be chosen trivial. This is an exact representability statement with exponential bond dimension allowed.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P57
Formal statement
noncomputable section

open scoped ComplexConjugate Matrix

namespace QAlgorithms.Papers.Independent.Intakethird100.P57

attribute [local instance] Classical.propDecidable

/-- PDF p.2, Main properties (iii): exact completeness, explicitly allowing exponential D.
The graph and rotations may be chosen trivial, with the periodic trace convention retained. -/
theorem completeness (N : ℕ) (hN : 1 ≤ N) (v : EuclideanSpace ℂ (Qubits N))
    (hv : IsState v) :
    ∃ D : ℕ, 1 ≤ D ∧ D ≤ 2 ^ N ∧ ∃ A : Tensors N D,
      rage A (emptyPhaseGraph N) (fun _ => 1) = v := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P57

end
Source
Renormalization algorithm with graph enhancement, arXiv:0802.1211v1, PDF p. 2, Main properties (iii): completeness when the bond dimension may grow exponentially
Read-back

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

For every natural number N≥1N\ge1N≥1 and every complex vector vvv indexed by {0,1}N\{0,1\}^N{0,1}N with Euclidean norm 111, there exist a natural number DDD satisfying 1≤D≤2N1\le D\le2^N1≤D≤2N and complex D×DD\times DD×D matrices Ak(t)A_k(t)Ak​(t), one for each site k∈{0,…,N−1}k\in\{0,\ldots,N-1\}k∈{0,…,N−1} and bit ttt, such that

v(b)=tr⁡ ⁣(A0(b0)⋯AN−1(bN−1))for every b∈{0,1}N.v(b)=\operatorname{tr}\!\left(A_0(b_0)\cdots A_{N-1}(b_{N-1})\right) \qquad\text{for every }b\in\{0,1\}^N.v(b)=tr(A0​(b0​)⋯AN−1​(bN−1​))for every b∈{0,1}N.

The product uses increasing site order. Equivalently, applying the diagonal phase operator with all weights zero and the product of identity local rotations to this trace-defined vector gives exactly vvv.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me