Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)
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.

Under dependent choice, a continuous real-valued map on a closed subspace of a normal space extends to the whole space, and a map into an open interval extends into that same open interval

Statement

Assume the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N\mathbb{N}-indexed chain). Let (X,T)(X,\mathcal{T}) be normal (Normal spaces and T4T_4 spaces, with the source disagreement over whether normality includes T1T_1 stated explicitly) and let AXA \subseteq X be closed (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

  1. Every continuous f:ARf : A \to \mathbb{R} extends to a continuous F:XRF : X \to \mathbb{R} with FA=fF|_A = f.
  2. For reals a<ba<b, every continuous f:A(a,b)f : A \to (a,b) extends to a continuous F:X(a,b)F : X \to (a,b) with FA=fF|_A = f.

Scope. The two one-sided open interval forms of Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, (a,)(a,\infty) and (,b)(-\infty,b), are not treated by clause 2 above; extending it to them would need an explicit order-homeomorphism between a ray and R\mathbb{R}, which is not built here.

Facts & Assumptions

Given: Dependent choice, a normal (X,T)(X,\mathcal{T}), a closed AXA \subseteq X; for clause 1, continuous f:ARf : A \to \mathbb{R}; for clause 2, reals a<ba<b and continuous f:A(a,b)f : A \to (a,b).

[L1]

Tietze's extension theorem, clause 1: assuming DC, if XX is normal, AA closed and pqp \le q reals, every continuous h:A[p,q]h : A \to [p,q] extends to continuous H:X[p,q]H : X \to [p,q] with HA=hH|_A = h (Tietze's extension theorem, under dependent choice: a continuous map from a closed subspace of a normal space into [a,b][a,b] extends continuously to the whole space, and this property characterises normality).

[L2]

Urysohn's lemma, clause 1: assuming DC, disjoint closed P,QXP,Q \subseteq X admit continuous φ:X[0,1]\varphi : X \to [0,1] with Pφ1({0})P \subseteq \varphi^{-1}(\{0\}), Qφ1({1})Q \subseteq \varphi^{-1}(\{1\}) (Urysohn's lemma, under the axiom of dependent choice: in a normal space two disjoint closed sets are separated by a continuous function into [0,1][0,1], and conversely such a space is normal).

[L3]

Product of two continuous real-valued maps on XX is continuous: for continuous g,h:XRg,h:X\to\mathbb{R} and x0Xx_0 \in X, fix (continuity of gg) open U0x0U_0 \ni x_0 with g(x)g(x0)<1|g(x)-g(x_0)|<1 on U0U_0, so g(x)<g(x0)+1=:B|g(x)| < |g(x_0)|+1 =: B there; for real ε>0\varepsilon>0 fix open U1x0U_1 \ni x_0 with g(x)g(x0)<ε/(2(h(x0)+1))|g(x)-g(x_0)| < \varepsilon/(2(|h(x_0)|+1)) and open U2x0U_2 \ni x_0 with h(x)h(x0)<ε/(2B)|h(x)-h(x_0)|<\varepsilon/(2B); on U0U1U2U_0 \cap U_1 \cap U_2, g(x)h(x)g(x0)h(x0)g(x)h(x)h(x0)+h(x0)g(x)g(x0)<Bε/(2B)+h(x0)ε/(2(h(x0)+1))<ε|g(x)h(x)-g(x_0)h(x_0)| \le |g(x)||h(x)-h(x_0)| + |h(x_0)||g(x)-g(x_0)| < B \cdot \varepsilon/(2B) + |h(x_0)|\cdot \varepsilon/(2(|h(x_0)|+1)) < \varepsilon, so ghgh is continuous at x0x_0 (Continuity of a map of topological spaces at a point and globally, Basic properties of the absolute value).

Proof

technique · constructive
1.1

Fix reals a<ba<b. Define α:(a,b)(1,1)\alpha : (a,b) \to (-1,1) by α(t):=(2tab)/(ba)\alpha(t) := (2t-a-b)/(b-a) and β:(1,1)(a,b)\beta : (-1,1) \to (a,b) by β(s):=((ba)s+a+b)/2\beta(s) := ((b-a)s+a+b)/2; both are continuous real functions by [L4], the denominators bab-a and 22 being nonzero. Direct substitution gives β(α(t))=t\beta(\alpha(t))=t for t(a,b)t\in(a,b) and α(β(s))=s\alpha(\beta(s))=s for s(1,1)s\in(-1,1).

givenL4algebraconstruct
1.2

Let g:A(1,1)g : A \to (-1,1) be continuous, regarded as a map A[1,1]A \to [-1,1]; by [L1] with p=1,q=1p=-1,q=1 fix continuous G:X[1,1]G : X \to [-1,1] with GA=gG|_A = g.

givenL1chooseconstruct
1.3

