Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§II A example: pairwise nonorthogonal spanning samples are sufficient

Open
QAlgorithms.Papers.Independent.Intakethird100.P67.nonorthogonal_samples_generate

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

prove2quantum

Let a finite normalized pure sample family contain a linearly independent subfamily {ϕj}j=1d\{\phi_j\}_{j=1}^d{ϕj​}j=1d​ with the same span HinH_{\rm in}Hin​ as the entire family. Assume that every pair in this subfamily has nonzero complex inner product. Then

Alg⁡C{∣ϕk⟩⟨ϕk∣}k=L(Hin).\operatorname{Alg}_{\mathbb C}\{\lvert\phi_k\rangle\langle\phi_k\rvert\}_k=\mathcal L(H_{\rm in}).AlgC​{∣ϕk​⟩⟨ϕk​∣}k​=L(Hin​).

Extra sample vectors and their linear dependencies are allowed. This is a sufficient identifiability example, not a necessary condition on every emulator input.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P67
Formal statement
noncomputable section

open scoped ComplexConjugate Matrix Matrix.Norms.L2Operator

attribute [local instance] Classical.propDecidable

open MeasureTheory Filter

namespace QAlgorithms.Papers.Independent.Intakethird100.P67

variable {I J K L A : Type*} [Fintype I] [DecidableEq I]
  [Fintype J] [DecidableEq J] [Fintype K] [DecidableEq K]
  [Fintype L] [DecidableEq L] [Fintype A] [DecidableEq A]

/-- PDF p.3, Eq.(8): pairwise nonorthogonal independent samples are sufficient,
without imposing their pairwise condition on the general emulator results. -/
theorem nonorthogonal_samples_generate [Nonempty J] (phi : K → EuclideanSpace ℂ I) (s : J ↪ K)
    (hphi : ∀ k, IsState (phi k)) (hind : LinearIndependent ℂ (fun j => phi (s j)))
    (hspan : samplePi (pureSamples (fun j => phi (s j))) = samplePi (pureSamples phi))
    (hoverlap : ∀ j k : J, inner ℂ (phi (s j)) (phi (s k)) ≠ 0) :
    Generates (pureSamples phi) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P67

end
Source
Universal Quantum Emulator, arXiv:1606.02734v2, PDF p. 3, §II A example: pairwise nonorthogonal spanning samples are sufficient
Read-back

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

Let III be a finite coordinate type with decidable equality, let K,JK,JK,J be finite index types with JJJ nonempty, let ϕk∈CI\phi_k\in\mathbb C^Iϕk​∈CI, and let s:J↪Ks:J\hookrightarrow Ks:J↪K be injective. Suppose every ϕk\phi_kϕk​ has Euclidean norm 111, the selected vectors (ϕs(j))j∈J(\phi_{s(j)})_{j\in J}(ϕs(j)​)j∈J​ are complex linearly independent, and ⟨ϕs(j),ϕs(k)⟩≠0\langle\phi_{s(j)},\phi_{s(k)}\rangle\ne0⟨ϕs(j)​,ϕs(k)​⟩=0 for every j,k∈Jj,k\in Jj,k∈J, including j=kj=kj=k. For a family RRR, define ΠR=f(∑R)\Pi_R=f(\sum R)ΠR​=f(∑R) by continuous functional calculus with f(0)=0f(0)=0f(0)=0 and f(t)=1f(t)=1f(t)=1 for t≠0t\ne0t=0, and suppose

Π(∣ϕs(j)⟩⟨ϕs(j)∣)j∈J=Π(∣ϕk⟩⟨ϕk∣)k∈K.\Pi_{(|\phi_{s(j)}\rangle\langle\phi_{s(j)}|)_{j\in J}} = \Pi_{(|\phi_k\rangle\langle\phi_k|)_{k\in K}}.Π(∣ϕs(j)​⟩⟨ϕs(j)​∣)j∈J​​=Π(∣ϕk​⟩⟨ϕk​∣)k∈K​​.

Writing Sk=∣ϕk⟩⟨ϕk∣S_k=|\phi_k\rangle\langle\phi_k|Sk​=∣ϕk​⟩⟨ϕk​∣, whose (u,v)(u,v)(u,v)-entry is ϕk(u)ϕk(v)‾\phi_k(u)\overline{\phi_k(v)}ϕk​(u)ϕk​(v)​, the conclusion is that, for every complex matrix XXX on III, XXX belongs to the complex linear span of all nonempty finite products of the SkS_kSk​ if and only if ΠSXΠS=X\Pi_S X\Pi_S=XΠS​XΠS​=X. A singleton JJJ is allowed; an empty III is incompatible with the normalized selected vectors.

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