LinearPMap.closure_smul
theoremverifiedformalizationimported Lean
LinearPMap.closure_smul
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.closure_smul (U : H →ₗ.[ℂ] H') {c : ℂ} (hc : c ≠ 0) : (c • U).closure = c • U.closure
- Formalizes
- Physlib, `LinearPMap.closure_smul`
- 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.closure_smul← LinearPMap.closure_smul (Physlib/QuantumMechanics/Operators/Unbounded.lean:281): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- LinearPMap.IsClosable.smulLinearPMap.IsClosable.smul
- LinearPMap.compRestricted_domainLinearPMap.compRestricted_domain
- LinearPMap.IsClosable.smul_iffLinearPMap.IsClosable.smul_iff
- persuasion_lym_sum_leLYM, relative form. If PP is an antichain of subsets of U and f(|T|) · C(|U|, |T|) ≤ B for every T ∈ PP, then ∑_{T ∈ PP} f(|T|) ≤ B.
- CommunicationComplexity.Rectangle.IsRectangle_iffCross characterization of combinatorial rectangles. A subset $R \subseteq X \times Y$ is a rectangle — that is, $R = A \times B$ for some…
- 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…
- Used by 1
- LinearPMap.IsEssentiallySelfAdjoint.smulLinearPMap.IsEssentiallySelfAdjoint.smul
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''} inlemma LinearPMap.closure_smul (U : H →ₗ.[ℂ] H') {c : ℂ} (hc : c ≠ 0) : (c • U).closure = c • U.closure := by by_cases h : U.IsClosable · apply eq_of_eq_graph ext ⟨x₁, x₂⟩ simp only [← (h.smul c).graph_closure_eq_closure_graph, smul_graph, ← SetLike.mem_coe, topologicalClosure_coe, map_coe, LinearMap.prodMap_apply, LinearMap.id_coe, id_eq, LinearMap.smul_apply, mem_closure_iff_seq_limit, Set.mem_image, Prod.exists, nhds_prod_eq, Filter.tendsto_prod_iff', ← h.graph_closure_eq_closure_graph, Prod.mk.injEq, (eq_inv_smul_iff₀ hc).symm, exists_eq_right_right, exists_eq_right] constructor <;> intro ⟨b, hb, hb₁, hb₂⟩ · refine ⟨fun n ↦ ⟨(b n).1, c⁻¹ • (b n).2⟩, fun n ↦ ?_, hb₁, hb₂.const_smul c⁻¹⟩ obtain ⟨u, v, huv, huv'⟩ := hb n have hu := mem_domain_of_mem_graph huv use ⟨⟨u, hu⟩, v⟩ simp [← huv', smul_smul, inv_mul_cancel₀ hc, (image_iff hu).mpr huv] · refine ⟨fun n ↦ ⟨(b n).1, c • (b n).2⟩, fun n ↦ ?_, hb₁, ?_⟩ · obtain ⟨u, hu, hu'⟩ := hb n exact ⟨u.1, u.2, by simp_all, by simp [← hu']⟩ · exact one_smul ℂ x₂ ▸ mul_inv_cancel₀ hc ▸ smul_smul c c⁻¹ x₂ ▸ hb₂.const_smul c · rw [closure_def' h, closure_def' <| (not_congr <| IsClosable.smul_iff hc).mpr h]