Alphabeta Math
Session-authored (Fable 5 assisted)
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.

9 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 5 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Measures and Their Basic Properties — Examples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

Assuming countable choice, counting measure is sigma-finite exactly on countable sets

Example

Assume the Axiom of Countable Choice. For a set X, counting measure on (X,P(X)) is sigma-finite if and only if X is at most countable. In particular, counting measure on R is not sigma-finite.

Facts & Assumptions

Given: A set X, its counting measure #, and the Axiom of Countable Choice.

[L1]

Counting measure assigns finite measure exactly to finite sets (Counting measure on an arbitrary set) and is a measure (Counting measure is a measure).

[L2]

Sigma-finiteness means that the whole space is a countable union of measurable finite-measure sets (Finite, sigma-finite, and semifinite measures).

[L3]

Under countable choice, a countable union of at most countable sets is at most countable (The Axiom of Countable Choice (ACω), Countable unions of at most countable sets, assuming ACω).

[L4]

Verification

technique · direct
1.1

For the forward implication, suppose counting measure on X is sigma-finite. By [L2], X=nEn with #(En)<+, so every En is finite by [L1] and X is at most countable by [L3].

givenL1L2L3
1.2

For the reverse implication when X is finite, the constant cover En=X has finite counting measure; when X is countably infinite, a bijection e:NX gives finite initial sets En={e(k):k<n} with union X. The empty set is covered by the constant empty sequence.

givenL1L2
2.1

Steps 1.1 and 1.2 prove the equivalence. Since R is uncountable by [L4], the forward implication shows that its counting measure is not sigma-finite.

step 1.1step 1.2L4
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

A Dirac probability measure concentrates all mass at one point

Example

Let x0X. The Dirac probability measure satisfies δx0(E)=1 exactly when x0E and otherwise has value 0. For measurable F, its same-ambient restriction satisfies

