Borel Sets

A Borel set is simply a member of the Borel σ-algebra \mathcal{B}(\mathbb{R}). That short definition hides an enormous, well-behaved collection: because \mathcal{B}(\mathbb{R}) starts from the open sets and is closed under complement and countable unions, every set you can build from intervals by countably many of those moves is Borel.

One more layer up: Fσ and Gδ

Stacking the operations once more names two classic families. An F_{\sigma} set is a countable union of closed sets; a G_{\delta} set is a countable intersection of open sets. Both are Borel by construction, and they capture sets that are neither open nor closed — \mathbb{Q} is F_{\sigma} (a countable union of points), and the irrationals are G_{\delta}.

The rule of thumb: any set you can actually describe is Borel. Producing a set that is not Borel takes the axiom of choice and a non-constructive argument — you can prove such sets exist, but you can never point at one explicitly.