اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDichotomy between Deterministic and Probabilistic Models in Countably Additive Effectus Theory
57
0
0.0
(
0
)
تأليف
Kenta Cho
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Effectus theory is a relatively new approach to categorical logic that can be seen as an abstract form of generalized probabilistic theories (GPTs). While the scalars of a GPT are always the real unit interval [0,1], in an effectus they can form any effect monoid. Hence, there are quite exotic effectuses resulting from more pathological effect monoids. In this paper we introduce sigma-effectuses, where certain countable sums of morphisms are defined. We study in particular sigma-effectuses where unnormalized states can be normalized. We show that a non-trivial sigma-effectus with normalization has as scalars either the two-element effect monoid 0,1 or the real unit interval [0,1]. When states and/or predicates separate the morphisms we find that in the 0,1 case the category must embed into the category of sets and partial functions (and hence the category of Boolean algebras), showing that it implements a deterministic model, while in the [0,1] case we find it embeds into the category of Banach order-unit spaces and of Banach pre-base-norm spaces (satisfying additional properties), recovering the structure present in GPTs. Hence, from abstract categorical and operational considerations we find a dichotomy between deterministic and convex probabilistic models of physical theories.
قيم البحث
اقرأ أيضاً
Univalent homotopy type theory (HoTT) may be seen as a language for the category of $infty$-groupoids. It is being developed as a new foundation for mathematics and as an internal language for (elementary) higher toposes. We develop the theory of fac
torization systems, reflective subuniverses, and modalities in homotopy type theory, including their construction using a localization higher inductive type. This produces in particular the ($n$-connected, $n$-truncated) factorization system as well as internal presentations of subtoposes, through lex modalities. We also develop the semantics of these constructions.
Chu connections and back diagonals are introduced as morphisms for distributors between categories enriched in a small quantaloid $mathcal{Q}$. These notions, meaningful for closed bicategories, dualize the constructions of arrow categories and the F
reyd completion of categories. It is shown that, for a small quantaloid $mathcal{Q}$, the category of complete $mathcal{Q}$-categories and left adjoints is a retract of the dual of the category of $mathcal{Q}$-distributors and Chu connections, and it is dually equivalent to the category of $mathcal{Q}$-distributors and back diagonals. As an application of Chu connections, a postulation of the intuitive idea of reduction of formal contexts in the theory of formal concept analysis is presented, and a characterization of reducts of formal contexts is obtained.
These notes were originally developed as lecture notes for a category theory course. They should be well-suited to anyone that wants to learn category theory from scratch and has a scientific mind. There is no need to know advanced mathematics, nor a
ny of the disciplines where category theory is traditionally applied, such as algebraic geometry or theoretical computer science. The only knowledge that is assumed from the reader is linear algebra. All concepts are explained by giving concrete examples from different, non-specialized areas of mathematics (such as basic group theory, graph theory, and probability). Not every example is helpful for every reader, but hopefully every reader can find at least one helpful example per concept. The reader is encouraged to read all the examples, this way they may even learn something new about a different field. Particular emphasis is given to the Yoneda lemma and its significance, with both intuitive explanations, detailed proofs, and specific examples. Another common theme in these notes is the relationship between categories and directed multigraphs, which is treated in detail. From the applied point of view, this shows why categorical thinking can help whenever some process is taking place on a graph. From the pure math point of view, this can be seen as the 1-dimensional first step into the theory of simplicial sets. Finally, monads and comonads are treated on an equal footing, differently to most literature in which comonads are often overlooked as just the dual to monads. Theorems, interpretations and concrete examples are given for monads as well as for comonads.
Most of the methods that produce space weather forecasts are based on deterministic models. In order to generate a probabilistic forecast, a model needs to be run several times sampling the input parameter space, in order to generate an ensemble from
which the distribution of outputs can be inferred. However, ensemble simulations are costly and often preclude the possibility of real-time forecasting. We introduce a simple and robust method to generate uncertainties from deterministic models, that does not require ensemble simulations. The method is based on the simple consideration that a probabilistic forecast needs to be both accurate and well-calibrated (reliable). We argue that these two requirements are equally important, and we introduce the Accuracy-Reliability cost function that quantitatively measures the trade-off between accuracy and reliability. We then define the optimal uncertainties as the standard deviation of the Gaussian distribution that minimizes the cost function. We demonstrate that this simple strategy, implemented here by means of a regularized deep neural network, produces accurate and well-calibrated forecasts, showing examples both on synthetic and real-world space weather data.
Doctrines are categorical structures very apt to study logics of different nature within a unified environment: the 2-category Dtn of doctrines. Modal interior operators are characterised as particular adjoints in the 2-category Dtn. We show that the
y can be constructed from comonads in Dtn as well as from adjunctions in it, and the two constructions compare. Finally we show the amount of information lost in the passage from a comonad, or from an adjunction, to the modal interior operator. The basis for the present work is provided by some seminal work of John Power.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
