_{1}

^{*}

The attainability problem with “asymptotic constraints” is considered. Concrete variants of this problem arise in control theory. Namely, we can consider the problem about construction and investigation of attainability domain under perturbation of traditional constraints (boundary and immediate conditions; phase constraints). The natural asymptotic analog of the usual attainability domain is attraction set, for representation of which, the Warga generalized controls can be applied. More exactly, for this, attainability domain in the class of generalized controls is constructed. This approach is similar to methods for optimal control theory (we keep in mind approximate and generalized controls of J. Warga). But, in the case of attainability problem, essential difficulties arise. Namely, here it should be constructed whole set of limits corresponding to different variants of all more precise realization of usual solutions in the sense of constraints validity. Moreover, typically, the above-mentioned control problems are infinite-dimensional. Real possibility for investigation of the arising limit sets is connected with extension of control space. For control problems with geometric constraints on the choice of programmed controls, procedure of this extensions was realized (for extremal problems) by J. Warga. More complicated situation arises in theory of impulse control. It is useful to note that, for investigation of the problem about constraints validity, it is natural to apply asymptotic approach realized in part of perturbation of standard constraints. And what is more, we can essentially generalize self notion of constraints: namely, we can consider arbitrary systems of conditions defined in terms of nonempty families of sets in the space of usual controls. Thus, constraints of asymptotic character arise.

