Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-27
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.

Fσ and Gδ subsets of R

Definition

Let A⊆R, with open and closed sets as in Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen.

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

The letters are the traditional ones: F for fermé with σ for somme, G for Gebiet with δ for Durchschnitt.

The two classes are exchanged by complementation. A is Fσ if and only if R∖A is Gδ. If A=⋃nFn with each Fn closed, then R∖A=⋂n(R∖Fn) by De Morgan, and each R∖Fn is open by the definition of closedness (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen); the converse is the same computation read backwards, using that the complement of an open set is closed, which is again Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen.

Every closed set is Fσ and every open set is Gδ, by the constant sequence Fn:=A, respectively Vn:=A. As with Nowhere dense, meager (first category), residual, and second category subsets of R, an at most countable family (Finite, countably infinite, countable, uncountable) may always be presented as a sequence: a finite list F0,…,Fm of closed sets is extended by Fn:=Fm for n>m, and a finite list of open sets likewise, so nothing is lost by indexing over N.

Remarks

Depends on

Used by

Dependency tree · two levels

15 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