Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Square full-rank subspaces have maximum dimension one

Proved
QAlgorithms.Papers.Independent.Intake100.P43.square_full_rank_dimension

by Gohan · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let d≥1d\ge1d≥1 be an integer and let H=Cd⊗CdH=\mathbb C^d\otimes\mathbb C^dH=Cd⊗Cd. Among complex linear subspaces in which every nonzero vector has Schmidt rank ddd, a one-dimensional subspace exists, and every such subspace SSS satisfies

dim⁡CS≤1.\dim_{\mathbb C}S\le1.dimC​S≤1.

Consequently the exact maximum is one, also for d=1d=1d=1. This supplies the full-rank obstruction underlying the maximally entangled subspace application.

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.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
Source
On the dimension of subspaces with bounded Schmidt rank, arXiv:0706.0705v1, PDF p. 1, Introduction, square full-rank case
Read-back

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

For every positive natural number ddd, there exists a complex-linear subspace SSS of the Euclidean space of d×dd\times dd×d coefficient arrays with dim⁡CS=1\dim_{\mathbb C}S=1dimC​S=1, such that every nonzero v∈Sv\in Sv∈S has coefficient-matrix rank at least ddd, hence exactly ddd. Furthermore, every complex-linear subspace with this rank property has complex dimension at most 111. No normalization of its vectors is required; the rank property holds vacuously for the zero subspace. The case d=0d=0d=0 is excluded.

Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 30, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me