LinearPMap.adjoint_pow_le_pow_adjoint
theoremverifiedformalizationimported Lean
LinearPMap.adjoint_pow_le_pow_adjoint
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.adjoint_pow_le_pow_adjoint [CompleteSpace H] {n : ℕ} (h : (T ^ n).HasDenseDomain) : T† ^ n ≤ (T ^ n)†
- Formalizes
- Physlib, `LinearPMap.adjoint_pow_le_pow_adjoint`
- 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.adjoint_pow_le_pow_adjoint← LinearPMap.adjoint_pow_le_pow_adjoint (Physlib/QuantumMechanics/Operators/Unbounded.lean:394): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 9
- LinearPMap.adjoint_compRestricted_le_compRestricted_adjointLinearPMap.adjoint_compRestricted_le_compRestricted_adjoint
- LinearPMap.pow_hasDenseDomain_of_leLinearPMap.pow_hasDenseDomain_of_le
- LinearPMap.instMonoidLinearPMap.instMonoid
- LinearPMap.HasDenseDomainA LinearPMap
Uhas dense domain iffU.domainis dense inH. - LinearPMap.compRestricted_mono_rightLinearPMap.compRestricted_mono_right
- LinearPMap.compRestricted
g ∘ᵣ fis the composition ofgwithfrestricted to a domain consisting of exactly thosex : f.domainfor whichf x ∈ g.domain. - LinearPMap.compRestricted_assocLinearPMap.compRestricted_assoc
- LinearPMap.sum_applyLinearPMap.sum_apply
- LinearPMap.adjoint_oneLinearPMap.adjoint_one
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.adjoint_pow_le_pow_adjoint [CompleteSpace H] {n : ℕ} (h : (T ^ n).HasDenseDomain) : T† ^ n ≤ (T ^ n)† := by induction n with | zero => simp | succ n ih => have hTn : (T ^ n).HasDenseDomain := pow_hasDenseDomain_of_le h n.le_succ refine le_trans ?_ (adjoint_compRestricted_le_compRestricted_adjoint hTn h) exact pow_succ' T† n ▸ compRestricted_mono_right T† (ih hTn)