Define ψ:(1,1)R\psi : (-1,1) \to \mathbb{R} by ψ(t):=t/(1t)\psi(t) := t/(1-|t|) and χ:R(1,1)\chi : \mathbb{R} \to (-1,1) by χ(s):=s/(1+s)\chi(s) := s/(1+|s|); both are continuous real functions by [L4], the denominators 1t1-|t| (on (1,1)(-1,1)) and 1+s1+|s| (everywhere) being positive. For t0t \ge 0 in (1,1)(-1,1): ψ(t)=t/(1t)0\psi(t)=t/(1-t) \ge 0 and χ(ψ(t))=t/(1t)1+t/(1t)=t/(1t)1/(1t)=t\chi(\psi(t)) = \frac{t/(1-t)}{1+t/(1-t)} = \frac{t/(1-t)}{1/(1-t)} = t; for t<0t<0 the same computation with t=t|t|=-t gives χ(ψ(t))=t\chi(\psi(t))=t. Likewise ψ(χ(s))=s\psi(\chi(s))=s for every real ss, splitting on the sign of ss.

givenL4algebraconstruct
2.1

By [L5], α\alpha and β\beta of step 1.1 are continuous as maps of topological spaces (a,b)(1,1)(a,b) \to (-1,1) and (1,1)(a,b)(-1,1) \to (a,b).

step 1.1L5
2.2

Put D:=G1({1,1})D := G^{-1}(\{-1,1\}), closed by [L6]; DA=D \cap A = \varnothing, since GA=gG|_A = g takes values in (1,1)(-1,1). By [L2], fix continuous φ:X[0,1]\varphi : X \to [0,1] with Dφ1({0})D \subseteq \varphi^{-1}(\{0\}) and Aφ1({1})A \subseteq \varphi^{-1}(\{1\}).

step 1.2L2L6choose
2.3

By [L5], ψ\psi and χ\chi of step 1.3 are continuous as maps of topological spaces (1,1)R(-1,1) \to \mathbb{R} and R(1,1)\mathbb{R} \to (-1,1).

step 1.3L5
3.1

Define G~:XR\tilde{G} : X \to \mathbb{R} by G~(x):=φ(x)G(x)\tilde{G}(x) := \varphi(x)G(x), continuous by [L3]. For xAx \in A: φ(x)=1\varphi(x)=1, so G~(x)=G(x)=g(x)\tilde G(x)=G(x)=g(x). For xDx \notin D: G(x)<1|G(x)|<1 and φ(x)[0,1]\varphi(x)\in[0,1], so G~(x)=φ(x)G(x)G(x)<1|\tilde G(x)| = \varphi(x)|G(x)| \le |G(x)| < 1. For xDx \in D: φ(x)=0\varphi(x)=0, so G~(x)=0\tilde G(x)=0. So G~:X(1,1)\tilde G : X \to (-1,1) and G~A=g\tilde G|_A = g.

step 2.2step 1.2L3construct
4.1

[Clause 2.] With α,β\alpha,\beta as in steps 1.1–2.1: g:=αf:A(1,1)g := \alpha \circ f : A \to (-1,1) is continuous by [L7]; by step 3.1 fix continuous G~:X(1,1)\tilde G : X \to (-1,1) with G~A=g\tilde G|_A = g; define F:=βG~:X(a,b)F := \beta \circ \tilde G : X \to (a,b), continuous by [L7]. For xAx \in A: F(x)=β(G~(x))=β(g(x))=β(α(f(x)))=f(x)F(x) = \beta(\tilde G(x)) = \beta(g(x)) = \beta(\alpha(f(x))) = f(x) by step 1.1. So FF extends ff into (a,b)(a,b).

step 2.1step 3.1step 1.1L7algebraconstruct
4.2

[Clause 1.] Let f:ARf : A \to \mathbb{R} be continuous. With ψ,χ\psi,\chi as in steps 1.3 and 2.3: g:=χf:A(1,1)g := \chi \circ f : A \to (-1,1) is continuous by [L7]; by step 3.1 fix continuous G~:X(1,1)\tilde G : X \to (-1,1) with G~A=g\tilde G|_A = g; define F:=ψG~:XRF := \psi \circ \tilde G : X \to \mathbb{R}, continuous by [L7]. For xAx \in A: F(x)=ψ(G~(x))=ψ(g(x))=ψ(χ(f(x)))=f(x)F(x) = \psi(\tilde G(x)) = \psi(g(x)) = \psi(\chi(f(x))) = f(x) by step 1.3. So FF extends ff into R\mathbb{R}.

step 2.3step 3.1step 1.3L7algebraconstruct
5.1

Steps 4.1 and 4.2 establish clauses 2 and 1 respectively.

step 4.1step 4.2discharge-construct

Remarks

  • The affine maps of step 1.1 and the rational maps of step 1.3 play the same role: each turns a target interval into (1,1)(-1,1) or back, so that the single boundary-avoidance construction of steps 1.2, 2.2 and 3.1 need be proved once and reused for both clauses. Neither clause repeats that construction.

  • The product fact [L3] is the only piece of "algebra of continuous functions" this page needs for a map out of a general topological space; the sum and scalar-multiple facts used elsewhere on this page are proved where they are first needed, by the same style of argument.

  • Choice is spent only through [L1] and [L2], that is, only through the two cited results; nothing in steps 1.1–5.1 performs a further selection from an infinite family.

Depends on

Used by

Dependency tree · next 3 levels

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