File tree Expand file tree Collapse file tree
Mathlib/Analysis/LocallyConvex Expand file tree Collapse file tree Original file line number Diff line number Diff line change @@ -312,7 +312,7 @@ theorem geometric_hahn_banach_point_point [T1Space E] (hxy : x ≠ y) :
312312 (convex_singleton y) isClosed_singleton (disjoint_singleton.2 hxy)
313313 exact ⟨f, by linarith [hs x rfl, ht y rfl]⟩
314314
315- /-- A closed convex set is the intersection of halfspaces. -/
315+ /-- A closed convex set is an intersection of halfspaces. -/
316316theorem iInter_halfSpaces_eq (hs₁ : Convex ℝ s) (hs₂ : IsClosed s) :
317317 ⋂ l : StrongDual 𝕜 E, { x | ∃ y ∈ s, re (l x) ≤ re (l y) } = s := by
318318 rw [Set.iInter_setOf]
@@ -339,7 +339,7 @@ theorem iInter_halfSpaces_const_eq (hs₁ : Convex ℝ s) (hs₂ : IsClosed s) :
339339 have := lt_trans ((hLc y).1 h.some h.some_mem) (hLc y).2
340340 simp [p] at this
341341
342- /-- A closed convex set with a Lindelöf complement is the intersection of countably many
342+ /-- A closed convex set with a Lindelöf complement is an intersection of countably many
343343halfspaces. -/
344344theorem _root_.IsLindelof.iInter_countable_halfSpaces_const_eq (hs₁ : Convex ℝ s) (hs₂ : IsClosed s)
345345 (hs₃ : IsLindelof sᶜ) : ∃ (u : Set (sᶜ : Set E)) (L : u → StrongDual 𝕜 E) (c : u → ℝ),
You can’t perform that action at this time.
0 commit comments