Formal Topological Spaces

Size: px
Start display at page:

Download "Formal Topological Spaces"

Transcription

1 FORMALIZED MATHEMATICS Volume 9, Number 3, 2001 University of Białystok Formal Topological Spaces Gang Liu Tokyo University of Mercantile Marine Yasushi Fuwa Shinshu University Nagano Masayoshi Eguchi Tokyo University of Mercantile Marine SummaryThisarticleisdividedintotwopartsInthefirstpart,weprove some useful theorems on finite topological spaces In the second part, in order to considerafamilyofneighborhoodstoapointinaspace,weextendthenotionof finite topological space and define a new topological space, which we call formal topological space We show the relation between formal topological space struct (FMT Space Str) and the TopStruct by giving a function(neighsp) And the following notions are introduced in formal topological spaces: boundary, closure, interior, isolated point, connected point, open set and close set, then some basic facts concerning them are proved We will discuss the relation between the formal topological space and the finite topological space in future work MML Identifier: FINTOPO2 Thepapers[5],[3],[2],[1],[6],and[4]providethenotationandterminologyfor this paper 1 Some Useful Theorems on Finite Topological Spaces Inthispaper F 1 denotesanonemptyfinitetopologyspaceand Adenotesa subsetofthecarrierof F 1 The following propositions are true: (1) Let F 1 beanonemptyfinitetopologyspaceand A, Bbesubsetsofthe carrierof F 1 If A B,then A i B i (2) A δ = A b (A i ) c 537 c 2001 University of Białystok ISSN

