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

Tables, Memorized Semirings and Applications

We define and construct a new data structure, the tables, this structure generalizes the (finite) $k$-sets sets of Eilenberg \cite{Ei}, it is versatile (one can vary the letters, the words and the coefficients). We derive from this structure a new semiring (with several semiring structures) which can be applied to the needs of automatic processing multi-agents behaviour problems. The purpose of this account/paper is to present also the basic elements of this new structures from a combinatorial point of view. These structures present a bunch of properties. They will be endowed with several laws namely : Sum, Hadamard product, Cauchy product, Fuzzy operations (min, max, complemented product) Two groups of applications are presented. The first group is linked to the process of "forgetting" information in the tables. The second, linked to multi-agent systems, is announced by showing a methodology to manage emergent organization from individual behaviour models

Rational semimodules over the max-plus semiring and geometric approach of discrete event systems

We introduce rational semimodules over semirings whose addition is idempotent, like the max-plus semiring, in order to extend the geometric approach of linear control to discrete event systems. We say that a subsemimodule of the free semimodule S^n over a semiring S is rational if it has a generating family that is a rational subset of S^n, S^n being thought of as a monoid under the entrywise product. We show that for various semirings of max-plus type whose elements are integers, rational semimodules are stable under the natural algebraic operations (union, product, direct and inverse image, intersection, projection, etc). We show that the reachable and observable spaces of max-plus linear dynamical systems are rational, and give various examples.Comment: 24 pages, 9 postscript figures; example in section 4.3 expande

Geometry of the arithmetic site

We introduce the Arithmetic Site: an algebraic geometric space deeply related to the non-commutative geometric approach to the Riemann Hypothesis. We prove that the non-commutative space quotient of the adele class space of the field of rational numbers by the maximal compact subgroup of the idele class group, which we had previously shown to yield the correct counting function to obtain the complete Riemann zeta function as Hasse-Weil zeta function, is the set of geometric points of the arithmetic site over the semifield of tropical real numbers. The action of the multiplicative group of positive real numbers on the adele class space corresponds to the action of the Frobenius automorphisms on the above geometric points. The underlying topological space of the arithmetic site is the topos of functors from the multiplicative semigroup of non-zero natural numbers to the category of sets. The structure sheaf is made by semirings of characteristic one and is given globally by the semifield of tropical integers. In spite of the countable combinatorial nature of the arithmetic site, this space admits a one parameter semigroup of Frobenius correspondences obtained as sub-varieties of the square of the site. This square is a semi-ringed topos whose structure sheaf involves Newton polygons. Finally, we show that the arithmetic site is intimately related to the structure of the (absolute) point in non-commutative geometry.Comment: 43 page

Synchronizing weighted automata

We introduce two generalizations of synchronizability to automata with transitions weighted in an arbitrary semiring K=(K,+,*,0,1). (or equivalently, to finite sets of matrices in K^nxn.) Let us call a matrix A location-synchronizing if there exists a column in A consisting of nonzero entries such that all the other columns of A are filled by zeros. If additionally all the entries of this designated column are the same, we call A synchronizing. Note that these notions coincide for stochastic matrices and also in the Boolean semiring. A set M of matrices in K^nxn is called (location-)synchronizing if M generates a matrix subsemigroup containing a (location-)synchronizing matrix. The K-(location-)synchronizability problem is the following: given a finite set M of nxn matrices with entries in K, is it (location-)synchronizing? Both problems are PSPACE-hard for any nontrivial semiring. We give sufficient conditions for the semiring K when the problems are PSPACE-complete and show several undecidability results as well, e.g. synchronizability is undecidable if 1 has infinite order in (K,+,0) or when the free semigroup on two generators can be embedded into (K,*,1).Comment: In Proceedings AFL 2014, arXiv:1405.527