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.
Sigma Algebras and Borel Sets — Examples
1 · Prerequisites
- Cardinal Arithmetic, Cofinality and the Alephs
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Limits of Real Functions
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Set Theory Beyond Choice: Recorded, Not Proved Here
- Sigma Algebras and Borel Sets
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
2 · Summary
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The trivial and discrete sigma-algebras are the two extremes
Example
For every set , the trivial sigma-algebra is and the discrete sigma-algebra is . Every sigma-algebra on lies between them under inclusion. If , the two extremes coincide.
Facts & Assumptions
Given: A set .
A sigma-algebra contains the empty set and is closed under complements and countable unions (Sigma-algebras).
Verification
The family satisfies the axioms in [L1]; when , it is the one-member family .
The power set satisfies the axioms in [L1].
Every sigma-algebra contains and hence , and every one is a subfamily of . Thus the two verified families are the extremes, coinciding when .
Assuming countable choice, the countable-cocountable family is a sigma-algebra
Example
Assume . For a set , define
Then is the countable-cocountable sigma-algebra on .
Facts & Assumptions
Given: The Axiom of Countable Choice and a set .
Under countable choice, a countable union of at most countable sets is at most countable (Countable unions of at most countable sets, assuming , The Axiom of Countable Choice ()).
At most countable means finite or countably infinite (Finite, countably infinite, countable, uncountable).
Every subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable).
A sigma-algebra contains the empty set and is closed under complements and countable unions (Sigma-algebras).
Verification
The empty set is at most countable. Complementation exchanges the two alternatives in the definition of , so contains and is complement-closed.
Let lie in . If every is at most countable, [L1] makes at most countable. If some is cocountable, then is at most countable by [L3]. In either case the union lies in .
Steps 1.1 and 1.2 verify all axioms in [L4], so is a sigma-algebra on .
A partition into k nonempty blocks generates a sigma-algebra with 2^k members
Example
If are the nonempty blocks of a partition of , then
and this sigma-algebra has members.
Facts & Assumptions
Given: A natural number and a partition of into nonempty blocks.
A countable partition generates exactly the unions of its blocks, and the subset-to-union map is a bijection (A countable partition generates exactly the unions of its blocks, and the resulting sigma-algebra is countable exactly for a finite partition).
Verification
Applying [L1] to the finite index set gives the displayed sigma-algebra and a bijection from to it.
The finite power set has members. For , necessarily and there is one union; for , the two unions are and .
F-sigma and G-delta subsets of the real line are Borel
Example
Every subset and every subset of is Borel.
Facts & Assumptions
Given: A subset .
An set is a countable union of closed subsets of , and a set is a countable intersection of open subsets ( and subsets of ).
The Borel sigma-algebra is generated by the open sets (The Borel sigma-algebra of a topological space).
Sigma-algebras are closed under countable intersections (Sigma-algebras are closed under countable intersections, differences, symmetric differences, and set limits).
Verification
If is , [L1] writes it as a countable union of closed sets. Closed sets are complements of the open generators in [L2], so they and their countable union are Borel.
If is , [L1] writes it as a countable intersection of open, hence Borel, sets; [L3] makes the intersection Borel.
The rationals are Borel and F-sigma but neither open nor closed nor G-delta
Example
The canonical copy of the rationals in is and Borel, but it is neither open nor closed nor .
Facts & Assumptions
Given: The canonical subset .
The set is and is not ( is , meager and not , while the irrationals are , residual and not ).
Both and its complement are dense in (Both and are dense in , and every nonempty open subset of is uncountable).
means a countable union of closed sets ( and subsets of ), and the Borel sigma-algebra contains every closed set and is closed under countable unions (The Borel sigma-algebra of a topological space).
Verification
By [L1] and [L3], is a countable union of closed Borel sets and is therefore Borel and .
Density of the complement in [L2] prevents from containing a nonempty open interval, so it is not open; density of and its being a proper subset prevent it from being closed.
The final claim, that is not , is exactly the third conclusion of [L1].
Closed left rays form a pi-system generating the Borel sigma-algebra on the real line
Example
The family is a pi-system and .
Facts & Assumptions
Given: The family of closed left rays.
A pi-system is a nonempty family closed under binary intersections (Pi-systems).
The open right rays generate (Seven generating families for the Borel sigma-algebra on the real line).
Verification
The family is nonempty, and , so it is a pi-system by [L1].
Complementation exchanges with . A generated sigma-algebra is complement-closed, so [L2] implies that the closed left rays generate .
The Borel sigma-algebra of the Cantor set is the trace of the real Borel sigma-algebra
Example
For the Cantor middle-thirds set with its subspace topology,
Facts & Assumptions
Given: The Cantor middle-thirds set with the subspace topology inherited from .
The Cantor middle-thirds set is (The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds).
The Borel sigma-algebra of a subspace is the trace of the ambient Borel sigma-algebra (The Borel sigma-algebra of a subspace is the trace of the ambient Borel sigma-algebra).
Verification
The description in [L1] makes a specified subset of , equipped here with the subspace topology.
The subspace theorem [L2] applies to this inclusion .
Therefore [L2] gives , as claimed.
FALSE: every lambda-system is closed under finite intersections
Statement
Every lambda-system is closed under finite intersections.
Facts & Assumptions
Given: The set and the family consisting of , , and all two-element subsets of .
A lambda-system contains , is closed under relative differences, and is closed under increasing countable unions (Lambda-systems, or Dynkin systems).
A pi-system is closed under binary intersections (Pi-systems).
Refutation
The family contains and is closed under complements. Apart from , its proper containments are for a two-element set , and every corresponding difference remains in ; every increasing sequence in the finite family stabilizes. Thus is a lambda-system by [L1].
Both and lie in , but their intersection does not. Hence is not a pi-system by [L2], refuting the statement.
FALSE: the union of an increasing sequence of monotone classes is a monotone class
Statement
The union of every increasing sequence of monotone classes on one ambient set is a monotone class.
Facts & Assumptions
Given: The ambient set and , where and in particular .
A monotone class is closed under increasing countable unions and decreasing countable intersections (Monotone classes of sets).
Refutation
Every increasing or decreasing sequence in the finite family stabilizes, so its union or intersection belongs to . Thus each is a monotone class, and .
The union is the family of finite subsets of . The increasing sequence lies in this union but has union , which is not finite. Hence the union is not a monotone class.
FALSE: the union of an increasing sequence of sigma-algebras is a sigma-algebra
Statement
The union of every increasing sequence of sigma-algebras on one ambient set is a sigma-algebra.
Facts & Assumptions
Given: The ambient set , the tail , and the partition , with .
A sigma-algebra is closed under complements and countable unions (Sigma-algebras).
Refutation
Let be the family of unions of blocks of . Complements and countable unions correspond to complements and unions of block-index sets, so each is a sigma-algebra; splitting into and gives .
A member of some is finite if it omits and cofinite if it contains . Conversely every finite or cofinite subset belongs to some . Hence is the finite-cofinite algebra.
Every singleton lies in the union, but their countable union is the set of even naturals, which is neither finite nor cofinite and so is absent by step 2.1. This violates [L1].
FALSE: the union of two sigma-algebras on one set is a sigma-algebra
Statement
The union of any two sigma-algebras on the same set is a sigma-algebra.
Facts & Assumptions
Given: The set , , and .
A sigma-algebra is closed under finite intersections (Sigma-algebras).
Refutation
The families and each satisfy the sigma-algebra axioms.
Their union contains and but not . It therefore fails the closure in [L1] and is not a sigma-algebra.
FALSE: every monotone class is an algebra
Statement
Every monotone class on is an algebra of subsets of .
Facts & Assumptions
Given: The set and the family .
A monotone class is closed under increasing countable unions and decreasing countable intersections (Monotone classes of sets).
An algebra is closed under complements relative to its ambient set (Algebras of subsets).
Refutation
Every increasing or decreasing sequence in the finite chain stabilizes, so its union or intersection belongs to . Thus is a monotone class by [L1].
The complement is absent from , so [L2] shows that is not an algebra.
FALSE: every subset of the real line is Borel
Statement
Assume the Axiom of Choice. Every subset of is Borel.
Facts & Assumptions
Given: The Axiom of Choice.
Under the Axiom of Choice, (Assuming the Axiom of Choice, the Borel sigma-algebra on R^n has cardinality continuum for n at least one).
For every set , there is no surjection , so is strictly smaller than its power set (Cantor's theorem: ).
Every sigma-algebra contains the empty set (Sigma-algebras).
The map is a bijection from , the set of sequences with values in , onto the Cantor set (The Cantor set is exactly the set of with every , and this gives a bijection with , The Cantor middle-thirds set as the intersection of the sets obtained by removing open middle thirds).
Under the Axiom of Choice, for every set (Assuming the Axiom of Choice, , and Cantor's theorem in cardinal form: ), and is the cardinality of the set of functions from to (Cardinal sum , product and exponentiation , and why they are written apart from the ordinal operations).
Refutation
Suppose, for contradiction, that every subset of is Borel, so .
The Cantor set satisfies , and [L4] with [L5] gives .
Every subset of is a subset of , so . Step 1.1 makes that inclusion land in , whose cardinality is by [L1]; hence by step 1.2.
By [L2], , contradicting step 2.1. Therefore some subset of is not Borel. The cardinality argument selects no particular subset, but [L3] shows that the omitted subset cannot be empty.
FALSE: a countably infinite sigma-algebra exists
Statement
There exists a countably infinite sigma-algebra.
Facts & Assumptions
Given: A putative countably infinite sigma-algebra.
No sigma-algebra is countably infinite (No sigma-algebra is countably infinite).
Refutation
Suppose, for contradiction, that a countably infinite sigma-algebra exists.
This contradicts [L1], so the asserted object does not exist.
The Borel hierarchy on the real line never stabilizes at a countable stage
Statement
For an uncountable Polish space and every countable ordinal , Marker, Corollary 2.38, proves and, in particular, . Applied to , this says that alternating countable unions and countable intersections does not stabilize at any countable stage.
The strictness proof uses universal Borel sets and diagonalisation. Those descriptive-set-theoretic constructions are not developed here, so this result is recorded with its source rather than presented as a local theorem.
FALSE: every Borel subset of the real line is a countable union of countable intersections of open and closed sets
Statement
Every Borel subset of belongs to the class obtained by taking countable intersections of open and closed sets and then countable unions of those intersections.
Facts & Assumptions
Given: The Borel hierarchy on formed by alternating countable unions and countable intersections from the open and closed sets.
For every ordinal , the additive and multiplicative Borel classes on differ, so the Borel hierarchy does not stabilize at any countable stage (The Borel hierarchy on the real line never stabilizes at a countable stage ‡).
Refutation
Suppose, for contradiction, that every Borel set belongs to the displayed fixed finite-stage class.
That class would then equal the Borel sigma-algebra. Since the Borel sigma-algebra is already closed under complements, countable unions, and countable intersections, every further stage would add no set, so the hierarchy would stabilize at that countable stage.
The stabilization in step 2.1 contradicts [L1]. Hence the asserted finite description does not contain every Borel subset of .
Sources
Standard references
Recommended treatments; not extraction sources.
- R. F. Bass, Real Analysis for Graduate Students, version 5.0, Example 2.2
- T. Tao, An Introduction to Measure Theory, Exercise 1.4.10
- R. F. Bass, Real Analysis for Graduate Students, version 5.0, Example 2.3
- R. F. Bass, Real Analysis for Graduate Students, version 5.0, Examples 2.4-2.6
- T. Tao, An Introduction to Measure Theory, Definition 1.4.16
- R. F. Bass, Real Analysis for Graduate Students, version 5.0, Proposition 2.8
- T. Tao, An Introduction to Measure Theory, Exercise 1.4.12
- A. Dembo, Probability Theory lecture notes, Proposition 1.1.37
- R. F. Bass, Real Analysis for Graduate Students, version 5.0, Exercise 2.4
- R. F. Bass, Real Analysis for Graduate Students, version 5.0, Exercise 2.3
- R. F. Bass, Real Analysis for Graduate Students, version 5.0, Exercise 2.2
- R. F. Bass, Real Analysis for Graduate Students, version 5.0, Exercise 2.1
- T. Tao, An Introduction to Measure Theory, Exercise 1.4.16 and Remark 1.4.18
- R. F. Bass, Real Analysis for Graduate Students, version 5.0, Exercise 2.8
- D. Marker, Descriptive Set Theory, Section 2, Corollary 2.38
- M. Christ, Math 202B Lecture 1, Comment on the Borel hierarchy