IsCompact.sSup_image_eq_sSup_image_closure
theoremverifiedformalizationimported Lean
IsCompact.sSup_image_eq_sSup_image_closure
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open IsCompact in variable {α β γ : Type*} {S : Set β} {f : γ → β → α} in variable [ConditionallyCompleteLinearOrder α] [TopologicalSpace α] [OrderTopology α] in variable [TopologicalSpace γ] in variable [TopologicalSpace β] in theorem IsCompact.sSup_image_eq_sSup_image_closure {f : β → α} (hS : IsCompact (closure S)) (hf : Continuous f) : sSup (f '' S) = sSup (f '' closure S)
- Formalizes
- QuantumInfo, `IsCompact.sSup_image_eq_sSup_image_closure`
- Lean proof
- By Alex Meiburg, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2025 Alex Meiburg. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.IsCompact.sSup_image_eq_sSup_image_closure← IsCompact.sSup_image_eq_sSup_image_closure (QuantumInfo/ForMathlib/ContinuousSup.lean:21): verbatim
- Verified
- 17 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or…
- LinearOrder.toTotalPreorderEvery
- Used by 2
- IsCompact.sInf_image_eq_sInf_image_closureIsCompact.sInf_image_eq_sInf_image_closure
- IsCompact.closure_continuous_sSupA version of
IsCompact.continuous_sSupwith a slightly weaker hypothesis on the setK, that its closure is compact (but the set itself…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open IsCompact in variable {α β γ : Type*} {S : Set β} {f : γ → β → α} in variable [ConditionallyCompleteLinearOrder α] [TopologicalSpace α] [OrderTopology α] in variable [TopologicalSpace γ] in variable [TopologicalSpace β] in theorem IsCompact.sSup_image_eq_sSup_image_closure {f : β → α} (hS : IsCompact (closure S)) (hf : Continuous f) : sSup (f '' S) = sSup (f '' closure S) := by rcases S.eq_empty_or_nonempty with rfl | h; · simp refine csSup_eq_of_forall_le_of_forall_lt_exists_gt (by simpa) ?_ ?_ · rintro a ⟨w, hw, rfl⟩ exact le_csSup (hS.image hf).bddAbove (Set.mem_image_of_mem f <| subset_closure hw) · intro w hw simp only [Set.mem_image, exists_exists_and_eq_and] contrapose! hw have h_image_closure : f '' closure S ⊆ closure (f '' S) := image_closure_subset_closure_image hf have h_closure_image : closure (f '' S) ⊆ Set.Iic w := closure_minimal (Set.image_subset_iff.mpr hw) isClosed_Iic exact csSup_le ((h.mono subset_closure).image f) fun y hy ↦ (h_image_closure.trans h_closure_image) hy