Lemma 8: totally nonsingular matrices exist
ProvedQAlgorithms.Papers.Independent.Intake100.P43.totally_nonsingular_existsprove2quantum
For every integer , there is a complex matrix for which every square minor is nonzero:
The row and column selections contain distinct indices. The order-zero determinant is one, so the statement includes . Such matrices supply the column combinations used in the attaining construction.
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.2, Lemma 8: square totally nonsingular complex matrices exist in
every dimension, including zero (empty determinant one). -/
theorem totally_nonsingular_exists (n : ℕ) :
∃ M : Matrix (Fin n) (Fin n) ℂ, TotallyNonsingular M := by sorry
end QAlgorithms.Papers.Independent.Intake100.P43
end
Source
On the dimension of subspaces with bounded Schmidt rank, arXiv:0706.0705v1, PDF p. 2, Lemma 8
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , there exists a complex matrix such that, for every natural number and every pair of injections , the determinant of the matrix is nonzero. This includes , whose empty determinant is , and ; when , no such injections exist.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.