`BookProof.CarlemanGeneralHop.sum_hop_im` {w : ℂ} {c c' : (Fin d →₀ ℕ) → ℝ} {p m : Fin d →₀ ℕ} (hcomp : ∀ b : Fin d →₀ ℕ, (∀ k, m k ≤ b k) → c' (hshift p m b) = c...
ProvedBookProof.CarlemanGeneralHop.sum_hop_imtheoremstimepiece
Prove the following Lean 4 theorem from ChapterCarlemanGeneralHop.
BookProof.CarlemanGeneralHop.sum_hop_im {w : ℂ} {c c' : (Fin d →₀ ℕ) → ℝ} {p m : Fin d →₀ ℕ} (hcomp : ∀ b : Fin d →₀ ℕ, (∀ k, m k ≤ b k) → c' (hshift p m b) = c b) (hvanL : ∀ a : Fin d →₀ ℕ, ¬ (∀ k, p k ≤ a k) → c' a = 0) (A : Finset (Fin d →₀ ℕ)) : (∑ a ∈ A, (rtG u w c p m a + ltG u w c' p m a)).im = (∑ a ∈ A \ hopB A p m, rtG u w c p m a).im - (∑ b ∈ hopB A p m \ A, rtG u w c p m b).im
Formalization note: Lean 4 identifier BookProof.CarlemanGeneralHop.sum_hop_im.
Preamble
-- Generated from ChapterCarlemanGeneralHop.lean — theorem BookProof.CarlemanGeneralHop.sum_hop_im
import Definitions.Def_ChapterHermiteCarlemanEsaPromoted
import Definitions.Def_ChapterCarlemanTwoStepPromoted
import Mathlib
import Definitions.Def_ChapterCarlemanGeneralHopPromoted
import Definitions.Def_ChapterCarlemanGeneralHopPromoted
open BookProof.CarlemanGeneralHop
open Finset
open BookProof.HermiteCarleman
open BookProof.CarlemanTwoStep
noncomputable section
variable {d : ℕ}
variable {u : (Fin d →₀ ℕ) → ℂ}Formal statement
theorem BookProof.CarlemanGeneralHop.sum_hop_im {w : ℂ} {c c' : (Fin d →₀ ℕ) → ℝ} {p m : Fin d →₀ ℕ}
(hcomp : ∀ b : Fin d →₀ ℕ, (∀ k, m k ≤ b k) → c' (hshift p m b) = c b)
(hvanL : ∀ a : Fin d →₀ ℕ, ¬ (∀ k, p k ≤ a k) → c' a = 0) (A : Finset (Fin d →₀ ℕ)) :
(∑ a ∈ A, (rtG u w c p m a + ltG u w c' p m a)).im
= (∑ a ∈ A \ hopB A p m, rtG u w c p m a).im
- (∑ b ∈ hopB A p m \ A, rtG u w c p m b).im := by sorry