Square full-rank subspaces have maximum dimension one
ProvedQAlgorithms.Papers.Independent.Intake100.P43.square_full_rank_dimensionLet be an integer and let . Among complex linear subspaces in which every nonzero vector has Schmidt rank , a one-dimensional subspace exists, and every such subspace satisfies
Consequently the exact maximum is one, also for . This supplies the full-rank obstruction underlying the maximally entangled subspace application.
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.1, unnumbered square full-rank result: the maximum is one.
The determinant paragraph's r in this regime is read as d. The bound applies
without imposing maximal-entanglement entropy or unit norm. -/
theorem square_full_rank_dimension (d : ℕ) (hd : 0 < d) :
(∃ S : Submodule ℂ (Bipartite d d),
HasLowerSchmidtRank S d ∧ Module.finrank ℂ S = 1) ∧
(∀ S : Submodule ℂ (Bipartite d d), HasLowerSchmidtRank S d →
Module.finrank ℂ S ≤ 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 every positive natural number , there exists a complex-linear subspace of the Euclidean space of coefficient arrays with , such that every nonzero has coefficient-matrix rank at least , hence exactly . Furthermore, every complex-linear subspace with this rank property has complex dimension at most . No normalization of its vectors is required; the rank property holds vacuously for the zero subspace. The case is excluded.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.