Closeness (mathematics)

Closeness (mathematics)

In topology and related areas in mathematics closeness is one of the basic concepts in a topological space. Intuitively we say two sets are close if they are arbitrarily near to each other. The concept can be defined naturally in a metric space where a notion of distance between elements of the space is defined, but it can be generalized to topological spaces where we have no concrete way to measure distances.

The closure operator closes a given set by mapping it to a closed set which contains the original set and all points close to it. The concept of closeness is related to limit point.

Contents

Definition

Given a metric space (X,d) a point p is called close or near to a set A if

d(p,A) = 0,

where the distance between a point and a set is defined as

d(p, A) := \inf_{a \in A} d(p, a).

Similarly a set B is called close to a set A if

d(B,A) = 0

where

d(B, A) := \inf_{b \in B} d(b, A).

Properties

  • if a point p is close to a set A and a set B then A and B are close (the converse is not true!).
  • closeness between a point and a set is preserved by continuous functions
  • closeness between two sets is preserved by uniformly continuous functions

Closeness relation between a point and a set

Let A and B be two sets and p a point.

  • if p is close to A then A \neq \emptyset
  • if p is close to A and B \supset A then p is close to B
  • if p is close to A \cup B then either p is close to A or p is close to B

Closeness relation between two sets

Let A,B and C be sets.

  • if A and B are close then A \neq \emptyset and B \neq \emptyset
  • if A and B are close then B and A are close
  • if A and B are close and B \subset C then A and C are close
  • if A and B \cup C are close then either A and B are close or A and C are close
  • if A \cap B \neq \emptyset then A and B are close

Generalized definition

The closeness relation between a set and a point can be generalized to any topological space. Given a topological space and a point p, p is called close to a set A if p \in \operatorname{cl}(A) = \overline A.

To define a closeness relation between two sets the topological structure is too weak and we have to use a uniform structure. Given a uniform space, sets A and B are called close to each other if they intersect all entourages, that is, for any entourage U, (A×B)∩U is non-empty.

See also


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Closeness — In mathematics, closeness defines what close means in a mathematical sense In graph theory, closeness is the shortest path between one vertex and another vertex. In social psychology, closeness is the personal distance between two people. The IOS …   Wikipedia

  • Mathematics and Physical Sciences — ▪ 2003 Introduction Mathematics       Mathematics in 2002 was marked by two discoveries in number theory. The first may have practical implications; the second satisfied a 150 year old curiosity.       Computer scientist Manindra Agrawal of the… …   Universalium

  • List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

  • List of mathematics articles (V) — NOTOC Vac Vacuous truth Vague topology Valence of average numbers Valentin Vornicu Validity (statistics) Valuation (algebra) Valuation (logic) Valuation (mathematics) Valuation (measure theory) Valuation of options Valuation ring Valuative… …   Wikipedia

  • List of general topology topics — This is a list of general topology topics, by Wikipedia page. Contents 1 Basic concepts 2 Limits 3 Topological properties 3.1 Compactness and countability …   Wikipedia

  • Girvan–Newman algorithm — The Girvan–Newman algorithm (named after Michelle Girvan and Mark Newman) is one of the methods used to detect communities in complex systems.[1] The notion of a community structure is related to that of clustering, though it isn t quite the same …   Wikipedia

  • Centrality — Within graph theory and network analysis, there are various measures of the centrality of a vertex within a graph that determine the relative importance of a vertex within the graph (for example, how important a person is within a social network …   Wikipedia

  • Pythagoreans and Eleatics — Edward Hussey PYTHAGORAS AND THE EARLY PYTHAGOREANS Pythagoras, a native of Samos, emigrated to southern Italy around 520, and seems to have established himself in the city of Croton. There he founded a society of people sharing his beliefs and… …   History of philosophy

  • Causal set theory bibliography — Main article: Causal Sets This Causal Set Theory Bibliography is intended to aid causal set research. It gathers together academic papers, books, talks and PhD theses related to causal set theory and is intended to help readers find references… …   Wikipedia

  • Uniform space — In the mathematical field of topology, a uniform space is a set with a uniform structure. Uniform spaces are topological spaces with additional structure which is used to define uniform properties such as completeness, uniform continuity and… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”