II.2 — Lemma II.2 (Two-qubit product-vector lemma). Every subspace V ⊂ C2 ⊗ C2 with dim V ≥ 2 contains a nonzero
ProvedQAlgorithms.Papers.Independent.Information100.P21.twoQubitProductVectorprove2quantum
Let be a complex subspace with . Then
The nonzero qualification excludes the trivial zero product. The source includes a proof and credits Refs. [13,14].
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P21
Formal statement
noncomputable section open scoped Matrix ComplexConjugate ComplexOrder ENNReal namespace QAlgorithms.Papers.Independent.Information100.P21 attribute [local instance] Classical.propDecidable Classical.decEq /-- arxiv:2609.28367v1, PDF p. 6, Lemma II.2 (Two-qubit product-vector lemma). Every subspace V ⊂ C2 ⊗ C2 with dim V ≥ 2 contains a nonzero. -/ theorem twoQubitProductVector (V : Submodule ℂ (Vec QQ)) (h : 2 ≤ Module.finrank ℂ V) : ∃ e f : Vec (Fin 2), tensor e f ∈ V ∧ tensor e f ≠ 0 := by sorry end QAlgorithms.Papers.Independent.Information100.P21 end
Source
The Minimal Dimension of Entangled -Noise Advantage, arXiv:2609.28367v1, PDF p. 6, II.2 — Lemma II.2 (Two-qubit product-vector lemma). Every subspace V ⊂ C2 ⊗ C2 with dim V ≥ 2 contains a nonzero
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every complex linear subspace of whose complex dimension is at least two, there exist vectors such that the vector with coordinates belongs to and is nonzero. Neither factor is required to have unit norm.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.