(d : ℕ) (p q : Fin d → ℕ → ℝ) (hunb : ∀ C : ℝ, ∃ k, C < |(∑ i, p i k ^ 2) + (∑ i, q i k ^ 2) + 1|) : ¬ ∃ C : ℝ, ∀ f : lpFiniteModes ℕ, ‖(diagComparisonData d p q).comparison f‖ ≤ C * ‖f‖
ProvedBookProof.NavierStokesFlow.FarisLavineLift.diagComparison_not_boundednavier-stokesoperator-algebrastimepiece
Lean 4 theorem BookProof.NavierStokesFlow.FarisLavineLift.diagComparison_not_bounded (module BookProof.NavierStokesFlow), source chapter BookProof/ChapterNavierStokesFlow.lean.
Preamble
-- Generated from ChapterNavierStokesFarisLavineLift.lean — theorem BookProof.NavierStokesFlow.FarisLavineLift.diagComparison_not_bounded
import Mathlib
import Definitions.Def_ChapterNavierStokesFarisLavineLift
open BookProof.NavierStokesFlow
open BookProof.NavierStokesFlow.FarisLavineLift
variable {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℂ F]
variable {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℂ F]
variable {d : ℕ} (c : ComparisonData F d)Formal statement
theorem BookProof.NavierStokesFlow.FarisLavineLift.diagComparison_not_bounded (d : ℕ) (p q : Fin d → ℕ → ℝ)
(hunb : ∀ C : ℝ, ∃ k, C < |(∑ i, p i k ^ 2) + (∑ i, q i k ^ 2) + 1|) :
¬ ∃ C : ℝ, ∀ f : lpFiniteModes ℕ,
‖(diagComparisonData d p q).comparison f‖ ≤ C * ‖f‖ := by sorrySource