LinearPMap.IsFormalAdjoint.unitaryConj
theoremverifiedformalizationimported Lean
Unitary conjugation preserves formal adjointness. If A is a formal adjoint of B, then u A u⁻¹ is a formal adjoint of u B u⁻¹. Unitary conjugation preserves symmetry when A = B.
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 variable (u : H ≃ₗᵢ[ℂ] H') (A : H →ₗ.[ℂ] H) in variable {u A} in open scoped InnerProductSpace in lemma LinearPMap.IsFormalAdjoint.unitaryConj {B : H →ₗ.[ℂ] H} (h : A.IsFormalAdjoint B) : (unitaryConj u A).IsFormalAdjoint (unitaryConj u B)
- Formalizes
- Physlib, `LinearPMap.IsFormalAdjoint.unitaryConj`
- 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.IsFormalAdjoint.unitaryConj← LinearPMap.IsFormalAdjoint.unitaryConj (Physlib/QuantumMechanics/Operators/Unbounded.lean:628): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- LinearPMap.unitaryConjThe conjugation
u A u⁻¹of a partially-defined operatorA : H →ₗ.[ℂ] Hby a unitaryu : H ≃ₗᵢ[ℂ] H', with domain… - LinearPMap.mem_unitaryConj_domain_iffMembership in the conjugated domain:
x ∈ D(u A u⁻¹) ↔ u⁻¹ x ∈ D(A). - KnillLaflammeA subspace $C \le \mathcal{H}_n$ satisfies the Knill--Laflamme condition for $t$-error correction if for all Pauli strings $E,F$…
- LinearPMap.unitaryConjThe conjugation
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''} invariable (u : H ≃ₗᵢ[ℂ] H') (A : H →ₗ.[ℂ] H) invariable {u A} inopen scoped InnerProductSpace in/-- Unitary conjugation preserves formal adjointness. If `A` is a formal adjoint of `B`, then `u A u⁻¹` is a formal adjoint of `u B u⁻¹`. Unitary conjugation preserves symmetry when `A = B`. -/lemma LinearPMap.IsFormalAdjoint.unitaryConj {B : H →ₗ.[ℂ] H} (h : A.IsFormalAdjoint B) : (unitaryConj u A).IsFormalAdjoint (unitaryConj u B) := by intro x y let x' : A.domain := ⟨u.symm (x : H'), (mem_unitaryConj_domain_iff u A).mp x.2⟩ let y' : B.domain := ⟨u.symm (y : H'), (mem_unitaryConj_domain_iff u B).mp y.2⟩ calc ⟪LinearPMap.unitaryConj u A x, (y : H')⟫_ℂ = ⟪A x', (y' : H)⟫_ℂ := u.inner_map_eq_flip _ _ _ = ⟪(x' : H), B y'⟫_ℂ := h x' y' _ = ⟪(x : H'), LinearPMap.unitaryConj u B y⟫_ℂ := u.symm.inner_map_eq_flip _ _