2. School of Science, Xi'an University of Architecture and Technology, Xi'an 710055, China
2. 西安建筑科技大学 理学院, 陕西 西安 710055
In 1960, nonstandard analysis was founded by American mathematical logician ROBINSON[1]. As a new branch of mathematics and new mathematical method, nonstandard analysis was a new mathematical theory that used nonstandard models to study various mathematical problems. In nonstandard analysis, nonstandard topology was an important reaching field.
As usual, there were two ways to study nonstandard topology. One was to research the general topological space[1-2] or uniform space[3-4] by nonstandard analysis methods, the other was directly to study the topology on a nonstandard set[5-6]. In this paper, the latter will be shown. On two nonstandard sets, Fin(*X) and *X, *-topology
Firstly, some basic concepts and conclusions are recalled. For details, [1, 2, 5, 7] can be referenced. In this paper, X is any non-empty set. N, R and R+ denote the sets of the natural, real and positive real numbers, respectively.
Definition 1 The mapping ρ : X × X → R is called a metric on X if for any x, y, z ∈ X,
(1) ρ(x, y) ≥ 0, and ρ(x, y) = 0 if and only if x = y;
(2) ρ(x, y) = ρ(y, x);
(3) ρ(x, y) ≤ ρ(x, z) + ρ(z, y).
The pair (X, ρ) is called a metric space.
For each x ∈ X and r ∈ R+, B(x, r) = {y ∈ X | ρ(x, y) < r} is called an open ball in metric space (X, ρ) with center x and radius r. The collection of all open balls is denoted by B, i.e.
$ \mathit{\boldsymbol{B}} = \left\{ {B\left( {x, r} \right)|x \in X, r \in {\boldsymbol{\rm{R}}^ + }} \right\}. $ |
As we all known,
About nonstandard analysis, let S be an individual set. The superstructure V(S) can be inductively defined as follows:
$ \begin{array}{l} {V_0}\left( S \right) = S, \;\;{V_{n + 1}}\left( S \right) = {V_n}\left( S \right) \cup {\mathscr{P}}\left( {{V_n}\left( S \right)} \right), \;\;n \in \boldsymbol{\rm{N}}, \\ V\left( S \right) = \mathop \cup \limits_{n \in \boldsymbol{\rm{N}}} {V_n}\left( S \right) = {V_0}\left( S \right) \cup {V_1}\left( S \right) \cup {V_2}\left( S \right) \cup \cdots , \end{array} $ |
where
Suppose that X ∪ R ∈ V(S). It can be easily obtained that mathematical objects used in this paper are all in superstructure V(S), such as open sets, topology, metric, functions on X etc. Given that V(*S) is polysaturated nonstandard model of V(S).
Lemma 1 (Saturation principle)[6] V(*S) is polysaturated nonstandard model of V(S) if and only if for every internal family of sets with the finite intersection property has a non-empty intersection.
1 *-TopologyIn this section, a kind of topology called *-topology on Fin(*X) will be constructed, and some properties about it will be discussed.
By transfer principle, mapping *ρ : *X × *X → *R satisfies conditions (1)~(3) in definition 1. Since the value of *ρ is in hyper-real *R, the nonstandard extension (*X, *ρ) is a hyper-metric space.
Definition 2 Let (X, ρ) be a metric space.
(1) A point a ∈ *X is said to be finite in (*X, *ρ) if *ρ(x, a) is finite for some x ∈ X. And Fin(*X) denotes the set of all finite points in (*X, *ρ).
(2) A point a ∈ *X is said to be near-standard in (*X, *ρ) if *ρ(x, a) is infinitesimal for some x ∈ X. And ns(*X) denotes the set of all near-standard points in (*X, *ρ).
Since 0 is infinitesimal and infinitesimal is finite, every standard point is near-standard point and near-standard point is finite point. Thus, X ⊆ ns(*X) ⊆ Fin(*X) ⊆ *X.
Consider the copy
$ \mathscr{B} = \left\{ {^ * B\left( {x, r} \right)|B\left( {x, r} \right) \in \mathit{\boldsymbol{B}}} \right\}; $ |
Since
∪
Definition 3 The topology generated by
Theorem 1 Let (X, ρ) be a metric space. Then
(1) For every internal subset A ⊆ Fin(*X), A is compact in Fin(*X) under
(2) X is dense in Fin(*X) under
Proof (1) Let A ⊆ Fin(*X) be internal and {Gλ ∈
$ \mathop \cap \limits_{i = 1}^n \left( {A - {}^ * B\left( {{x_i},{r_i}} \right)} \right) = A - \mathop \cup \limits_{i = 1}^n {}^ * B\left( {{x_i},{r_i}} \right) = \emptyset , $ |
i.e. A ⊆
(2) Let G be arbitrary non-empty
Definition 4 Let (X, ρ) be a metric space. For each a ∈ *X, the set
$ m\left( a \right) = \cap \left\{ {^ * B\left( {x, r} \right) \in \mathscr{B}|a{ \in ^ * }B\left( {x, r} \right)} \right\} $ |
is called the monad of point a.
A subset A ⊆ *X is said to be saturated if m(a) ⊆ A for all a ∈ A.
It can be easily to see that
(1) m(a) = ∩ {*G | a ∈ *G, G ∈
(2) A is saturated if and only if
$ A = \cup \left\{ {m\left( a \right)|a \in A} \right\}. $ |
Theorem 2 Let (X, ρ) be a metric space. G is saturated for every G ∈
Proof Let G ∈
Define mapping st : ns(*X) → X, for each a ∈ ns(*X), st(a) = x if and only if *ρ(x, a) is infinitesimal.
As we all known, metric space is also Hausdorff space. For metric space (X, ρ), mapping st is well-defined. It is clear that st(a) = x if and only if a ∈ m(x). Generally, for any A ⊆ ns(*X), define
$ st\left[ A \right] = \left\{ {x \in X|st\left( a \right) = x, a \in A} \right\}. $ |
If A = {a}, st({a}) is also denoted as st(a).
Definition 5 Mapping st defined above is called standard part mapping.
Lemma 2[6] Let (X, ρ) be a metric space. For any A ⊂ X, clX (A) = st[*A], where clX (A) is the closure of A in X under
Theorem 3 Standard part mapping st : ns(*X)→ X is continuous with respect to
Proof For each a ∈ ns(*X), let st(a) = x ∈ X, G, H ∈
At last, s-topology
Let (X, ρ) be a metric space. Consider the following copy T of topology
$ \mathit{\boldsymbol{T}} = \left\{ {^ * G|G \in \mathscr{T}} \right\}, $ |
although T is not a topology, it forms a base for a topology on *X since *X ∈ T.
Definition 6 The topology generated by T is called s-topology on *X, and denoted by
Now, three topological spaces have been obtained, (X,
(X,
which relation ≤ is partial order relation between topological subspace.
Theorem 4 Let (X, ρ) be a metric space.
(1) Every internal subset A ⊆ *X is compact under
(2) X is dense in *X under
Proof The proof is similar to theorem 1.
Theorem 5 For every A ⊆ X,
(1) *(clX (A)) = cl*X(*A), where clX and cl*X are the closure operators in (X,
(2) *(intX (A)) = int*X(*A), where intX and int*X are the interior operators in (X,
Proof Only (2) is proved.
$ \begin{array}{l} ^ * \left( {{{{\mathop{\rm int}} }_X}\left( A \right)} \right)\;\; \supseteq \cup \left\{ {^ * G{|^ * }\left( {{{{\mathop{\rm int}} }_X}\left( A \right)} \right){ \supseteq ^ * }G, G \in \mathscr{T}} \right\} = \\ \;\;\;\;\; \cup \left\{ {^ * G|{{{\mathop{\rm int}} }_X}\left( A \right) \supseteq G, G \in \mathscr{T}} \right\} = \\ \;\;\;\;\; \cup \left\{ {^ * G|A \supseteq G, G \in \mathscr{T}} \right\} = \cup \left\{ {^ * G{|^ * }A} \right. \supseteq \\ \;\;\;\;\;\left. {^ * G, G \in \mathscr{T}} \right\} = {{\mathop{\rm int}} _{^ * X}}\left( {^ * A} \right). \end{array} $ |
Conversely, by transfer principle, A ⊇ intX (A) implies *A ⊇ *(intX (A)). Since intX (A) ∈
In the following conclusion, the mapping * will be a functor between two categories
Let (X, ρ) be a metric space. The topologies
(1) The objects of
(2) The homomorphism of
Theorem 6 Let
Proof Step 1 Clearly, for each x ∈ X, *(x)=*x ∈*X.
Step 2 *f is a function on *X for every function f on X. In fact, since f is a function on X, the following sentence holds:
$ \begin{array}{l} | = \left[ {\forall x \in X} \right]\left[ {\exists y \in X} \right]\left[ {\left[ {\left\langle {x, y} \right\rangle \in f} \right]} \right. \wedge \\ \;\;\;\;\;\;\left. {\left[ {\forall z \in X} \right]\left[ {\left[ {\left\langle {x, z} \right\rangle \in f} \right] \to \left[ {z = y} \right]} \right]} \right]. \end{array} $ |
By transfer principle,
$ \begin{array}{l} | = \left[ {\forall x{ \in ^ * }X} \right]\left[ {\exists y{ \in ^ * }X} \right]\left[ {\left[ {\left\langle {x, y} \right\rangle { \in ^ * }f} \right]} \right. \wedge \\ \;\;\;\;\;\;\left. {\left[ {\forall z{ \in ^ * }X} \right]\left[ {\left[ {\left\langle {x, z} \right\rangle { \in ^ * }f} \right] \to \left[ {z = y} \right]} \right]} \right]. \end{array} $ |
That is, *f is a function on *X.
Step 3 Let function f be continuous on (X,
Step 4 For any continuous functions f and g on X, by step 3, *f, *g and *(f о g) are all continuous on *X, since f о g is continuous on X. Then by definition of f о g, the following sentence holds:
$ \begin{array}{l} | = \left[ {\forall x \in X} \right]\left[ {\exists y \in X} \right]\left[ {\left[ {\left\langle {x, y} \right\rangle \in f \circ g} \right]} \right. \leftrightarrow \\ \;\;\;\;\;\;\left. {\left[ {\exists z \in X} \right]\left[ {\left[ {\left\langle {x, z} \right\rangle \in g} \right] \wedge \left[ {\left\langle {z, y} \right\rangle \in f} \right]} \right]} \right]. \end{array} $ |
By transfer principle,
$ \begin{array}{l} | = \left[ {\forall x{ \in ^ * }X} \right]\left[ {\exists y{ \in ^ * }X} \right]\left[ {\left[ {\left\langle {x, y} \right\rangle } \right.} \right. \in \\ \left. {^ * f \circ g} \right] \leftrightarrow \left[ {\exists z{ \in ^ * }X} \right]\left[ {\left[ {\left\langle {x, z} \right\rangle { \in ^ * }g} \right] \wedge } \right.\\ \left. {\left. {\left[ {\left\langle {z, y} \right\rangle { \in ^ * }f} \right]} \right]} \right]. \end{array} $ |
That is, * (f о g) = *f о *g.
Step 5 For identity 1X on X, the following sentence holds:
$ | = \left[ {\forall x \in X} \right]\left[ {\left\langle {x, x} \right\rangle \in {1_X}} \right]. $ |
By transfer principle,
$ | = \left[ {\forall x{ \in ^ * }X} \right]\left[ {\left\langle {x, x} \right\rangle { \in ^ * }\left( {{1_X}} \right)} \right]. $ |
That is, *(1X) = 1*X.
So, mapping * :
[1] | ROBINSON A. Non-standard Analysis[M]. Amsterdam: North-Holland, 1966. |
[2] | DAVIS M. Applied Nonstandard Analysis[M]. New York: Wiley, 1977. |
[3] | CHEN D L. The monad of the uniform structure and its applications[J]. Pure and Applied Mathmetics, 2001, 17(2): 18–23. |
[4] | CHEN D L. On the nonstandard characteristics of Cauchy net and its application[J]. Journal of Xi'an University of Architecture & Technology, 1997, 29(1): 84–87. |
[5] | SAIBANY S, TODOROV T. Nonstandard Analysis in Point-Set Topology[M]. Austria: The Erwin Schrodinger International Institute for Mathematical Physics, 1999. |
[6] | LUXEMBURG W A J. A general theory of monads[J]. Journal of Symbolic Logic, 1971, 36(3): 541–542. |
[7] | JIN R L. Nonstandard analysis and its application[J]. Scientia Sinica (Mathematica), 2016, 46(4): 371–408. |