Finite Product of Semiring of Sets

AbstractWe formalize that the image of a semiring of sets [17] by an injective function is a semiring of sets.We offer a non-trivial example of a semiring of sets in a topological space [21]. Finally, we show that the finite product of a semiring of sets is also a semiring of sets [21] and that the finite product of a classical semiring of sets [8] is a classical semiring of sets. In this case, we use here the notation from the book of Aliprantis and Border [1].Rue de la Brasserie 5 7100 La Louvière, BelgiumCharalambos D. Aliprantis and Kim C. Border. Infinite dimensional analysis. Springer- Verlag, Berlin, Heidelberg, 2006.Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.Grzegorz Bancerek. König’s theorem. Formalized Mathematics, 1(3):589-593, 1990.Grzegorz Bancerek. Tarski’s classes and ranks. Formalized Mathematics, 1(3):563-567, 1990.Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.Vladimir Igorevich Bogachev and Maria Aparecida Soares Ruas. Measure theory, volume 1. Springer, 2007.Czesław Bylinski. Binary operations. Formalized Mathematics, 1(1):175-180, 1990.Czesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1): 55-65, 1990.Czesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.Czesław Bylinski. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.Czesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.Roland Coghetto. Semiring of sets. Formalized Mathematics, 22(1):79-84, 2014. doi:10.2478/forma-2014-0008. [Crossref]Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.Noboru Endou, Kazuhisa Nakasho, and Yasunari Shidama. σ-ring and σ-algebra of sets. Formalized Mathematics, 23(1):51-57, 2015. doi:10.2478/forma-2015-0004. [Crossref]D.F. Goguadze. About the notion of semiring of sets. Mathematical Notes, 74:346-351, 2003. ISSN 0001-4346. doi:10.1023/A:1026102701631. [Crossref]Zbigniew Karno. On discrete and almost discrete topological spaces. Formalized Mathematics, 3(2):305-310, 1992.Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147-152, 1990.Beata Padlewska and Agata Darmochwał. Topological spaces and continuous functions. Formalized Mathematics, 1(1):223-230, 1990.Jean Schmets. Théorie de la mesure. Notes de cours, Université de Liège, 146 pages, 2004.Andrzej Trybulec. Enumerated sets. Formalized Mathematics, 1(1):25-34, 1990.Andrzej Trybulec and Agata Darmochwał. Boolean domains. Formalized Mathematics, 1 (1):187-190, 1990.Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569-573, 1990.Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73-83, 1990.Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990

Semiring of Sets

Schmets [22] has developed a measure theory from a generalized notion of a semiring of sets. Goguadze [15] has introduced another generalized notion of semiring of sets and proved that all known properties that semiring have according to the old definitions are preserved. We show that this two notions are almost equivalent. We note that Patriota [20] has defined this quasi-semiring. We propose the formalization of some properties developed by the authors.Rue de la Brasserie 5 7100 La Louvière, BelgiumGrzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.Grzegorz Bancerek. Cardinal arithmetics. Formalized Mathematics, 1(3):543-547, 1990.Grzegorz Bancerek. König’s theorem. Formalized Mathematics, 1(3):589-593, 1990.Grzegorz Bancerek. Tarski’s classes and ranks. Formalized Mathematics, 1(3):563-567, 1990.Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.Czesław Bylinski. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.Czesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1): 55-65, 1990.Czesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.Czesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.Marek Chmur. The lattice of natural numbers and the sublattice of it. The set of prime numbers. Formalized Mathematics, 2(4):453-459, 1991.Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.Marek Dudzicz. Representation theorem for finite distributive lattices. Formalized Mathematics, 9(2):261-264, 2001.Mariusz Giero. Hierarchies and classifications of sets. Formalized Mathematics, 9(4): 865-869, 2001.D.F. Goguadze. About the notion of semiring of sets. Mathematical Notes, 74:346-351, 2003. ISSN 0001-4346. doi:10.1023/A:1026102701631.Zbigniew Karno. On discrete and almost discrete topological spaces. Formalized Mathematics, 3(2):305-310, 1992.Shunichi Kobayashi and Kui Jia. A theory of partitions. Part I. Formalized Mathematics, 7(2):243-247, 1998.Andrzej Kondracki. Basic properties of rational numbers. Formalized Mathematics, 1(5): 841-845, 1990.Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147-152, 1990.A. G Patriota. A note on Carathéodory’s extension theorem. ArXiv e-prints, 2011.Konrad Raczkowski and Paweł Sadowski. Equivalence relations and classes of abstraction. Formalized Mathematics, 1(3):441-444, 1990.Jean Schmets. Théorie de la mesure. Notes de cours, Université de Liège, 146 pages, 2004.Andrzej Trybulec. On the sets inhabited by numbers. Formalized Mathematics, 11(4): 341-347, 2003.Andrzej Trybulec and Agata Darmochwał. Boolean domains. Formalized Mathematics, 1 (1):187-190, 1990.Michał J. Trybulec. Integers. Formalized Mathematics, 1(3):501-505, 1990.Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73-83, 1990.Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990