We consider general attainability problem in a topological space (TS). For this, we fix a nonempty set E elements of which play the role of usual solutions (sometimes, it is logical to consider elements of E as controls). Moreover, we fix a TS ( H , t ) and a mapping h : E → H called the goal operator. If e ∈ E , then h ( e ) ∈ H is the concrete result of the choice of e. If a subset E 0 of E is given, then image h 1 ( E 0 ) = { h ( e ) : e ∈ E 0 } of E 0 can be considered as attainable set or analog of attainability domain in control theory (see [

E 0 = ∩ Σ ∈ E Σ (1.1)

(usually, the family E is directed in the following traditional sense

∀ Σ 1 ∈ E ∀ Σ 2 ∈ E ∃ Σ 3 ∈ E : Σ 3 ⊂ Σ 1 ∩ Σ 2 (1.2)

but, now we not discuss this supposition). It is logical to suppose that sets of the family E are “near” to E 0 (we keep in mind Warga approach). For every set Σ ∈ E , we consider the set-image h 1 ( Σ ) and its closure h 1 ( Σ ) ¯ in TS ( H , t ) . Later, we can consider the intersection of all sets h 1 ( Σ ) ¯ , Σ ∈ E instead of h 1 ( E 0 ) ¯ ; in this representation, the validity of (1.2) is essential. The given intersection is interpreted as attraction set (AS). This construction can be considered as natural analog of the Warga approach for extremal problems (see ch. III, IV in [

Indeed, we can investigate the setting for which the family E is primarily (it is supposed that the set E 0 is not given). This family consists of subsets of E; usually it is sufficient to suppose that E is directed (see (1.2)). But, now we not require validity of this condition.

So, let E be a nonempty family of subsets of E. At first, we consider questions connected with the choice of mappings with values in E. In particular, we can consider the choice of sequences in E. But, sometimes, our possibilities are extended in the case when the choice of nets is admissible. Therefore, now we discuss the choice of nets ( x α ) in the set E. We consider such nets as asymptotic regimes. Respectively, in H , nets ( h ( x α ) ) are realized. If, for a net ( x α ) in E, under every Σ ∈ E , the condition x α ∈ Σ is fulfilled starting from a certain index, then we consider ( x α ) as admissible asymptotic regime. The following question arises: for which y ∈ H , an admissible asymptotic regime ( x α ) with the property of convergence of ( h ( x ( α ) ) ) to y can be chosen. Such points y are interpreted as attainable elements of H . We consider the problem about construction of the set of all attainable elements. We call his AS. In addition, under condition (1.2) our new definition of AS is equivalent to previously mentioned definition (see formula (3.3.10) in [

We exploit standard set-theoretical symbolics (quantors, propositional connec- tives; ∅ is empty set). In the following, ≜ is equality by definition; ∃ ! replaces phrase “exists and uniquely”. We take axiom of choice. For every object x, by { x } we denote singleton containing x (so, x ∈ { x } ). The set is called a family in the case when every element of this set is a set also.

If H is a set, then by P ( H ) and P ′ ( H ) we denote the families of all and all nonempty subsets of H respectively; so, P ′ ( H ) = P ( H ) \ { ∅ } . By Fin ( H ) we denote the family of all finite sets of P ′ ( H ) ; so, Fin ( H ) is the family of all nonempty finite subsets of H. If H ∈ P ′ ( P ( H ) ) , then H is a nonempty subfamily of P ( H ) . Then, for a fixed set ℍ and a family H ∈ P ′ ( P ( ℍ ) ) , we introduce the family

C ℍ [ H ] ≜ { ℍ \ H : H ∈ H } ∈ P ′ ( P ( ℍ ) )

dual with respect to H (of course, a topology of ℍ can be used as H ; in this case, the family of closed subsets of ℍ is realized as C ℍ [ H ] ). It is obviously that

C ℍ [ C ℍ [ A ] ] = A ∀ A ∈ P ′ ( P ( ℍ ) )

Now, we consider other operations with families. So, for every nonempty family X and a set Y,

X | Y ≜ { X ∩ Y : X ∈ X } ∈ P ′ ( P ( Y ) )

is trace of X on the set Y. If H is a nonempty family, then we suppose that

( { ∪ } ( H ) ≜ { ∪ H ∈ ℌ H : ℌ ∈ P ( H ) } ) & ( { ∩ } f ( H ) ≜ { ∩ H ∈ K H : K ∈ Fin ( H ) } ) (2.1)

in addition, H ⊂ { ∪ } ( H ) and H ⊂ { ∩ } f ( H ) . Of course, in (2.1), we obtain two nonempty families of subsets of union of all sets of H .

For every sets A and B, by B A we denote the set of all mappings from A into B; of course, under f ∈ B A and a ∈ A , f ( a ) ∈ B is the f-image of the point a. For every sets U and V, a mapping g ∈ V U , and a set W ∈ P ( U ) , by ( g | W ) we denote the contraction of g on the set W ( ( g | W ) ∈ V W and ( g | W ) ( w ) ≜ g ( w ) ∀ w ∈ W ) and g 1 ( W ) ≜ { g ( x ) : x ∈ W } ∈ P ( V ) (the image of W under operation by g).

Special families. In the following, we consider families of subsets of that or different fixed set. Therefore, in this item, we fix a nonempty set I and consider the family P ′ ( P ( I ) ) of all nonempty subfamilies of P ( I ) . Among all such subfamilies, we select p-systems (see p. 14 in monograph [

π [ I ] ≜ { I ∈ P ′ ( P ( I ) ) | ( ∅ ∈ I ) & ( I ∈ I ) & ( A ∩ B ∈ I ∀ A ∈ I ∀ B ∈ I ) } (2.2)

is the family of all such p-systems. Of course, every algebra of subsets of I and every topology on I are p-systems of the family (2.2); therefore, we introduce

( alg ) [ I ] ≜ { L ∈ π [ I ] | I \ L ∈ L ∀ L ∈ L } , ( top ) [ I ] ≜ { τ ∈ π [ I ] | ∪ G ∈ G G ∈ τ ∀ G ∈ P ′ ( τ ) }

Every semialgebra of subsets of I (semiring with “unit”) is a p-system of (2.2) also. In the form of

π ˜ 0 [ I ] ≜ { I ∈ π [ I ] | ∀ L ∈ I ∀ x ∈ I \ L ∃ Λ ∈ I : ( x ∈ Λ ) & ( Λ ∩ L = ∅ ) } (2.3)

we obtain the family of all separable π-systems of (2.2). Particular case of π- system of the family (2.3) is realized for p-systems with singletons:

π ′ 0 [ I ] ≜ { I ∈ π [ I ] | { x } ∈ I ∀ x ∈ I } ∈ P ′ ( π ˜ 0 [ I ] ) (2.4)

(in (2.4), we exploit the obvious property P ( I ) ∈ π ′ 0 [ I ] ). In the form of

( LAT ) 0 [ I ] ≜ { I ∈ π [ I ] | A ∪ B ∈ I ∀ A ∈ I ∀ B ∈ I }

we obtain the family of all lattices with “zero” and “unit”. Of course, ( alg ) [ I ] ⊂ ( LAT ) 0 [ I ] and ( top ) [ I ] ⊂ ( LAT ) 0 [ I ] . We suppose that

β [ I ] ≜ { B ∈ P ′ ( P ( I ) ) | ∀ B 1 ∈ B ∀ B 2 ∈ B ∃ B 3 ∈ B : B 3 ⊂ B 1 ∩ B 2 }

(the family of all nonempty directed subfamilies of P ( I ) ); then, elements of the family

β 0 [ I ] ≜ { B ∈ β [ I ] | ∅ ∉ B } = { B ∈ P ′ ( P ′ ( I ) ) | ∀ B 1 ∈ B ∀ B 2 ∈ B ∃ B 3 ∈ B : B 3 ⊂ B 1 ∩ B 2 }

are filter bases of the set I and only they. Moreover,

F [ I ] ≜ { F ∈ P ′ ( P ′ ( I ) ) | ( A ∩ B ∈ F ∀ A ∈ F ∀ B ∈ F ) & ( ∀ F ∈ F ∀ L ∈ P ( I ) ( F ⊂ L ) ⇒ ( L ∈ F ) ) } (2.5)

is the family of all filters of I (see ch.I in monograph [

F u [ I ] ≜ { U ∈ F [ I ] | ∀ F ∈ F [ I ] ( U ⊂ F ) ⇒ ( U = F ) } (2.6)

are ultrafilters of I and only they. If J ∈ P ′ ( P ( I ) ) , then we suppose that

F u 0 [ I | J ] ≜ { U ∈ F u [ I ] | J ⊂ U } . (2.7)

In addition, the following known (see ch.I in [

( I − f i ) [ B ] ≜ { F ∈ P ( I ) | ∃ B ∈ B : B ⊂ F } ∈ F [ I ]

is the filter of I generated by the base B . Finally, for x ∈ I

( I − ult ) [ x ] ≜ { S ∈ P ( I ) | x ∈ S } ∈ F u [ I ]

so, trivial (fixed) ultrafilters are defined. By ( I − ult ) [ ⋅ ] ≜ ( ( I − ult ) [ x ] ) x ∈ I the natural rule of immersion of I into F u [ I ] is realized. We note that (2.6) is a nonempty set.

Filters and ultrafilters of p-systems. Now, we consider “partial” filters and ultrafilters. For this, in the present item, we fix arbitrary p-system I ∈ π [ I ] . So, ( I , I ) is analog of measurable space. In the following, we call ( I , I ) a meaurable space also; of course, this term is regarded extendedly. We suppose that

( Cen ) [ I ] ≜ { Z ∈ P ′ ( I ) | ∩ Z ∈ K Z ≠ ∅ ∀ K ∈ Fin ( Z ) } (2.8)

Families of (2.8) are nonempty centered subfamilies of I and only they. Introduce “partial” analogs of filters of (2.5); namely, in

F * ( I ) ≜ { F ∈ P ′ ( I \ { ∅ } ) | ( A ∩ B ∈ F ∀ A ∈ F ∀ B ∈ F ) & ( ∀ F ∈ F ∀ L ∈ I ( F ⊂ L ) ⇒ ( L ∈ F ) ) } (2.9)

the set of all I -filters is defined. As a corollary,

F 0 ∗ ( I ) ≜ { U ∈ F * ( I ) | ∀ F ∈ F * ( I ) ( U ⊂ F ) ⇒ ( U = F ) } = { U ∈ F * ( I ) | ∀ L ∈ I ( L ∩ U ≠ ∅ ∀ U ∈ U ) ⇒ ( L ∈ U ) } = { U ∈ ( Cen ) [ C ] | ∀ C ∈ ( Cen ) [ I ] ( U ⊂ C ) ⇒ ( U = C ) } (2.10)

is the set of all I -ultrafilters. In connection with (2.10), we note constructions of [

Φ I ( L ) ≜ { U ∈ F 0 ∗ ( I ) | L ∈ U } = { U ∈ F 0 ∗ ( I ) | L ∩ U ≠ ∅ ∀ U ∈ U } ∀ L ∈ I (2.11)

The sets (2.11) play important role in questions of topological equipment of F 0 ∗ ( I ) ; these questions is considered later. On the other hand,

F 0 ∗ ( I | J ) ≜ { U ∈ F 0 ∗ ( I ) | J ⊂ U } = ∩ L ∈ J Φ I ( L ) ∀ J ∈ P ′ ( I ) (2.12)

in (2.12), we obtain the natural analog of (2.7). Now, we consider analogs of (2.11) for which the condition of I -measurability of set defifning (2.11) can be omitted. Namely, let

F 0 * [ I | A ] ≜ { U ∈ F 0 ∗ ( I ) | A ∩ U ≠ ∅ ∀ U ∈ U } ∀ A ∈ P ( I ) (2.13)

Analogously, as some generalization of (2.12), we exploit the following families:

F 0 * ( I | A ) ≜ { U ∈ F 0 ∗ ( I ) | A ∩ U ≠ ∅ ∀ A ∈ A ∀ U ∈ U } = ∩ A ∈ A F 0 * [ I | A ] ∀ I ∈ P ′ ( P ( I ) ) (2.14)

Of course, Φ I ( L ) = F 0 * [ I | L ] under L ∈ I ; moreover, F 0 ∗ ( I | J ) = F 0 * ( I | J ) under J ∈ P ′ ( I ) . So, (2.13) is natural generalization of (2.11) and (2.14) is analogous generalization of (2.12). If x ∈ I , then

( ( I , I ) − ult ) [ x ] ≜ ( I − ult ) [ x ] ∩ I = { L ∈ I | x ∈ L } ∈ F * ( I )

is considered as trivial I -filter corresponding to point x. We recall (see Section 3 in [

F 0, f * ( I ) ≜ { U ∈ F 0 ∗ ( I ) | ∩ U ∈ U U = ∅ } = F 0 ∗ ( I ) \ F 0, t * ( I ) (2.15)

where F 0, t * ( I ) ≜ { ( ( I , I ) − ult ) [ x ] : x ∈ I } ∈ P ′ ( F * ( I ) ) . In addition (see p.214 in [

( I ∈ π ˜ 0 [ I ] ) ⇔ ( ( ( I , I ) − ult ) [ x ] ∈ F 0 ∗ ( I ) ∀ x ∈ I ) (2.16)

Remark 2.1. We recall that P ( I ) ∈ π [ I ] (and what is more, P ( I ) ∈ ( alg ) [ I ] ) and consider the particular case I = P ( I ) . From (2.5) and (2.9), the equality F [ I ] = F * ( P ( I ) ) follows. As a corollary, by (2.6) and (2.10) F u [ I ] = F 0 * ( P ( I ) ) . Using (2.7) and (2.12), we obtain that F u [ I | J ] = F 0 * ( P ( I ) | J ) = F 0 * ( P ( I ) | J ) ∀ J ∈ P ′ ( P ( I ) ) . Of course, ( I − ult ) [ x ] = ( ( I , P ( I ) ) − ult ) [ x ] under x ∈ I . ,

Example. Let ℝ be real line. In this item, we fix a ∈ ℝ , b ∈ ] a , ∞ [ , and suppose that I = [ a , b ] . Let

ℑ ≜ { L ∈ P ( I ) | ∃ c ∈ I ∃ d ∈ I : ( ] c , d [ ⊂ L ) & ( L ⊂ [ c , d ] ) } (2.17)

The family (2.17) is a semialgebra of subsets of I. In this item, we suppose that I ∈ ( alg ) [ I ] is algebra of subsets of I = [ a , b ] generated by semialgebra ℑ : ℑ ⊂ I and ∀ L ∈ ( alg ) [ I ]

( ℑ ⊂ L ) ⇒ ( I ⊂ L ) .

So, here ( I , I ) is a measurable space with algebra of sets. Then, by statements of [

U t ( − ) ≜ { J ∈ I | ∃ c ∈ [ a , t [ : [ c , t [ ⊂ J } ∈ F 0, f * ( I ) ∀ t ∈ ] a , b ] (2.18)

U t ( + ) ≜ { J ∈ I | ∃ c ∈ ] t , b ] : ] t , c ] ⊂ J } ∈ F 0, f * ( I ) ∀ t ∈ [ a , b [ (2.19)

We note that (see (2.15) and constructions of Section 6 in [

F 0, f * ( I ) = { U t ( − ) : t ∈ ] a , b ] } ∪ { U t ( + ) : t ∈ [ a , b [ } (2.20)

since (in our case) I ∈ π ˜ 0 [ I ] , by (2.16) we obtain that ( ( I , I ) − ult ) [ x ] ∈ F 0 ∗ ( I ) ∀ x ∈ I . Therefore, by (2.15) and (2.20) in our case

F 0 ∗ ( I ) = { U t ( − ) : t ∈ ] a , b ] } ∪ { U t ( + ) : t ∈ [ a , b [ } ∪ F 0, t * ( I ) (2.21)

In (2.21), we obtain exhausting representation of F 0 ∗ ( I ) for considered variant of ( I , I ) .

For every topology τ ∈ ( top ) [ I ] , where I is a nonempty set, we obtain TS ( I , τ ) ; by ( τ − comp ) [ I ] the family of all subsets of I compact in TS ( I , τ ) is denoted. Of course, τ ∈ π [ I ] . And what is more, τ ∈ ( LAT ) 0 [ I ] . In addition, for every point x ∈ I

N τ 0 ( x ) ≜ ( ( I , τ ) − ult ) [ x ] = { G ∈ τ | x ∈ G } ∈ F * ( τ )

and, in particular, N τ 0 ( x ) ∈ β 0 [ I ] ; therefore,

N τ ( x ) ≜ ( I − f i ) [ N τ 0 ( x ) ] ∈ F [ I ]

is the filter of all neighborhoods (see definition of ch.I in monograph [

cl ( A , τ ) ≜ { x ∈ I | A ∩ G ≠ ∅ ∀ G ∈ N τ 0 ( x ) } = { x ∈ I | A ∩ S ≠ ∅ ∀ S ∈ N τ ( x ) } ∈ C I [ τ ]

(the closure of A is introduced); moreover, we sequentially introduce interior and frontier of A:

( τ − Int ) [ A ] ≜ { x ∈ I | A ∈ N τ ( x ) } , ( τ − Fr ) [ A ] ≜ cl ( A , τ ) \ ( τ − Int ) [ A ]

Finally, ( τ − dens ) [ I ] ≜ { H ∈ P ( I ) | cl ( H , τ ) = I } and ( τ − isol ) [ I ] ≜ { x ∈ I | { x } ∈ τ } are the family of all subsets of I every dense (in ( I , τ ) ) and the set of all isolated points of I respectively. In correspondence with definition of ch.I of [

( B ⇒ τ x ) ⇔ def ( N τ ( x ) ⊂ ( I − f i ) [ B ] ) (3.1)

By (3.1) the convergence of filter bases is defined (we note that F [ I ] ⊂ β 0 [ I ] ; moreover, F * ( L ) ⊂ β 0 [ I ] under L ∈ π [ I ] ). We recall that, under J ∈ P ′ ( I ) , topology τ | J = { J ∩ G : G ∈ τ } ∈ ( top ) [ J ] converts J in subspace ( J , τ | J ) of TS ( I , τ ) .

We introduce the families ( can − op ) [ τ ] ≜ { ( τ − Int ) [ F ] : F ∈ C I [ τ ] } and ( can − clos ) [ τ ] ≜ { cl ( G , τ ) : G ∈ τ } of all canonically open and closed sets res-pectively.

If ( X , τ 1 ) , X ≠ ∅ , and ( Y , τ 2 ) , Y ≠ ∅ , are TS, then

C ( X , τ 1 , Y , τ 2 ) ≜ { f ∈ Y X | f − 1 ( G ) ∈ τ 1 ∀ G ∈ τ 2 }

is the set of all continuous mappings from ( X , τ 1 ) into ( Y , τ 2 ) ; recall that, for g ∈ C ( X , τ 1 , Y , τ 2 ) and K ∈ ( τ 1 − comp ) [ X ] , the property g 1 ( K ) ∈ ( τ 2 − comp ) [ Y ] is realized. We note that for every f ∈ Y X and a family X ∈ P ′ ( P ( X ) ) , the (nonempty) family

f 1 [ X ] ≜ { f 1 ( A ) : A ∈ X } ∈ P ′ ( P ( Y ) )

is defined. Moreover, for g ∈ Y X and B ∈ β 0 [ X ] , we obtain that g 1 [ B ] ∈ β 0 [ Y ] .

Now, we consider some topological properties of ultrafilter space for a fixed p-system. So, we fix until end of this section a nonempty set I and a π-system I ∈ π [ I ] . Using (2.11), in the form of

( U F ) [ I ; I ] ≜ { Φ I ( L ) : L ∈ I } ,

we obtain the base of a topology of F 0 ∗ ( I ) . This topology is defined by the rule

T I * [ I ] ≜ { ∪ } ( ( U F ) [ I ; I ] ) = { G ∈ P ( F 0 ∗ ( I ) ) | ∀ U ∈ G ∃ U ∈ U : Φ I ( U ) ⊂ G } (3.2)

In addition, under J ∈ I , the property

Φ I ( J ) ∈ T I * [ I ] ∩ C F 0 ∗ ( I ) [ T I * [ I ] ]

is realized (this is the simple corollary of (2.11)). In the form of

( F 0 ∗ ( I ) , T I * [ I ] ) (3.3)

a zero-dimensional Hausdorff TS is realized.

Remark 3.1. If I ∈ ( alg ) [ I ] , then (3.3) is a compactum (compact Hausdorff TS). In this case, (3.3) is the Stone space. For this case,

( U F ) [ I ; I ] = T I * [ I ] ∩ C F 0 ∗ ( I ) [ T I * [ I ] ] (3.4)

So, we obtain (see (3.4)) the important particular case of (3.2), (3.3). ,

Until end of this section, we suppose that I ∈ π ˜ 0 [ I ] . By (2.16) we obtain the mapping

x ↦ ( ( I , I ) − ult ) [ x ] : I → F 0 * ( I ) (3.5)

denoted as ( ( I , I ) − ult ) [ ⋅ ] . In addition, F 0, t * ( I ) ⊂ F 0 ∗ ( I ) . Now, we recall some statements of [

( ( I , I ) − ult ) [ ⋅ ] 1 ( S ) = { ( ( I , I ) − ult ) [ x ] : x ∈ S } ∈ P ( F 0, t * ( I ) )

we obtain the image of S under operation (3.5). Then (see [

F 0 * [ I | A ] = cl ( ( ( I , I ) − ult ) [ ⋅ ] 1 ( A ) , T I * [ I ] ) ∀ A ∈ P ( I ) (3.6)

As a corollary, Φ I ( L ) = cl ( ( ( I , I ) − ult ) [ ⋅ ] 1 ( L ) , T I * [ I ] ) ∀ L ∈ I . Finally,

F 0 ∗ ( I ) = Φ I ( I ) = cl ( F 0, t * ( I ) , T I * [ I ] ) (3.7)

So, F 0, t * ( I ) ∈ ( T I * [ I ] − dens ) [ F 0 ∗ ( I ) ] . We recall that ( alg ) [ I ] ⊂ π ˜ 0 [ I ] (see (2.3)). Therefore, (3.6) and (3.7) are fulfilled under I ∈ ( alg ) [ I ] .

Returning to Section 1, we preserve the designation E for the space of usual solutions. Families E ∈ P ′ ( P ( E ) ) are considered as constraints of asymptotic character (see Section 1). Moreover, in this section, we fix a TS ( Y , τ ) , Y ≠ ∅ and a mapping f ∈ Y E . We discuss construction of AS in ( Y , τ ) . These AS can be used as basic or as auxiliary. In Section 1, nets in E were used as distinctive “asymptotic solurions”. But, now the analogous employment of filters and ultrafilters is more appropriate. The equivalence of the representations with employment of nets and ultrafilters was noted (in particular) in §3 of [

( a s ) [ E ; Y ; τ ; f ; E ] ≜ { y ∈ Y | ∃ U ∈ F u 0 [ E | E ] : f 1 [ U ] ⇒ τ y } = ∩ Σ ∈ { ∩ } f ( E ) cl ( f 1 ( Σ ) , τ ) ∈ C Y [ τ ] ∀ E ∈ P ′ ( P ( E ) ) (4.1)

We note that the following particular case is useful:

( a s ) [ E ; Y ; τ ; f ; E ] = ∩ Σ ∈ E cl ( f 1 ( Σ ) , τ ) ∀ E ∈ β [ E ] (4.2)

In connection with (4.2), we recall discussion in Section 1 (see (1.2)). We consider the sets (4.1) and (4.2) as AS corresponding to given nonempty family of subsets of E (we recall that, under employment of nets in E, we obtain the equivalent representation of AS; in this connection, see constructions of §3 in [

In this section, we consider some transformations of AS. In addition, we fix a TS ( H , t ) , H ≠ ∅ and h ∈ H E (see Section 1). Under E ∈ P ′ ( P ( E ) ) , we consi- der

( a s ) [ E ; H ; t ; h ; E ] ∈ C H [ t ] (5.1)

as the basic AS. Namely, in the case when E defines constraints of asymptotic character, (5.1) is our goal set. For investigation of the set (5.1) we can exploit auxiliary AS. We note the following general property: if ( Y , τ ) , Y ≠ ∅ is a TS, m ∈ Y E and g ∈ C ( Y , τ , H , t ) , then

( h = g ∘ m ) ⇒ ( g 1 ( ( a s ) [ E ; Y ; τ ; m ; E ] ) ⊂ ( a s ) [ E ; H ; t ; h ; E ] ∀ E ∈ P ′ ( P ( E ) ) ) . (5.2)

This property is established very simply with employment of continuity of the mapping g and (4.1). From relations (2.8.1), (2.8.2), and Proposition 3.3.1 of [

( ( g 1 ( F ) ∈ C H [ t ] ∀ F ∈ C Y [ τ ] ) & ( g − 1 ( { h } ) ∈ ( τ − comp ) [ Y ] ∀ h ∈ H ) & ( h = g ∘ m ) ) ⇒ ( g 1 ( ( a s ) [ E ; Y ; τ ; m ; E ] ) = ( a s ) [ E ; H ; t ; h ; E ] ∀ E ∈ P ′ ( P ( E ) ) ) ; (5.3)

of course, we use (4.1). We recall that the continuous mapping g satisfying to two first conditions in premise of the implication (5.3) is called almost perfect; see Section 3.7 of monograph [

( g 1 ( F ) ∈ C H [ t ] ∀ F ∈ C Y [ τ ] ) & ( g − 1 ( { h } ) ∈ ( τ − comp ) [ Y ] ∀ h ∈ H ) (5.4)

Therefore, the natural compactified case arises. In this connection, in the folowing, we suppose always that

( H , t ) (5.5)

is a Hausdorff TS. The case of such spaces (5.5) is sufficient for majority appli- cations. Then (in our case of TS (5.5)) for every compact TS ( Y , τ ) , Y ≠ ∅ , m ∈ Y E and g ∈ C ( Y , τ , H , t ) , the implication

( h = g ∘ m ) ⇒ ( ( a s ) [ E ; H ; t ; h ; E ] = g 1 ( ( a s ) [ E ; Y ; τ ; m ; E ] ) ∀ E ∈ P ′ ( P ( E ) ) ) (5.6)

In connection with the given important property (5.6), we introduce the special notion of a compactifier. Namely [

( a s ) [ E ; H ; t ; h ; E ] = g 1 ( ( a s ) [ E ; Y ; τ ; m ; E ] ) ∀ E ∈ P ′ ( P ( E ) ) . (5.7)

So, every compactifier realizes the representation of the basic AS as continuous image of auxiliary AS in compact space. In connection with (5.7), we note that (closed) set

H ˜ ≜ cl ( h 1 ( E ) , t ) ∈ C H [ t ] (5.8)

has the following obvious property (see (4.1)):

( a s ) [ E ; H ; t ; h ; E ] ⊂ H ˜ ∀ E ∈ P ′ ( P ( E ) ) ;

moreover, under Σ ∈ P ( E ) , from (5.8), we obtain that

cl ( h 1 ( Σ ) , t ) = cl ( h 1 ( Σ ) , t ˜ ) (5.9)

where (here and later) the designation

t ˜ ≜ t | H ˜ ∈ ( top ) [ H ˜ ] (5.10)

is used. So, by (4.1) and (5.9) we obtain that, for Hausdorff TS

( H ˜ , t ˜ ) (5.11)

(subspace of the initial TS (5.5)), the following equalities

( a s ) [ E ; H ; t ; h ; E ] = ( a s ) [ E ; H ˜ ; t ˜ ; h ; E ] ∀ E ∈ P ′ ( P ( E ) ) (5.12)

are realized; of course, we use the next obvious property: h ∈ H ˜ E (see (5.8)). In connection with (5.12), we suppose that (by (5.10)) the replacement (5.5) ® (5.11) is realized.

Now, we consider the corresponding reduction of compactifiers defined in terms of TS (5.5).

Proposition 5.1. If ( Y , τ , m , g ) is a compactifier, then H ˜ ⊂ g 1 ( Y ) .

Proof. Indeed, we obtain that

H ˜ = cl ( h 1 ( E ) , t ) = cl ( ( g ∘ m ) 1 ( E ) , t ) = cl ( g 1 ( m 1 ( E ) ) , t ) ⊂ cl ( g 1 ( Y ) , t ) = g 1 ( Y )

where (5.4) is used (really, g 1 ( Y ) is a closed set). ,

Proposition 5.2. If ( Y , τ , m , g ) is a compactifier, then

( cl ( m 1 ( E ) , τ ) , τ | cl ( m 1 ( E ) , τ ) , m , ( g | cl ( m 1 ( E ) , τ ) ) )

is compactifier also.

The corresponding proof is given in Section 4 of [

In the following, we call a compactifier ( Y , τ , m , g ) dense in the case when cl ( m 1 ( E ) , τ ) = Y . By Proposition 5.2 we obtain that (as in Proposition 4.1 of [

Proposition 5.3. If ( Y , τ , m , g ) is a dense compactifier, then g is a surjection from Y onto H ˜ .

Proof. Indeed, by (5.4) we obtain that

g 1 ( Y ) = g 1 ( cl ( m 1 ( E ) , τ ) ) = cl ( g 1 ( m 1 ( E ) ) , t ) = cl ( ( g ∘ m ) 1 ( E ) , t ) = cl ( h 1 ( E ) , t ) = H ˜ (5.13)

(in (5.13) we use constructions of [

Corollary 5.1. If ( Y , τ , m , g ) is a dense compactifier for which g is an injective mapping from Y in H , then g is a homeomorphism from TS ( Y , τ ) onto TS (5.11).

Proof. Let all conditions with respect to ( Y , τ , m , g ) are fulfilled. Then, by Proposition 5.3 the mapping g is a bijection from Y onto H ˜ . Moreover, let G ˜ ∈ t ˜ . Using (5.10), we choose G ∈ t for which G ˜ = H ˜ ∩ G . Then

g − 1 ( G ˜ ) = { y ∈ Y | g ( y ) ∈ G ˜ } = { y ∈ Y | g ( y ) ∈ H ˜ ∩ G ˜ } = { y ∈ Y | g ( y ) ∈ G } = g − 1 ( G ) ∈ τ (5.14)

(we recall the obvious property: for y ∈ Y the inclusion g ( y ) ∈ H ˜ is realized; see Proposition 5.3). Since the choice of G ˜ was arbitrary, from (5.14), the property g ∈ C ( Y , τ , H ˜ , t ˜ ) follows. But, ( Y , τ ) is compact and (5.11) is Hausdorff TS. Therefore, g is a homeomorphism from ( Y , τ ) onto (5.11) (indeed, g is a continuous bijection from compact TS onto Hausdorff TS; now, we use Theorem 3.1.13 of monograph [

We recall the known notion: if ( X , τ ) , X ≠ ∅ is a TS, Y is a nonempty set, and f ∈ Y X , then

{ G ∈ P ( Y ) | f − 1 ( G ) ∈ τ } ∈ ( top ) [ Y ] (6.1)

is called quotient topology on Y (this topology was introduced by P. S. Alexandroff and H. Hopf). In supplement to (6.1), we note the obvious property: for every nonempty sets X and Y, a surjection g from X onto Y, and a set B ∈ P ( Y ) , the equality

g 1 ( g − 1 ( B ) ) = B (6.2)

is fulfilled ((6.2) is known property of surjections).

Remark 6.1. Let ( X , τ ) , X ≠ ∅ be TS, Y be a nonempty set, and f ∈ Y X . Moreover, we suppose that θ is topology (6.1). Then,

C Y [ θ ] ≜ { F ∈ P ( Y ) | f − 1 ( F ) ∈ C X [ τ ] }

,

For more brief presentation, we introduce some new designations. So, for every nonempty sets X and Y, by Y ( ∗ ) X we denote the set of all surjections from X onto Y. If ( X , τ 1 ) , X ≠ ∅ and ( Y , τ 2 ) , Y ≠ ∅ are two TS, then

C cl ( X , τ 1 , Y , τ 2 ) ≜ { f ∈ C ( X , τ 1 , Y , τ 2 ) | f 1 ( F ) ∈ C Y [ τ 2 ] ∀ F ∈ C X [ τ 1 ] } (6.3)

C op ( X , τ 1 , Y , τ 2 ) ≜ { f ∈ C ( X , τ 1 , Y , τ 2 ) | f 1 ( G ) ∈ τ 2 ∀ G ∈ τ 1 } (6.4)

In (6.3) and (6.4), closed and open continuous mappings are introduced. In connection with (6.3) and (6.4), we note that (see ch.3 of monograph [

( ( f ∈ C cl ( X , τ 1 , Y , τ 2 ) ) ∨ ( f ∈ C op ( X , τ 1 , Y , τ 2 ) ) ) ⇒ ( τ 2 = { G ∈ P ( Y ) | f − 1 ( G ) ∈ τ 1 } )

As a simple corollary, the following property is realized: if ( X , τ 1 ) , X ≠ ∅ is a compact TS, ( Y , τ 2 ) , Y ≠ ∅ is a Hausdorff TS, and f ∈ C ( X , τ 1 , Y , τ 2 ) ∩ Y ( ∗ ) X , then

τ 2 = { G ∈ P ( Y ) | f − 1 ( G ) ∈ τ 1 } (6.5)

We note that conditions realizing (6.5) correspond to variant used under employment of dense compactifiers (see Proposition 5.3).

Proposition 6.1. If ( Y , τ , m , g ) is a dense compactifier, then

t ˜ = { G ∈ P ( H ˜ ) | g − 1 ( G ) ∈ τ } (6.6)

Proof. From Proposition 5.3 and constructions similar to (5.14), we obtain that

g ∈ C ( Y , τ , H ˜ , t ˜ ) ∩ H ˜ ( ∗ ) Y

where ( Y , τ ) is a compact and ( H ˜ , t ˜ ) is a Hausdorff TS. So, (6) follows from (6.5). ,

We obtain that the closed subspace of ( H , τ ) corresponding to (5.8) is TS with quotient topology with respect to every dense compactifier. We note two obvious (but useful) general statements.

Remark 6.2. Let ( X , τ 1 ) , X ≠ ∅ and ( Y , τ 2 ) , Y ≠ ∅ are TS. Moreover, let

f ∈ C cl ( X , τ 1 , Y , τ 2 ) ∩ Y ( ∗ ) X (6.7)

Then, the equality f 1 [ C X [ τ 1 ] ] = C Y [ τ 2 ] is realized. We consider the brief scheme of the proof.

The inclusion f 1 [ C X [ τ 1 ] ] ⊂ C Y [ τ 2 ] follows from (6.3) and (6.7). Let Φ ∈ C Y [ τ 2 ] . By (6.2) and (6.7) Φ = f 1 ( f − 1 ( Φ ) ) , where f − 1 ( Φ ) ∈ C X [ τ 1 ] . So, Φ ∈ f 1 [ C X [ τ 1 ] ] . Since the choice of Φ was arbitrary, we obtain the inclusion C Y [ τ 2 ] ⊂ f 1 [ C X [ τ 1 ] ] . ,

Remark 6.3. Let ( X , τ 1 ) and ( Y , τ 2 ) correspond to Remark 6.2. Moreover, let

f ∈ C op ( X , τ 1 , Y , τ 2 ) ∩ Y ( ∗ ) X (6.8)

Then, f 1 [ τ 1 ] = τ 2 . Indeed, by (6.4) and (6.8) f 1 [ τ 1 ] ⊂ τ 2 . Let G ∈ τ 2 . Then, by (6.2) and (6.8)

G = f 1 ( f − 1 ( G ) )

where f − 1 ( G ) ∈ τ 1 . Therefore, G ∈ f 1 [ τ 1 ] . The inclusion τ 2 ⊂ f 1 [ τ 1 ] is esta- blished. ,

Proposition 6.2. If ( Y , τ , m , g ) is a dense compactifier, then

g 1 [ C Y [ τ ] ] = C H ˜ [ t ˜ ] (6.9)

Proof. By Proposition 5.3 g ∈ H ˜ ( ∗ ) Y . In addition, similarly to (5.14), we obtain that g ∈ C ( Y , τ , H ˜ , t ˜ ) . Since ( Y , τ ) is compact and ( H ˜ , t ˜ ) is a Hausdorff TS, g ∈ C cl ( Y , τ , H ˜ , t ˜ ) ; see (2.8.2) and (2.8.7) in monograph [

Proposiotion 6.3. If ( Y , τ , m , g ) is a dense compactifier, then

g 1 [ ( τ − comp ) [ Y ] ] = ( t ˜ − comp ) [ H ˜ ] (6.10)

Proof. We recall that g ∈ C ( Y , τ , H ˜ , t ˜ ) (see discussion in connection with (5.14)). Then, g 1 ( K ) ∈ ( t ˜ − comp ) [ H ˜ ] ∀ K ∈ ( τ − comp ) [ Y ] . Therefore,

g 1 [ ( τ − comp ) [ Y ] ] ⊂ ( t ˜ − comp ) [ H ˜ ] (6.11)

Let K ˜ ∈ ( t ˜ − comp ) [ H ˜ ] . Then, K ˜ ∈ C H ˜ [ t ˜ ] (indeed, (5.11) is a Hausdorff TS). By Proposition 6.2 K ˜ ∈ g 1 [ C Y [ τ ] ] , where C Y [ τ ] ⊂ ( τ − comp ) [ Y ] since ( Y , τ ) is a compact TS. Then, K ˜ ∈ g 1 [ ( τ − comp ) [ Y ] ] . So, the inclusion

( t ˜ − comp ) [ H ˜ ] ⊂ g 1 [ ( τ − comp ) [ Y ] ]

is realized. Using (6.11), we obtain (6.10). ,

Remark 6.4. We note some properties connected with Proposition 6.1. Let ( Y , τ , m , g ) be a fixed dense compactifier. Then

t ˜ ⊂ g 1 [ τ ] (6.12)

Indeed, let G ˜ ∈ t ˜ . Since g ∈ H ˜ ( ∗ ) Y by Proposition 5.3, we obtain that G ˜ = g 1 ( g − 1 ( G ˜ ) ) , where g − 1 ( G ˜ ) ∈ τ by continuity of g (see (5.14)). As a result G ˜ ∈ g 1 [ τ ] . Since the choice of G ˜ was arbitrary, the required inclusion (6.12) is realized. The analogous construction realizes the inclusion

t ˜ ∩ C H ˜ [ t ˜ ] ⊂ g 1 [ τ ∩ C Y [ τ ] ] (6.13)

where (6.2) and continuity of g are used. Indeed, for Γ ∈ t ˜ ∩ C H ˜ [ t ˜ ] , we obtain that g − 1 ( Γ ) ∈ τ ∩ C Y [ τ ] (continuity of g is used) and Γ ⊂ g 1 ( g − 1 ( Γ ) ) by (6.2). So, Γ ∈ g 1 [ τ ∩ C Y [ τ ] ] . The inclusion (6.13) is established. ,

In this section, we fix a dense compactifier ( Y , τ , m , g ) . Then

g ∈ C ( Y , τ , H ˜ , t ˜ ) ∩ H ˜ ( ∗ ) Y (7.1)

(we use reasons similar to (5.14)). Now, we consider the natural transforma- tion of ( Y , τ , m , g ) in injective compactifier (see Proposition 5.3). In addition, constructions of [

Y ≜ { g − 1 ( { z } ) : z ∈ H ˜ } = { g − 1 ( { g ( y ) } ) : y ∈ Y } ∈ P ′ ( P ′ ( Y ) ) (7.2)

is a partition of Y; of course, Y (7.2) generates the following equivalence relation º on Y by the rule: ∀ y 1 ∈ Y ∀ y 2 ∈ Y

( y 1 ≡ y 2 ) ⇔ def ( g ( y 1 ) = g ( y 2 ) ) (7.3)

In addition, { y ˜ ∈ Y | y ≡ y ˜ } = g − 1 ( { g ( y ) } ) ∈ P ′ ( Y ) ∀ y ∈ Y . We note that ∀ Y ∈ Y ∃ ! h ∈ H ˜ : g ( y ) = h ∀ y ∈ Y . Therefore, we introduce the mapping σ ∈ H ˜ Y by the next rule:

σ ( Y ) ≜ g ( y ) ∀ Y ∈ Y ∀ y ∈ Y (7.4)

From (7.1) and (7.4), we obtain that σ ∈ H ˜ ( ∗ ) Y . And what is more, σ is a bijection from Y onto H ˜ .

Now, we obtain that p ≜ ( g − 1 ( { g ( y ) } ) ) y ∈ Y ∈ Y ( ∗ ) Y . So, the canonical projection from Y onto the corresponding factor-space is defined. In addition,

g = σ ∘ p (7.5)

(the canonical expansion of g). Indeed, let y * ∈ Y and D * ≜ g − 1 ( { g ( y * ) } ) . In addition, p ( y * ) = g − 1 ( { g ( y * ) } ) = D * ∈ Y ;

( σ ∘ p ) ( y * ) = σ ( p ( y * ) ) = σ ( D * ) (7.6)

Since y * ∈ D * , by (7.4) we obtain that σ ( D * ) = g ( y * ) . So, by (7.6) ( σ ∘ p ) ( y * ) = g ( y * ) . Since the choice of y * was arbitrary, the property

( σ ∘ p ) ( y ) = g ( y ) ∀ y ∈ Y

is realized. As a result, we obtain (7.5).

Following constructions of Section 2.4 of monograph [

T ≜ { G ∈ P ( Y ) | p − 1 ( G ) ∈ τ } ∈ ( top ) [ Y ] (7.7)

So, we obtain TS ( Y , T ) for which

p ∈ C ( Y , τ , Y , T ) (7.8)

Since p 1 ( Y ) = Y , the following property is realized: ( Y , T ) is a compact TS (we apply the continuity of p realized in (7.8) and compactness of ( Y , τ ) ).

Now, we note that (by the choice of ( Y , τ , m , g ) ) p ∘ m ∈ Y E and

σ ∘ ( p ∘ m ) = σ ∘ p ∘ m = ( σ ∘ p ) ∘ m = g ∘ m = h (7.9)

Finally, σ ∈ C ( Y , T , H ˜ , t ˜ ) . Indeed, let G ∈ t ˜ . By (7.1) we obtain that g − 1 ( G ) ∈ τ . By (7.5)

g − 1 ( G ) = ( σ ∘ p ) − 1 ( G ) = p − 1 ( σ − 1 ( G ) )

where σ − 1 ( G ) ∈ P ( Y ) . Since p − 1 ( σ − 1 ( G ) ) ∈ τ , by (7.7) σ − 1 ( G ) ∈ T . Since the choice of G was arbitrary also, the required continuity property is established. As a result,

σ ∈ C ( Y , T , H ˜ , t ˜ ) ∩ H ˜ ( ∗ ) Y (7.10)

In particular, ( Y , T , p ∘ m , σ ) is a compactifier (indeed, by (7.10) the obvious property σ ∈ C ( Y , T , H , t ) follows). And what is more, σ is a continuous bijection from Y onto H ˜ . Since ( Y , T ) is a compact space and ( H ˜ , t ˜ ) is a Hausdorff space, the mapping σ is a homeomorphism from ( Y , T ) onto ( H ˜ , t ˜ ) . Then, ( Y , T , p ∘ m , σ ) is an injective compactifier. We note the density property of this compactifier.

Indeed, by the choice of ( Y , τ , m , g ) the equality Y = cl ( m 1 ( E ) , τ ) . Then, by (7.8)

Y = p 1 ( Y ) = p 1 ( cl ( m 1 ( E ) , τ ) ) ⊂ cl ( p 1 ( m 1 ( E ) ) , T ) ⊂ Y

So, cl ( ( p ∘ m ) 1 ( E ) , T ) = Y . We obtain that ( Y , T , p ∘ m , σ ) is an injective dense compactifier.

In addition, ( Y , T ) is a Hausdorff TS. Of course, this property follows from homeomorphism of σ and separability of ( H ˜ , t ˜ ) . So, ( Y , T ) is compactum. Moreover, H ˜ = σ 1 ( Y ) and, as a corollary, TS ( H ˜ , t ˜ ) is a compactum also.

Remark 7.1. We note the last property. Indeed, if (5.5) is a Hausdorff TS for which a compactifier exists, then (5.11) is a compactum. Now, we consider the scheme of the corresponding proof.

So, as previously, we consider Hausdorff space (5.5). Therefore, (5.11) is a Hausdorff space also. We consider the case when some compactifier ( K , τ ˜ , μ , ν ) exists. By Proposition 5.2 we obtain that

( cl ( μ 1 ( E ) , τ ˜ ) , τ ˜ | cl ( μ 1 ( E ) , τ ˜ ) , μ , ( ν | cl ( μ 1 ( E ) , τ ˜ ) ) ) (7.11)

is a dense compactifier. Now, we suppose that

Y ≜ cl ( μ 1 ( E ) , τ ˜ ) , τ ≜ τ ˜ | cl ( μ 1 ( E ) , τ ˜ ) = τ ˜ | Y , m ≜ μ , g ≜ ( ν | cl ( μ 1 ( E ) , τ ˜ ) ) = ( ν | Y ) (7.12)

By (7.12) we rename compactifier (7.11). So, ( Y , τ , m , g ) is our dense com- pactifier. Later, we apply procedure of the present section; as a result, we obtain that ( H ˜ , t ˜ ) is a compactum.

Now, we consider a special variant of general construction of Sections 5-7. But, at first, we introduce some new notions (see [

F lim [ E ; L ; H ; t ] ≜ { f ∈ H E | ∀ U ∈ F 0 * ( L ) ∃ h ∈ H : f 1 [ U ] ⇒ t h } = { f ∈ H E | ∀ U ∈ F 0 * ( L ) ∃ ! h ∈ H : f 1 [ U ] ⇒ t h } ∈ P ′ ( H E ) (8.1)

(we apply separability of TS (5.5); all mappings-constants with values in H (and defined on E ) are elements of the set (8.1)). From (8.1), the next definition follows; namely, if f ∈ F lim [ E ; L ; H ; t ] , then

φ lim [ f ] : F 0 * ( L ) → H (8.2)

is defined by the following condition: under U ∈ F 0 * ( L ) , the point φ lim [ f ] ( U ) ∈ H has the property

f 1 [ U ] ⇒ t φ lim [ f ] ( U ) (8.3)

This corresponds to similar definition of §5 in [

φ lim [ f ] 1 ( S ) = { h ∈ H | ∃ U ∈ S : f 1 [ U ] ⇒ t h } ∀ f ∈ F lim [ E ; L ; H ; t ] ∀ S ∈ P ( F 0 * ( L ) ) (8.4)

In connection with (4), we note statements in formula (5.4) of [

φ lim [ f ] 1 ( F 0 * ( L | E ) ) ⊂ ( a s ) [ E ; H ; t ; f ; E ] ∀ f ∈ F lim [ E ; L ; H ; t ] ∀ E ∈ P ′ ( L ) (8.5)

So, in (8.5), we obtain analog of (5.2). We recall that TS ( X , τ ) is called a regular space (regular TS) in the case when ( X , τ ) is T 1 -space for which closed (in ( X , τ ) ) neighborhoods of every point x ∈ X realize in totality a local base of ( X , τ ) for this point x. In this connection, we recall Formula (5.5) of [

φ lim [ f ] ∈ C ( F 0 * ( L ) , T L * [ E ] , H , t ) ∀ f ∈ F lim [ E ; L ; H ; t ] (8.6)

Until end of this section, we suppose that ( H , t ) is a regular TS and L ∈ π ˜ 0 [ E ] . Moreover, now, we suppose that

h ∈ F lim [ E ; L ; H ; t ] (8.7)

Then, φ lim [ h ] ∈ H F 0 * ( L ) , and we obtain the natural concrete variant of (8.3)-(8.5); in addition, for ( ( E , L ) − ult ) [ ⋅ ] ≜ ( ( E , L ) − ult ) [ x ] x ∈ E ∈ F 0 * ( L ) E

h = φ lim [ h ] ∘ ( ( E , L ) − ult ) [ ⋅ ] (8.8)

As an addition to (8.5), we note (see (8.6)) the property noted in Proposition 4 of [

φ lim [ f ] 1 ( F 0 * ( L | E ) ) ⊂ ( a s ) [ E ; H ; t ; h ; E ] ∀ E ∈ β [ E ] (8.9)

(we exploit (4.2), (5.2), (8.6), and (8.7)). As a corollary, from (8.9), we obtain that

φ lim [ f ] 1 ( F 0 * ( L | { ∩ } f ( E ) ) ) ⊂ ( a s ) [ E ; H ; t ; h ; E ] ∀ E ∈ P ′ ( P ( E ) ) (8.10)

(we apply (4.1) and (4.2); indeed, under S ∈ P ′ ( P ( E ) ) , the property { ∩ } f ( E ) ∈ β [ E ] follows). It is useful to apply Remark 3 of [

In connection with (5.2), (8.7), and (8.10), we recall Proposition 3 of [

( a s ) [ E ; F 0 * ( L ) ; T L * [ E ] ; ( ( E , L ) − ult ) [ ⋅ ] ; B ] = F 0 * ( L | B ) ∀ B ∈ β [ E ] (8.11)

Attraction sets and compactifiers. We recall that the case of regular space ( H , t ) and L ∈ π ˜ 0 [ E ] is considered (in this case TS ( H ˜ , t ˜ ) (5.11) is regular also). Moreover, in our case (8.7) is fulfilled. Finally, we suppose until end of this section that TS

( F 0 * ( L ) ; T L * [ E ] ) (8.12)

is compact. Then TS (8.12) is a zero-dimensional compactum. Therefore, from (3.7), (8.6), and (8.10), we obtain that

( F 0 * ( L ) , T L * [ E ] , ( ( E , L ) − ult ) [ ⋅ ] , φ lim [ h ] ) (8.13)

is a dense compactifier. As a corollary, by (5.7) and (8.11)

( a s ) [ E ; H ; t ; h ; E ] = ( a s ) [ E ; H ; t ; h ; { ∩ } f ( E ) ] = φ lim [ h ] 1 ( F 0 * ( L | { ∩ } f ( E ) ) ) ∀ E ∈ P ′ ( P ( E ) ) (8.14)

In connection with (8.14), we note the following important particular case:

( a s ) [ E ; H ; t ; h ; B ] = φ lim [ h ] 1 ( F 0 * ( L | B ) ) ∀ B ∈ β [ E ] (8.15)

Of course, (8.15) is sufficient for majority of applications. From (8.4), (8.7), and (8.15), we obtain that

( a s ) [ E ; H ; t ; h ; B ] = { z ∈ H | ∃ U ∈ F 0 * ( L | B ) : h 1 [ U ] ⇒ t z } ∀ B ∈ β [ E ] (8.16)

It is useful to note that by (8.15) and (8.16) (in our case) ultrafilters from F 0 * ( L | B ) , where B ∈ β [ E ] , can be considered as analogs both generalized and approximate solutions of J. Warga (see constructions of ch.III of [

Remark 8.1. The compactness property of TS (8.12) is very important (see (8.14)-(8.16)). Now, we note only Remark 3.1 (of course, more general cases are known: see §6 in [

1) Let ( H ˜ , t ˜ ) (5.11) be a compactum (in this connection, we note Remark 7.1). In addition, by (5.8) h ∈ H ˜ E . We strive to obtain conditions sufficient for (8.7). For this, we apply the construction of §5 in [

( h − bas ) [ t ˜ ] ≜ { S ∈ P ( N t ˜ ( h ) ) | ∀ A ∈ N t ˜ ( h ) ∃ B ∈ S : B ⊂ A }

of all local bases of TS ( H ˜ , t ˜ ) at the point h. In this item, we suppose that

∀ h ∈ H ˜ ∃ H ˜ ∈ ( h − bas ) [ t ˜ ] : h − 1 ( H ) ∈ L ∀ H ∈ H ˜ (8.17)

So, (8.17) is a condition of the “local measurability” of h . We recall about compactness of TS (5.11). Then, by Corollary 5.1 of [

∀ U ∈ F 0 * ( L ) ∃ ! h ∈ H ˜ : h 1 [ U ] ⇒ t ˜ h (8.18)

Let U ∈ F 0 * ( L ) and h ˜ ∈ H ˜ be a point such that (see (8.18))

h 1 [ U ] ⇒ t ˜ h ˜ (8.19)

In addition, h 1 [ U ] ∈ β 0 [ H ˜ ] . By (3.1) and (8.19)

N t ˜ ( h ˜ ) ⊂ ( H ˜ − f i ) [ h 1 [ U ] ] (8.20)

We recall that (see Formula (2.3.8) of [

N t ˜ ( h ˜ ) = N t ( h ˜ ) | H ˜ = { S ∩ H ˜ : S ∈ N t ( h ˜ ) } (8.21)

We recall that

( H ˜ − f i ) [ h 1 [ U ] ] = { T ∈ P ( H ˜ ) | ∃ B ∈ h 1 [ U ] : B ⊂ T } ⊂ { T ∈ P ( H ) | ∃ B ∈ h 1 [ U ] : B ⊂ T } (8.22)

In addition, by the choice of h we obtain that h 1 [ U ] ∈ β 0 [ H ] . So, the filter

( H − f i ) [ h 1 [ U ] ] = { T ∈ P ( H ) | ∃ B ∈ h 1 [ U ] : B ⊂ T } ∈ F [ H ]

is defined; by (8.22) the inclusion

( H ˜ − f i ) [ h 1 [ U ] ] ⊂ ( H − f i ) [ h 1 [ U ] ] (8.23)

follows. By (8.20) and (8.23) the next inclusion

N t ˜ ( h ˜ ) ⊂ ( H − f i ) [ h 1 [ U ] ] (8.24)

is realized. Now , we exploit (2.5) and (8.21). Indeed, let S ∈ N t ( h ˜ ) . Then, by (8.21) S ∩ H ˜ ∈ N t ˜ ( h ˜ ) . By (8.24) the inclusion S ∩ H ˜ ∈ ( H − f i ) [ h 1 [ U ] ] follows, where S ∩ H ˜ ⊂ S . Since S ∈ P ( H ) , by (2.5) S ∈ ( H − f i ) [ h 1 [ U ] ] . So, we obtain that N t ( h ˜ ) ⊂ ( H − f i ) [ h 1 [ U ] ] . As a corollary,

h 1 [ U ] ⇒ t h ˜

where h ˜ ∈ H ˜ . In particular, h ˜ ∈ H . Since the choice of U was arbitrary, it is established that

∀ U ∈ F 0 * ( L ) ∃ h ∈ H : h 1 [ U ] ⇒ t h

From (8.1), we obtain that, in our case, (8.7) is fulfilled. So, (8.17) and compactness of TS (5.11) are sufficient for (8.7).

2) Now, we consider the variant connected with application of uniform limits of real-valued step-functions (the more general construction is given in [

h ( ⋅ ) ( γ ) ≜ ( h ( x ) ( γ ) ) x ∈ E ∈ ℝ E ∀ γ ∈ Γ (8.25)

In (8.25), we obtain real-valued components of h . We recall that E is equipped with L ∈ π [ E ] . Now, we suppose that L is a semialgebra of subsets of E (of course, the variant of an algebra of subsets of E is possible also). Under Σ ∈ P ( E ) , by χ Σ we denote indicator of the set Σ : χ Σ ∈ ℝ E , χ Σ ( x ) ≜ 0 under x ∈ E \ Σ , and χ Σ ( y ) ≜ 1 under y ∈ Σ . By B 0 ( E , L ) we denote the linear span of the set { χ L : L ∈ L } (we apply the pointwise linear operations in ℝ E ) obtaining a subset of the set B ( E ) of all bounded real-valued functions on E. We equip the linear space B ( E ) with traditional sup-norm ‖ ⋅ ‖ (see ch.IV, Section 2, item 13 of [

Suppose that h ( ⋅ ) ( γ ) ∈ B ( E , L ) ∀ γ ∈ Γ . Now, we define a variant of topology t . Namely, we suppose that t = ⊗ Γ ( τ ℝ ) is the natural topology of the Tychonoff power of ℝ with usual | ⋅ | -topology τ ℝ for the case when Γ is the indexed set. So, we consider the Tichonoff product of samples ( ℝ , τ ℝ ) under indexed set Γ . Using Proposition 6.3 of [

So, under some natural conditions, the property (8.7) is realized.

In this section, we fix L ∈ π [ E ] and consider the set F 0 * ( L ) (see Section 2). In this construction, we follow to [

Proposition 9.1. If L 1 ∈ L and L 2 ∈ L , then

( L 1 ⊂ L 2 ) ⇒ ( Φ L ( L 1 ) ⊂ Φ L ( L 2 ) )

in addition, if L ∈ π ˜ 0 [ E ] , then ∀ Λ 1 ∈ L ∀ Λ 2 ∈ L

( Φ L ( Λ 1 ) ⊂ Φ L ( Λ 2 ) ) ⇒ ( Λ 1 ⊂ Λ 2 )

The corresponding proof is given in §4 of article [

( L 1 ⊂ L 2 ) ⇔ ( Φ L ( L 1 ) ⊂ Φ L ( L 2 ) ) (9.1)

As a corollary, in our case, the mapping

L ↦ Φ L ( L ) : L → ( U F ) [ E ; L ]

is a bijection from L onto ( U F ) [ E ; L ] .

We fix E ∈ P ′ ( L ) until end of this section (we apply E as the family defining constraints of asymptotic character; in particular, E ∈ P ′ ( P ( E ) ) . In this and next sections, it is supposed that

Σ 0 ≜ ∩ Σ ∈ E Σ ∈ L (9.2)

(in §6 of [

∩ Σ ∈ E Σ = ∅

the last case is considered in [

Φ L ( Σ 0 ) = { U ∈ F 0 * ( L ) | Σ 0 ∈ U } = { U ∈ F 0 * ( L ) | Σ 0 ∩ U ≠ ∅ ∀ U ∈ U } ∈ T L * [ E ] ∩ C F 0 * ( L ) [ T L * [ E ] ] (9.3)

is defined. We recall that F 0 * ( L | E ) coincides with intersection of all sets Φ L ( Σ ) , Σ ∈ E . In Theorem 6.1 of [

( T L * [ E ] − Int ) [ F 0 * ( L | E ) ] = Φ L ( Σ 0 ) (9.4)

In particular, from (9.3) and (9.4), the following property follows: the interior of F 0 * ( L | E ) is an open-closed set.

Remark 9.1. Recall (8.11). Then, under E ∈ β [ E ] (for which E ⊂ L and (9.2) is fulfilled), we obtain that

( a s ) [ E ; F 0 * ( L ) ; T L * [ E ] ; ( ( E , L ) − ult ) [ ⋅ ] ; E ] = F 0 * ( L | E ) (9.5)

So, in this case, by (9.4) the interior of auxiliary AS is defined (see definitions of Section 2). Since F 0 * ( L | E ) ∈ C F 0 * ( L ) [ T L * [ E ] ] , we obtain that

( T L * [ E ] − Fr ) [ F 0 * ( L | E ) ] = F 0 * ( L | E ) \ Φ L ( Σ 0 ) (9.6)

(the frontier of the set (9.5) is realized). By (9.6) the next inclusion is realized

F 0 * ( L | E ) \ Φ L ( Σ 0 ) ⊂ cl ( F 0 * ( L ) \ F 0 * ( L | E ) , T L * [ E ] )

Now, we consider questions connected with approximate realization of ultrafilters of F 0 * ( L | E ) \ Φ L ( Σ 0 ) . So, we consider questions connected with approximate realizability of elements of (9.6). Then

( T L * [ E ] − Fr ) [ F 0 * ( L | E ) ] = F 0 * ( L | E ) \ cl ( ( ( E , L ) − ult ) [ ⋅ ] 1 ( Σ 0 ) , T L * [ E ] ) (9.7)

So, ultrafilters of the frontier of F 0 * ( L | E ) are not realizable “outwards”. In addition, by (3.6) we obtain that

cl ( ( ( E , L ) − ult ) [ ⋅ ] 1 ( E \ Σ 0 ) , T L * [ E ] ) = F 0 * [ L | E \ Σ 0 ] (9.8)

Moreover, by (9.6) we obtain the following

Proposition 9.1. The following inclusion takes place:

( T L * [ E ] − Fr ) [ F 0 * ( L | E ) ] ⊂ F 0 * [ L | E \ Σ 0 ] (9.9)

Proof. By (3.6), (3.7), and additivity of the closure we obtain that

F 0 * ( L ) = cl ( F 0, t * ( L ) , T L * [ E ] ) = cl ( ( ( E , L ) − ult ) [ ⋅ ] 1 ( E ) , T L * [ E ] ) = cl ( ( ( E , L ) − ult ) [ ⋅ ] 1 ( Σ 0 ∪ ( E \ Σ 0 ) ) , T L * [ E ] ) = cl ( ( ( E , L ) − ult ) [ ⋅ ] 1 ( Σ 0 ) ∪ ( ( E , L ) − ult ) [ ⋅ ] 1 ( E \ Σ 0 ) , T L * [ E ] ) = cl ( ( ( E , L ) − ult ) [ ⋅ ] 1 ( Σ 0 ) , T L * [ E ] ) ∪ cl ( ( ( E , L ) − ult ) [ ⋅ ] 1 ( E \ Σ 0 ) , T L * [ E ] ) = Φ L ( Σ 0 ) ∪ F 0 * [ L | E \ Σ 0 ]

Since F 0 * ( L | E ) ⊂ F 0 * ( L ) , by (9.6) we obtain the required inclusion (9.9). ,

Corollary 9.1. The next inclusion is realized:

( T L * [ E ] − Fr ) [ F 0 * ( L | E ) ] ⊂ cl ( ( ( E , L ) − ult ) [ ⋅ ] 1 ( E \ Σ 0 ) , T L * [ E ] ) \ cl ( ( ( E , L ) − ult ) [ ⋅ ] 1 ( Σ 0 ) , T L * [ E ] )

The corresponding proof is reduced to immediate combination of (9.7), (9.8), and Proposition 9.1. So, ultrafilters of the frontier of F 0 * ( L | E ) assume approximate realization only by points of the set E \ Σ 0 .

We recall that by (9.2) and (9.4)

( T L * [ E ] − Int ) [ F 0 * ( L | E ) ] ∈ T L * [ E ] ∩ C F 0 * ( L ) [ T L * [ E ] ] (9.10)

Remark 9.2. If ( T L * [ E ] − Fr ) [ F 0 * ( L | E ) ] ≠ ∅ , then

F 0 * ( L | E ) ∈ C F 0 * ( L ) [ T L * [ E ] ] \ ( can − clos ) [ T L * [ E ] ]

Indeed, let ( T L * [ E ] − Fr ) [ F 0 * ( L | E ) ] ≠ ∅ . By (9.10)

cl ( ( T L * [ E ] − Int ) [ F 0 * ( L | E ) ] , T L * [ E ] ) = ( T L * [ E ] − Int ) [ F 0 * ( L | E ) ] (9.11)

Using (9.4) and (9.6), we obtain (under our condition) that

F 0 * ( L | E ) ≠ cl [ ( T L * [ E ] − Int ) [ F 0 * ( L | E ) ] , T L * [ E ] ]

So, F 0 * ( L | E ) ∉ ( can − clos ) [ T L * [ E ] ] . ,

We follow to constructions of Section 4 of article [

Φ L ( { x } ) = { ( ( E , L ) − ult ) [ x ] }

As a corollary, we obtain the following equality

( T L * [ E ] − isol ) [ F 0 * ( L ) ] = F 0, t * ( L ) (10.1)

therefore (see Section 3) we obtain that

( T L * [ E ] − isol ) [ F 0 * ( L ) ] ∈ ( T L * [ E ] − dens ) [ F 0 * ( L ) ] (10.2)

So, in our case, TS of type (3.3) has everywhere dense subset consisting from isolated points. These points are trivial ultrafilters.

From (10.1) and (10.2), we obtain ( under L ∈ π ′ 0 [ E ] ) that

( ( E , L ) − ult ) [ ⋅ ] 1 ( A ) = { ( ( E , L ) − ult ) [ x ] : x ∈ A } ∈ T L * [ E ] ∀ A ∈ P ( E ) (10.3)

From (3.6) and (10.3), the following important property (see p. 222 in [

F 0 * [ L | A ] ∈ ( can − clos ) [ T L * [ E ] ] ∀ A ∈ P ( E ) (10.4)

Until end of this section, we fix a family E ∈ P ′ ( L ) .

Proposition 10.1. Let (9.2) holds and F 0 * ( L | E ) \ Φ L ( Σ 0 ) ≠ ∅ . Then

F 0 * ( L | E ) ≠ F 0 * [ L | A ] ∀ A ∈ P ( E )

Proof. By (9.6) we have that ( T L * [ E ] − Fr ) [ F 0 * ( L | E ) ] ≠ ∅ . Then, from Remark 9.2, we obtain the property

F 0 * ( L | E ) ∉ ( can − clos ) [ T L * [ E ] ]

By (10.4) we obtain the required statement. ,

As a corollary, the following property is realized: if the conditions of Proposition 10.1 are fulfilled, then by (3.6)

F 0 * ( L | E ) ≠ cl ( ( ( E , L ) − ult ) [ ⋅ ] 1 ( A ) , T L * [ E ] ) ∀ A ∈ P ( E ) (10.5)

Now, we discuss (10.5). The expression on the right-hand side of (10.5) corresponds to “standard” realization of generalized elements. Namely, we have some set A , A ⊂ E of usual solutions. These solutions are transformed in generalized elements (here, in ultrafilters). The obtained set of ultrafilters is transformed to a closure (we obtain F 0 * [ L | A ] ). By (10.5) and Proposition 10.1 we no obtain F 0 * ( L | E ) under every A , A ⊂ E (of course, we keep in mind that (9.2) and conditions of Proposition 10.1 are fulfilled and the sets-closures on the right-hand side of (10.5) are used). So, auxiliary AS (see (8.11) and Section 2) one cannot to obtain by closure of some subset of the initial set E.

This work was supported by Russian Foundation for Basic Research (project no.15-01-07909).

Chentsov, A.G. (2017) Constraints of Asymptotic Character and Attainability Problems. Intelligent Information Management, 9, 206-228. https://doi.org/10.4236/iim.2017.95011