Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

The Dieudonne club-set function is a Borel measure

Statement

Assume ACω and put Y=[0,ω1). For a Borel set BY, define m(B)={1,B contains a club subset of ω1,0,otherwise. Then m is a probability measure on B(Y). Its extension to X=[0,ω1] given by mˉ(E)=m(EY) is a Borel probability measure.

Facts & Assumptions

Given: Y has the order topology and ACω holds.

[L1]

Countable intersections of club subsets of ω1 are club. (Countable intersections of club subsets of omega_1 are club)

Proof

technique · direct
1.1

Let D be the sets AY for which either A or YA contains a club. Two disjoint sets cannot both contain clubs, since two clubs intersect by [L1]. Complements preserve D. For a sequence (An)D, if some An contains a club then so does nAn; otherwise each complement contains a club and [L1] puts a club in the complement of the union. Thus D is a sigma-algebra.

L1
1.2

Every open UY belongs to D: if the closed complement is unbounded, it is club; if it is bounded by α, then the tail [α+1,ω1) is a club contained in U. Hence B(Y)D.

given
2.1

On D, the displayed 0-1 rule is countably additive. Indeed, among pairwise disjoint An at most one has value 1; if none does, the intersection of club subsets of their complements is club by [L1], so their union has value 0. Also m(Y)=1. Restriction EEY is a sigma-homomorphism from B(X) to B(Y), proving the assertion for mˉ.

step 1.1L1

Depends on

Used by

Dependency tree · two levels

18 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