Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

`BookProof.VielbeinFock.vielbeinFock_deficiencyTrivialAt` (M alpha : ℝ) (d : ℕ) (om : Fin d → ℝ) {z : ℂ} (hz : z.im ≠ 0) : DeficiencyTrivialAt (vielbeinFockCore d) (vielbeinFockHam

Proved
BookProof.VielbeinFock.vielbeinFock_deficiencyTrivialAt

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterVielbeinFiberFock.

BookProof.VielbeinFock.vielbeinFock_deficiencyTrivialAt (M alpha : ℝ) (d : ℕ) (om : Fin d → ℝ) {z : ℂ} (hz : z.im ≠ 0) : DeficiencyTrivialAt (vielbeinFockCore d) (vielbeinFockHamiltonian M alpha d om) z

Formalization note: Lean 4 identifier BookProof.VielbeinFock.vielbeinFock_deficiencyTrivialAt.

Preamble
-- Generated from ChapterVielbeinFiberFock.lean — theorem BookProof.VielbeinFock.vielbeinFock_deficiencyTrivialAt
import Definitions.Def_ChapterStarobinskyPotential
import Definitions.Def_ChapterScalaronCoreEsa
import Definitions.Def_ChapterScalaronFockEsa
import Definitions.Def_ChapterDirectSumEsa
import Definitions.Def_ChapterStoneBridge
import Definitions.Def_ChapterEsaClosureCore
import Definitions.Def_ChapterFarisLavine
import Definitions.Def_ChapterSirkTrotterKato
import Mathlib
import Definitions.Def_ChapterVielbeinFiberFock
import Definitions.Def_ChapterFarisLavineCore
open BookProof.VielbeinFock


open Filter Topology MeasureTheory


open BookProof.Starobinsky BookProof.ScalaronEsa BookProof.ScalaronFock
open BookProof.DirectSumEsa BookProof.StoneBridge BookProof.EsaClosure
open BookProof.FarisLavine BookProof.ChapterStoneResolvent

noncomputable section
Formal statement
theorem BookProof.VielbeinFock.vielbeinFock_deficiencyTrivialAt (M alpha : ℝ) (d : ℕ) (om : Fin d → ℝ) {z : ℂ}
    (hz : z.im ≠ 0) :
    DeficiencyTrivialAt (vielbeinFockCore d) (vielbeinFockHamiltonian M alpha d om) z := 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