Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-17
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.

A countable partition generates exactly the unions of its blocks, and the resulting sigma-algebra is countable exactly for a finite partition

Statement

Let (Pi)i∈I be an at most countable partition of X: its blocks are nonempty and pairwise disjoint, and their union is X. Then

σX({Pi:i∈I})={⋃i∈SPi:S⊆I}.

The map S↦⋃i∈SPi is a bijection from P(I) onto this sigma-algebra. If I has k members, the sigma-algebra has 2k members, including k=0 when X=∅. The generated sigma-algebra is at most countable if and only if the partition is finite.

Facts & Assumptions

Given: An at most countable partition (Pi)i∈I of X.

[L1]

A generated sigma-algebra is the smallest sigma-algebra containing its generators (Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal).

[L2]

At most countable means finite or countably infinite (Finite, countably infinite, countable, uncountable), and a sigma-algebra is closed under countable unions (Sigma-algebras).

[L3]

A set is not equinumerous with its power set (Cantor's theorem: A≺P(A)), and injections both ways imply equinumerosity (The Schröder-Bernstein theorem).

[L4]

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

Proof

technique · direct
1.1givenalgebra

Let U:={⋃i∈SPi:S⊆I}. The empty union is empty; the complement of the union indexed by S is the union indexed by I∖S; and countable unions correspond to unions of the indexing subsets. Thus U is a sigma-algebra containing every block.

2.1step 1.1L1L2L4

By [L1], σX({Pi:i∈I})⊆U. Conversely, every S⊆I is at most countable by [L4], so ⋃i∈SPi is a countable union of generators and belongs to the generated sigma-algebra by [L2]. Hence equality holds.

3.1step 2.1construct

Pairwise disjointness and nonemptiness make S↦⋃i∈SPi injective, and step 2.1 makes it surjective. For ∣I∣=k<∞, its domain has 2k members; when k=0, the partition is possible exactly for X=∅ and the sigma-algebra is {∅}.

4.1step 3.1L2L3∎

If I is countably infinite and the generated sigma-algebra were at most countable, step 3.1 would inject P(I) into N. Since I≈N, [L3] would then force I≈P(I), contradicting Cantor's theorem. Together with the finite case of step 3.1, this proves both directions of the final equivalence.

Depends on

Used by

Dependency tree · two levels

22 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources