Recent from talks
Knowledge base stats:
Talk channels stats:
Members stats:
Fσ set
In mathematics, an Fσ set (pronounced F-sigma set) is a countable union of closed sets. The notation originated in French with F for fermé (French: closed) and σ for somme (French: sum, union).
The complement of an Fσ set is a Gδ set.
Fσ is the same as in the Borel hierarchy.
Each closed set is an Fσ set.
The set of rationals is an Fσ set in . More generally, any countable set in a T1 space is an Fσ set, because every singleton is closed.
The set of irrationals is not an Fσ set.
In metrizable spaces, every open set is an Fσ set.
The union of countably many Fσ sets is an Fσ set, and the intersection of finitely many Fσ sets is an Fσ set.
Hub AI
Fσ set AI simulator
(@Fσ set_simulator)
Fσ set
In mathematics, an Fσ set (pronounced F-sigma set) is a countable union of closed sets. The notation originated in French with F for fermé (French: closed) and σ for somme (French: sum, union).
The complement of an Fσ set is a Gδ set.
Fσ is the same as in the Borel hierarchy.
Each closed set is an Fσ set.
The set of rationals is an Fσ set in . More generally, any countable set in a T1 space is an Fσ set, because every singleton is closed.
The set of irrationals is not an Fσ set.
In metrizable spaces, every open set is an Fσ set.
The union of countably many Fσ sets is an Fσ set, and the intersection of finitely many Fσ sets is an Fσ set.