Recent from talks
Nothing was collected or created yet.
Fσ set
View on WikipediaIn 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).[1]
The complement of an Fσ set is a Gδ set.[1]
Fσ is the same as in the Borel hierarchy.
Examples
[edit]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.[2]
The union of countably many Fσ sets is an Fσ set, and the intersection of finitely many Fσ sets is an Fσ set.
The set of all points in the Cartesian plane such that is rational is an Fσ set because it can be expressed as the union of all the lines passing through the origin with rational slope:
where is the set of rational numbers, which is a countable set.
See also
[edit]- Gδ set — the dual notion.
- Borel hierarchy
- P-space, any space having the property that every Fσ set is closed
References
[edit]- ^ a b Stein, Elias M.; Shakarchi, Rami (2009), Real Analysis: Measure Theory, Integration, and Hilbert Spaces, Princeton University Press, p. 23, ISBN 9781400835560.
- ^ Aliprantis, Charalambos D.; Border, Kim (2006), Infinite Dimensional Analysis: A Hitchhiker's Guide, Springer, p. 138, ISBN 9783540295877.
Fσ set
View on GrokipediaFundamentals
Definition
In a topological space , an F_\sigma set is a countable union of closed subsets of . Formally, a subset is an F_\sigma set if it can be expressed as , where each is a closed subset of .[4] The term "countable" here refers to a union over at most countably many sets, which includes finite unions as a special case (by taking the remaining to be empty for sufficiently large ).[5] Closed sets in a topological space are those whose complements are open sets.[6]Notation
The standard notation for a countable union of closed sets in a topological space is an Fσ set, where "F" stands for the French term fermé (closed) and σ symbolizes a countable union, derived from somme (sum).[1] This convention reflects the French origins of early 20th-century developments in point-set topology and descriptive set theory.[1] In mathematical literature, the notation is frequently rendered as F_σ, with σ as a subscript, particularly in printed texts and LaTeX typesetting (e.g., ). In English-language sources, these sets are termed "F-sigma sets," pronounced as "eff-sigma."[1] An alternative notation appears in some contexts of descriptive set theory, where Fσ sets correspond to the class in the Borel hierarchy (a full explanation is deferred to the Borel hierarchy section).Properties
Algebraic Properties
F_σ sets exhibit specific behaviors under set-theoretic operations, reflecting their position in the Borel hierarchy as countable unions of closed sets. The collection of F_σ sets is closed under countable unions. Suppose is a countable family of F_σ sets, where each with closed in the topological space. Then, Since is countable, this is a countable union of closed sets, hence an F_σ set.[1] The collection is also closed under finite intersections. For two F_σ sets and , where each and is closed, The intersection is closed, and the double union is countable, so is F_σ. This property extends to any finite number of F_σ sets by induction.[7] However, F_σ sets are not closed under arbitrary (possibly uncountable) unions. A counterexample arises in with the Vitali set , constructed using the axiom of choice by selecting one representative from each coset of in . The set is the union of uncountably many singletons , each of which is closed (and thus F_σ), but is not Borel measurable and therefore not an F_σ set.[8] The complement of an F_σ set is a set. If with each closed, then where each is open, yielding a countable intersection of open sets.[1]Topological Properties
In topological spaces, Fσ sets form an important subclass of the Borel σ-algebra, which is generated by the open sets. Specifically, every Fσ set, being a countable union of closed sets, belongs to the Borel σ-algebra since closed sets are Borel and the Borel σ-algebra is closed under countable unions.[9] This inclusion holds in any topological space, ensuring that Fσ sets inherit the measurability properties associated with Borel sets in contexts where a measure is defined on the Borel σ-algebra.[9] A key topological feature of certain Fσ sets relates to meagerness in the sense of the Baire category theorem. A set is meager (or of first category) if it is a countable union of nowhere dense sets, and when these nowhere dense sets are taken to be closed, the resulting set is precisely an Fσ set that is meager. Nowhere dense closed sets have empty interior, and their countable union forms an Fσ set with empty interior in complete metric spaces without isolated points, by the Baire category theorem. This characterization underscores the role of Fσ sets in distinguishing "small" subsets in terms of topological density. In metric spaces, Fσ sets exhibit additional structure related to compactness. An Fσ set is σ-compact if it can be expressed as a countable union of compact sets, which occurs when each of the closed sets in the union is compact.[10] Since compact subsets of metric spaces are closed, such Fσ sets are precisely the σ-compact subsets, providing a bridge between sequential compactness and the Fσ class.[10] Not every open set in a general topological space is an Fσ set, as demonstrated by the co-countable topology on an uncountable set X, where open sets are the empty set and complements of countable subsets. In this topology, closed sets are the countable subsets and X itself; thus, any non-empty open set, being uncountable, cannot be a countable union of countable closed sets, hence not Fσ. In contrast, every closed set is trivially an Fσ set, as it is the union of a single closed set.[4]Hierarchy and Relations
Borel Hierarchy
The Borel hierarchy provides a systematic classification of Borel sets within a topological space, constructed iteratively from the open sets through transfinite applications of countable unions and intersections. It consists of two dual sequences of classes, denoted and for countable ordinals , where comprises the open sets and the closed sets. Subsequent levels are defined recursively: for , a set belongs to if it is a countable union of sets from some with , while consists of countable intersections of sets from for . This hierarchy stratifies the Borel -algebra, which is the smallest -algebra containing the open sets, and its length is , the first uncountable ordinal, in spaces like the reals.[11][12] F sets occupy the level of this hierarchy, defined as countable unions of closed sets (i.e., sets in ). Thus, every F set can be expressed as where each is closed, and conversely, in standard settings, every set arises this way. This class includes all closed sets (as singleton unions) and extends to finite unions of closed sets, but the hierarchy's strictness ensures that not all sets reduce to lower levels. The progression continues with higher finite levels, such as , which includes F sets—countable intersections of F sets—properly containing the F class.[11][12] In Polish spaces—separable completely metrizable topological spaces—the class is precisely the collection of countable unions of closed sets, aligning exactly with F sets and facilitating effective descriptive set-theoretic analysis. The strict inclusion of levels, first established by Lebesgue in 1905 via diagonalization arguments, confirms that closed sets () form a proper subclass of F sets, while F sets are properly contained within more complex Borel classes like .[11][12]Duality with Gδ Sets
Gδ sets are defined as countable intersections of open sets in a topological space and correspond to the class in the Borel hierarchy.[13] This structure positions them as the dual counterparts to Fσ sets within the descriptive hierarchy of Borel sets. The duality between Fσ and Gδ sets arises from De Morgan's laws applied to countable operations. Specifically, the complement of an Fσ set, expressed as a countable union of closed sets where each is closed, is a Gδ set given by , with each open. Conversely, the complement of a Gδ set is an Fσ set.[14] This complementary relationship underscores their symmetric roles in topological constructions. In general, Fσ sets and Gδ sets are not equivalent classes. For instance, the set of rational numbers ℚ in the real line ℝ is an Fσ set, as it is a countable union of closed singletons, but it is not a Gδ set; if it were, its complement (the irrationals) would be Fσ, leading to a contradiction with the Baire category theorem, which asserts that ℝ cannot be a countable union of nowhere dense closed sets.[14] In complete metric spaces, zero sets of continuous real-valued functions—defined as —are precisely the closed Gδ sets.[15]Examples
In the Real Line
In the real line with the standard Euclidean topology, sets arise frequently as countable unions of closed subsets, providing intuitive illustrations of this class of sets.[1] The set of rational numbers serves as a classic example of an set that is neither open nor closed. Since is countable, enumerate its elements as ; then , where each singleton is closed in . Similarly, the set of integers is an set, as it is a countable (in fact, finite in any bounded interval) union of closed singletons, and moreover is itself closed in .[16] The Cantor set , constructed by iteratively removing middle-third open intervals from , is a canonical closed uncountable set of Lebesgue measure zero, hence an set as the union of a single closed set (itself).[17] Its complement is open, and thus both an set and a set in .[1] Half-open intervals provide another representative example of sets that are neither closed nor open. For instance, the interval , where each is closed in .[1] This construction highlights how sets can approximate open sets through exhaustion by closed subsets.In General Topological Spaces
In the discrete topology on a set , every subset is both open and closed. Consequently, every subset of is an Fσ set, as it can be expressed as the union of a single closed set—namely, itself—regardless of whether is countable or uncountable. The Sierpiński space provides a simple illustration of Fσ sets in a non-Hausdorff topology. This space consists of the set with open sets , , and , making the closed sets , , and . The Fσ sets are then the countable unions of these closed sets; since the space is finite, these coincide with the finite unions, yielding , , and . For instance, is an Fσ set as a single closed set, but the open set is not Fσ, as it cannot be obtained as such a union. In the cofinite topology on an uncountable set , the closed sets comprise all finite subsets of and itself. Thus, the Fσ sets consist of all countable subsets of (as countable unions of finite closed sets) and (as a single closed set). However, a proper uncountable subset whose complement is countably infinite—known as a proper co-countable set—is not Fσ, since it is neither countable nor equal to , and cannot be formed as a countable union of finite closed sets without including . This serves as a counterexample showing that not all uncountable subsets are Fσ in general topological spaces.Applications
In Real Analysis
In real analysis, Fσ sets play a fundamental role due to their membership in the Borel σ-algebra, which ensures they inherit key properties related to measurability and approximation. Specifically, every Fσ set in is a Borel set, as it arises from countable unions of closed sets generated from the open sets via the Borel hierarchy. Consequently, all Fσ sets are Lebesgue measurable, since the Borel σ-algebra is contained within the Lebesgue σ-algebra on . This measurability implies that Fσ sets admit well-defined Lebesgue measures, facilitating their use in integration theory and approximation arguments. A notable application involves the structure of discontinuities for real-valued functions on . For any function , the set of points of continuity forms a set, while the set of discontinuities is an Fσ set.[18] This follows from expressing as the countable union , where each is closed, with denoting the oscillation of at .[18] For regulated functions, such as those of bounded variation, the discontinuities are at most countable and thus form an Fσ set of measure zero, enhancing their analytical tractability. In , σ-compact sets—defined as countable unions of compact subsets—are precisely the Fσ sets that are σ-finite with respect to Lebesgue measure, as each compact subset has finite measure and closed topology. Such sets often arise in contexts requiring controlled growth, like supports of test functions in distribution theory, where their finite-measure components allow for effective integration bounds. However, σ-compact sets need not have finite total measure, as exemplified by itself, though they do in bounded domains or when restricted to regions of interest.[19] Lusin's theorem further underscores the utility of Fσ sets by linking measurability to near-continuity. For a Lebesgue measurable function , given , there exists a continuous function such that and agree except on an Fσ set of measure less than .[19] This Fσ set can be taken σ-compact, reflecting the theorem's proof via exhaustion of by compacta and approximation on each, thereby ensuring behaves continuously outside a controlled exceptional set of small measure.[19]In Descriptive Set Theory
In descriptive set theory, Fσ sets are studied primarily within Polish spaces, where they form an important subclass of Borel sets due to their low complexity in the Borel hierarchy. Specifically, an Fσ set in a Polish space is a set, meaning it belongs to the second level of the additive Borel hierarchy as a countable union of closed sets.[20] While Fσ sets are definable at higher levels in the projective hierarchy—namely, as sets, being both analytic and co-analytic—their primary significance lies in this Borel position, which ensures strong regularity properties without invoking projective determinacy or other axioms.[20] Fσ sets are analytic sets, or sets in the projective hierarchy, as they arise as continuous images of closed subsets of Polish spaces. In particular, each closed component of an Fσ set is the continuous image of itself (a Polish space), and the countable union structure allows embedding into a closed subset of the Baire space via a continuous surjection.[20] This places Fσ sets among the Souslin sets, which coincide with analytic sets in Polish spaces, highlighting their role in bridging Borel and projective definability. A key theorem concerning Fσ sets is the perfect set property: every uncountable Fσ subset of a Polish space contains a perfect subset, and thus has cardinality .[21] In the real line , this implies that any non-empty perfect Fσ set has the cardinality of the continuum, as perfect sets in are uncountable and embed the Cantor set.[21] Regarding relations, an Fσ relation on Polish spaces—viewed as an Fσ subset of the product space—is Borel and thus analytic. Uniformization of such relations by Borel selectors is possible in ZFC when the vertical sections are countable, via the Lusin–Novikov theorem, which guarantees a uniformization consisting of countably many Borel functions. For general Fσ relations without this section condition, Borel uniformization requires additional axioms such as the axiom of determinacy for projective sets or Martin's axiom for countable posets.[22]References
- https://proofwiki.org/wiki/F-Sigma_Sets_Closed_under_Intersection
