๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Sequential, pointwise, and uniform continuity: A constructive note

โœ Scribed by Douglas S. Bridges


Book ID
102486519
Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
412 KB
Volume
39
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

โœฆ Synopsis


Abstract

The main result of this paper is a weak constructive version of the uniform continuity theorem for pointwise continuous, realโ€valued functions on a convex subset of a normed linear space. Recursive examples are given to show that the hypotheses of this theorem are necessary. The remainder of the paper discusses conditions which ensure that a sequentially continuous function is continuous. MSC: 03F60, 26E40, 46S30.


๐Ÿ“œ SIMILAR VOLUMES


A note on constructive methods for ramse
โœ F. R. K. Chung ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 227 KB ๐Ÿ‘ 1 views

## Abstract Let __r(k__) denote the least integer __n__โ€such that for any graph __G__ on __n__ vertices either __G__ or its complement G contains a complete graph __K__~k~ on __k__ vertices. in this paper, we prove the following lower bound for the Ramsey number __r(k__) by explicit construction: _

Apartness, Topology, and Uniformity: a C
โœ Douglas Bridges; Peter Schuster; Luminiลฃa Vรฎลฃฤƒ ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 188 KB

The theory of apartness spaces, and their relation to topological spaces (in the point-set case) and uniform spaces (in the set-set case), is sketched. New notions of local decomposability and regularity are investigated, and the latter is used to produce an example of a classically metrisable apart

A note on construction of nearly uniform
โœ Kai-Tai Fang; Hong Qin ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 134 KB

Uniform designs have been used in computer experiments (Fang et al., Technometrics 42 (2000) 237). A uniform design seeks its design points to be uniformly scattered on the experimental domain. When the number of runs is large, to search a related uniform design is a NP hard problem. Therefore, the