Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

`BookProof.NavierStokesFlow.FockOfFock.intervalTwoLevel_not_bounded` (eps : K → ℝ) : ¬ ∃ C : ℝ, ∀ f : FockOfFockDom ℕ K, ‖dGamma (intervalTwoLevelSymbol eps) f‖ ≤ C * ‖f‖

Proved
BookProof.NavierStokesFlow.FockOfFock.intervalTwoLevel_not_bounded

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterNavierStokesFockEsa.

BookProof.NavierStokesFlow.FockOfFock.intervalTwoLevel_not_bounded (eps : K → ℝ) : ¬ ∃ C : ℝ, ∀ f : FockOfFockDom ℕ K, ‖dGamma (intervalTwoLevelSymbol eps) f‖ ≤ C * ‖f‖

Formalization note: Lean 4 identifier BookProof.NavierStokesFlow.FockOfFock.intervalTwoLevel_not_bounded.

Preamble
-- Generated from ChapterNavierStokesFockEsa.lean — theorem BookProof.NavierStokesFlow.FockOfFock.intervalTwoLevel_not_bounded
import Mathlib
import Definitions.Def_ChapterNavierStokesFockEsa
import Definitions.Def_ChapterFockOneParticleGap
import Definitions.Def_ChapterFockSecondQuantization
import Definitions.Def_ChapterNavierStokesFockSpace
import Definitions.Def_ChapterNavierStokesAffineFiberEsa
open BookProof.FockOneParticleGap
open BookProof.FockSecondQuantization
open BookProof.NavierStokesFlow.FockOfFock
open BookProof.NavierStokesFlow


open MeasureTheory



open FullEsa LagrangianEsa

variable {M : Type*} [DecidableEq M]
variable {M : Type*} [DecidableEq M] {Ω : Type*} [MeasurableSpace Ω]
variable {J K : Type*} [DecidableEq J] [DecidableEq K]
variable {F : Type*} [NormedAddCommGroup F] [InnerProductSpace ℂ F]
variable {K : Type*} [DecidableEq K]
Formal statement
theorem BookProof.NavierStokesFlow.FockOfFock.intervalTwoLevel_not_bounded (eps : K → ℝ) :
    ¬ ∃ C : ℝ, ∀ f : FockOfFockDom ℕ K,
      ‖dGamma (intervalTwoLevelSymbol eps) f‖ ≤ C * ‖f‖ := by sorry

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me