TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions

Statement

Let $m \in N$ with $m \geq 1$ , with vector-valued functions, their components $f_{i} = π_{i} \circ f$ , their limits and their continuity as in Vector-valued functions $f : A \to R^{m}$ , their limits and continuity, with the dictionary to the metric notions.

Continuity is componentwise. Let $(X, d_{X})$ be a metric space, $A \subseteq X$ , $f : A \to R^{m}$ and $a \in A$ . Then $f$ is continuous at $a$ if and only if every component $f_{i} : A \to R$ $(i < m)$ is continuous at $a$ .
Limits are componentwise. Let $A \subseteq R$ , let $c$ be a limit point of $A$ (Limit point, isolated point, adherent point, derived set, and dense subset of $R$ ), let $f : A \to R^{m}$ and let $L \in R^{m}$ . Then $\lim_{x \to c} f (x) = L$ if and only if $\lim_{x \to c} f_{i} (x) = L_{i}$ for every $i < m$ (The $ε$ - $δ$ limit $\lim_{x \to c} f (x) = L$ of $f : A \to R$ at a limit point $c$ of $A$ ).
Algebra. Let $(X, d_{X})$ , $A$ , $a$ be as in clause 1, let $f, g : A \to R^{m}$ be continuous at $a$ and let $λ \in R$ . Then $f + g$ and $λ f$ (defined pointwise) are continuous at $a$ ; the real-valued function $x \mapsto ⟨ f (x), g (x) ⟩$ is continuous at $a$ (The Euclidean inner product $⟨ x, y ⟩ = \sum_{k < n} x_{k} y_{k}$ on $R^{n}$ ); and for every norm $N$ on $R^{m}$ the real-valued function $x \mapsto N (f (x))$ is continuous at $a$ (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).

Where $m \geq 1$ is spent. The "if" direction of clauses 1 and 2 divides $ε$ by $ι (m)$ , which requires $ι (m) \neq 0$ ; and clause 3's last part quotes a bound available only for $m \geq 1$ . The "only if" directions hold for every $m$ but say nothing at $m = 0$ , there being no index $i < 0$ .

Facts & Assumptions

Given: A natural $m \geq 1$ ; a metric space $(X, d_{X})$ , a subset $A \subseteq X$ , a point $a \in A$ and functions $f, g : A \to R^{m}$ ; a real $λ$ ; and a real $ε > 0$ .

[L1]

Continuity and limits of vector-valued functions in the $ε$ - $δ$ form, the coordinate projections $π_{i}$ , and $∣ y_{i} ∣ \leq ∥ y ∥_{2}$ for $i < m$ (Vector-valued functions $f : A \to R^{m}$ , their limits and continuity, with the dictionary to the metric notions, Continuity of a map between metric spaces, at a point and globally, in the $ε$ - $δ$ form, Metric space: $d (x, y) = 0$ iff $x = y$ , symmetry, and the triangle inequality; pseudometric and ultrametric, The absolute value makes $R$ a metric space: $d (x, y) = ∣ x - y ∣$ is a metric, its open balls are the intervals $(x - r, x + r)$ , and it is unbounded).

[L2]

The comparison $∥ y ∥_{2} \leq ∥ y ∥_{1} = \sum_{i < m} ∣ y_{i} ∣$ , and $N (y) \leq C ∥ y ∥_{1} \leq C \sqrt{ι (m)} ∥ y ∥_{2}$ with $C : = \max {N (e_{i}) : i < m} \geq 0$ , together with $∣ N (y) - N (z) ∣ \leq N (y - z)$ , all for $m \geq 1$ (The finite and reverse triangle inequalities for a norm; and for $n \geq 1$ every norm $N$ on $R^{n}$ satisfies $N (x) \leq C ∥ x ∥_{1}$ and is Lipschitz, hence continuous, for $d_{2}$ clauses 1, 2, 3, The $p$ -norms $∥ x ∥_{p}$ for rational $p \geq 1$ , and $∥ x ∥_{\infty}$ , The standard list $e : n \to F^{n}$ with $e_{i} (i) = 1_{F}$ and $e_{i} (j) = 0_{F}$ for $j \neq i$ is an ordered basis of $F^{n}$ ; hence $\dim_{F} F^{n} = n$ , and $F^{0}$ is the zero space with basis $\emptyset$ and dimension $0$ ).

[L3]

The norm axioms for $∥ \cdot ∥_{2}$ (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms, Each $∥ \cdot ∥_{p}$ is a norm on $R^{n}$ , and the induced metrics are exactly $d_{1}$ , $d_{2}$ and $d_{\infty}$ of the published metric-spaces page), and $∥ u - v ∥_{2} = d_{2} (u, v)$ .

[L4]

