Hostname: page-component-84b7d79bbc-lrf7s Total loading time: 0 Render date: 2024-07-27T21:30:04.354Z Has data issue: false hasContentIssue false

A Remark on the Existence of a Denumerable Base for a Family of Functions

Published online by Cambridge University Press:  20 November 2018

Fritz Rothberger*
Affiliation:
University of New Brunswick
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.

A family F of functions is said to have a denumerable base if there exists a sequence of functions {fn(x)} (not necessarily ∈ F) such that any function f ∈ F is the limit of a subsequence of {fn (x)}. The domain X of a function f(x) is the set of x´s for which f(x) is defined ; we say f(x) is a function on X. A dyadic function is a function taking only the values 0 and 1.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1952

References

1. Rothberger, F., On families of real functions with a denumerable base, Ann. Math., vol. 45 (1944), 397406.Google Scholar