Bounds of Functions
The definitions can be generalised to sets of functions.
Given a set S of functions with domain F and a partially ordered set as codomain, a function g with domain is an upper bound of S if for each function f in S and for each x in F. In particular, g is said to be an upper bound of f when S consists of only one function f (i.e. S is a singleton). This does not imply that f is a lower bound of g.
Read more about this topic: Upper And Lower Bounds
Famous quotes containing the words bounds of, bounds and/or functions:
“At bounds of boundless void.”
—Samuel Beckett (1906–1989)
“What comes over a man, is it soul or mind
That to no limits and bounds he can stay confined?
You would say his ambition was to extend the reach
Clear to the Arctic of every living kind.
Why is his nature forever so hard to teach
That though there is no fixed line between wrong and right,
There are roughly zones whose laws must be obeyed?”
—Robert Frost (1874–1963)
“Let us stop being afraid. Of our own thoughts, our own minds. Of madness, our own or others’. Stop being afraid of the mind itself, its astonishing functions and fandangos, its complications and simplifications, the wonderful operation of its machinery—more wonderful because it is not machinery at all or predictable.”
—Kate Millett (b. 1934)