Semiring of Sets: Examples

This article proposes the formalization of some examples of semiring of sets proposed by Goguadze [8] and Schmets [13].Rue de la Brasserie 5 7100 La Louvière, BelgiumGrzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.Grzegorz Bancerek. König’s theorem. Formalized Mathematics, 1(3):589-593, 1990.Grzegorz Bancerek. Countable sets and Hessenberg’s theorem. Formalized Mathematics, 2(1):65-69, 1991.Grzegorz Bancerek. Minimal signature for partial algebra. Formalized Mathematics, 5 (3):405-414, 1996.Józef Białas. Properties of the intervals of real numbers. Formalized Mathematics, 3(2): 263-269, 1992.Czesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.D.F. Goguadze. About the notion of semiring of sets. Mathematical Notes, 74:346-351, 2003. ISSN 0001-4346. doi:10.1023/A:1026102701631.Andrzej Nedzusiak. σ-fields and probability. Formalized Mathematics, 1(2):401-407, 1990.Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147-152, 1990.Konrad Raczkowski and Paweł Sadowski. Equivalence relations and classes of abstraction. Formalized Mathematics, 1(3):441-444, 1990.Konrad Raczkowski and Paweł Sadowski. Topological properties of subsets in real numbers. Formalized Mathematics, 1(4):777-780, 1990.Jean Schmets. Théorie de la mesure. Notes de cours, Université de Liège, 146 pages, 2004.Andrzej Trybulec. Enumerated sets. Formalized Mathematics, 1(1):25-34, 1990.Andrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97-105, 1990.Andrzej Trybulec. On the sets inhabited by numbers. Formalized Mathematics, 11(4): 341-347, 2003.Andrzej Trybulec and Agata Darmochwał. Boolean domains. Formalized Mathematics, 1 (1):187-190, 1990.Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73-83, 1990

Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems

Coalgebras in a Kleisli category yield a generic definition of trace semantics for various types of labelled transition systems. In this paper we apply this generic theory to generative probabilistic transition systems, short PTS, with arbitrary (possibly uncountable) state spaces. We consider the sub-probability monad and the probability monad (Giry monad) on the category of measurable spaces and measurable functions. Our main contribution is that the existence of a final coalgebra in the Kleisli category of these monads is closely connected to the measure-theoretic extension theorem for sigma-finite pre-measures. In fact, we obtain a practical definition of the trace measure for both finite and infinite traces of PTS that subsumes a well-known result for discrete probabilistic transition systems. Finally we consider two example systems with uncountable state spaces and apply our theory to calculate their trace measures

Stamina : stabilisation nonoids in automata theory

We present Stamina, a tool solving three algorithmic problems in automata theory. First, compute the star height of a regular language, i.e. the minimal number of nested Kleene stars needed for expressing the language with a complement-free regular expression. Second, decide limitedness for regular cost functions. Third, decide whether a probabilistic leaktight automaton has value 1, i.e. whether a probabilistic leaktight automaton accepts words with probability arbitrarily close to 1. All three problems reduce to the computation of the stabilisation monoid associated with an automaton, which is computationally challenging because the monoid is exponentially larger than the automaton. The compact data structures used in Stamina, together with optimisations and heuristics, allow us to handle automata with several hundreds of states. This radically improves upon the performances of ACME, a similar tool solving a subset of these problems

