More On λ κ closed sets in generalized topological spaces

Similar documents
Separation axioms on enlargements of generalized topologies

THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET

Non replication of options

Fuzzy Join - Semidistributive Lattice

Interpolation of κ-compactness and PCF

Epimorphisms and Ideals of Distributive Nearlattices

Ordered Semigroups in which the Left Ideals are Intra-Regular Semigroups

Applied Mathematics Letters

Equilibrium payoffs in finite games

MITCHELL S THEOREM REVISITED. Contents

CONGRUENCES AND IDEALS IN A DISTRIBUTIVE LATTICE WITH RESPECT TO A DERIVATION

1-TYPE CURVES AND BIHARMONIC CURVES IN EUCLIDEAN 3-SPACE

Homomorphism and Cartesian Product of. Fuzzy PS Algebras

UPWARD STABILITY TRANSFER FOR TAME ABSTRACT ELEMENTARY CLASSES

R. Selvi 1, P. Thangavelu 2. Sri Parasakthi College for Women Courtallam, INDIA 2 Department of Mathematics

arxiv: v1 [math.lo] 27 Mar 2009

Sy D. Friedman. August 28, 2001

1 Directed sets and nets

GUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv: v1 [math.lo] 25 Mar 2019

Laurence Boxer and Ismet KARACA

Theorem 1.3. Every finite lattice has a congruence-preserving embedding to a finite atomistic lattice.

DEPTH OF BOOLEAN ALGEBRAS SHIMON GARTI AND SAHARON SHELAH

Laurence Boxer and Ismet KARACA

Orthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF

4: SINGLE-PERIOD MARKET MODELS

Level by Level Inequivalence, Strong Compactness, and GCH

Equivalence between Semimartingales and Itô Processes

Solutions of Bimatrix Coalitional Games

The (λ, κ)-fn and the order theory of bases in boolean algebras

Fuzzy L-Quotient Ideals

A Property Equivalent to n-permutability for Infinite Groups

ORDERED SEMIGROUPS HAVING THE P -PROPERTY. Niovi Kehayopulu, Michael Tsingelis

arxiv:math/ v1 [math.lo] 9 Dec 2006

Variations on a theme by Weetman

arxiv: v2 [math.lo] 13 Feb 2014

arxiv:math/ v1 [math.lo] 15 Jan 1991

Game Theory: Normal Form Games

BETA DISTRIBUTION ON ARITHMETICAL SEMIGROUPS

Introduction to game theory LECTURE 2

A Translation of Intersection and Union Types

Essays on Some Combinatorial Optimization Problems with Interval Data

COMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS

Version A. Problem 1. Let X be the continuous random variable defined by the following pdf: 1 x/2 when 0 x 2, f(x) = 0 otherwise.

FUZZY PRIME L-FILTERS

INTERVAL DISMANTLABLE LATTICES

arxiv: v1 [math.lo] 8 Oct 2015

1. Introduction. As part of his study of functions defined on product spaces, M. Hušek introduced a family of diagonal conditions in a topological

Continuous images of closed sets in generalized Baire spaces ESI Workshop: Forcing and Large Cardinals

LARGE CARDINALS AND L-LIKE UNIVERSES

Silver type theorems for collapses.

An Optimal Odd Unimodular Lattice in Dimension 72

TWO-PERIODIC TERNARY RECURRENCES AND THEIR BINET-FORMULA 1. INTRODUCTION

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program August 2017

Generalising the weak compactness of ω

PARTITIONS OF 2 ω AND COMPLETELY ULTRAMETRIZABLE SPACES

METRIC POSTULATES FOR MODULAR, DISTRIBUTIVE, AND BOOLEAN LATTICES

REMARKS ON K3 SURFACES WITH NON-SYMPLECTIC AUTOMORPHISMS OF ORDER 7

In Discrete Time a Local Martingale is a Martingale under an Equivalent Probability Measure

PURITY IN IDEAL LATTICES. Abstract.

Browder-type theorems for direct sums of operators

The Limiting Distribution for the Number of Symbol Comparisons Used by QuickSort is Nondegenerate (Extended Abstract)

MATH 5510 Mathematical Models of Financial Derivatives. Topic 1 Risk neutral pricing principles under single-period securities models

On Existence of Equilibria. Bayesian Allocation-Mechanisms

FORCING AND THE HALPERN-LÄUCHLI THEOREM. 1. Introduction This document is a continuation of [1]. It is intended to be part of a larger paper.

Characterizing large cardinals in terms of layered partial orders

