Theorems · Theorem · functional analysis

ContinuousAlternatingMap.alternatizeUncurryFin_smul

∀ {𝕜 : Type u_1} {E : Type u_2} {F : Type u_3} [inst : NontriviallyNormedField 𝕜] [inst_1 : NormedAddCommGroup E]
  [inst_2 : NormedSpace 𝕜 E] [inst_3 : NormedAddCommGroup F] [inst_4 : NormedSpace 𝕜 F] {n : ℕ} {S : Type u_5}
  [inst_5 : Monoid S] [inst_6 : DistribMulAction S F] [inst_7 : ContinuousConstSMul S F] [inst_8 : SMulCommClass 𝕜 S F]
  (c : S) (f : E →L[𝕜] E [⋀^Fin n]→L[𝕜] F),
  ContinuousAlternatingMap.alternatizeUncurryFin (c • f) = c • ContinuousAlternatingMap.alternatizeUncurryFin f

Defined in

Mathlib.Analysis.Normed.Module.Alternating.Uncurry.Fin

Cited by

1 results in Mathlib

Foundations

Depth 179 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

NontriviallyNormedFieldNormedAddCommGroupNormedSpaceNormedAddCommGroupNormedSpaceMonoidDistribMulActionContinuousConstSMulSMulCommClass