`BookProof.HermiteCarleman.mem_face` {d N : ℕ} {i : Fin d} {a : Fin d →₀ ℕ} : a ∈ face d N i ↔ (∀ j, a j ≤ N) ∧ a i = N
ProvedBookProof.HermiteCarleman.mem_facetheoremstimepiece
Prove the following Lean 4 theorem from ChapterHermiteCarlemanEsa.
BookProof.HermiteCarleman.mem_face {d N : ℕ} {i : Fin d} {a : Fin d →₀ ℕ} : a ∈ face d N i ↔ (∀ j, a j ≤ N) ∧ a i = N
Formalization note: Lean 4 identifier BookProof.HermiteCarleman.mem_face.
Preamble
-- Generated from ChapterHermiteCarlemanEsa.lean — theorem BookProof.HermiteCarleman.mem_face
import Definitions.Def_ChapterHermiteProductCore
import Definitions.Def_ChapterHermiteProductBasis
import Definitions.Def_ChapterFarisLavine
import Definitions.Def_ChapterHyperbolicQuadraticEsa
import Definitions.Def_ChapterHermiteRelativeBound
import Definitions.Def_ChapterQuadratureEsa
import Definitions.Def_ChapterStoneBridge
import Definitions.Def_ChapterEsaClosureCore
import Definitions.Def_ChapterSirkTrotterKato
import Mathlib
import Definitions.Def_ChapterHermiteCarlemanEsa
import Definitions.Def_ChapterGaussCoreQuadBounds
open BookProof.HermiteCarleman
open Finset MeasureTheory MvPolynomial
open BookProof.HermiteProductCore BookProof.HermiteProductBasis
open BookProof.FarisLavine
open BookProof.HyperbolicQuadratic
open BookProof.HermiteRelative
open BookProof.QuadratureEsa
open BookProof.StoneBridge BookProof.EsaClosure BookProof.ChapterStoneResolvent
noncomputable section
variable {d : ℕ}Formal statement
theorem BookProof.HermiteCarleman.mem_face {d N : ℕ} {i : Fin d} {a : Fin d →₀ ℕ} :
a ∈ face d N i ↔ (∀ j, a j ≤ N) ∧ a i = N := by sorry