`BookProof.NavierStokesFlow.HermiteFarisLavine.abs_le_of_hasSum` {f g : ℕ → ℝ} {S T : ℝ} (hf : HasSum f S) (hg : HasSum g T) (h : ∀ n, |f n| ≤ g n) : |S| ≤ T

Proved

BookProof.NavierStokesFlow.HermiteFarisLavine.abs_le_of_hasSum

by leonardopedro · Oct 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

theoremstimepiece

Prove the following Lean 4 theorem from ChapterNavierStokesHermiteFarisLavine.

BookProof.NavierStokesFlow.HermiteFarisLavine.abs_le_of_hasSum {f g : ℕ → ℝ} {S T : ℝ} (hf : HasSum f S) (hg : HasSum g T) (h : ∀ n, |f n| ≤ g n) : |S| ≤ T

Formalization note: Lean 4 identifier BookProof.NavierStokesFlow.HermiteFarisLavine.abs_le_of_hasSum.

Preamble

-- Generated from ChapterNavierStokesHermiteFarisLavine.lean — theorem BookProof.NavierStokesFlow.HermiteFarisLavine.abs_le_of_hasSum
import Mathlib
import Definitions.Def_ChapterNavierStokesHermiteFarisLavine
import Definitions.Def_ChapterNavierStokesAffineFiberEsa
open BookProof.NavierStokesFlow
open BookProof.NavierStokesFlow.HermiteFarisLavine


open scoped ENNReal



open LpNat BookProof.FarisLavine IkebeKato

variable {κ : ℝ}
variable {x : maxDom (oscSymbol κ)}

Formal statement

theorem BookProof.NavierStokesFlow.HermiteFarisLavine.abs_le_of_hasSum {f g : ℕ → ℝ} {S T : ℝ} (hf : HasSum f S) (hg : HasSum g T)
    (h : ∀ n, |f n| ≤ g n) : |S| ≤ T := by sorry

View graph