Cauchy-Schwarz: $∣ ⟨ u, v ⟩ ∣ \leq ∥ u ∥_{2} ∥ v ∥_{2}$ , together with bilinearity and symmetry of the inner product (Cauchy-Schwarz $∣ ⟨ x, y ⟩ ∣ \leq ∥ x ∥_{2} ∥ y ∥_{2}$ with its equality case, the triangle inequality for $∥ \cdot ∥_{2}$ , the parallelogram law and polarisation, The Euclidean inner product $⟨ x, y ⟩ = \sum_{k < n} x_{k} y_{k}$ on $R^{n}$ ).

[L5]

Laws of finite sums (Laws of finite sums and finite products, Finite sums and finite products, by recursion): additivity, scaling, monotonicity, $\sum_{i < m} μ = ι (m) μ$ , a sum of nonnegative terms is nonnegative, and each single term is at most such a sum.

[L6]

$ι (m) > 0$ for $m \geq 1$ , and $u > 0$ gives $u^{- 1} > 0$ (The canonical natural $ι (n) = n \cdot 1_{F}$ of a field, Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order).

[L7]

A nonempty finite set of reals has a minimum (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set); and a family of nonempty sets indexed by a natural number has a choice function, this being a theorem of ZF (Every natural-number-indexed list of nonempty sets has a choice function on its family of values), which is what licenses picking one $δ_{i}$ for each $i < m$ .

[L8]

Absolute value (Basic properties of the absolute value): $∣ t ∣ \geq 0$ , $∣ s t ∣ = ∣ s ∣ ∣ t ∣$ , and $∣ s + t ∣ \leq ∣ s ∣ + ∣ t ∣$ .

Proof

technique · direct

1.1L1L2

For every $y \in R^{m}$ : $∣ y_{i} ∣ \leq ∥ y ∥_{2}$ for each $i < m$ , and $∥ y ∥_{2} \leq \sum_{i < m} ∣ y_{i} ∣$ .

1.2L5L6

If $a_{i} < b_{i}$ for every $i < m$ and $m \geq 1$ , then $\sum_{i < m} a_{i} < \sum_{i < m} b_{i}$ : the list $i \mapsto b_{i} - a_{i}$ has positive terms, so its sum is at least its term at index $0$ , hence positive, and additivity gives the strict inequality.

1.3L7

For each $i < m$ the set of positive reals $δ$ witnessing continuity of $f_{i}$ at $a$ for a given tolerance is nonempty whenever $f_{i}$ is continuous at $a$ , so a choice function on the family indexed by $m$ produces $δ_{0}, \dots, δ_{m - 1}$ simultaneously, with no choice principle used.

1.4L1L3L6L7

For $f + g$ : given $ε > 0$ , pick $δ_{1}, δ_{2} > 0$ for the tolerance $ε / ι (2)$ at $f$ and at $g$ and put $δ : = \min {δ_{1}, δ_{2}}$ ; then for $d_{X} (x, a) < δ$ , $∥ (f + g) (x) - (f + g) (a) ∥_{2} = ∥ (f (x) - f (a)) + (g (x) - g (a)) ∥_{2} \leq ∥ f (x) - f (a) ∥_{2} + ∥ g (x) - g (a) ∥_{2} < ε$ .

1.5L1L3L6L8

For $λ f$ : if $λ = 0$ then $λ f$ is constant and every $δ$ serves; otherwise $∣ λ ∣ > 0$ , and a $δ$ for the tolerance $ε / ∣ λ ∣$ at $f$ gives $∥ λ f (x) - λ f (a) ∥_{2} = ∣ λ ∣ ∥ f (x) - f (a) ∥_{2} < ε$ .

1.6L1L2L6

For $N \circ f$ : by [L2], $∣ N (f (x)) - N (f (a)) ∣ \leq N (f (x) - f (a)) \leq C \sqrt{ι (m)} ∥ f (x) - f (a) ∥_{2}$ ; so a $δ$ for the tolerance $ε / (C \sqrt{ι (m)} + 1)$ at $f$ serves for $N \circ f$ .

1.7L1L3

For $⟨ f, g ⟩$ : first take $δ_{0} > 0$ with $∥ g (x) - g (a) ∥_{2} < 1$ for $d_{X} (x, a) < δ_{0}$ , so that $∥ g (x) ∥_{2} \leq ∥ g (x) - g (a) ∥_{2} + ∥ g (a) ∥_{2} < B : = ∥ g (a) ∥_{2} + 1$ there.

2.1step 1.1L1

Suppose $f$ is continuous at $a$ and fix $i < m$ . Given $ε > 0$ , take $δ$ from the definition; for $x \in A$ with $d_{X} (x, a) < δ$ , step 1.1 gives $∣ f_{i} (x) - f_{i} (a) ∣ \leq ∥ f (x) - f (a) ∥_{2} < ε$ . So $f_{i}$ is continuous at $a$ .

2.2step 1.3L1L6L7

