Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-29
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.

GδG_\delta and FσF_\sigma subsets of a topological space, agreeing with the real-line notion

Definition

Let (X,T)(X, \mathcal{T}) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and let AXA \subseteq X.

  • AA is a GδG_\delta set of XX when there is a sequence (Vn)nN(V_n)_{n \in \mathbb{N}} of open subsets of XX with A  =  nNVn.A \;=\; \bigcap_{n \in \mathbb{N}} V_n .
  • AA is an FσF_\sigma set of XX when there is a sequence (Fn)nN(F_n)_{n \in \mathbb{N}} of closed subsets of XX with A  =  nNFn.A \;=\; \bigcup_{n \in \mathbb{N}} F_n .

As everywhere in this library N\mathbb{N} contains 00, so both indexings start at 00. An at most countable family may always be presented as a sequence (Finite, countably infinite, countable, uncountable): a finite list V0,,VmV_0, \dots, V_m is extended by Vn:=VmV_n := V_m for n>mn > m, which changes neither the intersection nor the union, so nothing is lost by indexing over N\mathbb{N}.

The two classes are exchanged by complementation. AA is FσF_\sigma in XX if and only if XAX \setminus A is GδG_\delta in XX. If A=nFnA = \bigcup_n F_n with each FnF_n closed then XA=n(XFn)X \setminus A = \bigcap_n (X \setminus F_n) by De Morgan and each XFnX \setminus F_n is open (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison); the converse is the same computation read backwards.

Every open set is GδG_\delta and every closed set is FσF_\sigma, by the constant sequence Vn:=AV_n := A, respectively Fn:=AF_n := A. Neither converse holds, and R\mathbb{R} with its usual topology already refutes both. The singleton {0}\{0\} is a GδG_\delta that is not open: it is nN(1/(n+1), 1/(n+1))\bigcap_{n \in \mathbb{N}} (-1/(n+1),\ 1/(n+1)), since 00 lies in every one of those intervals while a real t0t \ne 0 is excluded at some index, the Archimedean property giving a natural k1k \ge 1 with 1/k<t1/k < |t| and kk being a successor n+1n+1 (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Every nonzero natural number is a successor, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field); and {0}\{0\} is not open because every bounded open interval (a,b)(a,b) with a<0<ba < 0 < b contains the point b/20b/2 \ne 0 (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded, claim 3). Complementing, R{0}\mathbb{R} \setminus \{0\} is an FσF_\sigma that is not closed, its complement {0}\{0\} not being open.

The condition that is a real restriction is the other pairing, namely that every closed set be a GδG_\delta, equivalently that every open set be an FσF_\sigma. That is not automatic in an arbitrary space, and it is exactly the second conjunct of perfect normality later on this page. It must not be confused with the two automatic inclusions above: they hold everywhere and say nothing about a space.

Agreement with the real-line notion, stated because a second notion of the same name would be a defect. FσF_\sigma and GδG_\delta subsets of R\mathbb{R} defines FσF_\sigma and GδG_\delta subsets of R\mathbb{R} by the same two displayed conditions, with "open" and "closed" read in the sense of Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen. Those two words name the same two collections of subsets of R\mathbb{R} as the usual topology of R\mathbb{R} does, and the verification is one line of unfolding. Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen calls UU open when every xUx \in U admits ε>0\varepsilon > 0 with Nε(x)UN_\varepsilon(x) \subseteq U, where Nε(x)=(xε, x+ε)N_\varepsilon(x) = (x - \varepsilon,\ x + \varepsilon) (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}); The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement calls UU open in (R,dR)(\mathbb{R}, d_{\mathbb{R}}) when every xUx \in U admits r>0r > 0 with B(x,r)UB(x,r) \subseteq U, and B(x,r)=(xr, x+r)B(x,r) = (x-r,\ x+r) by claim 2 of The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded. The two conditions are therefore the same condition word for word, so the two collections of open subsets of R\mathbb{R} are one collection, and hence so are the two collections of closed subsets, each being the complements of the other collection. The usual topology of R\mathbb{R} is the metric topology of dRd_{\mathbb{R}} (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not). Since the two definitions quantify over one collection of open sets and one collection of closed sets, a subset of R\mathbb{R} is GδG_\delta in the sense above, for R\mathbb{R} with its usual topology, if and only if it is GδG_\delta in the sense of FσF_\sigma and GδG_\delta subsets of R\mathbb{R}; and likewise for FσF_\sigma. There is one notion here, not two, and every statement proved about FσF_\sigma or GδG_\delta subsets of R\mathbb{R} elsewhere in this library may be quoted verbatim as a statement about the topological space R\mathbb{R}.

Remarks

  • The letters. FF for ferme with σ\sigma for somme, GG for Gebiet with δ\delta for Durchschnitt, as FσF_\sigma and GδG_\delta subsets of R\mathbb{R} records.

  • Neither class is closed under complementation, which is why both names are needed; and neither is a topology, an arbitrary union of GδG_\delta sets being no longer GδG_\delta in general. What is true, and all that is used on this page, is the complementation duality above together with the fact that a finite intersection of GδG_\delta sets and a finite union of FσF_\sigma sets stay in their class, by rearranging a finite array of sequences.

  • In a metric space every closed set is GδG_\delta. That is proved later on this page from the distance function, and it is the reason every metrizable space is perfectly normal. In a general space it can fail, so it is a genuine hypothesis and not a convenience.

Depends on

Used by

Dependency tree · next 3 levels

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