Brouwer, A.E.; Koolen, J.H.

Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012

Topics in Contract Theory Lecture 3

On the h-vector of a Lattice Path Matroid

Chain conditions, layered partial orders and weak compactness

Research Article The Monoid Consisting of Kuratowski Operations

Best-Reply Sets. Jonathan Weinstein Washington University in St. Louis. This version: May 2015

Best response cycles in perfect information games

A THREE-FACTOR CONVERGENCE MODEL OF INTEREST RATES

On the Lower Arbitrage Bound of American Contingent Claims

3 The Model Existence Theorem

Efficiency in Decentralized Markets with Aggregate Uncertainty

ON THE MAXIMUM AND MINIMUM SIZES OF A GRAPH

3.2 No-arbitrage theory and risk neutral probability measure

Kuhn s Theorem for Extensive Games with Unawareness

On Forchheimer s Model of Dominant Firm Price Leadership

SEMICENTRAL IDEMPOTENTS IN A RING

Chair of Communications Theory, Prof. Dr.-Ing. E. Jorswieck. Übung 5: Supermodular Games

CS792 Notes Henkin Models, Soundness and Completeness

Two hours. To be supplied by the Examinations Office: Mathematical Formula Tables and Statistical Tables THE UNIVERSITY OF MANCHESTER

Translates of (Anti) Fuzzy Submodules

arxiv: v1 [math.co] 31 Mar 2009

The finite lattice representation problem and intervals in subgroup lattices of finite groups

Chapter 3 Common Families of Distributions. Definition 3.4.1: A family of pmfs or pdfs is called exponential family if it can be expressed as

BINOMIAL TRANSFORMS OF QUADRAPELL SEQUENCES AND QUADRAPELL MATRIX SEQUENCES

Commentationes Mathematicae Universitatis Carolinae

Extender based forcings, fresh sets and Aronszajn trees

arxiv: v1 [math.lo] 24 Feb 2014

PhD Qualifier Examination

CONSISTENCY AMONG TRADING DESKS

A generalized coherent risk measure: The firm s perspective

Building Infinite Processes from Regular Conditional Probability Distributions

On the zeros of the Lerch zeta-function. III

Another Variant of 3sat. 3sat. 3sat Is NP-Complete. The Proof (concluded)

Transcription:

Journal of Algorithms and Computation journal homepage: http://jac.ut.ac.ir More On λ κ closed sets in generalized topological spaces R. Jamunarani, 1, P. Jeyanthi 2 and M. Velrajan 3 1,2 Research Center, Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur-628 215, Tamil Nadu, India. 3 Research Center, Department of Mathematics, Aditanar College of Arts and Science,, Tiruchendur - 628 216, Tamil Nadu, India ABSTRACT In this paper, we introduce λ κ closed sets and study its properties in generalized topological spaces. ARTICLE INFO Article history: Received 2, February 2014 Received in revised form 10, July 2014 Accepted 19, December 2014 Available online 30, December 2014 Keyword: Generalized topology, µ open set, µ closed set, quasi-topology, strong space, Λ κ set, λ κ open set,λ κ closed set. AMS subject Classification: Primary 54 A 05. 1 Introduction The theory of generalized topology was introduced by Császár in [1]. The properties of generalized topology, basic operators, generalized neighborhood systems and some con- Email:jamunarani1977@gmail.com E-mail: jeyajeyanthi@rediffmail.com Journal of Algorithms and Computation 45 (2014) PP. 35-41

