Convergence space

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics, a convergence space, also called a generalized convergence, is a set together with a relation called a Template:Em that satisfies certain properties relating elements of X with the family of filters on X. Convergence spaces generalize the notions of convergence that are found in point-set topology, including metric convergence and uniform convergence. Every topological space gives rise to a canonical convergence but there are convergences, known as Template:Em, that do not arise from any topological space.Template:Sfn An example of convergence that is in general non-topological is almost everywhere convergence. Many topological properties have generalizations to convergence spaces.

Besides its ability to describe notions of convergence that topologies are unable to, the category of convergence spaces has an important categorical property that the category of topological spaces lacks. The category of topological spaces is not an exponential category (or equivalently, it is not Cartesian closed) although it is contained in the exponential category of pseudotopological spaces, which is itself a subcategory of the (also exponential) category of convergence spaces.[1]

Definition and notation

Template:See also

Preliminaries and notation

Denote the power set of a set X by ℘(X). The Template:Em or Template:Em in XTemplate:Sfn of a family of subsets ℬ⊆℘(X) is defined as

ℬ↑X:={S⊆X:B⊆S for some B∈ℬ}=⋃B∈ℬ{S:B⊆S⊆X}

and similarly the Template:Em of ℬ is ℬ↓:={S⊆B:B∈ℬ}=⋃B∈ℬ℘(B). If ℬ↑X=ℬ (respectively ℬ↓=ℬ) then ℬ is said to be Template:Em (respectively Template:Em) in X.

For any families 𝒞 and ℱ, declare that

𝒞≤ℱ if and only if for every C∈𝒞, there exists some F∈ℱ such that F⊆C

or equivalently, if ℱ⊆℘(X), then 𝒞≤ℱ if and only if 𝒞⊆ℱ↑X. The relation ≤ defines a preorder on ℘(℘(X)). If ℱ≥𝒞, which by definition means 𝒞≤ℱ, then ℱ is said to be Template:Em 𝒞 and also Template:Em 𝒞, and 𝒞 is said to be Template:Em ℱ. The relation ≥ is called Template:Em. Two families 𝒞 and ℱ are called Template:Em (Template:Em ≥) if 𝒞≤ℱ and ℱ≤𝒞.

A Template:Em is a non-empty subset ℱ⊆℘(X) that is upward closed in X, closed under finite intersections, and does not have the empty set as an element (i.e. ∅∉ℱ). A Template:Em is any family of sets that is equivalent (with respect to subordination) to Template:Em filter or equivalently, it is any family of sets whose upward closure is a filter. A family ℬ is a prefilter, also called a Template:Em, if and only if ∅∉ℬ≠∅ and for any B,C∈ℬ, there exists some A∈ℬ such that A⊆B∩C. A Template:Em is any non-empty family of sets with the finite intersection property; equivalently, it is any non-empty family ℬ that is contained as a subset of some filter (or prefilter), in which case the smallest (with respect to ⊆ or ≤) filter containing ℬ is called Template:Em (Template:Em) Template:Em. The set of all filters (respectively prefilters, filter subbases, ultrafilters) on X will be denoted by Filters⁡(X) (respectively Prefilters⁡(X), FilterSubbases⁡(X), UltraFilters⁡(X)). The Template:Em or Template:Em filter on X at a point x∈X is the filter {x}↑X.

Definition of (pre)convergence spaces

For any ξ⊆X×℘(℘(X)), if ℱ⊆℘(X) then define

lim⁡ξℱ:={x∈X:(x,ℱ)∈ξ}

and if x∈X then define

lim⁡ξ−1(x):={ℱ⊆℘(X):(x,ℱ)∈ξ}

so if (x,ℱ)∈X×℘(℘(X)) then x∈lim⁡ξℱ if and only if (x,ℱ)∈ξ. The set X is called the Template:Em of ξ and is denoted by |ξ|:=X.Template:Sfn

A Template:EmTemplate:Sfn[1][2] on a non-empty set X is a binary relation ξ⊆X×Filters⁡(X) with the following property:

  1. Template:Em: if ℱ,𝒢∈Filters⁡(X) then ℱ≤𝒢 implies lim⁡ξℱ⊆lim⁡ξ𝒢
    • In words, any limit point of ℱ is necessarily a limit point of any finer/subordinate family 𝒢≥ℱ.

and if in addition it also has the following property:

  1. Template:Em: if x∈X then x∈lim⁡ξ({x}↑X)
    • In words, for every x∈X, the principal/discrete ultrafilter at x converges to x.

then the preconvergence ξ is called a Template:EmTemplate:Sfn on X. A Template:Em or a Template:Em (respectively a Template:Em) is a pair consisting of a set X together with a convergence (respectively preconvergence) on X.Template:Sfn

A preconvergence ξ⊆X×Filters⁡(X) can be canonically extended to a relation on X×Prefilters⁡(X), also denoted by ξ, by definingTemplate:Sfn

lim⁡ξℱ:=lim⁡ξ(ℱ↑X)

for all ℱ∈Prefilters⁡(X). This extended preconvergence will be isotone on Prefilters⁡(X), meaning that if ℱ,𝒢∈Prefilters⁡(X) then ℱ≤𝒢 implies lim⁡ξℱ⊆lim⁡ξ𝒢.

Examples

Convergence induced by a topological space

Template:See also

Let (X,τ) be a topological space with X≠∅. If ℱ∈Filters⁡(X) then ℱ is said to Template:Em to a point x∈X in (X,τ), written ℱ→x in (X,τ), if ℱ≥𝒩(x), where 𝒩(x) denotes the neighborhood filter of x in (X,τ). The set of all x∈X such that ℱ→x in (X,τ) is denoted by lim⁡(X,τ)ℱ, lim⁡Xℱ, or simply lim⁡ℱ, and elements of this set are called Template:Em of ℱ in (X,τ). The (Template:Em) Template:Em or Template:Em (X,τ) is the convergence on X, denoted by ξτ, defined for all x∈X and all ℱ∈Filters⁡(X) by:

x∈lim⁡ξτℱ if and only if ℱ→x in (X,τ).

Equivalently, it is defined by lim⁡ξτℱ:=lim⁡(X,τ)ℱ for all ℱ∈Filters⁡(X).

A (pre)convergence that is induced by some topology on X is called a Template:Em; otherwise, it is called a Template:Em.

Power

Let (X,τ) and (Z,σ) be topological spaces and let C:=C((X,τ);(Z,σ)) denote the set of continuous maps f:(X,τ)→(Z,σ). The Template:Em is the coarsest topology θ on C that makes the natural coupling ⟨x,f⟩=f(x) into a continuous map (X,τ)×(C,θ)→(Z,σ).[1] The problem of finding the power has no solution unless (X,τ) is locally compact. However, if searching for a convergence instead of a topology, then there always exists a convergence that solves this problem (even without local compactness).[1] In other words, the category of topological spaces is not an exponential category (i.e. or equivalently, it is not Cartesian closed) although it is contained in the exponential category of pseudotopologies, which is itself a subcategory of the (also exponential) category of convergences.[1]

Other named examples

Standard convergence on ℝ
The Template:Em is the convergence ν on X defined for all x∈X=ℝ and all ℱ∈Filters⁡(X)Template:Sfn by:
x∈lim⁡νℱ if and only if ℱ≥{(x−1n,x+1n):n∈ℕ}.
Discrete convergence
The Template:Em ιX on a non-empty set X is defined for all x∈X and all ℱ∈Filters⁡(X)Template:Sfn by:
x∈lim⁡ιXℱ if and only if ℱ={x}↑X.
A preconvergence ξ on X is a convergence if and only if ξ≤ιX.Template:Sfn
Empty preconvergence
The Template:Em ∅X on set non-empty X is defined for all ℱ∈Filters⁡(X)Template:Sfn by: lim⁡∅Xℱ:=∅.
Although it is a preconvergence on X, it is Template:Em a convergence on X. The empty preconvergence on X≠∅ is a non-topological preconvergence because for every topology τ on X, the neighborhood filter at any given point x∈X necessarily converges to x in (X,τ).
Chaotic convergence
The Template:Em oX on set non-empty X is defined for all ℱ∈Filters⁡(X)Template:Sfn by: lim⁡oXℱ:=X. The chaotic preconvergence on X is equal to the canonical convergence induced by X when X is endowed with the indiscrete topology.

Properties

A preconvergence ξ on set non-empty X is called Template:Em or Template:Math if, for all ℱ∈Filters⁡(X), lim⁡ξℱ is either a singleton set or empty.Template:Sfn It is called Template:Math if lim⁡ξ({x}↑X)⊆{x} for all x∈X and it is called Template:Math if lim−1ξ(x)≠lim−1ξ(y) for all distinct x,y∈X.Template:Sfn Every Template:Math preconvergence on a finite set is Hausdorff.Template:Sfn Every Template:Math convergence on a finite set is discrete.Template:Sfn

While the category of topological spaces is not exponential (i.e. Cartesian closed), it can be extended to an exponential category through the use of a subcategory of convergence spaces.[1]

See also

Citations

Template:Reflist

References

Template:Refbegin

Template:Refend

Template:Topology Template:Areas of mathematics