Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-generatedjudge 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δ and Fσ subsets of a topological space, agreeing with the real-line notion

Definition

Let (X,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 A⊆X.

  • A is a Gδ set of X when there is a sequence (Vn)n∈N of open subsets of X with A  =  ⋂n∈NVn.
  • A is an Fσ set of X when there is a sequence (Fn)n∈N of closed subsets of X with A  =  ⋃n∈NFn.

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

The two classes are exchanged by complementation. A is Fσ in X if and only if X∖A is Gδ in X. If A=⋃nFn with each Fn closed then X∖A=⋂n(X∖Fn) by De Morgan and each X∖Fn 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δ and every closed set is Fσ, by the constant sequence Vn:=A, respectively Fn:=A. Neither converse holds, and R with its usual topology already refutes both. The singleton {0} is a Gδ that is not open: it is ⋂n∈N(−1/(n+1), 1/(n+1)), since 0 lies in every one of those intervals while a real t≠0 is excluded at some index, the Archimedean property giving a natural k≥1 with 1/k<∣t∣ and k being a successor n+1 (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, Every nonzero natural number is a successor, The canonical natural ι(n)=n⋅1F of a field); and {0} is not open because every bounded open interval (a,b) with a<0<b contains the point b/2≠0 (Intervals of R: the nine order-convex forms, nondegeneracy, and length, The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded, claim 3). Complementing, R∖{0} is an Fσ that is not closed, its complement {0} not being open.

The condition that is a real restriction is the other pairing, namely that every closed set be a Gδ, equivalently that every open set be an Fσ. 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σ and Gδ subsets of R defines Fσ and Gδ subsets of R by the same two displayed conditions, with "open" and "closed" read in the sense of Open subset of 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 as the usual topology of R does, and the verification is one line of unfolding. Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen calls U open when every x∈U admits ε>0 with Nε(x)⊆U, where Nε(x)=(x−ε, x+ε) (The ε-neighbourhood and the punctured ε-neighbourhood of a point of 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 U open in (R,dR) when every x∈U admits r>0 with B(x,r)⊆U, and B(x,r)=(x−r, x+r) by claim 2 of The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (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 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 is the metric topology of dR (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 is Gδ in the sense above, for R with its usual topology, if and only if it is Gδ in the sense of Fσ and Gδ subsets of R; and likewise for Fσ. There is one notion here, not two, and every statement proved about Fσ or Gδ subsets of R elsewhere in this library may be quoted verbatim as a statement about the topological space R.

Remarks

  • The letters. F for ferme with σ for somme, G for Gebiet with δ for Durchschnitt, as Fσ and Gδ subsets of 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δ sets being no longer Gδ 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δ sets and a finite union of Fσ sets stay in their class, by rearranging a finite array of sequences.

  • In a metric space every closed set is Gδ. 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 · two levels

55 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources