Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-26 (gpt-6-sol)
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.

Finite probability spaces are exactly finite full-power-set probability spaces

Statement

Let Ω be a finite set.

  1. If (Ω,w) is a finite probability space in the sense of Finite probability spaces, outcome weights, events, and event probabilities, then Pw(A):=∑ω∈Aw(ω)(A⊆Ω) is a probability measure on (Ω,P(Ω)).
  2. Conversely, if P is a probability measure on (Ω,P(Ω)), then w(ω):=P({ω})(ω∈Ω) makes (Ω,w) a finite probability space and P(A)=∑ω∈Aw(ω)(A⊆Ω).

These two constructions are inverse to each other. In particular, zero-weight outcomes remain genuine outcomes in both descriptions.

Facts & Assumptions

Given: A finite set Ω.

[L1]

A finite probability space is a finite set with nonnegative weights summing to 1, every subset is an event, and event probabilities are the corresponding sub-weight sums (Finite probability spaces, outcome weights, events, and event probabilities).

[L2]

A probability measure is a measure of total mass 1 (Probability measures and probability spaces).

[L3]

On a finite sigma-algebra, the atoms partition the space, every measurable set is the union of the atoms it contains, and a measure is the sum of the atom masses over those atoms (A measure on a finite sigma-algebra is a finite weighted sum over its atoms).

Proof

technique · direct
1.1L1L2algebra

If (Ω,w) is a finite probability space, then [L1] makes every subset an event and gives the displayed formula. It is nonnegative, has Pw(∅)=0, and has Pw(Ω)=1. For a sequence of pairwise disjoint subsets (Aj)j≥0, at most ∣Ω∣ of them are nonempty. Each ω in their union occurs in exactly one Aj, so rearranging this finite sum gives Pw(⋃jAj)=∑jPw(Aj). Thus Pw is a probability measure on (Ω,P(Ω)).

1.2L2L3

Conversely, let P be a probability measure on (Ω,P(Ω)) and put w(ω)=P({ω}). Each singleton is an atom of the full power-set sigma-algebra, and every A⊆Ω is the union of the singletons it contains. Thus [L3] gives P(A)=∑ω∈AP({ω})=∑ω∈Aw(ω). Taking A=Ω yields ∑ω∈Ωw(ω)=P(Ω)=1, and nonnegativity of w comes from the measure axioms inside [L2]. So (Ω,w) is a finite probability space.

2.1step 1.1step 1.2∎

Step 1.1 constructs a full-power-set probability measure from any finite weight model, and step 1.2 recovers exactly those singleton weights from any full-power-set probability measure. Hence the two descriptions are equivalent, including the boundary case of outcomes with weight 0.

Depends on

Used by

Dependency tree · two levels

15 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