: ∃ (h n : Fin 2 → (E2 →ₗ[ℂ] E2)) (v : E2), (∀ (k : Fin 2) (x : E2), ‖h k x‖ ≤ ‖n k x‖) ∧ ‖(n 0 + n 1) v‖ < ‖(h 0 + h 1) v‖
ProvedBookProof.NavierStokesFlow.FarisLavineLift.not_forall_norm_sum_le_of_pointwisenavier-stokesoperator-algebrastimepiece
Lean 4 theorem BookProof.NavierStokesFlow.FarisLavineLift.not_forall_norm_sum_le_of_pointwise (module BookProof.NavierStokesFlow), source chapter BookProof/ChapterNavierStokesFlow.lean.
Preamble
-- Generated from ChapterNavierStokesFarisLavineLift.lean — theorem BookProof.NavierStokesFlow.FarisLavineLift.not_forall_norm_sum_le_of_pointwise
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)
variable {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℂ F] {D : Submodule ℂ F}
variable {κ : Type*}Formal statement
theorem BookProof.NavierStokesFlow.FarisLavineLift.not_forall_norm_sum_le_of_pointwise :
∃ (h n : Fin 2 → (E2 →ₗ[ℂ] E2)) (v : E2),
(∀ (k : Fin 2) (x : E2), ‖h k x‖ ≤ ‖n k x‖) ∧
‖(n 0 + n 1) v‖ < ‖(h 0 + h 1) v‖ := by sorrySource