Theorems · Theorem · functional analysis
LinearMap.sInter_polar_finite_subset_eq_polar
∀ {𝕜 : Type u_1} {E : Type u_2} {F : Type u_3} [inst : NormedCommRing 𝕜] [inst_1 : AddCommMonoid E]
[inst_2 : AddCommMonoid F] [inst_3 : Module 𝕜 E] [inst_4 : Module 𝕜 F] (B : E →ₗ[𝕜] F →ₗ[𝕜] 𝕜) (s : Set E),
⋂₀ (B.polar '' {F | F.Finite ∧ F ⊆ s}) = B.polar s- Defined in
- Mathlib.Analysis.LocallyConvex.Polar
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 98 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites17
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Modulestatement and proof · cited by 20,661
- RingHom.idstatement and proof · cited by 18,349
- AddCommMonoidstatement and proof · cited by 12,281
- LinearMapstatement and proof · cited by 10,215
- Set.ofPredstatement and proof · cited by 6,101
- Set.imagestatement · cited by 5,609
- Set.extproof · cited by 2,266
- Set.Finitestatement and proof · cited by 1,814
- Set.sInterstatement · cited by 225
- NormedCommRingstatement and proof · cited by 218
- Set.singleton_subset_iffproof · cited by 206
Cited by1
Results whose statement or proof uses this declaration.
- NormedSpace.sInter_polar_eq_closedBallproof · cited by 0