36 R. Jamunarani / Journal of Algorithms and Computation 45 (2014) PP. 35-41 structions for generalized topologies have been studied by the same author in [1, 2, 3, 4, 5, 6]. It is well known that generalized topology in the sense of Császár [1] is a generalization of topology on a nonempty set. On the other hand, many important collections of sets related with topology on a set form a generalized topology. In this paper we define several subsets in a generalized topological spaces and study their properties. A nonempty family µ of subsets of a set X is said to be a generalized topology [2] if µ and arbitrary union of elements of µ is again in µ. The pair (X,µ) is called a generalized topological space and elements of µ are called µ open sets. A X is µ closed if X A is µ open. By a space (X,µ), we always mean a generalized topological space. If X µ, (X,µ)iscalledastrong [3]space. Clearly, (X,µ)isstrongifandonlyif isµ closedifand only if c µ ( ) =. In a space (X,µ), if µ is closed under finite intersection, (X,µ) is called a quasi-topological space [5]. Clearly, every strong, quasi-topological space is a topological space. ForA X, c µ (A)isthesmallest µ closedset containingaandi µ (A)isthelargest µ open set contained in A. Moreover, X c µ (A) = i µ (X A), for every subset A of X. A subset A of a space (X,µ) is said to be α open [4]( resp. σ open [4], π open [4], b-open [7], β open[4]) ifa i µ c µ i µ (A) (resp. A c µ i µ (A), A i µ c µ (A), A i µ c µ (A) c µ i µ (A), A c µ i µ c µ (A) ). A subset A of a space (X,µ) is said to be α closed (resp. σ closed, π closed, b-closed, β closed) if X A is α open (resp. σ open, π open, b-open, β open). Let (X,µ) be a space and ζ = {µ,α,σ,π,b,β}. For κ ζ, we consider the space (X,κ), throughout the paper. For A M κ = {B X B µ}, the subset Λ κ (A) is defined by Λ κ (A) = {G A G,G κ}. The proof of the following lemma is clear. Lemma 1.1. Let A,B and B α,α be subsets of M κ in a space (X,κ). Then the following properties are hold. (a) B Λ κ (B). (b) If A B then Λ κ (A) Λ κ (B). (c) Λ κ (Λ κ (B)) = Λ κ (B). (d) If A k, then A = Λ κ (A). (e) Λ κ ( {B α α }) = {Λ κ (B α ) α }. (f) Λ κ ( {B α α }) {Λ κ (B α ) α }. 2 More on λ κ closed sets In a space (X,κ), a subset B of M κ is called a Λ κ set if B = Λ κ (B). We state the following theorem without proof. Theorem 2.1. For subsets A and A α, α of M κ in a space (X,κ), the following hold. (a) Λ κ (A) is a Λ κ set. (b) If A κ, then A is a Λ κ set.

37 R. Jamunarani / Journal of Algorithms and Computation 45 (2014) PP. 35-41 (c) If A α is a Λ κ set for each α, then {A α α } is a Λ κ set. (d) If A α is a Λ κ set for each α, then {A α α } is a Λ κ set. A subset A of M κ in a space (X,κ) is said to be a λ κ closed set if A = T C, where T is a Λ κ set and C is a κ closed set. The complement of a λ κ closed set is called a λ κ open set. We denote the collection of all λ κ open (resp., λ κ closed) set of X by λ κ O(X) (resp., λ κ C(X)). The following theorem gives the characterization of λ κ closed sets. Lemma 2.2. Let A M κ be a subset in a space (X,κ). Then the following are equivalent. (a) A is a λ κ closed set. (b)a = T c κ (A), where T is a Λ κ set. (c) A = Λ κ (A) c κ (A). Let (X,κ) be a space. A point x M κ is called a λ κ cluster point of A if for every λ κ open set U of M κ containing x we have A U. The set of all λ κ cluster points of A is called the λ κ closure of A and is denoted by c λκ (A). Lemma 2.3 gives some properties of c λκ, the easy proof of which is omitted. Lemma 2.3. Let (X,κ) be a space and A,B M κ. Then the following properties hold. (a) A c λκ (A). (b) c λκ (A) = {F A F and F is λ κ closed}. (c) If A B, then c λκ (A) c λκ (B). (d) A is a λ κ closed set if and only if A = c λκ (A). (e) c λκ (A) is a λ κ closed set. Let (X,κ) be a space and A M κ. A point x M κ is said to be a κ limit point of A if for each κ open set U containing x, U {A {x}}. The set of all κ limit points of A is called a κ derived set of A and is denoted by D κ (A). Let (X,κ) be a space and A M κ. A point x M κ is said to be a λ κ limit point of A if for each λ κ open set U containing x, U {A {x}}. The set of all λ κ limit points of A is called a λ κ derived set of A and is denoted by D λκ (A). Theorem 2.4 gives some properties of λ κ derived sets and Theorem 2.5 gives the characterization of λ κ derived sets. Theorem 2.4. Let (X,κ) be a space and A,B M κ. Then the following hold. (a) D λκ (A) D κ (A). (b) If A B, then D λκ (A) D λκ (B). (c) D λκ (A) D λκ (B) D λκ (A B) and D λκ (A B) D λκ (A) D λκ (B). (d)d λκ D λκ (A) A D λκ (A). (e) D λκ (A D λκ (A)) A D λκ (A). Proof. (a) Since every κ open set is a λ κ open set, it follows. (b) Let x D λκ (A). Let U be any λ κ open set containing x. Then U {A {x}} and so V {B {x}}, since A B. Therefore, x D λκ (B). (c) Since A B A,B we have D λκ (A B) D λκ (A) D λκ (B). Since A,B A B,

