OAI/Analysis/KadisonKastler/CompletelyBounded.lean

GitHub source file

13 declarations, 0 contain sorry, 0 declared as axioms

Matrix bounds for perturbation maps

All norms here are the C*-matrix norms, including for rectangular matrices. The rectangular formulation records exactly the estimates needed for the Haagerup product norm in the multiplication-correction argument.

  1. theorem OAI.KadisonKastler.rectangular_toCLM_mul line 23
  2. theorem OAI.KadisonKastler.rectangular_norm_mul_le line 31

    Source documentation

    Submultiplicativity also holds for rectangular C*-matrices.

    theorem rectangular_norm_mul_le {p r q : ℕ}
        (X : CStarMatrix (Fin p) (Fin r) A) (Y : CStarMatrix (Fin r) (Fin q) A) :
        ‖X * Y‖ ≤ ‖X‖ * ‖Y‖ := by
    …
  3. def OAI.KadisonKastler.CompletelyBoundedBy line 38

    Source documentation

    A complete bound, expressed on all finite rectangular matrix levels.

    def CompletelyBoundedBy (F : A →ₗ[ℂ] B) (c : ℝ) : Prop :=
    …
  4. def OAI.KadisonKastler.CompletelyIsometric line 43

    Source documentation

    Complete isometry in the same rectangular convention.

    def CompletelyIsometric (F : A →ₗ[ℂ] B) : Prop :=
    …
  5. def OAI.KadisonKastler.matrixLinearEquiv line 50

    Source documentation

    Entrywise application of a linear equivalence is an equivalence at every rectangular matrix size.

    def matrixLinearEquiv (F : A ≃ₗ[ℂ] B) (p q : ℕ) :
        CStarMatrix (Fin p) (Fin q) A ≃ₗ[ℂ] CStarMatrix (Fin p) (Fin q) B where
    …
  6. theorem OAI.KadisonKastler.matrixLinearEquiv_symm_apply line 60
  7. theorem OAI.KadisonKastler.matrix_map_sub line 65
  8. theorem OAI.KadisonKastler.matrix_map_mul line 72
  9. theorem OAI.KadisonKastler.matrix_multiplicative_defect_le line 81

    Source documentation

    The multiplicative defect estimate at all rectangular matrix sizes. This is the estimate used before transporting multiplication through F.

    theorem matrix_multiplicative_defect_le
        (ρ : A →ₐ[ℂ] B) (F : A →ₗ[ℂ] B) {e : ℝ} (he : 0 ≤ e)
        (hρ : CompletelyIsometric ρ.toLinearMap)
        (hF : CompletelyBoundedBy F 1)
        (hclose : CompletelyBoundedBy (F - ρ.toLinearMap) e)
        {p r q : ℕ} (X : CStarMatrix (Fin p) (Fin r) A)
        (Y : CStarMatrix (Fin r) (Fin q) A) :
        ‖CStarMatrix.mapₗ F (X * Y) - CStarMatrix.mapₗ F X * CStarMatrix.mapₗ F Y‖ ≤
          3 * e * ‖X‖ * ‖Y‖ := by
    …

    Mentions: OAI.KadisonKastler.CompletelyIsometric, OAI.KadisonKastler.CompletelyBoundedBy

  10. def OAI.KadisonKastler.TransportedProductBound line 129

    Source documentation

    The row-column defect of the transported multiplication. This is the concrete inequality used to invoke the published multiplication theorem.

    def TransportedProductBound (F : A ≃ₗ[ℂ] B) (c : ℝ) : Prop :=
    …
  11. theorem OAI.KadisonKastler.transportedProductBound_of_defect line 136
  12. theorem OAI.KadisonKastler.inverse_completelyBoundedBy_of_close_to_id line 159
  13. theorem OAI.KadisonKastler.inverse_sub_completelyBoundedBy_of_close_to_id line 173