{S : Submodule ℂ F} [FiniteDimensional ℂ S] {n : ℕ} (hn : n ≤ Module.finrank ℂ S) : ∃ S₀ : Submodule ℂ F, S₀ ≤ S ∧ Module.finrank ℂ S₀ = n
ProvedBookProof.RitzMinMax.exists_le_finrank_eqtimepiece
Lean 4 theorem BookProof.RitzMinMax.exists_le_finrank_eq (module BookProof.RitzMinMax), source chapter BookProof/ChapterRitzMinMax.lean.
Preamble
-- Generated from ChapterSirkRitzMinMax.lean — theorem BookProof.RitzMinMax.exists_le_finrank_eq
import Mathlib
import Definitions.Def_ChapterSirkRitzMinMax
open BookProof.RitzMinMax
noncomputable section
open BookProof.HermiteGalerkin BookProof.ChapterSirkRitzSpectrum
open Filter Topology
variable {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℂ F] [CompleteSpace F]Formal statement
theorem BookProof.RitzMinMax.exists_le_finrank_eq {S : Submodule ℂ F} [FiniteDimensional ℂ S] {n : ℕ}
(hn : n ≤ Module.finrank ℂ S) :
∃ S₀ : Submodule ℂ F, S₀ ≤ S ∧ Module.finrank ℂ S₀ = n := by sorrySource