`BookProof.Complexification.Cx.cxMap_mul` (m n : W →L[ℝ] W) : cxMap (m * n) = cxMap m * cxMap n
ProvedBookProof.Complexification.Cx.cxMap_multheoremstimepiece
Prove the following Lean 4 theorem from Complexification.
BookProof.Complexification.Cx.cxMap_mul (m n : W →L[ℝ] W) : cxMap (m * n) = cxMap m * cxMap n
Formalization note: Lean 4 identifier BookProof.Complexification.Cx.cxMap_mul.
Preamble
-- Generated from Complexification.lean — theorem BookProof.Complexification.Cx.cxMap_mul
import Mathlib
import Definitions.Def_Complexification
import Definitions.Def_ChapterQgOuterFockCoreFL
open BookProof.QgOuterFockCoreFL
open BookProof.QgOuterFockCoreFL.CoreData
open BookProof.Complexification
open BookProof.Complexification.Cx
open scoped RealInnerProductSpace
open RCLike
set_option linter.unusedSectionVars false
variable {W : Type*} [NormedAddCommGroup W] [InnerProductSpace ℝ W]Formal statement
theorem BookProof.Complexification.Cx.cxMap_mul (m n : W →L[ℝ] W) : cxMap (m * n) = cxMap m * cxMap n := by sorry