AFTD Auto-Formalizing Theoretical Domains

NormedSpace.exp_map_algebraMap

theoremverifiedformalizationimported Lean

NormedSpace.exp_map_algebraMap

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
lemma NormedSpace.exp_map_algebraMap {n : Type*} [Fintype n] [DecidableEq n]
    (A : Matrix n n ℝ) :
    (exp A).map (algebraMap ℝ ℂ) = exp (A.map (algebraMap ℝ ℂ))
Formalizes
Physlib, `NormedSpace.exp_map_algebraMap`
Lean proof
By Matteo Cipollina, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 Matteo Cipollina. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
Verified
09 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inlemma NormedSpace.exp_map_algebraMap {n : Type*} [Fintype n] [DecidableEq n]    (A : Matrix n n ℝ) :    (exp A).map (algebraMap ℝ ℂ) = exp (A.map (algebraMap ℝ ℂ)) := by  let : SeminormedRing (Matrix n n ℝ) := Matrix.linftyOpSemiNormedRing  let : NormedRing (Matrix n n ℝ) := Matrix.linftyOpNormedRing  let : NormedAlgebra ℝ (Matrix n n ℝ) := Matrix.linftyOpNormedAlgebra  let : CompleteSpace (Matrix n n ℝ) := inferInstance  let : SeminormedRing (Matrix n n ℂ) := Matrix.linftyOpSemiNormedRing  let : NormedRing (Matrix n n ℂ) := Matrix.linftyOpNormedRing  let : NormedAlgebra ℂ (Matrix n n ℂ) := Matrix.linftyOpNormedAlgebra  let : CompleteSpace (Matrix n n ℂ) := inferInstance  simp only [exp_eq_tsum ℝ]  have hs : Summable (fun k => (k.factorial : ℝ)⁻¹ • A ^ k) := by    exact NormedSpace.expSeries_summable' A  erw [Matrix.map_tsum (algebraMap ℝ ℂ).toAddMonoidHom RCLike.continuous_ofReal hs]  apply tsum_congr  intro k  erw [Matrix.map_smul, Matrix.map_pow A (algebraMap ℝ ℂ) k]  simp
See it in the graphDiscuss this resultChallenge it