38 R. Jamunarani / Journal of Algorithms and Computation 45 (2014) PP. 35-41 we have D λκ (A) D λκ (B) D λκ (A B). (d) Let x D λκ D λκ (A) A and U be a λ κ open set containing x. Then U (D λκ (A) {x}).lety U (D λκ (A) {x}).since y D λκ (A)andx y U, U (A {y}). Let z U (A {y}). Then z U (A {y}) implies that z U and z A {y} and so z y. Since x A, z U (A {x}) and so U (A {x}). Therefore, x D λκ (A). (e) Let x D λκ (A D λκ (A)). If x A, the result is clear. Suppose x A. Since x D λκ (A D λκ (A)) A, then for λ κ open set U containing x, U ((A D λκ (A)) {x}). Thus U (A {x}) or U (D λκ (A) {x}). Now it follows from (d) that U (A {x}). Hence, x D λκ (A). Therefore, in all the cases D λκ (A D λκ (A)) A D λκ (A). Theorem 2.5. Let (X,κ) be space and A X. Then c λκ (A) = A D λκ (A). Proof. Since D λκ (A) c λκ (A), A D λκ (A) c λκ (A). On the other hand, let x c λκ (A). If x A, the proof is complete. If x / A, then each λ κ open set U containing x intersects A at a point distinct from x. Therefore, x D λκ (A). Thus, c λκ (A) A D λκ (A) and so c λκ (A) = A D λκ (A) which completes the proof. Let (X,κ) be a space and A X. Then i λκ (A) is the union of all λ κ open set contained in A. Theorem 2.6 gives some properties of i λκ. Theorem 2.6. Let (X,κ) be a space and A,B X. Then the following hold. (a) A is a λ κ open set if and only if A = i λκ (A). (b) i λκ (i λκ (A)) = i λκ (A). (c) i λκ (A) = A D λκ (X A). (d) X i λκ (A) = c λκ (X A). (e) X c λκ (A) = i λκ (X A). (f) A B then i λκ (A) i λκ (B). (g) i λκ (A) i λκ (B) i λκ (A B) and i λκ (A) i λκ (B) i λκ (A B). Proof. (c) If x A D λκ (X A), then x / D λκ (X A) and so, there exists a λ κ open set U containing x such that U (X A) =. Then x U A and hence x i λκ (A). That is, A D λκ (X A) i λκ (A).Ontheother hand, if x i λκ (A),then x / D λκ (X A), since i λκ (A) is a λ κ open set and i λκ (A) (X A) =. Hence, i λκ (A) = A D λκ (X A). (d) X i λκ (A) = X (A D λκ (X A)) = (X A) D λκ (X A) = c λκ (X A). Let (X,κ) be a space and A X. Then b κ (A) = A i κ (A) is said to be κ border of A. Let (X,κ) be a space and A X. Then b λκ (A) = A i λκ (A) is said to be λ κ border of A. Theorem 2.7 gives some properties of b λκ. Theorem 2.7. Let (X,κ) be a space and A X. Then the following hold. (a) b λκ (A) b κ (A). (b) A = i λκ (A) b λκ (A). (c) i λκ (A) b λκ (A) =.

