Rectangular subspaces of constant maximum rank
ProvedQAlgorithms.Papers.Independent.Intake100.P43.rectangular_full_rank_subspaceprove2quantum
For integers , there exists a complex linear subspace such that
This gives an exact constant-rank example and specializes to dimension one in the square case.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P43
Formal statement
noncomputable section
open scoped BigOperators Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Intake100.P43
open QAlgorithms.Papers.Independent.Dependency50.P50 (Bipartite schmidtNumber)
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
/-- PDF p.3, unnumbered constant-rank rectangular example: exact rank dA
on every nonzero vector, not just a lower rank bound. -/
theorem rectangular_full_rank_subspace (dA dB : ℕ)
(hA : 0 < dA) (hAB : dA ≤ dB) :
∃ S : Submodule ℂ (Bipartite dA dB),
HasConstantSchmidtRank S dA ∧ Module.finrank ℂ S = dB - dA + 1 := by sorry
end QAlgorithms.Papers.Independent.Intake100.P43
end
Source
On the dimension of subspaces with bounded Schmidt rank, arXiv:0706.0705v1, PDF p. 3, Unnumbered constant-rank rectangular example
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of natural numbers satisfying , there exists a complex linear subspace of the Euclidean space of complex arrays such that every nonzero has coefficient-matrix rank exactly , and . No rank condition is imposed on the zero vector. The subtraction is natural-number subtraction, and ensures its usual integer value.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.