Theorems · Definition · functional analysis

CompletelyPositiveMap.noConfusionType

Sort u →
  {A₁ : Type u_1} →
    {A₂ : Type u_2} →
      [inst : NonUnitalCStarAlgebra A₁] →
        [inst_1 : NonUnitalCStarAlgebra A₂] →
          [inst_2 : PartialOrder A₁] →
            [inst_3 : PartialOrder A₂] →
              [inst_4 : StarOrderedRing A₁] →
                [inst_5 : StarOrderedRing A₂] →
                  CompletelyPositiveMap A₁ A₂ →
                    {A₁' : Type u_1} →
                      {A₂' : Type u_2} →
                        [inst' : NonUnitalCStarAlgebra A₁'] →
                          [inst'_1 : NonUnitalCStarAlgebra A₂'] →
                            [inst'_2 : PartialOrder A₁'] →
                              [inst'_3 : PartialOrder A₂'] →
                                [inst'_4 : StarOrderedRing A₁'] →
                                  [inst'_5 : StarOrderedRing A₂'] → CompletelyPositiveMap A₁' A₂' → Sort u

Defined in

Mathlib.Analysis.CStarAlgebra.CompletelyPositiveMap

Cited by

0 results in Mathlib

Foundations

Depth 357 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

NonUnitalCStarAlgebraNonUnitalCStarAlgebraPartialOrderPartialOrderStarOrderedRingStarOrderedRingNonUnitalCStarAlgebraNonUnitalCStarAlgebraPartialOrderPartialOrderStarOrderedRingStarOrderedRing