Category:Combination Theorem for Bounded Real-Valued Functions
Jump to navigation
Jump to search
This category contains pages concerning Combination Theorem for Bounded Real-Valued Functions:
Let $S$ be a set.
Let $\R$ denote the real number line.
Let $f, g :S \to \R$ be bounded real-valued functions.
Let $\lambda \in \R$.
Then the following results hold.
Sum Rule
- $f + g$ is a bounded real-valued function
Negation Rule
- $-f$ is a bounded real-valued function
Difference Rule
- $f - g$ is a bounded real-valued function
Product Rule
- $f g$ is a bounded real-valued function
Multiple Rule
- $\lambda f$ is a bounded real-valued function
Absolute Value Rule
- $\size f$ is a bounded real-valued function
Maximum Rule
- $f \vee g$ is a bounded real-valued function
Minimum Rule
- $f \wedge g$ is a bounded real-valued function
Pages in category "Combination Theorem for Bounded Real-Valued Functions"
The following 17 pages are in this category, out of 17 total.
C
- Combination Theorem for Bounded Real-Valued Functions
- Combination Theorem for Bounded Real-Valued Functions/Absolute Value Rule
- Combination Theorem for Bounded Real-Valued Functions/Difference Rule
- Combination Theorem for Bounded Real-Valued Functions/Maximum Rule
- Combination Theorem for Bounded Real-Valued Functions/Minimum Rule
- Combination Theorem for Bounded Real-Valued Functions/Multiple Rule
- Combination Theorem for Bounded Real-Valued Functions/Negation Rule
- Combination Theorem for Bounded Real-Valued Functions/Product Rule
- Combination Theorem for Bounded Real-Valued Functions/Sum Rule