Combination Theorem for Bounded Continuous Real-Valued Functions/Difference Rule
Jump to navigation
Jump to search
This article needs proofreading. Please check it for mathematical errors. If you believe there are none, please remove {{Proofread}} from the code.To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Proofread}} from the code. |
Theorem
Let $\struct{S, \tau}$ be a topological space.
Let $\R$ denote the real number line.
Let $f, g :S \to \R$ be bounded contiuous real-valued functions.
Let $f - g : S \to \R$ be the pointwise difference of $f$ and $g$, that is, $f - g$ is the mappping defined by:
- $\forall s \in S : \map {\paren{f - g} } s = \map f s - \map g s$
Then:
- $f - g$ is a bounded coninuous real-valued function
Proof
Follows from:
- Difference Rule for Bounded Real-Valued Functions
- Difference Rule for Continuous Real-Valued Functions
$\blacksquare$