Theorems · Theorem · functional analysis

LinearMap.polar_subMulAction

∀ {𝕜 : Type u_1} {E : Type u_2} {F : Type u_3} [inst : NontriviallyNormedField 𝕜] [inst_1 : AddCommMonoid E]
  [inst_2 : AddCommMonoid F] [inst_3 : Module 𝕜 E] [inst_4 : Module 𝕜 F] (B : E →ₗ[𝕜] F →ₗ[𝕜] 𝕜) {S : Type u_4}
  [inst_5 : SetLike S E] [SMulMemClass S 𝕜 E] (m : S), B.polar ↑m = {y | ∀ x ∈ m, (B x) y = 0}

Defined in

Mathlib.Analysis.LocallyConvex.Polar

Cited by

1 results in Mathlib

Foundations

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

Assumes

NontriviallyNormedFieldAddCommMonoidAddCommMonoidModuleModuleSetLikeSMulMemClass