LinearPMap.IsClosed.add_continuous
theoremverifiedformalizationimported Lean
Closedness is preserved upon adding a continuous operator.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open LinearPMap in open Submodule in open InnerProductSpace in open Complex ComplexConjugate in variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] {H' : Type*} [NormedAddCommGroup H'] [InnerProductSpace ℂ H'] {H'' : Type*} [NormedAddCommGroup H''] [InnerProductSpace ℂ H''] {α : Type*} [Fintype α] {T T₁ T₂ : H →ₗ.[ℂ] H} {S : α → H →ₗ.[ℂ] H} {U U₁ U₂ : H →ₗ.[ℂ] H'} {W : α → H →ₗ.[ℂ] H'} {V V₁ V₂ : H' →ₗ.[ℂ] H''} in lemma LinearPMap.IsClosed.add_continuous [CompleteSpace H'] (h₁ : U₁.IsClosed) (h₂ : Continuous U₂) (h : U₁.domain ≤ U₂.domain) : (U₁ + U₂).IsClosed
- Formalizes
- Physlib, `LinearPMap.IsClosed.add_continuous`
- Lean proof
- By Adam Bornemann, Gregory J. Loges, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2026 Gregory J. Loges. 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.LinearPMap.IsClosed.add_continuous← LinearPMap.IsClosed.add_continuous (Physlib/QuantumMechanics/Operators/Unbounded.lean:517): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- LinearPMap.IsClosable.add_continuousClosability is preserved upon adding a continuous operator.
- LinearPMap.IsClosable.isClosed_iffLinearPMap.IsClosable.isClosed_iff
- LinearMap.continuous_iff_bounded
f : E →ₗ[𝕜] Fis continuous iff there existsM > 0s.t.‖f x‖ ≤ M * ‖x‖for allx : E. This is a (convenient) immediate… - LinearPMap.IsClosed.closure_eqLinearPMap.IsClosed.closure_eq
- StandardModel.GaugeGroupI.ofU1SubgroupThe inclusion of a U(1) subgroup.
- CommunicationComplexity.Deterministic.Protocol.aux_subsetAuxiliary leaf rectangles lie within the constraint. Let $p$ be a deterministic two-party communication protocol over input types $X$…
- dim_map_r_ERank of a restricted subspace of $\mathbb{F}_p^n \times \mathbb{F}_p^n$. Fix a prime $p$ and an integer $n \ge 0$, and let…
- catch_up_value_eq_draw_iff_not_lossThe outcome of Catch-Up on a nonempty set S is a draw if and only if Player 1 does not lose from the initial position and Player 2 does…
- Used by 1
- LinearPMap.IsClosed.sub_continuousClosedness is preserved upon subtracting a continuous operator.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen LinearPMap inopen Submodule inopen InnerProductSpace inopen Complex ComplexConjugate invariable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] {H' : Type*} [NormedAddCommGroup H'] [InnerProductSpace ℂ H'] {H'' : Type*} [NormedAddCommGroup H''] [InnerProductSpace ℂ H''] {α : Type*} [Fintype α] {T T₁ T₂ : H →ₗ.[ℂ] H} {S : α → H →ₗ.[ℂ] H} {U U₁ U₂ : H →ₗ.[ℂ] H'} {W : α → H →ₗ.[ℂ] H'} {V V₁ V₂ : H' →ₗ.[ℂ] H''} in/-- Closedness is preserved upon adding a continuous operator. -/lemma LinearPMap.IsClosed.add_continuous [CompleteSpace H'] (h₁ : U₁.IsClosed) (h₂ : Continuous U₂) (h : U₁.domain ≤ U₂.domain) : (U₁ + U₂).IsClosed := by have hcl : (U₁ + U₂).IsClosable := h₁.isClosable.add_continuous h₂ h refine hcl.isClosed_iff.mpr (eq_of_le_of_ge (le_of_le_graph ?_) (U₁ + U₂).le_closure) rw [← hcl.graph_closure_eq_closure_graph] intro ⟨x₁, x₂⟩ hx obtain ⟨b, hb, hbx⟩ := mem_closure_iff_seq_limit.mp hx simp only [coe_toAddSubmonoid, SetLike.mem_coe, mem_graph_iff, Subtype.exists, exists_and_left, exists_eq_left, add_domain, inf_of_le_left h] at hb rw [nhds_prod_eq] at hbx have hb₁U₂ : ∀ n, (b n).1 ∈ U₂.domain := fun n ↦ h (hb n).choose have hCS : CauchySeq fun n ↦ U₂ ⟨(b n).1, hb₁U₂ n⟩ := by obtain ⟨M, hM, h_bound⟩ := LinearMap.continuous_iff_bounded.mp h₂ refine Metric.cauchySeq_iff'.mpr fun ε hε ↦ ?_ obtain ⟨N, hN⟩ := Metric.cauchySeq_iff'.mp hbx.fst.cauchySeq (M⁻¹ * ε) (by positivity) refine ⟨N, fun n hn ↦ ?_⟩ calc _ = ‖U₂ (⟨(b n).1, hb₁U₂ n⟩ - ⟨(b N).1, hb₁U₂ N⟩)‖ := by rw [map_sub, dist_eq_norm] _ ≤ M * ‖(b n).1 - (b N).1‖ := h_bound _ _ < ε := dist_eq_norm (b n).1 (b N).1 ▸ (lt_inv_mul_iff₀ hM).mp (hN n hn) obtain ⟨y, hy⟩ := CompleteSpace.complete hCS have hU₁ : (x₁, x₂ - y) ∈ U₁.graph := by rw [← h₁.closure_eq, ← h₁.isClosable.graph_closure_eq_closure_graph] apply mem_closure_iff_seq_limit.mpr refine ⟨fun n ↦ ((b n).1, (b n).2 - U₂ ⟨(b n).1, hb₁U₂ n⟩), fun n ↦ ?_, ?_⟩ · simp_all [add_apply, eq_sub_iff_add_eq] · rw [nhds_prod_eq] exact hbx.fst.prodMk (hbx.snd.sub hy) have hx₁ : x₁ ∈ U₁.domain := mem_domain_of_mem_graph hU₁ have hU₂y : U₂ ⟨x₁, h hx₁⟩ = y := by refine tendsto_nhds_unique ((h₂.tendsto ⟨x₁, h hx₁⟩).comp ?_) (Filter.tendsto_map'_iff.mp hy) exact tendsto_subtype_rng.mpr hbx.fst simp_all [add_domain, add_apply]