Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rectangular subspaces of constant maximum rank

Proved
QAlgorithms.Papers.Independent.Intake100.P43.rectangular_full_rank_subspace

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

prove2quantum

For integers 1≤dA≤dB1\le d_A\le d_B1≤dA​≤dB​, there exists a complex linear subspace S⊆CdA⊗CdBS\subseteq\mathbb C^{d_A}\otimes\mathbb C^{d_B}S⊆CdA​⊗CdB​ such that

dim⁡CS=dB−dA+1,Sch⁡(v)=dA(0≠v∈S).\dim_{\mathbb C}S=d_B-d_A+1,\qquad \operatorname{Sch}(v)=d_A\quad(0\ne v\in S).dimC​S=dB​−dA​+1,Sch(v)=dA​(0=v∈S).

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 dA,dBd_A,d_BdA​,dB​ satisfying 0<dA≤dB0<d_A\le d_B0<dA​≤dB​, there exists a complex linear subspace SSS of the Euclidean space of complex arrays v=(vij)i<dA,j<dBv=(v_{ij})_{i<d_A,j<d_B}v=(vij​)i<dA​,j<dB​​ such that every nonzero v∈Sv\in Sv∈S has coefficient-matrix rank exactly dAd_AdA​, and dim⁡CS=dB−dA+1\dim_{\mathbb C}S=d_B-d_A+1dimC​S=dB​−dA​+1. No rank condition is imposed on the zero vector. The subtraction is natural-number subtraction, and dA≤dBd_A\le d_BdA​≤dB​ ensures its usual integer value.

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