Conversely suppose every $f_{i}$ is continuous at $a$ . Given $ε > 0$ , the real $ε / ι (m)$ is positive; by step 1.3 choose $δ_{i} > 0$ for each $i < m$ with $∣ f_{i} (x) - f_{i} (a) ∣ < ε / ι (m)$ whenever $x \in A$ and $d_{X} (x, a) < δ_{i}$ , and put $δ : = \min {δ_{0}, \dots, δ_{m - 1}} > 0$ .

2.3step 1.7L4L8

By bilinearity, $⟨ f (x), g (x) ⟩ - ⟨ f (a), g (a) ⟩ = ⟨ f (x) - f (a), g (x) ⟩ + ⟨ f (a), g (x) - g (a) ⟩$ , so Cauchy-Schwarz and step 1.7 give $∣ ⟨ f (x), g (x) ⟩ - ⟨ f (a), g (a) ⟩ ∣ \leq B ∥ f (x) - f (a) ∥_{2} + ∥ f (a) ∥_{2} ∥ g (x) - g (a) ∥_{2}$ for every $x \in A$ with $d_{X} (x, a) < δ_{0}$ .

3.1step 1.1step 1.2step 2.2L5L6

For $x \in A$ with $d_{X} (x, a) < δ$ : each $∣ f_{i} (x) - f_{i} (a) ∣ < ε / ι (m)$ , so by steps 1.1 and 1.2, $∥ f (x) - f (a) ∥_{2} \leq \sum_{i < m} ∣ f_{i} (x) - f_{i} (a) ∣ < \sum_{i < m} ε / ι (m) = ε$ . Hence $f$ is continuous at $a$ , and clause 1 is proved.

3.2step 1.1step 1.2step 1.3L1L5L6L7

Clause 2 is the same two estimates with $f (a)$ replaced by $L$ , $f_{i} (a)$ by $L_{i}$ , and the condition $d_{X} (x, a) < δ$ by $0 < ∣ x - c ∣ < δ$ : step 1.1 gives $∣ f_{i} (x) - L_{i} ∣ \leq ∥ f (x) - L ∥_{2}$ for the forward direction, and steps 1.1, 1.2 give $∥ f (x) - L ∥_{2} \leq \sum_{i < m} ∣ f_{i} (x) - L_{i} ∣ < ε$ for the converse, with $δ$ the minimum of $m$ radii obtained as in step 2.2.

3.3step 1.7step 2.3L1L6L7

Put $P : = B + ∥ f (a) ∥_{2} + 1 > 0$ and take $δ \leq δ_{0}$ positive with both $∥ f (x) - f (a) ∥_{2} < ε / P$ and $∥ g (x) - g (a) ∥_{2} < ε / P$ for $d_{X} (x, a) < δ$ ; then step 2.3 bounds the difference by $(B + ∥ f (a) ∥_{2}) ε / P < ε$ , so $⟨ f, g ⟩$ is continuous at $a$ .

4.1step 3.1step 3.2step 1.4step 1.5step 1.6step 3.3∎

Steps 1.4, 1.5, 1.6 and 3.3 are clause 3, and with steps 3.1 and 3.2 all three clauses are proved.

Remarks

Why the algebra is proved here rather than quoted. The published Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function and Sums, scalar multiples, products and quotients of function limits, the quotient under the hypothesis that the denominator limit is nonzero are stated for real-valued functions on a subset of $R$ , and the domain in clause 3 is a subset of an arbitrary metric space; quoting them for a metric domain would be a citation to an item for a claim it does not make. The estimates in steps 1.4 to 3.3 are the same ones, written out. When the domain is a subset of $R$ , clause 1 and Dictionary: for $A \subseteq R$ with the metric $d (x, y) = ∣ x - y ∣$ , continuity and uniform continuity of $f : A \to R$ agree with the metric-space notions, the Lipschitz and Hölder conditions are the metric ones instantiated, and a subset of $R$ is compact in the open-cover sense of $R$ exactly when it is a compact metric subspace identify the two readings, and the published theorems may then be used on the components.
Clause 3 is what makes the mean value inequality work. The auxiliary function $t \mapsto ⟨ u, f (t) ⟩$ of The mean value inequality: if $f : [a, b] \to R^{m}$ is continuous and differentiable on $(a, b)$ with $∥ f^{'} ∥_{2} \leq M$ , then $∥ f (b) - f (a) ∥_{2} \leq M (b - a)$ is continuous exactly by the inner-product part of clause 3, applied with the constant function $u$ .
Nothing here is a sequential argument, so no choice principle is used beyond the finitely many simultaneous selections of steps 1.3, 2.2 and 3.3, which are covered by Every natural-number-indexed list of nonempty sets has a choice function on its family of values, a theorem of ZF.

A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions

Statement

Facts & Assumptions

Proof

Remarks

Depends on

Dependency tree · 2 levels

Sources