(δx0)F={δx0,x0F,0,x0F.

Facts & Assumptions

Given: A measurable space (X,A), a point x0X, and a measurable set F.

[L1]

The Dirac set function at x0 is a probability measure and has value 1 exactly on sets containing x0 (A Dirac set function is a probability measure).

[L2]

Restriction to F is the measure Aμ(AF) on the original sigma-algebra (The restriction of a measure to a measurable set is a measure).

Verification

technique · direct
1.1

For every measurable E, [L1] gives δx0(E)=1 if x0E and 0 otherwise; in particular its values on and X are 0 and 1.

givenL1
1.2

By [L2], (δx0)F(A)=δx0(AF). If x0F, this equals 1 exactly when x0A, so it is δx0(A); if x0F, it is always 0.

givenL1L2
2.1

Steps 1.1 and 1.2 verify the concentration and both restriction cases, including F= and F=X.

step 1.1step 1.2
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21Open item page →

The weights 2(k+1) define a probability measure on P(N)

Example

For EN, define

μ(E):=kE2(k+1)=(k=02(k+1)δk)(E).

Then μ is a probability measure on P(N). The shift by 1 is essential: because 0N, the unshifted weights 2k have total mass 2, not 1.

Facts & Assumptions

Given: The Dirac measures δk on N and the weights ck=2(k+1).

[L1]

Nonnegative countable weighted sums of measures are measures (Nonnegative scalar multiples and countable weighted sums of measures are measures); δk(E) is 1 exactly when kE and is 0 otherwise (The Dirac set function at a point); and every δk is a probability measure (A Dirac set function is a probability measure).

[L2]

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

[L3]

Natural powers have initial value r0=1 (Integer powers am), and for r<1, k=0rk=1/(1r) (For r<1, k0rk=1/(1r), and for r1 the series diverges).

Verification

technique · direct
1.1

By [L1], μ=k2(k+1)δk is a measure, and evaluating it on E gives exactly the displayed subseries because δk(E) is 1 for kE and 0 otherwise.

givenL1
1.2

The geometric-series formula with r=1/2 gives μ(N)=k=02(k+1)=(1/2)k=0(1/2)k=1.

givenL3algebra
1.3

The unshifted total is k=02k=2, whose first term at k=0 is 1; thus those weights do not define a probability measure.

givenL3algebra
2.1

Steps 1.1 and 1.2 make μ a probability measure by [L2], and step 1.3 verifies the index-zero boundary and rules out the unshifted construction.

step 1.1step 1.2step 1.3L2
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-21Open item page →

Assuming countable choice, zero on countable sets and infinity on cocountable sets is a non-semifinite measure

Example

Assume the Axiom of Countable Choice and let X be uncountable. On the sigma-algebra A of countable and cocountable subsets of X, define

μ(A):={0,A is countable,+,XA is countable.

Then μ is a measure, but it is not semifinite.

Facts & Assumptions

Given: An uncountable set X and the Axiom of Countable Choice.

[L1]

A sigma-algebra is closed under complements and countable unions (Sigma-algebras), and a measure is countably additive on disjoint measurable sequences (Measures on sigma-algebras).

[L2]

Countable means finite or countably infinite (Finite, countably infinite, countable, uncountable), and under countable choice a countable union of at most countable sets is at most countable (The Axiom of Countable Choice (ACω), Countable unions of at most countable sets, assuming ACω).

[L3]

Semifiniteness requires every positive-measure measurable set to contain a positive finite-measure measurable subset (Finite, sigma-finite, and semifinite measures).

Verification

technique · direct
1.1

The countable-cocountable family A is a sigma-algebra: complements exchange its two classes, a countable union of countable members is countable by [L2], and a union containing a cocountable member is cocountable.

givenL1L2
1.2

The whole space has measure +, while every measurable set of finite measure has measure 0; hence X contains no measurable subset of positive finite measure.

given
2.1

In a pairwise disjoint sequence from A, at most one member is cocountable. If all members are countable, their union is countable by [L2] and both sides of countable additivity are 0; if one is cocountable, the union is cocountable and both sides are +.

step 1.1L1L2
3.1

Steps 1.1 and 2.1 prove that μ is a measure, and step 1.2 violates the semifiniteness condition [L3].

step 1.1step 2.1step 1.2L3
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21 rests on unproved material (inherited)Open item page →
Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Assuming choice, the completion of the Borel Dirac measure at zero is defined on every subset of the real line

Example

Assume the Axiom of Choice. On (R,B(R)), let δ0 be the Borel Dirac measure at 0. Its completion has domain P(R) and satisfies

δ0(E)={1,0E,0,0E.

The original Borel measure space is therefore not complete.

Facts & Assumptions

Given: The real line, its Borel sigma-algebra, the point 0, and the Axiom of Choice.

[L1]

Every measure space has a unique complete extension to its completion construction under countable choice (Assuming countable choice, every measure space has a unique complete extension to its completion), and the Axiom of Choice supplies every choice function required by countable choice (The Axiom of Choice).

[L2]

The Dirac set function at 0 assigns value 1 exactly to measurable sets containing 0 and value 0 otherwise (The Dirac set function at a point); it is a probability measure (A Dirac set function is a probability measure).

[L6]

A set lies in the completion domain exactly when it is a measurable core union a subset of a measurable null set, and its completed value is the measure of that core (The completion domain and proposed completed set function of a measure space).

[L3]

The Borel sigma-algebra is generated by the open sets (The Borel sigma-algebra of a topological space), and open rays are open while their complements are closed (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen).

Verification

technique · direct
1.1

The singleton {0} is Borel because its complement is the union of the open rays (,0) and (0,+); hence Z:=R{0} is Borel and δ0(Z)=0.

givenL2L3
1.2

The binary-sequence injection [L5] gives an injection f from a set of cardinality c into R; the map Sf[S] then injects its power set into P(R). Hence [L4] gives P(R)2c>c=B(R), so some subset S of R is not Borel.

givenL4L5algebra
2.1

If 0E, then E=E with EZ is a completed representation and has completed value 0 by [L6]; if 0E, then E={0}(E{0}) with the second part contained in Z, so [L2] and [L6] give completed value 1.

step 1.1L2L6
3.1

Thus every subset of R lies in the completion and the displayed formula holds.

step 2.1
4.1

For the non-Borel set S from step 1.2, the set S{0} is still non-Borel, since otherwise adjoining the Borel singleton {0} when necessary would make S Borel; it is a subset of the Borel null set Z from step 1.1. Thus the original Borel Dirac space is not complete, while step 3.1 shows that its completion is the full power set.

step 1.1step 3.1step 1.2L1
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-21Open item page →

Borel-Cantelli for the shrinking intervals (0,2k) under a dyadic atomic measure

Example

On the Borel subsets of R, define

μ:=j=02(j+1)δ2j,Ek:=(0,2k).

Then μ(Ek)=2(k+1), so kμ(Ek)=1 and the first Borel-Cantelli lemma gives μ(lim supkEk)=0. In fact lim supkEk=.

Facts & Assumptions

Given: The dyadic atomic set function μ and intervals Ek displayed above.

[L1]

Dirac set functions are probability measures (A Dirac set function is a probability measure), and nonnegative countable weighted sums of measures are measures (Nonnegative scalar multiples and countable weighted sums of measures are measures).

[L3]

If the sum of the measures is finite, the first Borel-Cantelli lemma makes the set limsup null (The first Borel-Cantelli lemma for measures).

[L4]

The set limsup is the intersection of the tail unions (Limit superior and limit inferior of a sequence of sets), and (0,b)={x:0<x<b} (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Verification

technique · direct
1.1

By [L1], μ is a measure. For fixed k, the atom 2j lies in (0,2k) exactly when j>k, so μ(Ek)=j>k2(j+1).

givenL1L4
1.2

The intervals decrease. No x0 belongs to any of them, and for x>0, convergence 2k0 supplies k with 2kx, so xEk; hence their intersection, and therefore their limsup, is empty.

givenL2L4
2.1

The tail geometric sum in step 1.1 is 2(k+1), and therefore k=0μ(Ek)=k=02(k+1)=1. At k=0, this gives μ((0,1))=1/2.

step 1.1L2algebra
3.1

Borel-Cantelli applied using step 2.1 gives μ(lim supkEk)=0, while step 1.2 independently identifies that limsup as .

step 2.1step 1.2L3
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-21Open item page →

Counting-measure tails decrease to the empty set while every term has infinite measure

Statement refuted

The finiteness hypothesis in continuity from above cannot be deleted: a decreasing sequence may have empty intersection while all its measures remain +.

Facts & Assumptions

Given: Counting measure # on N and Ek={nN:kn}.

[L1]

Counting measure gives every infinite set value + (Counting measure on an arbitrary set) and is a measure (Counting measure is a measure).

[L2]

Continuity from above assumes that some member of the decreasing sequence has finite measure (Continuity from above when one set has finite measure).

[L3]

The natural order is defined through addition (Order on the natural numbers), natural addition is cancellative (Addition is cancellative), and each n+1 is strictly greater than n (Discreteness: σ(n) is the immediate successor).

Counterexample

technique · direct
1.1

The sequence decreases because k+1n implies kn, and E0=N.

givenL3
1.2

Every Ek is infinite, since nk+n injects N into Ek, so #(Ek)=+.

givenL1L3
1.3

The intersection is empty: a natural n does not belong to En+1.

givenL3
2.1

Hence #(kEk)=0 but infk#(Ek)=+. The hypothesis of [L2] fails at every index, exactly as required.

step 1.2step 1.3L1L2
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-21Open item page →

A free ultrafilter induces a finitely additive zero-one probability that is not countably additive

Statement refuted

A finitely additive set function of total mass 1 need not be countably additive, even when it takes only the values 0 and 1. Assuming the Axiom of Choice, a free ultrafilter on N gives such a set function.

Facts & Assumptions

Given: The Axiom of Choice and the tails Bn={kN:nk}.

[L1]

A filter base is nonempty, excludes , and is downward directed; its upward closure is the filter it generates (Filter base and the filter it generates, The upward closure of a filter base is the smallest filter containing it).

[L2]

Under the Axiom of Choice, every filter is contained in an ultrafilter (The Axiom of Choice, The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter), and an ultrafilter contains exactly one of each set and its complement (Ultrafilter, Characterisation of ultrafilters: every set or its complement).

[L3]

The natural numbers begin at 0 (The natural numbers N (von Neumann)), their order is total (Order on the natural numbers, is a linear order on N), and n+1 is the immediate successor of n (Discreteness: σ(n) is the immediate successor).

[L4]

A finitely additive nonnegative set function vanishes at the empty set and is additive on disjoint pairs (Finitely additive nonnegative set functions).

Counterexample

technique · direct
1.1

The family B={Bn:nN} is a filter base: B0=N, no tail is empty, and Bmax(m,n)BmBn. Let F=B.

givenL1L3
2.1

By [L2], extend F to an ultrafilter U. It is free: if {m}U, then Bm+1FU, so closure under intersections would put ={m}Bm+1 in the filter.

step 1.1L2L3
3.1

Define q(A)=1 when AU and q(A)=0 otherwise. Then q()=0 and q(N)=1.

step 2.1L2
4.1

If A,B are disjoint, then ABU exactly when one of A,B lies in U: the reverse implication is upward closure; for the forward implication, if AU, then AcU and (AB)Ac=B lies in U. Disjointness prevents both from lying in U. Thus q(AB)=q(A)+q(B), so q is finitely additive.

step 2.1step 3.1L2L4
4.2

Every singleton has value 0 because U is free, but their disjoint union is N and has value 1. Hence countable additivity fails.

step 2.1step 3.1L3
5.1

Steps 4.1 and 4.2 give a finitely additive zero-one probability that is not countably additive, refuting the proposed implication.

step 4.1step 4.2
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-21Open item page →

Two four-point probability measures agree on a generating family that is not a pi-system

Statement refuted

Agreement on a family that merely generates the sigma-algebra does not determine a measure. Intersection closure in the pi-system uniqueness theorem is essential.

Facts & Assumptions

Given: The four-point set X={NW,NE,SW,SE} and the family G consisting of X, the north and south rows, and the west and east columns.

[L1]

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

[L2]

The generated sigma-algebra is the smallest sigma-algebra containing the generating family (The sigma-algebra generated by a family of sets).

[L3]

A pi-system is closed under intersections (Pi-systems), and the uniqueness theorem requires agreement on a generating pi-system with a finite-measure exhaustion (Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system).

Counterexample

technique · direct
1.1

Give μ masses (1/2,0,0,1/2) at (NW,NE,SW,SE) and give ν masses (0,1/2,1/2,0). Finite summation over subsets defines probability measures on P(X).

givenL1
1.2

Intersecting rows with columns produces every singleton, so σX(G)=P(X); a singleton intersection is absent from G, so G is not a pi-system. The constant sequence X,X, is an increasing finite-measure exhaustion lying in G.

givenL1L2L3
2.1

Every row and column contains exactly one μ-atom and one ν-atom of mass 1/2, and both measures give X mass 1, so the measures agree on G.

givenstep 1.1algebra
3.1

The measures are unequal because μ({NW})=1/2 and ν({NW})=0, despite steps 2.1 and 1.2. The family satisfies the generating and finite-measure exhaustion hypotheses and violates the pi-system hypothesis of [L3].

step 1.1step 2.1step 1.2L3

Sources