Theorems · Definition · category theory
CategoryTheory.Deterministic
{C : Type u} →
[inst : CategoryTheory.Category.{v, u} C] →
[inst_1 : CategoryTheory.MonoidalCategory C] → [CategoryTheory.CopyDiscardCategory C] → {X Y : C} → (X ⟶ Y) → PropA morphism is deterministic if it preserves the comonoid structure. In probabilistic contexts, these are morphisms without randomness.
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 4 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- CategoryTheory.Categorystatement and proof · cited by 32,673
- Quiver.Homstatement and proof · cited by 32,603
- CategoryTheory.MonoidalCategorystatement and proof · cited by 3,095
- CategoryTheory.IsComonHomproof · cited by 11
- CategoryTheory.CopyDiscardCategorystatement and proof · cited by 6
Cited by9
Results whose statement or proof uses this declaration.
- CategoryTheory.PositiveCategory.noConfusionproof · cited by 0
- CategoryTheory.PositiveCategory.noConfusionTypeproof · cited by 0
- CategoryTheory.PositiveCategory.recOnstatement and proof · cited by 0
- CategoryTheory.Deterministic.copy_naturalstatement and proof · cited by 0
- CategoryTheory.Deterministic.discard_naturalstatement and proof · cited by 0
- CategoryTheory.PositiveCategory.mk.noConfusionstatement and proof · cited by 0
- CategoryTheory.PositiveCategory.casesOnstatement and proof · cited by 0
- CategoryTheory.PositiveCategory.copy_comp_naturalstatement · cited by 0
- SFinKer.deterministic_id_mapstatement · cited by 0