`BookProof.FockCubicUnbounded.trial_support_subset` (k n : ℕ) (c : ℝ) : (trial k n c).support ⊆ {confAt k n, confAt k (n + 3)}

Proved

BookProof.FockCubicUnbounded.trial_support_subset

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterFockCubicUnbounded.

BookProof.FockCubicUnbounded.trial_support_subset (k n : ℕ) (c : ℝ) : (trial k n c).support ⊆ {confAt k n, confAt k (n + 3)}

Formalization note: Lean 4 identifier BookProof.FockCubicUnbounded.trial_support_subset.

Preamble

-- Generated from ChapterFockCubicUnbounded.lean — theorem BookProof.FockCubicUnbounded.trial_support_subset
import Definitions.Def_ChapterFockOneParticleGap
import Definitions.Def_ChapterFockNumberPreservingGap
import Definitions.Def_ChapterFockFieldPerturbation
import Mathlib
import Definitions.Def_ChapterFockCubicUnbounded
import Definitions.Def_ChapterFockSecondQuantization
import Definitions.Def_ChapterTempleSeparationNecessary
open BookProof.FockSecondQuantization
open BookProof.TempleSeparationNecessary
open BookProof.FockCubicUnbounded


noncomputable section


open BookProof.FockSecondQuantization BookProof.FockOneParticleGap
open BookProof.FockNumberPreservingGap BookProof.FockFieldPerturbation

Formal statement

theorem BookProof.FockCubicUnbounded.trial_support_subset (k n : ℕ) (c : ℝ) :
    (trial k n c).support ⊆ {confAt k n, confAt k (n + 3)} := by sorry

View graph