Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

ff is continuous at cAc \in A if and only if f(xk)f(c)f(x_k) \to f(c) for every sequence in AA converging to cc, the converse direction costing countable choice

Statement

Let ARA \subseteq \mathbb{R}, let f:ARf : A \to \mathbb{R} and let cAc \in A. The following are equivalent.

  1. ff 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).
  2. For every sequence (xk)kN(x_k)_{k \in \mathbb{N}} with xkAx_k \in A for every kk and xkcx_k \to c (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Limits and Cauchy sequences of reals), the sequence (f(xk))kN\bigl(f(x_k)\bigr)_{k \in \mathbb{N}} converges to f(c)f(c).

The sequences here are not required to avoid cc, which is the one difference from Heine criterion: limxcf(x)=L\lim_{x \to c} f(x) = L iff f(xk)Lf(x_k) \to L for every sequence in A{c}A \setminus \{c\} converging to cc and is exactly what makes the criterion available at an isolated point of AA, where no limit exists.

The two directions do not cost the same. The implication from 1 to 2 is proved in ZF: the sequence is handed to the proof and nothing is selected. The implication from 2 to 1 is obtained below from Heine criterion: limxcf(x)=L\lim_{x \to c} f(x) = L iff f(xk)Lf(x_k) \to L for every sequence in A{c}A \setminus \{c\} converging to cc, and therefore inherits the one use of the axiom of countable choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)) made in that theorem's converse direction. What this library does and does not claim about that cost is recorded once, in The sequence-to-ε\varepsilon direction of the Heine criterion uses countable choice for R\mathbb{R}, and where this library records that cost, and is not restated here.

Nothing else on this page is routed through this theorem. The algebra of continuous functions, composition, the intermediate value theorem, the extreme value theorem and Heine-Cantor are all proved from ε\varepsilon and δ\delta, or from compactness, exactly as the previous page organised itself. The choice-free direction 1 to 2 is used, in the intermediate value theorem and in Heine-Cantor, and each of those two items says which direction it uses.

Facts & Assumptions

Given: A set ARA \subseteq \mathbb{R}, a function f:ARf : A \to \mathbb{R} and a point cAc \in A.

[L1]

Continuity at cc: for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 such that every xAx \in A with xc<δ|x - c| < \delta satisfies f(x)f(c)<ε|f(x) - f(c)| < \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).

[L2]

A point of AA is either a limit point of AA or an isolated point of AA, and never both; cc is isolated in AA when Nη(c)A={c}N_{\eta}(c) \cap A = \{c\} for some real η>0\eta > 0 (Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}, The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}).

[L4]

Heine criterion for limits: at a limit point cc of AA, limxcf(x)=L\lim_{x \to c} f(x) = L holds if and only if f(xk)Lf(x_k) \to L for every sequence (xk)(x_k) with xkAx_k \in A, xkcx_k \ne c for every kk, and xkcx_k \to c. The direction from the limit to sequences is a theorem of ZF; the converse uses the axiom of countable choice exactly once (Heine criterion: limxcf(x)=L\lim_{x \to c} f(x) = L iff f(xk)Lf(x_k) \to L for every sequence in A{c}A \setminus \{c\} converging to cc, The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

[L5]

Convergence of a real sequence: xkxx_k \to x when for every rational ε>0\varepsilon > 0 there is KK with xkx<ε|x_k - x| < \varepsilon for all kKk \ge K; below every positive real lies a positive rational, so the test may equally be run at every real ε>0\varepsilon > 0 (Limits and Cauchy sequences of reals, Sequences of reals: bounded, eventually, frequently, tails, subsequences, The rationals embed densely in the reals).

[L6]

Absolute value: u0|u| \ge 0, and u=0|u| = 0 exactly when u=0u = 0 (Basic properties of the absolute value).

Proof

technique · direct
1.1

The isolated case, both statements at once. Suppose cc is an isolated point of AA and fix a real η>0\eta > 0 with Nη(c)A={c}N_{\eta}(c) \cap A = \{c\}. Then statement 1 holds by [L3]. Statement 2 also holds: if xkAx_k \in A for every kk and xkcx_k \to c, then by [L5] there is KK with xkc<η|x_k - c| < \eta for all kKk \ge K, so xkNη(c)A={c}x_k \in N_{\eta}(c) \cap A = \{c\} and hence xk=cx_k = c and f(xk)=f(c)f(x_k) = f(c) for all kKk \ge K; a sequence eventually equal to f(c)f(c) converges to f(c)f(c), since f(xk)f(c)=0<ε|f(x_k) - f(c)| = 0 < \varepsilon for kKk \ge K. So 1 and 2 are both true, and in particular equivalent.

L2L3L5L6
1.2

The limit-point case, from 1 to 2. Suppose cc is a limit point of AA and that ff is continuous at cc. Let (xk)(x_k) satisfy xkAx_k \in A for every kk and xkcx_k \to c, and let a rational ε>0\varepsilon > 0 be given. By [L1] fix a real δ>0\delta > 0 with f(x)f(c)<ε|f(x) - f(c)| < \varepsilon for every xAx \in A satisfying xc<δ|x - c| < \delta; by [L5] fix KK with xkc<δ|x_k - c| < \delta for all kKk \ge K. Every such kk has xkAx_k \in A and xkc<δ|x_k - c| < \delta, hence f(xk)f(c)<ε|f(x_k) - f(c)| < \varepsilon. As the rational ε>0\varepsilon > 0 was arbitrary, f(xk)f(c)f(x_k) \to f(c). Nothing was selected, so this is a theorem of ZF.

L1L5
1.3

The limit-point case, from 2 to 1. Suppose cc is a limit point of AA and that statement 2 holds. Every sequence (xk)(x_k) with xkAx_k \in A, xkcx_k \ne c for every kk, and xkcx_k \to c is in particular a sequence in AA converging to cc, so statement 2 gives f(xk)f(c)f(x_k) \to f(c). That is the right-hand side of [L4] with L:=f(c)L := f(c), so [L4] yields that the limit of ff at cc exists and equals f(c)f(c), and [L3] turns that into continuity of ff at cc. This is the direction that inherits the single use of countable choice made in [L4].

L3L4
2.1

By [L2] the point cc is either isolated in AA or a limit point of AA. In the first case step 1.1 proves both statements outright; in the second, step 1.2 gives 1 implies 2 and step 1.3 gives 2 implies 1. So statements 1 and 2 are equivalent, with the first implication free of choice and the second inheriting exactly one application of countable choice.

step 1.1step 1.2step 1.3L2

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 82 results over 27 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