Alphabeta Math
Session-authored (Fable 5 assisted)
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.

15 results · all verified · 14 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Sigma Algebras and Borel Sets — Examples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The trivial and discrete sigma-algebras are the two extremes

Example

For every set X, the trivial sigma-algebra is {,X} and the discrete sigma-algebra is P(X). Every sigma-algebra on X lies between them under inclusion. If X=, the two extremes coincide.

Facts & Assumptions

Given: A set X.

[L1]

A sigma-algebra contains the empty set and is closed under complements and countable unions (Sigma-algebras).

Verification

technique · direct
1.1

The family {,X} satisfies the axioms in [L1]; when X=, it is the one-member family {}.

L1algebra
1.2

The power set P(X) satisfies the axioms in [L1].

L1algebra
2.1

Every sigma-algebra contains and hence X, and every one is a subfamily of P(X). Thus the two verified families are the extremes, coinciding when X=.

step 1.1step 1.2L1
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Assuming countable choice, the countable-cocountable family is a sigma-algebra

Example

Assume ACω. For a set X, define

C:={AX:A is at most countable or XA is at most countable}.

Then C is the countable-cocountable sigma-algebra on X.

Facts & Assumptions

Given: The Axiom of Countable Choice and a set X.

[L1]

Under countable choice, a countable union of at most countable sets is at most countable (Countable unions of at most countable sets, assuming ACω, The Axiom of Countable Choice (ACω)).

[L2]

At most countable means finite or countably infinite (Finite, countably infinite, countable, uncountable).

[L3]

Every subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable).

[L4]

A sigma-algebra contains the empty set and is closed under complements and countable unions (Sigma-algebras).

Verification

technique · direct
1.1

The empty set is at most countable. Complementation exchanges the two alternatives in the definition of C, so C contains and is complement-closed.

L2algebra
1.2

Let (An) lie in C. If every An is at most countable, [L1] makes nAn at most countable. If some Aj is cocountable, then XnAnXAj is at most countable by [L3]. In either case the union lies in C.

L1L2L3
2.1

Steps 1.1 and 1.2 verify all axioms in [L4], so C is a sigma-algebra on X.

step 1.1step 1.2L4
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

A partition into k nonempty blocks generates a sigma-algebra with 2^k members

Example

If P0,,Pk1 are the nonempty blocks of a partition of X, then

σX({P0,,Pk1})={iSPi:Sk}

and this sigma-algebra has 2k members.

Facts & Assumptions

Given: A natural number k and a partition (Pi)i<k of X into nonempty blocks.

[L1]

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

technique · direct
1.1

Applying [L1] to the finite index set k gives the displayed sigma-algebra and a bijection from P(k) to it.

L1
2.1

The finite power set P(k) has 2k members. For k=0, necessarily X= and there is one union; for k=1, the two unions are and X.

step 1.1algebra
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

F-sigma and G-delta subsets of the real line are Borel

Example

Every Fσ subset and every Gδ subset of R is Borel.

Facts & Assumptions

Given: A subset AR.

[L1]

An Fσ set is a countable union of closed subsets of R, and a Gδ set is a countable intersection of open subsets (Fσ and Gδ subsets of R).

[L2]

The Borel sigma-algebra is generated by the open sets (The Borel sigma-algebra of a topological space).

Verification

technique · direct
1.1

If A is Fσ, [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.

L1L2
2.1

If A is Gδ, [L1] writes it as a countable intersection of open, hence Borel, sets; [L3] makes the intersection Borel.

L1L2L3
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The rationals are Borel and F-sigma but neither open nor closed nor G-delta

Example

The canonical copy QR of the rationals in R is Fσ and Borel, but it is neither open nor closed nor Gδ.

Facts & Assumptions

Given: The canonical subset QRR.

[L3]

Fσ means a countable union of closed sets (Fσ and Gδ subsets of R), and the Borel sigma-algebra contains every closed set and is closed under countable unions (The Borel sigma-algebra of a topological space).

Verification

technique · direct
1.1

By [L1] and [L3], QR is a countable union of closed Borel sets and is therefore Borel and Fσ.

L1L3
1.2

Density of the complement in [L2] prevents QR from containing a nonempty open interval, so it is not open; density of QR and its being a proper subset prevent it from being closed.

L2
2.1

The final claim, that QR is not Gδ, is exactly the third conclusion of [L1].

L1
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-17Open item page →

Closed left rays form a pi-system generating the Borel sigma-algebra on the real line

Example

The family P:={(,a]:aR} is a pi-system and σR(P)=B(R).

Facts & Assumptions

Given: The family P of closed left rays.

[L1]

A pi-system is a nonempty family closed under binary intersections (Pi-systems).

[L2]

The open right rays (a,) generate B(R) (Seven generating families for the Borel sigma-algebra on the real line).

Verification

technique · direct
1.1

The family is nonempty, and (,a](,b]=(,min{a,b}], so it is a pi-system by [L1].

L1algebra
2.1

Complementation exchanges (,a] with (a,). A generated sigma-algebra is complement-closed, so [L2] implies that the closed left rays generate B(R).

step 1.1L2algebra
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The Borel sigma-algebra of the Cantor set is the trace of the real Borel sigma-algebra

Example

For the Cantor middle-thirds set CR with its subspace topology,

B(C)={BC:BB(R)}.

Facts & Assumptions

Given: The Cantor middle-thirds set C with the subspace topology inherited from R.

[L1]

The Cantor middle-thirds set is C=nNCn[0,1] (The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds).

[L2]

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

technique · direct
1.1

The description in [L1] makes C a specified subset of R, equipped here with the subspace topology.

L1
2.1

The subspace theorem [L2] applies to this inclusion CR.

step 1.1L2
3.1

Therefore [L2] gives B(C)={BC:BB(R)}, as claimed.

step 2.1L2
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

FALSE: every lambda-system is closed under finite intersections

Statement

Every lambda-system is closed under finite intersections.

Facts & Assumptions

Given: The set X:={1,2,3,4} and the family D consisting of , X, and all two-element subsets of X.

[L1]

A lambda-system contains X, is closed under relative differences, and is closed under increasing countable unions (Lambda-systems, or Dynkin systems).

[L2]

A pi-system is closed under binary intersections (Pi-systems).

Refutation

technique · counterexample
1.1

The family D contains X and is closed under complements. Apart from X, its proper containments are AX for a two-element set A, and every corresponding difference remains in D; every increasing sequence in the finite family stabilizes. Thus D is a lambda-system by [L1].

L1algebra
2.1

Both {1,2} and {1,3} lie in D, but their intersection {1} does not. Hence D is not a pi-system by [L2], refuting the statement.

step 1.1L2
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

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 X:=N and Mn:=P(n), where n={0,,n1} and in particular M0={}.

[L1]

A monotone class is closed under increasing countable unions and decreasing countable intersections (Monotone classes of sets).

Refutation

technique · counterexample
1.1

Every increasing or decreasing sequence in the finite family Mn stabilizes, so its union or intersection belongs to Mn. Thus each Mn is a monotone class, and MnMn+1.

L1algebra
2.1

The union nMn is the family of finite subsets of N. The increasing sequence 012 lies in this union but has union N, which is not finite. Hence the union is not a monotone class.

step 1.1L1
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

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 X:=N, the tail Tn:={kN:kn}, and the partition Pn:={{0},,{n1},Tn}, with P0={N}.

[L1]

A sigma-algebra is closed under complements and countable unions (Sigma-algebras).

Refutation

technique · counterexample
1.1

Let An be the family of unions of blocks of Pn. Complements and countable unions correspond to complements and unions of block-index sets, so each An is a sigma-algebra; splitting Tn into {n} and Tn+1 gives AnAn+1.

L1algebra
2.1

A member of some An is finite if it omits Tn and cofinite if it contains Tn. Conversely every finite or cofinite subset belongs to some An. Hence nAn is the finite-cofinite algebra.

step 1.1algebra
3.1

Every singleton {2j} 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].

step 2.1L1
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

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 X:={1,2,3,4}, A:={1,2}, and B:={1,3}.

[L1]

A sigma-algebra is closed under finite intersections (Sigma-algebras).

Refutation

technique · counterexample
1.1

The families A:={,X,A,XA} and B:={,X,B,XB} each satisfy the sigma-algebra axioms.

L1algebra
2.1

Their union contains A and B but not AB={1}. It therefore fails the closure in [L1] and is not a sigma-algebra.

step 1.1L1
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

FALSE: every monotone class is an algebra

Statement

Every monotone class on X is an algebra of subsets of X.

Facts & Assumptions

Given: The set X:={1,2} and the family M:={,{1},X}.

[L1]

A monotone class is closed under increasing countable unions and decreasing countable intersections (Monotone classes of sets).

[L2]

An algebra is closed under complements relative to its ambient set (Algebras of subsets).

Refutation

technique · counterexample
1.1

Every increasing or decreasing sequence in the finite chain {1}X stabilizes, so its union or intersection belongs to M. Thus M is a monotone class by [L1].

L1algebra
2.1

The complement X{1}={2} is absent from M, so [L2] shows that M is not an algebra.

step 1.1L2
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

FALSE: every subset of the real line is Borel

Statement

Assume the Axiom of Choice. Every subset of R is Borel.

Facts & Assumptions

Given: The Axiom of Choice.

[L2]

For every set A, there is no surjection AP(A), so A is strictly smaller than its power set (Cantor's theorem: AP(A)).

[L3]

Every sigma-algebra contains the empty set (Sigma-algebras).

[L5]

Refutation

technique · contradiction
1.1

Suppose, for contradiction, that every subset of R is Borel, so P(R)=B(R).

assume-contra
1.2

The Cantor set satisfies CR, and [L4] with [L5] gives C={0,1}N=20=P(N)=c.

L4L5
2.1

Every subset of C is a subset of R, so P(C)P(R). Step 1.1 makes that inclusion land in B(R), whose cardinality is c by [L1]; hence P(C)c=C by step 1.2.

step 1.1step 1.2L1
3.1

By [L2], C<P(C), contradicting step 2.1. Therefore some subset of R is not Borel. The cardinality argument selects no particular subset, but [L3] shows that the omitted subset cannot be empty.

step 1.2step 2.1L2L3discharge-contradiction
False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

FALSE: a countably infinite sigma-algebra exists

Statement

There exists a countably infinite sigma-algebra.

Facts & Assumptions

Given: A putative countably infinite sigma-algebra.

[L1]

No sigma-algebra is countably infinite (No sigma-algebra is countably infinite).

Refutation

technique · contradiction
1.1

Suppose, for contradiction, that a countably infinite sigma-algebra exists.

assume-contra
2.1

This contradicts [L1], so the asserted object does not exist.

step 1.1L1discharge-contradiction
RemarkRemark: Literature-sourcedProof: Not suppliedjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17 not proved hereOpen item page →
Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

The Borel hierarchy on the real line never stabilizes at a countable stage

Statement

For an uncountable Polish space X and every countable ordinal 1α<ω1, Marker, Corollary 2.38, proves Σα0(X)Πα0(X) and, in particular, Σα0(X)Δα+10(X). Applied to X=R, 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 statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17 rests on unproved materialOpen item page →
Rests on 1 statement not proved in this library. Every dependency marked below is recorded with a citation but is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

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 R 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 R formed by alternating countable unions and countable intersections from the open and closed sets.

[L1]

For every ordinal 1α<ω1, the additive and multiplicative Borel classes on R 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

technique · contradiction
1.1

Suppose, for contradiction, that every Borel set belongs to the displayed fixed finite-stage class.

assume-contra
2.1

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.

step 1.1algebra
3.1

The stabilization in step 2.1 contradicts [L1]. Hence the asserted finite description does not contain every Borel subset of R.

step 2.1 L1discharge-contradiction

Sources