σ-ring and σ-algebra of Sets

In this article, semiring and semialgebra of sets are formalized so as to construct a measure of a given set in the next step. Although a semiring of sets has already been formalized in [13], that is, strictly speaking, a definition of a quasi semiring of sets suggested in the last few decades [15]. We adopt a classical definition of a semiring of sets here to avoid such a confusion. Ring of sets and algebra of sets have been formalized as non empty preboolean set [23] and field of subsets [18], respectively. In the second section, definitions of a ring and a σ-ring of sets, which are based on a semiring and a ring of sets respectively, are formalized and their related theorems are proved. In the third section, definitions of an algebra and a σ-algebra of sets, which are based on a semialgebra and an algebra of sets respectively, are formalized and their related theorems are proved. In the last section, mutual relationships between σ-ring and σ-algebra of sets are formalized and some related examples are given. The formalization is based on [15], and also referred to [9] and [16].Noboru Endou - Gifu National College of Technology, Gifu, JapanKazuhisa Nakasho - Shinshu University, Nagano, JapanYasunari Shidama - Shinshu University, Nagano, JapanGrzegorz Bancerek. König’s theorem. Formalized Mathematics, 1(3):589–593, 1990.Grzegorz Bancerek. Tarski’s classes and ranks. Formalized Mathematics, 1(3):563–567, 1990.Grzegorz Bancerek. Continuous, stable, and linear maps of coherence spaces. Formalized Mathematics, 5(3):381–393, 1996.Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41–46, 1990.Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91–96, 1990.Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990.Józef Białas. The σ-additive measure theory. Formalized Mathematics, 2(2):263–270, 1991.Józef Białas. Properties of the intervals of real numbers. Formalized Mathematics, 3(2): 263–269, 1992.Vladimir Igorevich Bogachev and Maria Aparecida Soares Ruas. Measure theory, volume 1. Springer, 2007.Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1): 55–65, 1990.Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153–164, 1990.Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47–53, 1990.Roland Coghetto. Semiring of sets. Formalized Mathematics, 22(1):79–84, 2014. doi:10.2478/forma-2014-0008.Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165–167, 1990.D.F. Goguadze. About the notion of semiring of sets. Mathematical Notes, 74:346–351, 2003. ISSN 0001-4346. doi:10.1023/A:1026102701631.P. R. Halmos. Measure Theory. Springer-Verlag, 1974.Jarosław Kotowicz and Konrad Raczkowski. Coherent space. Formalized Mathematics, 3 (2):255–261, 1992.Andrzej Nędzusiak. σ-fields and probability. Formalized Mathematics, 1(2):401–407, 1990.Andrzej Nędzusiak. Probability. Formalized Mathematics, 1(4):745–749, 1990.Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147–152, 1990.Konrad Raczkowski and Paweł Sadowski. Equivalence relations and classes of abstraction. Formalized Mathematics, 1(3):441–444, 1990.Andrzej Trybulec. On the sets inhabited by numbers. Formalized Mathematics, 11(4): 341–347, 2003.Andrzej Trybulec and Agata Darmochwał. Boolean domains. Formalized Mathematics, 1 (1):187–190, 1990.Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569–573, 1990.Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67–71, 1990.Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73–83, 1990.Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181–186, 1990

Lower bound in the Roth theorem for amenable groups

Let $T_1$, $T_2$ be two commuting probability measure-preserving actions of a countable amenable group such that the group spanned by these actions acts ergodically. We show that $\mu(A\cap T_1^g A\cap T_1^g T_2^g A) > \mu(A)^4-{\epsilon}$ on a syndetic set for any measurable set $A$ and any $\epsilon>0$. The proof uses the concept of a sated system introduced by Austin.Comment: v2: added a counterexample showing that the exponent in the main result cannot be improved to 3. To appear in Ergodic Theory and Dynamical System