Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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.

For f:ARf : A \to \mathbb{R} the set of points of AA at which ff is discontinuous is the intersection with AA of an FσF_\sigma subset of R\mathbb{R}, and the set of points at which ff is continuous is the intersection with AA of a GδG_\delta subset; for A=RA = \mathbb{R} the two sets are FσF_\sigma and GδG_\delta outright

Statement

Let ARA \subseteq \mathbb{R} and let f:ARf : A \to \mathbb{R}. Write

D  :=  {xA:f is discontinuous at x},C  :=  ADD \;:=\; \{\, x \in A : f \text{ is discontinuous at } x \,\}, \qquad C \;:=\; A \setminus D

(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, Discontinuity of ff at a point of its domain, and its classification: removable discontinuity, jump discontinuity and essential discontinuity, equivalently Rudin's discontinuities of the first and of the second kind). Then:

  1. Pointwise exhaustion. D={xA:ωf(x)>0}D = \{\, x \in A : \omega_f(x) > 0 \,\} (The oscillation ωf(S)=sup{f(x)f(y):x,yS}\omega_f(S) = \sup\{\,|f(x) - f(y)| : x, y \in S\,\} of ff on a set and the oscillation ωf(c)=infδ>0ωf(ANδ(c))\omega_f(c) = \inf_{\delta > 0} \omega_f(A \cap N_\delta(c)) at a point, both taken in the extended reals), and DD is the union of the increasing sequence of superlevel sets D  =  nN{xA:ωf(x)1/ι(n+1)}D \;=\; \bigcup_{n \in \mathbb{N}} \{\, x \in A : \omega_f(x) \ge 1/\iota(n+1) \,\} (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field), whose thresholds are 1,1/2,1/3,1, 1/2, 1/3, \dots.
  2. Descriptive form. There is an FσF_\sigma set FRF \subseteq \mathbb{R} and a GδG_\delta set VRV \subseteq \mathbb{R} (FσF_\sigma and GδG_\delta subsets of R\mathbb{R}) with D  =  AF,C  =  AV,V=RF,D \;=\; A \cap F, \qquad C \;=\; A \cap V, \qquad V = \mathbb{R} \setminus F , and FF may be taken to be nNGn\bigcup_{n \in \mathbb{N}} G_n with each GnG_n a closed subset of R\mathbb{R} cutting down on AA to the nn-th set of claim 1 (For every real ε>0\varepsilon > 0 the set {xA:ωf(x)ε}\{\,x \in A : \omega_f(x) \ge \varepsilon\,\} is the intersection with AA of a closed subset of R\mathbb{R}; in particular it is closed in R\mathbb{R} when A=RA = \mathbb{R}).

In particular, when A=RA = \mathbb{R} the discontinuity set DD is an FσF_\sigma subset of R\mathbb{R} and the continuity set CC is a GδG_\delta subset, and claim 1 reads D=n{xR:ωf(x)1/ι(n+1)}D = \bigcup_{n} \{\, x \in \mathbb{R} : \omega_f(x) \ge 1/\iota(n+1) \,\}.

Claim 1 is stated separately because it is what is cited downstream. The exhaustion of DD by the superlevel sets {ωf1/ι(n+1)}\{\omega_f \ge 1/\iota(n+1)\} is used directly wherever a property has to be established one threshold at a time — Baire's theorem: a Baire class one function on a closed bounded interval [a,b][a,b] is continuous at the points of a dense subset of [a,b][a,b] that is the trace of a GδG_\delta set, so its set of discontinuities is meager shows each superlevel set nowhere dense and concludes that DD is meager — and that use needs the identity itself, not only the descriptive conclusion of claim 2.

The statement is relative on purpose. For a general domain AA the sets DD and CC are subsets of AA, and neither is FσF_\sigma or GδG_\delta in R\mathbb{R} in general; what the proof produces are two subsets of R\mathbb{R} that cut down to them. The absolute form is stated only for A=RA = \mathbb{R}, which is the case Every GδG_\delta subset of R\mathbb{R} is the set of continuity points of some f:RRf : \mathbb{R} \to \mathbb{R}, so the GδG_\delta sets are exactly the continuity sets and No function RR\mathbb{R} \to \mathbb{R} is continuous at every rational and discontinuous at every irrational, because Q\mathbb{Q} is not GδG_\delta use.

Facts & Assumptions

Given: ARA \subseteq \mathbb{R} and a function f:ARf : A \to \mathbb{R}.

[L2]

For every real ε>0\varepsilon > 0 there is a closed GRG \subseteq \mathbb{R} with {xA:ωf(x)ε}=AG\{x \in A : \omega_f(x) \ge \varepsilon\} = A \cap G (For every real ε>0\varepsilon > 0 the set {xA:ωf(x)ε}\{\,x \in A : \omega_f(x) \ge \varepsilon\,\} is the intersection with AA of a closed subset of R\mathbb{R}; in particular it is closed in R\mathbb{R} when A=RA = \mathbb{R}).

[L3]

For every real η>0\eta > 0 there is a natural m1m \ge 1 with 1/ι(m)<η1/\iota(m) < \eta, where ι(m)\iota(m) is the canonical natural of mm in R\mathbb{R}; and ι\iota is strictly increasing and positive on the naturals 1\ge 1 (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, Canonical naturals are positive and strictly increasing).

[L4]

A subset of R\mathbb{R} is FσF_\sigma when it is the union of a sequence of closed sets and GδG_\delta when it is the intersection of a sequence of open sets; SS is FσF_\sigma if and only if RS\mathbb{R} \setminus S is GδG_\delta (FσF_\sigma and GδG_\delta subsets of R\mathbb{R}, Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen).

Proof

technique · direct
1.1

For each nNn \in \mathbb{N} put εn:=1/ι(n+1)\varepsilon_n := 1/\iota(n+1), a positive real since n+11n + 1 \ge 1, and let GnRG_n \subseteq \mathbb{R} be closed with {xA:ωf(x)εn}=AGn\{x \in A : \omega_f(x) \ge \varepsilon_n\} = A \cap G_n.

L2L3construct
1.2

D={xA:ωf(x)>0}D = \{\, x \in A : \omega_f(x) > 0 \,\}: a point xAx \in A is a discontinuity exactly when ωf(x)0\omega_f(x) \ne 0, and ωf(x)0\omega_f(x) \ge 0 always, so exactly when ωf(x)>0\omega_f(x) > 0.

L1
2.1

DnN(AGn)D \subseteq \bigcup_{n \in \mathbb{N}} (A \cap G_n). Let xDx \in D, so ωf(x)>0\omega_f(x) > 0. If ωf(x)ε0=1\omega_f(x) \ge \varepsilon_0 = 1 then xAG0x \in A \cap G_0. Otherwise 0<ωf(x)<10 < \omega_f(x) < 1, so ωf(x)\omega_f(x) is a positive real, and there is a natural m1m \ge 1 with 1/ι(m)<ωf(x)1/\iota(m) < \omega_f(x); writing m=n+1m = n + 1 with nNn \in \mathbb{N} gives ωf(x)>εn\omega_f(x) > \varepsilon_n, hence xAGnx \in A \cap G_n.

step 1.1step 1.2L3
2.2

Conversely nN(AGn)D\bigcup_{n \in \mathbb{N}} (A \cap G_n) \subseteq D: if xAGnx \in A \cap G_n then ωf(x)εn>0\omega_f(x) \ge \varepsilon_n > 0, so xDx \in D.

step 1.1step 1.2L3
3.1

Put F:=nNGnF := \bigcup_{n \in \mathbb{N}} G_n, an FσF_\sigma subset of R\mathbb{R} since each GnG_n is closed and the family is indexed by N\mathbb{N}. Then AF=n(AGn)=DA \cap F = \bigcup_{n} (A \cap G_n) = D.

step 1.1step 2.1step 2.2L4
3.2

Claim 1 is proved: D={xA:ωf(x)>0}D = \{x \in A : \omega_f(x) > 0\} by step 1.2, and D=nN{xA:ωf(x)εn}D = \bigcup_{n \in \mathbb{N}} \{x \in A : \omega_f(x) \ge \varepsilon_n\} by steps 2.1 and 2.2, since AGnA \cap G_n is by step 1.1 exactly the set {xA:ωf(x)εn}\{x \in A : \omega_f(x) \ge \varepsilon_n\} with εn=1/ι(n+1)\varepsilon_n = 1/\iota(n+1). The union is increasing, since nmn \le m gives ι(n+1)ι(m+1)\iota(n+1) \le \iota(m+1) and hence εmεn\varepsilon_m \le \varepsilon_n.

step 1.1step 1.2step 2.1step 2.2L3
4.1

Put V:=RFV := \mathbb{R} \setminus F, a GδG_\delta subset of R\mathbb{R}. Then AV=A(AF)=AD=CA \cap V = A \setminus (A \cap F) = A \setminus D = C.

step 3.1L4
5.1

Claim 2 is proved by steps 3.1 and 4.1; and for A=RA = \mathbb{R} the two identities read D=FD = F and C=VC = V, so DD is FσF_\sigma and CC is GδG_\delta outright.

step 3.1step 3.2step 4.1

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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