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.

Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal

Statement

Let X be a set.

  1. The intersection of every nonempty family of sigma-algebras on X is a sigma-algebra on X.
  2. For every E⊆P(X), the family ΣX(E) of The sigma-algebra generated by a family of sets is nonempty, and σX(E) is the unique smallest sigma-algebra on X containing E.

Facts & Assumptions

Given: A set X, a nonempty family S of sigma-algebras on X, and a family E⊆P(X), with ΣX(E) and σX(E) as in The sigma-algebra generated by a family of sets.

Proof

technique · direct
1.1given

Every member of S contains ∅; if A belongs to every member, then so does X∖A; and if every An belongs to every member, then so does ⋃nAn. Hence ⋂S is a sigma-algebra on X.

1.2givenconstruct

The power set P(X) is a sigma-algebra on X containing E, so P(X)∈ΣX(E) and the defining intersection for σX(E) is taken over a nonempty family.

2.1step 1.1step 1.2∎

By step 1.1, σX(E) is a sigma-algebra. Every set in E belongs to every member of ΣX(E), so E⊆σX(E); and the defining intersection is contained in every sigma-algebra containing E. Thus it is the unique smallest such sigma-algebra.

Depends on

Used by

Cited to discharge well-definedness by The sigma-algebra generated by a family of sets.

Dependency tree · two levels

2 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