TheoremBase

One Modulus and a Sum Bound for a Finite Family

Finitely many maps continuous at a point admit a single modulus: one δ\delta works for all of them. A finite sum of terms each at most tt is at most σnt\sigma_n t, where σn\sigma_n is the sum of nn ones.

Statement

We work in the setting of Euclidean Space and Real Matrices: Standing Notation, whose notation is in force in every dimension; of it we use only the real numbers with their order and the associated strict order, the natural numbers N\mathbb{N} with successor map SS, the initial segments [n][n], and Euclidean space Rn\mathbb{R}^{n}, of which only its elements as nn-tuples of real numbers are used, and no matrix notation at all.

Let (X,d)(X,d) and (Y,dY)(Y,d_{Y}) be metric spaces, let A⊆XA\subseteq X and let x0∈Ax_{0}\in A. For a natural number nn and an nn-tuple a∈Rna\in\mathbb{R}^{n} with components aka_{k} we write ∑k=1nak\sum_{k=1}^{n}a_{k} for the finite sum of its components, and we put

σn=∑k=1n1.\sigma_{n}=\sum_{k=1}^{n}1 .

Then the following hold.

1. (One modulus for a finite family) Let nn be a natural number, let ff assign to each k∈[n]k\in[n] a function fk:A→Yf_{k}:A\to Y that is continuous at x0x_{0} relative to AA, and let ε∈R\varepsilon\in\mathbb{R} be positive. Then there is a positive δ∈R\delta\in\mathbb{R} such that every y∈Ay\in A with d(x0,y)<δd(x_{0},y)<\delta satisfies

dY(fk(y),fk(x0))<εfor every k∈[n].d_{Y}\bigl(f_{k}(y),f_{k}(x_{0})\bigr)<\varepsilon\qquad\text{for every }k\in[n].

2. (The number of summands) For every natural number nn one has 1≤σn1\le\sigma_{n}, and ∑k=1nc=σnc\sum_{k=1}^{n}c=\sigma_{n}c for every c∈Rc\in\mathbb{R}.

3. (Uniform bound for a finite sum) Let nn be a natural number, let a∈Rna\in\mathbb{R}^{n} and let t∈Rt\in\mathbb{R} satisfy ak≤ta_{k}\le t for every k∈[n]k\in[n]. Then

∑k=1nak≤σnt.\sum_{k=1}^{n}a_{k}\le\sigma_{n}t .

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…