Documentation

PolyFun.Interaction.Open.OpenTheory.Quotient

Quotient open theories #

OpenTheory.quotient T E is the open theory whose objects at each boundary are the classes of T's objects under the congruence E, with the operations descended along Quotient.map' and Quotient.map₂'.

The point of the construction is to prove coherence once. A theory whose laws hold only up to E satisfies the laws modulo E — the classes IsLawfulMod, IsMonoidalMod, IsTracedMod, IsCompactClosedMod, HasPlugWireFactorMod, and HasPlugFactorizationMod, whose fields are the strict laws with equality replaced by E.rel — and each of them lifts to the corresponding strict class on the quotient. A strict theory satisfies every law modulo any congruence, so nothing is lost for theories that already satisfy the strict ladder.

Downstream, the composition theorems of Emulates therefore apply to the quotient of a process model unchanged, and observations on the quotient pull back to observations on the model that respect factorization; see EmulatesQuotient.

The quotient theory #

The quotient of T by the congruence E.

Equations
  • One or more equations did not get rendered due to their size.
Instances For

    The class of an object in the quotient theory.

    Equations
    Instances For
      theorem Interaction.Open.OpenTheory.Congruence.cls_eq_cls {T : OpenTheory} (E : T.Congruence) {Δ : PortBoundary} {W W' : T.Obj Δ} :
      E.cls W = E.cls W' ↔ E.rel W W'
      @[simp]
      theorem Interaction.Open.OpenTheory.Congruence.quotient_map_cls {T : OpenTheory} (E : T.Congruence) {Δ₁ Δ₂ : PortBoundary} (φ : Δ₁.Hom Δ₂) (W : T.Obj Δ₁) :
      (T.quotient E).map φ (E.cls W) = E.cls (T.map φ W)
      @[simp]
      theorem Interaction.Open.OpenTheory.Congruence.quotient_par_cls {T : OpenTheory} (E : T.Congruence) {Δ₁ Δ₂ : PortBoundary} (W₁ : T.Obj Δ₁) (W₂ : T.Obj Δ₂) :
      (T.quotient E).par (E.cls W₁) (E.cls W₂) = E.cls (T.par W₁ W₂)
      @[simp]
      theorem Interaction.Open.OpenTheory.Congruence.quotient_wire_cls {T : OpenTheory} (E : T.Congruence) {Δ₁ Γ Δ₂ : PortBoundary} (W₁ : T.Obj (Δ₁.tensor Γ)) (W₂ : T.Obj (Γ.swap.tensor Δ₂)) :
      (T.quotient E).wire (E.cls W₁) (E.cls W₂) = E.cls (T.wire W₁ W₂)
      @[simp]
      theorem Interaction.Open.OpenTheory.Congruence.quotient_plug_cls {T : OpenTheory} (E : T.Congruence) {Δ : PortBoundary} (W : T.Obj Δ) (K : T.Obj Δ.swap) :
      (T.quotient E).plug (E.cls W) (E.cls K) = E.cls (T.plug W K)
      theorem Interaction.Open.OpenTheory.Congruence.quotient_ind {T : OpenTheory} (E : T.Congruence) {Δ : PortBoundary} {p : (T.quotient E).Obj Δ → Prop} (h : ∀ (W : T.Obj Δ), p (E.cls W)) (q : (T.quotient E).Obj Δ) :
      p q

      Induction on the quotient: it suffices to consider classes.

      Laws modulo a congruence #

      Naturality of the operations up to E: the fields of IsLawful with equality replaced by E.rel.

      Instances

        The symmetric monoidal laws up to E.

        Instances

          The trace laws up to E.

          Instances

            The compact-closure laws up to E.

            Instances

              The plug-wire factorization laws up to E.

              Instances

                The five plug-factorization laws up to E.

                Instances

                  Strict laws hold modulo any congruence #

                  Laws modulo the congruence lift to the quotient #

                  @[instance_reducible]
                  Equations
                  @[instance_reducible]
                  Equations
                  @[instance_reducible]
                  Equations