Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 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.

An algebra closed under countable disjoint unions is a sigma-algebra

Statement

Let A be an algebra of subsets of X. If the union of every pairwise disjoint sequence in A belongs to A, then A is a sigma-algebra on X.

Facts & Assumptions

Given: An algebra A on X with the stated closure under countable disjoint unions, and a sequence (An)n∈N in A.

[L1]

An algebra is closed under complements and finite unions (Algebras of subsets).

[L2]

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

Proof

technique · direct
1.1L1algebra

For n∈N put Bn:=An∖⋃k<nAk. The union with k<n is finite and is empty when n=0, so [L1] gives Bn∈A. The sets Bn are pairwise disjoint and ⋃nBn=⋃nAn.

2.1step 1.1givenL2∎

The assumed disjoint-union closure applied to (Bn) gives ⋃nAn∈A. Thus A has the countable-union axiom in [L2] and is a sigma-algebra.

Depends on

Used by

Dependency tree · one level

2 results within one dependency step 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