Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T20:43:01.083Z Has data issue: false hasContentIssue false

Center Points Of Nets

Published online by Cambridge University Press:  20 November 2018

C. L. Anderson
Affiliation:
The University of Southern Louisiana, Lafayette, Louisiana
W. H. Hyams
Affiliation:
The University of Southern Louisiana, Lafayette, Louisiana
C. K. McKnight
Affiliation:
The University of Southern Louisiana, Lafayette, Louisiana
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Suppose x = (x∝) is a net with values in a metric space X having metric ρ. If a point z in X can be found to minimize

then z is called a center point (c.p.) of x. The space X is (netwise) c.p. complete if every bounded net has at least one c.p.; it is sequentially c.p. complete if every bounded sequence has a c.p. Netwise c.p. completeness implies sequential c.p. completeness, and the latter implies completeness since any c.p. of a Cauchy sequence will necessarily be a limit point of that sequence.

These notions are related to the set centers of Calder et al. [2].

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1975