39 R. Jamunarani / Journal of Algorithms and Computation 45 (2014) PP. 35-41 (d) A is a λ κ open set if and only if b λκ (A) =. (e) b λκ (i λκ (A)) =. (f) i λκ (b λκ (A)) =. (g) b λκ (b λκ (A)) = b λκ (A). (h) b λκ (A) = A c λκ (X A). (i) b λκ (A) = D λκ (X A). Proof. (f) If x i λκ (b λκ (A)), then x b λκ (A). On the other hand, since b λκ (A) A, x i λκ (b λκ (A)) i λκ (A). Hence x i λκ (A) b λκ (A) which contradicts (c). Thus, i λκ (b λκ (A)) =. (h) b λκ (A) = A i λκ (A) = A (X c λκ (X A)) = A c λκ (X A). (i) b λκ (A) = A i λκ (A) = A (A D λκ (X A)) = D λκ (X A). Let (X,κ) beaspace anda X. Then F κ (A) = c κ (A) i κ (A) is said to bethe κ frontier of A. Let (X,κ) be a space and A X. Then F λκ (A) = c λκ(a) i λκ (A) is said to be the λ κ frontier of A. Theorem 2.8 gives some properties of F λκ. Theorem 2.18 Let (X,κ) be a space and A X. Then the following hold. (a) F λκ (A) F κ (A). (b) c λκ (A) = i λκ (A) F λκ (A). (c) i λκ (A) F λκ (A) =. (d) b λκ (A) F λκ (A). (e) F λκ (A) = b λκ (A) D λκ (A). (f) A is a λ κ open set if and only if F λκ (A) = D λκ (A). (g) F λκ (A) = c λκ (A) c λκ (X A).(h) F λκ (A) = F λκ (X A). (i) F λκ (A) is a λ κ closed set. (j) F λκ (F λκ (A)) F λκ (A). (k) F λκ (i λκ (A)) F λκ (A). (l) F λκ (c λκ (A)) F λκ (A). (m) i λκ (A) = A F λκ (A). Proof. (b) i λκ (A) F λκ (A) = i λκ (A) (c λκ (A) i λκ (A)) = c λκ (A). (c) i λκ (A) F λκ (A) = i λκ (A) (c λκ (A) i λκ (A)) =. (e) Since i λκ (A) F λκ (A) = i λκ (A) b λκ (A) D λκ (A), F λκ (A) = b λκ (A) D λκ (A). (g) F λκ (A) = c λκ (A) i λκ (A) = c λκ (A) c λκ (X A). (i)c λκ (F λκ (A)) = c λκ (c λκ (A) c λκ (X A)) c λκ (c λκ (A)) c λκ (c λκ (X A)) = F λκ (A). Hence F λκ (A) is a λ κ closed set. (j) F λκ (F λκ (A)) = c λκ (F λκ (A) c λκ (X F λκ (A)) c λκ (F λκ (A)) = F λκ (A). (l) F λκ (c λκ (A)) = c λκ ((c λκ (A)) i λκ (c λκ (A)) = c λκ (A) i λκ (c λκ (A)) c λκ (A) i λκ (A) = F λκ (A). (m) A F λκ (A) = A (c λκ (A) i λκ (A)) = i λκ (A).

40 R. Jamunarani / Journal of Algorithms and Computation 45 (2014) PP. 35-41 Let (X,κ) be a space and A X. Then E κ (A) = i κ (X A) is said to be κ exterior of A. Let (X,κ) be a space and A X. Then E λκ (A) = i λκ (X A) is said to be λ κ exterior of A. Theorem 2.9 gives some properties of E λκ. Theorem 2.9. Let (X,κ) be a space and A X. Then the following hold. (a) E κ (A) E λκ (A) where E κ (A) denotes the exterior of A. (b) E λκ (A) is λ κ open. (c) E λκ (A) = i λκ (X A) = X c λκ (A). (d) E λκ (E λκ (A)) = i λκ (c λκ (A)). (e) If A B,then E λκ (A) E λκ (B). (f) E λκ (A B) E λκ (A) E λκ (B). (g)e λκ (A B) E λκ (A) E λκ (B). (h) E λκ (X) =. (i) E λκ ( ) = X. (j) E λκ (A) = E λκ (X E λκ (A)). (k) i λκ (A) E λκ (E λκ (A)). (l) X = i λκ (A) E λκ (A) F λκ (A). Proof. (d)e λκ (E λκ (A)) = E λκ (X c λκ (A)) = i λκ (X (X x λκ (A)) = i λ (c λ (A)). (j)e λκ (X E λκ (A)) = E λκ (X i λκ (X A)) = i λκ (X (X i λκ (X A))) = i λκ (i λκ (X A)) = i λκ (X A) = E λ (A). (k) i λκ (A) i λκ (c λκ (A)) = i λκ (X i λκ (X A)) = i λκ (X E λκ (A)) = E λκ (E λκ (A)).

41 R. Jamunarani / Journal of Algorithms and Computation 45 (2014) PP. 35-41 References [1] Á. Császár, Generalized open sets, Acta Math. Hungar., 75(1-2)(1997), 65-87. [2] Á. Császár, Generalized topology, generalized continuity, Acta Math. Hungar., 96(2002), 351-357. [3] Á. Császár, Extremally disconnected generalized topologies, textitannales Univ. Sci. Budapest., 47(2004), 91-96. [4] Á. Császár, Generalized open sets in generalized topologies, Acta Math. Hungar., 106(2005), 351-357. [5] Á. Császár, Further remarks on the formula for γ interior, Acta Math. Hungar., 113(4)(2006),325-332. [6] Á. Császár, Remarks on quasi-topologies, Acta Math. Hungar., 119(2007), 197-200. [7] P. Sivagami, Remarks on γ interior, Acta Math. Hungar., 119(2008), 81-94.