{"title":"Formalizing Probability Concepts in a Type Theory","authors":"F. Kachapova","doi":"10.3844/OFSP.12176","DOIUrl":null,"url":null,"abstract":"In this paper we formalize some fundamental concepts of probability theory such as the axiomatic definition of probability space, random variables and their characteristics, in the Calculus of Inductive Constructions, which is a variant of type theory and the foundation for the proof assistant COQ. In a type theory every term and proposition should have a type, so in our formalizations we assign an appropriate type to each object in order to create a framework where further development of formalized probability theory will be possible. Our formalizations are based on mathematical results developed in the COQ standard library; we use mainly the parts with logic and formalized real analysis. In the future we aim to create COQ coding for our formalizations of probability concepts and theorems. In this paper the definitions and some proofs are presented as flag-style derivations while other proofs are more informal.","PeriodicalId":41981,"journal":{"name":"Jordan Journal of Mathematics and Statistics","volume":"8 1","pages":"209-218"},"PeriodicalIF":0.3000,"publicationDate":"2018-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jordan Journal of Mathematics and Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3844/OFSP.12176","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper we formalize some fundamental concepts of probability theory such as the axiomatic definition of probability space, random variables and their characteristics, in the Calculus of Inductive Constructions, which is a variant of type theory and the foundation for the proof assistant COQ. In a type theory every term and proposition should have a type, so in our formalizations we assign an appropriate type to each object in order to create a framework where further development of formalized probability theory will be possible. Our formalizations are based on mathematical results developed in the COQ standard library; we use mainly the parts with logic and formalized real analysis. In the future we aim to create COQ coding for our formalizations of probability concepts and theorems. In this paper the definitions and some proofs are presented as flag-style derivations while other proofs are more informal.