2 538 gangliuetal (3) A δ = A b \ A i (4) If A c isopen,then Aisclosed (5) If A c isclosed,then Aisopen carrierof F 1,let ybeanelementofthecarrierof F 1,andlet Abeasubsetof thecarrierof F 1 ThefunctorP 1 (x,y,a)yieldsanelementofbooleanandis defined by: { true,if y U(x)and y A, (Def1) P 1 (x,y, A) = false, otherwise carrierof F 1,let ybeanelementofthecarrierof F 1,andlet Abeasubset ofthecarrierof F 1 ThefunctorP 2 (x,y, A)yieldinganelementofBooleanis defined as follows: { true,if y U(x)and y A c, (Def2) P 2 (x,y, A) = false, otherwise We now state three propositions: (6) Let x, ybeelementsofthecarrierof F 1 and Abeasubsetofthecarrier of F 1 ThenP 1 (x,y, A) =trueifandonlyif y U(x)and y A (7) Let x, ybeelementsofthecarrierof F 1 and Abeasubsetofthecarrier of F 1 ThenP 2 (x,y, A) =trueifandonlyif y U(x)and y A c (8) Let xbeanelementofthecarrierof F 1 and Abeasubsetofthecarrier of F 1 Then x A δ ifandonlyifthereexistelements y 1, y 2 ofthecarrier of F 1 suchthatp 1 (x,y 1,A) =trueandp 2 (x,y 2,A) =true carrierof F 1,andlet ybeanelementofthecarrierof F 1 ThefunctorP 0 (x,y) yielding an element of Boolean is defined as follows: { true,if y U(x), (Def3) P 0 (x,y) = false, otherwise We now state three propositions: (9) Forallelements x, yofthecarrierof F 1 holdsp 0 (x,y) =trueiff y U(x) (10) Let xbeanelementofthecarrierof F 1 and Abeasubsetofthecarrier of F 1 Then x A i ifandonlyifforeveryelement yofthecarrierof F 1 suchthatp 0 (x,y) =trueholdsp 1 (x,y, A) =true (11) Let xbeanelementofthecarrierof F 1 and Abeasubsetofthecarrier of F 1 Then x A b ifandonlyifthereexistsanelement y 1 ofthecarrier of F 1 suchthatp 1 (x,y 1,A) =true carrierof F 1,andlet Abeasubsetofthecarrierof F 1 ThefunctorP A (x,a) yielding an element of Boolean is defined as follows:

3 formal topological spaces 539 { true,if x A, (Def4) P A (x,a) = false, otherwise One can prove the following three propositions: (12) Let xbeanelementofthecarrierof F 1 and Abeasubsetofthecarrier of F 1 ThenP A (x,a) =trueifandonlyif x A (13) Let xbeanelementofthecarrierof F 1 and Abeasubsetofthecarrier of F 1 Then x A δ i ifandonlyifthefollowingconditionsaresatisfied: (i) thereexistelements y 1, y 2 ofthecarrierof F 1 suchthatp 1 (x,y 1,A) = trueandp 2 (x, y 2,A) =true,and (ii) P A (x,a) =true (14) Let xbeanelementofthecarrierof F 1 and Abeasubsetofthecarrier of F 1 Then x A δ o ifandonlyifthefollowingconditionsaresatisfied: (i) thereexistelements y 1, y 2 ofthecarrierof F 1 suchthatp 1 (x,y 1,A) = trueandp 2 (x, y 2,A) =true,and (ii) P A (x,a) =false carrierof F 1,andlet ybeanelementofthecarrierof F 1 ThefunctorP e (x,y) yielding an element of Boolean is defined by: { true,if x = y, (Def5) P e (x,y) = false, otherwise The following four propositions are true: (15) Forallelements x, yofthecarrierof F 1 holdsp e (x,y) =trueiff x = y (16) Let xbeanelementofthecarrierof F 1 and Abeasubsetofthecarrier of F 1 Then x A s ifandonlyifthefollowingconditionsaresatisfied: (i) P A (x,a) =true,and (ii) itisnottruethatthereexistsanelement yofthecarrierof F 1 such thatp 1 (x,y, A) =trueandp e (x,y) =false (17) Let xbeanelementofthecarrierof F 1 and Abeasubsetofthecarrier of F 1 Then x A n ifandonlyifthefollowingconditionsaresatisfied: (i) P A (x,a) =true,and (ii) thereexistsanelement yofthecarrierof F 1 suchthatp 1 (x,y,a) =true andp e (x,y) =false (18) Let xbeanelementofthecarrierof F 1 and Abeasubsetofthecarrier of F 1 Then x A f ifandonlyifthereexistsanelement yofthecarrier of F 1 suchthatp A (y, A) =trueandp 0 (y,x) =true

4 540 gangliuetal 2 Formal Topological Spaces We introduce formal topological spaces which are extensions of 1-sorted structure and are systems a carrier, a Neighbour-map, wherethecarrierisasetandtheneighbour-mapisafunctionfromthecarrier into 2 2the carrier Letusobservethatthereexistsaformaltopologicalspacewhichisnon empty and strict Inthesequel T isanonemptytopologicalstructure, F 2 isanonempty formaltopologicalspace,and xisanelementofthecarrierof F 2 Letusconsider F 2 andlet xbeanelementofthecarrierof F 2 Thefunctor U F (x)yieldingasubsetof 2 thecarrierof F 2 isdefinedasfollows: (Def6) U F (x) =(theneighbour-mapof F 2 )(x) Next we state the proposition (19) Let F 2 beanonemptyformaltopologicalspaceand xbeanelementof thecarrierof F 2 Then U F (x) =(theneighbour-mapof F 2 )(x) Letusconsider TThefunctorNeighSpTyieldinganonemptystrictformal topological space is defined by the conditions(def 7) (Def7)(i) ThecarrierofNeighSpT =thecarrierof T,and (ii) foreverypoint xofneighsptholds U F (x) ={V ;Vrangesoversubsets of T: V thetopologyof T x V} Inthesequel A, B, W, Vdenotesubsetsofthecarrierof F 2 Let I 1 beanonemptyformaltopologicalspacewesaythat I 1 isfilledif andonlyif: (Def8) Foreveryelement xofthecarrierof I 1 andforeverysubset Dofthe carrierof I 1 suchthat D U F (x)holds x D Letusconsider F 2 andletusconsider AThefunctor A Fδ yieldingasubset ofthecarrierof F 2 isdefinedasfollows: (Def9) A Fδ ={x : W (W U F(x) W A W A c )} The following proposition is true (20) x A Fδ iffforevery Wsuchthat W U F (x)holds W A and W A c Letusconsider F 2 andletusconsider AThefunctor A F byieldingasubset ofthecarrierof F 2 isdefinedasfollows: (Def10) A F b ={x : W (W U F(x) W A )} One can prove the following proposition (21) x A F biffforevery Wsuchthat W U F (x)holds W A

5 formal topological spaces 541 Letusconsider F 2 andletusconsider AThefunctor A F i yieldingasubset ofthecarrierof F 2 isdefinedasfollows: (Def11) A F i ={x : V (V U F(x) V A)} Next we state the proposition (22) x A F i iffthereexists Vsuchthat V U F (x)and V A Letusconsider F 2 andletusconsider AThefunctor A F s yieldsasubsetof thecarrierof F 2 andisdefinedby: (Def12) A F s ={x : x A V (V U F(x) (V\{x}) A = )} One can prove the following proposition (23) x A Fs iff x Aandthereexists V suchthat V U F (x)and (V\ {x}) A = Letusconsider F 2 andletusconsider AThefunctor A F on yieldsasubset ofthecarrierof F 2 andisdefinedby: (Def13) A Fon = A\A Fs We now state a number of propositions: (24) x A F on iff x Aandforevery V suchthat V U F (x)holds (V\ {x}) A (25) Let F 2 beanonemptyformaltopologicalspaceand A, Bbesubsetsof thecarrierof F 2 If A B,then A F b B F b (26) Let F 2 beanonemptyformaltopologicalspaceand A, Bbesubsetsof thecarrierof F 2 If A B,then A F i B F i (27) A F b B F b A B F b (28) A B F b A F b B F b (29) A F i B F i A B F i (30) A B F i A F i B F i (31) Let F 2 beanonemptyformaltopologicalspacethenthefollowing statements are equivalent (i) foreveryelement xofthecarrierof F 2 andforallsubsets V 1, V 2 ofthe carrierof F 2 suchthat V 1 U F (x)and V 2 U F (x)thereexistsasubset Wofthecarrierof F 2 suchthat W U F (x)and W V 1 V 2, (ii) forallsubsets A, Bofthecarrierof F 2 holds A B F b = A F b B F b (32) Let F 2 beanonemptyformaltopologicalspacethenthefollowing statements are equivalent (i) foreveryelement xofthecarrierof F 2 andforallsubsets V 1, V 2 ofthe carrierof F 2 suchthat V 1 U F (x)and V 2 U F (x)thereexistsasubset Wofthecarrierof F 2 suchthat W U F (x)and W V 1 V 2, (ii) forallsubsets A, Bofthecarrierof F 2 holds A F i B F i = A B F i (33) Let F 2 beanonemptyformaltopologicalspaceand A, Bbesubsets ofthecarrierof F 2 Supposethatforeveryelement xofthecarrierof

6 542 gangliuetal F 2 andforallsubsets V 1, V 2 ofthecarrierof F 2 suchthat V 1 U F (x) and V 2 U F (x)thereexistsasubset W ofthecarrierof F 2 suchthat W U F (x)and W V 1 V 2 Then A B Fδ A Fδ B Fδ (34) Let F 2 beanonemptyformaltopologicalspacesuppose F 2 isfilled Supposethatforallsubsets A, Bofthecarrierof F 2 holds A B Fδ = A Fδ B Fδ Let xbeanelementofthecarrierof F 2 and V 1, V 2 besubsetsof thecarrierof F 2 Suppose V 1 U F (x)and V 2 U F (x)thenthereexists asubset Wofthecarrierof F 2 suchthat W U F (x)and W V 1 V 2 (35) Let xbeanelementofthecarrierof F 2 and Abeasubsetofthecarrier of F 2 Then x A F s ifandonlyifthefollowingconditionsaresatisfied: (i) x A,and (ii) x / A\{x} F b (36) Let F 2 beanonemptyformaltopologicalspacethen F 2 isfilledifand onlyifforeverysubset Aofthecarrierof F 2 holds A A F b (37) Let F 2 beanonemptyformaltopologicalspacethen F 2 isfilledifand onlyifforeverysubset Aofthecarrierof F 2 holds A F i A (38) (A cf b ) c = A F i (39) (A cf i ) c = A F b (40) A Fδ = A F b A cf b (41) A Fδ = A F b (A F i ) c (42) A Fδ = A cfδ (43) A Fδ = A F b\ A F i Letusconsider F 2 andletusconsider AThefunctor A Fδ i yieldsasubset ofthecarrierof F 2 andisdefinedby: (Def14) A Fδ i = A A Fδ Thefunctor A Fδ o yieldsasubsetofthecarrierof F 2 andisdefinedby: (Def15) A Fδ o = A c A Fδ The following proposition is true (44) A Fδ = A Fδ i A Fδ o Letusconsider F 2 andlet Gbeasubsetofthecarrierof F 2 Wesaythat G isopenifandonlyif: (Def16) G = G F i Wesaythat Gisclosedifandonlyif: (Def17) G = G F b Next we state four propositions: (45) If A c isopen,then Aisclosed (46) If A c isclosed,then Aisopen

7 formal topological spaces 543 (47) Let F 2 beanonemptyformaltopologicalspaceand A, Bbesubsetsof thecarrierof F 2 Suppose F 2 isfilledsupposethatforeveryelement xof thecarrierof F 2 holds{x} U F (x)then A B F b = A F b B F b (48) Let F 2 beanonemptyformaltopologicalspaceand A, Bbesubsetsof thecarrierof F 2 Suppose F 2 isfilledsupposethatforeveryelement xof thecarrierof F 2 holds{x} U F (x)then A F i B F i = A B F i References [1] Czesław Byliński Functions from a set to a set Formalized Mathematics, 1(1): , 1990 [2] Hiroshi Imura and Masayoshi Eguchi Finite topological spaces Formalized Mathematics, 3(2): , 1992 [3] Andrzej Trybulec Domains and their Cartesian products Formalized Mathematics, 1(1): , 1990 [4] Zinaida Trybulec Properties of subsets Formalized Mathematics, 1(1):67 71, 1990 [5] Zinaida Trybulec and Halina Święczkowska Boolean properties of sets Formalized Mathematics, 1(1):17 23, 1990 [6] Edmund Woronowicz Many argument relations Formalized Mathematics, 1(4): , 1990 Received October 13, 2000

The Concept of Fuzzy Set and Membership Function and Basic Properties of Fuzzy Set Operation

The Concept of Fuzzy Set and Membership Function and Basic Properties of Fuzzy Set Operation FORMALIZED MATHEMATICS Volume 9, Number 2, 2001 University of Białystok The Concept of Fuzzy Set and Membership Function and Basic Properties of Fuzzy Set Operation Takashi Mitsuishi Shinshu University

More information

On the Category of Posets

On the Category of Posets FORMALIZED MATHEMATICS Volume 5, Number 4, 1996 Warsaw University - Bia lystok On the Category of Posets Adam Grabowski Warsaw University Bia lystok Summary. In the paper the construction of a category

More information

The Chinese Remainder Theorem

The Chinese Remainder Theorem FORMALIZED MATHEMATICS Volume 6, Number 4, 1997 University of Białystok The Chinese Remainder Theorem Andrzej Kondracki AMS Management Systems Poland Warsaw Summary.ThearticleisatranslationofthefirstchaptersofabookWstęp

More information

Definition of Convex Function and Jensen s Inequality

Definition of Convex Function and Jensen s Inequality FORMALIZED MATHEMATICS Volume 11, Number 4, 2003 University of Białystok Definition of Convex Function and Jensen s Inequality Grigory E. Ivanov Moscow Institute for Physics and Technology Summary.Convexityofafunctioninareallinearspaceisdefinedas

More information

Equivalence of Deterministic and Nondeterministic Epsilon Automata

Equivalence of Deterministic and Nondeterministic Epsilon Automata FORMALIZED MATHEMATICS Vol. 17, No. 2, Pages 193 199, 2009 Equivalence of Deterministic and Nondeterministic Epsilon Automata Michał Trybulec YAC Software Warsaw, Poland Summary. Based on concepts introduced

More information

Affine Independence in Vector Spaces

Affine Independence in Vector Spaces FORMALIZED MATHEMATICS Vol. 18, No. 1, Pages 87 93, 2010 Affine Independence in Vector Spaces Karol Pąk Institute of Informatics University of Białystok Poland Summary. In this article we describe the

More information

The Complex Numbers. Czesław Byliński Warsaw University Białystok

The Complex Numbers. Czesław Byliński Warsaw University Białystok JOURNAL OF FORMALIZED MATHEMATICS Volume 2, Released 1990, Published 2003 Inst. of Computer Science, Univ. of Białystok The Complex Numbers Czesław Byliński Warsaw University Białystok Summary. We define

More information

The Differentiable Functions from R into R n

The Differentiable Functions from R into R n FORMALIZED MATHEMATICS Vol. 20, No. 1, Pages 65 71, 2012 DOI: 10.2478/v10037-012-0009-x versita.com/fm/ The Differentiable Functions from R into R n Keiko Narita Hirosaki-city Aomori, Japan Artur Korniłowicz

More information

The Inner Product and Conjugate of Finite Sequences of Complex Numbers

The Inner Product and Conjugate of Finite Sequences of Complex Numbers FORMALIZED MATHEMATICS Volume 13, Number 3, Pages 367 373 University of Bia lystok, 2005 The Inner Product and Conjugate of Finite Sequences of Complex Numbers Wenpai Chang Shinshu University Nagano, Japan

More information

Orthomodular Lattices

Orthomodular Lattices FORMALIZED MATHEMATICS Volume 16, Number 3, Pages 283 288 University of Białystok, 2008 Orthomodular Lattices Elżbieta Mądra Institute of Mathematics University of Białystok Akademicka 2, 15-267 Białystok

More information

The Steinitz Theorem and the Dimension of a Vector Space

The Steinitz Theorem and the Dimension of a Vector Space FORMALIZED MATHEMATICS Volume 5, Number 3, 1996 Warsaw University - Bia lystok The Steinitz Theorem and the Dimension of a Vector Space Mariusz Żynel Warsaw University Bia lystok Summary. The main purpose

More information

Rings and Modules Part II

Rings and Modules Part II JOURNAL OF FORMALIZED MATHEMATICS Volume 3, Released 1991, Published 2003 Inst. of Computer Science, Univ. of Białystok Rings and Modules Part II Michał Muzalewski Warsaw University Białystok Summary.

More information

Armstrong s Axioms 1

Armstrong s Axioms 1 JOURNAL OF FORMALIZED MATHEMATICS Volume 14, Released 2002, Published 2003 Inst. of Computer Science, Univ. of Białystok Armstrong s Axioms 1 William W. Armstrong Dendronic Decisions Ltd Edmonton Yatsuka

More information

Connectedness Conditions Using Polygonal Arcs

Connectedness Conditions Using Polygonal Arcs JOURNAL OF FORMALIZED MATHEMATICS Volume 4, Released 199, Published 003 Inst. of Computer Science, Univ. of Białystok Connectedness Conditions Using Polygonal Arcs Yatsuka Nakamura Shinshu University Nagano

More information

Submodules and Cosets of Submodules in Left Module over Associative Ring 1

Submodules and Cosets of Submodules in Left Module over Associative Ring 1 FORMALIZED MATHEMATICS Vol.2, No.2, March April 1991 Université Catholique de Louvain Submodules and Cosets of Submodules in Left Module over Associative Ring 1 Micha l Muzalewski Warsaw University Bia

More information

ordinal arithmetics 2 Let f be a sequence of ordinal numbers and let a be an ordinal number. Observe that f(a) is ordinal-like. Let us consider A, B.

ordinal arithmetics 2 Let f be a sequence of ordinal numbers and let a be an ordinal number. Observe that f(a) is ordinal-like. Let us consider A, B. JOURNAL OF FORMALIZED MATHEMATICS Volume 2, Released 1990, Published 2000 Inst. of Computer Science, University of Bia lystok Ordinal Arithmetics Grzegorz Bancerek Warsaw University Bia lystok Summary.

More information

Hiroyuki Okazaki Shinshu University Nagano, Japan

Hiroyuki Okazaki Shinshu University Nagano, Japan FORMALIZED MATHEMATICS Vol. 20, No. 4, Pages 275 280, 2012 DOI: 10.2478/v10037-012-0033-x versita.com/fm/ Free Z-module 1 Yuichi Futa Shinshu University Nagano, Japan Hiroyuki Okazaki Shinshu University

More information

Decomposing a Go-Board into Cells

Decomposing a Go-Board into Cells FORMALIZED MATHEMATICS Volume 5, Number 3, 1996 Warsaw University - Bia lystok Decomposing a Go-Board into Cells Yatsuka Nakamura Shinshu University Nagano Andrzej Trybulec Warsaw University Bia lystok

More information

String Rewriting Systems

String Rewriting Systems FORMALIZED MATHEMATICS 2007, Vol. 15, No. 3, Pages 121 126 String Rewriting Systems Micha l Trybulec Motorola Software Group Cracow, Poland Summary. Basing on the definitions from [15], semi-thue systems,

More information

Eigenvalues of a Linear Transformation

Eigenvalues of a Linear Transformation FORMALIZED MATHEMATICS Vol. 16, No. 4, Pages 289 295, 2008 Eigenvalues of a Linear Transformation Karol Pąk Institute of Computer Science University of Białystok Poland Summary. The article presents well

More information

The Inner Product and Conjugate of Matrix of Complex Numbers

The Inner Product and Conjugate of Matrix of Complex Numbers FORMALIZED MATHEMATICS Volume 13, Number 4, Pages 493 499 University of Bia lystok, 2005 The Inner Product and Conjugate of Matrix of Complex Numbers Wenpai Chang Shinshu University Nagano, Japan Hiroshi

More information

Orthomodular Lattices

Orthomodular Lattices FORMALIZED MATHEMATICS Vol. 16, No. 3, Pages 277 282, 2008 Orthomodular Lattices Elżbieta Mądra Institute of Mathematics University of Białystok Akademicka 2, 15-267 Białystok Poland Adam Grabowski Institute

More information

Properties of Binary Relations

Properties of Binary Relations FORMALIZED MATHEMATICS Number 1, January 1990 Université Catholique de Louvain Properties of Binary Relations Edmund Woronowicz 1 Warsaw University Bia lystok Anna Zalewska 2 Warsaw University Bia lystok

More information

Lower Tolerance. Preliminaries to Wroclaw Taxonomy 1

Lower Tolerance. Preliminaries to Wroclaw Taxonomy 1 JOURNAL OF FORMALIZED MATHEMATICS Volume 12, Released 2000, Published 2003 Inst. of Computer Science, Univ. of Białystok Lower Tolerance. Preliminaries to Wroclaw Taxonomy 1 Mariusz Giero University of

More information

Asymptotic Notation. Part II: Examples andproblems 1

Asymptotic Notation. Part II: Examples andproblems 1 FORMALIZED MATHEMATICS Volume 9, Number 1, 2001 University of Białystok Asymptotic Notation. Part II: Examples andproblems 1 Richard Krueger University of Alberta Edmonton Piotr Rudnicki University of

More information

Associated Matrix of Linear Map

Associated Matrix of Linear Map FORMALIZED MATHEMATICS Volume 5, Number 3, 1996 Warsaw University - Bia lystok Associated Matrix of Linear Map Robert Milewski Warsaw University Bia lystok MML Identifier: MATRLIN. The notation and terminology

More information

ATreeofExecutionofaMacroinstruction 1

ATreeofExecutionofaMacroinstruction 1 FORMALIZED MATHEMATICS Volume 12, Number 1, 2004 University of Białystok ATreeofExecutionofaMacroinstruction 1 Artur Korniłowicz University of Białystok Summary.Atreeofexecutionofamacroinstructionisdefined.Itisatree

More information

Veblen Hierarchy. Grzegorz Bancerek Białystok Technical University Poland

Veblen Hierarchy. Grzegorz Bancerek Białystok Technical University Poland FORMALIZED MATHEMATICS Vol. 19, No. 2, Pages 83 92, 2011 Veblen Hierarchy Grzegorz Bancerek Białystok Technical University Poland Summary. The Veblen hierarchy is an extension of the construction of epsilon

More information

Segments of Natural Numbers and Finite Sequences 1

Segments of Natural Numbers and Finite Sequences 1 JOURNAL OF FORMALIZED MATHEMATICS Volume 1, Released 1989, Published 2003 Inst. of Computer Science, Univ. of Białystok Segments of Natural Numbers and Finite Sequences 1 Grzegorz Bancerek Warsaw University

More information

Binary Operations Applied to Functions

Binary Operations Applied to Functions FORMALIZED MATHEMATICS Vol.1, No.2, March April 1990 Université Catholique de Louvain Binary Operations Applied to Functions Andrzej Trybulec 1 Warsaw University Bia lystok Summary. In the article we introduce

More information

Commutator and Center of a Group

Commutator and Center of a Group FORMALIZED MATHEMATICS Vol.2, No.4, September October 1991 Université Catholique de Louvain Commutator and Center of a Group Wojciech A. Trybulec Warsaw University Summary. We introduce the notions of

More information

A First-Order Predicate Calculus

A First-Order Predicate Calculus FORMALIZED MATHEMATICS Vol.1, No.4, September October 1990 Université Catholique de Louvain A First-Order Predicate Calculus Agata Darmochwa l 1 Warsaw Uniwersity Bia lystok Summary. A continuation of

More information

The Rotation Group. Karol Pąk Institute of Informatics University of Białystok Poland

The Rotation Group. Karol Pąk Institute of Informatics University of Białystok Poland FORMALIZED MATHEMATICS Vol. 20, No. 1, Pages 23 29, 2012 DOI: 10.2478/v10037-012-0004-2 versita.com/fm/ The Rotation Group Karol Pąk Institute of Informatics University of Białystok Poland Summary. We

More information

More on Multivariate Polynomials: Monomials and Constant Polynomials

More on Multivariate Polynomials: Monomials and Constant Polynomials JOURNAL OF FORMALIZED MATHEMATICS Volume 13, Released 2001, Published 2003 Inst. of Computer Science, Univ. of Białystok More on Multivariate Polynomials: Monomials and Constant Polynomials Christoph Schwarzweller

More information

The Lattice of Domains of an Extremally Disconnected Space 1

The Lattice of Domains of an Extremally Disconnected Space 1 FORMALIZED MATHEMATICS Volume 3, Number 2, 1992 Université Catholique de Louvain The Lattice of Domains of an Extremally Disconnected Space 1 Zbigniew Karno Warsaw University Bia lystok Summary. Let X

More information

Jordan Matrix Decomposition

Jordan Matrix Decomposition FORMALIZED MATHEMATICS Vol. 16, No. 4, Pages 297 303, 2008 Jordan Matrix Decomposition Karol Pąk Institute of Computer Science University of Białystok Poland Summary. In this paper I present the Jordan

More information

Cyclic Groups and Some of Their Properties - Part I

Cyclic Groups and Some of Their Properties - Part I FORMALIZED MATHEMATICS Vol2,No5, November December 1991 Université Catholique de Louvain Cyclic Groups and Some of Their Properties - Part I Dariusz Surowik Warsaw University Bia lystok Summary Some properties

More information

Basic Properties of the Rank of Matrices over a Field

Basic Properties of the Rank of Matrices over a Field FORMALIZED MATHEMATICS 2007, Vol 15, No 4, Pages 199 211 Basic Properties of the Rank of Matrices over a Field Karol P ak Institute of Computer Science University of Bia lystok Poland Summary In this paper

More information

Minimization of Finite State Machines 1

Minimization of Finite State Machines 1 FORMALIZED MATHEMATICS Volume 5, Number 2, 1996 Warsa University - Bia lystok Minimization of Finite State Machines 1 Miroslava Kaloper University of Alberta Department of Computing Science Piotr Rudnicki

More information

Epsilon Numbers and Cantor Normal Form

Epsilon Numbers and Cantor Normal Form FORMALIZED MATHEMATICS Vol. 17, No. 4, Pages 249 256, 2009 Epsilon Numbers and Cantor Normal Form Grzegorz Bancerek Białystok Technical University Poland Summary. An epsilon number is a transfinite number

More information

Coincidence Lemma and Substitution Lemma 1

Coincidence Lemma and Substitution Lemma 1 FORMALIZED MATHEMATICS Volume 13, Number 1, 2005 University of Bia lystok Coincidence Lemma and Substitution Lemma 1 Patrick Braselmann University of Bonn Peter Koepke University of Bonn Summary. This

More information

Sequences of Ordinal Numbers

Sequences of Ordinal Numbers JOURNAL OF FORMALIZED MATHEMATICS Volume 1, Released 1989, Published 2003 Inst. of Computer Science, Univ. of Białystok Sequences of Ordinal Numbers Grzegorz Bancerek Warsaw University Białystok Summary.

More information

Euler s Polyhedron Formula

Euler s Polyhedron Formula FORMALIZED MATHEMATICS Volume 16, Number 1, Pages 9 19 University of Białystok, 2008 Euler s Polyhedron Formula Jesse Alama Department of Philosophy Stanford University USA Summary. Euler s polyhedron

More information

Multiplication of Polynomials using Discrete Fourier Transformation

Multiplication of Polynomials using Discrete Fourier Transformation FORMALIZED MATHEMATICS Volume 14, Number 4, Pages 121 128 University of Bia lystok, 2006 Multiplication of Polynomials using Discrete Fourier Transformation Krzysztof Treyderowski Department of Computer

More information

Euler s Polyhedron Formula

Euler s Polyhedron Formula FORMALIZED MATHEMATICS Volume 16, Number 1, Pages 9 19 University of Białystok, 2008 Euler s Polyhedron Formula Jesse Alama Department of Philosophy Stanford University USA Summary. Euler s polyhedron

More information

Binary Operations. Czes law Byliński 1 Warsaw University Bia lystok

Binary Operations. Czes law Byliński 1 Warsaw University Bia lystok FORMALIZED MATHEMATICS Number 1, January 1990 Université Catholique de Louvain Binary Operations Czes law Byliński 1 Warsaw University Bia lystok Summary. In this paper we define binary and unary operations

More information

Cartesian Product of Functions

Cartesian Product of Functions FORMALIZED MATHEMATICS Vol.2, No.4, September October 1991 Université Catholique de Louvain Cartesian Product of Functions Grzegorz Bancerek Warsaw University Bia lystok Summary. A supplement of [3] and

More information

Extended Riemann Integral of Functions of Real Variable and One-sided Laplace Transform 1

Extended Riemann Integral of Functions of Real Variable and One-sided Laplace Transform 1 FORMALIZED MATHEMATICS Vol. 16, No. 4, Pges 311 317, 2008 Etended Riemnn Integrl of Functions of Rel Vrible nd One-sided Lplce Trnsform 1 Mshiko Ymzki Shinshu University Ngno, Jpn Hiroshi Ymzki Shinshu

More information

On Fuzzy Supra Semi T i=0, 1, 2 Space In Fuzzy Topological Space On Fuzzy Set

On Fuzzy Supra Semi T i=0, 1, 2 Space In Fuzzy Topological Space On Fuzzy Set IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-3008, p-issn:2319-7676. Volume 9, Issue 4 (Jan. 2014), PP 01-06 On Fuzzy Supra Semi T i=0, 1, 2 Space In Fuzzy Topological Space On Fuzzy Set 1 Assist.

More information

Transpose Matrices and Groups of Permutations

Transpose Matrices and Groups of Permutations FORMALIZED MATHEMATICS Vol2,No5, November December 1991 Université Catholique de Louvain Transpose Matrices and Groups of Permutations Katarzyna Jankowska Warsaw University Bia lystok Summary Some facts

More information

Formalization of Definitions and Theorems Related to an Elliptic Curve Over a Finite Prime Field by Using Mizar

Formalization of Definitions and Theorems Related to an Elliptic Curve Over a Finite Prime Field by Using Mizar J Autom Reasoning (2013) 50:161 172 DOI 10.1007/s10817-012-9265-2 Formalization of Definitions and Theorems Related to an Elliptic Curve Over a Finite Prime Field by Using Mizar Yuichi Futa Hiroyuki Okazaki

More information

Introduction to Trees

Introduction to Trees FORMALIZED MATHEMATICS Vol.1, No.2, March April 1990 Université Catholique de Louvain Introduction to Trees Grzegorz Bancerek 1 Warsaw University Bia lystok Summary. The article consists of two parts:

More information

Matrices. Abelian Group of Matrices

Matrices. Abelian Group of Matrices FORMALIZED MATHEMATICS Vol2, No4, September October 1991 Université Catholique de Louvain Matrices Abelian Group of Matrices atarzyna Jankowska Warsaw University Bia lystok Summary The basic conceptions

More information

Introduction to Kleene Algebras

Introduction to Kleene Algebras Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)

More information

Axioms of Kleene Algebra

Axioms of Kleene Algebra Introduction to Kleene Algebra Lecture 2 CS786 Spring 2004 January 28, 2004 Axioms of Kleene Algebra In this lecture we give the formal definition of a Kleene algebra and derive some basic consequences.

More information

Properties of Real Functions

Properties of Real Functions FORMALIZED MATHEMATICS Vol.1, No.4, September October 1990 Université Catholique de Louvain Properties of Real Functions Jaros law Kotowicz 1 Warsaw University Bia lystok Summary. The list of theorems

More information

Chapter-2 Relations and Functions. Miscellaneous

Chapter-2 Relations and Functions. Miscellaneous 1 Chapter-2 Relations and Functions Miscellaneous Question 1: The relation f is defined by The relation g is defined by Show that f is a function and g is not a function. The relation f is defined as It

More information

Axioms of Incidence. Wojciech A. Trybulec 1 Warsaw University

Axioms of Incidence. Wojciech A. Trybulec 1 Warsaw University FORMALIZED MATHEMATICS Number 1, January 1990 Université Catholique de Louvain Axioms of Incidence Wojciech A. Trybulec 1 Warsaw University Summary. This article is based on Foundations of Geometry by

More information

Math 730 Homework 6. Austin Mohr. October 14, 2009

Math 730 Homework 6. Austin Mohr. October 14, 2009 Math 730 Homework 6 Austin Mohr October 14, 2009 1 Problem 3A2 Proposition 1.1. If A X, then the family τ of all subsets of X which contain A, together with the empty set φ, is a topology on X. Proof.

More information

Logic Synthesis and Verification

Logic Synthesis and Verification Logic Synthesis and Verification Boolean Algebra Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 2014 1 2 Boolean Algebra Reading F. M. Brown. Boolean Reasoning:

More information

Optimization. Sherif Khalifa. Sherif Khalifa () Optimization 1 / 50

Optimization. Sherif Khalifa. Sherif Khalifa () Optimization 1 / 50 Sherif Khalifa Sherif Khalifa () Optimization 1 / 50 Y f(x 0 ) Y=f(X) X 0 X Sherif Khalifa () Optimization 2 / 50 Y Y=f(X) f(x 0 ) X 0 X Sherif Khalifa () Optimization 3 / 50 A necessary condition for

More information

Automata and Languages

Automata and Languages Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Mathematical Background Mathematical Background Sets Relations Functions Graphs Proof techniques Sets

More information

Anti fuzzy ideals of ordered semigroups

Anti fuzzy ideals of ordered semigroups International Research Journal of Applied and Basic Sciences 2014 Available online at www.irjabs.com ISSN 2251-838X / Vol, 8 (1): 21-25 Science Explorer Publications Anti fuzzy ideals of ordered semigroups

More information

Riemann Integral of Functions from R into R n

Riemann Integral of Functions from R into R n FORMLIZED MTHEMTICS Vol. 17, No. 2, Pges 175 181, 2009 DOI: 10.2478/v10037-009-0021-y Riemnn Integrl of Functions from R into R n Keiichi Miyjim Ibrki University Hitchi, Jpn Ysunri Shidm Shinshu University

More information

Riemann Integral of Functions R into C

Riemann Integral of Functions R into C FORMLIZED MTHEMTICS Vol. 18, No. 4, Pges 201 206, 2010 Riemnn Integrl of Functions R into C Keiichi Miyjim Ibrki University Fculty of Engineering Hitchi, Jpn Tkhiro Kto Grdute School of Ibrki University

More information

Lecture 5: Functions : Images, Compositions, Inverses

Lecture 5: Functions : Images, Compositions, Inverses Lecture 5: Functions : Images, Compositions, Inverses 1 Functions We have all seen some form of functions in high school. For example, we have seen polynomial, exponential, logarithmic, trigonometric functions

More information

Introduction to first-order logic:

Introduction to first-order logic: Introduction to first-order logic: First-order structures and languages. Terms and formulae in first-order logic. Interpretations, truth, validity, and satisfaction. Valentin Goranko DTU Informatics September

More information

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together

More information

Math 203A - Solution Set 1

Math 203A - Solution Set 1 Math 203A - Solution Set 1 Problem 1. Show that the Zariski topology on A 2 is not the product of the Zariski topologies on A 1 A 1. Answer: Clearly, the diagonal Z = {(x, y) : x y = 0} A 2 is closed in

More information

Topology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski

Topology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Topology, Math 581, Fall 2017 last updated: November 24, 2017 1 Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Class of August 17: Course and syllabus overview. Topology

More information

Def. A topological space X is disconnected if it admits a non-trivial splitting: (We ll abbreviate disjoint union of two subsets A and B meaning A B =

Def. A topological space X is disconnected if it admits a non-trivial splitting: (We ll abbreviate disjoint union of two subsets A and B meaning A B = CONNECTEDNESS-Notes Def. A topological space X is disconnected if it admits a non-trivial splitting: X = A B, A B =, A, B open in X, and non-empty. (We ll abbreviate disjoint union of two subsets A and

More information

Predicate Calculus - Semantics 1/4

Predicate Calculus - Semantics 1/4 Predicate Calculus - Semantics 1/4 Moonzoo Kim CS Dept. KAIST moonzoo@cs.kaist.ac.kr 1 Introduction to predicate calculus (1/2) Propositional logic (sentence logic) dealt quite satisfactorily with sentences

More information

Some Remarks on Minimal Clones

Some Remarks on Minimal Clones ALGORITHMIC COMPLEXITY and UNIVERSAL ALGEBRA 2007. 7. 16. 7. 20. Szeged, Hungary Some Remarks on Minimal Clones Hajime MACHIDA (Tokyo) Joint Work with Michael PINSKER (Wien) ALGORITHMIC COMPLEXITY and

More information

First In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018

First In-Class Exam Solutions Math 410, Professor David Levermore Monday, 1 October 2018 First In-Class Exam Solutions Math 40, Professor David Levermore Monday, October 208. [0] Let {b k } k N be a sequence in R and let A be a subset of R. Write the negations of the following assertions.

More information

T (s, xa) = T (T (s, x), a). The language recognized by M, denoted L(M), is the set of strings accepted by M. That is,

T (s, xa) = T (T (s, x), a). The language recognized by M, denoted L(M), is the set of strings accepted by M. That is, Recall A deterministic finite automaton is a five-tuple where S is a finite set of states, M = (S, Σ, T, s 0, F ) Σ is an alphabet the input alphabet, T : S Σ S is the transition function, s 0 S is the

More information

Introduction to Topology

Introduction to Topology Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about

More information

Background for Discrete Mathematics

Background for Discrete Mathematics Background for Discrete Mathematics Huck Bennett Northwestern University These notes give a terse summary of basic notation and definitions related to three topics in discrete mathematics: logic, sets,

More information

A Proof of the Jordan Curve Theorem via the Brouwer Fixed Point Theorem

A Proof of the Jordan Curve Theorem via the Brouwer Fixed Point Theorem MECHANIZED MATHEMATICS AND ITS APPLICATIONS, VOL. 6, NO. 1, NOVEMBER 2007, 33:40 A Proof of the Jordan Curve Theorem via the Brouwer Fixed Point Theorem Artur Korniłowicz Institute of Computer Science

More information

370 Y. B. Jun generate an LI-ideal by both an LI-ideal and an element. We dene a prime LI-ideal, and give an equivalent condition for a proper LI-idea

370 Y. B. Jun generate an LI-ideal by both an LI-ideal and an element. We dene a prime LI-ideal, and give an equivalent condition for a proper LI-idea J. Korean Math. Soc. 36 (1999), No. 2, pp. 369{380 ON LI-IDEALS AND PRIME LI-IDEALS OF LATTICE IMPLICATION ALGEBRAS Young Bae Jun Abstract. As a continuation of the paper [3], in this paper we investigate

More information

Aperiodic languages and generalizations

Aperiodic languages and generalizations Aperiodic languages and generalizations Lila Kari and Gabriel Thierrin Department of Mathematics University of Western Ontario London, Ontario, N6A 5B7 Canada June 18, 2010 Abstract For every integer k

More information

On intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings

On intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings Int. J. Nonlinear Anal. Appl. 7 (2016) No. 1, 295-300 ISSN: 2008-6822 (electronic) http://dx.doi.org/10.22075/ijnaa.2015.341 On intermediate value theorem in ordered Banach spaces for noncompact and discontinuous

More information

Definition: A binary relation R from a set A to a set B is a subset R A B. Example:

Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Section 9.1 Rela%onships Relationships between elements of sets occur in many contexts. Every day we deal with relationships such as those between a business and its telephone number, an employee and his

More information

Rough Approach to Fuzzification and Defuzzification in Probability Theory

Rough Approach to Fuzzification and Defuzzification in Probability Theory Rough Approach to Fuzzification and Defuzzification in Probability Theory G. Cattaneo and D. Ciucci Dipartimento di Informatica, Sistemistica e Comunicazione Università di Milano Bicocca, Via Bicocca degli

More information

AAA616: Program Analysis. Lecture 3 Denotational Semantics

AAA616: Program Analysis. Lecture 3 Denotational Semantics AAA616: Program Analysis Lecture 3 Denotational Semantics Hakjoo Oh 2018 Spring Hakjoo Oh AAA616 2018 Spring, Lecture 3 March 28, 2018 1 / 33 Denotational Semantics In denotational semantics, we are interested

More information

Quantitative Techniques (Finance) 203. Polynomial Functions

Quantitative Techniques (Finance) 203. Polynomial Functions Quantitative Techniques (Finance) 03 Polynomial Functions Felix Chan October 006 Introduction This topic discusses the properties and the applications of polynomial functions, specifically, linear and

More information

CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH. Winter CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition

More information

Optimization and Optimal Control in Banach Spaces

Optimization and Optimal Control in Banach Spaces Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex non-smooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,

More information

MASTERS EXAMINATION IN MATHEMATICS

MASTERS EXAMINATION IN MATHEMATICS MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION FALL 2010 Full points can be obtained for correct answers to 8 questions. Each numbered question (which may have several parts) is worth 20 points.

More information

This chapter contains a very bare summary of some basic facts from topology.

This chapter contains a very bare summary of some basic facts from topology. Chapter 2 Topological Spaces This chapter contains a very bare summary of some basic facts from topology. 2.1 Definition of Topology A topology O on a set X is a collection of subsets of X satisfying the

More information

Section 2.2 Set Operations. Propositional calculus and set theory are both instances of an algebraic system called a. Boolean Algebra.

Section 2.2 Set Operations. Propositional calculus and set theory are both instances of an algebraic system called a. Boolean Algebra. Section 2.2 Set Operations Propositional calculus and set theory are both instances of an algebraic system called a Boolean Algebra. The operators in set theory are defined in terms of the corresponding

More information

Digital Logic Design: a rigorous approach c

Digital Logic Design: a rigorous approach c Digital Logic Design: a rigorous approach c Chapter 1: Sets and Functions Guy Even Moti Medina School of Electrical Engineering Tel-Aviv Univ. October 25, 2017 Book Homepage: http://www.eng.tau.ac.il/~guy/even-medina

More information

Predicate Logic: Sematics Part 1

Predicate Logic: Sematics Part 1 Predicate Logic: Sematics Part 1 CS402, Spring 2018 Shin Yoo Predicate Calculus Propositional logic is also called sentential logic, i.e. a logical system that deals with whole sentences connected with

More information

{x : P (x)} P (x) = x is a cat

{x : P (x)} P (x) = x is a cat 1. Sets, relations and functions. 1.1. Set theory. We assume the reader is familiar with elementary set theory as it is used in mathematics today. Nonetheless, we shall now give a careful treatment of

More information

THE FORMAL TRIPLE I INFERENCE METHOD FOR LOGIC SYSTEM W UL

THE FORMAL TRIPLE I INFERENCE METHOD FOR LOGIC SYSTEM W UL THE FORMAL TRIPLE I INFERENCE METHOD FOR LOGIC SYSTEM W UL 1 MINXIA LUO, 2 NI SANG, 3 KAI ZHANG 1 Department of Mathematics, China Jiliang University Hangzhou, China E-mail: minxialuo@163.com ABSTRACT

More information

Chapter 6: Rational Expr., Eq., and Functions Lecture notes Math 1010

Chapter 6: Rational Expr., Eq., and Functions Lecture notes Math 1010 Section 6.1: Rational Expressions and Functions Definition of a rational expression Let u and v be polynomials. The algebraic expression u v is a rational expression. The domain of this rational expression

More information

Hence, (f(x) f(x 0 )) 2 + (g(x) g(x 0 )) 2 < ɛ

Hence, (f(x) f(x 0 )) 2 + (g(x) g(x 0 )) 2 < ɛ Matthew Straughn Math 402 Homework 5 Homework 5 (p. 429) 13.3.5, 13.3.6 (p. 432) 13.4.1, 13.4.2, 13.4.7*, 13.4.9 (p. 448-449) 14.2.1, 14.2.2 Exercise 13.3.5. Let (X, d X ) be a metric space, and let f

More information

EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) 1. RELATIONS

EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) 1. RELATIONS EQUIVALENCE RELATIONS (NOTES FOR STUDENTS) LIOR SILBERMAN Version 1.0 compiled September 9, 2015. 1.1. List of examples. 1. RELATIONS Equality of real numbers: for some x,y R we have x = y. For other pairs

More information

1 Selected Homework Solutions

1 Selected Homework Solutions Selected Homework Solutions Mathematics 4600 A. Bathi Kasturiarachi September 2006. Selected Solutions to HW # HW #: (.) 5, 7, 8, 0; (.2):, 2 ; (.4): ; (.5): 3 (.): #0 For each of the following subsets

More information

Chapter 0 Introduction. Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin

Chapter 0 Introduction. Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin Chapter 0 Introduction Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin October 2014 Automata Theory 2 of 22 Automata theory deals

More information

CLASS NOTES FOR APRIL 14, 2000

CLASS NOTES FOR APRIL 14, 2000 CLASS NOTES FOR APRIL 14, 2000 Announcement: Section 1.2, Questions 3,5 have been deferred from Assignment 1 to Assignment 2. Section 1.4, Question 5 has been dropped entirely. 1. Review of Wednesday class

More information