Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passverified 2026-08-09 (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 composite of continuous functions is continuous, with no side hypothesis of the kind the composition of limits needs

Statement

Let A,BRA, B \subseteq \mathbb{R}, let g:ARg : A \to \mathbb{R} with g(A)Bg(A) \subseteq B, and let f:BRf : B \to \mathbb{R}, so that the composite fg:ARf \circ g : A \to \mathbb{R} is defined. Let cAc \in A. If gg is continuous at cc and ff is continuous at g(c)Bg(c) \in B, then fgf \circ g is continuous at cc (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point).

Consequently, if gg is continuous on AA and ff is continuous on BB, then fgf \circ g is continuous on AA.

No side hypothesis is needed, and that is the whole point. The composition theorem for limits, Composition of limits holds under either hypothesis: ff is defined at LL with value MM, or gg avoids LL on a punctured neighbourhood of cc, must assume one of two extra conditions: either LBL \in B with f(L)=Mf(L) = M, or gLg \ne L on a punctured neighbourhood of cc; with both dropped the statement is false, which is FALSE: limxcf(g(x))=M\lim_{x \to c} f(g(x)) = M whenever limxcg=L\lim_{x \to c} g = L and limyLf=M\lim_{y \to L} f = M. The first of those conditions is exactly continuity of ff at LL written out, so under the hypotheses above it holds automatically and nothing has to be assumed. The mechanism is visible in the proof: Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point quantifies over yb<ρ|y - b| < \rho rather than over 0<yb<ρ0 < |y - b| < \rho, so the value y=by = b that the limit version cannot control is precisely the one the continuity hypothesis does control.

Facts & Assumptions

Given: Sets A,BRA, B \subseteq \mathbb{R}, functions g:ARg : A \to \mathbb{R} with g(A)Bg(A) \subseteq B and f:BRf : B \to \mathbb{R}, a point cAc \in A at which gg is continuous, and the hypothesis that ff is continuous at b:=g(c)Bb := g(c) \in B.

[L1]

Continuity of gg at cc: for every real ρ>0\rho > 0 there is a real δ>0\delta > 0 such that every xAx \in A with xc<δ|x - c| < \delta satisfies g(x)g(c)<ρ|g(x) - g(c)| < \rho (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point).

[L2]

Continuity of ff at bb: for every real ε>0\varepsilon > 0 there is a real ρ>0\rho > 0 such that every yBy \in B with yb<ρ|y - b| < \rho satisfies f(y)f(b)<ε|f(y) - f(b)| < \varepsilon (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point).

Proof

technique · direct
1.1

Write b:=g(c)b := g(c); by hypothesis bBb \in B, since g(A)Bg(A) \subseteq B and cAc \in A. Also (fg)(c)=f(b)(f \circ g)(c) = f(b).

given
1.2

Let a real ε>0\varepsilon > 0 be given. By [L2] fix a real ρ>0\rho > 0 such that every yBy \in B with yb<ρ|y - b| < \rho satisfies f(y)f(b)<ε|f(y) - f(b)| < \varepsilon.

L2choose
2.1

By [L1], applied with this ρ\rho, fix a real δ>0\delta > 0 such that every xAx \in A with xc<δ|x - c| < \delta satisfies g(x)b<ρ|g(x) - b| < \rho.

step 1.2L1choose
3.1

Let xAx \in A with xc<δ|x - c| < \delta. Then g(x)Bg(x) \in B and g(x)b<ρ|g(x) - b| < \rho by step 2.1, so y:=g(x)y := g(x) is admissible in step 1.2 and gives f(g(x))f(b)<ε\bigl|f(g(x)) - f(b)\bigr| < \varepsilon, that is (fg)(x)(fg)(c)<ε\bigl|(f \circ g)(x) - (f \circ g)(c)\bigr| < \varepsilon. Note that the case g(x)=bg(x) = b is included, by [L3].

step 1.1step 1.2step 2.1L3
4.1

The real ε>0\varepsilon > 0 was arbitrary and a δ>0\delta > 0 was produced for it, so fgf \circ g is continuous at cc; applying this at every point of AA gives continuity of fgf \circ g on AA whenever gg is continuous on AA and ff on BB.

step 3.1L1L2

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 34 results over 13 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources