Theorems · Theorem · functional analysis

ContinuousAlternatingMap.alternatizeUncurryFin_curryLeft

∀ {𝕜 : 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 : ℕ}
  (f : E [⋀^Fin (n + 1)]→L[𝕜] F), ContinuousAlternatingMap.alternatizeUncurryFin f.curryLeft = (n + 1) • f

Defined in

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

Cited by

0 results in Mathlib

Foundations

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

Assumes

NontriviallyNormedFieldNormedAddCommGroupNormedSpaceNormedAddCommGroupNormedSpace