AFTD Auto-Formalizing Theoretical Domains

LinearPMap.IsUnbounded.adjoint

theoremverifiedformalizationimported Lean

LinearPMap.IsUnbounded.adjoint

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open LinearPMap in
open Submodule in
open InnerProductSpace in
open InnerProductSpaceSubmodule 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
variable (u : H ≃ₗᵢ[ℂ] H') (A : H →ₗ.[ℂ] H) in
variable {u A} in
lemma LinearPMap.IsUnbounded.adjoint [CompleteSpace H] [CompleteSpace H'] (h : U.IsUnbounded) :
    U†.IsUnbounded
Formalizes
Physlib, `LinearPMap.IsUnbounded.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.
Verified
10 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 7
Used by 3

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen LinearPMap inopen Submodule inopen InnerProductSpace inopen InnerProductSpaceSubmodule 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''} invariable (u : H ≃ₗᵢ[ℂ] H') (A : H →ₗ.[ℂ] H) invariable {u A} inlemma LinearPMap.IsUnbounded.adjoint [CompleteSpace H] [CompleteSpace H'] (h : U.IsUnbounded) :    U†.IsUnbounded := by  refine ⟨?_, (adjoint_isClosed h.1).isClosable⟩  by_contra h_adj  obtain ⟨y, hy⟩ := not_forall.mp h_adj  have h_ne_bot : U†.domainᗮ = ⊥ → False := by    rw [← orthogonal_eq_top_iff, orthogonal_orthogonal_eq_closure]    exact fun a ↦ ne_of_mem_of_not_mem' mem_top hy a.symm  obtain ⟨x, hx, hx'⟩ := exists_mem_ne_zero_of_ne_bot h_ne_bot  apply hx'  refine graph_fst_eq_zero_snd U.closure ?_ rfl  rw [← IsClosable.graph_closure_eq_closure_graph h.2,    mem_submodule_closure_iff_mem_submoduleToLp_closure, ← orthogonal_orthogonal_eq_closure,    ← mem_submodule_adjoint_adjoint_iff_mem_submoduleToLp_orthogonal_orthogonal,    ← adjoint_graph_eq_graph_adjoint h.1, mem_submodule_adjoint_iff_mem_submoduleToLp_orthogonal]  rintro ⟨y, Uy⟩ hy  simp only [neg_zero, WithLp.prod_inner_apply, inner_zero_right, add_zero]  exact hx y (mem_domain_of_mem_graph hy)
See it in the graphDiscuss this resultChallenge it