Proposition 10: attaining construction exists
ProvedQAlgorithms.Papers.Independent.Intake100.P43.lower_rank_attainmentFix local computational bases of , where , and an integer . All subspaces and dimensions are complex. Write for the rank of the coefficient matrix of . Subspace rank conditions concern every nonzero vector and do not require unit norm. There exists a complex linear subspace such that every nonzero has and
This attains the universal upper bound. The statement includes the trivial case without turning the proof’s diagonal construction into an extra hypothesis.
import Definitions.Def_QAlgorithms_Papers_Independent_Intake100_P43
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, Proposition 10: an attaining subspace exists, with no proof-built
diagonal construction or determinantal identity added as a hypothesis. -/
theorem lower_rank_attainment (dA dB r : ℕ)
(hA : 0 < dA) (hAB : dA ≤ dB) (hr : 1 ≤ r) (hrA : r ≤ dA) :
∃ S : Submodule ℂ (Bipartite dA dB), HasLowerSchmidtRank S r ∧
Module.finrank ℂ S = (dA - r + 1) * (dB - r + 1) := by sorry
end QAlgorithms.Papers.Independent.Intake100.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers satisfying and , there exists a complex linear subspace of the Euclidean space of complex arrays such that every nonzero has coefficient-matrix rank , and . There is no rank requirement on the zero vector. The subtractions are natural-number subtractions, with the stated bounds ensuring their usual integer values.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.